|
DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >
Please use this identifier to cite or link to this item:
http://dspace.library.iitb.ac.in/jspui/handle/100/2197
|
| Title: | PULRP: Path Unaware Layered Routing Protocol for underwater sensor networks |
| Authors: | GOPI, S KANNAN, G CHANDER, D DESAI, UB MERCHANT, SN |
| Issue Date: | 2008 |
| Publisher: | IEEE |
| Citation: | 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13,3141-3145 |
| Abstract: | We propose a Path Unaware Layered Routing Protocol (PULRP) for dense underwater 3D sensor networks. An up link transmission is considered, where a set of underwater sensor nodes report events to the sink node. PURLP algorithm consists of two phases. In the first phase (layering phase), a layering structure is presented which is a set of concentric spheres, around a sink node. The radius of the concentric spheres is chosen based on probability of successful packet forwarding as well as packet delivery latency. In the second phase (communication phase), we propose a method to choose the intermediate relay nodes and an on the fly routing algorithm for packet delivery from source node to sink node across the chosen relay nodes. The proposed algorithm, PULRP finds the routing path on the fly and hence it does not require any fixed routing table, localization or time synchronization processes. Our findings show that the proposed algorithm has a considerably better successful packet delivery rate compared to the Under Water Diffusion (UWD) algorithm proposed in [1] and Dijkstra's shortest path algorithm. In addition the delay involved in PULRP is comparable with that of UWD. |
| URI: | http://dx.doi.org/10.1109/ICC.2008.591 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15435 http://hdl.handle.net/100/2197 |
| ISBN: | 978-1-4244-2074-2 |
| ISSN: | 1550-3607 |
| Appears in Collections: | Proceedings papers
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|