DocumentCode
3394151
Title
A Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells for wireless sensor networks
Author
Wu, Hao ; Ding, Yi-ming ; Zhong, Zhangdui
Author_Institution
State Key Lab. of Rail Traffic Control & Safety, Beijing Jiaotong Univ., Beijing, China
Volume
1
fYear
2009
fDate
19-20 Dec. 2009
Firstpage
106
Lastpage
109
Abstract
It is important to gather sensed information with an energy efficient method in sensor networks. Although data collection may save energy and improve information accuracy, it must get this at the cost of decreasing other performances, such as the delay increment. This paper proposes a Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells (CFDASC) to solve this problem. In this algorithm, we attributed each node to one suppositional cell according to the node location information. The nodes which are in one suppositional cell act as the cluster head of data collection in turn, then the head gathers and transmits data along the cells chain to the sink node. As a result, it accelerates the data aggregation process. Simulation results also show that CFDASC algorithm performs better than PEGASIS algorithm by 50.03% in average packet transmission delay, and takes the cost of tiny energy increment, only 6.07% than that in PEGASIS.
Keywords
wireless sensor networks; average packet transmission delay; chain-based fast data aggregation algorithm; node location information; sink node; suppositional cells; wireless sensor networks; Wireless sensor networks; Fast data aggregation; Power efficient; Suppositional cell; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on
Conference_Location
Shenzhen
Print_ISBN
978-1-4244-4544-8
Type
conf
DOI
10.1109/PEITS.2009.5407058
Filename
5407058
Link To Document