Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ant algorithms for discrete optimization
Artificial Life
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Routing 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.