4TH YEAR STUDIES IN COMPUTER SCIENCE


Home

General Information

Important Dates

Units

Project

Assessment

Students

Resources

Miscellaneous Links

Ibrahim Abdul Rahim
abduli01@csse.uwa.edu.au

Entry year: 2004
Enrolment status: confirmed
Degree: BE(SE)
Degree status: complete semester 2, 2004

Project: Fault-Tolerant Routing Algorithm for Wireless Sensor Networks
Supervisor(s): Amitava Datta
Project status: complete semester 2, 2004


Wireless Sensor Networks are large and dense networks which depend on simple and limited sensors for routing. The sensors are stationary, but the topology is dynamic. The topology changes as sensors die by running out of energy or by being destroyed. As new sensors are added, or as sensors sleep or awaken, the topology again changes. In this project, we propose a new shortest distance routing protocol for wireless sensor networks. The protocol, SDLR, correctly finds the shortest path to some base station, even as the topology changes. Partitions and changes in the network are handled using trusted neighbors. SDLR also maintains multiple-path routing similar to the link-reversal family of algorithms. Through simulation, we present the cost of running the algorithm and how effective having multiple paths for routing is on evenly distributing the load on individual sensors. We also examined the affect of node failure on randomly generated topologies which cause the network to become sparse and partition. We present our findings on the behavior of shortest distance as node failures occur, along with the behavior of networks disintegration, and reconfiguration cost of the algorithm.

Proposal
Dissertation
Last update: Mon Mar 7 21:22:39 2005
For further enquiries, please contact the 4th Year Coordinator, Luigi Barone.

Copyright © 2008
School of Computer Science & Software Engineering
The University of Western Australia
CRICOS Provider Code: 00126G
Last modified: Mon Feb 11 14:24:53 2008