This paper presents a solution for distributed formation of ad hoc networks of moving wireless sensing nodes to ensure sensing coverage of an area of interest, where the only localisation information available to the nodes is the signal strength and the relative direction of movement of their neighbours. This solution can be applied to any group of moving nodes that communicate using wireless links, whether on the ground or in the air. The solution includes two algorithms: (1) the relative neighbour localisation algorithm, which uses machine learning (random forest regression) and existing localisation data to estimate the angle of movement for each neighbour; (2) the network formation algorithm, where nodes use the calculated angle estimates and a modified Dijkstra algorithm to determine the optimal choice of neighbours to form a sensing network, maximising the group coverage of a chosen area. This paper presents both algorithms, and presents experimental and simulation work done in (1) determining the regression algorithm and (2) evaluating the network formation solution, demonstrating that it is possible to provide good network coverage with low algorithm complexity when global localisation is absent.
Distributed Network Formation for Moving Wireless Nodes with Limited Location Information
2022-06-01
769223 byte
Conference paper
Electronic Resource
English
Distributed Nodes Localization Method in Wireless Sensor Networks
British Library Online Contents | 2007
|Network Coding for Information Exchange between Multiple Nodes in Wireless Networks
British Library Conference Proceedings | 2008
|Spatial Diversity for Fiber-Bundled FSO Nodes With Limited Mobility
British Library Online Contents | 2012
|