Journal of Northeastern University ›› 2004, Vol. 25 ›› Issue (11): 1050-1053.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Auxiliary table-driven routing algorithm in ad-hoc networks

Li, Dong-Ni (1); Wang, Ya-Sha (2); Feng, Jin (1); Wang, Guang-Xing (1)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China; (2) Sch. of Electron. Eng., Peking Univ., Beijing 100871, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-11-15 Published:2013-06-24
  • About author:-
  • Supported by:
    -

Abstract: After studying the characteristics of moving hosts in an ad-hoc wireless network, a new traffic pattern, namely the rapid-passing pattern, is defined, based on the three traditional traffic patterns. The routing agent algorithm is thus proposed for rapid-passing pattern under which the frequent changes in network topology will lead to heavy overheads for bandwidth and computation and, at the same time, prolong the time delay in the services to be done. As a supplement to current table-driven routing protocols, the routing agent algorithm shall dramatically reduce the packet overheads of route-updating messages due to the change of rapid-moving hosts. The simulation results show that it greatly shortens the time delay required for sending data to the rapid-moving host, thus improving the routing efficiency.

CLC Number: