KEYWORDS: Computer simulations, Wireless communications, Palladium, Aerospace engineering, Information technology, Lithium, Current controlled current source, Device simulation, Radio propagation, Basic research
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.