Nearest Neighbour Node Deployment Algorithm for Mobile Sensor Networks

doi:10.3390/s23187797

2023-09-11

Mahsa Sadeghi Ghahroudi

Alireza Shahrabi *

Tuleen Boutaleb

DOI：10.3390/s23187797

原文链接

查看原文

摘要

En 中文

Many animal aggregations display remarkable collective coordinated movements on a large scale, which emerge as a result of distributed local decision-making by individuals. The recent advances in modelling the collective motion of animals through the utilisation of Nearest Neighbour rules, without the need for centralised coordination, resulted in the development of self-deployment algorithms in Mobile Sensor Networks (MSNs) to achieve various types of coverage essential for different applications. However, the energy consumption associated with sensor movement to achieve the desired coverage remains a significant concern for the majority of algorithms reported in the literature. In this paper, the Nearest Neighbour Node Deployment (NNND) algorithm is proposed to efficiently provide blanket coverage across a given area while minimising energy consumption and enhancing fault tolerance. In contrast to other algorithms that sequentially move sensors, NNND leverages the power of parallelism by employing multiple streams of sensor motions, each directed towards a distinct section of the area. The cohesion of each stream is maintained by adaptively choosing a leader for each stream while collision avoidance is also ensured. These properties contribute to minimising the travel distance within each stream, resulting in decreased energy consumption. Additionally, the utilisation of multiple leaders in NNND eliminates the presence of a single point of failure, hence enhancing the fault tolerance of the area coverage. The results of our extensive simulation study demonstrate that NNND not only achieves lower energy consumption but also a higher percentage of k-coverage.

Keyword:

distributed mobile sensor network

node deployment algorithm

nearest neighbour

collective movement