Error Analysis and Kernel Density Approach of Scheduling Sleeping Nodes in Cluster-Based Wireless Sensor Networks

Energy consumption is an important research topic in wireless sensor networks. Putting sensor nodes to sleep is one of the most popular ways to save energy in battery-powered sensor nodes. Many existing research studies on sleeping techniques are based on preknowledge of deployment of sensor nodes, e.g., a known probability distribution of sensor nodes in a target-sensing field. Thus, whether a scheduling-sleeping scheme has good performance mostly depends on preknowledge of the deployment of sensor nodes. In this paper, we first show the discrepancy of system performance metrics, including energy consumption and network lifetime, based on inaccurate preknowledge of the deployment of sensor nodes in a cluster-based sensor network. Through analytical studies, we conclude that the discrepancy is very large and cannot be neglected. We hence propose a distribution-free approach to study energy consumption. In our approach, no assumption of the probability distribution of deployment of sensor nodes is needed. The proposed approach has yielded a good estimation of network energy consumption. Furthermore, previous studies normally assume that battery energy levels of sensor nodes are the same. However, in a real network, battery quality is different, and the energy in each sensor node is a random variable. We provide a mathematical approximation and a standard deviation study for energy consumption, as well as a more in-depth study for network lifetime under random batter energy.

[1]  Yunghsiang Sam Han,et al.  Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks , 2005, Mob. Networks Appl..

[2]  Zhi-Quan Luo,et al.  A Distributed Algorithm with Linear Convergence for Maximum Lifetime Routing in Wireless Sensor Networks , 2005 .

[3]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[4]  Yang Xiao,et al.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks , 2022 .

[5]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[6]  Miodrag Potkonjak,et al.  Location Discovery in Ad-hoc Wireless Sensor Networks , 2004 .

[7]  Deborah Estrin,et al.  Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks , 2000 .

[8]  Yang Xiao,et al.  Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks , 2005, Mob. Networks Appl..

[9]  J. Franklin,et al.  The elements of statistical learning: data mining, inference and prediction , 2005 .

[10]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[11]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

[12]  Z. Schuss.  Theory and Applications of Stochastic Processes , 2010 .

[13]  Mohamed F. Younis,et al.  Energy-aware routing in cluster-based sensor networks , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[14]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[15]  Yi Pan,et al.  On optimizing energy consumption for mobile handsets , 2004, IEEE Transactions on Vehicular Technology.

[16]  Yang Xiao,et al.  A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks , 2006, Mob. Networks Appl..