Author:
Hu Liang,Yin Huayi,Hong Chaoqun
Abstract
<span style="font-family: 'Times New Roman',serif; font-size: 9pt; mso-fareast-font-family: SimSun; mso-fareast-theme-font: minor-fareast; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA; mso-bidi-font-size: 11.0pt;">In this paper, considering the high energy consumption, loss of network lifetime and data leak in transmission during the data aggregation of the wireless sensor network, we propose an improved spatial data aggregation algorithm. Through comparison with traditional data aggregation algorithms, we verify the feasibility and rationality of the proposed algorithm and obtain the following conclusions: the proposed algorithm carries out node sensing and data aggregation within a certain area based on multiple dynamic routes. The calculation process does not require encryption and decryption, and is not affected by network topology, so it can better address the data aggregation problems in the dynamic change of network structure. Compared with other traditional data aggregation algorithms, the proposed algorithm has the advantages of low traffic, low energy consumption in data transmission, low probability of data leakage and high transmission accuracy. In data aggregation, 3 slices is the optimal quantity.</span>
Publisher
International Association of Online Engineering (IAOE)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献