Affiliation:
1. Victoria University of Wellington, Wellington, New Zealand
Abstract
Wireless sensor networks for rarely occurring critical events must maintain sensing coverage and low-latency network connectivity to ensure event detection and subsequent rapid propagation of notification messages. Few algorithms have been proposed that address both coverage and forwarding and those that do are either unconcerned with rapid propagation or are not optimised to handle the constant changes in topology observed in duty-cycled networks. This article proposes an algorithm for
Coverage Preservation with Rapid Forwarding
(CPRF). The algorithm is shown to deliver perfect coverage maintenance and low-latency guaranteed message propagation whilst allowing stored-charge conservation via collaborative duty cycling in energy-harvesting networks. Favourable comparisons are made against established and recently proposed algorithms in both sparse planned and dense random distributions. Further, an implementation for commercially available wireless sensing devices is evaluated for detection and notification of damage to highway light poles caused by vortex shedding.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献