GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Training a wireless sensor network
Mobile Networks and Applications
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks
Pervasive and Mobile Computing
Avoiding Energy Holes in Wireless Sensor Networks with Nonuniform Node Distribution
IEEE Transactions on Parallel and Distributed Systems
An optimal data propagation algorithm for maximizing the lifespan of sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
IEEE Communications Magazine
Wireless sensor networks: leveraging the virtual infrastructure
IEEE Network: The Magazine of Global Internetworking
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In a wireless sensor network (WSN), the energy hole problem is a key factor which affects the lifetime of the networks. In a WSN with circular multi-hop deployment (modeled as concentric coronas), sensors in one corona have the same transmission range termed as the transmission range of this corona, and different coronas have different transmission ranges, which compose a list termed as transmission range list. Based on our improved corona model with levels, we propose that a right transmission range of each corona is the decision factor for optimizing network lifetime after nodes deployment. We prove that searching optimal transmission range lists is a multi-objective optimization problem (MOP), which is NP hard. We propose a centralized algorithm and a distributed algorithm to build the transmission range list for different node distributions. The two algorithms can not only reduce the searching complexity but also obtain results approximated to the optimal solution. Furthermore, the simulation results indicate that the network lifetime under our solution approximates to that ensured by the optimal list. Compared with existing algorithms, our solution can make the network lifetime be extended more than two times longer.