Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks

Wang Yu-ming; Yang Zong-kai; Zhao Da-sheng

doi:10.3724/SP.J.1146.2006.00194

Volume 29 Issue 7

Jan. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2007 > 29(7): 1622-1627

Wang Yu-ming, Yang Zong-kai, Zhao Da-sheng. Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1622-1627. doi: 10.3724/SP.J.1146.2006.00194

Citation:

Wang Yu-ming, Yang Zong-kai, Zhao Da-sheng. Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1622-1627. doi: 10.3724/SP.J.1146.2006.00194

Citation:

PDF( 352 KB)

Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks

doi: 10.3724/SP.J.1146.2006.00194

Received Date: 2006-02-24
Rev Recd Date: 2007-02-08
Publish Date: 2007-07-19

Abstract

Abstract

According to the disadvantages of the existing AODV and AODV-BR schemes in Ad hoc networks, a cache bypass and local recovery based route reconstruction scheme is proposed in this paper. The mobile node listens in all frames including data packets and routing control signaling in its free time, and maintains a neighbor list and local route cache, thus well reduces signaling cost brought by the periodical HELLO messages, and gains more usable route information. Once the intermediate node detects a broken link, it tries local recovery, instead of broadcasting RREQ messages to achieve route discovery from the source node. Fast route discovery and local recovery will be achieved according to local route cache and neighbors route caches, thus routing control signaling and packet drop ratio are well reduced.

FullText(HTML)

References(1)

References

[1] Royer E and Toh C. A review of current routing protocols for Ad hoc mobile wireless networks[J].IEEE Personal Communications.1999, 6(2):46-55 [2] Perkins C, Royer E, and Das S. Performance comparison of two on-demand routing protocols for Ad hoc networks[J].IEEE Personal Communications.2001, 8(1):16-28 [3] Tsirigos A and Haas Z. Multi-path routing in the presence of frequent topological changes. IEEE Communications Magazine, 2001, 9(11): 132-138. [4] 郭晓峰，陈跃泉，陈贵海. 一种累计多路径的移动自组网络路由策略. 软件学报, 2004, 15(4): 594-603. Guo Xiao-feng, Chen Yue-quan and Chen Gui-hai. An aggregated multipath routing scheme for Ad hoc networks. Journal of Software, 2004, 15(4): 594-603. [5] Ogier R and Ruthenburg V. Minimum-expected-delay alternate routing. Proc. of INFOCOM92, Florence, 1992: 617-625. [6] Lee S and Gerla M. AODV-BR: Backup routing in Ad hoc networks. Proc. of WCNC00, Chicago, Sep. 2000: 1311-1316. [7] Perkins C, Royer E, and Das S. Ad hoc on-demand distance vector routing. IETF RFC 3561, Jul. 2003. [8] Perkins C. Ad hoc Networks. USA: Addison Wesley, 2001: 29-48. [9] Camp T, Boleng J, and Davies V. A survey of mobility models for Ad hoc network research. Wireless Communications and Mobile Computing: Special Issue on Mobile Ad hoc Networking, 2002, 2(5): 483-502.

Relative Articles

Supplements(0)

Cited By

Proportional views