AODV-Deleting Path with Bad Broken Index

作     者：Hann-tzong CHERN Shih-chi YANG Kuan-ting WANG 

作者机构：Dept.of Electronic EngineeringNational Taiwan University of Science and Technology 

出 版 物：《Journal of Measurement Science and Instrumentation》 (测试科学与仪器（英文版）)

年 卷 期：2010年第1卷第4期

页      面：354-359页

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：supported by National Taiwan University of Science and Technology 

主　　题：MANET AODV routing protocol signal strength simulation 

摘      要：In recent years, the development of mobile equipment makes the topology of the network to change rapidly. So that its routing problem an important research subject accordingly. In all the proposed protocols, 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 destination node is chosen by the metric of hop counts. However, the chosen path with 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 and 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 shows better throughput, and end-to-end delay can be obtained comparing the original AODV with metric of hop-count.