Network lifetime aware area coverage for clustered directional sensor networks

Abstract

The problem of field or area coverage in Directional Sensor Networks (DSNs) presents huge research challenges including appropriate selection of sensors with their active sensing directions in an energy-efficient way. Existing solutions permit to execute coverage enhancement algorithms in each individual sensor nodes, leading to high communication and computation overheads, loss of energy and reduced accuracy. In this paper, we have proposed a novel network lifetime aware area coverage solution, NLAC, for a clustered DSN, where distributed cluster heads (CHs) have the responsibility of determining the number of active member nodes and their sensing directions. The CHs minimizes the overlapping coverage area and energy consumption by switching more nodes in sleep state. The proposed NLAC system is fully distributed and it exploits single-hop neighborhood information only. Results from extensive simulations, show that NLAC system offers better performance in terms of covering area and networklife.

Split and Schedule (SS): A Progressive Lifetime for Barrier Coverage using Relay Clusters in Wireless Sensor Network

“…Coverage has been one of the important limitations in directional sensor network and thus a higher percentage ratio of coverage is expected.  Network Lifetime [18]: The network lifetime is defined as the difference from the time at which the first node dies out of energy to the deployed time of the nodes in network.  End-to-end delay: The delay comprises of the transmission, waiting and touring type of delays for the transmitting a designated packet through a network from source to sink [19].…”

Collaborative neighbor discovery in directional wireless sensor networks: algorithm and analysis

“…The problem of neighbor discovery in directional sensor network not only is more challenging than that in its omnidirectional counterpart but also requires complete redesign and implementation. The key fact behind this requirement is that the directional nodes have limited width of communication sectors, and thus, two nearby nodes must steer their communication sectors to each other for a successful communication [5][6][7]. Efficient strategies need to be employed so that a pair of neighbor nodes eventually beamform their antennas to each other at a certain time instance and can discover themselves.…”

Area coverage for clustered directional sensor networks using Voronoi diagram

“…This problem is proved to be NP hard [2] in literature and greedy or heuristic solutions are proposed. Dividing the sensing sectors of each node into small grids the authors in [3], [4] try to minimize the number of active sensing nodes by reducing the overlapping area using virtual force [4] and centroid location [3] among nodes.…”

“…Moreover centralized solutions are difficult to obtain because it requires the overall scenario and on the other hand, distributed solutions are difficult to implement. Our previous work [2] proposes algorithms for area coverage using the advantages of clustering in an energy efficient way. However, the work did not considered the advantages of dividing the whole area into some cells and thus cannot provide a better solutions.…”

“…In literature, many area coverage algorithms have been proposed [2], [7], [3]. However, to the best of our knowledge, only a very few works utilize the benefits of clustering in the environment using the characteristics of Voronoi-diagram when selecting active nodes along with their sensing directions to solve area coverage problem for DSNs.…”