Event-Sensitive Network: A Construction Algorithm of Agricultural Sensor Network Driven by Environmental Change
Author(s) -
Shipu Xu,
Yong Liu,
Wenwen Hu,
Yingjing Wu,
Sijia Liu,
Wang Yunsheng,
Chang Liu
Publication year - 2021
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2021/6687719
Subject(s) - wireless sensor network , software deployment , computer science , matlab , event (particle physics) , real time computing , key (lock) , key distribution in wireless sensor networks , stability (learning theory) , transmission (telecommunications) , algorithm , wireless network , wireless , computer network , computer security , telecommunications , physics , quantum mechanics , machine learning , operating system
In a wireless sensor network, the sensor nodes transmit the acquired information to the server through the data transmission link. On the serverside, the data are processed, fused, and expressed to serve the user. Sensor deployment is a key factor related to the stability and security of wireless networks. This article uses environmental changes to drive related technologies to deploy wireless sensors. In this article, environmental change-driven means that through certain deployment cost model assumptions and problem descriptions, network deployment is artificially divided into two stages: initial deployment and redeployment. In the deployment phase, by referring to the idea of virtual force, a new sensor deployment algorithm is proposed in the redeployment phase, which can well solve the stability- and security-related issues encountered in agricultural wireless sensor networks. In this algorithm, the moving distance of the mobile receiver and the average coverage of the network are calculated based on the virtual force, the direction, and the number of adjacent clusters. Finally, the algorithm model was simulated in MATLAB, and the feasibility of the algorithm was verified by analyzing the event coverage and the moving distance of nodes. The final simulation results show that the algorithm proposed in this paper can achieve better performance than existing algorithms in terms of average coverage and moving distance.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom