Connected k-Coverage Protocols for Densely Deployed Wireless Sensor Networks

2010 ◽  
pp. 209-234
Author(s):  
Habib M. Ammari
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Active Sensors ◽  
Duty Cycling ◽  
Sensor Field ◽  
Save Energy ◽  
Hostile Environments

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.

An Efficient Sleeping Scheduling for Save Energy Consumption in Wireless Sensor Networks

2013 ◽  
Vol 756-759 ◽  
pp. 2288-2293
Author(s):  
Shu Guang Jia ◽  
Li Peng Lu ◽  
Ling Dong Su ◽  
Gui Lan Xing ◽  
Ming Yue Zhai
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Smart Grid ◽  
Round Robin ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Active Sensors ◽  
Save Energy ◽  
Battery Energy

Smart grid has become one hot topic at home and abroad in recent years. Wireless Sensor Networks (WSNs) has applied to lots of fields of smart grid, such as monitoring and controlling. We should ensure that there are enough active sensors to satisfy the service request. But, the sensor nodes have limited battery energy, so, how to reduce energy consumption in WSNs is a key challenging. Based on this problem, we propose a sleeping scheduling model. In this model, firstly, the sensor nodes round robin is used to let as little as possible active nodes while all the targets in the power grid are monitored; Secondly, for removing the redundant active nodes, the sensor nodes round robin is further optimized. Simulation result indicates that this sleep mechanism can save the energy consumption of every sensor node.

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

2021 ◽  
Author(s):  
◽  
David C. Harrison
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Harvesting ◽  
Event Detection ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Low Latency ◽  
Duty Cycling ◽  
Sensing Coverage ◽  
Combined Algorithm

<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>

scholarly journals Flexible Energy Efficient Density Control on Wireless Sensor Networks

2007 ◽  
Vol 3 (1) ◽  
pp. 5-21
Author(s):  
Yi Shang ◽  
Hongchi Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimality Conditions ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Active Sensors ◽  
Coverage Gap ◽  
Density Control ◽  
Save Energy ◽  
The Ideal

In dense wireless sensor networks, density control is an important technique for prolonging the network's lifetime while providing sufficient sensing coverage. In this paper, we develop three new density control protocols by considering the tradeoff between energy usage and coverage. The first one, Non-Overlapping Density Control, aims at maximizing coverage while avoiding the overlap of sensing areas of active sensors. For the ideal case, a set of optimality conditions are derived to select sensors such that the sensing space is covered systematically to maximize the usage of each sensor and minimize the coverage gap. Based on theoretical optimality conditions, we develop a distributed protocol that can be efficiently implemented in large sensor networks. Next, we present a protocol called Non-Overlapping Density Control Based on Distances that does not require location information of the nodes. This protocol is more flexible and easier to implement than existing location-based methods. Finally, we present a new range-adjustable protocol called Non-Overlapping Density Control for Adjustable Sensing Ranges. It allows heterogenous sensing ranges for different sensors to save energy consumption. Extensive simulation shows promising results of the new protocols.

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

2021 ◽  
Author(s):  
◽  
David C. Harrison
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Harvesting ◽  
Event Detection ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Low Latency ◽  
Duty Cycling ◽  
Sensing Coverage ◽  
Combined Algorithm

<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>

An Energy-Balance Based Distributed Topology Control Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 490-495 ◽  
pp. 1392-1396 ◽  
Author(s):  
Chu Hang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Algorithm ◽  
Path Loss ◽  
Network Connectivity ◽  
Premature Death ◽  
Residual Energy ◽  
Wireless Sensor

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.

scholarly journals Intelligent On-Demand Connectivity Restoration for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Khalid Mahmood ◽  
Muhammad Amir Khan ◽  
Mahmood ul Hassan ◽  
Ansar Munir Shah ◽  
Shahzad Ali ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Connectivity ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
On Demand ◽  
Connectivity Restoration ◽  
Restoration Technique ◽  
Near Future

Wireless sensor networks are envisioned to play a very important role in the Internet of Things in near future and therefore the challenges associated with wireless sensor networks have attracted researchers from all around the globe. A common issue which is well studied is how to restore network connectivity in case of failure of single or multiple nodes. Energy being a scarce resource in sensor networks drives all the proposed solutions to connectivity restoration to be energy efficient. In this paper we introduce an intelligent on-demand connectivity restoration technique for wireless sensor networks to address the connectivity restoration problem, where nodes utilize their transmission range to ensure the connectivity and the replacement of failed nodes with their redundant nodes. The proposed technique helps us to keep track of system topology and can respond to node failures effectively. Thus our system can better handle the issue of node failure by introducing less overhead on sensor node, more efficient energy utilization, better coverage, and connectivity without moving the sensor nodes.

Sign in / Sign up

Export Citation Format

Share Document