A distributed routing algorithm for data aggregation in wireless sensor networks

Front. Electr. Electron. Eng. ›› 2008, Vol. 3 ›› Issue (1) : 34 -39.

PDF (118KB)
Front. Electr. Electron. Eng. ›› 2008, Vol. 3 ›› Issue (1) : 34 -39. DOI: 10.1007/s11460-008-0006-6

A distributed routing algorithm for data aggregation in wireless sensor networks

Author information +
History +
PDF (118KB)

Abstract

Considering the impact of aggregation cost on the performance of aggregation routes in wireless sensor networks, an aggregation-decision-based distributed routing algorithm for data aggregation is proposed. When source nodes arrive or leave, the algorithm can calculate the aggregation benefit according to data correlation, aggregation cost and transmission cost. Then the algorithm will adaptively make aggregation and routing decisions based on aggregation benefit. Therefore, it can jointly optimize the aggregation and transmission costs and reduce the energy consumption for data gathering. This distributed algorithm makes all the decisions only relying on the local information. Hence, the routing maintenance cost is limited. Simulation results show that the energy consumption difference between this distributed online algorithm and the previous offline one is within 17% under any network conditions.

Keywords

wireless sensor networks, data gathering, data aggregation, routing

Cite this article

Download citation ▾
null. A distributed routing algorithm for data aggregation in wireless sensor networks. Front. Electr. Electron. Eng., 2008, 3(1): 34-39 DOI:10.1007/s11460-008-0006-6

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (118KB)

814

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/