In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spa...In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spanning-tree-based aggregation algorithms invalid in mobile sensor networks. In this paper, we first present a distributed clustering algorithm which divides mobile sensor nodes into several groups, and then propose two distributed aggregation algorithms, Distance-AGG （Aggregation based on Distance）, and Probability-AGG （Aggregation based on Probability）. Both of these two algorithms conduct an aggregation query in three phases： query dissemination, intra-group aggregation, and inter-group aggregation. These two algorithms are efficient especially in mobile networks. We evaluate the performance of the proposed algorithms in terms of aggregation accuracy, energy efficiency, and query delay through ns-2 simulations. The results show that Distance-AGG and Probability-AGG can obtain higher accuracy with lower transmission and query delay than the existing aggregation algorithms.展开更多
基金Supported by the National Natural Science Foundation of China (Nos. 61100048, 61033015, and 60803015)Programs Foundation of Ministry of Education of China for New Century Excellent Talents in University (No. NCET-11-0955)+4 种基金the Natural Science Foundation of Heilongjiang Province(No. F201038)Programs Foundation of Heilongjiang Educational Committee for New Century Excellent Talentsin University (No. 1252-NCET-011)Program for Group of Science and Technology Innovation of Heilongjiang Educational Committee (No. 2011PYTD002)the Science and Technology Research of Heilongjiang Educational Committee (Nos. 12511395 and 11551343)the Science and Technology Innovation Research Project of Harbin for Young Scholar (Nos. 2008RFQXG107, 2009RFQX080, and2011RFQXG028)
文摘In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spanning-tree-based aggregation algorithms invalid in mobile sensor networks. In this paper, we first present a distributed clustering algorithm which divides mobile sensor nodes into several groups, and then propose two distributed aggregation algorithms, Distance-AGG （Aggregation based on Distance）, and Probability-AGG （Aggregation based on Probability）. Both of these two algorithms conduct an aggregation query in three phases： query dissemination, intra-group aggregation, and inter-group aggregation. These two algorithms are efficient especially in mobile networks. We evaluate the performance of the proposed algorithms in terms of aggregation accuracy, energy efficiency, and query delay through ns-2 simulations. The results show that Distance-AGG and Probability-AGG can obtain higher accuracy with lower transmission and query delay than the existing aggregation algorithms.
