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

Citation

Goh, Hock Guan and Sim, Moh Lim and Ewe, Hong Tat (2004) Performance study of tree-based routing algorithm for 2D grid wireless sensor networks. In: 12th IEEE International Conference on Networks, 2004. (ICON 2004). Proceedings. IEEE Xplore, pp. 530-534. ISBN 0-7803-8783-X

[img] Text
01409224.pdf - Published Version
Restricted to Repository staff only

Download (453kB)

Abstract

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.

Item Type: Book Section
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 18 Dec 2013 06:16
Last Modified: 18 Dec 2013 06:16
URII: http://shdl.mmu.edu.my/id/eprint/4599

Downloads

Downloads per month over past year

View ItemEdit (login required)