Maximizing lifetime for k-barrier coverage in energy harvesting wireless sensor networks

Abstract

Wireless Sensor Networks (WSNs) can be used effectively to form barriers that monitor strips of land for applicaions such as homeland security and critical infrastructure protection. Sensors are highly constrained in their energy usage, so when they harvest energy, it is neccessary that this energy be used effectively. When WSNs are used as barriers, they are typically deployed for extended period of time, so it is of great importance that the network has a long lifetime. The lifetime problem for WSNs has been studied extensively. In this paper we give an exact solution to the problem of achieving maximum lifetime for the application of k-barrier coverage in energy harvesting wireless sensor networks.

A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks

“…However, from a practical point of view, the entire WSNs cannot purely rely on nodes equipped with EH devices due to the high cost and owing to [109], where the optimal location of the cluster head was determined using a specific cluster scheme conceived for lifetime optimization. De-Witt et al [124] incorporated energy harvesting into the barrier coverage problem investigated in [14] and developed a certain solution to the problem of maximizing the lifetime of k-barrier coverage in EH-WSNs, while Martinez et al [125] incorporated the energy harvesting capability and the energy storage capacity limits into the associated routing decisions. Nonetheless, Tabassum et al [119] argues that achieving the required QoS for battery-constrained wireless applications can be challenging due to battery failures, which can be compensated by energy harvesting from ambient sources.…”

Optimizing Maximum Monitoring Frequency and Guaranteeing Target Coverage and Connectivity in Energy Harvesting Wireless Sensor Networks

“…Liang et al [15] proposed an adaptive rate allocation algorithm for monitoring quality maximization, but this algorithm is believed that all targets can be covered by sensor nodes. In [16], DeWitt and Shi focused on the k-barrier coverage in an EH-WSH and proposed an algorithm for achieving maximum lifetime. Moreover, Li et al [17] proposed an algorithm for satisfying a certain area coverage in an EH-WSH, which extends to network lifetime by scheduling active sensor nodes.…”

“…A sensor node in an energy harvesting WSN (EH-WSN) can be powered perpetually. erefore, the coverage problems in EH-WSNs tend to concentrate on quality-aware target coverage, but not the extension of network lifetime for the coverage problem [15][16][17][18][19][20][21][22][23][24][25][26][27]. In these algorithms, the optimization objective mainly focuses on coverage utility, including maximizing the number of covered targets or time slots of sensor nodes covering targets.…”

Target Coverage in Wireless Sensor Networks with Probabilistic Sensors

“…The coverage problem concerns how well a sensor network is monitored or tracked by sensors, and it is one of the fundamental issues in sensor networks. Three categories of the coverage problem exist in the literature based on the coverage subject [ 5 , 6 ]: target coverage (e.g., [ 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 ]), area coverage (e.g., [ 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 ]) and barrier coverage (e.g., [ 29 , 30 , 31 , 32 , 33 , 34 ]).…”