Voronoi Based Area Coverage Optimization for Directional Sensor Networks

Li, Jing; Wang, Ruchuan; Huang, Haiping; Sun, Lijuan

doi:10.1109/isecs.2009.116

Cited by 38 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, in [23], the area coverage problem in directional sensor networks through rotatable orientation for each sensor is investigated. The authors propose the optimal coverage in directional sensor networks (OCDSN) problem, aiming to maximize coverage area while activating as few sensors as possible.…”

Section: Related Workmentioning

confidence: 99%

Resource Aware Sensor-to-Actor Allocation Framework for WSANs Based on Voronoi Cells Theory

2017

View full text Add to dashboard Cite

Wireless sensor and actor networks (WSANs) have emerged as a promising research field and have been applied in a wide variety of application domains due to their capability of environment monitoring, event data processing, and decision-making by aiming at performing appropriate actions interacting with the environment. Coordination mechanisms among nodes and actors are a critical research challenge pertaining to the optimum allocation of sensors to a particular actor. Although efforts related to the node-to-actor coordination problem have been presented in the current literature, there is a significant oversight regarding critical characteristics such as the heterogeneous capabilities of the actors as well as the network's heterogeneous density. In this paper, aiming to address such shortcomings, we introduce the term Actor Service Capacity, which indicates the ability of an actor to serve a particular number of nodes. We also propose a novel node-to-actor coordination algorithm, based on the Voronoi tessellation, aiming to guarantee that the number of nodes, allocated to each actor, will not exceed its capabilities. Furthermore, a set of selection techniques are proposed so as to be applied on the coordination framework. Respective evaluation analysis offers useful conclusions and highlights the importance and the advantages of the proposed algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Resource Aware Sensor-to-Actor Allocation Framework for WSANs Based on Voronoi Cells Theory

2017

View full text Add to dashboard Cite

show abstract

“…Several solutions [72,39,49,40,23,18] and algorithms have been proposed to enlarge the covered area with a minimization of the occlusion and overlapping. The study in [39] is one of the pioneer works on coverage enhancement in DSNs.…”

Section: Area-based Coverage Solutionsmentioning

confidence: 99%

“…In [18], the authors name the above mentioned coverage problem as optimal coverage problem in directional sensor networks (OCDSN). Like other studies, they aim at covering maximal area while activating as few sensors as possible.…”

Section: Area-based Coverage Solutionsmentioning

confidence: 99%

On coverage issues in directional sensor networks: A survey

2011

View full text Add to dashboard Cite

“…We used 2-voronoi method [4] to remove the redundant nodes and find out a minimum number of active nodes that will cover the whole deployed area with the assumption that the communication radius is at least twice of the sensing radius [5], so that the complete coverage satisfies the connectivity among active nodes. The rest of the paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Incremental Model for Complete Area Coverage in Wireless Sensor Networks

Sethi

Dash

Lenka

et al. 2015

2015 International Conference on Computational Intelligence and Networks

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) consists of hundreds of sensor nodes, which are tiny, low cost, low power radio devices. These nodes are dedicated to perform certain functions such as sensing the environment, collecting the sensed data from the surrounding area, processing those data and send the information to the observer. One of the major challenges in WSN is to cover the desired area which is used to determine the quality of service(QoS) of the Network. Before the sensor nodes get deployed, one may want to know, among hundreds of nodes, which are the nodes that need to active so that every point in the deployment area is covered by at least one of the active sensor nodes and the total number of active nodes should be minimum. We call this requirement as complete area coverage. One of the important aspects of complete area coverage algorithm is to remove the redundant nodes and then check for the sensing coverage of the desired area. Various algorithms have already been proposed for the complete area coverage. In this paper, we use an incremental model using the 2-voronoi method to remove the redundant nodes and find the minimum number of nodes to cover the desired area. Extensive simulation studies of the proposed work have been carried out using Matlab simulator. The simulation studies clearly show that the number of active nodes to cover the whole intended area is quite less.

show abstract

Voronoi Based Area Coverage Optimization for Directional Sensor Networks

Cited by 38 publications

References 14 publications

Resource Aware Sensor-to-Actor Allocation Framework for WSANs Based on Voronoi Cells Theory

Resource Aware Sensor-to-Actor Allocation Framework for WSANs Based on Voronoi Cells Theory

On coverage issues in directional sensor networks: A survey

Incremental Model for Complete Area Coverage in Wireless Sensor Networks

Contact Info

Product

Resources

About