移动自组网抗毁性及其评估方法研究
|
摘要
抗毁性是指系统在出现故障或遭受攻击时,能够及时地完成其关键服务的能力。抗毁性不仅是网络的一个基本性质,也是衡量一个国家政治、军事、经济等抗毁能力的一个重要指标。因此,抗毁性研究也成为了网络与信息安全一个重要的研究方向。
随着人们对移动自组网的研究不断深入,其应用领域也随之不断扩大。然而,由于移动自组网本身的特点,容易出现故障或遭受攻击,导致对其抗毁性的研究极具挑战性。如何对抗毁性进行定量分析,以及如何提高系统的抗毁性都是移动自组网抗毁性研究的关键问题。为了研究这些问题,本论文提出了抗毁性评估模型、抗毁机制、以及具有抗毁能力的路由协议。从不同的角度,采用多种方法和技术,探索解决上述问题的思路和方法。主要的创新性工作如下：
(1)提出了一种面向节点故障的抗毁性定量评估模型。首先,针对影响移动自组网抗毁性的各种故障进行抗毁性建模,利用连续时间马尔可夫链来精确地刻画移动自组网的抗毁性；其次,在对移动自组网抗毁性建模的基础上,以分段式路由、基于簇的多路径动态源路由和基于多路径的分段式路由三种协议为例,引入可靠性理论对大规模移动自组网的抗毁性进行分析和量化评估。通过实验对抗毁性进行定量分析,结果表明了该方法的有效性。
(2)提出了面向节点异常行为的抗毁性定量评估模型。通过对节点行为进行建模和对三维网络连通性进行分析,实现在节点遭受攻击时对三维移动自组网抗毁性进行定量评估。首先,采用了半马尔可夫过程来对节点异常行为进行建模,对三维移动自组网的节点最小度进行了推导；然后,在对孤立节点问题进行建模的基础上,给出了一种用来分析网络k-连通性的有效方法；通过对节点异常行为给三维网络连通性所造成的影响进行分析,得到了一种网络保持k-连通时的抗毁性数学描述。最后,通过实验对抗毁性进行定量分析,表明了该方法的有效性和合理性。
(3)为保证节点间的安全通信,以提高网络的抗毁性,在抗毁性定量评估的基础上,提出了移动自组网中基于多约束和协同过滤的动态信任机制。该机制的主要思想是：首先,采用一个带多约束的信任更新算法来评估节点间的直接信任。其中时间衰减因子保证了信任度随时间进行衰减；奖励因子保证了善意节点应受到奖励；惩罚因子保证了恶意节点应受到惩罚。然后,通过采用协同过滤技术评估推荐信任,以此来阻止不诚实的推荐。性能分析结果表明,该方法比Bayesian模型更能精确地计算节点之间的信任度。
(4)提出了基于动态信任机制的可信路由协议,其目的是进一步验证所提出的动态信任机制的有效性和提高系统的抗毁性。首先,结合动态信任机制将DSR协议扩展为DTM-DSR协议。该协议根据节点对其邻居的信任度做出路由决策,选择信任度高的邻居作为下一跳节点；然后,通过节点之间的信任度来建立一条可信路径,以阻止恶意节点参与数据转发。最后,通过模拟对所提出的协议进行性能分析,结果表明,与DSR协议和Bayesian-DSR协议相比,DTM-DSR路由协议能有效地提高网络性能。
网络抗毁性及其评估的研究是该领域的一项基础研究。本论文的工作是针对移动自组网抗毁性及其评估中亟待解决的一些关键问题提出了解决方案,这对于推进网络抗毁性的理论研究具有一定的理论价值；同时,对于指导网络设计和提高网络抗毁性具有一定的实用价值。
Survivability refers to the ability of a network system to fulfill critical services in a timely manner to end users in the presence of faults and/or attacks. It is not only a fundamental property of network, but also an important metric to evaluate the survivability on politics, military, and economics in a country. Nowadays survivability is an important research direction on network and information security.
Even though researches on mobile ad hoc networks (MANETs) go deeper and their applications get wider, MANETs are still vulnerable to various faults as well as attacks due to their characteristics, resulting in research on the survivability more challenging. How to conduct a quantitative analysis on the survivability, and how to improve the survivability of the system are key issues on survivability research in MANETs. In order to solve the above problems, evaluation model, survivable mechanism and survivable routing protocol, are proposed with different views, different methods and techniques in this dissertation. Innovations of this dissertation are as follows:
(1) We propose a quantitative evaluation model on survivability for node fault oriented. First, the model takes various types of faults into account for survivability modeling, and then uses the continuous time Markov chain (CTMC) to describe the survivability of MANETs in a precise manner. Second, we introduce the reliability theory to perform quantitative evaluation for survivability on routing protocols in large-scale MANETs, such as segment-by-segment routing (SSR), multipath-based segment-by-segment routing (M-SSR), and cluster-based multipath dynamic source routing (CMDSR). Finally, the analytic results show the effectiveness of our approach through experiments.
(2) We present a quantitative evaluation model on survivability for node misbehavior oriented. The purpose of this method is to achieve the quantitative analysis on survivability in 3D MANETs, in the presence of attacks of nodes, through modeling on node misbehaviors and analysis of 3D network connectivity. First, we model the node misbehaviors by using semi-Markov process, and derive the node minimum degree of 3D MANETs. Second, we develop an effective approach to analyze k-connectivity of 3D MANETs, based on the model of isolated node problem. Third, we achieve a mathematical description of network survivability for the k-connected maintenance, through analyzing their connectivity in 3D MANETs caused by node misbehaviors. Finally, the analytic results show the effectiveness and correctness of our approach through experiments.
(3) According to the quantitative evaluation on survivability, we propose a dynamic trust mechanism (DTM) based on multi-constraints and collaborative filtering in MANETs in order to improve the system survivability and to ensure secure communication among nodes. The main idea of DTM is to introduce a trust updating algorithm with multi-constraints (time aging factor ensures that the trust fades with time; rewards factor ensures that good peers deserve to be rewarded; and penalty factor ensures that the malicious deserve to be punished) to assess the direct trust among nodes. And the false recommendation is prevented by adopting collaborative filtering technique to evaluate recommendation trust. The analytic results show that DTM can compute trust between nodes more precisely than Bayesian model through performance analysis.
(4) We present a trusted routing protocol based on DTM, and the object is to further validate the effectiveness of the DTM and to improve the system survivability. First, we develop a DTM-DSR protocol based on DTM by extending DSR, in which a node makes a routing decision based on the trust value of its neighboring nodes. Second, the DTM-DSR can prevent malicious nodes to forward data packets by establishing trusted route through the trust value of nodes along the path. Finally, the effectiveness of our approach is validated through extensive simulations. The simulation results show that DTM-DSR improves network performance more effectively than DSR and Bayesian-DSR protocols.
Our research on network survivability and its evaluation is basic in this area. Some important work has been done in this dissertation which contributes to addressing some key research issues in the area of survivability and its evaluation in MANETs, which produces some theoretical values in promoting the research on network survivability and some practical values in guiding the network design and in improving network survivability.
随着人们对移动自组网的研究不断深入,其应用领域也随之不断扩大。然而,由于移动自组网本身的特点,容易出现故障或遭受攻击,导致对其抗毁性的研究极具挑战性。如何对抗毁性进行定量分析,以及如何提高系统的抗毁性都是移动自组网抗毁性研究的关键问题。为了研究这些问题,本论文提出了抗毁性评估模型、抗毁机制、以及具有抗毁能力的路由协议。从不同的角度,采用多种方法和技术,探索解决上述问题的思路和方法。主要的创新性工作如下：
(1)提出了一种面向节点故障的抗毁性定量评估模型。首先,针对影响移动自组网抗毁性的各种故障进行抗毁性建模,利用连续时间马尔可夫链来精确地刻画移动自组网的抗毁性；其次,在对移动自组网抗毁性建模的基础上,以分段式路由、基于簇的多路径动态源路由和基于多路径的分段式路由三种协议为例,引入可靠性理论对大规模移动自组网的抗毁性进行分析和量化评估。通过实验对抗毁性进行定量分析,结果表明了该方法的有效性。
(2)提出了面向节点异常行为的抗毁性定量评估模型。通过对节点行为进行建模和对三维网络连通性进行分析,实现在节点遭受攻击时对三维移动自组网抗毁性进行定量评估。首先,采用了半马尔可夫过程来对节点异常行为进行建模,对三维移动自组网的节点最小度进行了推导；然后,在对孤立节点问题进行建模的基础上,给出了一种用来分析网络k-连通性的有效方法；通过对节点异常行为给三维网络连通性所造成的影响进行分析,得到了一种网络保持k-连通时的抗毁性数学描述。最后,通过实验对抗毁性进行定量分析,表明了该方法的有效性和合理性。
(3)为保证节点间的安全通信,以提高网络的抗毁性,在抗毁性定量评估的基础上,提出了移动自组网中基于多约束和协同过滤的动态信任机制。该机制的主要思想是：首先,采用一个带多约束的信任更新算法来评估节点间的直接信任。其中时间衰减因子保证了信任度随时间进行衰减；奖励因子保证了善意节点应受到奖励；惩罚因子保证了恶意节点应受到惩罚。然后,通过采用协同过滤技术评估推荐信任,以此来阻止不诚实的推荐。性能分析结果表明,该方法比Bayesian模型更能精确地计算节点之间的信任度。
(4)提出了基于动态信任机制的可信路由协议,其目的是进一步验证所提出的动态信任机制的有效性和提高系统的抗毁性。首先,结合动态信任机制将DSR协议扩展为DTM-DSR协议。该协议根据节点对其邻居的信任度做出路由决策,选择信任度高的邻居作为下一跳节点；然后,通过节点之间的信任度来建立一条可信路径,以阻止恶意节点参与数据转发。最后,通过模拟对所提出的协议进行性能分析,结果表明,与DSR协议和Bayesian-DSR协议相比,DTM-DSR路由协议能有效地提高网络性能。
网络抗毁性及其评估的研究是该领域的一项基础研究。本论文的工作是针对移动自组网抗毁性及其评估中亟待解决的一些关键问题提出了解决方案,这对于推进网络抗毁性的理论研究具有一定的理论价值；同时,对于指导网络设计和提高网络抗毁性具有一定的实用价值。
Survivability refers to the ability of a network system to fulfill critical services in a timely manner to end users in the presence of faults and/or attacks. It is not only a fundamental property of network, but also an important metric to evaluate the survivability on politics, military, and economics in a country. Nowadays survivability is an important research direction on network and information security.
Even though researches on mobile ad hoc networks (MANETs) go deeper and their applications get wider, MANETs are still vulnerable to various faults as well as attacks due to their characteristics, resulting in research on the survivability more challenging. How to conduct a quantitative analysis on the survivability, and how to improve the survivability of the system are key issues on survivability research in MANETs. In order to solve the above problems, evaluation model, survivable mechanism and survivable routing protocol, are proposed with different views, different methods and techniques in this dissertation. Innovations of this dissertation are as follows:
(1) We propose a quantitative evaluation model on survivability for node fault oriented. First, the model takes various types of faults into account for survivability modeling, and then uses the continuous time Markov chain (CTMC) to describe the survivability of MANETs in a precise manner. Second, we introduce the reliability theory to perform quantitative evaluation for survivability on routing protocols in large-scale MANETs, such as segment-by-segment routing (SSR), multipath-based segment-by-segment routing (M-SSR), and cluster-based multipath dynamic source routing (CMDSR). Finally, the analytic results show the effectiveness of our approach through experiments.
(2) We present a quantitative evaluation model on survivability for node misbehavior oriented. The purpose of this method is to achieve the quantitative analysis on survivability in 3D MANETs, in the presence of attacks of nodes, through modeling on node misbehaviors and analysis of 3D network connectivity. First, we model the node misbehaviors by using semi-Markov process, and derive the node minimum degree of 3D MANETs. Second, we develop an effective approach to analyze k-connectivity of 3D MANETs, based on the model of isolated node problem. Third, we achieve a mathematical description of network survivability for the k-connected maintenance, through analyzing their connectivity in 3D MANETs caused by node misbehaviors. Finally, the analytic results show the effectiveness and correctness of our approach through experiments.
(3) According to the quantitative evaluation on survivability, we propose a dynamic trust mechanism (DTM) based on multi-constraints and collaborative filtering in MANETs in order to improve the system survivability and to ensure secure communication among nodes. The main idea of DTM is to introduce a trust updating algorithm with multi-constraints (time aging factor ensures that the trust fades with time; rewards factor ensures that good peers deserve to be rewarded; and penalty factor ensures that the malicious deserve to be punished) to assess the direct trust among nodes. And the false recommendation is prevented by adopting collaborative filtering technique to evaluate recommendation trust. The analytic results show that DTM can compute trust between nodes more precisely than Bayesian model through performance analysis.
(4) We present a trusted routing protocol based on DTM, and the object is to further validate the effectiveness of the DTM and to improve the system survivability. First, we develop a DTM-DSR protocol based on DTM by extending DSR, in which a node makes a routing decision based on the trust value of its neighboring nodes. Second, the DTM-DSR can prevent malicious nodes to forward data packets by establishing trusted route through the trust value of nodes along the path. Finally, the effectiveness of our approach is validated through extensive simulations. The simulation results show that DTM-DSR improves network performance more effectively than DSR and Bayesian-DSR protocols.
Our research on network survivability and its evaluation is basic in this area. Some important work has been done in this dissertation which contributes to addressing some key research issues in the area of survivability and its evaluation in MANETs, which produces some theoretical values in promoting the research on network survivability and some practical values in guiding the network design and in improving network survivability.
引文
[1]Macker J P and Corson M S. Mobile ad hoc networking and the IETF. Mobile Computing and Communication,1999,17(8):1426-1438.
[2]Corson S and Macker J. Mobile ad hoc networking (MANET):routing protocol performance issues and evaluation considerations. RFC 2501 Internet Engineering Task Force (IETF),1999.
[3]Jubin J and Tornow J D. The DARPA packet radio network protocols. Proceedings of the IEEE,1987,75(1):21-32.
[4]郑少仁,王海涛,赵志峰,等.Ad Hoc网络技术.北京：人民邮电出版社,2004.
[5]Wang Y, Attebury G, and Ramamurthy B. A survey of security issues in wireless sensor networks. IEEE Communications Surveys & Tutorials,2006,8(2):2-23.
[6]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291.
[7]Liu T and Liao W. Location-dependent throughput and delay in wireless mesh networks. IEEE Transactions on Vehicular Technology.2008,57(2):1188-1198.
[8]Perkins C E and Bhagwat P. Highly dynamic destination-sequence distance vector routing (DSDV) for mobile computers. Proceedings of the ACM Conference on Communications Architectures (SIGCOMM 1994), New York, USA,1994,24(4):234-244.
[9]Murthy S and Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks. ACM Mobile Networks and Applications Journal (MONET), Special Issue on Routing in Mobile Communication Networks, October 1996,1(2): 183-197.
[10]Johnson B and Maltz D A. Dynamic source routing in ad hoc wireless networks. Mobile Computing, edited by Tomasz I and Hank K, Chapter 5, Kluwer Academic Publishers,1996, pp.153-181.
[11]Perkins C E, Royer E M, and Das S. Ad hoc on-demand distance vector (AODV) routing. RFC 3561 Internet Draft, July 2003.
[12]Toh C K. Associability based routing for ad hoc mobile networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking & Computing Systems,1997,4(2):103-139.
[13]Park V D and Corson M S. Temporally-ordered routing algorithm (TORA) version 1:Functional specification. IETF Draft,1997.
[14]Hass Z J and Pearlman M R. The performance of query control schemes for the zone routing protocol. IEEE/ACM Transactions on Networking,2001,9(4): 427-438.
[15]Karp B and Kung H T. GPSR:Greedy perimeter stateless routing for wireless networks. Proceedings of 6th ACM international Conference of Mobile Computing and Communication (MobiCom 2000), August,2000, pp.243-254.
[16]Ko Y B and Vaidya N H. Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, Kluwer Academic Publishers Hingham, MA, USA,2000,6(4):307-321.
[17]Baker D J and Ephremides A. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, 1981,29(11):1694-1701.
[18]Gerla M and Tsai J T C. Multicluster, mobile, multimedia radio network. ACM Wireless Networks,1995,1(3):255-265.
[19]Chatterjee M, Das S K and Turgut D. An on-demand weighted clustering algorithm (WCA) for ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2000), November 2000, pp. 1697-1701.
[20]Kadri B, Mhamed A and Feham M. Secured clustering algorithm for mobile ad hoc networks. International Journal of Computer Science and Network Security, 2007,7(3):27-34.
[21]Wang L, Zhang L, Shu Y, et al. Multipath source routing in wireless ad hoc networks. Proceedings of 2000 Canadian Conference on Electrical and Computer Engineering, March 2000, pp.479-483.
[22]Kuo C T and Liang C K. A meshed multipath routing protocol in mobile ad hoc networks. Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), December 2006, pp.306-310.
[23]Lee S J and Gerla M. Split multipath routing with maximally disjoint paths in ad hoc networks. Proceedings of the IEEE International Conference on Communications (ICC 2001), June 2001, pp.3201-3205.
[24]安辉耀,卢锡城,彭伟,等.MANET中基于簇的多路径动态源路由(CMDSR).计算机研究与发展,2006,43(3)：381-388.
[25]Lu Y, Jia W, Wang G, et al. Multipath-based segment-by-segment routing protocol in MANETs. Proceedings of the 9th International Conference for Young Computer Scientists (ICYCS 2008), November 2008, pp.527-532.
[26]Gupta S and Srimani P K. Adaptive core selection and migration method for multicast routing in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems,2003,14(1):27-38.
[27]孙宝林,李腊元.Ad hoc网络QoS多播路由协议.计算机学报,2004,27(10)：1402-1407.
[28]Lao L and Cui J. Reducing multicast traffic load for cellular networks using ad hoc networks. IEEE Transactions on Vehicular Technology.2006,55(3): 822-830.
[29]王国军,章礼繁.移动自组网QoS组播路由协议的研究.计算机应用,2006,26(4)：901-904.
[30]王竞,李建东,盛敏.Ad-Hoc网络多址接入协议的研究与实现.电子技术应用,2005,(1)：40-42.
[31]So J and Vaidya N H. Multi-channel MAC for ad hoc networks:handling multi-channel hidden terminals using a single transceiver. Proceedings of the 5th ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2004),2004, pp.222-233.
[32]Bahl P, Chandra R, and Dunagan J. SSCH:Slotted seeded channel hopping for capacity improvement in IEEE 802.11 Ad-Hoc wireless networks. Proceedings of the 5th ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2004),2004, pp.216-230.
[33]Tsengt Y C, Wut S L, and Lint C Y. A multi-channel MAC protocol with power control for multi-hop mobile Ad hoc networks. The Computer Journal,2002, 45(1):101-110.
[34]Zhou L, Haas Z J. Securing ad hoc networks. IEEE Networks Special Issue on Network Security,1999,13(6):24-30.
[35]Lou W, Liu W and Fang Y. SPREAD:enhancing data confidentiality in mobile ad hoc networks, Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, China, March 2004, pp.2404-2413.
[36]Hu Y C, Johnson D B, and Perrig A. SEAD:secure efficient distance vector routing for mobile wireless ad hoc networks. Proceedings 4th IEEE Workshop on Mobile Computing Systems and Applications, June 2002, pp.3-13.
[37]熊焰,苗付友,张伟超,等.移动自组网中基于多跳步加密签名函数签名的分布式认证.电子学报,2003,31(2)：161-165.
[38]Zhang Y and Lee W. Intrusion detection in wireless ad-hoc networks. Proceedings of the 6th annual international conference Mobile computing and networking (MobiCom 2000), August.2000, pp.275-283.
[39]Zhang W, Rao R, Cao G, et al. Secure routing in ad hoc networks and a related intrusion detection problem. IEEE Military Communications Conference (MILCOM 2003), October 2003, pp.735-740.
[40]Mishra A, Nadkarni K, and Patcha A. Intrusion detection in wireless ad hoc networks. IEEE on Wireless Communications,2004,11(1):48-60.
[41]Liu J, Yu F R, Lung C H, et al. Optimal combined intrusion detection and biometric-based continuous authentication in high security mobile ad hoc networks. IEEE Transactions on Wireless Communications,2009,8(2): 806-815.
[42]Pietro Michiardi and Refik Molva. CORE:A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. Proceedings of the Sixth IFIP Conference on Security Communications and Multimedia (CMS 2002), September 2002, pp.107-121.
[43]王建新,张亚男,王伟平,等.移动自组网中基于声誉机制的安全路由协议设计与分析.电子学报,2005,33(4)：596-601.
[44]Pirzada A A, Datta A, and McDonald C. Incorporating trust and reputation in the DSR protocol for dependable routing. Elsevier of Computer Communications, 2006,29:2806-2821.
[45]Marti S, Giuli T J, Lai K, et al. Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom 2000), August 6-11,2000, pp.255-265.
[46]Bansal S and Baker M. Observation-based cooperation enforcement in ad hoc networks. Research Report cs.NI/0307012, Stanford University,2003.
[47]Buchegger S and Le Boudec J Y. Performance analysis of the CONFIDANT protocol:cooperation of nodes-fairness in dynamic ad-hoc networks. Proceedings of the 3rd ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2002), June 2002, pp.226-236.
[48]郭伟.MANET路由信任评估算法研究：[博士学位论文].武汉：华中科技大学,2006.
[49]Anantvalee T and Wu J. Reputation-based system for encouraging the cooperation of nodes in mobile ad hoc networks. Proceedings of IEEE International Conference on the Communications (ICC 2007), June 2007, pp. 3383-3388.
[50]Yu M, Zhou M, and Su W. A secure routing protocol against byzantine attacks for MANETs in adversarial environments. IEEE Transactions on Vehicular Technology,2009,58(1):449-460.
[51]Michiardi P and Molva R. Core:A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. Communication and Multimedia Security Conference, September 2002.
[52]Li X, Lyu M R, and Liu J. A trust model based routing protocol for secure ad hoc networks. Proceedings of the IEEE Aerospace Conference, March 2004, pp.1286-1295.
[53]Martin Leo Manickam J and Shanmugavel S. Fuzzy based trusted ad hoc on-demand distance vector routing protocol for MANET. Advanced Computing and Communications, December 2007, pp.414-421.
[54]Ramanathan R and Rosales RHain R. Topology control of multihop wireless networks using transmit power adjustment. Proceedings IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), March 2000, pp.404-413.
[55]Kim D, Garcia-Luna-Aceves J J, and Obraczka K. Routing mechanisms for mobile ad hoc networks based on the energy drain rate, IEEE Transactions on Mobile Computing,2003,2(2):161-173.
[56]Cheng M X, Cardei M, Sun J, et al. Topology control of ad hoc wireless networks for energy efficiency. IEEE Transactions on Computers,2004,53(12): 1629-1635.
[57]Tseng C C and Chen K C. Power efficient topology control in wireless ad hoc networks. IEEE Wireless Communications and Networking Conference (WCNC 2004), March 2004, pp.610-615.
[58]Li D, Jia X, and Liu H. Energy efficient broadcast routing in static ad hoc wireless networks. IEEE Transactions on Mobile Computing,2004,3(2): 144-151.
[59]Yin S and Lin X. Multipath minimum energy routing in ad hoc network. Proceedings of the IEEE International Conference on Communications (ICC 2005), May 2005, pp.3182-3186.
[60]Tian Y, Sheng M, Li J, et al. Energy-aware dynamic topology control algorithm for wireless ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2008), November 2008, pp. 1-5.
[61]Leung R, Liu J, Poon E, et al. MP-DSR:a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks. Proceedings of the 26th Annual IEEE Conference on Local Computer Networks, LCN 2001, November 2001, pp.132-141.
[62]Calafate C T, Manzoni P, and Malumbres M P. A novel QoS framework for medium-sized MANETs supporting multipath routing protocols. Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), June 2006, pp.213-219.
[63]Chen S and Nahrstedt K. Distributed quality-of-service routing in ad hoc networks. IEEE Journal on Selected Areas in Communications,1999,17(8): 1488-1505.
[64]英春,史美林.自组网环境下基于QoS的路由协议.计算机学报,2001,24(10)：1026-1033.
[65]Toh C K. Maximum battery life routing to support ubiquitous mobile computing in wireless Ad hoc networks. IEEE Communication Magazine.2001,39(6): 138-147.
[66]邓曙光,王建新,陈建二.移动自组网中一种基于最稳路径的QoS路由.计算机工程,2002,28(9)：45-47.
[67]刘亭,张杭.网络抗毁性综述.军事通信技术,2003,24(4)：19-23.
[68]赖积保,王慧强,王健.系统可生存性研究综述.计算机科学,2007,134(13)：237-239.
[69]杨凡,蒋建春,陈松乔.网络生存性研究概述.计算机应用研究,2001,18(6)：12-14.
[70]Lima M N, Santos A, and Pujolle G. A survey of survivability in mobile ad hoc networks. IEEE Communications Surveys & Tutorials.2009,11(1):66-77.
[71]Frank H and Frisch I T. Analysis and design of survivable networks. IEEE Transaction on Communication Technology,1970,18(5):501-519.
[72]Hollway B A and Neumman P G. Survivable computer communication systems: the problem and working group recommendations. Washington:US Army Research Laboratory,1993.
[73]Knight J, Sullivan K. On the definition of survivability. Department of Computer Science, University of Virginia:Technical Report CS200233,2000.
[74]Knight J, Heimbigner D, Wolf A, et al. The willow architecture:comprehensive survivability for large-scale distributed applications. Proceedings of the International Conference on Dependable Systems and Networks,2002.
[75]Ellison R J, Linger R C, Longstaff T, and Mead N R. Survivable network system analysis:a case study. IEEE Software,1999.16(4):70-77.
[76]Mead N R, Ellison R J, Linger R C, et al. Survivable network analysis method. in Technical Report CMU/SEI-2000-TR-013. Carnegie Mellon University, 2000.
[77]Krings A W and Azadmanesh M H. A graph based model for survivability analysis. in Technical Report UI-CS-TR-02-024, Computer Science Department, University of Idaho,2002.
[78]Keshtgary M, Al-Zahrani F, Jayasumana A P, et al. Network survivability performance evaluation with applications in WDM networks with wavelength conversion. Proceedings of the 29th IEEE Conference on Local Computer Networks (LCN 2004),2004, pp.344-351.
[79]黄遵国.面向生存能力的应急响应与事故恢复技术研究：[博士学位论文].长沙：国防科学技术大学,2003.
[80]王东霞,窦文华,周兴铭.保证关键服务生存性的ATM网络资源管理.计算机研究与发展,2000,37(1)：50-54.
[81]林雪纲,许榕生.信息系统生存性分析模型研究.通信学报,2006,27(2)：153-159.
[82]关于国家重点基础研究发展计划973计划[EB/OL].http://www.973.gov.cn /mana/contfile/web/234/20051271353429a.doc,2005.
[83]王烨,李乐民,王晟.网状WDM网络的抗毁设计.通信学报,2001,22(11)：22-29.
[84]曹俊忠,鲍振武,张程.波分复用无源光接入网生存性机制的分析与设计.光通信技术,2003,27(5)：.20-22
[85]智能光网络的核心机理和关键技术研究[EB/OL]. http://www.nsfc.gov.cn /nsfc/20znzt/chengguo_114.htm,2005.
[86]Cao J, Zhang L, Wang G, et al. SSR:Segment-by-segment routing in large-scale MANETs. Proceedings of the Third IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2006), October 2006, pp.216-225.
[87]Ge Y, Wang G, Zhang Q, et al. Multipath routing with reliable nodes in large-scale mobile ad-hoc networks. IEICE Transactions on Information and Systems, September 2009, Vol. E92-D, No.9, pp.1675-1682.
[88]Wang G, Zhang L, and Cao J. Hole-shadowing routing in large-scale MANETs. International Journal of Sensor Networks (Inderscience Publishers),2008,4(4): 220-229.
[89]Li P, Wang G, Wu J, et al. Hole reshaping routing in large-scale mobile ad-hoc networks. Proceedings of the IEEE Global Communications Conference (GLOBECOM 2009), Hawaii, USA, November/December 2009.
[90]王树鹏,云晓春,余翔湛.基于生存性和Makespan的多目标网格任务调度算法研究.2006,27(2)：42-49.
[91]徐琳,刘志勇,等.国家自然科学基金委员会信息科学部计算机科学处2005年度基金申请与资助概况.软件学报,2005,16(11)：2021-2028.
[92]中国人民大学,科研园地获资助科研项目简介[EB/OL]. http://info.ruc.edu.cn /research/research08/zizujianjie.asp.
[93]Wang H, Liu D, Xu D, et al. A holistic approach to survivable distributed information system for critical applications. Proceedings of ISPA 2005, Nanjing, China, Published in Springer's Lecture Notes in Computer Science, LNCS 3758. 2005, pp.713-724.
[94]Louca S, Pitsillides A, and Samaras G. On network survivability algorithms based on trellis graph transformations. Proceeding of the Fourth IEEE Symposium on Computers and Communications (ISCC 1999).1999, pp. 235-243.
[95]Westmark V R. A definition for information system survivability. Proceedings of the 37th Annual Hawaii International Conference on System Sciences,2004.
[96]杨超,马建峰.可生存网络系统的形式化定义.网络安全技术与应用2004,7：39-41.
[97]谭跃进,吕欣,吴俊,等.复杂网络抗毁性研究若干问题的思考.系统工程理论与实践(增刊),2008,116-120.
[98]Frank H. Survivability analysis of command and control communications networks-part I, II. IEEE Transactions on Communications,1974,22(5): 589-605.
[99]郭伟,洪福明.干线战术通信网的抗毁模型研究.电子科技大学学报,1990,19(2)：152-158.
[100]Liew S C and Lu K W. A framework for network survivability characterization. Proceedings of the IEEE International Conference on Communications (ICC 1992),1992, pp.405-410.
[101]Zolfaghario A and Kaudel F J. Framework for network survivability performance. IEEE Journal on Selected Areas in Communications,1994,12(1): 46-51.
[102]Jha S and Wing M. Survivability analysis of networked systems. Proceedings of IEEE International Conference on Software Engineering (ICSE 2001), Toronto: IEEE Press,2001, pp.307-317.
[103]Krings A W and Azadmanesh A A. Graph based model for survivability applications. European Journal of Operational Research,2005,164(3):680-689.
[104]McDermott J. Attack-potential-based survivability modeling for high-consequence systems. Proceedings of Third IEEE International Workshop on Information Assurance (IWIA 2005),2005, pp.119-130.
[105]郭渊博,马建峰.分布式系统中服务可生存性的定量分析.同济大学学报：自然科学版,2002,30(10)：1190-1193.
[106]黄遵国,卢锡城,胡华平.生存能力技术及其实现案例研究.通信学报,2004,25(7)：137-145.
[107]包秀国,胡铭曾,张宏莉.两种网络安全管理系统的生存性定量分析方法.通信学报,2004,25(9)：34-41.
[108]Li X and Yang D. A quantitative survivability evaluation model for wireless sensor networks. Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control (ICNSC 2006),2006, pp.727-732.
[109]Chen D, Garg S and Trivedi K. Network survivability performance evaluation:a quantitative approach with applications in wireless ad-hoc networks. Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, New York, USA:ACM Press,2002, pp.61-68.
[110]Koroma J and Li W. A generalized model for network survivability. Proceedings of the 2003 Conference on Diversity in Computing (TAPIA 2003),2003, pp. 47-51.
[111]Kim D S, Shazzad K M, and Park J S. A framework of survivability model for wireless sensor network. Proceedings of the First International Conference on Availability, Reliability and Security (ARES 2006).2006, pp.515-522.
[112]Kim D S and Park J S. A survivable distributed sensor networks through stochastic models. Springer Verlag,2006, pp.185-194.
[113]Xing F and Wang W. On the survivability of wireless ad hoc networks with node misbehaviors and failures. IEEE Transactions on Dependable and Secure Computing.2008,1-15.
[114]谢波,肖晓强,徐明,等.一种基于马尔可夫链的车辆自组网可生存性模型.计算机应用,2008,28(10)：2577-2579.
[115]国家自然基金委员会信息科学部2006年拟资助26个重点项目[EB/OL].http://www.nsfc.gov.cn/nsfc/cen/xmzn/2006xmzn/02zd/06xx.htm,2006.
[116]关于“十一五”国家高技术研究发展计划(863计划)信息技术领域2006年度专题课题评审结果的公告[EB/OL]. http://www.most.gov.cn/tztg/200611/ t20061124_38273.htm,2006.
[117]国家高技术研究发展计划(863计划)信息技术领域新一代高可信网络重大项目2009年度课题申请指南863网站[EB/OL]. http://www.most.gov.cn/tztg /200907/t20090705_71630.htm,2009.
[118]Lu Q. Vulnerability of wireless routing protocols. Technical report, December 15,2002.
[119]龚光鲁,钱敏平.应用随机过程教程及在算法和智能计算中的随机模型.北京：清华大学出版社,2004,1-25.
[120]邓永录.应用概率及其理论基础.北京：清华大学出版社,2005,27-43,168-253.
[121]李裕奇.随机过程.北京：国防工业出版社,2003,1-7,214-218.
[122]侯振挺,刘再明,刘国欣,等.马尔可夫骨架过程—混杂系统模型.长沙：湖南科学技术出版社,2000,215-245.
[123]曹晋华,程侃.可靠性数学引论(修订版).北京：高等教育出版社,2006,250-258.
[124]黄晓璐.网络流量的半马尔柯夫模型：[博士学位论文].北京：中国科学院研究生院,2006.
[125]孙惠泉.图论及其应用.北京：科学出版社,2004,1-14.
[126]Erdos P and Renyi A. On random graphs. Publications Mathematicae,1959,6: 290-297.
[127]Erdos P and Renyi A. On the evolution of random graphs. Publications Math. Inst. Hungar. Acad.1960, (5):17-61.
[128]Chlamtac I and Farago A. A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks,1999,5(3):149-156.
[129]Krishnamachari B, Wicker S B, and Bejar R. Phase transition phenomena in wireless ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2001), November 2001, pp.2921-2925.
[130]Farago A. Scalable analysis and design of ad hoc networks via random graph theory. Proceedings of the ACM 6th international workshop on discrete algorithms and methods for mobile computing and communications, September, 2002, pp.43-50.
[131]赵蕴龙,左德承,时锐,等.移动自组网应用建模及无线收发器选用策略.电子学报,2005,33(7)：1153-1157.
[132]Bollobas B. Modern graph theory. Springer,1998.
[133]Penrose M D. On k-connectivity for a geometric random graph. Random Structure Algorithms,1999,15(2):145-164.
[134]王健,王慧强,赵国生.信息系统可生存性定量评估的指标体系.计算机工程,2009,35(3)：54-56.
[135]Laprie J C and Randell B. Basic concepts and taxonomy of dependable and secure computing. IEEE transaction dependable security computer,2004,1(1): 11-33.
[136]林闯,汪洋,李泉林.网络安全的随机模型方法与评价技术.计算机学报,2005,28(12)：1943-1956.
[137]邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法.软件学报.2003,14(9)：1621-1628.
[138]Sarwar B, Karypis G, Konstan J, et al. Item-based collaborative filtering recommendation algorithms. Proceedings of the 10th International World Wide Web Conference, May,2001, pp.285-295.
[139]Chen A and McLeod D. Collaborative filtering for information recommendation systems. Encyclopedia of Data Warehousing and Mining, Idea Group,2005.
[140]Herlocker J L, Konstan J A, Terveen L G, et al. Evaluating collaborative filtering recommender systems. ACM Trans. Information Systems,2004,22(1):5-53.
[141]曹晋华,程侃.可靠性数学引论(修订版).北京：高等教育出版社,2006,1-45.
[142]刘普寅,张维明.通信网络可靠性研究中的数学问题.通信学报,2000,21(10)：50-57.
[143]Ke W J and Wang S D. Reliability evaluation for distributed computing network with imperfect nodes. IEEE Transactions on Reliability,1997,46(3):342-349.
[144]Heidemann J, Ye W, Wills J, et al. Research challenges and applications for underwater sensor networking. IEEE Wireless Communications and Networking Conference (WCNC 2006), April,2006,1:228-235.
[145]Kong J, Cui J, Wu D, and Gerla M. Building underwater ad-hoc networks and sensor networks for large scale real-time aquatic applications. IEEE Military Communications Conference (MILCOM 2005), October,2005, pp.1535-1541.
[146]Nazrul Alam S M and Zygmunt Haas J. Coverage and connectivity in three-dimensional networks. Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MobiCom 2006), September 2006, pp.346-357.
[147]Liu C and Wu J. Efficient geometric routing in three dimensional ad hoc networks. Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2009), April 2009, pp.2751-2755.
[148]Li M, Liu Y, and Chen L. Non-threshold based event detection for 3D environment monitoring in sensor networks. IEEE Transactions on Knowledge and Data Engineering,2008,20(12):1699-1711.
[149]Paul K, Choudhuri R R, and Bandyopadhyay S. Survivability analysis of ad hoc wireless network architecture. Mobile and Wireless Communication Networks, Lecture Note in Computer Science. Springer Verlag,2000, pp.31-46.
[150]Goyal D and Caffery J J. Partitioning avoidance in mobile ad hoc networks using network survivability concepts. Proceedings of the 7th IEEE International Symposium on Computers and Communications (ISCC 2002), July,2002, pp. 553-558.
[151]Kawahigashi H, Terashima Y, Miyauchi N, et al. Desiging fault tolerant ad hoc networks. Proceedings of IEEE/AFCEA Military Communications Conference (MILCOM 2005), October 2005,3:1360-1367.
[152]Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network. Proceedings of the 3rd ACM International Symposium On Mobile Ad Hoc Networking and Computing (MobiHoc 2002), June,2002, pp. 80-91.
[153]Santi P. The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans on Mobile Computing,2005,4(3):310-317.
[154]盛敏,史琰,田野,等.移动Ad Hoc网络的k连通性研究.电子学报,2008,36(10)：1857-1861.
[155]Hollick M, Schmitt J, Seipl C, et al. On the effect of node misbehavior in ad hoc networks. In Proceedings of the IEEE International Conference on Communications (ICC 2004),2004, pp.3759-3763.
[156]Xing F and Wang W. Modeling and analysis of connectivity in mobile ad hoc networks with misbehaving nodes. In Proceedings of the IEEE International Conference on Communications (ICC 2006), June 2006, pp.1879-1884.
[157]Komathy K and Narayanasamy P. A probabilistic behavioral model for selfish neighbors in a wireless ad hoc network. International Journal of Computer Science and Network Security,2007,7(7):77-83.
[158]Peng S, Jia W, and Wang G. Survivability evaluation in large-scale mobile ad-hoc networks. Journal of Computer Science and Technology,2009,24(4): 761-774.
[159]Hu Y C, Perrig A, and Johnson D B. Ariadne:a secure on demand routing protocol for ad hoc networks. Wireless Networks,2005,11(1-2):21-38.
[160]龚光鲁,钱敏平.应用随机过程教程及在算法和智能计算中的随机模型.北京：清华大学出版社,2004,26-27.
[161]Gan Z, Li Y, Xiao G, et al. A novel reputation computing model for mobile agent-based e-commerce systems. International Conference on Information Security and Assurance (ISA 2008), April 2008, pp.253-260.
[162]Chang J, Wang H, Yin G, et al. A new reputation mechanism against dishonest recommendations in P2P Systems. WISE 2007, Springer-Verlag, pp.449-460.
[163]Kinateder M and Rothermel K. Architecture and algorithms for a distributed reputation system. In Nixon P and Terzis S, editors, Proceedings of the First International Conference on Trust Management, volume 2692 of LNCS, Springer-Verlag, May 200.3, pp.1-16.
[164]Sun Y, Yu W, Han Z, et al. Information theoretic framework of trust modeling and evaluation for ad hoc networks. IEEE Journal on Selected Areas in Communications,2006,24:305-317.
[165]Theodorakopoulos G and Baras J S. On trust models and trust evaluation metrics for ad hoc networks. IEEE Journal on Selected Areas in Communications,2006,24(2):318-328.
[166]Li J, Li R, and Kato J. Future trust management framework for mobile ad hoc networks. IEEE Communications Magazine,2008,46(4):108-114.
[167]Buchegger S and Le Boudec J. A robust reputation system for P2P and mobile ad-hoc networks. P2PEcon,2004.
[168]Luo J, Liu X, Zhang Y, et al. Fuzzy trust recommendation based on collaborative filtering for mobile ad-hoc networks. Proceedings of the 33rd IEEE Conference on Local Computer Networks (LCN 2008), October 2008, pp. 305-311.
[169]J(?)sang A. The right type of trust for distributed systems. Proceedings of the 1996 New Security Paradigms Workshop, ACM,1996, pp.119-131.
[170]J(?)sang A. An algebra for assessing trust in certification chains. Proceedings of the Network and Distributed Systems Security Symposium (NDSS 1999), the Internet Society,1999.
[171]Balakrishnan V, Varadharajan V, and Tupakula U. Trust management in mobile ad hoc networks. in Misra S, Woungang I, and Misra S C. Guide to Wireless Ad Hoc Networks, Springer, ISBN:9781848003286,2009.
[172]Chang E, Thomson P, Dillon T, et al. The fuzzy and dynamic nature of trust. LNCS 3592. Berlin:Springer-Verlag,2005.161-174.
[173]Marsh StePhen. Formalising trust as a computational concept:[PhD Thesis]. Seotland:University of Stirling,1994,22-31.
[174]Heckerman D. A tutorial on learning with bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research Advanced Technology Division, Microsoft Corporation, March 1995 (Revised November 1996).
[175]J(?)sang A and Ismail R. The beta reputation system. Proceedings of the 15th Bled Conference on Electronic Commerce, June,2002, pp.324-337.
[176]王伟,曾国荪.一种基于Bayes信任模型的可信动态级调度算法.中国科学(E辑：信息科学),2007,37(2)：285-296.
[177]Hu Y C, Perrig A, and Johnson D B. Ariadne:a secure on-demand routing protocol for ad hoc networks. Proceedings of the 8th ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2002), September 2002, pp.12-23.
[178]Lin Y X, Rad A H, Wong V W, et al. Experimental comparisons between SAODV and AODV routing protocols. Proceedings of the 1st ACM Workshop on Wireless Multimedia Networking and Performance Modeling, October 2005, pp.113-122.
[179]仿真工具 GloMoSim2.03 [EB/OL]. http://pcl.cs.ucla.edu/projects/glomosim/.
[2]Corson S and Macker J. Mobile ad hoc networking (MANET):routing protocol performance issues and evaluation considerations. RFC 2501 Internet Engineering Task Force (IETF),1999.
[3]Jubin J and Tornow J D. The DARPA packet radio network protocols. Proceedings of the IEEE,1987,75(1):21-32.
[4]郑少仁,王海涛,赵志峰,等.Ad Hoc网络技术.北京：人民邮电出版社,2004.
[5]Wang Y, Attebury G, and Ramamurthy B. A survey of security issues in wireless sensor networks. IEEE Communications Surveys & Tutorials,2006,8(2):2-23.
[6]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291.
[7]Liu T and Liao W. Location-dependent throughput and delay in wireless mesh networks. IEEE Transactions on Vehicular Technology.2008,57(2):1188-1198.
[8]Perkins C E and Bhagwat P. Highly dynamic destination-sequence distance vector routing (DSDV) for mobile computers. Proceedings of the ACM Conference on Communications Architectures (SIGCOMM 1994), New York, USA,1994,24(4):234-244.
[9]Murthy S and Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks. ACM Mobile Networks and Applications Journal (MONET), Special Issue on Routing in Mobile Communication Networks, October 1996,1(2): 183-197.
[10]Johnson B and Maltz D A. Dynamic source routing in ad hoc wireless networks. Mobile Computing, edited by Tomasz I and Hank K, Chapter 5, Kluwer Academic Publishers,1996, pp.153-181.
[11]Perkins C E, Royer E M, and Das S. Ad hoc on-demand distance vector (AODV) routing. RFC 3561 Internet Draft, July 2003.
[12]Toh C K. Associability based routing for ad hoc mobile networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking & Computing Systems,1997,4(2):103-139.
[13]Park V D and Corson M S. Temporally-ordered routing algorithm (TORA) version 1:Functional specification. IETF Draft,1997.
[14]Hass Z J and Pearlman M R. The performance of query control schemes for the zone routing protocol. IEEE/ACM Transactions on Networking,2001,9(4): 427-438.
[15]Karp B and Kung H T. GPSR:Greedy perimeter stateless routing for wireless networks. Proceedings of 6th ACM international Conference of Mobile Computing and Communication (MobiCom 2000), August,2000, pp.243-254.
[16]Ko Y B and Vaidya N H. Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, Kluwer Academic Publishers Hingham, MA, USA,2000,6(4):307-321.
[17]Baker D J and Ephremides A. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, 1981,29(11):1694-1701.
[18]Gerla M and Tsai J T C. Multicluster, mobile, multimedia radio network. ACM Wireless Networks,1995,1(3):255-265.
[19]Chatterjee M, Das S K and Turgut D. An on-demand weighted clustering algorithm (WCA) for ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2000), November 2000, pp. 1697-1701.
[20]Kadri B, Mhamed A and Feham M. Secured clustering algorithm for mobile ad hoc networks. International Journal of Computer Science and Network Security, 2007,7(3):27-34.
[21]Wang L, Zhang L, Shu Y, et al. Multipath source routing in wireless ad hoc networks. Proceedings of 2000 Canadian Conference on Electrical and Computer Engineering, March 2000, pp.479-483.
[22]Kuo C T and Liang C K. A meshed multipath routing protocol in mobile ad hoc networks. Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), December 2006, pp.306-310.
[23]Lee S J and Gerla M. Split multipath routing with maximally disjoint paths in ad hoc networks. Proceedings of the IEEE International Conference on Communications (ICC 2001), June 2001, pp.3201-3205.
[24]安辉耀,卢锡城,彭伟,等.MANET中基于簇的多路径动态源路由(CMDSR).计算机研究与发展,2006,43(3)：381-388.
[25]Lu Y, Jia W, Wang G, et al. Multipath-based segment-by-segment routing protocol in MANETs. Proceedings of the 9th International Conference for Young Computer Scientists (ICYCS 2008), November 2008, pp.527-532.
[26]Gupta S and Srimani P K. Adaptive core selection and migration method for multicast routing in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems,2003,14(1):27-38.
[27]孙宝林,李腊元.Ad hoc网络QoS多播路由协议.计算机学报,2004,27(10)：1402-1407.
[28]Lao L and Cui J. Reducing multicast traffic load for cellular networks using ad hoc networks. IEEE Transactions on Vehicular Technology.2006,55(3): 822-830.
[29]王国军,章礼繁.移动自组网QoS组播路由协议的研究.计算机应用,2006,26(4)：901-904.
[30]王竞,李建东,盛敏.Ad-Hoc网络多址接入协议的研究与实现.电子技术应用,2005,(1)：40-42.
[31]So J and Vaidya N H. Multi-channel MAC for ad hoc networks:handling multi-channel hidden terminals using a single transceiver. Proceedings of the 5th ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2004),2004, pp.222-233.
[32]Bahl P, Chandra R, and Dunagan J. SSCH:Slotted seeded channel hopping for capacity improvement in IEEE 802.11 Ad-Hoc wireless networks. Proceedings of the 5th ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2004),2004, pp.216-230.
[33]Tsengt Y C, Wut S L, and Lint C Y. A multi-channel MAC protocol with power control for multi-hop mobile Ad hoc networks. The Computer Journal,2002, 45(1):101-110.
[34]Zhou L, Haas Z J. Securing ad hoc networks. IEEE Networks Special Issue on Network Security,1999,13(6):24-30.
[35]Lou W, Liu W and Fang Y. SPREAD:enhancing data confidentiality in mobile ad hoc networks, Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, China, March 2004, pp.2404-2413.
[36]Hu Y C, Johnson D B, and Perrig A. SEAD:secure efficient distance vector routing for mobile wireless ad hoc networks. Proceedings 4th IEEE Workshop on Mobile Computing Systems and Applications, June 2002, pp.3-13.
[37]熊焰,苗付友,张伟超,等.移动自组网中基于多跳步加密签名函数签名的分布式认证.电子学报,2003,31(2)：161-165.
[38]Zhang Y and Lee W. Intrusion detection in wireless ad-hoc networks. Proceedings of the 6th annual international conference Mobile computing and networking (MobiCom 2000), August.2000, pp.275-283.
[39]Zhang W, Rao R, Cao G, et al. Secure routing in ad hoc networks and a related intrusion detection problem. IEEE Military Communications Conference (MILCOM 2003), October 2003, pp.735-740.
[40]Mishra A, Nadkarni K, and Patcha A. Intrusion detection in wireless ad hoc networks. IEEE on Wireless Communications,2004,11(1):48-60.
[41]Liu J, Yu F R, Lung C H, et al. Optimal combined intrusion detection and biometric-based continuous authentication in high security mobile ad hoc networks. IEEE Transactions on Wireless Communications,2009,8(2): 806-815.
[42]Pietro Michiardi and Refik Molva. CORE:A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. Proceedings of the Sixth IFIP Conference on Security Communications and Multimedia (CMS 2002), September 2002, pp.107-121.
[43]王建新,张亚男,王伟平,等.移动自组网中基于声誉机制的安全路由协议设计与分析.电子学报,2005,33(4)：596-601.
[44]Pirzada A A, Datta A, and McDonald C. Incorporating trust and reputation in the DSR protocol for dependable routing. Elsevier of Computer Communications, 2006,29:2806-2821.
[45]Marti S, Giuli T J, Lai K, et al. Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom 2000), August 6-11,2000, pp.255-265.
[46]Bansal S and Baker M. Observation-based cooperation enforcement in ad hoc networks. Research Report cs.NI/0307012, Stanford University,2003.
[47]Buchegger S and Le Boudec J Y. Performance analysis of the CONFIDANT protocol:cooperation of nodes-fairness in dynamic ad-hoc networks. Proceedings of the 3rd ACM international symposium on mobile Ad hoc networking and computing (MobiHoc 2002), June 2002, pp.226-236.
[48]郭伟.MANET路由信任评估算法研究：[博士学位论文].武汉：华中科技大学,2006.
[49]Anantvalee T and Wu J. Reputation-based system for encouraging the cooperation of nodes in mobile ad hoc networks. Proceedings of IEEE International Conference on the Communications (ICC 2007), June 2007, pp. 3383-3388.
[50]Yu M, Zhou M, and Su W. A secure routing protocol against byzantine attacks for MANETs in adversarial environments. IEEE Transactions on Vehicular Technology,2009,58(1):449-460.
[51]Michiardi P and Molva R. Core:A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. Communication and Multimedia Security Conference, September 2002.
[52]Li X, Lyu M R, and Liu J. A trust model based routing protocol for secure ad hoc networks. Proceedings of the IEEE Aerospace Conference, March 2004, pp.1286-1295.
[53]Martin Leo Manickam J and Shanmugavel S. Fuzzy based trusted ad hoc on-demand distance vector routing protocol for MANET. Advanced Computing and Communications, December 2007, pp.414-421.
[54]Ramanathan R and Rosales RHain R. Topology control of multihop wireless networks using transmit power adjustment. Proceedings IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), March 2000, pp.404-413.
[55]Kim D, Garcia-Luna-Aceves J J, and Obraczka K. Routing mechanisms for mobile ad hoc networks based on the energy drain rate, IEEE Transactions on Mobile Computing,2003,2(2):161-173.
[56]Cheng M X, Cardei M, Sun J, et al. Topology control of ad hoc wireless networks for energy efficiency. IEEE Transactions on Computers,2004,53(12): 1629-1635.
[57]Tseng C C and Chen K C. Power efficient topology control in wireless ad hoc networks. IEEE Wireless Communications and Networking Conference (WCNC 2004), March 2004, pp.610-615.
[58]Li D, Jia X, and Liu H. Energy efficient broadcast routing in static ad hoc wireless networks. IEEE Transactions on Mobile Computing,2004,3(2): 144-151.
[59]Yin S and Lin X. Multipath minimum energy routing in ad hoc network. Proceedings of the IEEE International Conference on Communications (ICC 2005), May 2005, pp.3182-3186.
[60]Tian Y, Sheng M, Li J, et al. Energy-aware dynamic topology control algorithm for wireless ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2008), November 2008, pp. 1-5.
[61]Leung R, Liu J, Poon E, et al. MP-DSR:a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks. Proceedings of the 26th Annual IEEE Conference on Local Computer Networks, LCN 2001, November 2001, pp.132-141.
[62]Calafate C T, Manzoni P, and Malumbres M P. A novel QoS framework for medium-sized MANETs supporting multipath routing protocols. Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), June 2006, pp.213-219.
[63]Chen S and Nahrstedt K. Distributed quality-of-service routing in ad hoc networks. IEEE Journal on Selected Areas in Communications,1999,17(8): 1488-1505.
[64]英春,史美林.自组网环境下基于QoS的路由协议.计算机学报,2001,24(10)：1026-1033.
[65]Toh C K. Maximum battery life routing to support ubiquitous mobile computing in wireless Ad hoc networks. IEEE Communication Magazine.2001,39(6): 138-147.
[66]邓曙光,王建新,陈建二.移动自组网中一种基于最稳路径的QoS路由.计算机工程,2002,28(9)：45-47.
[67]刘亭,张杭.网络抗毁性综述.军事通信技术,2003,24(4)：19-23.
[68]赖积保,王慧强,王健.系统可生存性研究综述.计算机科学,2007,134(13)：237-239.
[69]杨凡,蒋建春,陈松乔.网络生存性研究概述.计算机应用研究,2001,18(6)：12-14.
[70]Lima M N, Santos A, and Pujolle G. A survey of survivability in mobile ad hoc networks. IEEE Communications Surveys & Tutorials.2009,11(1):66-77.
[71]Frank H and Frisch I T. Analysis and design of survivable networks. IEEE Transaction on Communication Technology,1970,18(5):501-519.
[72]Hollway B A and Neumman P G. Survivable computer communication systems: the problem and working group recommendations. Washington:US Army Research Laboratory,1993.
[73]Knight J, Sullivan K. On the definition of survivability. Department of Computer Science, University of Virginia:Technical Report CS200233,2000.
[74]Knight J, Heimbigner D, Wolf A, et al. The willow architecture:comprehensive survivability for large-scale distributed applications. Proceedings of the International Conference on Dependable Systems and Networks,2002.
[75]Ellison R J, Linger R C, Longstaff T, and Mead N R. Survivable network system analysis:a case study. IEEE Software,1999.16(4):70-77.
[76]Mead N R, Ellison R J, Linger R C, et al. Survivable network analysis method. in Technical Report CMU/SEI-2000-TR-013. Carnegie Mellon University, 2000.
[77]Krings A W and Azadmanesh M H. A graph based model for survivability analysis. in Technical Report UI-CS-TR-02-024, Computer Science Department, University of Idaho,2002.
[78]Keshtgary M, Al-Zahrani F, Jayasumana A P, et al. Network survivability performance evaluation with applications in WDM networks with wavelength conversion. Proceedings of the 29th IEEE Conference on Local Computer Networks (LCN 2004),2004, pp.344-351.
[79]黄遵国.面向生存能力的应急响应与事故恢复技术研究：[博士学位论文].长沙：国防科学技术大学,2003.
[80]王东霞,窦文华,周兴铭.保证关键服务生存性的ATM网络资源管理.计算机研究与发展,2000,37(1)：50-54.
[81]林雪纲,许榕生.信息系统生存性分析模型研究.通信学报,2006,27(2)：153-159.
[82]关于国家重点基础研究发展计划973计划[EB/OL].http://www.973.gov.cn /mana/contfile/web/234/20051271353429a.doc,2005.
[83]王烨,李乐民,王晟.网状WDM网络的抗毁设计.通信学报,2001,22(11)：22-29.
[84]曹俊忠,鲍振武,张程.波分复用无源光接入网生存性机制的分析与设计.光通信技术,2003,27(5)：.20-22
[85]智能光网络的核心机理和关键技术研究[EB/OL]. http://www.nsfc.gov.cn /nsfc/20znzt/chengguo_114.htm,2005.
[86]Cao J, Zhang L, Wang G, et al. SSR:Segment-by-segment routing in large-scale MANETs. Proceedings of the Third IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2006), October 2006, pp.216-225.
[87]Ge Y, Wang G, Zhang Q, et al. Multipath routing with reliable nodes in large-scale mobile ad-hoc networks. IEICE Transactions on Information and Systems, September 2009, Vol. E92-D, No.9, pp.1675-1682.
[88]Wang G, Zhang L, and Cao J. Hole-shadowing routing in large-scale MANETs. International Journal of Sensor Networks (Inderscience Publishers),2008,4(4): 220-229.
[89]Li P, Wang G, Wu J, et al. Hole reshaping routing in large-scale mobile ad-hoc networks. Proceedings of the IEEE Global Communications Conference (GLOBECOM 2009), Hawaii, USA, November/December 2009.
[90]王树鹏,云晓春,余翔湛.基于生存性和Makespan的多目标网格任务调度算法研究.2006,27(2)：42-49.
[91]徐琳,刘志勇,等.国家自然科学基金委员会信息科学部计算机科学处2005年度基金申请与资助概况.软件学报,2005,16(11)：2021-2028.
[92]中国人民大学,科研园地获资助科研项目简介[EB/OL]. http://info.ruc.edu.cn /research/research08/zizujianjie.asp.
[93]Wang H, Liu D, Xu D, et al. A holistic approach to survivable distributed information system for critical applications. Proceedings of ISPA 2005, Nanjing, China, Published in Springer's Lecture Notes in Computer Science, LNCS 3758. 2005, pp.713-724.
[94]Louca S, Pitsillides A, and Samaras G. On network survivability algorithms based on trellis graph transformations. Proceeding of the Fourth IEEE Symposium on Computers and Communications (ISCC 1999).1999, pp. 235-243.
[95]Westmark V R. A definition for information system survivability. Proceedings of the 37th Annual Hawaii International Conference on System Sciences,2004.
[96]杨超,马建峰.可生存网络系统的形式化定义.网络安全技术与应用2004,7：39-41.
[97]谭跃进,吕欣,吴俊,等.复杂网络抗毁性研究若干问题的思考.系统工程理论与实践(增刊),2008,116-120.
[98]Frank H. Survivability analysis of command and control communications networks-part I, II. IEEE Transactions on Communications,1974,22(5): 589-605.
[99]郭伟,洪福明.干线战术通信网的抗毁模型研究.电子科技大学学报,1990,19(2)：152-158.
[100]Liew S C and Lu K W. A framework for network survivability characterization. Proceedings of the IEEE International Conference on Communications (ICC 1992),1992, pp.405-410.
[101]Zolfaghario A and Kaudel F J. Framework for network survivability performance. IEEE Journal on Selected Areas in Communications,1994,12(1): 46-51.
[102]Jha S and Wing M. Survivability analysis of networked systems. Proceedings of IEEE International Conference on Software Engineering (ICSE 2001), Toronto: IEEE Press,2001, pp.307-317.
[103]Krings A W and Azadmanesh A A. Graph based model for survivability applications. European Journal of Operational Research,2005,164(3):680-689.
[104]McDermott J. Attack-potential-based survivability modeling for high-consequence systems. Proceedings of Third IEEE International Workshop on Information Assurance (IWIA 2005),2005, pp.119-130.
[105]郭渊博,马建峰.分布式系统中服务可生存性的定量分析.同济大学学报：自然科学版,2002,30(10)：1190-1193.
[106]黄遵国,卢锡城,胡华平.生存能力技术及其实现案例研究.通信学报,2004,25(7)：137-145.
[107]包秀国,胡铭曾,张宏莉.两种网络安全管理系统的生存性定量分析方法.通信学报,2004,25(9)：34-41.
[108]Li X and Yang D. A quantitative survivability evaluation model for wireless sensor networks. Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control (ICNSC 2006),2006, pp.727-732.
[109]Chen D, Garg S and Trivedi K. Network survivability performance evaluation:a quantitative approach with applications in wireless ad-hoc networks. Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, New York, USA:ACM Press,2002, pp.61-68.
[110]Koroma J and Li W. A generalized model for network survivability. Proceedings of the 2003 Conference on Diversity in Computing (TAPIA 2003),2003, pp. 47-51.
[111]Kim D S, Shazzad K M, and Park J S. A framework of survivability model for wireless sensor network. Proceedings of the First International Conference on Availability, Reliability and Security (ARES 2006).2006, pp.515-522.
[112]Kim D S and Park J S. A survivable distributed sensor networks through stochastic models. Springer Verlag,2006, pp.185-194.
[113]Xing F and Wang W. On the survivability of wireless ad hoc networks with node misbehaviors and failures. IEEE Transactions on Dependable and Secure Computing.2008,1-15.
[114]谢波,肖晓强,徐明,等.一种基于马尔可夫链的车辆自组网可生存性模型.计算机应用,2008,28(10)：2577-2579.
[115]国家自然基金委员会信息科学部2006年拟资助26个重点项目[EB/OL].http://www.nsfc.gov.cn/nsfc/cen/xmzn/2006xmzn/02zd/06xx.htm,2006.
[116]关于“十一五”国家高技术研究发展计划(863计划)信息技术领域2006年度专题课题评审结果的公告[EB/OL]. http://www.most.gov.cn/tztg/200611/ t20061124_38273.htm,2006.
[117]国家高技术研究发展计划(863计划)信息技术领域新一代高可信网络重大项目2009年度课题申请指南863网站[EB/OL]. http://www.most.gov.cn/tztg /200907/t20090705_71630.htm,2009.
[118]Lu Q. Vulnerability of wireless routing protocols. Technical report, December 15,2002.
[119]龚光鲁,钱敏平.应用随机过程教程及在算法和智能计算中的随机模型.北京：清华大学出版社,2004,1-25.
[120]邓永录.应用概率及其理论基础.北京：清华大学出版社,2005,27-43,168-253.
[121]李裕奇.随机过程.北京：国防工业出版社,2003,1-7,214-218.
[122]侯振挺,刘再明,刘国欣,等.马尔可夫骨架过程—混杂系统模型.长沙：湖南科学技术出版社,2000,215-245.
[123]曹晋华,程侃.可靠性数学引论(修订版).北京：高等教育出版社,2006,250-258.
[124]黄晓璐.网络流量的半马尔柯夫模型：[博士学位论文].北京：中国科学院研究生院,2006.
[125]孙惠泉.图论及其应用.北京：科学出版社,2004,1-14.
[126]Erdos P and Renyi A. On random graphs. Publications Mathematicae,1959,6: 290-297.
[127]Erdos P and Renyi A. On the evolution of random graphs. Publications Math. Inst. Hungar. Acad.1960, (5):17-61.
[128]Chlamtac I and Farago A. A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks,1999,5(3):149-156.
[129]Krishnamachari B, Wicker S B, and Bejar R. Phase transition phenomena in wireless ad hoc networks. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2001), November 2001, pp.2921-2925.
[130]Farago A. Scalable analysis and design of ad hoc networks via random graph theory. Proceedings of the ACM 6th international workshop on discrete algorithms and methods for mobile computing and communications, September, 2002, pp.43-50.
[131]赵蕴龙,左德承,时锐,等.移动自组网应用建模及无线收发器选用策略.电子学报,2005,33(7)：1153-1157.
[132]Bollobas B. Modern graph theory. Springer,1998.
[133]Penrose M D. On k-connectivity for a geometric random graph. Random Structure Algorithms,1999,15(2):145-164.
[134]王健,王慧强,赵国生.信息系统可生存性定量评估的指标体系.计算机工程,2009,35(3)：54-56.
[135]Laprie J C and Randell B. Basic concepts and taxonomy of dependable and secure computing. IEEE transaction dependable security computer,2004,1(1): 11-33.
[136]林闯,汪洋,李泉林.网络安全的随机模型方法与评价技术.计算机学报,2005,28(12)：1943-1956.
[137]邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法.软件学报.2003,14(9)：1621-1628.
[138]Sarwar B, Karypis G, Konstan J, et al. Item-based collaborative filtering recommendation algorithms. Proceedings of the 10th International World Wide Web Conference, May,2001, pp.285-295.
[139]Chen A and McLeod D. Collaborative filtering for information recommendation systems. Encyclopedia of Data Warehousing and Mining, Idea Group,2005.
[140]Herlocker J L, Konstan J A, Terveen L G, et al. Evaluating collaborative filtering recommender systems. ACM Trans. Information Systems,2004,22(1):5-53.
[141]曹晋华,程侃.可靠性数学引论(修订版).北京：高等教育出版社,2006,1-45.
[142]刘普寅,张维明.通信网络可靠性研究中的数学问题.通信学报,2000,21(10)：50-57.
[143]Ke W J and Wang S D. Reliability evaluation for distributed computing network with imperfect nodes. IEEE Transactions on Reliability,1997,46(3):342-349.
[144]Heidemann J, Ye W, Wills J, et al. Research challenges and applications for underwater sensor networking. IEEE Wireless Communications and Networking Conference (WCNC 2006), April,2006,1:228-235.
[145]Kong J, Cui J, Wu D, and Gerla M. Building underwater ad-hoc networks and sensor networks for large scale real-time aquatic applications. IEEE Military Communications Conference (MILCOM 2005), October,2005, pp.1535-1541.
[146]Nazrul Alam S M and Zygmunt Haas J. Coverage and connectivity in three-dimensional networks. Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MobiCom 2006), September 2006, pp.346-357.
[147]Liu C and Wu J. Efficient geometric routing in three dimensional ad hoc networks. Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2009), April 2009, pp.2751-2755.
[148]Li M, Liu Y, and Chen L. Non-threshold based event detection for 3D environment monitoring in sensor networks. IEEE Transactions on Knowledge and Data Engineering,2008,20(12):1699-1711.
[149]Paul K, Choudhuri R R, and Bandyopadhyay S. Survivability analysis of ad hoc wireless network architecture. Mobile and Wireless Communication Networks, Lecture Note in Computer Science. Springer Verlag,2000, pp.31-46.
[150]Goyal D and Caffery J J. Partitioning avoidance in mobile ad hoc networks using network survivability concepts. Proceedings of the 7th IEEE International Symposium on Computers and Communications (ISCC 2002), July,2002, pp. 553-558.
[151]Kawahigashi H, Terashima Y, Miyauchi N, et al. Desiging fault tolerant ad hoc networks. Proceedings of IEEE/AFCEA Military Communications Conference (MILCOM 2005), October 2005,3:1360-1367.
[152]Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network. Proceedings of the 3rd ACM International Symposium On Mobile Ad Hoc Networking and Computing (MobiHoc 2002), June,2002, pp. 80-91.
[153]Santi P. The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans on Mobile Computing,2005,4(3):310-317.
[154]盛敏,史琰,田野,等.移动Ad Hoc网络的k连通性研究.电子学报,2008,36(10)：1857-1861.
[155]Hollick M, Schmitt J, Seipl C, et al. On the effect of node misbehavior in ad hoc networks. In Proceedings of the IEEE International Conference on Communications (ICC 2004),2004, pp.3759-3763.
[156]Xing F and Wang W. Modeling and analysis of connectivity in mobile ad hoc networks with misbehaving nodes. In Proceedings of the IEEE International Conference on Communications (ICC 2006), June 2006, pp.1879-1884.
[157]Komathy K and Narayanasamy P. A probabilistic behavioral model for selfish neighbors in a wireless ad hoc network. International Journal of Computer Science and Network Security,2007,7(7):77-83.
[158]Peng S, Jia W, and Wang G. Survivability evaluation in large-scale mobile ad-hoc networks. Journal of Computer Science and Technology,2009,24(4): 761-774.
[159]Hu Y C, Perrig A, and Johnson D B. Ariadne:a secure on demand routing protocol for ad hoc networks. Wireless Networks,2005,11(1-2):21-38.
[160]龚光鲁,钱敏平.应用随机过程教程及在算法和智能计算中的随机模型.北京：清华大学出版社,2004,26-27.
[161]Gan Z, Li Y, Xiao G, et al. A novel reputation computing model for mobile agent-based e-commerce systems. International Conference on Information Security and Assurance (ISA 2008), April 2008, pp.253-260.
[162]Chang J, Wang H, Yin G, et al. A new reputation mechanism against dishonest recommendations in P2P Systems. WISE 2007, Springer-Verlag, pp.449-460.
[163]Kinateder M and Rothermel K. Architecture and algorithms for a distributed reputation system. In Nixon P and Terzis S, editors, Proceedings of the First International Conference on Trust Management, volume 2692 of LNCS, Springer-Verlag, May 200.3, pp.1-16.
[164]Sun Y, Yu W, Han Z, et al. Information theoretic framework of trust modeling and evaluation for ad hoc networks. IEEE Journal on Selected Areas in Communications,2006,24:305-317.
[165]Theodorakopoulos G and Baras J S. On trust models and trust evaluation metrics for ad hoc networks. IEEE Journal on Selected Areas in Communications,2006,24(2):318-328.
[166]Li J, Li R, and Kato J. Future trust management framework for mobile ad hoc networks. IEEE Communications Magazine,2008,46(4):108-114.
[167]Buchegger S and Le Boudec J. A robust reputation system for P2P and mobile ad-hoc networks. P2PEcon,2004.
[168]Luo J, Liu X, Zhang Y, et al. Fuzzy trust recommendation based on collaborative filtering for mobile ad-hoc networks. Proceedings of the 33rd IEEE Conference on Local Computer Networks (LCN 2008), October 2008, pp. 305-311.
[169]J(?)sang A. The right type of trust for distributed systems. Proceedings of the 1996 New Security Paradigms Workshop, ACM,1996, pp.119-131.
[170]J(?)sang A. An algebra for assessing trust in certification chains. Proceedings of the Network and Distributed Systems Security Symposium (NDSS 1999), the Internet Society,1999.
[171]Balakrishnan V, Varadharajan V, and Tupakula U. Trust management in mobile ad hoc networks. in Misra S, Woungang I, and Misra S C. Guide to Wireless Ad Hoc Networks, Springer, ISBN:9781848003286,2009.
[172]Chang E, Thomson P, Dillon T, et al. The fuzzy and dynamic nature of trust. LNCS 3592. Berlin:Springer-Verlag,2005.161-174.
[173]Marsh StePhen. Formalising trust as a computational concept:[PhD Thesis]. Seotland:University of Stirling,1994,22-31.
[174]Heckerman D. A tutorial on learning with bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research Advanced Technology Division, Microsoft Corporation, March 1995 (Revised November 1996).
[175]J(?)sang A and Ismail R. The beta reputation system. Proceedings of the 15th Bled Conference on Electronic Commerce, June,2002, pp.324-337.
[176]王伟,曾国荪.一种基于Bayes信任模型的可信动态级调度算法.中国科学(E辑：信息科学),2007,37(2)：285-296.
[177]Hu Y C, Perrig A, and Johnson D B. Ariadne:a secure on-demand routing protocol for ad hoc networks. Proceedings of the 8th ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2002), September 2002, pp.12-23.
[178]Lin Y X, Rad A H, Wong V W, et al. Experimental comparisons between SAODV and AODV routing protocols. Proceedings of the 1st ACM Workshop on Wireless Multimedia Networking and Performance Modeling, October 2005, pp.113-122.
[179]仿真工具 GloMoSim2.03 [EB/OL]. http://pcl.cs.ucla.edu/projects/glomosim/.