Neighbor-aware optimizing routing for wireless ad hoc networks

Authors:
Xianlong Jiao;Xiaodong Wang;Xingming Zhou
Affiliations:
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
Venue:
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Year:
2007

Citing 7
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Neighborhood aware source routing

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking

Model and analysis of path compression for mobile Ad Hoc networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless ad hoc networks are consisted of mobile nodes with limited bandwidth, computing ability and energy, which is different from the traditional wired networks. On demand routing protocols are proposed for this type of network, and they scale well with the topology of ad hoc network. But due to lack of knowledge of global topology and the mobility of nodes, they may be not optimal. We propose a Neighbor-Aware Optimizing Routing algorithm (called NAOR) based on SHORT [1] which uses hop comparison array to optimize the routing protocol. Our NAOR algorithm solves those special cases which SHORT fails to handle. Finally, we use ns-2 simulator to evaluate the performance of AODV, AODV using SHORT and AODV using NAOR. The results show that NAOR gets better improvement on performance such as delivery rate and latency than SHORT.