A distributed algorithm for Ad-hoc network partitioning based on Voronoi Tessellation

This paper presents a data sink node election algorithm for multi-hop Wireless Sensor Networks (WSNs) with multiple data sink nodes. For energy-saving considerations, these nodes should be evenly (spatially) distributed on the network area. To achieve this objective, it proposed a distributed and it...

Full description

Saved in:
Bibliographic Details
Published inAd hoc networks Vol. 46; pp. 37 - 47
Main Authors Pietrabissa, A., Liberati, F., Oddi, G.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2016
Subjects
Ad hoc networks
Algorithms
Energy-saving algorithms
Mathematical analysis
Networks
Partitions
Remote sensors
Tessellation
Voronoi partitioning
Wireless networks
Wireless sensor networks
Voronoi partitioning
Wireless sensor networks
Energy-saving algorithms
Online AccessGet full text

Cover

More Information
Summary:This paper presents a data sink node election algorithm for multi-hop Wireless Sensor Networks (WSNs) with multiple data sink nodes. For energy-saving considerations, these nodes should be evenly (spatially) distributed on the network area. To achieve this objective, it proposed a distributed and iterative algorithm, which periodically re-assigns the data sink roles to selected WSN nodes. The main innovation of the algorithm is that, even if it does not need to explicitly compute the Voronoi partition of the WSN at each iteration, it eventually partitions the network according to a Centroidal Voronoid Tessellation, which leads to a spatially well-balanced distribution of the data sink nodes. Analytical proofs as well as simulation results validate the approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1570-8705
1570-8713
DOI:10.1016/j.adhoc.2016.03.008