无线Ad hoc网络路由技术若干关键问题研究
|
摘要
Ad hoc网络是一种不依赖固定通信网络基础设施的新型无线网络。在这种网络中，节点通过自组织的方式迅速构建通信网络，实现节点间通信，进行信息的收集、处理和分发。Ad hoc网络技术的出现为军事通信、临时通信和灾难救助提供了有效的解决方案，同时也让人们能够在任意环境下自由地通信。在Ad hoc网络中，距离相近的节点可以直接进行通信，而距离较远的节点由于节点传输能力的限制必须依靠某种路由协议通过多跳的方式进行通信。路由协议的好坏极大影响、甚至决定着Ad hoc网络的性能。因此，无线Ad hoc网络技术一提出，作为Ad hoc网络关键技术的路由技术就被广泛关注，成为了该领域的研究重点、热点之一，到今不曾改变。
本文针对无线Ad hoc网络路由技术中的一些基础性、关键性问题进行了深入研究。这些问题包括：无线Ad hoc网络移动模型建模、无线Ad hoc网络路由协议性能分析及改进、新型路由协议设计方法及框架等。通过对这些问题的研究，本文取得了如下研究成果：
1.提出一种适用于具有多出入口区域的节点移动模型。在仿真研究中选择最贴近实际、最易于实现的节点移动模型是研究的基础，也是成功的关键。然而，现有节点移动模型大多是基于理想环境设计的，不适用于真实环境。本文首先提出了具有多个出入口区域的SMS节点移动模型(SMS with entrances，SMSPWE)。在该模型中，仿真区域被设置成拥有若干出入口，移动节点通过出入口进出区域，移动节点在区域内的移动遵从SMS节点移动模型，节点在区域内外移动的转移通过驻留概率进行决策。然后对节点在区域内运动的平均移动路程、平均驻留时间、稳态移动速度以及节点空间分布概率等运动特征进行了数学分析，同时还研究了出入口对各项运动特征的影响。SMSWE模型继承了SMS模型对节点运动的细粒度控制，同时充分考虑了区域的出入口对节点移动的影响。仿真实验和理论分析的结果表明，SMSWE模型克服了RWPWE模型存在的节点向区域中心聚集的缺陷,更好地描述和模拟了多出入口区域网络节点的实际移动模式和特点。因此，在区域具有多出入口的真实环境中，采用SMSWE模型能更好地模拟Ad hoc网络的拓扑变化，从而对网络协议做出更加准确的分析、评价。
2.提出了一种实用于多跳无线网络的网络编码感知路由协议。网络编码是有效提高无线多跳网络吞吐量的新方法之一。为了有效的将网络编码技术应用到真实网络中，本文提出了一种实用于多跳无线网络的编码感知单播路由协议。该协议以一种新颖的能有效描述网络编码和单播会话特性的路由量度为基础。为了确保这种路由度量能够与广泛使用的路径计算算法进行有效结合，文中使用了一种独特映射过程将真实网络映射成虚拟网络。这种独特映射过可以确保常用路由计算算法获得编码机会最多的路径。仿真结果显示本文提出的路由协议能有效提高网络吞吐量。
3.推导出了基于缓存的路由修复机制的数学模型，提出了适用于大规模异构无线自组织网络路由修复策略。通过对基于缓存的路由修复机制进行数学建模和理论分析，得出了基于缓存的路由修复机制的最优缓存策略应具有如下三种性质：（1）优先缓存寿命长的可用路径；（2）优先探测寿命长的可用路径；（3）对于每次路由发现的可用路径集合，最优化缓存阈值总是存在。本文基于这些关键性质，设计了一个最优缓存算法，并通过仿真对最优化缓存策略和最优缓存算法的正确性和有效性进行了验证。
4.将路由协议的设计与遗传算法和路由代数理论等技术相结合，提出了一种开放的网络路由协议设计框架Orchestra。Orchestra框架可以对路由协议相关研究者们的工作成果进行充分复用，从而极大地简化路由协议的设计工作、极大地提高路由设计者们的工作效率，同时，Orchestra框架被设计成一种具有高开放性、高兼容性以及高易用性等特点的无线网络路由协议仿真开发平台，该框架设计之初就考虑到了对多种已广泛部署和使用的路由协议的兼容。Orchestra框架不仅能够帮助研究者们方便地实现路由协议的设计和实现，同时还支持如下自动化工作：自动对新开发模块进行测试；自动将用户开发的不同模块进行组合；利用智能进化技术，自动地在可选集中搜索适合当前网络状态的最佳路由协议，以及路由协议运行参数。
Ad hoc network is a new kind of wireless network that does not rely on fixednetwork infrastructure. In ad hoc network, nodes can quickly build a communicationnetwork through a self-organizing way to achieve inter-node communication,information collection, information processing and information distribution. With adhoc networks, people make the dream possible to freely communicate in anyenvironment, as well as provide effective solutions for military communication, disasterrelief and temporary communication. In ad hoc networks, due to the constraints of nodetransmission capacity, distant nodes must adopt a routing protocol to exchangeinformation through multi-hop communication. The quality of routing protocol greatlyinfluences and even determines the performance of the ad hoc network. Therefore, therouting technology is a key technology of the ad hoc network, but also one hot spot oncommunication field of ad hoc network. since the proposed of wireless ad hoc network,the routing technology is always being a key technology of the ad hoc network, but alsoone hot spot on communication field of ad hoc network, widespread concerned by theresearchers.
This dissertation takes depth study on some crucial and fundamental routingproblems in wireless ad hoc networks. These problems include modeling node mobilitymodel of wireless ad hoc network, performance analysis and improvement of routingprotocol for wireless ad hoc network, and new routing protocol design method andframework.
Based on the study of these problems, we make some contributions which arelisted as follows:
1. The dissertation proposes a node mobility model which is suitable forapplications to the region with multi-entrances. In ad hoc networks, the key study ofprotocols analysis and simulation is to choose a practical node mobility model. In thispaper, we propose an optimal and realistic node mobility model, Semi-Markov Smoothwith Entrances (SMSWE), which is used in the region with multi-entrances. In thismodel, the nodes definitely pass from one of the multi-entrances at the boundary of the region to enter the region, and then move according to the SMS in the region. Theresidence probability is introduced to decide the moving transform from interior toexternal of the region. SMSWE inherits fine-grained control to nodal movement fromSMS, also gives sufficient consideration to the influence of entrances. Theoreticalanalysis and simulation show that SMSWE model is more close to reality with smoothmobility and consideration of influence of entrances. SMSWE overcomes the defect thatnodes gather to the regional center in RWPWE. With SMSWE model, we can describeand simulate nodal mobility patterns and ad hoc network topology in the region withentrances better, and make more accurate analysis and evaluation to network protocols.
2. The dissertation proposes a practical network-coding aware routing protocol forunicast sessions in wireless networks. The selection of routes is an important issue inwireless networks when network coding is used. Existing research formulatenetwork-coding-aware routing as a linear optimization program. However, deployingsuch method in real wireless networks is impractical. To solve this issue, in this paper, apractical network-coding aware routing protocol is proposed for unicast sessions inwireless networks. The protocol is based on a novel routing metric design that capturesthe characteristics of network coding and unicast sessions. To ensure the novel routingmetric can operate with practical and widely available path calculation mechanisms, aunique mapping process is used to map a real wireless network to a virtual network. Themapping process ensures that the paths with the biggest coding opportunities will beselected by commonly used path calculation mechanisms. Simulation results show thatthe proposed routing protocol is effective.
3. A mathematical model is derived based on the the cached routing repairmechanism, and a route repair strategy for large-scale heterogeneous wirelessself-organizing network is proposed. Real-time applications in ad hoc networks requirefast route repair mechanisms to minimize the interruptions to their communications.Cache-based route repair schemes are popular choices since they can quickly resumecommunications using cached backup paths after a route break. In this paper, throughtheoretical modeling of the cache-based route repair process, we derive the optimalcache-based route repair policy. This optimal policy considers both the overhead of theroute repair schemes and the promptness of the repair action. The correctness andadvantages of our optimal policy are validated by extensive simulations.
4. The dissertation combines routing protocol design with genetic algorithms androuting algebra theory, and proposes an open network routing protocol designframework, called as Orchestra. Orchestra can fully reuse the working results of theresearchers related to routing protocol, which greatly improve working efficiency of therouting protocol designers and greatly simplify the design of routing protocols.Orchestra is also designed as a platform for the study and simulation of wirelessnetwork routing protocols with high openness and high compatibility. In the beginningof the framework design, to be compatible with the variety of existed routing protocolswidely deployed and used has been taken into account. Orchestra framework can helpresearchers to easily design and implement routing protocols, and also support someautomation work as follows: automatically test new modules, automatically combinedifferent modules developed by researches, and automatically find the optimum routingprotocol and operating parameters suitable for the current network status.
本文针对无线Ad hoc网络路由技术中的一些基础性、关键性问题进行了深入研究。这些问题包括：无线Ad hoc网络移动模型建模、无线Ad hoc网络路由协议性能分析及改进、新型路由协议设计方法及框架等。通过对这些问题的研究，本文取得了如下研究成果：
1.提出一种适用于具有多出入口区域的节点移动模型。在仿真研究中选择最贴近实际、最易于实现的节点移动模型是研究的基础，也是成功的关键。然而，现有节点移动模型大多是基于理想环境设计的，不适用于真实环境。本文首先提出了具有多个出入口区域的SMS节点移动模型(SMS with entrances，SMSPWE)。在该模型中，仿真区域被设置成拥有若干出入口，移动节点通过出入口进出区域，移动节点在区域内的移动遵从SMS节点移动模型，节点在区域内外移动的转移通过驻留概率进行决策。然后对节点在区域内运动的平均移动路程、平均驻留时间、稳态移动速度以及节点空间分布概率等运动特征进行了数学分析，同时还研究了出入口对各项运动特征的影响。SMSWE模型继承了SMS模型对节点运动的细粒度控制，同时充分考虑了区域的出入口对节点移动的影响。仿真实验和理论分析的结果表明，SMSWE模型克服了RWPWE模型存在的节点向区域中心聚集的缺陷,更好地描述和模拟了多出入口区域网络节点的实际移动模式和特点。因此，在区域具有多出入口的真实环境中，采用SMSWE模型能更好地模拟Ad hoc网络的拓扑变化，从而对网络协议做出更加准确的分析、评价。
2.提出了一种实用于多跳无线网络的网络编码感知路由协议。网络编码是有效提高无线多跳网络吞吐量的新方法之一。为了有效的将网络编码技术应用到真实网络中，本文提出了一种实用于多跳无线网络的编码感知单播路由协议。该协议以一种新颖的能有效描述网络编码和单播会话特性的路由量度为基础。为了确保这种路由度量能够与广泛使用的路径计算算法进行有效结合，文中使用了一种独特映射过程将真实网络映射成虚拟网络。这种独特映射过可以确保常用路由计算算法获得编码机会最多的路径。仿真结果显示本文提出的路由协议能有效提高网络吞吐量。
3.推导出了基于缓存的路由修复机制的数学模型，提出了适用于大规模异构无线自组织网络路由修复策略。通过对基于缓存的路由修复机制进行数学建模和理论分析，得出了基于缓存的路由修复机制的最优缓存策略应具有如下三种性质：（1）优先缓存寿命长的可用路径；（2）优先探测寿命长的可用路径；（3）对于每次路由发现的可用路径集合，最优化缓存阈值总是存在。本文基于这些关键性质，设计了一个最优缓存算法，并通过仿真对最优化缓存策略和最优缓存算法的正确性和有效性进行了验证。
4.将路由协议的设计与遗传算法和路由代数理论等技术相结合，提出了一种开放的网络路由协议设计框架Orchestra。Orchestra框架可以对路由协议相关研究者们的工作成果进行充分复用，从而极大地简化路由协议的设计工作、极大地提高路由设计者们的工作效率，同时，Orchestra框架被设计成一种具有高开放性、高兼容性以及高易用性等特点的无线网络路由协议仿真开发平台，该框架设计之初就考虑到了对多种已广泛部署和使用的路由协议的兼容。Orchestra框架不仅能够帮助研究者们方便地实现路由协议的设计和实现，同时还支持如下自动化工作：自动对新开发模块进行测试；自动将用户开发的不同模块进行组合；利用智能进化技术，自动地在可选集中搜索适合当前网络状态的最佳路由协议，以及路由协议运行参数。
Ad hoc network is a new kind of wireless network that does not rely on fixednetwork infrastructure. In ad hoc network, nodes can quickly build a communicationnetwork through a self-organizing way to achieve inter-node communication,information collection, information processing and information distribution. With adhoc networks, people make the dream possible to freely communicate in anyenvironment, as well as provide effective solutions for military communication, disasterrelief and temporary communication. In ad hoc networks, due to the constraints of nodetransmission capacity, distant nodes must adopt a routing protocol to exchangeinformation through multi-hop communication. The quality of routing protocol greatlyinfluences and even determines the performance of the ad hoc network. Therefore, therouting technology is a key technology of the ad hoc network, but also one hot spot oncommunication field of ad hoc network. since the proposed of wireless ad hoc network,the routing technology is always being a key technology of the ad hoc network, but alsoone hot spot on communication field of ad hoc network, widespread concerned by theresearchers.
This dissertation takes depth study on some crucial and fundamental routingproblems in wireless ad hoc networks. These problems include modeling node mobilitymodel of wireless ad hoc network, performance analysis and improvement of routingprotocol for wireless ad hoc network, and new routing protocol design method andframework.
Based on the study of these problems, we make some contributions which arelisted as follows:
1. The dissertation proposes a node mobility model which is suitable forapplications to the region with multi-entrances. In ad hoc networks, the key study ofprotocols analysis and simulation is to choose a practical node mobility model. In thispaper, we propose an optimal and realistic node mobility model, Semi-Markov Smoothwith Entrances (SMSWE), which is used in the region with multi-entrances. In thismodel, the nodes definitely pass from one of the multi-entrances at the boundary of the region to enter the region, and then move according to the SMS in the region. Theresidence probability is introduced to decide the moving transform from interior toexternal of the region. SMSWE inherits fine-grained control to nodal movement fromSMS, also gives sufficient consideration to the influence of entrances. Theoreticalanalysis and simulation show that SMSWE model is more close to reality with smoothmobility and consideration of influence of entrances. SMSWE overcomes the defect thatnodes gather to the regional center in RWPWE. With SMSWE model, we can describeand simulate nodal mobility patterns and ad hoc network topology in the region withentrances better, and make more accurate analysis and evaluation to network protocols.
2. The dissertation proposes a practical network-coding aware routing protocol forunicast sessions in wireless networks. The selection of routes is an important issue inwireless networks when network coding is used. Existing research formulatenetwork-coding-aware routing as a linear optimization program. However, deployingsuch method in real wireless networks is impractical. To solve this issue, in this paper, apractical network-coding aware routing protocol is proposed for unicast sessions inwireless networks. The protocol is based on a novel routing metric design that capturesthe characteristics of network coding and unicast sessions. To ensure the novel routingmetric can operate with practical and widely available path calculation mechanisms, aunique mapping process is used to map a real wireless network to a virtual network. Themapping process ensures that the paths with the biggest coding opportunities will beselected by commonly used path calculation mechanisms. Simulation results show thatthe proposed routing protocol is effective.
3. A mathematical model is derived based on the the cached routing repairmechanism, and a route repair strategy for large-scale heterogeneous wirelessself-organizing network is proposed. Real-time applications in ad hoc networks requirefast route repair mechanisms to minimize the interruptions to their communications.Cache-based route repair schemes are popular choices since they can quickly resumecommunications using cached backup paths after a route break. In this paper, throughtheoretical modeling of the cache-based route repair process, we derive the optimalcache-based route repair policy. This optimal policy considers both the overhead of theroute repair schemes and the promptness of the repair action. The correctness andadvantages of our optimal policy are validated by extensive simulations.
4. The dissertation combines routing protocol design with genetic algorithms androuting algebra theory, and proposes an open network routing protocol designframework, called as Orchestra. Orchestra can fully reuse the working results of theresearchers related to routing protocol, which greatly improve working efficiency of therouting protocol designers and greatly simplify the design of routing protocols.Orchestra is also designed as a platform for the study and simulation of wirelessnetwork routing protocols with high openness and high compatibility. In the beginningof the framework design, to be compatible with the variety of existed routing protocolswidely deployed and used has been taken into account. Orchestra framework can helpresearchers to easily design and implement routing protocols, and also support someautomation work as follows: automatically test new modules, automatically combinedifferent modules developed by researches, and automatically find the optimum routingprotocol and operating parameters suitable for the current network status.
引文
[1] M. Mouly, M. B. Pautet, and T. F. Haug. The GSM system for mobilecommunications[M]. Telecom Publishing,1992.
[2] R. J. Bates. GPRS: general packet radio service[M]. McGraw-Hill Professional,2001.
[3] C. S. R. Murthy, B. S. Manoj. Ad hoc Wireless Networks: Architectures andProtocols[M]. Prentice Hall PTR,2004.
[4] R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, et al. Advances in packet ratiotechnology[C]. Proceedings of the IEEE,1978,66:1468-1496.
[5] N. Shacham, J. Westcott. Future directions in packet radio architectures andprotocols[C]. Proceedings of the IEEE,1987,75:83-99.
[6] B. M. Leiner, R. J. Ruther, A. R. Sastry. Goals and challenges of the DARPA GloMoprogram [global mobile information systems][J]. Personal Communications, IEEE,1996,3:34-43.
[7] I. P.-T. W. G. f. W. Standards[OL], http://www.ieee802.org/11/.
[8] I. M. Charter. http://www.ietf.org/dyn/wg/charter/manet-charter.html[OL].
[9] J. P. Macker, M. S. Corson. Mobile ad hoc networking and the IETF[C]. SIGMOBILEMobile Computer Communication Review,1998,2:9-14.
[10] M. Frodigh, P. Johansson, P. Larsson. Wireless Ad hoc networking-The art ofnetworking without a network[M]. Ericsson Review,2000,4.
[11] C. K. K. Toh. Ad hoc Wireless Networks: Protocols and Systems[M]. Prentice HallPTR,2001.
[12] R. Rajaraman. Topology control and routing in ad hoc networks: a survey[J]. SIGACTNews,2002,33:60-73.
[13] G. Sharma, R. Mazumdar, N. B. Shroff. Delay and capacity trade-offs in mobile ad hocnetworks: a global perspective[J]. IEEE/ACM Trans, Networking,2007,15:981-992.
[14] N. Borisov, I. Goldberg, D. Wagner. Intercepting mobile communications: the insecurityof802.11[C]. Proceedings of the7th annual international conference on Mobilecomputing and networking Rome, Italy: ACM,2001.
[15]陈林星,曾曦,曹毅.移动Ad hoc网络:自组织分组无线网络技术[M].电子工业出版社,2006.
[16]郑少仁,王海涛,赵志峰等. Ad hoc网络技术[M].人民邮电出版社,2005.
[17]李勇,黄均才,王凤碧等. Ad hoc网络体系结构研究[J].计算机应用,2005:163-175.
[18] G. Pei,, M. Gerla, and T. W. Chen. Fisheye state routing: A routing scheme for ad hocwireless networks[C]. Communications, ICC2000,70-74.
[19] P. Jacquet. Optimized link state routing protocol (OLSR)[OL].http://tools.ietf.org/html/rfc3626.
[20] A. Boukerche, S.K. Das, and A. Fabbri. Analysis of a randomized congestion controlscheme with DSDV routing in ad Hoc wireless networks[M]. Elsevier press,2001,967-995.
[21] G. Pei, M. Gerla, and X. Hong. LANMAR: landmark routing for large scale wireless adhoc networks with group mobility[C]. Proceedings of the1st ACM internationalsymposium on Mobile ad hoc networking&computing,2000, p.11-18.
[22] Y.-B. Ko, N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks[J].Wireless Network,2000,6:307-321.
[23] E. Huang, W. Hu, J. Crowcroft, et al. Towards commercial mobile ad hoc networkapplications: a radio dispatch system[C]. Proceedings of the6th ACM internationalsymposium on Mobile ad hoc networking and computing Urbana-Champaign, IL, USA:ACM,2005.
[24] W. Kiess, M. Mauve. A survey on real-world implementations of mobile ad-hocnetworks[J]. Ad hoc Network,2007,5:324-339.
[25] T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc networkresearch[J]. Wireless Communication and mobile computing,2002,2(5):483-502.
[26] S. M. Ross. Introduction to probability models[M]. Academic press,2009.
[27] B. Liang and Z. Haas. Predictive distance-based mobility management for PCSnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM), March1999.
[28] X. Hong, M. Gerla, G. Pei, et al. A group mobility model for ad hoc wirelessnetworks[C]. Proceedings of the ACM International Workshop on Modeling andSimulation of Wireless and Mobile Systems (MSWiM), August1999.
[29] E. W. Weisstein. The CRC Concise Encyclopedia of Mathematics[M]. CRC Press,1998.
[30] A. Bar-Noy, I. Kessler, and M. Sidi. Mobile users: To update or not to update[C].Proceedings of the Joint Conference of the IEEE Computer and CommunicationsSocieties (INFOCOM), pages570–576,1994.
[31] J. J. Garcia-Luna-Aceves and E. L. Madrga. A multicast routing protocol for ad-hocnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM),1999,784–792.
[32] I. Rubin and C. Choi. Impact of the location area structure on the performance ofsignaling channels in wireless cellular networks[M]. IEEE Communications Magazine,1997,108–115.
[33] M. Zonoozi and P. Dassanayake. User mobility modeling and characterization ofmobility pattern[J]. IEEE Journal on Selected Areas in Communications,1997,15(7):1239–1252.
[34] S. Basagni, I. Chlamtac, V. R. Syrotiuk, et al. A distance routing effect algorithm formobility (DREAM)[C]. Proceedings of the ACM/IEEE International Conference onMobile Computing and Networking (MOBICOM),1998, pages76–84.
[35] D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks[M]. T.Imelinsky and H. Korth, editors, Mobile Computing, Kluwer Academic Publishers,1996, pages153–181.
[36] E. Royer, P. M. Melliar-Smith, and L. Moser. An analysis of the optimum node densityfor ad hoc mobile networks[C]. Proceedings of the IEEE International Conference onCommunications (ICC),2001.
[37] V. Davies. Evaluating mobility models within an ad hoc network[D]. Master’s thesis.Colorado School of Mines,2000.
[38] C. Chiang. Wireless Network Multicasting[D]. PhD thesis, University of California, LosAngeles,1998.
[39] Z. Haas. A new routing protocol for reconfigurable wireless networks[C]. Proceedingsof the IEEE International Conference on Universal Personal Communications (ICUPC),pages562–565, Oct.1997.
[40] B. Liang and Z. Haas. Predictive distance-based mobility management for PCSnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM), March1999.
[41] V. Tolety. Load reduction in ad hoc networks using mobile servers[D]. Master’s thesis,Colorado School of Mines,1999.
[42] M. Zhao, and W. Wang. A Novel Semi-Markov Smooth Mobility Model for Mobile Adhoc Networks[C], GLOBECOM,2006:1-5.
[43] X. Hong, M. Gerla, G. Pei, et al. A group mobility model for ad hoc wirelessnetworks[C]. Proceedings of the ACM International Workshop on Modeling andSimulation of Wireless and Mobile Systems (MSWiM), August1999.
[44] M. Sanchez and P. Manzoni. Anejos: A java based simulator for ad-hoc networks[J].Future Generation Computer Systems,17(5):573–583,2001.
[45] M. Sanchez. Mobility models[OL]. http://www.disca.upv.es/misan/mobmodel.htm. Pageaccessed on May30th,2002.
[46] M. Sanchez and P. Manzoni. Anejos: A java based simulator for ad-hoc networks[J].Future Generation Computer Systems,17(5):573–583,2001.
[47] C. E. Perkins, P. Bhagwat. Highly dynamic Destination-Sequenced Distance-Vectorrouting for mobile computers[C]. SIGCOMM Computer Communication Review,1994,24:234-244.
[48] G. Pei. A wireless hierarchical routing protocol with group mobility[C]. WirelessCommunications and Networking Conference,1999, IEEE press,1538-1542.
[49] T. W. Chen, and M. Gerla. Global state routing: A new routing scheme for ad-hocwireless networks[C]. ICC IEEE International Conference on Communications (ICC),1998, IEEE press,171-175.
[50] S. Murthy and J. J. Garcia-Luna-Aceves. An efficient routing protocol for wirelessnetworks[M].1996, Springer press,183-197.
[51] Y. C. Hu, D. B. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routingfor mobile wireless ad hoc networks[M]. Elsevier,2003:175-192.
[52] R. V. Boppana, and S. P. Konduru. An adaptive distance vector routing algorithm formobile ad hoc networks[C]. IEEE INFOCOM,2001:1753-1762.
[53] Y. Huang, and S. Bhatti. Fast-converging distance vector routing for wireless meshnetworks[C]. Distributed Computing Systems Workshops, ICDCS'08,2008, IEEE press,279-284.
[54] D. B. Johnson, D. A. Maltz, J. Broch. DSR: the dynamic source routing protocol formultihop wireless ad hoc networks[P]. Ad hoc networking: Addison-Wesley LongmanPublishing Co., Inc.,2001:139-172.
[55] C. E. Perkins, E. M. Royer. Ad-hoc On-Demand Distance Vector Routing[C].Proceedings of the Second IEEE Workshop on Mobile Computer Systems andApplications: IEEE Computer Society,1999.
[56] V. D. Park and S. Corson. A highly adaptive distributed routing algorithm for mobilewireless networks[C]. Proceedings of INFOCOM,1997, pages.1405–1413.
[57] V. D. Park and S. Corson. Temporally-ordered routing algorithm (TORA) version1functional specification (Internet-draft)[C]. Mobile Ad-hoc Network (MANET)Working Group, IETF,1998.
[58] M. Abolhasan, T. Wysocki, and E. Dutkiewicz. A review of routing protocols for mobilead hoc networks[M]. Elsevier,2004, pages.1-22.
[59] Y. C. Hu, D. B. Johnson. Caching strategies in on-demand routing protocols for wirelessad hoc networks[C]. Proceedings of the6th annual international conference on Mobilecomputing and networking Boston, Massachusetts, United States: ACM,2000.
[60] M. K. Marina, S. R.Das. Performance of Route Caching Strategies in Dynamic SourceRouting[C]. Proceedings of the21st International Conference on Distributed ComputingSystems: IEEE Computer Society,2001.
[61] W. Lou, Y. Fang. Predictive caching strategy for on-demand routing protocols inwireless ad hoc networks[J]. Wireless Network,2002,8:671-679.
[62] X. Yu. Distributed Cache Updating for the Dynamic Source Routing Protocol[J]. IEEETransactions on Mobile Computing,2006,5:609-626.
[63] P. Papadimitratos, Z. Haas. Secure Routing for Mobile Ad hoc Networks (MC2R)[C].Communication Networks and Distributed Systems Modeling and SimulationConference (CNDS),2002:27--31.
[64] Y. C. Hu, A. Perrig, D. B. Johnson. Ariadne: a secure on-demand routing protocol for adhoc networks[J]. Wireless Network,2005,11:21-38.
[65] J. Kim, G. Tsudik. SRDP: Securing Route Discovery in DSR[C]. Proceedings of the TheSecond Annual International Conference on Mobile and Ubiquitous Systems,2005.
[66] G. Acs, L. Buttyan, I. Vajda. Provably Secure On-Demand Source Routing in Mobile Adhoc Networks[J]. IEEE Transactions on Mobile Computing,2006,5:1533-1546.
[67] W. J. Tsaur, H. T. Pai. A new security scheme for on-demand source routing in mobilead hoc networks[C]. Proceedings of the2007international conference on Wirelesscommunications and mobile computing Honolulu, Hawaii, USA: ACM,2007.
[68] K. Sanzgiri, B. Dahill, B. N. Levine, et al. A Secure Routing Protocol for Ad hocNetworks[C]. Proceedings of the10th IEEE International Conference on NetworkProtocols: IEEE Computer Society,2002.
[69] M. G. Zapata. Secure ad hoc on-demand distance vector routing[C]. SIGMOBILEMobile Computer Communication Review,2002,6:106-107.
[70] L. R. Reddy, S. V. Raghavan. SMORT: Scalable multipath on-demand routing formobile ad hoc networks. Ad hoc Network,2007,5:162-188.
[71] A. Patwardhan, J. Parker, M. Iorga, et al. Threshold-based intrusion detection in ad hocnetworks and secure AODV[J]. Ad hoc Network.,2008,6:578-599.
[72] O. Al-Jarrah, O. Megdadi. Enhanced AODV routing protocol for Bluetooth scatternet[J].Computer Electronic England,2009,35:197-208.
[73] Z. J. Haas, M. R. Pearlman, and P. Samar, The zone routing protocol (ZRP) for ad hocnetworks[P].2002.
[74] Z. J. Haas, M. R. Pearlman, P. Samar, et al. Intrazone Routing Protocol (IARP)[P].2002.
[75] J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hoprouting in the internet[J]. IEEE/ACM Transaction Network,2002,10:541-550.
[76] J. L. Sobrinho. Network routing with path vector protocols: theory and applications[C].Proceedings of the2003conference on Applications, technologies, architectures, andprotocols for computer communications Karlsruhe, Germany: ACM,2003.
[77] J. L. Sobrinho. An algebraic theory of dynamic network routing[J]. IEEE/ACMTransaction Network,2005,13:1160-1173.
[78] T. G. Griffin, J. L. Sobrinho. Metarouting[C]. Proceedings of the2005conference onApplications, technologies, architectures, and protocols for computer communicationsPhiladelphia, Pennsylvania, USA: ACM,2005.
[79] A. J. T. Gurney, T. G. Griffin. Lexicographic products in metarouting[C]. IEEEInternational Conference on Network Protocols, ICNP,2007:113-122.
[80] Y. Yaling, W. Jun. Design Guidelines for Routing Metrics in Multihop WirelessNetworks[C]. The27th Conference on Computer Communications, INFOCOM,2008:1615-1623.
[81] L. Mingming, W. Jie. Opportunistic Routing Algebra and its Applications[C].INFOCOM,2009:2374-2382.
[82] J. Broch, D. A. Maltz, D. B. Johnson, et al. A performance comparison of multi-hopwireless ad hoc network routing protocols[C]. Proceedings of the4th annual ACM/IEEEinternational conference on Mobile computing and networking Dallas, Texas, UnitedStates: ACM,1998.
[83] D. S. J. D. Couto, D. Aguayo, B. A. Chambers, et al. Performance of multihop wirelessnetworks: shortest path is not enough[C]. SIGCOMM Computer CommunicationReview,2003,33:83-88.
[84] A. Boukerche. Performance evaluation of routing protocols for ad hoc wirelessnetworks[J], Mobile Network Application,2004,9:333-342.
[85] H. Ehsan, Z. A. Uzmi, Performance comparison of ad hoc wireless network routingprotocols[C]. Proceedings of INMIC2004,8th International Conference,2004:457-465.
[86] P. Arce, J. C. Guerri, A. Pajares, et al. Performance evaluation of video streaming overad hoc networks using flat and hierarchical routing protocols[J]. Mobile NetworkApplication,2008,13:324-336.
[87] P. J. Wan, C. W. Yi, F. Yao, et al, Asymptotic critical transmission radius for greedyforward routing in wireless ad hoc networks[C]. Proceedings of the7th ACMinternational symposium on Mobile ad hoc networking and computing Florence, Italy:ACM,2006.
[88] L. Wang, C. W. Yi, F. Yao. Improved asymptotic bounds on critical transmission radiusfor greedy forward routing in wireless ad hoc networks[C]. Proceedings of the9th ACMinternational symposium on Mobile ad hoc networking and computing Hong Kong,Hong Kong, China: ACM,2008.
[89] Y. Wang, C. W. Yi, F. Li. Delivery Guarantee of Greedy Routing in Three DimensionalWireless Networks[C]. Proceedings of the Third International Conference on WirelessAlgorithms, Systems, and Applications Dallas, Texas: Springer-Verlag,2008.
[90] S. Katti, H. Rahul, W. Hu, D. Katabi, et al. XORs in the air: practical wireless networkcoding[C]. SIGCOMM Computer Communication Review,2006,36:243-254.
[91] S. Chachulski, M. Jennings, S. Katti, et al. Trading structure for randomness in wirelessopportunistic routing[C]. Proceedings of the2007conference on Applications,technologies, architectures, and protocols for computer communications Kyoto, Japan:ACM,2007.
[92] S. Katti, D. Katabi, H. Balakrishnan, et al. Symbol-level network coding for wirelessmesh networks[C]. SIGCOMM Computer Communication Review,2008,38:401-412.
[93] L. Fan, W. Yu. Routing in vehicular ad hoc networks: A survey[M]. VehicularTechnology Magazine, IEEE,2007,2:12-22.
[94] S. Ghazizadeh, O. Ilghami, E. Sirin, et al. Security-Aware Adaptive Dynamic SourceRouting Protocol[C]. Proceedings of the27th Annual IEEE Conference on LocalComputer Networks: IEEE Computer Society,2002.
[95] A. Perrig, J. D. Tygar, D. Song, et al. Efficient Authentication and Signing of MulticastStreams over Lossy Channels[C]. Proceedings of the2000IEEE Symposium onSecurity and Privacy: IEEE Computer Society,2000.
[96] K. Sanzgiri, B. Dahill, B. N. Levine, et al. Belding-Royer, A secure routing protocol forad hoc networks[C]. Proceedings of10th IEEE International Conference on NetworkProtocols,2002:78-87.
[97] S. Marti, T. J. Giuli, K. Lai, et al. Mitigating routing misbehavior in mobile ad hocnetworks[C]. Proceedings of the6th annual international conference on Mobilecomputing and networking Boston, Massachusetts, United States: ACM,2000.
[98] S. Buchegger, J. Y. L. Boudec, Performance analysis of the confident protocol[C].Proceedings of the3rd ACM international symposium on Mobile ad hoc networking&computing Lausanne, Switzerland: ACM,2002.
[99] L. Butty, J. P. Hubaux. Stimulating cooperation in self-organizing mobile ad hocnetworks[J]. Mobile Network Application,2003,8:579-592.
[100] S. Zhong, J. Chen, Y. R. Yang. Sprite: a simple, cheat-proof, credit-based system formobile ad-hoc networks[C]. Twenty-Second Annual Joint Conference of the IEEEComputer and Communications, INFOCOM,2003:1987-1997vol.3.
[101] L. Anderegg, S. Eidenbenz. Ad hoc-VCG: a truthful and cost-efficient routing protocolfor mobile ad hoc networks with selfish agents[C]. Proceedings of the9th annualinternational conference on Mobile computing and networking San Diego, CA, USA:ACM,2003.
[102] S. Eidenbenz, G. Resta, P. Santi. COMMIT: a sender-centric truthful andenergy-efficient routing protocol for ad hoc networks with selfish nodes[C]. Proceedingsof19th IEEE International in Parallel and Distributed Processing Symposium,2005:10.
[103] S. Zhong, L. Li, Y. G. Liu, et al. On designing incentive-compatible routing andforwarding protocols in wireless ad-hoc networks: an integrated approach using gametheoretical and cryptographic techniques[C]. Proceedings of the11th annualinternational conference on Mobile computing and networking Cologne, Germany:ACM,2005.
[104] W. Wang, S. Eidenbenz, Y. Wang, et al. OURS: optimal unicast routing systems innon-cooperative wireless networks[C]. Proceedings of the12th annual internationalconference on Mobile computing and networking Los Angeles, CA, USA: ACM,2006.
[105] I. Akyildiz, W. Su, Y. Sankarasubramaniam, et al. Wireless sensor networks: Asurvey[J]. Computer Networks,2002,38(4):393422.
[106] C. Bettstetter. Smooth is better than sharp: A random mobility model for simulation ofwireless networks[C]. Proceedings of the ACM Int’l Symp. on MSWiM. ACM Press,2001.1927.
[107] M. Zhao, W. Wang. A unified mobility model for analysis and simulation of mobilewireless networks [J]. Wireless Networks,2009,15(3):365--389.
[108] T. Camp, J. Boleng, V. Davies. A survey of mobility models for ad hoc network research[J]. Wireless Communications&Mobile Computing (WCMC), Special Issue on Mobilead Hoc Networking: Research, Trends and Applications,2002,2(5);483-502.
[109] C. Bettstetter. Mobility modeling in wireless networks: Categorization, smoothmovement, and border effects[C]. Mobile Computing and Communications Review,2001,5(3):5566.
[110]时锐，杨孝宗．自组网Random Waypoint移动模型点空间概率分布的研究[J]．计算机研究与发展，2005，42(12)：2056—2062.
[111] J. Yoon, M. Liu, B. Noble. Random waypoint considered harmful[C]. Proceedings ofthe IEEE INFOCOM, Vol.2. San Francisco,2003.13121321.
[112] G. Lu, D. Bells, G. Manson. Study on environment mobility models for mobile ad hocnetwork: Hotspot mobility model and route mobility model[C].2005Int’l Conferenceon Wireless Networks,2005.808—813.
[113] N. Aschenbruck, E. Gerhards-Padilla, and P. Martini. Modeling mobility in disasterarea scenarios[M]. Performance Evaluation, Elsevier,2009,66(12):773-790.
[114] A. P. Jardosh, E. M. Belding, Royer, et a1. Real-world environment models for mobilenetwork evaluation[J]. IEEE Journal on Selected Areas in Communications,2005,23(3):622-632.
[115]王伟，蔡皖东等．基于圆周运动的自组网移动模型[J]．计算机研究与发展，2009，44(6)：932—938.
[116]公维宾，常义林等．具有多出入口区域的节点移动和分布研究[J]．计算机研究与发展，2008，45(3)：428--435.
[117] C. Bettstetter, G. Resta, P. Santi. The node distribution of the random waypoint mobilitymodel for wireless ad hoc networks[J]. IEEE Trans on Mobile Computing,2003,2(3):257—269.
[118] R. W. Yeung, Z. Zhang. Distributed source coding for satellite communications[J]. IEEETrans on Information Theory,1999,45:1111–1120.
[119] R. Ahlswede, N. Cai, S. Y. R. Li. Network information flow[J]. IEEE Trans onInformation Theory,2002,46(4):1204-1216.
[120] Y. Wu, P. A. Chou, S. Y. Kung, et al. Information exchange in wireless networks withnetwork coding and physical layer broadcast[C]. Proceedings of39th AnnualConference on Information Sciences and Systems (CISS), Mar,2005.
[121]A. Ramamoorthy, J. Shi, R. Wesel. On the capacity of network coding for wirelessnetworks[J]. IEEE Trans on Information Theory On the capacity of network codingfor wireless networks,2005,51(8):2878-2885.
[122] J. Le, J. C. S. Lui, D. M. Chiu. How Many Packets Can We Encode? An Analysis ofPractical Wireless Network Coding[C]. Proceedings of IEEE INFOCOM2008.371-375.
[123] S. Katti, H. Rahul, W. Hu, et al. XORs in the Air: Practical Wireless NetworkCoding[C]. Proceedings of ACM SIGCOMM06, Aug,2006,243-254.
[124] D. S. J. D. Couto, D. Aguayo, J. Bicket, et al. A high throughput path metric formulti-hop wireless routing[C]. Proceedings of ACM MobiCom03, Sept.2003,419-434.
[125] D. S. Lun, M. Medard, T. Ho, et al. Network Coding with a Cost Criterion[C].Proceedings of International Symposium on Information Theory and its Applications,2004,1232-1237.
[126] Y. N. Wu, P. A. Chou, S. Y. Kung. Minimum-energy multicast in mobile ad hocnetworks using network coding. Information Theory Workshop, IEEE,2004,304-309.
[127] B. Ni, N. Santhapuri, Z. Zhong, et al. Routing with Opportunistically Coded Exchangesin Wireless Mesh Networks[C]. Proceedings of WiMesh06,2nd IEEE Workshop on,Reston, VA, USA,2006,157-159.
[128] S. Sengupta, S. Rayanchu, S. Banerjee. An Analysis of Wireless Network Coding forUnicast Sessions: The Case for Coding-Aware Routing[C]. Proceedings of IEEEINFOCOM,2007,1028-1036.
[129] P. Chaporkar, A. Proutiere. Adaptive Network Coding and Scheduling for MaximizingThroughput in Wireless Networks[C]. ACM MOBICOM,2007,135-146.
[130] J. Le, J. Lui, D. M. Chiu. DCAR: Distributed coding-aware routing in wirelessnetworks[C]. International Conference on Distributed Computing Systems (ICDCS),2008.
[131] Y. L. Yang, J. Wang. Design guidelines for routing metrics in multi-hop wirelessnetworks[C]. Proceedings of IEEE INFOCOM,2008,1615-1623.
[132] E. ROYER, C. TOH. A review of current routing protocols for Ad hoc mobile wirelessnetworks [J]. IEEE Personal Communications,1999,6(2):46-55.
[133] W. K. LAI, S. Y. HSIAO, Y. C. LIN. Adaptive backup routing for ad hoc networks [J].Computer Communications,2007,30:453–464.
[134] S. J. LEE, M. GERLA. AODV-BR: Backup routing in ad hoc networks [C]. Proceedingsof IEEE WCNC,2000.
[135]王玉明,杨宗凯,赵大胜.基于缓存旁路和本地修复的多跳网络路由重建机制[J].电子与信息学报,2007,29(007):1622—1627.
[136] C. E. PERKINS. Ad hoc networking [M]. Addison Wesley,2001.
[137] W. SU, S. J. LEE, M. GERLA. Mobility prediction and routing in ad hoc wirelessnetworks [J]. International Journal of Network Management,2001,11:3–30.
[138] B. LIANG, Z. J. HAAS. Optimizing route-cache lifetime in ad hoc networks [C].Proceedings of INFOCOM,2003.
[139] R. J. LA, Y. HAN. Distribution of path duration in mobile ad-hoc networks and pathselection [C]. Proceedings of INFOCOM,2006
[140]“ns-2.”[OL]. Available: http://nsnam.isi.edu/nsnam/
[141] M. Handley. Designing extensible IP router software[C]. Proceedings of the2ndconference on Symposium on Networked Systems Design&Implementation-Volume2,2005, USENIX Association, pages.189-202.
[142] K. Ishiguro. Quagga routing suite[OL]. http://www.quagga.net/
[143] C. Partridge. FIRE: Flexible intra-AS routing environment.2000, pages.191-203.
[144] E. Kohler. The Click modular router.2000, pages.263-297.
[145] D. Decasper. Router plugins: A software architecture for next generation routers[M].ACM press,1998, pages.229-240.
[146] J. L. Sobrinho. Network routing with path vector protocols: Theory and applications[C].Proceedings of the2003conference on Applications, technologies, architectures, andprotocols for computer communications,2003, pages.49-60.
[147] J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hoprouting in the internet[M]. IEEE Press,2002, pages.541-550.
[148] J. L. Sobrinho. An algebraic theory of dynamic network routing[M]. IEEE Press,2005,pages.1160-1173.
[149] A. J. T. Gurney, and T. G. Griffin. Lexicographic products in metarouting[C].2007.IEEE International Conference on Network Protocols (ICNP).2007, pages.113-122.
[150] Y. Yang, and J. Wang. Design guidelines for routing metrics in multihop wirelessnetworks[C]. The27th Conference on Computer Communications(INFOCOM),2008,pages.1615-1623.
[151] R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless meshnetworks[C]. Proceedings of the10th annual international conference on Mobilecomputing and networking. ACM press,2004, pages.114-128.
[152]李玉军.无线网络连通性及路由关键技术研究[D].博士论文，电子科技大学，2010,6.
[2] R. J. Bates. GPRS: general packet radio service[M]. McGraw-Hill Professional,2001.
[3] C. S. R. Murthy, B. S. Manoj. Ad hoc Wireless Networks: Architectures andProtocols[M]. Prentice Hall PTR,2004.
[4] R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, et al. Advances in packet ratiotechnology[C]. Proceedings of the IEEE,1978,66:1468-1496.
[5] N. Shacham, J. Westcott. Future directions in packet radio architectures andprotocols[C]. Proceedings of the IEEE,1987,75:83-99.
[6] B. M. Leiner, R. J. Ruther, A. R. Sastry. Goals and challenges of the DARPA GloMoprogram [global mobile information systems][J]. Personal Communications, IEEE,1996,3:34-43.
[7] I. P.-T. W. G. f. W. Standards[OL], http://www.ieee802.org/11/.
[8] I. M. Charter. http://www.ietf.org/dyn/wg/charter/manet-charter.html[OL].
[9] J. P. Macker, M. S. Corson. Mobile ad hoc networking and the IETF[C]. SIGMOBILEMobile Computer Communication Review,1998,2:9-14.
[10] M. Frodigh, P. Johansson, P. Larsson. Wireless Ad hoc networking-The art ofnetworking without a network[M]. Ericsson Review,2000,4.
[11] C. K. K. Toh. Ad hoc Wireless Networks: Protocols and Systems[M]. Prentice HallPTR,2001.
[12] R. Rajaraman. Topology control and routing in ad hoc networks: a survey[J]. SIGACTNews,2002,33:60-73.
[13] G. Sharma, R. Mazumdar, N. B. Shroff. Delay and capacity trade-offs in mobile ad hocnetworks: a global perspective[J]. IEEE/ACM Trans, Networking,2007,15:981-992.
[14] N. Borisov, I. Goldberg, D. Wagner. Intercepting mobile communications: the insecurityof802.11[C]. Proceedings of the7th annual international conference on Mobilecomputing and networking Rome, Italy: ACM,2001.
[15]陈林星,曾曦,曹毅.移动Ad hoc网络:自组织分组无线网络技术[M].电子工业出版社,2006.
[16]郑少仁,王海涛,赵志峰等. Ad hoc网络技术[M].人民邮电出版社,2005.
[17]李勇,黄均才,王凤碧等. Ad hoc网络体系结构研究[J].计算机应用,2005:163-175.
[18] G. Pei,, M. Gerla, and T. W. Chen. Fisheye state routing: A routing scheme for ad hocwireless networks[C]. Communications, ICC2000,70-74.
[19] P. Jacquet. Optimized link state routing protocol (OLSR)[OL].http://tools.ietf.org/html/rfc3626.
[20] A. Boukerche, S.K. Das, and A. Fabbri. Analysis of a randomized congestion controlscheme with DSDV routing in ad Hoc wireless networks[M]. Elsevier press,2001,967-995.
[21] G. Pei, M. Gerla, and X. Hong. LANMAR: landmark routing for large scale wireless adhoc networks with group mobility[C]. Proceedings of the1st ACM internationalsymposium on Mobile ad hoc networking&computing,2000, p.11-18.
[22] Y.-B. Ko, N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks[J].Wireless Network,2000,6:307-321.
[23] E. Huang, W. Hu, J. Crowcroft, et al. Towards commercial mobile ad hoc networkapplications: a radio dispatch system[C]. Proceedings of the6th ACM internationalsymposium on Mobile ad hoc networking and computing Urbana-Champaign, IL, USA:ACM,2005.
[24] W. Kiess, M. Mauve. A survey on real-world implementations of mobile ad-hocnetworks[J]. Ad hoc Network,2007,5:324-339.
[25] T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc networkresearch[J]. Wireless Communication and mobile computing,2002,2(5):483-502.
[26] S. M. Ross. Introduction to probability models[M]. Academic press,2009.
[27] B. Liang and Z. Haas. Predictive distance-based mobility management for PCSnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM), March1999.
[28] X. Hong, M. Gerla, G. Pei, et al. A group mobility model for ad hoc wirelessnetworks[C]. Proceedings of the ACM International Workshop on Modeling andSimulation of Wireless and Mobile Systems (MSWiM), August1999.
[29] E. W. Weisstein. The CRC Concise Encyclopedia of Mathematics[M]. CRC Press,1998.
[30] A. Bar-Noy, I. Kessler, and M. Sidi. Mobile users: To update or not to update[C].Proceedings of the Joint Conference of the IEEE Computer and CommunicationsSocieties (INFOCOM), pages570–576,1994.
[31] J. J. Garcia-Luna-Aceves and E. L. Madrga. A multicast routing protocol for ad-hocnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM),1999,784–792.
[32] I. Rubin and C. Choi. Impact of the location area structure on the performance ofsignaling channels in wireless cellular networks[M]. IEEE Communications Magazine,1997,108–115.
[33] M. Zonoozi and P. Dassanayake. User mobility modeling and characterization ofmobility pattern[J]. IEEE Journal on Selected Areas in Communications,1997,15(7):1239–1252.
[34] S. Basagni, I. Chlamtac, V. R. Syrotiuk, et al. A distance routing effect algorithm formobility (DREAM)[C]. Proceedings of the ACM/IEEE International Conference onMobile Computing and Networking (MOBICOM),1998, pages76–84.
[35] D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks[M]. T.Imelinsky and H. Korth, editors, Mobile Computing, Kluwer Academic Publishers,1996, pages153–181.
[36] E. Royer, P. M. Melliar-Smith, and L. Moser. An analysis of the optimum node densityfor ad hoc mobile networks[C]. Proceedings of the IEEE International Conference onCommunications (ICC),2001.
[37] V. Davies. Evaluating mobility models within an ad hoc network[D]. Master’s thesis.Colorado School of Mines,2000.
[38] C. Chiang. Wireless Network Multicasting[D]. PhD thesis, University of California, LosAngeles,1998.
[39] Z. Haas. A new routing protocol for reconfigurable wireless networks[C]. Proceedingsof the IEEE International Conference on Universal Personal Communications (ICUPC),pages562–565, Oct.1997.
[40] B. Liang and Z. Haas. Predictive distance-based mobility management for PCSnetworks[C]. Proceedings of the Joint Conference of the IEEE Computer andCommunications Societies (INFOCOM), March1999.
[41] V. Tolety. Load reduction in ad hoc networks using mobile servers[D]. Master’s thesis,Colorado School of Mines,1999.
[42] M. Zhao, and W. Wang. A Novel Semi-Markov Smooth Mobility Model for Mobile Adhoc Networks[C], GLOBECOM,2006:1-5.
[43] X. Hong, M. Gerla, G. Pei, et al. A group mobility model for ad hoc wirelessnetworks[C]. Proceedings of the ACM International Workshop on Modeling andSimulation of Wireless and Mobile Systems (MSWiM), August1999.
[44] M. Sanchez and P. Manzoni. Anejos: A java based simulator for ad-hoc networks[J].Future Generation Computer Systems,17(5):573–583,2001.
[45] M. Sanchez. Mobility models[OL]. http://www.disca.upv.es/misan/mobmodel.htm. Pageaccessed on May30th,2002.
[46] M. Sanchez and P. Manzoni. Anejos: A java based simulator for ad-hoc networks[J].Future Generation Computer Systems,17(5):573–583,2001.
[47] C. E. Perkins, P. Bhagwat. Highly dynamic Destination-Sequenced Distance-Vectorrouting for mobile computers[C]. SIGCOMM Computer Communication Review,1994,24:234-244.
[48] G. Pei. A wireless hierarchical routing protocol with group mobility[C]. WirelessCommunications and Networking Conference,1999, IEEE press,1538-1542.
[49] T. W. Chen, and M. Gerla. Global state routing: A new routing scheme for ad-hocwireless networks[C]. ICC IEEE International Conference on Communications (ICC),1998, IEEE press,171-175.
[50] S. Murthy and J. J. Garcia-Luna-Aceves. An efficient routing protocol for wirelessnetworks[M].1996, Springer press,183-197.
[51] Y. C. Hu, D. B. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routingfor mobile wireless ad hoc networks[M]. Elsevier,2003:175-192.
[52] R. V. Boppana, and S. P. Konduru. An adaptive distance vector routing algorithm formobile ad hoc networks[C]. IEEE INFOCOM,2001:1753-1762.
[53] Y. Huang, and S. Bhatti. Fast-converging distance vector routing for wireless meshnetworks[C]. Distributed Computing Systems Workshops, ICDCS'08,2008, IEEE press,279-284.
[54] D. B. Johnson, D. A. Maltz, J. Broch. DSR: the dynamic source routing protocol formultihop wireless ad hoc networks[P]. Ad hoc networking: Addison-Wesley LongmanPublishing Co., Inc.,2001:139-172.
[55] C. E. Perkins, E. M. Royer. Ad-hoc On-Demand Distance Vector Routing[C].Proceedings of the Second IEEE Workshop on Mobile Computer Systems andApplications: IEEE Computer Society,1999.
[56] V. D. Park and S. Corson. A highly adaptive distributed routing algorithm for mobilewireless networks[C]. Proceedings of INFOCOM,1997, pages.1405–1413.
[57] V. D. Park and S. Corson. Temporally-ordered routing algorithm (TORA) version1functional specification (Internet-draft)[C]. Mobile Ad-hoc Network (MANET)Working Group, IETF,1998.
[58] M. Abolhasan, T. Wysocki, and E. Dutkiewicz. A review of routing protocols for mobilead hoc networks[M]. Elsevier,2004, pages.1-22.
[59] Y. C. Hu, D. B. Johnson. Caching strategies in on-demand routing protocols for wirelessad hoc networks[C]. Proceedings of the6th annual international conference on Mobilecomputing and networking Boston, Massachusetts, United States: ACM,2000.
[60] M. K. Marina, S. R.Das. Performance of Route Caching Strategies in Dynamic SourceRouting[C]. Proceedings of the21st International Conference on Distributed ComputingSystems: IEEE Computer Society,2001.
[61] W. Lou, Y. Fang. Predictive caching strategy for on-demand routing protocols inwireless ad hoc networks[J]. Wireless Network,2002,8:671-679.
[62] X. Yu. Distributed Cache Updating for the Dynamic Source Routing Protocol[J]. IEEETransactions on Mobile Computing,2006,5:609-626.
[63] P. Papadimitratos, Z. Haas. Secure Routing for Mobile Ad hoc Networks (MC2R)[C].Communication Networks and Distributed Systems Modeling and SimulationConference (CNDS),2002:27--31.
[64] Y. C. Hu, A. Perrig, D. B. Johnson. Ariadne: a secure on-demand routing protocol for adhoc networks[J]. Wireless Network,2005,11:21-38.
[65] J. Kim, G. Tsudik. SRDP: Securing Route Discovery in DSR[C]. Proceedings of the TheSecond Annual International Conference on Mobile and Ubiquitous Systems,2005.
[66] G. Acs, L. Buttyan, I. Vajda. Provably Secure On-Demand Source Routing in Mobile Adhoc Networks[J]. IEEE Transactions on Mobile Computing,2006,5:1533-1546.
[67] W. J. Tsaur, H. T. Pai. A new security scheme for on-demand source routing in mobilead hoc networks[C]. Proceedings of the2007international conference on Wirelesscommunications and mobile computing Honolulu, Hawaii, USA: ACM,2007.
[68] K. Sanzgiri, B. Dahill, B. N. Levine, et al. A Secure Routing Protocol for Ad hocNetworks[C]. Proceedings of the10th IEEE International Conference on NetworkProtocols: IEEE Computer Society,2002.
[69] M. G. Zapata. Secure ad hoc on-demand distance vector routing[C]. SIGMOBILEMobile Computer Communication Review,2002,6:106-107.
[70] L. R. Reddy, S. V. Raghavan. SMORT: Scalable multipath on-demand routing formobile ad hoc networks. Ad hoc Network,2007,5:162-188.
[71] A. Patwardhan, J. Parker, M. Iorga, et al. Threshold-based intrusion detection in ad hocnetworks and secure AODV[J]. Ad hoc Network.,2008,6:578-599.
[72] O. Al-Jarrah, O. Megdadi. Enhanced AODV routing protocol for Bluetooth scatternet[J].Computer Electronic England,2009,35:197-208.
[73] Z. J. Haas, M. R. Pearlman, and P. Samar, The zone routing protocol (ZRP) for ad hocnetworks[P].2002.
[74] Z. J. Haas, M. R. Pearlman, P. Samar, et al. Intrazone Routing Protocol (IARP)[P].2002.
[75] J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hoprouting in the internet[J]. IEEE/ACM Transaction Network,2002,10:541-550.
[76] J. L. Sobrinho. Network routing with path vector protocols: theory and applications[C].Proceedings of the2003conference on Applications, technologies, architectures, andprotocols for computer communications Karlsruhe, Germany: ACM,2003.
[77] J. L. Sobrinho. An algebraic theory of dynamic network routing[J]. IEEE/ACMTransaction Network,2005,13:1160-1173.
[78] T. G. Griffin, J. L. Sobrinho. Metarouting[C]. Proceedings of the2005conference onApplications, technologies, architectures, and protocols for computer communicationsPhiladelphia, Pennsylvania, USA: ACM,2005.
[79] A. J. T. Gurney, T. G. Griffin. Lexicographic products in metarouting[C]. IEEEInternational Conference on Network Protocols, ICNP,2007:113-122.
[80] Y. Yaling, W. Jun. Design Guidelines for Routing Metrics in Multihop WirelessNetworks[C]. The27th Conference on Computer Communications, INFOCOM,2008:1615-1623.
[81] L. Mingming, W. Jie. Opportunistic Routing Algebra and its Applications[C].INFOCOM,2009:2374-2382.
[82] J. Broch, D. A. Maltz, D. B. Johnson, et al. A performance comparison of multi-hopwireless ad hoc network routing protocols[C]. Proceedings of the4th annual ACM/IEEEinternational conference on Mobile computing and networking Dallas, Texas, UnitedStates: ACM,1998.
[83] D. S. J. D. Couto, D. Aguayo, B. A. Chambers, et al. Performance of multihop wirelessnetworks: shortest path is not enough[C]. SIGCOMM Computer CommunicationReview,2003,33:83-88.
[84] A. Boukerche. Performance evaluation of routing protocols for ad hoc wirelessnetworks[J], Mobile Network Application,2004,9:333-342.
[85] H. Ehsan, Z. A. Uzmi, Performance comparison of ad hoc wireless network routingprotocols[C]. Proceedings of INMIC2004,8th International Conference,2004:457-465.
[86] P. Arce, J. C. Guerri, A. Pajares, et al. Performance evaluation of video streaming overad hoc networks using flat and hierarchical routing protocols[J]. Mobile NetworkApplication,2008,13:324-336.
[87] P. J. Wan, C. W. Yi, F. Yao, et al, Asymptotic critical transmission radius for greedyforward routing in wireless ad hoc networks[C]. Proceedings of the7th ACMinternational symposium on Mobile ad hoc networking and computing Florence, Italy:ACM,2006.
[88] L. Wang, C. W. Yi, F. Yao. Improved asymptotic bounds on critical transmission radiusfor greedy forward routing in wireless ad hoc networks[C]. Proceedings of the9th ACMinternational symposium on Mobile ad hoc networking and computing Hong Kong,Hong Kong, China: ACM,2008.
[89] Y. Wang, C. W. Yi, F. Li. Delivery Guarantee of Greedy Routing in Three DimensionalWireless Networks[C]. Proceedings of the Third International Conference on WirelessAlgorithms, Systems, and Applications Dallas, Texas: Springer-Verlag,2008.
[90] S. Katti, H. Rahul, W. Hu, D. Katabi, et al. XORs in the air: practical wireless networkcoding[C]. SIGCOMM Computer Communication Review,2006,36:243-254.
[91] S. Chachulski, M. Jennings, S. Katti, et al. Trading structure for randomness in wirelessopportunistic routing[C]. Proceedings of the2007conference on Applications,technologies, architectures, and protocols for computer communications Kyoto, Japan:ACM,2007.
[92] S. Katti, D. Katabi, H. Balakrishnan, et al. Symbol-level network coding for wirelessmesh networks[C]. SIGCOMM Computer Communication Review,2008,38:401-412.
[93] L. Fan, W. Yu. Routing in vehicular ad hoc networks: A survey[M]. VehicularTechnology Magazine, IEEE,2007,2:12-22.
[94] S. Ghazizadeh, O. Ilghami, E. Sirin, et al. Security-Aware Adaptive Dynamic SourceRouting Protocol[C]. Proceedings of the27th Annual IEEE Conference on LocalComputer Networks: IEEE Computer Society,2002.
[95] A. Perrig, J. D. Tygar, D. Song, et al. Efficient Authentication and Signing of MulticastStreams over Lossy Channels[C]. Proceedings of the2000IEEE Symposium onSecurity and Privacy: IEEE Computer Society,2000.
[96] K. Sanzgiri, B. Dahill, B. N. Levine, et al. Belding-Royer, A secure routing protocol forad hoc networks[C]. Proceedings of10th IEEE International Conference on NetworkProtocols,2002:78-87.
[97] S. Marti, T. J. Giuli, K. Lai, et al. Mitigating routing misbehavior in mobile ad hocnetworks[C]. Proceedings of the6th annual international conference on Mobilecomputing and networking Boston, Massachusetts, United States: ACM,2000.
[98] S. Buchegger, J. Y. L. Boudec, Performance analysis of the confident protocol[C].Proceedings of the3rd ACM international symposium on Mobile ad hoc networking&computing Lausanne, Switzerland: ACM,2002.
[99] L. Butty, J. P. Hubaux. Stimulating cooperation in self-organizing mobile ad hocnetworks[J]. Mobile Network Application,2003,8:579-592.
[100] S. Zhong, J. Chen, Y. R. Yang. Sprite: a simple, cheat-proof, credit-based system formobile ad-hoc networks[C]. Twenty-Second Annual Joint Conference of the IEEEComputer and Communications, INFOCOM,2003:1987-1997vol.3.
[101] L. Anderegg, S. Eidenbenz. Ad hoc-VCG: a truthful and cost-efficient routing protocolfor mobile ad hoc networks with selfish agents[C]. Proceedings of the9th annualinternational conference on Mobile computing and networking San Diego, CA, USA:ACM,2003.
[102] S. Eidenbenz, G. Resta, P. Santi. COMMIT: a sender-centric truthful andenergy-efficient routing protocol for ad hoc networks with selfish nodes[C]. Proceedingsof19th IEEE International in Parallel and Distributed Processing Symposium,2005:10.
[103] S. Zhong, L. Li, Y. G. Liu, et al. On designing incentive-compatible routing andforwarding protocols in wireless ad-hoc networks: an integrated approach using gametheoretical and cryptographic techniques[C]. Proceedings of the11th annualinternational conference on Mobile computing and networking Cologne, Germany:ACM,2005.
[104] W. Wang, S. Eidenbenz, Y. Wang, et al. OURS: optimal unicast routing systems innon-cooperative wireless networks[C]. Proceedings of the12th annual internationalconference on Mobile computing and networking Los Angeles, CA, USA: ACM,2006.
[105] I. Akyildiz, W. Su, Y. Sankarasubramaniam, et al. Wireless sensor networks: Asurvey[J]. Computer Networks,2002,38(4):393422.
[106] C. Bettstetter. Smooth is better than sharp: A random mobility model for simulation ofwireless networks[C]. Proceedings of the ACM Int’l Symp. on MSWiM. ACM Press,2001.1927.
[107] M. Zhao, W. Wang. A unified mobility model for analysis and simulation of mobilewireless networks [J]. Wireless Networks,2009,15(3):365--389.
[108] T. Camp, J. Boleng, V. Davies. A survey of mobility models for ad hoc network research[J]. Wireless Communications&Mobile Computing (WCMC), Special Issue on Mobilead Hoc Networking: Research, Trends and Applications,2002,2(5);483-502.
[109] C. Bettstetter. Mobility modeling in wireless networks: Categorization, smoothmovement, and border effects[C]. Mobile Computing and Communications Review,2001,5(3):5566.
[110]时锐，杨孝宗．自组网Random Waypoint移动模型点空间概率分布的研究[J]．计算机研究与发展，2005，42(12)：2056—2062.
[111] J. Yoon, M. Liu, B. Noble. Random waypoint considered harmful[C]. Proceedings ofthe IEEE INFOCOM, Vol.2. San Francisco,2003.13121321.
[112] G. Lu, D. Bells, G. Manson. Study on environment mobility models for mobile ad hocnetwork: Hotspot mobility model and route mobility model[C].2005Int’l Conferenceon Wireless Networks,2005.808—813.
[113] N. Aschenbruck, E. Gerhards-Padilla, and P. Martini. Modeling mobility in disasterarea scenarios[M]. Performance Evaluation, Elsevier,2009,66(12):773-790.
[114] A. P. Jardosh, E. M. Belding, Royer, et a1. Real-world environment models for mobilenetwork evaluation[J]. IEEE Journal on Selected Areas in Communications,2005,23(3):622-632.
[115]王伟，蔡皖东等．基于圆周运动的自组网移动模型[J]．计算机研究与发展，2009，44(6)：932—938.
[116]公维宾，常义林等．具有多出入口区域的节点移动和分布研究[J]．计算机研究与发展，2008，45(3)：428--435.
[117] C. Bettstetter, G. Resta, P. Santi. The node distribution of the random waypoint mobilitymodel for wireless ad hoc networks[J]. IEEE Trans on Mobile Computing,2003,2(3):257—269.
[118] R. W. Yeung, Z. Zhang. Distributed source coding for satellite communications[J]. IEEETrans on Information Theory,1999,45:1111–1120.
[119] R. Ahlswede, N. Cai, S. Y. R. Li. Network information flow[J]. IEEE Trans onInformation Theory,2002,46(4):1204-1216.
[120] Y. Wu, P. A. Chou, S. Y. Kung, et al. Information exchange in wireless networks withnetwork coding and physical layer broadcast[C]. Proceedings of39th AnnualConference on Information Sciences and Systems (CISS), Mar,2005.
[121]A. Ramamoorthy, J. Shi, R. Wesel. On the capacity of network coding for wirelessnetworks[J]. IEEE Trans on Information Theory On the capacity of network codingfor wireless networks,2005,51(8):2878-2885.
[122] J. Le, J. C. S. Lui, D. M. Chiu. How Many Packets Can We Encode? An Analysis ofPractical Wireless Network Coding[C]. Proceedings of IEEE INFOCOM2008.371-375.
[123] S. Katti, H. Rahul, W. Hu, et al. XORs in the Air: Practical Wireless NetworkCoding[C]. Proceedings of ACM SIGCOMM06, Aug,2006,243-254.
[124] D. S. J. D. Couto, D. Aguayo, J. Bicket, et al. A high throughput path metric formulti-hop wireless routing[C]. Proceedings of ACM MobiCom03, Sept.2003,419-434.
[125] D. S. Lun, M. Medard, T. Ho, et al. Network Coding with a Cost Criterion[C].Proceedings of International Symposium on Information Theory and its Applications,2004,1232-1237.
[126] Y. N. Wu, P. A. Chou, S. Y. Kung. Minimum-energy multicast in mobile ad hocnetworks using network coding. Information Theory Workshop, IEEE,2004,304-309.
[127] B. Ni, N. Santhapuri, Z. Zhong, et al. Routing with Opportunistically Coded Exchangesin Wireless Mesh Networks[C]. Proceedings of WiMesh06,2nd IEEE Workshop on,Reston, VA, USA,2006,157-159.
[128] S. Sengupta, S. Rayanchu, S. Banerjee. An Analysis of Wireless Network Coding forUnicast Sessions: The Case for Coding-Aware Routing[C]. Proceedings of IEEEINFOCOM,2007,1028-1036.
[129] P. Chaporkar, A. Proutiere. Adaptive Network Coding and Scheduling for MaximizingThroughput in Wireless Networks[C]. ACM MOBICOM,2007,135-146.
[130] J. Le, J. Lui, D. M. Chiu. DCAR: Distributed coding-aware routing in wirelessnetworks[C]. International Conference on Distributed Computing Systems (ICDCS),2008.
[131] Y. L. Yang, J. Wang. Design guidelines for routing metrics in multi-hop wirelessnetworks[C]. Proceedings of IEEE INFOCOM,2008,1615-1623.
[132] E. ROYER, C. TOH. A review of current routing protocols for Ad hoc mobile wirelessnetworks [J]. IEEE Personal Communications,1999,6(2):46-55.
[133] W. K. LAI, S. Y. HSIAO, Y. C. LIN. Adaptive backup routing for ad hoc networks [J].Computer Communications,2007,30:453–464.
[134] S. J. LEE, M. GERLA. AODV-BR: Backup routing in ad hoc networks [C]. Proceedingsof IEEE WCNC,2000.
[135]王玉明,杨宗凯,赵大胜.基于缓存旁路和本地修复的多跳网络路由重建机制[J].电子与信息学报,2007,29(007):1622—1627.
[136] C. E. PERKINS. Ad hoc networking [M]. Addison Wesley,2001.
[137] W. SU, S. J. LEE, M. GERLA. Mobility prediction and routing in ad hoc wirelessnetworks [J]. International Journal of Network Management,2001,11:3–30.
[138] B. LIANG, Z. J. HAAS. Optimizing route-cache lifetime in ad hoc networks [C].Proceedings of INFOCOM,2003.
[139] R. J. LA, Y. HAN. Distribution of path duration in mobile ad-hoc networks and pathselection [C]. Proceedings of INFOCOM,2006
[140]“ns-2.”[OL]. Available: http://nsnam.isi.edu/nsnam/
[141] M. Handley. Designing extensible IP router software[C]. Proceedings of the2ndconference on Symposium on Networked Systems Design&Implementation-Volume2,2005, USENIX Association, pages.189-202.
[142] K. Ishiguro. Quagga routing suite[OL]. http://www.quagga.net/
[143] C. Partridge. FIRE: Flexible intra-AS routing environment.2000, pages.191-203.
[144] E. Kohler. The Click modular router.2000, pages.263-297.
[145] D. Decasper. Router plugins: A software architecture for next generation routers[M].ACM press,1998, pages.229-240.
[146] J. L. Sobrinho. Network routing with path vector protocols: Theory and applications[C].Proceedings of the2003conference on Applications, technologies, architectures, andprotocols for computer communications,2003, pages.49-60.
[147] J. L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hoprouting in the internet[M]. IEEE Press,2002, pages.541-550.
[148] J. L. Sobrinho. An algebraic theory of dynamic network routing[M]. IEEE Press,2005,pages.1160-1173.
[149] A. J. T. Gurney, and T. G. Griffin. Lexicographic products in metarouting[C].2007.IEEE International Conference on Network Protocols (ICNP).2007, pages.113-122.
[150] Y. Yang, and J. Wang. Design guidelines for routing metrics in multihop wirelessnetworks[C]. The27th Conference on Computer Communications(INFOCOM),2008,pages.1615-1623.
[151] R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless meshnetworks[C]. Proceedings of the10th annual international conference on Mobilecomputing and networking. ACM press,2004, pages.114-128.
[152]李玉军.无线网络连通性及路由关键技术研究[D].博士论文，电子科技大学，2010,6.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |