On Periodic Node Deployment in Wireless Sensor Networks: A Statistical Analysis

Rapid progress made in the field of sensor technology, wireless communication, and computer networks in recent past, led to the development of wireless Ad-hoc sensor networks, consisting of small, low-cost sensors, which can monitor wide and remote areas with precision and liveliness unseen to the date without the intervention of a human operator. This work comes up with a stochastic model for periodic sensor-deployment (in face of their limited amount of battery-life) to maintain a minimal node-connectivity in wireless sensor networks. The node deployment cannot be modeled by using results from conventional continuous birth-death process, since new nodes are added to the network in bursts, i.e. the birth process is not continuous in practical situations. We analyze the periodic node deployment process using discrete birth-continuous death process and obtain two important statistical measures of the existing number of nodes in the network, namely the mean and variance. We show that the above mentioned sequences of mean and variances always converge to finite steady state values, thus ensuring the stability of the system. We also develop a cost function for the process of periodic deployment of sensor nodes and minimize it to find the optimal time ({\tau}) and optimum number of re-deployment (q) for maintaining minimum connectivity in the network.

[1]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[2]  Dharma P. Agrawal,et al.  Coverage and Lifetime Optimization of Wireless Sensor Networks with Gaussian Distribution , 2008, IEEE Transactions on Mobile Computing.

[3]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[4]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[5]  10 emerging technologies that will change your world , 2004, IEEE Engineering Management Review.

[6]  Edgar H. Callaway,et al.  Wireless Sensor Networks: Architectures and Protocols , 2003 .

[7]  C. Siva Ram Murthy,et al.  Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[8]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[10]  Tom Burr,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 2001, Technometrics.

[11]  Lan Lin,et al.  Optimal coverage paths in ad-hoc sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[12]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[13]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[15]  Stan Lipovetsky,et al.  Probability, Statistics, and Stochastic Processes , 2006, Technometrics.

[16]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[17]  Yu-Chee Tseng,et al.  Location Tracking in a Wireless Sensor Network by Mobile Agents and Its Data Fusion Strategies , 2003, Comput. J..

[18]  Sajal K. Das,et al.  Routing Correlated Data with Fusion Cost in Wireless Sensor Networks , 2006, IEEE Transactions on Mobile Computing.

[19]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[20]  Katsuhiko Ogata,et al.  Discrete-time control systems (2nd ed.) , 1995 .

[21]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[22]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[25]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[26]  Xiaohua Jia,et al.  Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.

[27]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[28]  Zoran Bojkovic,et al.  A survey on wireless sensor networks deployment , 2008 .

[29]  Lionel M. Ni,et al.  Power-aware node deployment in wireless sensor networks , 2006, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06).

[30]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[31]  Davide Brunelli,et al.  Wireless Sensor Networks , 2012, Lecture Notes in Computer Science.

[32]  Baoyu Zheng,et al.  A novel mathematical model for coverage in wireless sensor network , 2006 .

[33]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[34]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[35]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[36]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .