Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target
IEEE Transactions on Parallel and Distributed Systems
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Development of a long-lived, real-time automatic weather station based on WSN
Proceedings of the 6th ACM conference on Embedded network sensor systems
Optimal clock synchronization in networks
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Computers & Mathematics with Applications
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
Sample Assignment for Ensuring Sensing Quality and Balancing Energy in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
Shortest hop multipath algorithm for wireless sensor networks
Computers & Mathematics with Applications
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.09 |
The quality of a wireless sensor network application is often measured by the number of samples collected in a period of time. Examples include debris flow monitoring systems, flood warning system and so on. In many situations, the number of collected samples has to be larger than a specific bound in order to reconstruct the monitored phenomenon. Considering that the network transmission consumes most energy in a wireless sensor network, the paths to forward collected samples back to the gateway have to be carefully chosen to avoid dead nodes and therefore network disconnection. In this paper, we investigate an optimization problem of balancing the energy consumption among sensor nodes while ensuring quality constraints. We prove that this problem is NP-hard and present a distributed algorithm. Our experiment results show that our method outperforms existing algorithms in balancing energy consumption of sensor nodes.