期刊名称：International Journal of Distributed Sensor Networks
印刷版ISSN：1550-1329
电子版ISSN：1550-1477
出版年度：2019
卷号：15
期号：9
页码：1
DOI：10.1177/1550147719864888
出版社：Hindawi Publishing Corporation
摘要：As theoretical proof has shown that a hexagonal topology can obtain maximal coverage with a fixed number of sensor nodes, node deployment for mobile sensor networks has the objective of forming a hexagonal network topology while consuming minimum energy. Using virtual-force algorithms to move initially randomly distributed nodes into a target topology is one of the widely studied methods for achieving this goal. In this work, a novel virtual-force algorithm based on physical laws in a dusty plasma system (i.e. VFA-DP) was applied within a mobile sensor network deployment scenario. The VFA-DP force has a central attracting force which can provide a screening effect via exponential decay. Here, to evaluate how perfect the final grids become from virtual-force algorithms, we introduce a performance metric based on the pair correlation function in a crystalline structure. Via simulation studies, we determined that the topology resulting from the VFA-DP is much closer to a hexagon. The analysis also indicated that the VFA-DP converges faster than another virtual-force algorithm based on the Lennard-Jones potential (VFA-LJ), resulting in lower communication-related energy costs in real deployment scenarios. The method developed in this article is derived from studies of crystalline structure from condensed matter physics and shows clear evidence of when the regular lattice is ready. It will provide some guidance for engineering by aiding deployment in complex geometric areas or those recovering from disaster.
