Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJaiswal, J-
dc.contributor.authorKhilar, Pabitra Mohan-
dc.identifier.citationInternational Conference on Communication, Computing and Security, 2011 (ICCCS), February 12-14th, Odisha.en
dc.description.abstractRouting in wireless network is a key research area. This paper proposes a fault tolerant greedy perimeter stateless routing protocol (FGPSR) suitable for wireless network with minimal routing overhead. FGPSR has four main phases- Fault testing, Planarization, Greedy forwarding and Perimeter forwarding. First, fault testing phase provides all nodes with their fault free neighbour positions periodically. The next phase, planarization is a prerequisite process for perimeter forwarding phase which removes crossing edges. Routing starts with Greedy forwarding, each node forwards packets to the neighbour which minimizes the distance to the destination in each step. Greedy forwarding can lead into a dead end or void, where there is no neighbour closer to the destination. In that case perimeter forwarding helps to recover and finds a path to another node, where greedy forwarding can resume. The probability of finding a route between source destination node pairs is very high. FGPSR establishes fault free paths between various wireless node pairs. The protocol has been analyzed and validated through simulation. The result shows that the number of path established in FGPSR are more than GPSR.en
dc.format.extent1273366 bytes-
dc.subjectWireless Network,en
dc.subjectGeographic Routing,en
dc.subjectFault tolerance,en
dc.titleFault Tolerant Greedy Perimeter Stateless Routing in Wireless Networken
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
p92-jaiswal.pdf1.24 MBAdobe PDFView/Open

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