Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range

He, Chenlong; Feng, Zuren; Ren, Zhigang

doi:10.3390/s18020446

Cited by 12 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the number of sensor nodes increases, the coverage of WSNs increases significantly. Our Mobile-Coverage adjustment scheme has better performance than the competitive methods in [16], [17], [13], [51]. As the number of iterations continuously increases, the coverage of our method gradually increases as well.…”

Section: Methodsmentioning

confidence: 95%

“…In this subsection, we focus on evaluating the computational performance of our Mobile-Coverage adjustment scheme in terms of the minimum number of mobile sensor nodes, coverage and energy consumption of WSNs. We conducted several sets of experiments proposed in [13] and [51] to compare with our scheme. The experiments were carried out on a Lenovo Laptop with 3.4GHZ Intel i5-7500 CPU and 24G DDR4 memory.…”

Section: Methodsmentioning

confidence: 99%

“…Voronoi graph [51] is a domain partition diagram based on Delaunay triangle, which is composed of sensor nodes connected by perpendicular lines in a limited area. The Euclidean distance is used as the standard to divide the plane.…”

Section: B Voronoi Graphmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

Huang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In this paper, a novel Mobile-Coverage scheme is proposed to improve the coverage and lifetime of hybrid sensor networks, and thus the target region can be completely covered with minimum number of mobile sensor nodes and the energy consumption can be reduced in hybrid sensor networks at the same time. Our scheme is applied to a hybrid network comprising of both static and mobile sensor nodes, which are randomly deployed in a rectangle area. We derived the minimum number of sensor nodes as well as the mobile nodes required to cover the target region completely. Compared to the existing works, the minimum number of mobile sensor nodes required in this paper is significantly smaller, which implies that the movement distance and energy consumption of mobile nodes in our scheme is reduced. Moreover, we proved that the construction of our scheme based on the Virtual Force and Voronoi Graph (VFVG) is correct, and then derived the optimal trade-off between the coverage of the target region and energy consumption of mobile nodes. Our scheme can achieve the maximum coverage which is 98.7% by minimum number of mobile sensor nodes. Meanwhile, a connectivity rate of 76.84% can also be achieved by our connectivity evaluation method. Finally, a new topology construction algorithm-Topology Construction and Maintenance based on Trust (TCMT) is created to further increase the lifetime of the sensor network. We also evaluated the performance of our scheme in terms of coverage and lifetime, and carried out extensive experiments to compare the coverage and energy consumption in our scheme and several previous schemes. The experimental results showed that our scheme is more efficient than the previous schemes simulated. INDEX TERMS Topology construction and maintain, Minimum numbers of mobile sensor, Voronoi graph, Virtual force, TCMT.

show abstract

Section: Methodsmentioning

confidence: 95%

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

Huang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…We consider a control strategy constrained by the information detected by the sensor (a communication network is not needed) and, thus, based on the Voronoi partitioning of the area within the sensing range (limited Voronoi diagram). An algorithm studied to perform efficiently this computation is described in [13].…”

Section: Introductionmentioning

confidence: 99%

On Coverage Control for Limited Range Multi-Robot Systems

Pratissoli

Capelli

2022

2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

View full text Add to dashboard Cite

This paper presents a coverage based control algorithm to coordinate a group of autonomous robots. Most of the solutions presented in the literature rely on an exact Voronoi partitioning, whose computation requires complete knowledge of the environment to be covered. This can be achieved only by robots with unlimited sensing capabilities, or through communication among robots in a limited sensing scenario. To overcome these limitations, we present a distributed control strategy to cover an unknown environment with a group of robots with limited sensing capabilities and in the absence of reliable communication. The control law is based on a limited Voronoi partitioning of the sensing area, and we demonstrate that the group of robots can optimally cover the environment using only information that is locally detected (without communication). The proposed method is validated by means of simulations and experiments carried out on a group of mobile robots.

show abstract

“…The last reasons imply that the accuracy and rate of convergence of range-based iterative algorithms for multi-hop network localization are highly dependent of topologies; therefore, robust approaches must be applied in order to minimize errors in position estimates. Moreover, it is well known that the mathematical formulation of the localization scheme typically requires solving a nonlinear and non-convex optimization problem [ 21 , 22 , 23 , 24 , 25 ].…”

Section: Introductionmentioning

confidence: 99%

A Weighted and Distributed Algorithm for Range-Based Multi-Hop Localization Using a Newton Method

Diaz-Roman

Mederos

Sifuentes

et al. 2021

Sensors

View full text Add to dashboard Cite

Wireless sensor networks are used in many location-dependent applications. The location of sensor nodes is commonly carried out in a distributed way for energy saving and network robustness, where the handling of these characteristics is still a great challenge. It is very desirable that distributed algorithms invest as few iterations as possible with the highest accuracy on position estimates. This research proposes a range-based and robust localization method, derived from the Newton scheme, that can be applied over isotropic and anisotropic networks in presence of outliers in the pair-wise distance measurements. The algorithm minimizes the error of position estimates using a hop-weighted function and a scaling factor that allows a significant improvement on position estimates in only few iterations. Simulations demonstrate that our proposed algorithm outperforms other similar algorithms under anisotropic networks.

show abstract

Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range

Cited by 12 publications

References 25 publications

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

On Coverage Control for Limited Range Multi-Robot Systems

A Weighted and Distributed Algorithm for Range-Based Multi-Hop Localization Using a Newton Method

Contact Info

Product

Resources

About