Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Protocols for data propagation in wireless sensor networks
Wireless communications systems and networks
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
IEEE Transactions on Mobile Computing
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Coverage protocols for detecting fully sponsored sensors in wireless sensor networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Efficient algorithm for placing a given number of base stations to cover a convex region
Journal of Parallel and Distributed Computing
A performance evaluation of a coverage compensation based algorithm for wireless sensor networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
A biologically inspired sensor wakeup control method for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Solving a 2-covered path problem with variable radii for wireless sensor networks
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hi-index | 0.00 |
How well a large wireless sensor network can be monitored or tracked while keeping long live is a challenging problem known as the energy aware coverage preserving. Several coverage solutions have been introduced based on node scheduling and quality coverage. Node scheduling based solutions usually rely on global clock synchronization and/or time delays to resolve conflicts when determining what nodes should be turned-off to save energy. If these time delays cannot be calculated accurately blind areas might emerge jeopardizing the network coverage quality. Other challenges to node scheduling based solutions include finding optimal wakeup strategies that avoid waking up more nodes than necessary; and keeping connectivity and coverage of the network while optimizing the number of nodes. This paper extends the coverage calculation method proposed by Tian and Georganas, referred here as C-PNSS scheme, and describes a novel distributed solution based on local information exchange without the uncertainty of self-schedule algorithms. A Decision algorithm and a new node wakeup scheme were devised to overcome existing problems in actual schemes. We implement our optimal coverage-preserving scheme (OCoPS) as an extension of LEACH. A set of simulation experiments was performed to evaluate OCoPS performance when compared to LEACH and C-PNSS schemes. The results indicate that our solution outperforms C-PNSS by over 20% on network lifetime and by over 25% on network lifetime when the coverage rate is higher than 80%. LEACH is outperformed by nearly over five times on network lifetime. The experimental results also show that our coverage scheme based on our extended coverage calculation method effectively limits the on-duty node number when compared to both LEACH and C-PNSS.