Share Email Print
cover

Proceedings Paper

Mitigating congestion in wireless ad hoc networks by using a potential-based routing algorithm
Author(s): Wei Wu; Zhong-zhao Zhang; Dan-yang Qin; Chen-guang He
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The congestion problem is one of the most important restrictions of wireless ad hoc networks. It is quite different from that of the traditional networks. In this paper, a routing algorithm based on potential, called RAP, is proposed to mitigate the congestion of wireless ad hoc networks. The RAP algorithm defines two potential fields for each node: vertical potential field and congestion level field. The mixture of these two fields shows the potential of a node for a certain destination. The data packets are routed along the steepest gradient direction to its destination. The RAP algorithm for wireless ad hoc networks can route packets bypass the congestion nodes and congestion zones to alleviate the congestion problem. To evaluate the performance of RAP algorithm, we conducted the simulation on NS2. The simulation results show that our RAP algorithm for wireless ad hoc networks can mitigate the congestion problem without much overhead.

Paper Details

Date Published: 3 April 2010
PDF: 7 pages
Proc. SPIE 7651, International Conference on Space Information Technology 2009, 765117 (3 April 2010); doi: 10.1117/12.855173
Show Author Affiliations
Wei Wu, Harbin Institute of Technology (China)
Zhong-zhao Zhang, Harbin Institute of Technology (China)
Dan-yang Qin, Harbin Institute of Technology (China)
Chen-guang He, Harbin Institute of Technology (China)


Published in SPIE Proceedings Vol. 7651:
International Conference on Space Information Technology 2009

© SPIE. Terms of Use
Back to Top