移动自组织网络的拓扑演进及路由策略研究
|
摘要
随着人们对无线通信需求的不断增加,多种无线通信网络得到了快速的发展。但是目前主流的无线通信网络仍存在着基础设施建设维护成本高、网络部署不够灵活,以及很难做到无缝覆盖等缺点。在这一背景下,移动自组织网络应运而生。它无需布设基础设施,网络部署较为灵活,并可以在主流无线通信网络无法覆盖的地区自组织形成,很好的解决了主流无线通信系统很难实现的通信问题,具有较好的发展前景。然而移动自组织网络也具有局限性,例如网络拓扑形式复杂、路由效率不高、链路利用率较低等。本文针对这些关键性问题,以复杂网络理论为主要理论基础,对移动自组织网络的拓扑演进、路由策略以及单向链路的利用等问题进行了深入的研究。
本文首先对移动自组织网络的相关文献进行了梳理和分析,在此基础上,构建了本课题的技术路线,为后续研究奠定了基础。
本研究对移动自组织网络的概念和发展情况进行了概述,并对其应用场景做了归纳和总结。详细阐述了主要研究方向和网络特点,重点分析了移动自组织网络的拓扑形成和路由方式对网络产生的影响。对复杂网络的相关理论做了阐述,着重对基于复杂网络理论的拓扑演进和路由策略研究进行了深入的分析和探讨。
根据移动自组织网络的构成特点,提出了基于节点位置偏好的移动自组织网络拓扑演进模型。该模型从移动自组织网络的实际结构出发,考虑到节点的移动具有倾向的特性,改变了以往构建网络模型大多建立在均匀拓扑基础上的研究方式,保证了网络拓扑的构建更具实际特点。此外,该拓扑演进模型还充分考虑了移动自组织网络节点具有能量有限的特点,在建立网络拓扑时力求节点间遵照能量优化连接,使节点可以更有效的利用能量,延长网络寿命和提高网络鲁棒性。仿真结果表明所提拓扑演进模型可以较好的反映网络行为特点,并可以起到延长网络整体运行时间的作用。
针对移动自组织网络的路由效率问题,本文提出了一种介数优化的能量均衡局部路由策略。该策略充分考虑了非均匀的网络结构特征,以节点介数作为主要寻路依据,并结合节点剩余能量,概率性的选取最适合的节点作为传输路径。仿真结果表明该策略可以提高网络的传输能力。在此基础上,还提出了能量均衡的联合路由机制。该机制进一步细化了网络结构特点,在不同局部结构中使用不同路由方式,从而进一步提高了网络的传输能力,增加了网络吞吐量。仿真验证所提出的这一路由策略能够达到提升网络负载能力、均衡节点能耗、延迟网络运行时间的目的。
由于移动自组织网络具有加权网络的特征,因此本研究在对比分析了不同的加权方式的情况下提出一种动态最短路径加权路由机制。所提机制实时更新网络权值,有助于在寻路过程中根据最新的网络状态分散节点传输负荷,提高网络传输能力。仿真结果证明所提机制在实时分担网络能量开销,降低节点失效率,提高网络吞吐量方面得到了较好的效果。
针对普遍存在于移动自组织网络中的单向链路问题,本文提出两种基于功率调整的单向链路通告策略。采用所提策略可以在尽可能减少节点能量消耗的前提下,使节点了解单向链路的存在,并根据所提的一种可利用单向链路的路由策略,完成数据传输。仿真结果表明所提策略可以降低端到端延迟、减小平均路径长度,最大化网络效用。
最后,对全文进行总结,指出研究工作的不足,并为下一步的工作提出了若干建议。
With the increasing demand of wireless communication, various wireless communication networks have been rapidly developed. However, there are some shortcomings in the existing networks, such as high costs to build and maintain the infrastructures, difficult achievement for the seamless coverage and inflexible deployment. Therefore, mobile Ad Hoc network (MANET) is proposed, which is more flexible deployment, self-organizing and without infrastructure. So it is a good solution to the communication problems of the mainstream wireless communication systems. MANET has a better development outlook because of its advantages. However, there are some limitations in MANET, such as complex network topology, inefficiency of routing protocols and lower link utilization. Based on the complex networks theory, the in-depth researches have been done on topology evolution, routing strategy and the use of unidirectional links of MANET in this dissertation.
Through the combing and analysis of related references about MANET, the technical route of this research is structured and the subsequent research foundation is established.
In this dissertation, the concepts and developments of the MANET are studied and the application scenarios of the networks are summarized. Then the main researches and network characteristics are declaimed in detail. The impacts on MANET from topology and routing are focused on. The complex networks theory was exposited. Especially the studies of the topology evolution and routing strategy are analyzed and discussed deeply.
In order to describe the evolving features of MANET accurately and improve the performance of the network, an evolving topology model with local-area preference is proposed. The essential idea of the model analyzed by the mean field theory is to optimize network structure based on users'behaviors in MANET. The evolving model changes the previous research method which is based on the uniform topology when establishing network structures. And the network topologies with the actual characteristics can be set up according to the evolving model. In addition, the limited energy of MANET's nodes was considered in this model. The connections among nodes are required in accordance with the principle of energy optimization, which can make the node using the energy more efficiently and improve the robustness of networks. The simulation results show that the evolving model which is proposed by the dissertation can reflect the characteristics of MANET better, and can prolong the lifetime of the networks. It is an available approach for establishing and analyzing the actual MANET.
To deal with the routing efficiency of MANET, the Betweenness-optimized Energy-balanced Local Routing strategy is proposed in the dissertation. This strategy fully considers the non-uniform characteristics of networks to probabilistically select the most appropriate node as next hop according to the betweenness and the remaining energy of node. The simulation results show that this strategy can effectively improve the transmission capacity of the network. On this basis, the Energy-balanced Joint Routing mechanism is proposed. This mechanism further refines the structure of MANET to use the different routing strategy in different local structures for the improvement of the transmission capacity and throughput. The simulation shows that the mechanism can achieve the purposes of increasing network load, balancing of energy consumption and prolonging the network lifetime.
In view of weighted network characteristics existed in MANET, in this study, a Dynamic Shortest Path Weighted Routing mechanism was proposed in the case of comparative analysis of different weighting methods. This mechanism, which can update network weights in real time, contributes to balance transmission load of nodes and improve transmission capacity of networks. The simulations show that the proposed mechanism can have good results in some aspects, such as balancing energy cost, reducing the failure rate of nodes and improving network throughput.
To address unidirectional links which widely exist in MANET, two unidirectional link-state advertisement mechanisms are designed, i.e. unidirectional link-state advertisement based power adjustment (ULAPA) and Unidirectional-Link Advertisement based Dynamic Grading Power (ULADGP). Using the mechanisms presented by the dissertation, unidirectional links can be sensed by nodes at both ends of the link under the premise of reducing energy consumption of nodes as much as possible. According to the results of unidirectional link-state advertisement, the Local Routing based Unidirectional Link-state Advertisement (LRULA) proposed by this study can more efficiently transfer data. The simulation results show that the proposed advertisement mechanisms can reduce the end-to-end delay, decrease the average path length and maximize network utility.
Finally, the summary of the thesis was given. The shortcomings of the research were pointed out and some suggestions to the future research were listed.
本文首先对移动自组织网络的相关文献进行了梳理和分析,在此基础上,构建了本课题的技术路线,为后续研究奠定了基础。
本研究对移动自组织网络的概念和发展情况进行了概述,并对其应用场景做了归纳和总结。详细阐述了主要研究方向和网络特点,重点分析了移动自组织网络的拓扑形成和路由方式对网络产生的影响。对复杂网络的相关理论做了阐述,着重对基于复杂网络理论的拓扑演进和路由策略研究进行了深入的分析和探讨。
根据移动自组织网络的构成特点,提出了基于节点位置偏好的移动自组织网络拓扑演进模型。该模型从移动自组织网络的实际结构出发,考虑到节点的移动具有倾向的特性,改变了以往构建网络模型大多建立在均匀拓扑基础上的研究方式,保证了网络拓扑的构建更具实际特点。此外,该拓扑演进模型还充分考虑了移动自组织网络节点具有能量有限的特点,在建立网络拓扑时力求节点间遵照能量优化连接,使节点可以更有效的利用能量,延长网络寿命和提高网络鲁棒性。仿真结果表明所提拓扑演进模型可以较好的反映网络行为特点,并可以起到延长网络整体运行时间的作用。
针对移动自组织网络的路由效率问题,本文提出了一种介数优化的能量均衡局部路由策略。该策略充分考虑了非均匀的网络结构特征,以节点介数作为主要寻路依据,并结合节点剩余能量,概率性的选取最适合的节点作为传输路径。仿真结果表明该策略可以提高网络的传输能力。在此基础上,还提出了能量均衡的联合路由机制。该机制进一步细化了网络结构特点,在不同局部结构中使用不同路由方式,从而进一步提高了网络的传输能力,增加了网络吞吐量。仿真验证所提出的这一路由策略能够达到提升网络负载能力、均衡节点能耗、延迟网络运行时间的目的。
由于移动自组织网络具有加权网络的特征,因此本研究在对比分析了不同的加权方式的情况下提出一种动态最短路径加权路由机制。所提机制实时更新网络权值,有助于在寻路过程中根据最新的网络状态分散节点传输负荷,提高网络传输能力。仿真结果证明所提机制在实时分担网络能量开销,降低节点失效率,提高网络吞吐量方面得到了较好的效果。
针对普遍存在于移动自组织网络中的单向链路问题,本文提出两种基于功率调整的单向链路通告策略。采用所提策略可以在尽可能减少节点能量消耗的前提下,使节点了解单向链路的存在,并根据所提的一种可利用单向链路的路由策略,完成数据传输。仿真结果表明所提策略可以降低端到端延迟、减小平均路径长度,最大化网络效用。
最后,对全文进行总结,指出研究工作的不足,并为下一步的工作提出了若干建议。
With the increasing demand of wireless communication, various wireless communication networks have been rapidly developed. However, there are some shortcomings in the existing networks, such as high costs to build and maintain the infrastructures, difficult achievement for the seamless coverage and inflexible deployment. Therefore, mobile Ad Hoc network (MANET) is proposed, which is more flexible deployment, self-organizing and without infrastructure. So it is a good solution to the communication problems of the mainstream wireless communication systems. MANET has a better development outlook because of its advantages. However, there are some limitations in MANET, such as complex network topology, inefficiency of routing protocols and lower link utilization. Based on the complex networks theory, the in-depth researches have been done on topology evolution, routing strategy and the use of unidirectional links of MANET in this dissertation.
Through the combing and analysis of related references about MANET, the technical route of this research is structured and the subsequent research foundation is established.
In this dissertation, the concepts and developments of the MANET are studied and the application scenarios of the networks are summarized. Then the main researches and network characteristics are declaimed in detail. The impacts on MANET from topology and routing are focused on. The complex networks theory was exposited. Especially the studies of the topology evolution and routing strategy are analyzed and discussed deeply.
In order to describe the evolving features of MANET accurately and improve the performance of the network, an evolving topology model with local-area preference is proposed. The essential idea of the model analyzed by the mean field theory is to optimize network structure based on users'behaviors in MANET. The evolving model changes the previous research method which is based on the uniform topology when establishing network structures. And the network topologies with the actual characteristics can be set up according to the evolving model. In addition, the limited energy of MANET's nodes was considered in this model. The connections among nodes are required in accordance with the principle of energy optimization, which can make the node using the energy more efficiently and improve the robustness of networks. The simulation results show that the evolving model which is proposed by the dissertation can reflect the characteristics of MANET better, and can prolong the lifetime of the networks. It is an available approach for establishing and analyzing the actual MANET.
To deal with the routing efficiency of MANET, the Betweenness-optimized Energy-balanced Local Routing strategy is proposed in the dissertation. This strategy fully considers the non-uniform characteristics of networks to probabilistically select the most appropriate node as next hop according to the betweenness and the remaining energy of node. The simulation results show that this strategy can effectively improve the transmission capacity of the network. On this basis, the Energy-balanced Joint Routing mechanism is proposed. This mechanism further refines the structure of MANET to use the different routing strategy in different local structures for the improvement of the transmission capacity and throughput. The simulation shows that the mechanism can achieve the purposes of increasing network load, balancing of energy consumption and prolonging the network lifetime.
In view of weighted network characteristics existed in MANET, in this study, a Dynamic Shortest Path Weighted Routing mechanism was proposed in the case of comparative analysis of different weighting methods. This mechanism, which can update network weights in real time, contributes to balance transmission load of nodes and improve transmission capacity of networks. The simulations show that the proposed mechanism can have good results in some aspects, such as balancing energy cost, reducing the failure rate of nodes and improving network throughput.
To address unidirectional links which widely exist in MANET, two unidirectional link-state advertisement mechanisms are designed, i.e. unidirectional link-state advertisement based power adjustment (ULAPA) and Unidirectional-Link Advertisement based Dynamic Grading Power (ULADGP). Using the mechanisms presented by the dissertation, unidirectional links can be sensed by nodes at both ends of the link under the premise of reducing energy consumption of nodes as much as possible. According to the results of unidirectional link-state advertisement, the Local Routing based Unidirectional Link-state Advertisement (LRULA) proposed by this study can more efficiently transfer data. The simulation results show that the proposed advertisement mechanisms can reduce the end-to-end delay, decrease the average path length and maximize network utility.
Finally, the summary of the thesis was given. The shortcomings of the research were pointed out and some suggestions to the future research were listed.
引文
[1]徐光佑,史元春,谢伟凯.普适计算[J].计算机学报,2003,26(9)：1042-1050.
[2]Weiser M. The computer for the twenty-first century[J]. Scientific American.1991, 265(3):94-104.
[3]Davies N, Gellersen H. Beyond prototypes:challenges in deploying ubiquitous systems[J]. Ieee pervasive computing.2002,1(1):26-35.
[4]Li X Y. Applications of k-local MST for topology control and breadcasting in wireless ad hoc networks[J]. IEEE Transactions on Parallel and Distributed Systems.2004, 15:1057-1069.
[5]Gannapathy V R. Network and medium access control (NET-MAC) layers for wireless mesh network (WMN)[C]. MALAYSIA APACE.2007.
[6]Li J H, Levy R, Yu M, et al. A scalable key management and clustering scheme for ad hoc networks[C]. Association for Computing Machinery.2006.
[7]Reddy T B, Karthigeyan I, Manoj B S, et al. Quality of service provisioning in Ad Hoc wireless networks:A survey of issues and solutions[J]. Ad Hoc Networks,2006,4 (1): 83-124.
[8]Ci S, GUI M Z, Chen H H, et al. Self-regulating network utilization in mobile Ad Hoc wireless networks[J]. IEEE Transactions on Vehicular Technology.2006,55 (4): 1302-1310.
[9]张昆鹏.卫星通信的发展及其关键技术[J].硅谷,2009,8：27.
[10]王学华,朱立东.低轨卫星通信系统地面核心网设计与仿真[J].空间电子技术.2010,2：119-123.
[11]3GPP 3G TR 23.923 ver.3.0, Combined GSM and mobile IP mobility handing in UMTS IP CN[S].2000.
[12]3GPP, TS 23.002, Rel.4. Network Architecture[S].
[13]3GPP TR 23.934 V1.0.0, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking:Functional and Architectural Definition (Release 6)[S]. 2002.
[14]3GPP TR 22.934 V7.0.0, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking (Release 7)[S].2007.
[15]3GPP TS 29.234 V7.9.8, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking Stage 3 (Release 7)[S].2008.
[16]唐军.集群移动通信综述[J].电子技术,2000,10：25-28.
[17]Cheng C H, Li L Y. Scheme design of the city emergency response system based on grid[J]. Journal of Wuhan University of Technology.2006,30(6):965-968.
[18]Ilyas M. The Handbook of Ad-hoc Networks[M]. Florida:CRC Press,2002.
[19]陈林星,曾曦,曹毅.移动Ad Hoc网络自组织分组无线网络技术[M].北京：电子工业出版社,2006.
[20]Johansson P. Scenario-based Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks[C]. Proceedings of IEEEACM MobiCom.1999.
[21]McNett M, Voelker G M. Access and Mobility of Wireless PDA Users[EB/OL]. http://sysnet.ucsd.edu/wtd/wtd.html.2013-04-12.
[1]郑少仁,王海涛,赵志峰,等Ad Hoc网络技术[M].人民邮电出版社.2005,1-13.
[2]Basagni S, Conti M, Giorgano S, et al. Mobile Ad Hoc networks[M]. Wiley-IEEE.2004, 69-300.
[3]Ramanathan R, Redi J. A brief overview of Ad Hoc networks:challenges and directions. IEEE Communications Magzine[J].2002,40(5):20-22.
[4]陈林星,曾曦,曹毅.移动Ad Hoc网络自组织分组无线网络技术[M].北京：电子工业出版社,2006.
[5]Abramson N. The ALOHA system:Another alternative for computer communications[C]. Proceedings of the AFIPS Joint Computer Conferences.1970,281-285.
[6]Macker J, Corson M. Mobile Ad hoc networking and the IETF[J]. ACM SIGMOBILE Mobile Computing and Communications Review.1998,2(1):9-14.
[7]IETF Working Group:Mobile Ad hoc networks (manet)[EB/OL]. http://www.ietf.org/html.charters/manet-charter.html.
[8]Sun J Z. Mobile Ad hoc networking:an essential technology for pervasive computing[C]. Proceedings of International Conferences on Info-tech and Info-net.2001,3:316-321.
[9]Rajaraman R. Topology control and routing in Ad hoc networks:A survey[J]. ACM SIGACT News.2002,33(2):60-73.
[10]Santi P. Topology control in wireless Ad Hoc and sensor networks[J]. ACM Computing Surveys(CSUR).2005,37(2):164-194.
[11]S Kumar, V Raghavan, J Deng. Medium access control protocols for Ad Hoc wireless networks:A survey[J]. Ad Hoc Networks.2006,4(3):326-358.
[12]Billinghurst M, Starner T. Wearable devices:new ways to manage information[J]. Computer.1999,32(1):57-64.
[13]Davis J, Fagg A, Levine B. Wearable computers as packet transport mechanisms in highly-partitioned Ad-hoc networks[C]. Proceeding of the International Symposium on Wearable Computing.2001:141-148.
[14]Yang H, Luo H Y, Ye F, et al. Security in mobile Ad Hoc networks:challenges and solutions[J]. IEEE Wireless Communications,2004,11(1):38-47.
[15]Hu Y C, Perrig A. A survey of secure wireless ad hoc routing[J]. IEEE Security & Privacy. 2004,2(3):28-39.
[16]TODD R, Yasinsac A. Surveying security analysis techniques in MANET routing protocols[J]. IEEE Communications.2007,9(4):69-84.
[17]WU J. Dominating-set-based routing in Ad Hoc wireless networks[J]. Wireless Networks and Mobile Computing.2002,425-450.
[18]Akkaya K, Younis M. A survey on routing protocols for wireless sensor networks[J]. Ad Hoc Networks.2005,3(3):325-349.
[19]Basagni S, Conti M, Giordano S, et al. Mobile ad hoc networking[M].New Jersey:Wiley-IEEE press,2004.
[20]Estrin D, Srivastava M. Wireless sensor networks(Tutorial)[C]. In:ACM MOBICOM, 2002.
[21]Fiebig B. European traffic accidents and purposed solutions[A]. Proceedings of the ITU-T Workshop on Standardization in Telecommunication for Motor Vehicles[C].2003,24-25.
[22]Bruno R, Conti M, Greqori E. Mesh networks:commodity multihop Ad Hoc networks[J]. IEEE Communications Magzine.2005,43(3):123-131.
[23]Akyildiz I F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine.2002,40(8):102-114.
[24]Santi P. Topology control in wireless ad hoc and sensor networks[M]. WILEY.2006.
[25]Luo G, Wu W. A group aware topology control algorithm in mobile Ad hoc networks[C]. In Proceedings of International Conference on Wireless Communications Networking and Mobile Computing (WICOM).2006.
[26]Cheng M X, Cardei M, Sun J, et al. Topology control of ad hoc wireless networks for energy effieiency [J]. IEEE Transactions on Computers.2004,53(12):1629-1635.
[27]Zhao M, Wang W. A unified mobility model for analysis and simulation of mobile wireless networks[J]. ACM-Springer Wireless Networks (WINET).2009,15(3):365-389.
[28]Johnson D B, Maltz D A, Mellon C, et al. The dynamic source routing protocol for mobile Ad hoc networks (DSR)[R]. RFC4728,2007.
[29]Perkins C, Beldingkoyer E, Das S. Ad hoc on-demand distance vestor (AODV) routing[R].RFC3651,2003.
[30]Loseri V, DeRango F, Marano S. A correction for Ad hoc on demand multipath distance vector routing protocol(AOMDV)[C].Proceedings of Vehicular Technology Conference. 2005,4:2775-2779.
[31]Clausen T, Jacquet E. Optimized link state routing protocol(OLSR), IETF RFC 3626, 2006.
[32]Dabideen J S, Garcia-Luna-Aceves J J. An efficient routing in MANET using ordered walks[J].Wireless networks.2011,17(4):1095-1112.
[33]Piao J J, Chang T M. TPSR:Transmission Power Based Source Routing Protocol for Mobile Ad Hoc Networks with Unidirectional Links[C].6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).2010,1-4.
[34]Singh S, Raghavendra C S. PAMAS:Power Aware Multi-access protocol with signaling for ad hoc networks[J]. ACM SIGCOMM Computer Communication Review, 1998,28(3):5-26.
[35]Hus C, Tseng Y. Cluster-based semi-asynchronous power-saving protocols for multi-hop ad hoc networks[C]. IEEE International Conference on Communieations.2005, 5:3166-3171.
[36]Krizman K J, Biedka T E, Rappaport T S. Wireless position location:Fundamentals, implementation strategies, and source of error[J]. Proceedings of the IEEE Vehicular Tech. 1997,2:919-923.
[37]Guang L, Assi C, Benslimane A. MAC layer misbehavior in wireless networks: challenges and solutions[J]. IEEE Wireless Communication.2008,15(4):6-14.
[38]Booysen M J, Zeadally S, Rooyen G J. Survey of media access control protocols for vehicular ad hoc networks[J]. IET Communications.2011,5(11):1619-1631.
[39]Buttyan L, Hubaux J. Report on a working session on security in wireless ad hoc networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review.2003, 7(1):74-94.
[40]Yang H, Luo H, Ye F, et al. Security in mobile Ad hoc networks:challenges and solutions. IEEE Wireless Communications.2004,11(1):38-47.
[41]Zhang D Y, Zhang B F. QoS model of space-based networks based on DiffServ[J]. Journal of Jiangsu University.2011,32(2):205-210.
[42]Domingo M C, Remondo D. QoS support between Ad hoc networks and fixed IP networks. Computer Communications.2008,31(11):2646-2655.
[43]Zhang N N, Yang M Y, Jing Y W. Congestion control for DiffServ network using second-order sliding mode control. IEEE Transactions on Industrial Electronics.2009, 56(9):3330-3336.
[44]Jeong H, Manson S P, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature.2001,411:41-41.
[45]Moore C, Newman M E J. Epidemics and percolation in small-world networks[J]. Phys Rev E.2000,61:5678-5682.
[46]Faloutsos M., Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. Proc ACM SIGComm.1999,29(4):251-262.
[47]Siganos G, Faloutsos M, Faloutsos P, et al. Power-laws and the AS-level Internet topology[J]. IEEE/ACM Trans Networking.2003,11:514.
[48]王林,戴冠中.Internet拓扑中连接率的研究[J].复杂系统与复杂性科学.2004,1(2)：9-15.
[49]Goh K I, Kahng B, Kim D. Fluctuation-driven dynamics of the Internet topology[J]. Phys Rev Lett.2002,88(10):108701.
[50]Ebel H, Mielsch L, Bornholdt S. Scale-free topology of e-mail networks[J]. Phys Rev E. 2002,66:035103(R).
[51]汪小帆,李翔,陈关荣.复杂网络理论及其应用[M].北京：清华大学出版社,2006.
[52]胡海波,王林.幂律分布研究简史[J].物理.2005,34(12)：889-896.
[53]Strogatz S H. Exploring comlex networks[J]. Nature,2001,410:268-276.
[54]Dorogovtsev S N, Mendes J F F. Evolution of networks[J]. Advances in Physies. 2002,51:1079-1187.
[55]Wang X F, Chen G R. Critieal dynamic of the kinetic Glauber-Ising model on hierarchical lattices[J]. IEEE Circuits and Systems Magazine.2003,3(1):6-20.
[56]Camp T, Boleng J, Davies V. A survey of mobility models for Ad Hoc network research[J]. Wireless Communication & Mobile Computing.2002,2(5):483-502
[57]Wang L, Zhu C P, Gu Z M, et al. Scaling of critical connectivity of mobile Ad Hoc communication networks[J]. Physical Review E.2008,78(6):066107.
[58]Sarshar N, Roychowdhury V. Multiple power-law structures in heterogeneous complex networks. Physical Review E.2005,72:026114.
[59]Tong C, Niu J W, Qu G Z, et al. Complex networks properties analysis for mobile ad hoc networks[J]. IET Communications.2012,6(4):370-380.
[60]Watts D J, Strogatz S H. Collective dynamics of small-world networks[J]. Nature.1998, 393:440-442.
[61]Albert R, Barabasi A L. Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 2002,74:47-97.
[62]Barabasi A L, Albert R. Emergence of scaling in random networks[J]. Science.1999, 286(5439):509-512.
[63]Li X, Chen G R. A local world evolving network model[J]. Physica A 328.2003,274.
[64]Liu Z H, Lai Y C, Ye N, et al. Connectivity distribution and attack tolerance of general networks with both preferential and random attachments[J]. Phys. Lett. A 2002,303, 337-344.
[65]Zhu C P, Zhou T, Yang H J, et al. The process of coevolutionary competitive exclusion: speciation, multifractality and power-laws in correlation[J]. New Journal of Physics.2008, 10,023006.
[66]Wang W X, Wang B H, Hu B, et al. General dynamics of topology and traffic on weighted technological networks[J]. Phys. Rev. Lett.2005,94,188702.
[67]汪秉宏,王文旭,周涛.交通流驱动的含权网络[J].物理2006,35(4)：304-310.
[68]史定华.网络--探索复杂性的新途径[J].系统工程学报.2005,20(2)：115-119.
[69]Xie Y B, Zhou T, Bai W J, et al. Geographical networks evolving with an optimal policy[J]. Phys.Rev.E,75.2007,036106:1-8.
[70]Sarshar N, Roychowdhury V. Scale-free and stable structures in complex Ad Hoc networks[J]. Phys.Rev.E,69.2004,026101:1-6.
[71]Nemeth G, Vattay G. Giant clusters in random ad hoc networks[J]. Phys.Rev.E,67.2003, 036110:1-6.
[72]李勇,李伟,韦洛霞.Ad Hoc网络的复杂网络试图[J].东莞理工学院学报.2006,13(1)：19-23.
[73]Qin S, Dai G Z, Wang L, et al. Scale-free evolving networks with accelerated attachment[J]. Advances in Complex Systems.2007,10(2):143-154.
[74]Yang S. Exploring complex networks by walking on them[J]. Physical Review E.2005, 71:16107.
[75]Thadakamalla H P, Albert R, Kumana S R T. Search in weighted complex networks[J]. Physical Review E.2005,72:66128.
[76]Kim B J,Yoon C N.Han S K, et al. Path finding strategies in scale-free networks[J]. Physical Review E.2002,65:27103.
[77]Wang W X, Wang B H, Yin C Y, et al. Traffic dynamics based on local routing protocol on a scale-free network[J]. Physical Review E 2006,73:026111.
[78]Guimera R, Diaz-Guilera A, Vega-Redondo F, et al. Optimal network topologies for local search with congestion[J]. Physical Review Letters.2002,89(24):248701-248705.
[79]Liu Z H, Ma W C, Zhang H, et al. An efficient approach of controlling traffic congestion in scale-free networks[J]. Physica A.2006,370,843-853.
[80]Yan G, Zhou T, Hu b, et al. Efficient routing on complex networks[J]. Physical Review E. 2006,73,46108-46112.
[81]朱凌峰,谭敏生.无标度网络上一种改进的基于节点有效路径的路由策略[J].电脑知识与技术.2010,6(31)：8741-8743.
[82]Wang S P, Pei W J. Detecting unknown paths on complex networks through random walks[J]. Physica A.2009,388(4):514-522.
[83]Echenique P, Gomez-Gardenes J, Moreno Y. Improved routing strategies for Internet traffic delivery[J]. Phys. Rev. E,70.2004,056105.
[84]Echenique P, Gomez-Gardenes J, Moreno Y. Dynamics of jamming transitions in complex networks[J]. Europhys. Lett.2005,71,325.
[85]M Tang, Z H Liu, X M LIANG. Self-adjusting routing schemes for time-varying traffic in scale-free networks[J]. Physical Review E.2009,80,26114-26121.
[86]Thadakamalla H P, Albert R, Kumata S R T. Search in spatial scale-free networks[J]. New Journal of Physics.2007,96:190.
[87]Imsek O, Jensen D. Navigating networks by using homophily and degree[J]. Proceedings of the National Academy of Sciences.2007,105(35):12758-12762.
[1]Sarrafi A, Firooz M H, Barjini H. A cluster based topology control algorithm for wireless Ad-hoc networks[C]. Proceedings of Systems and Networks Communications,2006,68.
[2]Wei D L, Chan H A. Clustering Ad Hoc networks:schemes and classifications[C]. Proceedings of IEEE Sensor and Ad Hoc Communications and Networks.2006,3:920-926.
[3]Bagwari A, Bisht S. Cluster head gateway approach using in integrated mobile Ad hoc network[C]. Proceedings of IEEE Recent Advances in Intelligent Computational Systems. 2011,652-655.
[4]Wu J, Gu G C, Hou G Z. A clustering algorithm considering on a hierarchical topology's stability for Ad Hoc networks[C]. Proceedings of Education Technology and Computer Science.2009,1:715-718.
[5]Lin C H R, Gerla M. A distributed architecture for multimedia in dynamic wireless networks[C]. Proceedings of IEEE GLOBECOM.1995,1468-1472.
[6]Gerla M, Tsai J T. Multicluster mobile, multimedia radio network[J]. ACM/Baltzer Journal of Wireless Networks.1995,1(3):255-265.
[7]Basagni S. Distributed clustering for Ad Hoc networks[A]. International Symposium on Parallel Architectures, Algorithms and Network[C]. Perth,1999,310-315.
[8]Chatterjee M, Sajal K D, Turgut D. A weighted clustering algorithm (WCA) for Ad hoc Networks[C]. IEEE Globecom.2000,1697-1701.
[9]王海涛,田畅,郑少仁.一种新型的Ad Hoc网络分簇算法及其性能仿真[J].系统仿真学报.2003,15(2)：193-197.
[10]Newmen M. The structure and function of complex networks[J]. SIAM Review.2003, 45(2):167-256.
[11]Jeong H, Manson S P, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature.2001,411:41-41.
[12]Moore C, Newman M. Epidemics and percolation in small-world networks[J]. Phys Rev E. 2000,61:5678-5682.
[13]Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. Proceedings of ACM SIGComm.1999,29(4):251-262.
[14]Siganos G, Faloutsos M, Faloutsos P, et al. Power-laws and the AS-level Internet topology[J]. IEEE/ACM Trans Networking.2003,11:514.
[15]Goh K I, Kahng B, Kim D. Fluctuation-driven dynamics of the Internet topology[J]. Phys Rev Lett.2002,88(10):108701.
[16]Ebel H, Mielsch L, Bornholdt S. Scale-free topology of e-mail networks[J]. Phys Rev E. 2002,66:035103(R).
[17]Barabasi A L, Albert R, Jeong H. Mean-field theory for scale-free random networks:The topology of the World Wide Wed[J]. Physica A.2000,281:69-77.
[18]Tian B, Don T. On distinguishing between Internet power-law topology generators[C]. Proceedings of IEEE INFOCOM. New York:2002,638-647.
[19]Zhou S, Mondragon R J. Towards modelling the Internet topology-the interactive growth model[C]. Proceedings of 18th International TELETRAFFIC CONGRESS (ITC). Berlin: 2003.
[20]Zhou S, Mondragon R J. The positive-feedback preference model of the AS-level Internet topology[C]. Proceedings of IEEE International Conference on Communications.2005, 1:163-167.
[21]Chen Q H, Shi D H. The modeling of scale- free networks[J]. Physica A,2004,335:240-248.
[22]陈禹,宗骁,郝杰等.BA模型的三种扩展[J].系统工程学报.2005,20(2)：120-127.
[23]章忠志,荣莉莉.BA网络的一个等价演化模型[J].系统工程.2005,23(2)：1-5.
[24]杨波,陈忠,段文奇.基于个体选择的小世界网络结构演化[J].系统工程.2004,22(12)：1-5.
[25]Li X, Chen G R. A local-world evolving network model[J]. Physica A.2003,328:274-286.
[26]Xie Y B, Zhou T, Bai W J, et al. Geographical networks evolving with an optimal policy[J]. Phys.Rev.E,75.2007,036106:1-8.
[27]Sarshar N, Roychowdhury V. Scale-free and stable structures in complex Ad Hoc networks[J]. Phys.Rev.E,69.2004,026101:1-6.
[28]Nemeth G, Vattay G. Giant clusters in random ad hoc networks[J]. Phys.Rev.E,67.2003, 036110:1-6.
[29]李勇,李伟,韦洛霞Ad Hoc网络的复杂网络试图[J].东莞理工学院学报.2006,13(1)：19-23.
[30]McNett M, Voelker G M. Access and mobility of wireless PDA users[EB/OL]. http://sysnet. ucsd. edu/wtd/wtd. html.2013-04-12.
[31]周雪梅,潘多,王博辉.基于服务评价管理的自组织网络数据共享机制[J].计算机应用.2010,30(12)：3164-3167.
[32]黄晓峰,王博辉,蔡念.一种基于复杂网络理论的移动自组网路由算法研究[J].计算机应用研究.2011,28(10)：3871-3874.
[33]Qin S. Scale-free topology structure in ad hoc networks[C]. Proceedings of 11th IEEE International Conference on Communication Technology.2008,21-24.
[34]Filiposka S V, Trajanov D R, Grnarov A L. Performance analysis of scale-free communities in ad hoc networks[C]. Proceedings of 1st International Conference on Wireless VITAE. 2009,399-403.
[35]Chao T, Niu J W, Long X, Gao X P. A mobile scale-free network model for hybrid ad hoc and sensor network[C]. Proceedings of IET 2nd International Conference on Wireless, Mobile and Multimedia Networks.2008,81-84.
[36]Fronezak A, Fronezak P, Holyst J A. Mean-field theory for clustering coefficients in Barabasi-Albert networks[J]. Physical Review E.2003,68(4):046126.
[37]Dorogovtsev S N, Mendes J F F, Samukhin A N. Structure of growing networks with preferential linking[J]. Physical Review Letters.2000,85(21):4633.
[38]Krapivsky P L, Redner S, Leyvraz F. Connectivity of growing random networks[J]. Physical Review Letters.2000,85(21):4629-4632.
[39]史定华.复杂网络的随机刻画和演化规律[J].力学进展.2008,6：679-691.
[I]Johnson D B, Maltz D A. Dynamic source routing in Ad Hoc wireless networks[J]. Mobile Computing.1996,153-181.
[2]Perkins C, Royer E. Ad-hoc on demand distance vector routing [A]. Proceedings of The 2nd IEEE Workshop on Mobile Computing Systems and Applications [C], New Orleans. 1999,90-100.
[3]Perkins C E, Bhagwat P. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers[J]. Computer Communication.1994,234-244.
[4]Project on Mobile Ad-hoc Networking and Clustering[EB/OL]. http://www.cs.chalmers.se/～tsigas/Courses/DCDSeminar/Files/adhocproject.pdf. 2013-04-12.
[5]Murthy S, Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks[J]. ACM Mobile Network and Applications, Special Issue on Routing in Mobile Communication Networks.1996,1(2):183-197.
[6]PERKINS C, ROYER E. Ad-hoc on demand distance vector routing [A]. The 2nd IEEE Workshop on Mobile Computing Systems and Applications [C], New Orleans, LA,1999: 90-100.
[7]JOHNSON J, MALTZ D. Dynamic source routing in ad hoc wireless networks [M]. Mobile Computing. Kluwer Academic,1996.
[8]Toh C. A novel distributed routing protocol to support ad-hoc mobile computing[C]. Proceedings of IEEE 15th Annual International Phoenix Conference.1996,480-486.
[9]Jiang M, Tay J J. Cluster based routing protocol, Internet Draft[EB/OL]. draft-ietf-manet-cbrp-spec-Ol.txt.2003.
[10]Raju J, Garcia-Luna-Aceves J. A new approach to on demand loop-free multi-path routing[C]. Proceedings of the 8th Annual IEEE International Conference on Computer Communications and Networks. Boston:1999.522-527.
[11]Gunes M, Sorges U, Bouazizi I. ARA--the ant-colony based routing algorithm for MANETs[C]. Proceedings of ICPP workshop on Ad Hoc Networks.2002,79-85.
[12]Haas Z J, Pearlman M R, Samar P. The zone routing protocol (ZRP) for Ad Hoc networks[EB/OL]. Draft-ietf-manet-zone-zup-04.txt, Internet-Draft, IETF.2002.
[13]Woo S C, Singh S, Scalable routing protocol for Ad Hoc networks[J]. Wireless Networks. 2001,7(5):513-529.
[14]Nikaein N, Laboid H, Bonnet C. Distributed dynamic routing algorithm(DDR) for mobile ad hoc networks. Proceedings of the MobiHOC 2000:First Annual Workshop on Mobile Ad Hoc Networking and Computing.2000.
[15]Heinzelman W B, Chandrakasan A P, Balakrishnan H. An application-specific protocol architecture for wireless microsensor networks [J]. IEEE Transactions on Wireless Communications.2002,1 (4):660-670.
[16]Younis O, Fahmy S. HEED:A hybrid, Energy-Efficient, Distributed Clustering Approach for Ad-Hoc Sensor Networks [J]. IEEE Transactions on Mobile Computing.2004, 3(4):366-379.
[17]苏莹,郑世珏,高丽,等.一种基于复杂网络特性的校园无线传感器网络路由算法[J].电子测量技术.2007,30(4)：206-208,212.
[18]Huang H J, Hu G m, Yu F C. Energy-aware geographic routing in wireless sensor networks with anchor nodes[J]. International Journal of Communication.2013,26(1): 100-113.
[19]胡福林,小海军.无线网络中的一种基于小世界模型的路由协议[J].计算机工程与科学.2008,30(8)30-35,56.
[20]黄晓峰,王博辉,蔡念.一种基于复杂网络理论的移动自组网路由算法研究[J].计算机应用研究.2011,28(10)：3871-3874.
[21]Wang Y H, Chen M, Wang P, et al. Unidirectional link-state advertisement based on power control for MANET[J]. The Journal of China Universities of Posts and Telecommunications.2012,19:55-60.
[22]Echenique P, Gomez-Gardenes J, Moreno Y. Improved routing strategies for Internet traffic delivery [J]. Physical Review E.2004,70(5):056105-056108
[23]Echenique P, Gomez-Gardenes J, Moreno Y. Dynamics of jamming transitions in complex networks[J]. Europhysics Letters.2005,71(2):325-328.
[24]A Arenas, G A Diaz, R Guimera. Communication in Networks with Hierarchical Branching[J]. Phys. Rev. Lett.2001,86(14):3196-3199.
[25]Singh S, Woo M, Raghavendra C S. Power-aware routing in mobile ad hoc networks[C]. Proceedings of Mobi-Com Conference.1998,181-190.
[1]Goh K L, Kahng B, Kim D. Nonlocal evolution of weighted scale-free networks[J]. Phys Rev E.2005,72(1):017103.
[2]Park K, Lai Y C, Ye N. Characterization of weighted complex networks[J]. Phys ReV E. 2004,70(2):02610.
[3]Barrat A, Barthlenly M. Modeling the evolution of weighted networks[J]. Phys Rev E. 2004,70(6):066149.
[4]Goh K I, Noh J D, Kahng B, et al. Load Distribution in Weighted Complex Networks[J]. Phys Rev E.2005,72(1):017102.
[5]Yang K, Huang L, Yang L, et al. Lattice Scale-free Networks with Weighted Linking[J]. Phys Rev E.2004,70(1):015102(R).
[6]Almaas E, Krapivsky P L. Statistics of weighted tree like networks. Phys Rev E.2005, 71(3):036124.
[7]Barrat A, Barthelemy M, Pastor-Satorras R, et al. The architecture of complex weighted networks[J]. Proceedings of the National Academy of Sciences of the United States of America.2004,101(11):3747-3752.
[8]Barrat A, Barthelemy M, Vespignani A. Modeling the evolution of weighted networks[J]. Physical Review E,2004,70(6):1-13.
[9]Fan Y, Li M, Chen J, et al. Network of econophysics:a weighted network to investigate the development of econophysics[J]. Physica B.2004,18:2505-2512.
[10]Almaas E, Kovacs B, Vicsek T, et al. Global organization of metabolic fluxes in the bacterium Escherichia coli [J]. Nature.2004,427(6977):839-843.
[11]Postor-Satorras R, Vazquez A, Vespignani A. Dynamical and correlation properties of the Internet[J]. Physical Review Letters,2001,87(25):258701.
[12]Smith J. Characterizing computer performance with a single number[J]. Communications of the ACM,1988,31:1202-1206.
[13]Latora V, Marehiori M. Economic small-world behavior in weighted networks. Physics B, 2003,32:249-263.
[14]陈华良,刘忠信,陈增强,等.复杂网络的一种加权路由策略研究[J].物理学报.2009,58(9)：6068-6073.
[15]周秋花,邹艳丽.加权网络的交通动力学研究[J].计算机工程.2010,36(19)：126-131.
[16]Barrat A, Barthelemy M, Vespignani A. Weighted evolving networks:Coupling topology and weighted dynamics[J]. Physical Review Letters.2004,92:228701.
[17]Wang N C, Chen J C. A stable on-demand routing protocol for mobile Ad Hoc networks with weight-based strategy[C]. Proceedings of Parallel and Distributed Computing, Applications and Technologies.2006,166-169.
[18]Tabatabaei S, Jamali M A J. A stable weight-based routing algorithm to increase throughput in Mobile Ad Hoc Networks[C]. Proceedings of Wireless and Optical Communications Networks.2009.
[19]Kunavut K, Sanguankotchakorn T. QoS routing for heterogeneous Mobile Ad Hoc Networks based on multiple exponents in the definition of the weighted connectivity index[C]. Proceedings of International Conference on Signal-Image Technology and Internet-Based Systems.2011.
[20]Qin S, Dai G Z, Wang L, et al. Seale-free property of complex ad hoc networks with accelerated growth[J]. Statistical Mechanism and its Applications.2007,376:679-686.
[21]Masuda N, Miwa H. Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights[J]. Phys Rev E.2004,70(3):036124.
[22]Szabo G, Alava M, Kertesz J. Shortest paths and load scaling in scale-free trees[J]. Phys Rev E.2002,66(2):026101.
[23]覃森,戴冠中,王林,等.不同权重定义下的静态与动态加权网络的比较分析[J].西北工业大学学报.2007,25(5)：672-676.
[1]Jain K, Padhve J, Padmanabhan V, et al. Impact of interference on multi-hop wireless network performance [C]. Proceedings of MobiCom,2003,14:8-14.
[2]Ganesan D, Krishnamachari B, Woo A, et al. An empirical study of epidemic algorithms in large scale multi-hop wireless networks [Z]. USA,2002.
[3]Couto D, Aguayo D, Chambers B A, et al. Performance of multi-hop wireless networks: shortest path is not enough[J]. ACM Sigcomm Computer Communication Review,2003, 33(1):83-88.
[4]Zhao J, Govindan R. Understanding packet delivery performance in dense wireless sensor networks[C]. Proceedings of ACM SenSys.2003:1-13.
[5]Higaki H. LBSR:routing protocol for MANETs with unidirectional links[C]. Proceedings of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.2007.
[6]Piao J J, Chang T M. TPSR:Transmission power based source routing protocol for mobile Ad Hoc networks with unidirectional links[C]. Proceedings of International Conference on Wireless Communications Networking and Mobile Computing.2010,1-4.
[7]Morino H, Miyoshi T, Ogawa M. Unidirectional Ad Hoc routing protocol with area-controlled flooding using overheard neighbor node information[C]. Proceedings of International Symposium on Autonomous Decentralized Systems.2007,519-525.
[8]郭光伟.基于单向链路的Ad Hoc路由研究[J].现代计算机.2008,12：63-65.
[9]RFC3561. Ad hoc On-Demand Distance Vector (AODV) Routing[S].2003.
[10]Wang Z Z, Lu J D, Tang J J. Neighbor monitoring mechanism to solve unidirectional link problem in MANET[C]. Proceedings of International Conference on Wireless and Mobile Communications.2007.
[11]桑俊俊,石胜飞,李建中,等.无线传感器网络分布式单向链路检测算法[J].通信学报.2008,29(11)：165-172.
[12]Lan G Q, Qu Z W. Unidirectional link problem in AODV routing protocol[C]. Proceedings of IC-BNMT.2009.
[13]Lin C H, Liu B H, Yang H Y, et al. Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks with unidirectional links[C]. Proceedings of the IEEE INFOCOM.2008,1004-1012.
[14]Fang Z, Wang W L. Research on unidirectional link routing algorithm for mobile Ad Hoc networks[C]. Proceedings of International Conference on Advanced Computer Theory and Engineering.2010,5:287-290.
[15]Wu X J, Zhou M H, Meng L M, et al. Connection stability analyze based on LEACH algorithm for mobile Ad Hoc network[J]. Infornation technology journal.2010,9(6).
[16]Zhou K, Meng L M, Xu Z J, et al. A dynamic clustering based routing algorithm for wireless senor networks[J]. Information technology journal.2008,7(4):694-697.
[17]David B, David A, Hu Y C, et al. The Dynamic source routing protocol for mobile wireless networks[R]. USA,2000.
[2]Weiser M. The computer for the twenty-first century[J]. Scientific American.1991, 265(3):94-104.
[3]Davies N, Gellersen H. Beyond prototypes:challenges in deploying ubiquitous systems[J]. Ieee pervasive computing.2002,1(1):26-35.
[4]Li X Y. Applications of k-local MST for topology control and breadcasting in wireless ad hoc networks[J]. IEEE Transactions on Parallel and Distributed Systems.2004, 15:1057-1069.
[5]Gannapathy V R. Network and medium access control (NET-MAC) layers for wireless mesh network (WMN)[C]. MALAYSIA APACE.2007.
[6]Li J H, Levy R, Yu M, et al. A scalable key management and clustering scheme for ad hoc networks[C]. Association for Computing Machinery.2006.
[7]Reddy T B, Karthigeyan I, Manoj B S, et al. Quality of service provisioning in Ad Hoc wireless networks:A survey of issues and solutions[J]. Ad Hoc Networks,2006,4 (1): 83-124.
[8]Ci S, GUI M Z, Chen H H, et al. Self-regulating network utilization in mobile Ad Hoc wireless networks[J]. IEEE Transactions on Vehicular Technology.2006,55 (4): 1302-1310.
[9]张昆鹏.卫星通信的发展及其关键技术[J].硅谷,2009,8：27.
[10]王学华,朱立东.低轨卫星通信系统地面核心网设计与仿真[J].空间电子技术.2010,2：119-123.
[11]3GPP 3G TR 23.923 ver.3.0, Combined GSM and mobile IP mobility handing in UMTS IP CN[S].2000.
[12]3GPP, TS 23.002, Rel.4. Network Architecture[S].
[13]3GPP TR 23.934 V1.0.0, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking:Functional and Architectural Definition (Release 6)[S]. 2002.
[14]3GPP TR 22.934 V7.0.0, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking (Release 7)[S].2007.
[15]3GPP TS 29.234 V7.9.8, Feasibility Study on 3GPP System to Wireless Local Area Network (WLAN) Interworking Stage 3 (Release 7)[S].2008.
[16]唐军.集群移动通信综述[J].电子技术,2000,10：25-28.
[17]Cheng C H, Li L Y. Scheme design of the city emergency response system based on grid[J]. Journal of Wuhan University of Technology.2006,30(6):965-968.
[18]Ilyas M. The Handbook of Ad-hoc Networks[M]. Florida:CRC Press,2002.
[19]陈林星,曾曦,曹毅.移动Ad Hoc网络自组织分组无线网络技术[M].北京：电子工业出版社,2006.
[20]Johansson P. Scenario-based Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks[C]. Proceedings of IEEEACM MobiCom.1999.
[21]McNett M, Voelker G M. Access and Mobility of Wireless PDA Users[EB/OL]. http://sysnet.ucsd.edu/wtd/wtd.html.2013-04-12.
[1]郑少仁,王海涛,赵志峰,等Ad Hoc网络技术[M].人民邮电出版社.2005,1-13.
[2]Basagni S, Conti M, Giorgano S, et al. Mobile Ad Hoc networks[M]. Wiley-IEEE.2004, 69-300.
[3]Ramanathan R, Redi J. A brief overview of Ad Hoc networks:challenges and directions. IEEE Communications Magzine[J].2002,40(5):20-22.
[4]陈林星,曾曦,曹毅.移动Ad Hoc网络自组织分组无线网络技术[M].北京：电子工业出版社,2006.
[5]Abramson N. The ALOHA system:Another alternative for computer communications[C]. Proceedings of the AFIPS Joint Computer Conferences.1970,281-285.
[6]Macker J, Corson M. Mobile Ad hoc networking and the IETF[J]. ACM SIGMOBILE Mobile Computing and Communications Review.1998,2(1):9-14.
[7]IETF Working Group:Mobile Ad hoc networks (manet)[EB/OL]. http://www.ietf.org/html.charters/manet-charter.html.
[8]Sun J Z. Mobile Ad hoc networking:an essential technology for pervasive computing[C]. Proceedings of International Conferences on Info-tech and Info-net.2001,3:316-321.
[9]Rajaraman R. Topology control and routing in Ad hoc networks:A survey[J]. ACM SIGACT News.2002,33(2):60-73.
[10]Santi P. Topology control in wireless Ad Hoc and sensor networks[J]. ACM Computing Surveys(CSUR).2005,37(2):164-194.
[11]S Kumar, V Raghavan, J Deng. Medium access control protocols for Ad Hoc wireless networks:A survey[J]. Ad Hoc Networks.2006,4(3):326-358.
[12]Billinghurst M, Starner T. Wearable devices:new ways to manage information[J]. Computer.1999,32(1):57-64.
[13]Davis J, Fagg A, Levine B. Wearable computers as packet transport mechanisms in highly-partitioned Ad-hoc networks[C]. Proceeding of the International Symposium on Wearable Computing.2001:141-148.
[14]Yang H, Luo H Y, Ye F, et al. Security in mobile Ad Hoc networks:challenges and solutions[J]. IEEE Wireless Communications,2004,11(1):38-47.
[15]Hu Y C, Perrig A. A survey of secure wireless ad hoc routing[J]. IEEE Security & Privacy. 2004,2(3):28-39.
[16]TODD R, Yasinsac A. Surveying security analysis techniques in MANET routing protocols[J]. IEEE Communications.2007,9(4):69-84.
[17]WU J. Dominating-set-based routing in Ad Hoc wireless networks[J]. Wireless Networks and Mobile Computing.2002,425-450.
[18]Akkaya K, Younis M. A survey on routing protocols for wireless sensor networks[J]. Ad Hoc Networks.2005,3(3):325-349.
[19]Basagni S, Conti M, Giordano S, et al. Mobile ad hoc networking[M].New Jersey:Wiley-IEEE press,2004.
[20]Estrin D, Srivastava M. Wireless sensor networks(Tutorial)[C]. In:ACM MOBICOM, 2002.
[21]Fiebig B. European traffic accidents and purposed solutions[A]. Proceedings of the ITU-T Workshop on Standardization in Telecommunication for Motor Vehicles[C].2003,24-25.
[22]Bruno R, Conti M, Greqori E. Mesh networks:commodity multihop Ad Hoc networks[J]. IEEE Communications Magzine.2005,43(3):123-131.
[23]Akyildiz I F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine.2002,40(8):102-114.
[24]Santi P. Topology control in wireless ad hoc and sensor networks[M]. WILEY.2006.
[25]Luo G, Wu W. A group aware topology control algorithm in mobile Ad hoc networks[C]. In Proceedings of International Conference on Wireless Communications Networking and Mobile Computing (WICOM).2006.
[26]Cheng M X, Cardei M, Sun J, et al. Topology control of ad hoc wireless networks for energy effieiency [J]. IEEE Transactions on Computers.2004,53(12):1629-1635.
[27]Zhao M, Wang W. A unified mobility model for analysis and simulation of mobile wireless networks[J]. ACM-Springer Wireless Networks (WINET).2009,15(3):365-389.
[28]Johnson D B, Maltz D A, Mellon C, et al. The dynamic source routing protocol for mobile Ad hoc networks (DSR)[R]. RFC4728,2007.
[29]Perkins C, Beldingkoyer E, Das S. Ad hoc on-demand distance vestor (AODV) routing[R].RFC3651,2003.
[30]Loseri V, DeRango F, Marano S. A correction for Ad hoc on demand multipath distance vector routing protocol(AOMDV)[C].Proceedings of Vehicular Technology Conference. 2005,4:2775-2779.
[31]Clausen T, Jacquet E. Optimized link state routing protocol(OLSR), IETF RFC 3626, 2006.
[32]Dabideen J S, Garcia-Luna-Aceves J J. An efficient routing in MANET using ordered walks[J].Wireless networks.2011,17(4):1095-1112.
[33]Piao J J, Chang T M. TPSR:Transmission Power Based Source Routing Protocol for Mobile Ad Hoc Networks with Unidirectional Links[C].6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).2010,1-4.
[34]Singh S, Raghavendra C S. PAMAS:Power Aware Multi-access protocol with signaling for ad hoc networks[J]. ACM SIGCOMM Computer Communication Review, 1998,28(3):5-26.
[35]Hus C, Tseng Y. Cluster-based semi-asynchronous power-saving protocols for multi-hop ad hoc networks[C]. IEEE International Conference on Communieations.2005, 5:3166-3171.
[36]Krizman K J, Biedka T E, Rappaport T S. Wireless position location:Fundamentals, implementation strategies, and source of error[J]. Proceedings of the IEEE Vehicular Tech. 1997,2:919-923.
[37]Guang L, Assi C, Benslimane A. MAC layer misbehavior in wireless networks: challenges and solutions[J]. IEEE Wireless Communication.2008,15(4):6-14.
[38]Booysen M J, Zeadally S, Rooyen G J. Survey of media access control protocols for vehicular ad hoc networks[J]. IET Communications.2011,5(11):1619-1631.
[39]Buttyan L, Hubaux J. Report on a working session on security in wireless ad hoc networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review.2003, 7(1):74-94.
[40]Yang H, Luo H, Ye F, et al. Security in mobile Ad hoc networks:challenges and solutions. IEEE Wireless Communications.2004,11(1):38-47.
[41]Zhang D Y, Zhang B F. QoS model of space-based networks based on DiffServ[J]. Journal of Jiangsu University.2011,32(2):205-210.
[42]Domingo M C, Remondo D. QoS support between Ad hoc networks and fixed IP networks. Computer Communications.2008,31(11):2646-2655.
[43]Zhang N N, Yang M Y, Jing Y W. Congestion control for DiffServ network using second-order sliding mode control. IEEE Transactions on Industrial Electronics.2009, 56(9):3330-3336.
[44]Jeong H, Manson S P, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature.2001,411:41-41.
[45]Moore C, Newman M E J. Epidemics and percolation in small-world networks[J]. Phys Rev E.2000,61:5678-5682.
[46]Faloutsos M., Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. Proc ACM SIGComm.1999,29(4):251-262.
[47]Siganos G, Faloutsos M, Faloutsos P, et al. Power-laws and the AS-level Internet topology[J]. IEEE/ACM Trans Networking.2003,11:514.
[48]王林,戴冠中.Internet拓扑中连接率的研究[J].复杂系统与复杂性科学.2004,1(2)：9-15.
[49]Goh K I, Kahng B, Kim D. Fluctuation-driven dynamics of the Internet topology[J]. Phys Rev Lett.2002,88(10):108701.
[50]Ebel H, Mielsch L, Bornholdt S. Scale-free topology of e-mail networks[J]. Phys Rev E. 2002,66:035103(R).
[51]汪小帆,李翔,陈关荣.复杂网络理论及其应用[M].北京：清华大学出版社,2006.
[52]胡海波,王林.幂律分布研究简史[J].物理.2005,34(12)：889-896.
[53]Strogatz S H. Exploring comlex networks[J]. Nature,2001,410:268-276.
[54]Dorogovtsev S N, Mendes J F F. Evolution of networks[J]. Advances in Physies. 2002,51:1079-1187.
[55]Wang X F, Chen G R. Critieal dynamic of the kinetic Glauber-Ising model on hierarchical lattices[J]. IEEE Circuits and Systems Magazine.2003,3(1):6-20.
[56]Camp T, Boleng J, Davies V. A survey of mobility models for Ad Hoc network research[J]. Wireless Communication & Mobile Computing.2002,2(5):483-502
[57]Wang L, Zhu C P, Gu Z M, et al. Scaling of critical connectivity of mobile Ad Hoc communication networks[J]. Physical Review E.2008,78(6):066107.
[58]Sarshar N, Roychowdhury V. Multiple power-law structures in heterogeneous complex networks. Physical Review E.2005,72:026114.
[59]Tong C, Niu J W, Qu G Z, et al. Complex networks properties analysis for mobile ad hoc networks[J]. IET Communications.2012,6(4):370-380.
[60]Watts D J, Strogatz S H. Collective dynamics of small-world networks[J]. Nature.1998, 393:440-442.
[61]Albert R, Barabasi A L. Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 2002,74:47-97.
[62]Barabasi A L, Albert R. Emergence of scaling in random networks[J]. Science.1999, 286(5439):509-512.
[63]Li X, Chen G R. A local world evolving network model[J]. Physica A 328.2003,274.
[64]Liu Z H, Lai Y C, Ye N, et al. Connectivity distribution and attack tolerance of general networks with both preferential and random attachments[J]. Phys. Lett. A 2002,303, 337-344.
[65]Zhu C P, Zhou T, Yang H J, et al. The process of coevolutionary competitive exclusion: speciation, multifractality and power-laws in correlation[J]. New Journal of Physics.2008, 10,023006.
[66]Wang W X, Wang B H, Hu B, et al. General dynamics of topology and traffic on weighted technological networks[J]. Phys. Rev. Lett.2005,94,188702.
[67]汪秉宏,王文旭,周涛.交通流驱动的含权网络[J].物理2006,35(4)：304-310.
[68]史定华.网络--探索复杂性的新途径[J].系统工程学报.2005,20(2)：115-119.
[69]Xie Y B, Zhou T, Bai W J, et al. Geographical networks evolving with an optimal policy[J]. Phys.Rev.E,75.2007,036106:1-8.
[70]Sarshar N, Roychowdhury V. Scale-free and stable structures in complex Ad Hoc networks[J]. Phys.Rev.E,69.2004,026101:1-6.
[71]Nemeth G, Vattay G. Giant clusters in random ad hoc networks[J]. Phys.Rev.E,67.2003, 036110:1-6.
[72]李勇,李伟,韦洛霞.Ad Hoc网络的复杂网络试图[J].东莞理工学院学报.2006,13(1)：19-23.
[73]Qin S, Dai G Z, Wang L, et al. Scale-free evolving networks with accelerated attachment[J]. Advances in Complex Systems.2007,10(2):143-154.
[74]Yang S. Exploring complex networks by walking on them[J]. Physical Review E.2005, 71:16107.
[75]Thadakamalla H P, Albert R, Kumana S R T. Search in weighted complex networks[J]. Physical Review E.2005,72:66128.
[76]Kim B J,Yoon C N.Han S K, et al. Path finding strategies in scale-free networks[J]. Physical Review E.2002,65:27103.
[77]Wang W X, Wang B H, Yin C Y, et al. Traffic dynamics based on local routing protocol on a scale-free network[J]. Physical Review E 2006,73:026111.
[78]Guimera R, Diaz-Guilera A, Vega-Redondo F, et al. Optimal network topologies for local search with congestion[J]. Physical Review Letters.2002,89(24):248701-248705.
[79]Liu Z H, Ma W C, Zhang H, et al. An efficient approach of controlling traffic congestion in scale-free networks[J]. Physica A.2006,370,843-853.
[80]Yan G, Zhou T, Hu b, et al. Efficient routing on complex networks[J]. Physical Review E. 2006,73,46108-46112.
[81]朱凌峰,谭敏生.无标度网络上一种改进的基于节点有效路径的路由策略[J].电脑知识与技术.2010,6(31)：8741-8743.
[82]Wang S P, Pei W J. Detecting unknown paths on complex networks through random walks[J]. Physica A.2009,388(4):514-522.
[83]Echenique P, Gomez-Gardenes J, Moreno Y. Improved routing strategies for Internet traffic delivery[J]. Phys. Rev. E,70.2004,056105.
[84]Echenique P, Gomez-Gardenes J, Moreno Y. Dynamics of jamming transitions in complex networks[J]. Europhys. Lett.2005,71,325.
[85]M Tang, Z H Liu, X M LIANG. Self-adjusting routing schemes for time-varying traffic in scale-free networks[J]. Physical Review E.2009,80,26114-26121.
[86]Thadakamalla H P, Albert R, Kumata S R T. Search in spatial scale-free networks[J]. New Journal of Physics.2007,96:190.
[87]Imsek O, Jensen D. Navigating networks by using homophily and degree[J]. Proceedings of the National Academy of Sciences.2007,105(35):12758-12762.
[1]Sarrafi A, Firooz M H, Barjini H. A cluster based topology control algorithm for wireless Ad-hoc networks[C]. Proceedings of Systems and Networks Communications,2006,68.
[2]Wei D L, Chan H A. Clustering Ad Hoc networks:schemes and classifications[C]. Proceedings of IEEE Sensor and Ad Hoc Communications and Networks.2006,3:920-926.
[3]Bagwari A, Bisht S. Cluster head gateway approach using in integrated mobile Ad hoc network[C]. Proceedings of IEEE Recent Advances in Intelligent Computational Systems. 2011,652-655.
[4]Wu J, Gu G C, Hou G Z. A clustering algorithm considering on a hierarchical topology's stability for Ad Hoc networks[C]. Proceedings of Education Technology and Computer Science.2009,1:715-718.
[5]Lin C H R, Gerla M. A distributed architecture for multimedia in dynamic wireless networks[C]. Proceedings of IEEE GLOBECOM.1995,1468-1472.
[6]Gerla M, Tsai J T. Multicluster mobile, multimedia radio network[J]. ACM/Baltzer Journal of Wireless Networks.1995,1(3):255-265.
[7]Basagni S. Distributed clustering for Ad Hoc networks[A]. International Symposium on Parallel Architectures, Algorithms and Network[C]. Perth,1999,310-315.
[8]Chatterjee M, Sajal K D, Turgut D. A weighted clustering algorithm (WCA) for Ad hoc Networks[C]. IEEE Globecom.2000,1697-1701.
[9]王海涛,田畅,郑少仁.一种新型的Ad Hoc网络分簇算法及其性能仿真[J].系统仿真学报.2003,15(2)：193-197.
[10]Newmen M. The structure and function of complex networks[J]. SIAM Review.2003, 45(2):167-256.
[11]Jeong H, Manson S P, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature.2001,411:41-41.
[12]Moore C, Newman M. Epidemics and percolation in small-world networks[J]. Phys Rev E. 2000,61:5678-5682.
[13]Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. Proceedings of ACM SIGComm.1999,29(4):251-262.
[14]Siganos G, Faloutsos M, Faloutsos P, et al. Power-laws and the AS-level Internet topology[J]. IEEE/ACM Trans Networking.2003,11:514.
[15]Goh K I, Kahng B, Kim D. Fluctuation-driven dynamics of the Internet topology[J]. Phys Rev Lett.2002,88(10):108701.
[16]Ebel H, Mielsch L, Bornholdt S. Scale-free topology of e-mail networks[J]. Phys Rev E. 2002,66:035103(R).
[17]Barabasi A L, Albert R, Jeong H. Mean-field theory for scale-free random networks:The topology of the World Wide Wed[J]. Physica A.2000,281:69-77.
[18]Tian B, Don T. On distinguishing between Internet power-law topology generators[C]. Proceedings of IEEE INFOCOM. New York:2002,638-647.
[19]Zhou S, Mondragon R J. Towards modelling the Internet topology-the interactive growth model[C]. Proceedings of 18th International TELETRAFFIC CONGRESS (ITC). Berlin: 2003.
[20]Zhou S, Mondragon R J. The positive-feedback preference model of the AS-level Internet topology[C]. Proceedings of IEEE International Conference on Communications.2005, 1:163-167.
[21]Chen Q H, Shi D H. The modeling of scale- free networks[J]. Physica A,2004,335:240-248.
[22]陈禹,宗骁,郝杰等.BA模型的三种扩展[J].系统工程学报.2005,20(2)：120-127.
[23]章忠志,荣莉莉.BA网络的一个等价演化模型[J].系统工程.2005,23(2)：1-5.
[24]杨波,陈忠,段文奇.基于个体选择的小世界网络结构演化[J].系统工程.2004,22(12)：1-5.
[25]Li X, Chen G R. A local-world evolving network model[J]. Physica A.2003,328:274-286.
[26]Xie Y B, Zhou T, Bai W J, et al. Geographical networks evolving with an optimal policy[J]. Phys.Rev.E,75.2007,036106:1-8.
[27]Sarshar N, Roychowdhury V. Scale-free and stable structures in complex Ad Hoc networks[J]. Phys.Rev.E,69.2004,026101:1-6.
[28]Nemeth G, Vattay G. Giant clusters in random ad hoc networks[J]. Phys.Rev.E,67.2003, 036110:1-6.
[29]李勇,李伟,韦洛霞Ad Hoc网络的复杂网络试图[J].东莞理工学院学报.2006,13(1)：19-23.
[30]McNett M, Voelker G M. Access and mobility of wireless PDA users[EB/OL]. http://sysnet. ucsd. edu/wtd/wtd. html.2013-04-12.
[31]周雪梅,潘多,王博辉.基于服务评价管理的自组织网络数据共享机制[J].计算机应用.2010,30(12)：3164-3167.
[32]黄晓峰,王博辉,蔡念.一种基于复杂网络理论的移动自组网路由算法研究[J].计算机应用研究.2011,28(10)：3871-3874.
[33]Qin S. Scale-free topology structure in ad hoc networks[C]. Proceedings of 11th IEEE International Conference on Communication Technology.2008,21-24.
[34]Filiposka S V, Trajanov D R, Grnarov A L. Performance analysis of scale-free communities in ad hoc networks[C]. Proceedings of 1st International Conference on Wireless VITAE. 2009,399-403.
[35]Chao T, Niu J W, Long X, Gao X P. A mobile scale-free network model for hybrid ad hoc and sensor network[C]. Proceedings of IET 2nd International Conference on Wireless, Mobile and Multimedia Networks.2008,81-84.
[36]Fronezak A, Fronezak P, Holyst J A. Mean-field theory for clustering coefficients in Barabasi-Albert networks[J]. Physical Review E.2003,68(4):046126.
[37]Dorogovtsev S N, Mendes J F F, Samukhin A N. Structure of growing networks with preferential linking[J]. Physical Review Letters.2000,85(21):4633.
[38]Krapivsky P L, Redner S, Leyvraz F. Connectivity of growing random networks[J]. Physical Review Letters.2000,85(21):4629-4632.
[39]史定华.复杂网络的随机刻画和演化规律[J].力学进展.2008,6：679-691.
[I]Johnson D B, Maltz D A. Dynamic source routing in Ad Hoc wireless networks[J]. Mobile Computing.1996,153-181.
[2]Perkins C, Royer E. Ad-hoc on demand distance vector routing [A]. Proceedings of The 2nd IEEE Workshop on Mobile Computing Systems and Applications [C], New Orleans. 1999,90-100.
[3]Perkins C E, Bhagwat P. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers[J]. Computer Communication.1994,234-244.
[4]Project on Mobile Ad-hoc Networking and Clustering[EB/OL]. http://www.cs.chalmers.se/～tsigas/Courses/DCDSeminar/Files/adhocproject.pdf. 2013-04-12.
[5]Murthy S, Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks[J]. ACM Mobile Network and Applications, Special Issue on Routing in Mobile Communication Networks.1996,1(2):183-197.
[6]PERKINS C, ROYER E. Ad-hoc on demand distance vector routing [A]. The 2nd IEEE Workshop on Mobile Computing Systems and Applications [C], New Orleans, LA,1999: 90-100.
[7]JOHNSON J, MALTZ D. Dynamic source routing in ad hoc wireless networks [M]. Mobile Computing. Kluwer Academic,1996.
[8]Toh C. A novel distributed routing protocol to support ad-hoc mobile computing[C]. Proceedings of IEEE 15th Annual International Phoenix Conference.1996,480-486.
[9]Jiang M, Tay J J. Cluster based routing protocol, Internet Draft[EB/OL]. draft-ietf-manet-cbrp-spec-Ol.txt.2003.
[10]Raju J, Garcia-Luna-Aceves J. A new approach to on demand loop-free multi-path routing[C]. Proceedings of the 8th Annual IEEE International Conference on Computer Communications and Networks. Boston:1999.522-527.
[11]Gunes M, Sorges U, Bouazizi I. ARA--the ant-colony based routing algorithm for MANETs[C]. Proceedings of ICPP workshop on Ad Hoc Networks.2002,79-85.
[12]Haas Z J, Pearlman M R, Samar P. The zone routing protocol (ZRP) for Ad Hoc networks[EB/OL]. Draft-ietf-manet-zone-zup-04.txt, Internet-Draft, IETF.2002.
[13]Woo S C, Singh S, Scalable routing protocol for Ad Hoc networks[J]. Wireless Networks. 2001,7(5):513-529.
[14]Nikaein N, Laboid H, Bonnet C. Distributed dynamic routing algorithm(DDR) for mobile ad hoc networks. Proceedings of the MobiHOC 2000:First Annual Workshop on Mobile Ad Hoc Networking and Computing.2000.
[15]Heinzelman W B, Chandrakasan A P, Balakrishnan H. An application-specific protocol architecture for wireless microsensor networks [J]. IEEE Transactions on Wireless Communications.2002,1 (4):660-670.
[16]Younis O, Fahmy S. HEED:A hybrid, Energy-Efficient, Distributed Clustering Approach for Ad-Hoc Sensor Networks [J]. IEEE Transactions on Mobile Computing.2004, 3(4):366-379.
[17]苏莹,郑世珏,高丽,等.一种基于复杂网络特性的校园无线传感器网络路由算法[J].电子测量技术.2007,30(4)：206-208,212.
[18]Huang H J, Hu G m, Yu F C. Energy-aware geographic routing in wireless sensor networks with anchor nodes[J]. International Journal of Communication.2013,26(1): 100-113.
[19]胡福林,小海军.无线网络中的一种基于小世界模型的路由协议[J].计算机工程与科学.2008,30(8)30-35,56.
[20]黄晓峰,王博辉,蔡念.一种基于复杂网络理论的移动自组网路由算法研究[J].计算机应用研究.2011,28(10)：3871-3874.
[21]Wang Y H, Chen M, Wang P, et al. Unidirectional link-state advertisement based on power control for MANET[J]. The Journal of China Universities of Posts and Telecommunications.2012,19:55-60.
[22]Echenique P, Gomez-Gardenes J, Moreno Y. Improved routing strategies for Internet traffic delivery [J]. Physical Review E.2004,70(5):056105-056108
[23]Echenique P, Gomez-Gardenes J, Moreno Y. Dynamics of jamming transitions in complex networks[J]. Europhysics Letters.2005,71(2):325-328.
[24]A Arenas, G A Diaz, R Guimera. Communication in Networks with Hierarchical Branching[J]. Phys. Rev. Lett.2001,86(14):3196-3199.
[25]Singh S, Woo M, Raghavendra C S. Power-aware routing in mobile ad hoc networks[C]. Proceedings of Mobi-Com Conference.1998,181-190.
[1]Goh K L, Kahng B, Kim D. Nonlocal evolution of weighted scale-free networks[J]. Phys Rev E.2005,72(1):017103.
[2]Park K, Lai Y C, Ye N. Characterization of weighted complex networks[J]. Phys ReV E. 2004,70(2):02610.
[3]Barrat A, Barthlenly M. Modeling the evolution of weighted networks[J]. Phys Rev E. 2004,70(6):066149.
[4]Goh K I, Noh J D, Kahng B, et al. Load Distribution in Weighted Complex Networks[J]. Phys Rev E.2005,72(1):017102.
[5]Yang K, Huang L, Yang L, et al. Lattice Scale-free Networks with Weighted Linking[J]. Phys Rev E.2004,70(1):015102(R).
[6]Almaas E, Krapivsky P L. Statistics of weighted tree like networks. Phys Rev E.2005, 71(3):036124.
[7]Barrat A, Barthelemy M, Pastor-Satorras R, et al. The architecture of complex weighted networks[J]. Proceedings of the National Academy of Sciences of the United States of America.2004,101(11):3747-3752.
[8]Barrat A, Barthelemy M, Vespignani A. Modeling the evolution of weighted networks[J]. Physical Review E,2004,70(6):1-13.
[9]Fan Y, Li M, Chen J, et al. Network of econophysics:a weighted network to investigate the development of econophysics[J]. Physica B.2004,18:2505-2512.
[10]Almaas E, Kovacs B, Vicsek T, et al. Global organization of metabolic fluxes in the bacterium Escherichia coli [J]. Nature.2004,427(6977):839-843.
[11]Postor-Satorras R, Vazquez A, Vespignani A. Dynamical and correlation properties of the Internet[J]. Physical Review Letters,2001,87(25):258701.
[12]Smith J. Characterizing computer performance with a single number[J]. Communications of the ACM,1988,31:1202-1206.
[13]Latora V, Marehiori M. Economic small-world behavior in weighted networks. Physics B, 2003,32:249-263.
[14]陈华良,刘忠信,陈增强,等.复杂网络的一种加权路由策略研究[J].物理学报.2009,58(9)：6068-6073.
[15]周秋花,邹艳丽.加权网络的交通动力学研究[J].计算机工程.2010,36(19)：126-131.
[16]Barrat A, Barthelemy M, Vespignani A. Weighted evolving networks:Coupling topology and weighted dynamics[J]. Physical Review Letters.2004,92:228701.
[17]Wang N C, Chen J C. A stable on-demand routing protocol for mobile Ad Hoc networks with weight-based strategy[C]. Proceedings of Parallel and Distributed Computing, Applications and Technologies.2006,166-169.
[18]Tabatabaei S, Jamali M A J. A stable weight-based routing algorithm to increase throughput in Mobile Ad Hoc Networks[C]. Proceedings of Wireless and Optical Communications Networks.2009.
[19]Kunavut K, Sanguankotchakorn T. QoS routing for heterogeneous Mobile Ad Hoc Networks based on multiple exponents in the definition of the weighted connectivity index[C]. Proceedings of International Conference on Signal-Image Technology and Internet-Based Systems.2011.
[20]Qin S, Dai G Z, Wang L, et al. Seale-free property of complex ad hoc networks with accelerated growth[J]. Statistical Mechanism and its Applications.2007,376:679-686.
[21]Masuda N, Miwa H. Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights[J]. Phys Rev E.2004,70(3):036124.
[22]Szabo G, Alava M, Kertesz J. Shortest paths and load scaling in scale-free trees[J]. Phys Rev E.2002,66(2):026101.
[23]覃森,戴冠中,王林,等.不同权重定义下的静态与动态加权网络的比较分析[J].西北工业大学学报.2007,25(5)：672-676.
[1]Jain K, Padhve J, Padmanabhan V, et al. Impact of interference on multi-hop wireless network performance [C]. Proceedings of MobiCom,2003,14:8-14.
[2]Ganesan D, Krishnamachari B, Woo A, et al. An empirical study of epidemic algorithms in large scale multi-hop wireless networks [Z]. USA,2002.
[3]Couto D, Aguayo D, Chambers B A, et al. Performance of multi-hop wireless networks: shortest path is not enough[J]. ACM Sigcomm Computer Communication Review,2003, 33(1):83-88.
[4]Zhao J, Govindan R. Understanding packet delivery performance in dense wireless sensor networks[C]. Proceedings of ACM SenSys.2003:1-13.
[5]Higaki H. LBSR:routing protocol for MANETs with unidirectional links[C]. Proceedings of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.2007.
[6]Piao J J, Chang T M. TPSR:Transmission power based source routing protocol for mobile Ad Hoc networks with unidirectional links[C]. Proceedings of International Conference on Wireless Communications Networking and Mobile Computing.2010,1-4.
[7]Morino H, Miyoshi T, Ogawa M. Unidirectional Ad Hoc routing protocol with area-controlled flooding using overheard neighbor node information[C]. Proceedings of International Symposium on Autonomous Decentralized Systems.2007,519-525.
[8]郭光伟.基于单向链路的Ad Hoc路由研究[J].现代计算机.2008,12：63-65.
[9]RFC3561. Ad hoc On-Demand Distance Vector (AODV) Routing[S].2003.
[10]Wang Z Z, Lu J D, Tang J J. Neighbor monitoring mechanism to solve unidirectional link problem in MANET[C]. Proceedings of International Conference on Wireless and Mobile Communications.2007.
[11]桑俊俊,石胜飞,李建中,等.无线传感器网络分布式单向链路检测算法[J].通信学报.2008,29(11)：165-172.
[12]Lan G Q, Qu Z W. Unidirectional link problem in AODV routing protocol[C]. Proceedings of IC-BNMT.2009.
[13]Lin C H, Liu B H, Yang H Y, et al. Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks with unidirectional links[C]. Proceedings of the IEEE INFOCOM.2008,1004-1012.
[14]Fang Z, Wang W L. Research on unidirectional link routing algorithm for mobile Ad Hoc networks[C]. Proceedings of International Conference on Advanced Computer Theory and Engineering.2010,5:287-290.
[15]Wu X J, Zhou M H, Meng L M, et al. Connection stability analyze based on LEACH algorithm for mobile Ad Hoc network[J]. Infornation technology journal.2010,9(6).
[16]Zhou K, Meng L M, Xu Z J, et al. A dynamic clustering based routing algorithm for wireless senor networks[J]. Information technology journal.2008,7(4):694-697.
[17]David B, David A, Hu Y C, et al. The Dynamic source routing protocol for mobile wireless networks[R]. USA,2000.