A Routing-Tree Construction Algorithm for Energy Efficiency in Wireless Sensor Network


The KIPS Transactions:PartC, Vol. 16, No. 6, pp. 731-736, Dec. 2009
10.3745/KIPSTC.2009.16.6.731,   PDF Download:

Abstract

In wireless sensor network, many sensor nodes are distributed in the field. They communicate the sensing data each other and forward it to sink. Routing protocols, which define the delivery methods of sending data, affect to the lifetime of sensor network. This paper proposes RTAF that is a routing-tree construction algorithm of sensor nodes by a single flooding process in wireless sensor network. A routing tree is constructed by selecting a parent node using the forward-direction flooding packet and gathering children nodes using the reverse-direction flooding packet. In this process, a node with much energy becomes the parent node. And the routing tree is periodically reconstructed in order to distribute the loads of parent nodes. The proposed algorithm compared performance with Modified-LEACH using NS2 network simulation tool. The simulation result shows that the proposed algorithm constructs a routing-tree faster and reduced 40~80% in routing-tree construction packet.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. S. Kim, H. S. Kim, J. N. Jeon, "A Routing-Tree Construction Algorithm for Energy Efficiency in Wireless Sensor Network," The KIPS Transactions:PartC, vol. 16, no. 6, pp. 731-736, 2009. DOI: 10.3745/KIPSTC.2009.16.6.731.

[ACM Style]
Yul Sang Kim, Hyoun Soo Kim, and Joong Nam Jeon. 2009. A Routing-Tree Construction Algorithm for Energy Efficiency in Wireless Sensor Network. The KIPS Transactions:PartC, 16, 6, (2009), 731-736. DOI: 10.3745/KIPSTC.2009.16.6.731.