Mitigating congestion in wireless ad hoc networks by using a potential-based routing algorithm

Wei Wu; Zhong-zhao Zhang; Dan-yang Qin; Chen-guang He

doi:10.1117/12.855173

2 April 2010 Mitigating congestion in wireless ad hoc networks by using a potential-based routing algorithm

Wei Wu, Zhong-zhao Zhang, Dan-yang Qin, Chen-guang He

Proceedings Volume 7651, International Conference on Space Information Technology 2009; 765117 (2010) https://doi.org/10.1117/12.855173
Event: International Conference on Space Information Technology 2009, 2009, Beijing, China

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.

Citation Download Citation

Wei Wu, Zhong-zhao Zhang, Dan-yang Qin, and Chen-guang He "Mitigating congestion in wireless ad hoc networks by using a potential-based routing algorithm", Proc. SPIE 7651, International Conference on Space Information Technology 2009, 765117 (2 April 2010); https://doi.org/10.1117/12.855173

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available