Hann-tzong CHERN, Shih-chi YANG, Kuan-ting WANG
Dept. of Electronic Engineering, National Taiwan University of Sc ience and Technology, Taipei, China
Abstract-In recent years, the development of mobile equipment makes the topology of the network to change rapidly. So that its routing proble m becomes an important research subject accordingly. In all the proposed proto cols, the Ad Hoc On-demand Distance Vector Routing Protocol(AODV) is applied to most wireless environments. With it, the shortest path from the source to dest ination node is chosen by the metric of hop counts. However, the chosen path wi th this metric may not be a stable one. With the research of predecessors, the Link Available Time(LAT) can be calculated by the strength of received signal an d may be regarded as another usable routing metric. Based on that, the authors develop a protocol named AODV-Deleting Path with Bad Broken Index (AODV-DPWBB) and discuss all the logicality of it. The simulation is done for two contention modes in several node speeds with discussion followed. The simulation result sh ows better throughput, and end-to-end delay can be obtained comparing the orig inal AODV with metric of hop-count.
Key words-MANET; AODV; routing protocol; signal strengt h; simulation
Manuscript Number: 1674-8042(2010)04-0354-06
dio: 10.3969/j.issn.1674-8042.2010.04.12
References
[1]Charles E. Perkins, Elizabeth M. Belding-Royer, Samir R. Das, 2002. Ad hoc On-Demand Distance Vector (AODV) Routing. Proceeding of IEEE WMCSA'99, N ew Orleans, LA.
[2]R.S.Chang, S.J.Lieu, 2006. Long-lived Path Routing With Received Si gnal Strength for Ad Hoc Networks. Wireless Pervasive Computing, 2006 1st International Symposium.
[3]Charles E. Perkins, Pravin Bhagwat, 1994. Highly Dynamic Destination - Sequenced Distance Vector Routing(DSDV) for Mobile Computers. Proc. of the SI GCOM'94 Conference on Communication Architectures, Protocols and Applications, p .234-244.
[4]Mario Gerla, Xiaoyan Hong, Guangyu Pei, 2002. Fisheye State Routing Protocol(FSR) for Ad Hoc Networks. Proceeding of RFC.
[5]Richard G. Ogier, Fred L. Templin, Bhargav Bellur, Mark G. Lewis, 20 0 2. Topology Broadcast Based on Reverse-Path Forwarding (TBRPF). Draft-ietf-ma net-tbrpf-05.txt.
[6]Thomas Clausen, Philippe Jacquet, Anis Laouiti, et al, 2002. Optimiz ed Link State Routing Protocol. Draft-idft-manet-olsr-06.txt.
[7]Charles E. Perkins, Elizabeth M. Belding-Royer, Samir R. Das, 2002. Ad hoc On-Demand Distance Vector (AODV) Routing. Draft-ietf-manet-aodv -11.txt
[8]David B. Johnson, David A. Maltz, Yih-Chun Hu, Jorjeta G. Jetch eva, 2002. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks(DSR). Draft-itef-manet-dsr-07.txt
[9]V. Park, S. Corson, 2001. Temporally-Ordered Routing Algorithm( TORA) Version 1 Functional Specification. Draft-ietf-manet-tora-spec-04.tx t
[10]Zygmunt J. Haas, Marc R. Pearlman, Prince Samar, 2002. The Zone Routing Protocol(ZRP) for Ad Hoc Networks. Draft-ietf-manet-zone-zrp-04.tx t
[11]Ivan Stojmenovic, 1999. Home Agent Based Location Update and Destin ation Search Schemes in Ad Hoc Wireless Networks, Tech. rep. TR-99-10, Comp. S cience, SITE, Univ. Ottawa.
[12]J. Li, et al, 2000. A Scalable Location Service for Geographic Ad H oc Routing. Proc. 6th Annual ACM/IEEE Int'1. Conf. Mobile Comp. Net, Boston, p p.120-30.
[full text view]
