DocumentCode :
3541792
Title :
On the construction of efficient data gathering tree in wireless sensor networks
Author :
Thepvilojanapong, Niwat ; Tobe, Yoshito ; Sezaki, Kaoru
Author_Institution :
Dept. of Inf. & Commun. Eng., Univ. of Tokyo, Japan
fYear :
2005
fDate :
23-26 May 2005
Firstpage :
648
Abstract :
A wireless sensor network can be an effective tool for gathering data in a variety of environments. The data gathering process must be designed to conserve the limited resources of the sensors. We propose an Efficient Data GathEring (EDGE) protocol which satisfies such requirement because it avoids both flooding and periodic updating of routing packets. The tree created by EDGE is reconstructed upon node failures or the addition of new nodes. Simulation results compared to directed diffusion, DSR, AODV, and OLSR demonstrated that EDGE achieves a higher delivery ratio and shorter delay on various scenarios.
Keywords :
packet radio networks; routing protocols; trees (mathematics); wireless sensor networks; AODV routing protocol; DSR; OLSR; directed diffusion; efficient data gathering protocol; efficient data gathering tree; node failures; routing packets; sensor resource conservation; tree reconstruction; wireless sensor networks; Bandwidth; Base stations; Computer networks; Condition monitoring; Energy storage; Intelligent networks; Intrusion detection; Radio frequency; Routing protocols; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN :
0-7803-8834-8
Type :
conf
DOI :
10.1109/ISCAS.2005.1464671
Filename :
1464671
Link To Document :
بازگشت