Probability Based Algorithms for Guaranteeing the Stability of Rechargeable Wireless Sensor Networks

摘要

The lifetime of a wireless sensor network can be prolonged by introducing mobile sink to balance the energy consumption in data gathering. However, it doesn't solve the bottleneck of energy consumption and network will still fail inevitably. The option of recharging a relay opens up new possibilities for prolonging the network lifetime even maintaining the network living forever by recharging a sensor using a mobile sink when necessary. In this paper, we investigate the strategies for the mobile sink to recharge the wireless network in order to maintain the stability of network achieving the requirement of network system. In our approach, we develop an efficient algorithm to divide the sensor network into a number of domains (independent communication areas which are consisted by a cluster of neighbored sensors) in the first stage. Then we iteratively calculate the maximum lifetime of each domain. When travelling and arriving at a domain, mobile sink determines whether or not recharge it according to the probability model. The lifetime of a domain is estimated based on the residual energy of each sensor within the domain using our energy routing algorithm. We also propose a probability model for the mobile sink to determine whether to recharge a domain or not. The effectiveness of our approach has been verified by extensive simulation results.