Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control and fairness for many-to-one routing in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 5th international conference on Information processing in sensor networks
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks
Pervasive and Mobile Computing
DSSP: A Dynamic Sleep Scheduling Protocol for Prolonging the Lifetime of Wireless Sensor Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
IEEE Transactions on Mobile Computing
Efficient data propagation strategies in wireless sensor networks using a single mobile sink
Computer Communications
Exploiting sink movement for energy-efficient load-balancing in wireless sensor networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
On the critical phase transition time of wireless multi-hop networks with random failures
Proceedings of the 14th ACM international conference on Mobile computing and networking
Maximizing network lifetime based on transmission range adjustment in wireless sensor networks
Computer Communications
On the lifetime of large scale sensor networks
Computer Communications
Distributed routing in wireless sensor networks using energy welfare metric
Information Sciences: an International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Top-k query evaluation in sensor networks under query response time constraint
Information Sciences: an International Journal
IEEE Transactions on Parallel and Distributed Systems
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of Network and Computer Applications
Hi-index | 0.07 |
The demand for maximum network lifetime in many mission-critical applications of wireless sensor networks motivates the great significance to deploy as few sensors as possible to achieve the expected network performance. In this paper, we first characterize the energy consumption of wireless sensor networks with adjustable transmission ranges through theoretical analysis. Based on this result, we propose a deployment strategy with T as the required minimum network lifetime. We come up with three interventions: (A) in order to achieve an evenly balanced energy consumption among all nodes, the node density in different areas of the network should be a continuous varying function of the distance from the sink; (B) if there are insufficient nodes to achieve a balanced energy consumption over the whole network, our proposed node deployment strategy can be used to achieve the required lifetime threshold T with minimum number of nodes; and (C) when there are sufficient nodes to ensure the network connectivity and coverage with the node density of @t, we design an algorithm to identify the optimal transmission radius r and the corresponding achievable maximum network lifetime. Our conclusions are verified by extensive simulation results.