Advertisement
Published in:
2013 | OriginalPaper | Chapter
Group-Based Overhead Limiting for Stability Routing in Ad Hoc Networks
Authors : Xi Hu, Cong Wang, Siwei Zhao, Xin Wang
Published in: Advances in Swarm Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Two critical issues of designing scalable routing algorithm in ad hoc networks are that it should be robust to frequent path disruptions caused by node mobility and limit routing overhead. This paper argues grouping nodes with the motion direction of source to limit the range of RREQ broadcast. This kind of grouping also ensures that nodes, belonging to the same group, are more likely to establish longtime existent paths as they have similar motions. During route discovery, only the nodes which are in same group with source are allowed to rebroadcast RREQ. So the destination can select a most stable route to reply. The performance is evaluated through computer simulation with NS2. Simulation results indicate the proposed routing algorithm can limit routing overhead and enhance route stability effectively.