Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((TANG Xiaojiang[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Wireless sensor network deployment algorithm based on basic architecture
SHI Jiaqi, TAN Li, TANG Xiaojiang, LIAN Xiaofeng, WANG Haoyu
Journal of Computer Applications 2020, 40 (
7
): 2033-2037. DOI:
10.11772/j.issn.1001-9081.2019122211
Abstract
(
403
)
PDF
(2295KB)(
441
)
Knowledge map
Save
At present, the deployment of nodes in wireless sensor network mainly adopts the algorithm based on Voronoi diagram. In the process of deployment using Voronoi algorithm, due to the large number of nodes involved in the deployment and the high complexity of the algorithm, the iteration time of the algorithm is long. In order to solve the problem of long iteration time in node deployment, a Deployment Algorithm based on Basic Architecture (DABA) was proposed. Firstly the nodes were combined into basic architectures, then center position coordinates of the basic architecture were calculated, finally the node deployment was performed by using Voronoi diagram. The algorithm was still able to realize the deployment effectively under the condition that there were obstacles in the deployment area. The experimental results show that DABA can reduce the deployment time by two thirds compared with the Voronoi algorithm. The proposed algorithm can significantly reduce the iteration time and the complexity of the algorithm.
Reference
|
Related Articles
|
Metrics
Select
Node coverage optimization algorithm in directional heterogeneous wireless sensor network
XU Zhongming, TAN Li, YANG Chaoyu, TANG Xiaojiang
Journal of Computer Applications 2017, 37 (
7
): 1849-1854. DOI:
10.11772/j.issn.1001-9081.2017.07.1849
Abstract
(
530
)
PDF
(851KB)(
539
)
Knowledge map
Save
Concerning covering loopholes and uneven local deployment, a Directional and Heterogeneous Precision Self-deployment Algorithm (DHPSA) was proposed. Autonomous deployment process was divided into two stages. Firstly, a node moved to the destination path by choosing the optimal route in real-time under virtual forces of neighbor node and specified path. Then, through autonomous rotation and autonomous moving, the location of the node was finely tuned under joint virtual force of neighbor nodes and the accurate coverage of the target path was realized finally. The contrast experiments show that, compared with the VFPSA (Virtual Force-based Precision Self-deployment Algorithm), the coverage rate of the proposed algorithm is increased by about 4.4 percent, the overlapping rate is decreased by about 3.4 percent, moving distance is reduced by about 2.1 percent and deployment time is reduced by about 4.3 percent. The simulation experiment results show that the proposed deployment algorithm can effectively increase the coverage rate, decrease the overlap rate and reduce energy consumption.
Reference
|
Related Articles
|
Metrics