Abstract

Routing in wireless network is a key research area which establishes path between source and destination node pairs. In this paper, we have designed and evaluated an Energy-efficient and Fault tolerant Greedy Perimeter Stateless Routing (EFGPSR) protocol for wireless ad hoc network. The proposed protocol is divided into four phases: Fault testing phase, Planarization phase, Energy efficient greedy forwarding phase and Energy efficient perimeter forwarding phase. In fault testing phase, all nodes come to know about their fault free neighbours. Next is planarization phase which removes the crossing edges. Next are energy efficient greedy forwarding and perimeter forwarding phases. Both these phases try to maintain balance between the metrics to choose the next hop (i.e. distance from destination in greedy forwarding phase and minimum angle w.r.t the line connecting the forwarding node and destination in perimeter forwarding phase) and selection of node having highest energy among the neighbouring nodes to extend network lifetime. Evaluation and comparison of GPSR and EFGPSR is done through NS-2 simulator. Simulation shows that EFGPSR performs better in terms of increasing the network lifetime, successful packet delivery ratio with insignificant increase in number of hop count.

Highlights

  • INTRODUCTIONWireless and mobile communication technologies have grown rapidly. As wireless network evolves there is a trend towards decentralized, deployable and self-organizing networks

  • In recent years, wireless and mobile communication technologies have grown rapidly

  • Most existing designs of wireless network routing protocols are based on the assumption that every node in the network is fault free

Read more

Summary

INTRODUCTION

Wireless and mobile communication technologies have grown rapidly. As wireless network evolves there is a trend towards decentralized, deployable and self-organizing networks. Most existing designs of wireless network routing protocols are based on the assumption that every node in the network is fault free. Greedy forwarding and perimeter forwarding consider only single metrics i.e. minimum distance from destination and minimum angle in counter clockwise direction with respect to the line connecting the forwarding node and destination. These parameters do not take into account the energy conservation for evaluating the routing performance.

System Model
Energy Model
PROPOSED ALGORITHM
Planarization Phase
Energy Efficient Perimeter Forwarding
SIMULATION RESULTS
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call