AODV with lower routing overhead

  • Authors:
  • Dongru Chen;Xia Wang

  • Affiliations:
  • School of Electronics and Information Engineering, and Key Laboratory of ISN Lab, XiDian University, Xi'an Jiaotong University, Xi'an, China;School of Electronics and Information Engineering, and Key Laboratory of ISN Lab, XiDian University, Xi'an Jiaotong University, Xi'an, China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compared with Table-Driven routing protocol, on-demand routing protocol lessens routing overhead dramatically. However, node unconditional broadcasting RREQ RERR may cause great routing overhead. In order to increase link lifetime and reduce routing overhead, an improved AODV method is proposed in this paper, in which RREQ RERR and routing table will be constrained or deleted.