DocumentCode :
3220037
Title :
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
Author :
Kwon, Soonmok ; Kim, Jeong-gyu ; Kim, Cheeha
Author_Institution :
Postech, Pohang
fYear :
2008
fDate :
25-28 March 2008
Firstpage :
738
Lastpage :
743
Abstract :
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network´s overall energy consumption and per-node fairness have been studied. Note that the minimum degree spanning tree (MDST) is optimal in the sense of per-node fairness. We believe that the per-node fairness is of practical interest and that the delay bound associated with it must be investigated. Unfortunately, no such efforts have been made so far. In this paper, we propose a tree structure, called the DB- MDST, which modifies MDST to reduce the height and extend its degree. With the DB-MDST, the near optimal delay bound (i.e., comparable to the one obtained using the shortest path tree) can be achieved at the cost of as much energy as consumed by the MDST while it cannot be achieved with the MDST. Simulation results support the claim stated.
Keywords :
trees (mathematics); wireless sensor networks; delay sensitive data gathering; energy consumption; minimum degree spanning tree; tree structure; wireless sensor networks; Application software; Computer science; Delay; Energy consumption; Energy efficiency; Information technology; Sensor phenomena and characterization; Tree data structures; Wireless communication; Wireless sensor networks; Data Gathering Tree; Delay Bound; Energy Efficiency; Per-node Fairness; Sensor Networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications - Workshops, 2008. AINAW 2008. 22nd International Conference on
Conference_Location :
Okinawa
Print_ISBN :
978-0-7695-3096-3
Type :
conf
DOI :
10.1109/WAINA.2008.268
Filename :
4483004
Link To Document :
بازگشت