|
|
M Shahidul Alam
alamm01@csse.uwa.edu.au
Entry year: 2003
Enrolment status: confirmed
Degree: MCompSci
Degree status: complete semester 1, 2005
Project: Location and Calculation-Free Node Scheduling Scheme for Wireless Sensor Networks
Supervisor(s): Amitava Datta
Project status: complete semester 1, 2005
|
|
A wireless sensor network is a collection of sensor nodes deployed over a region of interest for sensing or monitoring certain conditions or events, and collect data for further analysis in order to achieve the goal of such deployment.
Among the wide variety of applicable fields of sensor networks, some of the popular fields are in agriculture, meteorology, battle-fields and search & rescue operations during emergencies.
Regardless of their wide range of applicability, wireless sensor networks face many design challenges.
Two of the principal challenges are: to obtain a prolonged system lifetime by using the limited energy sources economically and to eliminate the nodes' dependency on the GPS (Global Positioning System) or manual manipulation for coordinates information.
The nodes' dependency on GPS or manual manipulation can be eliminated by using a location-free scheduling approach, where a node does not need to know its own or its neighbors' location coordinates.
The system lifetime can be extended by scheduling the nodes alternately by exploiting redundancy, and it can be further extended by using a calculation-free scheduling approach, where each node performs a negligible amount of calculation to evaluate its off-duty eligibility based on the data stored in each node's memory.
We have investigated two location and calculation-free node scheduling schemes, the Nearest-neighbor based and the Neighbor-number based, which have been proposed to address the design challenges we have mentioned above.
Combining features from these two node scheduling schemes and utilizing the sophistication of a unidirectional antenna, we propose the Directional-antenna based node scheduling scheme.
We have implemented all three, the Nearest-neighbor based, the Neighbor-number based and the Directional-antenna based scheduling schemes to compare their performances.
Our experimental results show that the Directional-antenna based scheduling scheme outperforms both of its predecessors.
|
 Proposal
Dissertation
|
Last update: Wed Jul 27 10:46:17 2005
|
|
