Design of coverage algorithm for mobile sensor networks based on virtual molecular force

Abstract General virtual force algorithm, when the density of sensor nodes is large in the monitoring area, there are some shortcomings, such as uneven distribution of nodes, more overlap of coverage area and so on. In view of these shortcomings, based on the basic idea of air molecular theory, a virtual molecular force model of mobile sensor networks is established, and the virtual molecular force algorithm for node deployment and mobile coverage of mobile sensor networks is given. The virtual molecular force algorithm assumes that there is interaction between nodes in mobile sensor networks, and the resultant force of these forces constitutes the resultant force network of sensor nodes in the monitoring area, which drives the sensor nodes to move to the corresponding location to repair the monitoring blind area, so as to maximize the coverage of the network. In order to verify the feasibility and effectiveness of the virtual molecular force algorithm, the virtual molecular force algorithm for mobile sensor network node deployment and mobile coverage is simulated and analysed by using MATLAB simulation tool. The simulation results show that the virtual molecular force algorithm can make the sensor nodes repair the monitoring blind area efficiently and quickly, and maximize the monitoring coverage area of the sensor network. In terms of repairing monitoring blind areas and improving network coverage, the virtual molecular force algorithm is superior to other network coverage algorithms such as general virtual force algorithm.

[1]  Amir G. Aghdam,et al.  Distributed Deployment Algorithms for Coverage Improvement in a Network of Wireless Mobile Sensors: Relocation by Virtual Force , 2017, IEEE Transactions on Control of Network Systems.

[2]  Jalal Habibi,et al.  A Gradient-Based Coverage Optimization Strategy for Mobile Sensor Networks , 2017, IEEE Transactions on Control of Network Systems.

[3]  Amir G. Aghdam,et al.  Distributed Sensor Coordination Algorithms for Efficient Coverage in a Network of Heterogeneous Mobile Sensors , 2017, IEEE Transactions on Automatic Control.

[4]  Jamal N. Al-Karaki,et al.  The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited , 2017, IEEE Access.

[5]  Xiaohua Jia,et al.  Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.

[6]  Hichem Snoussi,et al.  Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks , 2015, Comput. Oper. Res..

[7]  Manju,et al.  Maximising network lifetime for target coverage problem in wireless sensor networks , 2016, IET Wirel. Sens. Syst..

[8]  Abdulaziz S. Almazyad Reputation-based mechanisms to avoid misbehaving nodes in ad hoc and wireless sensor networks , 2016, Neural Computing and Applications.

[9]  Antonio Pietrabissa,et al.  A distributed algorithm for Ad-hoc network partitioning based on Voronoi Tessellation , 2016, Ad Hoc Networks.

[10]  Abdullah Abdul Hanan,et al.  Mobility in mobile ad-hoc network testbed using robot: Technical and critical review , 2018 .

[11]  John P. Robinson,et al.  News Media Use and Adolescents' Information about Nuclear Issues: A Soviet‐American Comparison , 1989 .

[12]  Maode Yan,et al.  Efficient coverage algorithm for mobile sensor network with unknown density function , 2017 .

[13]  Rosdiadee Nordin,et al.  Energy and mobility conscious multipath routing scheme for route stability and load balancing in MANETs , 2017, Simul. Model. Pract. Theory.

[14]  Kamran Sayrafian-Pour,et al.  Toward Autonomous Mobile Sensor Networks Technology , 2016, IEEE Transactions on Industrial Informatics.