By Topic

Performance study of tree-based routing algorithm for 2D grid wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Goh, H.G. ; Fac. of Inf. Technol., Multimedia Univ., Selangor, Malaysia ; Moh Lim Sim ; Hong Tat Ewe

In this paper, we focus our study on energy-efficient routing algorithms. We study an algorithm called energy-efficient tree-based routing, which is based on a tree-like topology rooted at a fixed base station (sink node) of the network with a fixed 2-dimensional (2D) grid topology. The performance of this algorithm is assessed by computer simulation and is compared with other existing algorithms. Tree-based routing algorithm is found to achieve longer network lifetime, smaller end-to-end network delay, and has better robustness to failures when compared with other algorithms in the case where the base station is placed at the perimeter of the grid.

Published in:

Networks, 2004. (ICON 2004). Proceedings. 12th IEEE International Conference on  (Volume:2 )

Date of Conference:

16-19 Nov. 2004