Please use this identifier to cite or link to this item:
Title: Practical 3D geographic routing for wireless sensor networks
Keywords: wireless sensor networks, geographic routing, 3D routing algorithm, GDSTR-3D, routing protocol, TinyOS, networking
Issue Date: 8-Jan-2010
Citation: PRATIBHA SUNDAR SUNDARAMOORTHY (2010-01-08). Practical 3D geographic routing for wireless sensor networks. ScholarBank@NUS Repository.
Abstract: Wireless sensor networks have been deployed in various applications like habitat or environment monitoring and the network is likely to grow in size. Compared to traditional ad-hoc routing, geographic routing algorithms are attractive for such networks. Many existing works on geographic routing are done for two dimensional topologies. But in real world, many sensor networks are deployed in three dimensions. Greedy Distributed Spanning Tree Routing (GDSTR) have shown to perform better than some well-known algorithms like CLDP+GFR for 2D networks. In this work, we implemented GDSTR in TinyOS, developed a 3D extension of the algorithm, called GDSTR-3D, and compared the performance of the new algorithm to GDSTR and CLDP+GFR. Our evaluations showed that GDSTR-3D performs better than 2D algorithms with comparable or even lower cost. Our GDSTR-3D using spheres performs 25% better than GDSTR-2D and 85% better than CLDP in terms of hop stretch.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
SundaramoorthyPS.pdf1.12 MBAdobe PDF


DSpaceBatchImportFormat.pdf85.8 kBAdobe PDF



Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.