scholarly journals Connected coverage with rapid forwarding in energy harvesting wireless sensor networks for critical rare events

2021 ◽  
Author(s):  
◽  
David C. Harrison

<p>To ensure event detection and subsequent rapid forwarding of notification messages, wireless sensor networks deployed to detect critically important rarely occurring events must maintain both sensing coverage and low latency network connectivity at all times.  Maintaining coverage for extended periods is relatively straight forward as passive sensing components tend to consume little energy. Maintenance of network connectivity, however, requires sensing devices constantly supply power to their transceivers, significantly reducing the longevity of the sensor network.  Energy harvesting can extend the operational life of sensing devices with always on transceivers, potentially to the point where they can operate year round. In addition, over populating the sensing area with more devices than are required to provide complete sensing cover introduces the possibility of self-organisation where sensing devices agree amongst themselves which will remain active and which will be allowed to sleep.  Few algorithms have been proposed to address both coverage and forwarding; those that do are either unconcerned with rapid propagation or have not been optimised to handle the constant changes in topology observed in duty cycling networks.  This thesis first analyses the energy consumption profiles of commercially available wireless sensing devices then presents mechanisms by which these devices can both maintain sensing coverage and rapidly forward event detection messages delayed only by the inherent latencies found in wireless multi-hop networks. These individual contributions form the basis of a combined algorithm for Coverage Preservation with Rapid Forwarding (CPRF).  Through evaluations including live deployment, CPRF is shown to deliver perfect coverage maintenance and low latency message propagation whilst allowing stored-charge conservation via collaborative duty cycling in energy harvesting networks.</p>

2021 ◽  
Author(s):  
◽  
David C. Harrison

<p>To ensure event detection and subsequent rapid forwarding of notification messages, wireless sensor networks deployed to detect critically important rarely occurring events must maintain both sensing coverage and low latency network connectivity at all times.  Maintaining coverage for extended periods is relatively straight forward as passive sensing components tend to consume little energy. Maintenance of network connectivity, however, requires sensing devices constantly supply power to their transceivers, significantly reducing the longevity of the sensor network.  Energy harvesting can extend the operational life of sensing devices with always on transceivers, potentially to the point where they can operate year round. In addition, over populating the sensing area with more devices than are required to provide complete sensing cover introduces the possibility of self-organisation where sensing devices agree amongst themselves which will remain active and which will be allowed to sleep.  Few algorithms have been proposed to address both coverage and forwarding; those that do are either unconcerned with rapid propagation or have not been optimised to handle the constant changes in topology observed in duty cycling networks.  This thesis first analyses the energy consumption profiles of commercially available wireless sensing devices then presents mechanisms by which these devices can both maintain sensing coverage and rapidly forward event detection messages delayed only by the inherent latencies found in wireless multi-hop networks. These individual contributions form the basis of a combined algorithm for Coverage Preservation with Rapid Forwarding (CPRF).  Through evaluations including live deployment, CPRF is shown to deliver perfect coverage maintenance and low latency message propagation whilst allowing stored-charge conservation via collaborative duty cycling in energy harvesting networks.</p>


Author(s):  
Habib M. Ammari

In this chapter, we study duty-cycling to achieve both k-coverage and connectivity in highly dense deployed wireless sensor networks, where each location in a convex sensor field (or simply field) is covered by at least k active sensors while maintaining connectivity between all active sensors. Indeed, the limited battery power of the sensors and the difficulty of replacing and/or recharging batteries on the sensors in hostile environments require that the sensors be deployed with high density in order to extend the network lifetime. Also, the sensed data originated from source sensors (or simply sources) should be able to reach a central gathering node, called the sink, for further analysis and processing. Thus, network connectivity should be guaranteed so sources can be connected to the sink via multiple communication paths. Finally, wireless sensor networks suffer from scarce energy resources. A more practical deployment strategy requires that all the sensors be duty-cycled to save energy. With duty-cycling, sensors can be turned on or off according to some scheduling protocol, thus reducing the number of active sensors required for k-coverage and helping all sensors deplete their energy as slowly and uniformly as possible. We also extend our discussion to connected k-coverage with mobile sensors as well as connected k-coverage in a three-dimensional deployment area. Furthermore, we discuss the applicability of our protocols to heterogeneous wireless sensor networks.


2021 ◽  
Vol 14 (13) ◽  
Author(s):  
Mahendran Sivananaintha Perumal ◽  
Braveen Manimozhi ◽  
Hareesha Dandamudi ◽  
Vijendra Babu Durairaj ◽  
Arunnehru Jawaharlalnehru ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document