2011/09/14 by Abhishek Sinha, Swagatam Das, Sinha, Abhishek +3
Computer Science · #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #cs.NI
paper · pdf · doi:10.48550/arxiv.1109.3150
Submitted for review in Journal of Network and Systems Management
arxiv created 2011/09/14 · openalex publication_date 2011/09/14 · arxiv updated 2011/09/15 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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 (τ) and optimum number of re-deployment (q) for maintaining minimum connectivity in the network.