移动Ad Hoc网络路径压缩及安全技术研究
|
摘要
随着移动自组网(Mobile Ad Hoc Networks,MANET)应用范围的逐渐推广,MANET的性能优化和安全防护也受到了更多的关注。本文针对这一领域中的若干关键和热点问题,从自适应性、扩展性、匿名性、可认证性等方面开展研究,主要贡献与创新性成果如下：
(1)在分析目前路径压缩算法原理和特点的基础上,提出了一个Ad Hoc网络路径压缩的动态分析模型。该模型充分考虑了Ad Hoc网络的动态性与扩展性,从分析节点的t-时间相对移动向量入手,在路径压缩事件发生概率与网络关键参数之间建立起定量关系,为压缩算法的设计与分析提供了必要的理论支持。通过对典型路径压缩算法SHORT和PCA的实验,验证了该模型可有效描述与路径压缩有关的现实环境。最后进一步讨论了该模型的典型应用及进一步改进思路。
(2)针对现有Ad Hoc路径压缩技术存在的压缩盲目、路径不稳定、短暂缩减和多次缩减现象频繁等不足,提出一种基于节点停留概率的路径压缩算法NSP-PCA。NSP-PCA通过计算造成路径变化的节点相对于另一节点传输区域的停留概率,动态预测压缩路径的稳定性,并以此为依据决定压缩操作的优先级。通过与PCA和SHORT的性能对比,表明NSP-PCA能有效控制非正常压缩事件的发生,提高优化路径的稳定性与持久性。
(3)针对已有Ad Hoc网络匿名路由协议在对抗伪造报文方面存在的不足,提出了一种可认证安全匿名路由协议ANAR。ANAR利用双线性对的性质,在邻居间实现双向匿名认证,在路由发现过程中利用邻居认证密钥对路由控制消息进行逐跳的验证与处理,使得伪造路由分组的影响被控制在一跳范围中。理论分析和仿真实验表明,ANAR能有效对抗基于伪造匿名报文的各类攻击,提高匿名路由协议的安全性与可靠性。
(4)针对现有基于洋葱路由的Ad Hoc网络匿名通信方案在前向机密方面存在的不足,提出了一种安全增强的洋葱路由方案FSAR。在FSAR中,引入了前向安全的密钥协商机制,使得节点长期私钥的泄漏不会导致以往会话密钥也连带泄露,从而保证了洋葱数据包的前向机密性。分析和实验表明,FSAR在有限增加开销的前提下,可有效消除由于节点被侵蚀而导致的前向机密隐患。
(5)提出一种流量自适应的传感器网络DDoS攻击源追踪方案WETS,方案中每个节点以一定概率随机抽取数据包并进行标记,被攻击者通过收集标记包重构出一条攻击路径。方案可动态适应DDoS流量分布特性,使标记包到达终点的概率随距离递增,在流量较小处有较大的采样概率,从而获得最佳的追踪效果。通过与现有追踪方案对比,表明WETS在路径收敛时间,标记包收集数目,误报率方面有明显改善。
With the gradual promotion of the scope of MANET applications, performance optimization and security issues of MANET are more and more concerned. This paper focuses on some key problems in this field and proposes some solutions from the point of adaptability, expansibility, anonymity and authentication.
The main achievements of this paper are listed below:
(1) We proposed a dynamic model for analyzing path compression algorithm in MANET. Based on the analysis to the probability distribution of time-t relevant movement vector of two MANET nodes, this model constructs the quantitative relationship between network parameters and path compression probability. The model takes the mobility and expansibility of MANET into account and provides the theoretic basis for developing and analyzing path compression algorithm. The simulation results of SHORT and PCA show that it is a correct and efficient dynamic model for path compression.
(2) To overcome the shortcomings of traditional path compression techniques, a node staying probability based path compression algorithm (NSP-PCA) is proposed. In NSP-PCA, the stability of new path is predicted by computing the probability that one node keeps staying in another node's transmission range and the compressing operation is performed based on the prediction to reduce the blindness of compression. Simulation results show that NSP-PCA lessens the ephemeral and multiple short-cuts observably and achieves lower end-to-end delay, lower routing overhead and higher packet delivery rate compared with both SHORT and PCA.
(3) Existing anonymous routing protocols for MANET are vulnerable to attacks based on forged packets. We present an anonymous and authenticated routing protocols (ANAR) to solve this problem. By anonymous neighborhood authentications using bilinear paring, shared keys are established between legal neighboring nodes in ANAR. In route discovery procedure, control packets are hop-by-hop authenticated and processed. ANAR ensures the forged packets are correctly distinguished and the nodes en route process control packets by symmetric key which decrease computing overhead. Analysis and simulation show that ANAR can resist attacks based on forged packets and has lower route construction delay than traditional protocols.
(4) To solve the security problem of traditional onion routing protocol in MANET, we propose an onion routing schemes with forward secrecy (FSAR).In FSAR, the communicating nodes construct the anonymous route through an forward secure key agreement scheme, which ensure the forward secrecy of the onion packets. Compared with traditional onion routing protocol, FSAR can efficiently eliminate the security shortage and also has lower route construction overhead.
(5) We present an efficient traceback scheme (WETS) to locate DDoS attack sources in WSN. In WETS, every node in attack paths marks packets probabilistically and the victim reconstructs attack paths by collecting those marked packets. WETS is adaptive to DDoS traffic distribution, which means the sampling probability of the marking nodes keeps increasing along with the distance to the victim. Thus, the farer node where the DDoS traffic is lower can be sampled more easily. Simulation results show that WETS is much more efficient than other traditional schemes.
(1)在分析目前路径压缩算法原理和特点的基础上,提出了一个Ad Hoc网络路径压缩的动态分析模型。该模型充分考虑了Ad Hoc网络的动态性与扩展性,从分析节点的t-时间相对移动向量入手,在路径压缩事件发生概率与网络关键参数之间建立起定量关系,为压缩算法的设计与分析提供了必要的理论支持。通过对典型路径压缩算法SHORT和PCA的实验,验证了该模型可有效描述与路径压缩有关的现实环境。最后进一步讨论了该模型的典型应用及进一步改进思路。
(2)针对现有Ad Hoc路径压缩技术存在的压缩盲目、路径不稳定、短暂缩减和多次缩减现象频繁等不足,提出一种基于节点停留概率的路径压缩算法NSP-PCA。NSP-PCA通过计算造成路径变化的节点相对于另一节点传输区域的停留概率,动态预测压缩路径的稳定性,并以此为依据决定压缩操作的优先级。通过与PCA和SHORT的性能对比,表明NSP-PCA能有效控制非正常压缩事件的发生,提高优化路径的稳定性与持久性。
(3)针对已有Ad Hoc网络匿名路由协议在对抗伪造报文方面存在的不足,提出了一种可认证安全匿名路由协议ANAR。ANAR利用双线性对的性质,在邻居间实现双向匿名认证,在路由发现过程中利用邻居认证密钥对路由控制消息进行逐跳的验证与处理,使得伪造路由分组的影响被控制在一跳范围中。理论分析和仿真实验表明,ANAR能有效对抗基于伪造匿名报文的各类攻击,提高匿名路由协议的安全性与可靠性。
(4)针对现有基于洋葱路由的Ad Hoc网络匿名通信方案在前向机密方面存在的不足,提出了一种安全增强的洋葱路由方案FSAR。在FSAR中,引入了前向安全的密钥协商机制,使得节点长期私钥的泄漏不会导致以往会话密钥也连带泄露,从而保证了洋葱数据包的前向机密性。分析和实验表明,FSAR在有限增加开销的前提下,可有效消除由于节点被侵蚀而导致的前向机密隐患。
(5)提出一种流量自适应的传感器网络DDoS攻击源追踪方案WETS,方案中每个节点以一定概率随机抽取数据包并进行标记,被攻击者通过收集标记包重构出一条攻击路径。方案可动态适应DDoS流量分布特性,使标记包到达终点的概率随距离递增,在流量较小处有较大的采样概率,从而获得最佳的追踪效果。通过与现有追踪方案对比,表明WETS在路径收敛时间,标记包收集数目,误报率方面有明显改善。
With the gradual promotion of the scope of MANET applications, performance optimization and security issues of MANET are more and more concerned. This paper focuses on some key problems in this field and proposes some solutions from the point of adaptability, expansibility, anonymity and authentication.
The main achievements of this paper are listed below:
(1) We proposed a dynamic model for analyzing path compression algorithm in MANET. Based on the analysis to the probability distribution of time-t relevant movement vector of two MANET nodes, this model constructs the quantitative relationship between network parameters and path compression probability. The model takes the mobility and expansibility of MANET into account and provides the theoretic basis for developing and analyzing path compression algorithm. The simulation results of SHORT and PCA show that it is a correct and efficient dynamic model for path compression.
(2) To overcome the shortcomings of traditional path compression techniques, a node staying probability based path compression algorithm (NSP-PCA) is proposed. In NSP-PCA, the stability of new path is predicted by computing the probability that one node keeps staying in another node's transmission range and the compressing operation is performed based on the prediction to reduce the blindness of compression. Simulation results show that NSP-PCA lessens the ephemeral and multiple short-cuts observably and achieves lower end-to-end delay, lower routing overhead and higher packet delivery rate compared with both SHORT and PCA.
(3) Existing anonymous routing protocols for MANET are vulnerable to attacks based on forged packets. We present an anonymous and authenticated routing protocols (ANAR) to solve this problem. By anonymous neighborhood authentications using bilinear paring, shared keys are established between legal neighboring nodes in ANAR. In route discovery procedure, control packets are hop-by-hop authenticated and processed. ANAR ensures the forged packets are correctly distinguished and the nodes en route process control packets by symmetric key which decrease computing overhead. Analysis and simulation show that ANAR can resist attacks based on forged packets and has lower route construction delay than traditional protocols.
(4) To solve the security problem of traditional onion routing protocol in MANET, we propose an onion routing schemes with forward secrecy (FSAR).In FSAR, the communicating nodes construct the anonymous route through an forward secure key agreement scheme, which ensure the forward secrecy of the onion packets. Compared with traditional onion routing protocol, FSAR can efficiently eliminate the security shortage and also has lower route construction overhead.
(5) We present an efficient traceback scheme (WETS) to locate DDoS attack sources in WSN. In WETS, every node in attack paths marks packets probabilistically and the victim reconstructs attack paths by collecting those marked packets. WETS is adaptive to DDoS traffic distribution, which means the sampling probability of the marking nodes keeps increasing along with the distance to the victim. Thus, the farer node where the DDoS traffic is lower can be sampled more easily. Simulation results show that WETS is much more efficient than other traditional schemes.
引文
[1]IETF Manet charter, http://www.ietf.org/html.charters/manet-charter.html.
[2]John J, Janet D.The DARPA packet radio network protocols. In:Proc of the IEEE, 1987,5(1):21-327.
[3]Sun JZ. Mobile ad hoc Networking:an essential technology for pervasive computing. In:Proc of International Conferences on Info-tech and Info-net, Beijing,2001(ICII 2001),3:316-321.
[4]IETF Working Group:Mobile Ad hoc Networks (manet). http://www.ietf. org/html.charters/manet-charter.html.
[5]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1290
[6]裴庆祺,沈玉龙,马建峰.无线传感器网络安全技术综述.通信学报.,2007,18(8)：113-122
[7]Benenson Z. An algorithmic framework for robust access control in wireless sensor networks. In:Proc of the 2nd European Workshop on Wireless Sensor Networks (EWSN). Istanbul, Turkey,2005:158-165.
[8]Kraus S, Lin R, Shavvit Y. On self-interested agents in vehicular networks with car-to-car gossiping. IEEE Transactions on Vehicular Technology.2008,57 (6): 3319-3332
[9]Sun X, Lin X, Ho P P. Secure vehicular communications based on group signature and id-based signature scheme. In:Proc of International Conference on Communications, Glasgow, Scotland,2007:1539-1545.
[10]Bishop R. A survey of intelligent vehicle applications worldwide. In:Proc of IEEE intelligent vehicles symposium 2000, Dearborn, MI, USA,2000:25-30.
[11]Partan J, Kurose J, Levine B N. A survey of practical issues in underwater networks. In:Proc of the First ACM International Workshop on Underwater Networks,2006: 17-24.
[12]Foo K, Atkins K, Collins T, et al. A routing and channel-access approach for an ad hoc underwater acoustic network. In:Proc of IEEE Oceans 2004,2:789-795.
[13]Car G A, Adams A.E. ACMENet:an underwater acoustic sensor network for real-time environmental monitoring in coastal areas. IEE Proc. Radar, Sonar, and Nav, 2006,153(4):365-380.
[14]Zhang Z S. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks overview and challenges. Communications Surveys & Tutorials, 2006,8(1):24-37.
[15]Vahdat, Becker D. Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
[16]Khaled H, Kevin A, Belding R E. Delay tolerant mobile networks (DTMNs): controlled flooding schemes in sparse mobile networks. In:Proc of the IFIP Networking. Waterloo, Canada,2005.
[17]Burns B, Brock O, MV routing and capacity building in disruption tolerant networks. In:Proc of IEEE INFOCOM 2005, Miami, FL,2005.
[18]Burns B, Brock O, Levine B N. Autonomous enhancement of disruption tolerant networks. In:Proc of IEEE International Conference on Robotics and Automation, 2006.
[19]Zhang J, Fan P. On network coding in wireless ad-hoc networks. International Journal of Ad Hoc and Ubiquitous Computing,2007,2(3):140-148.
[20]Wu Y, Chou P, Zhang Q, et al Network planning in wireless ad hoc networks:a cross-Layer approach. IEEE Journal on Selected Areas on Communications,2005, 23(1):136-150.
[21]Wu Y, Chou P, Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding.IEEE Transactions on Communications,2005,53(11): 1906-1918.
[22]Luo J, Blum R S, Cimini L J, et al. Decode-and-forward cooperative diversity with power allocation in wireless networks. IEEE Transactions on Wireless Communications,2007,6(3):793-799.
[23]Laneman J N, Wornell G W, Tse and D N. An efficient protocol for realizing cooperative diversity in wireless networks. In:Proc of IEEE ISIT, Washington, DC, 2001:294-301.
[24]Nosratinia A, Hunter T E, Hedayat A. Cooperative communication in wireless networks. IEEE Communication Magazine,2004,10:74-80.
[25]Levorato M, Tomasin S, Casari P, et al. Analysis of spatial multiplexing for cross-layer design of MIMO ad hoc networks. In:Proc of IEEE VTC-2006,2006,3: 1146-1150.
[26]Narasimhan R. Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels. IEEE Trans on Signal Processing, 2003,51(11):2829-2838.
[27]Sundaresan K, Sivalumar R, Ingram M A, et al. Medium access control in ad hoc networks with MIMO Links:optimization considerations and algorithms. IEEE Trans on Mobile Computing,2004,3(4):350-365.
[28]Joa-Ng M, Lu I T. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE on Selected Areas in Communications,1999,17(8): 1415-1425.
[29]Pei G, Gerla M, Chen T W. Fisheye state routing in mobile ad hoc networks. In:Proc of the 2000 ICDCS Workshops, Taipei, Taiwan,2000:D71-D78
[30]Haas Z J, Pearlman M R. The Zone Routing Protocol (ZRP) for ad hoc networks. IETF Internet draft,1998.
[31]Iwata A, Chiang C C, Pei G, et al. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, August 1999, p1369-p1379.
[32]Perkins C E, Bhagwat P. Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers. In:Proc of ACM Computer Communication Review, (ACM SIGCOMM'94),1994,24(4).4:234-244.
[33]Jacquet P, Muhlethaler P, Clausen T, et al. Optimized link state routing protocol for ad hoc networks. In:Proc of the IEEE Int'l Conf. on Technology for the 21st Century, Pakistan,2001:62-68.
[34]Clausen T, Jacquet P.. Optimized link state routing protocol (OLSR). IETF RFC 3626, 2003. http://www.ietf.org/rfc/rfc3626.txt
[35]Ogier R, Templin F, Lewis M. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). IETF RFC3684,2004. http://www.ietf.org/rfc/rfc3684.txt
[36]Perkins C, Belding-Royer E, Das S. Ad hoc on-demand distance vector (AODV) routing. IETF RFC 3561,2003. http://www.ietf.org/rfc/rfc3561.txt.
[37]Perkins CE, Royer EM. Ad-Hoc on-demand distance vector routing. In:Proc of IEEE Work-Shop on Mobile Computing Systems and Applications (WMCSA),1999: 90-100.
[38]Johnson DB, Maltz DA. Dynamic source routing in ad hoc wireless networks. Mobile Computing,1996:153-181
[39]Johnson DB, Maltz DA, Hu YC. The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF RFC4728,2007. http://www.ietf.org/rfc/rfc4728.txt.
[40]Chakeres I, Perkins C. Dynamic MANET on-demand (DYMO) routing. Internet Draft, draft-ietf-manet-dymo-04.txt, IETF MANET Working Group,2006. http://tools.ietf.org/html/draft-ietf-manet-dymo-04
[41]PARK V, CORSON M.A highly adaptive distributed routing algorithm for mobile wireless networks. In:Proc of IEEE Infocom'97, Kobe, Japan,1997:1405-1413.
[42]Chiang C C, Tsai T C, Liu W, et al. Routing in clustered multihop, mobile wireless networks with fading channel. In:Proc of the Next Millennium, the IEEE SICON, 1997.
[43]Iwata A, Chiang C C, Pei G, et al. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks,1999:1369-1379.
[44]Jiang M L, Li J, Tay Y C. Cluster Based Routing Protocol (CBRP), Internet draft, draft-ietf-manet-cbrp-spec-01.txt.
[45]Royer M, Perkins, C. Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing, IETF, Intermit Draft:draft-ietf-manet-maodv-OO.txt,2000.
[46]Liu M, Talpade R, McAuley A. AMRoute:Ad-hoc multicast routing protocol. Technical Report, CSHCN T. R.99-1, University of Maryland.
[47]Lee S J, Gerla M, Chiang C C. On demand multicast routing protocol. In:Proc of IEEE WCNC'99, New Orleans, USA,1999:1298-1302.
[48]杨云,徐佳,陶笔蕾,等.基于蚁群系统的分布式QoS多播路由算法.小型微型计算机系统,2007,28(12)：2142-2148.
[49]刘占军；赵为粮；李云；Ad hoc网络中基于数据流的QoS路由协议-通信学报,2004,25(12)：125-130.
[50]王海涛,郑少仁,宋丽华.Ad hoc网络中QoS保障机制的研究.通信学报,2002,23(10)：114-121.
[51]Alkaraki J N, Chang J M. Quality of service support in IEEE 802,11 wireless ad hoc networks. Ad Hoc Networks,2004:265-281.
[52]Pei G, Gerla M, Hong X. LANMAR:Landmark routing for large scale wireless ad hoc networks with group mobility. In:Proc of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC),2000:11-18.
[53]Sinha P, Sivakumar R, Bharghaven V. CEDAR:a core-extraction distributed ad hoc routing algorithm. IEEE INFOCOM,1999.
[54]Toh C K. Associativity based routing for ad hoc mobile networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems,1997:103-139.
[55]Dube R. Signal stability based adaptive routing for ad hoc mobile networks, IEEE Personal Communication,1997:36-45.
[56]Vahdat H, Becker D. Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
[57]Leguay J, Friedman T, Conan V. DTN Routing in a Mobility Pattern Space. In:Proc of the ACM SIGCOMM 2005 Workshop on delay tolerant networks, Philadelphia, PA, USA,2005.
[58]焦贤龙,王晓东,周兴铭.无线自组网中一种高效的路由协议.计算机科学与探索,2008,2(5)：478-486.
[59]GUI C, Mohapatra P. Short:self-healing and optimizing routing techniques for mobile ad hoc networks. In:Proc of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. Annapolis, MD, USA,2003:279-290.
[60]Giruka VC, Singhal M, Yarravarapu, SP. A path compression technique for on-demand ad-hoc routing protocols. In:Pro of IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Fort Lauderdale, USA,2004:144-153.
[61]Saito M, Aida H, Tobe Y, et al. A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks distributed computing systems. In:Proc of the 24th International Conference on Distributed Computing Systems (ICDCS'04). Washington, DC, USA,2004:390-397.
[62]Jiao X L, Wang X D, et al. Neighbor-aware optimizing routing in wireless ad hoc networks. Lecture Notes in Computing Science, Ubiquitous Intelligence and Computing,2007,4611:340-349.
[63]徐佳,李陟,周曜.移动Ad Hoc网络路径压缩技术研究与分析.计算机科学,2008,35(5)：73-77.
[64]Yu X, Kedem Z. A distributed adaptive cache update algorithm for the dynamic source routing protocol. In:Proc of IEEE INFOCOM,2005.
[65]Frey H, Stojmenovic I. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In:Pro of MOBICOM,2006.
[66]Spohn M, Garcia-Luna-Aceves J J. Neighborhood aware source routing. In:Proc of ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC),2001.
[67]Li X F, Cuthbert L. A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks. In:Proc of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2004.
[68]Vasudevan S, Kurose J, Towsley D. On neighbor discovery in wireless networks with directional antennas. In:Proc of IEEE INFOCOM,2005.
[69]Ahlswede R, Cai N, Li S R, et al. Network information flow. IEEE Transactions on Information Theory,2000.
[70]Li L, Ramjee R, Buddhikot M, et al. Network coding based broadcast in mobile ad hoc networks. In:Proc of INFOCOM,2007.
[71]Yang S H, Wu J, Cardei M. Efficient broadcast in MANETs using network coding and directional antennas. In:Proc of INFOCOM,2008.
[72]Zhang J Y, Cai K, Letaief K B, et al. A network coding unicast strategy for wireless multi-hop networks. In:Proc of IEEE WCNC2007, Hong Kong, China,2007.
[73] Lun D S, Medard M, Koetter R. Network coding for efficient wireless unicast. In: Proc of IEEE International Zurich Seminar on Communications, Zurich, Switzerland, 2006.
[74]Katti S, Katabi D, Hu W J, et al. The importance of being opportunistic-practical network coding for wireless environments. In:Proc of SIGCOMM,2006.
[75]Padimitratos P, Haas Z, Secure routing for mobile Ad Hoc networks. In:Proc of the SCS communication Networks and Distributed Systems Modeling And Simulation Conference, San Antonio, TX, USA,2002.
[76]Yin C H, David B. Ariadne:A secure on-demand routing protocol for ad hoc networks. In:Proc of the MobiCom2002, Atlanta, Georgia, USA,2002.
[77]Sanzgiri K, Dahill B, Levine B N. A secure routing protocol for ad hoc networks. In: Proc of 2002 IEEE International Conference on Network Protocols(ICNP),2002.
[78]El-Khatib K, Korba L, Song R, et al. Secure dynamic distributed routing algorithm for ad hoc wireless networks. In:Proc of Int'l Conf on Parallel Processing Workshops (ICPPW'03), Los Alamitos, FL, USA,2003:359-366.
[79]Song R G, Korba L, Yee G. AnonDSR:Efficient anonymous dynamic source routing for mobile ad hoc networks. In:Proc of the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05). New York, NY, USA,2005:33-42.
[80]Kong J, Hong X, Gerla M. An identity-free and on-demand routing scheme against anonymity threats in mobile ad hoc networks. IEEE Transactions on Mobile Computing,2007,6(8):387-409.
[81]Zhang Y, Liu W, Lou W. Anonymous communications in mobile ad hoc networks. In: Proc of INFOCOM,2005:1940-1951.
[82]Zhu B, Wan Z, Kankanhalli M S,et al. Anonymous secure routing in mobile ad-hoc networks. In:Proc of the 29th Annual IEEE International Conference on Local Computer Networks (LCN'04),2004:102-108.
[83]Seys S, Preneel B. Arm:Anonymous routing protocol for mobile ad hoc networks. In: Proc of the 20th IEEE Int'l Conf on Advanced Information Networking and Applications.(AINA 2006). Washington:IEEE Computer Society,2006:133-137
[84]Sy D, Chen R, Bao L. ODAR:On-demand anonymous routing in ad hoc network s. In: Proc of MASS,2006.
[85]Dingledine R, Mathewson N, Syverson P. Tor:the second generation onion router. In: Proc of the 13th USENIX Security Symposium. San Diego, USA,2004:303-320.
[86]Brickell E, Camenisch J, Chen L. Direct anonymous attestation. In:Proc of the 11th ACM Conference on Computer and Communication Security, Washington, USA, 2004:132-145.
[87]Kim Y, Helmy Y. SWAT:small world-based attacker traceback in Ad-hoc networks. In:Proc of IEEE InfocomPoster/Demo Session (INFOCOM'05), Miami, FL, USA, 2005.
[88]Snoeren A C, Partridge C, Sanchez L A, et al. Hash-based IP traceback. In:Proc of ACM SIGCOMM,2001:3-14.
[89]Sy D, Bao L. CAPTRA:coordinated packet traceback. In:Proc of the Fifth International Conference on Information Processing in Sensor Networks (IPSN),2006; 152-159.
[90]Thing V L L, Lee H C, Sloman M, et al. Enhanced ICMP traceback with cumulative path. In:Proc of the 61st IEEE Vehicular Technology Conference (VTC'05), Stockholm, Sweden, May-June 2005,4:2415-2419.
[91]Bellovin S M. ICMP traceback messages. Internet Draft:draftietf-itrace-04.txt,2003.
[92]Lee H C, Thing V L L, Xu L, et al. ICMP traceback with cumulative path:an efficient solution for IP traceback. In:Proc of the 5th International Conference on Information and Communications Security (ICICS'03), Huhehaote, China,2003:124-135.
[93]Cheng B C, Chen H, Tseng R H. A packet marking with fair probability distribution function for minimizing the convergence time in wireless sensor networks. Computer Communications,2008,31(12):4352-4359.
[94]Jin X, Zhang Y, Pan Y, Zhou. Y. ZSBT:a novel algorithm for tracing DoS attackers in MANETs. EURASIP Journal on Wireless Communications and Networking 2006, 9:84-90.
[95]Cheng B C, Chen H, Liao G T.A novel marking probability distribution using probability propagation in hierarchical WSN. In:Proc of the 4th International Conference on Information Security and Cryptology (Inscrypt 2008),2008.
[96]Savage S, Wetherall D. Network support for IP traceback. IEEE/ACM Transactions on Networking,2001,9(3):226-237.
[97]Song D, Perrig A. Advanced and authenticated marking schemes for IP traceback. In: Proc of the IEEE INFOCOM, Anchorage, Alaska USA,2001,2:878-886
[98]Peng T, CLeckie D, Kotagiri R. Adjusted probabilistic packet marking for IP traceback. In:Proc of the Second IFIP Networking Conference (Networking 2002) Pisa, Italy,2002:697-708.
[99]Cheng B C, Chen H, Liao G T. FBT:an efficient traceback scheme in hierarchical wireless sensor network. Security and Communication Networks,2009,2:133-144
[100]Xu J, Wang Y L,Li F Y, et al A stability module of path compression techniques for on-demand ad-hoc routing protocols. In:Proc of ISBIM,2008:83-88.
[101]McDonald A B, Znati T F, A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, 1999,17(8):1466-1487.
[102]JiST user guide and SWANS user guide, http://jist.ece.conell.edu/docs.html
[103]蔡一兵,李海波,李忠诚,等.移动自组网基于邻居变化率稳定路径选择方法.软件学报,2007,18(3)：681：692
[104]Seada K, Westphal C, Perkins C. Analyzing path accumulation for route discovery in ad hoc networks. In:Proc of Wireless Communications and Networking Conference, IEEE,2007:4377-4382.
[105]Sengupta S, Rayanchu S, Banerjee S. An Analysis of wireless network coding for unicast sessions:The case for coding-aware routing. In:Proc of IEEE INFOCOM'07, 2007:1028-1036.
[106]Chaum D L. The dining cryptographers problem:unconditional sender and recipient untraceability. Journal of Cryptology,1988,1(1):65-75.
[107]Chaum D L. Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM,1981,24(2):84-88.
[108]Jerichow A, Muller J, Pfitzmann A, et al. Real-time MIXes:a bandwidth-efficient anonymity protocol. IEEE Journal of Selected Areas Communication,1998,16(4): 124-128.
[109]Kesdogan D, Egner J, Buschkes R. Stop-and-Go MIXes:providing probabilistic security in an open system. In:Proc of the Second Int'l Workshop Information Hiding (IH'98),1998:83-98.
[110]Pfitzmann A, Pfitzmann B, Waidner M, ISDNMixes:untraceable communication with very small bandwidth overhead. In:Proc of GI/ITG Conf Comm. Distributed Systems,1991:451-463.
[111]Reiter M K, Rubin A D. Crowds:anonymity for web transactions. ACM Transaction of Information and System Security,1998,1(1):66-92.
[112]Rackoff C, Simon D R. Cryptographic defense against traffic analysis. In:Proc. Of Symp Theory of Computation (STOC'93),1993:672-681.
[113]Dai W. PipeNet 1.1. http://www.eskimo.com/-weidai/pipenet.txt,1996.
[114]Al-Muhtadi J, Campbell R, Kapadia A, et al. Routing through the Mist:privacy preserving communication in ubiquitous computing environments. In:Proc of IEEE Int'l Conf on Distributed Computing Systems (ICDCS'02),2002:65-74.
[115]Jiang S, Vaidya N, Zhao W. A MIX route algorithm for Mix-net in wireless ad hoc networks. In:Proc of IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS'04),2004.
[116]Niculescu D, Nath B. Ad hoc positioning system (APS). In:Proc of IEEE Global Telecomm. Conf. (GLOBECOM'01),2001.
[117]Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In Proc of the CRYPTO 01, Springer-Verlag,2001. LNCS 2139:213-229.
[118]Barreto P, Kim H Y, Scott L B. Efficient algorithms for pairing-based cryptosystems. In:Proc of CRYPTO 02,2002:354-368.
[119]田野,张玉军,李忠诚.使用对技术的基于身份密码学研究综述.计算机研究与发展,2006,43(10)：1810-1819.
[120]Joux A, Nguyen K. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003, http://eprint.iacr.org/2001/003/.
[121]Hu Y C, Perrig A, Johnson D B. Packet Leashes:A defense against wormhole attacks in wireless networks. In:Proc of INFOCOM'03. Los Angeles, California, USA,2003.
[122]Kong J, Hong X Y, Gerla M. Modeling ad-hoc rushing attack in a negligibility-based security framework. In:Proc of WiSe'06, Los Angeles, California, USA,2006: 55-64.
[123]Cressie N. Statistics for Spatial Data. John Wiley and Sons,1993.
[124]Paulo S L, Barreto M. Efficient implementation of pairing-based cryptosystems. Journal of Cryptology,2004,17:321-334
[125]Scott M, Costigan N, Abdulwahab W. Implementing cryptographic pairings on smartcards. Lecture Notes in Computer Science, Cryptographic Hardware and Embedded Systems-CHES,2006,4249:134-147.
[126]Goldwasser S, Mieali S, Raekoff C. The knowledge complexity of interactive proof-systems. In:Proc of 17th ACM Symposium on theory of computing,1985: 291-304.
[127]Syverson P F, Goldschlag D M, Reed M G. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications,1998,16(4):482-494.
[128]Camenisch J, Lysyanskaya A. A formal treatment of onion routing. In:Advances in Cryptology—CRYPTO 2005, Lecture Notes in Computer Science,2005,3621: 169-187.
[129]Goldberg I. On the security of the Tor authentication protocol. In:Proc of the Sixth Workshop on Privacy Enhancing Technologies (PET 2006), Lecture Notes in Computer Science,2006,4258:316-331.
[130]Dingledine R, Mathewson N, Syverson P. Tor:the second generation onion router. In:Proc of the 13th USENIX Security Symposium. San Diego, USA,2004:303-320.
[131]Brent R, Waters E W, Felten A S. Receiver anonymity via incomparable public Keys. In:Proc of the 10th ACM conference on Computer and communications. security.Washington D C, USA,2003:112-121.
[132]Wood A D, Stankovic J A. Denial of service in sensor networks. IEEE Computer, 2002:54-62.
[133]IEEE standard 802.15.4:Wireless medium access control (MAC) and physical layer (PHY) specifications for low-rate wireless personal area networks (LWPANs),2003.
[2]John J, Janet D.The DARPA packet radio network protocols. In:Proc of the IEEE, 1987,5(1):21-327.
[3]Sun JZ. Mobile ad hoc Networking:an essential technology for pervasive computing. In:Proc of International Conferences on Info-tech and Info-net, Beijing,2001(ICII 2001),3:316-321.
[4]IETF Working Group:Mobile Ad hoc Networks (manet). http://www.ietf. org/html.charters/manet-charter.html.
[5]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1290
[6]裴庆祺,沈玉龙,马建峰.无线传感器网络安全技术综述.通信学报.,2007,18(8)：113-122
[7]Benenson Z. An algorithmic framework for robust access control in wireless sensor networks. In:Proc of the 2nd European Workshop on Wireless Sensor Networks (EWSN). Istanbul, Turkey,2005:158-165.
[8]Kraus S, Lin R, Shavvit Y. On self-interested agents in vehicular networks with car-to-car gossiping. IEEE Transactions on Vehicular Technology.2008,57 (6): 3319-3332
[9]Sun X, Lin X, Ho P P. Secure vehicular communications based on group signature and id-based signature scheme. In:Proc of International Conference on Communications, Glasgow, Scotland,2007:1539-1545.
[10]Bishop R. A survey of intelligent vehicle applications worldwide. In:Proc of IEEE intelligent vehicles symposium 2000, Dearborn, MI, USA,2000:25-30.
[11]Partan J, Kurose J, Levine B N. A survey of practical issues in underwater networks. In:Proc of the First ACM International Workshop on Underwater Networks,2006: 17-24.
[12]Foo K, Atkins K, Collins T, et al. A routing and channel-access approach for an ad hoc underwater acoustic network. In:Proc of IEEE Oceans 2004,2:789-795.
[13]Car G A, Adams A.E. ACMENet:an underwater acoustic sensor network for real-time environmental monitoring in coastal areas. IEE Proc. Radar, Sonar, and Nav, 2006,153(4):365-380.
[14]Zhang Z S. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks overview and challenges. Communications Surveys & Tutorials, 2006,8(1):24-37.
[15]Vahdat, Becker D. Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
[16]Khaled H, Kevin A, Belding R E. Delay tolerant mobile networks (DTMNs): controlled flooding schemes in sparse mobile networks. In:Proc of the IFIP Networking. Waterloo, Canada,2005.
[17]Burns B, Brock O, MV routing and capacity building in disruption tolerant networks. In:Proc of IEEE INFOCOM 2005, Miami, FL,2005.
[18]Burns B, Brock O, Levine B N. Autonomous enhancement of disruption tolerant networks. In:Proc of IEEE International Conference on Robotics and Automation, 2006.
[19]Zhang J, Fan P. On network coding in wireless ad-hoc networks. International Journal of Ad Hoc and Ubiquitous Computing,2007,2(3):140-148.
[20]Wu Y, Chou P, Zhang Q, et al Network planning in wireless ad hoc networks:a cross-Layer approach. IEEE Journal on Selected Areas on Communications,2005, 23(1):136-150.
[21]Wu Y, Chou P, Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding.IEEE Transactions on Communications,2005,53(11): 1906-1918.
[22]Luo J, Blum R S, Cimini L J, et al. Decode-and-forward cooperative diversity with power allocation in wireless networks. IEEE Transactions on Wireless Communications,2007,6(3):793-799.
[23]Laneman J N, Wornell G W, Tse and D N. An efficient protocol for realizing cooperative diversity in wireless networks. In:Proc of IEEE ISIT, Washington, DC, 2001:294-301.
[24]Nosratinia A, Hunter T E, Hedayat A. Cooperative communication in wireless networks. IEEE Communication Magazine,2004,10:74-80.
[25]Levorato M, Tomasin S, Casari P, et al. Analysis of spatial multiplexing for cross-layer design of MIMO ad hoc networks. In:Proc of IEEE VTC-2006,2006,3: 1146-1150.
[26]Narasimhan R. Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels. IEEE Trans on Signal Processing, 2003,51(11):2829-2838.
[27]Sundaresan K, Sivalumar R, Ingram M A, et al. Medium access control in ad hoc networks with MIMO Links:optimization considerations and algorithms. IEEE Trans on Mobile Computing,2004,3(4):350-365.
[28]Joa-Ng M, Lu I T. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE on Selected Areas in Communications,1999,17(8): 1415-1425.
[29]Pei G, Gerla M, Chen T W. Fisheye state routing in mobile ad hoc networks. In:Proc of the 2000 ICDCS Workshops, Taipei, Taiwan,2000:D71-D78
[30]Haas Z J, Pearlman M R. The Zone Routing Protocol (ZRP) for ad hoc networks. IETF Internet draft,1998.
[31]Iwata A, Chiang C C, Pei G, et al. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, August 1999, p1369-p1379.
[32]Perkins C E, Bhagwat P. Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers. In:Proc of ACM Computer Communication Review, (ACM SIGCOMM'94),1994,24(4).4:234-244.
[33]Jacquet P, Muhlethaler P, Clausen T, et al. Optimized link state routing protocol for ad hoc networks. In:Proc of the IEEE Int'l Conf. on Technology for the 21st Century, Pakistan,2001:62-68.
[34]Clausen T, Jacquet P.. Optimized link state routing protocol (OLSR). IETF RFC 3626, 2003. http://www.ietf.org/rfc/rfc3626.txt
[35]Ogier R, Templin F, Lewis M. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). IETF RFC3684,2004. http://www.ietf.org/rfc/rfc3684.txt
[36]Perkins C, Belding-Royer E, Das S. Ad hoc on-demand distance vector (AODV) routing. IETF RFC 3561,2003. http://www.ietf.org/rfc/rfc3561.txt.
[37]Perkins CE, Royer EM. Ad-Hoc on-demand distance vector routing. In:Proc of IEEE Work-Shop on Mobile Computing Systems and Applications (WMCSA),1999: 90-100.
[38]Johnson DB, Maltz DA. Dynamic source routing in ad hoc wireless networks. Mobile Computing,1996:153-181
[39]Johnson DB, Maltz DA, Hu YC. The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF RFC4728,2007. http://www.ietf.org/rfc/rfc4728.txt.
[40]Chakeres I, Perkins C. Dynamic MANET on-demand (DYMO) routing. Internet Draft, draft-ietf-manet-dymo-04.txt, IETF MANET Working Group,2006. http://tools.ietf.org/html/draft-ietf-manet-dymo-04
[41]PARK V, CORSON M.A highly adaptive distributed routing algorithm for mobile wireless networks. In:Proc of IEEE Infocom'97, Kobe, Japan,1997:1405-1413.
[42]Chiang C C, Tsai T C, Liu W, et al. Routing in clustered multihop, mobile wireless networks with fading channel. In:Proc of the Next Millennium, the IEEE SICON, 1997.
[43]Iwata A, Chiang C C, Pei G, et al. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks,1999:1369-1379.
[44]Jiang M L, Li J, Tay Y C. Cluster Based Routing Protocol (CBRP), Internet draft, draft-ietf-manet-cbrp-spec-01.txt.
[45]Royer M, Perkins, C. Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing, IETF, Intermit Draft:draft-ietf-manet-maodv-OO.txt,2000.
[46]Liu M, Talpade R, McAuley A. AMRoute:Ad-hoc multicast routing protocol. Technical Report, CSHCN T. R.99-1, University of Maryland.
[47]Lee S J, Gerla M, Chiang C C. On demand multicast routing protocol. In:Proc of IEEE WCNC'99, New Orleans, USA,1999:1298-1302.
[48]杨云,徐佳,陶笔蕾,等.基于蚁群系统的分布式QoS多播路由算法.小型微型计算机系统,2007,28(12)：2142-2148.
[49]刘占军；赵为粮；李云；Ad hoc网络中基于数据流的QoS路由协议-通信学报,2004,25(12)：125-130.
[50]王海涛,郑少仁,宋丽华.Ad hoc网络中QoS保障机制的研究.通信学报,2002,23(10)：114-121.
[51]Alkaraki J N, Chang J M. Quality of service support in IEEE 802,11 wireless ad hoc networks. Ad Hoc Networks,2004:265-281.
[52]Pei G, Gerla M, Hong X. LANMAR:Landmark routing for large scale wireless ad hoc networks with group mobility. In:Proc of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC),2000:11-18.
[53]Sinha P, Sivakumar R, Bharghaven V. CEDAR:a core-extraction distributed ad hoc routing algorithm. IEEE INFOCOM,1999.
[54]Toh C K. Associativity based routing for ad hoc mobile networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems,1997:103-139.
[55]Dube R. Signal stability based adaptive routing for ad hoc mobile networks, IEEE Personal Communication,1997:36-45.
[56]Vahdat H, Becker D. Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
[57]Leguay J, Friedman T, Conan V. DTN Routing in a Mobility Pattern Space. In:Proc of the ACM SIGCOMM 2005 Workshop on delay tolerant networks, Philadelphia, PA, USA,2005.
[58]焦贤龙,王晓东,周兴铭.无线自组网中一种高效的路由协议.计算机科学与探索,2008,2(5)：478-486.
[59]GUI C, Mohapatra P. Short:self-healing and optimizing routing techniques for mobile ad hoc networks. In:Proc of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. Annapolis, MD, USA,2003:279-290.
[60]Giruka VC, Singhal M, Yarravarapu, SP. A path compression technique for on-demand ad-hoc routing protocols. In:Pro of IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Fort Lauderdale, USA,2004:144-153.
[61]Saito M, Aida H, Tobe Y, et al. A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks distributed computing systems. In:Proc of the 24th International Conference on Distributed Computing Systems (ICDCS'04). Washington, DC, USA,2004:390-397.
[62]Jiao X L, Wang X D, et al. Neighbor-aware optimizing routing in wireless ad hoc networks. Lecture Notes in Computing Science, Ubiquitous Intelligence and Computing,2007,4611:340-349.
[63]徐佳,李陟,周曜.移动Ad Hoc网络路径压缩技术研究与分析.计算机科学,2008,35(5)：73-77.
[64]Yu X, Kedem Z. A distributed adaptive cache update algorithm for the dynamic source routing protocol. In:Proc of IEEE INFOCOM,2005.
[65]Frey H, Stojmenovic I. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In:Pro of MOBICOM,2006.
[66]Spohn M, Garcia-Luna-Aceves J J. Neighborhood aware source routing. In:Proc of ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC),2001.
[67]Li X F, Cuthbert L. A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks. In:Proc of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2004.
[68]Vasudevan S, Kurose J, Towsley D. On neighbor discovery in wireless networks with directional antennas. In:Proc of IEEE INFOCOM,2005.
[69]Ahlswede R, Cai N, Li S R, et al. Network information flow. IEEE Transactions on Information Theory,2000.
[70]Li L, Ramjee R, Buddhikot M, et al. Network coding based broadcast in mobile ad hoc networks. In:Proc of INFOCOM,2007.
[71]Yang S H, Wu J, Cardei M. Efficient broadcast in MANETs using network coding and directional antennas. In:Proc of INFOCOM,2008.
[72]Zhang J Y, Cai K, Letaief K B, et al. A network coding unicast strategy for wireless multi-hop networks. In:Proc of IEEE WCNC2007, Hong Kong, China,2007.
[73] Lun D S, Medard M, Koetter R. Network coding for efficient wireless unicast. In: Proc of IEEE International Zurich Seminar on Communications, Zurich, Switzerland, 2006.
[74]Katti S, Katabi D, Hu W J, et al. The importance of being opportunistic-practical network coding for wireless environments. In:Proc of SIGCOMM,2006.
[75]Padimitratos P, Haas Z, Secure routing for mobile Ad Hoc networks. In:Proc of the SCS communication Networks and Distributed Systems Modeling And Simulation Conference, San Antonio, TX, USA,2002.
[76]Yin C H, David B. Ariadne:A secure on-demand routing protocol for ad hoc networks. In:Proc of the MobiCom2002, Atlanta, Georgia, USA,2002.
[77]Sanzgiri K, Dahill B, Levine B N. A secure routing protocol for ad hoc networks. In: Proc of 2002 IEEE International Conference on Network Protocols(ICNP),2002.
[78]El-Khatib K, Korba L, Song R, et al. Secure dynamic distributed routing algorithm for ad hoc wireless networks. In:Proc of Int'l Conf on Parallel Processing Workshops (ICPPW'03), Los Alamitos, FL, USA,2003:359-366.
[79]Song R G, Korba L, Yee G. AnonDSR:Efficient anonymous dynamic source routing for mobile ad hoc networks. In:Proc of the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05). New York, NY, USA,2005:33-42.
[80]Kong J, Hong X, Gerla M. An identity-free and on-demand routing scheme against anonymity threats in mobile ad hoc networks. IEEE Transactions on Mobile Computing,2007,6(8):387-409.
[81]Zhang Y, Liu W, Lou W. Anonymous communications in mobile ad hoc networks. In: Proc of INFOCOM,2005:1940-1951.
[82]Zhu B, Wan Z, Kankanhalli M S,et al. Anonymous secure routing in mobile ad-hoc networks. In:Proc of the 29th Annual IEEE International Conference on Local Computer Networks (LCN'04),2004:102-108.
[83]Seys S, Preneel B. Arm:Anonymous routing protocol for mobile ad hoc networks. In: Proc of the 20th IEEE Int'l Conf on Advanced Information Networking and Applications.(AINA 2006). Washington:IEEE Computer Society,2006:133-137
[84]Sy D, Chen R, Bao L. ODAR:On-demand anonymous routing in ad hoc network s. In: Proc of MASS,2006.
[85]Dingledine R, Mathewson N, Syverson P. Tor:the second generation onion router. In: Proc of the 13th USENIX Security Symposium. San Diego, USA,2004:303-320.
[86]Brickell E, Camenisch J, Chen L. Direct anonymous attestation. In:Proc of the 11th ACM Conference on Computer and Communication Security, Washington, USA, 2004:132-145.
[87]Kim Y, Helmy Y. SWAT:small world-based attacker traceback in Ad-hoc networks. In:Proc of IEEE InfocomPoster/Demo Session (INFOCOM'05), Miami, FL, USA, 2005.
[88]Snoeren A C, Partridge C, Sanchez L A, et al. Hash-based IP traceback. In:Proc of ACM SIGCOMM,2001:3-14.
[89]Sy D, Bao L. CAPTRA:coordinated packet traceback. In:Proc of the Fifth International Conference on Information Processing in Sensor Networks (IPSN),2006; 152-159.
[90]Thing V L L, Lee H C, Sloman M, et al. Enhanced ICMP traceback with cumulative path. In:Proc of the 61st IEEE Vehicular Technology Conference (VTC'05), Stockholm, Sweden, May-June 2005,4:2415-2419.
[91]Bellovin S M. ICMP traceback messages. Internet Draft:draftietf-itrace-04.txt,2003.
[92]Lee H C, Thing V L L, Xu L, et al. ICMP traceback with cumulative path:an efficient solution for IP traceback. In:Proc of the 5th International Conference on Information and Communications Security (ICICS'03), Huhehaote, China,2003:124-135.
[93]Cheng B C, Chen H, Tseng R H. A packet marking with fair probability distribution function for minimizing the convergence time in wireless sensor networks. Computer Communications,2008,31(12):4352-4359.
[94]Jin X, Zhang Y, Pan Y, Zhou. Y. ZSBT:a novel algorithm for tracing DoS attackers in MANETs. EURASIP Journal on Wireless Communications and Networking 2006, 9:84-90.
[95]Cheng B C, Chen H, Liao G T.A novel marking probability distribution using probability propagation in hierarchical WSN. In:Proc of the 4th International Conference on Information Security and Cryptology (Inscrypt 2008),2008.
[96]Savage S, Wetherall D. Network support for IP traceback. IEEE/ACM Transactions on Networking,2001,9(3):226-237.
[97]Song D, Perrig A. Advanced and authenticated marking schemes for IP traceback. In: Proc of the IEEE INFOCOM, Anchorage, Alaska USA,2001,2:878-886
[98]Peng T, CLeckie D, Kotagiri R. Adjusted probabilistic packet marking for IP traceback. In:Proc of the Second IFIP Networking Conference (Networking 2002) Pisa, Italy,2002:697-708.
[99]Cheng B C, Chen H, Liao G T. FBT:an efficient traceback scheme in hierarchical wireless sensor network. Security and Communication Networks,2009,2:133-144
[100]Xu J, Wang Y L,Li F Y, et al A stability module of path compression techniques for on-demand ad-hoc routing protocols. In:Proc of ISBIM,2008:83-88.
[101]McDonald A B, Znati T F, A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, 1999,17(8):1466-1487.
[102]JiST user guide and SWANS user guide, http://jist.ece.conell.edu/docs.html
[103]蔡一兵,李海波,李忠诚,等.移动自组网基于邻居变化率稳定路径选择方法.软件学报,2007,18(3)：681：692
[104]Seada K, Westphal C, Perkins C. Analyzing path accumulation for route discovery in ad hoc networks. In:Proc of Wireless Communications and Networking Conference, IEEE,2007:4377-4382.
[105]Sengupta S, Rayanchu S, Banerjee S. An Analysis of wireless network coding for unicast sessions:The case for coding-aware routing. In:Proc of IEEE INFOCOM'07, 2007:1028-1036.
[106]Chaum D L. The dining cryptographers problem:unconditional sender and recipient untraceability. Journal of Cryptology,1988,1(1):65-75.
[107]Chaum D L. Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM,1981,24(2):84-88.
[108]Jerichow A, Muller J, Pfitzmann A, et al. Real-time MIXes:a bandwidth-efficient anonymity protocol. IEEE Journal of Selected Areas Communication,1998,16(4): 124-128.
[109]Kesdogan D, Egner J, Buschkes R. Stop-and-Go MIXes:providing probabilistic security in an open system. In:Proc of the Second Int'l Workshop Information Hiding (IH'98),1998:83-98.
[110]Pfitzmann A, Pfitzmann B, Waidner M, ISDNMixes:untraceable communication with very small bandwidth overhead. In:Proc of GI/ITG Conf Comm. Distributed Systems,1991:451-463.
[111]Reiter M K, Rubin A D. Crowds:anonymity for web transactions. ACM Transaction of Information and System Security,1998,1(1):66-92.
[112]Rackoff C, Simon D R. Cryptographic defense against traffic analysis. In:Proc. Of Symp Theory of Computation (STOC'93),1993:672-681.
[113]Dai W. PipeNet 1.1. http://www.eskimo.com/-weidai/pipenet.txt,1996.
[114]Al-Muhtadi J, Campbell R, Kapadia A, et al. Routing through the Mist:privacy preserving communication in ubiquitous computing environments. In:Proc of IEEE Int'l Conf on Distributed Computing Systems (ICDCS'02),2002:65-74.
[115]Jiang S, Vaidya N, Zhao W. A MIX route algorithm for Mix-net in wireless ad hoc networks. In:Proc of IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS'04),2004.
[116]Niculescu D, Nath B. Ad hoc positioning system (APS). In:Proc of IEEE Global Telecomm. Conf. (GLOBECOM'01),2001.
[117]Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In Proc of the CRYPTO 01, Springer-Verlag,2001. LNCS 2139:213-229.
[118]Barreto P, Kim H Y, Scott L B. Efficient algorithms for pairing-based cryptosystems. In:Proc of CRYPTO 02,2002:354-368.
[119]田野,张玉军,李忠诚.使用对技术的基于身份密码学研究综述.计算机研究与发展,2006,43(10)：1810-1819.
[120]Joux A, Nguyen K. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003, http://eprint.iacr.org/2001/003/.
[121]Hu Y C, Perrig A, Johnson D B. Packet Leashes:A defense against wormhole attacks in wireless networks. In:Proc of INFOCOM'03. Los Angeles, California, USA,2003.
[122]Kong J, Hong X Y, Gerla M. Modeling ad-hoc rushing attack in a negligibility-based security framework. In:Proc of WiSe'06, Los Angeles, California, USA,2006: 55-64.
[123]Cressie N. Statistics for Spatial Data. John Wiley and Sons,1993.
[124]Paulo S L, Barreto M. Efficient implementation of pairing-based cryptosystems. Journal of Cryptology,2004,17:321-334
[125]Scott M, Costigan N, Abdulwahab W. Implementing cryptographic pairings on smartcards. Lecture Notes in Computer Science, Cryptographic Hardware and Embedded Systems-CHES,2006,4249:134-147.
[126]Goldwasser S, Mieali S, Raekoff C. The knowledge complexity of interactive proof-systems. In:Proc of 17th ACM Symposium on theory of computing,1985: 291-304.
[127]Syverson P F, Goldschlag D M, Reed M G. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications,1998,16(4):482-494.
[128]Camenisch J, Lysyanskaya A. A formal treatment of onion routing. In:Advances in Cryptology—CRYPTO 2005, Lecture Notes in Computer Science,2005,3621: 169-187.
[129]Goldberg I. On the security of the Tor authentication protocol. In:Proc of the Sixth Workshop on Privacy Enhancing Technologies (PET 2006), Lecture Notes in Computer Science,2006,4258:316-331.
[130]Dingledine R, Mathewson N, Syverson P. Tor:the second generation onion router. In:Proc of the 13th USENIX Security Symposium. San Diego, USA,2004:303-320.
[131]Brent R, Waters E W, Felten A S. Receiver anonymity via incomparable public Keys. In:Proc of the 10th ACM conference on Computer and communications. security.Washington D C, USA,2003:112-121.
[132]Wood A D, Stankovic J A. Denial of service in sensor networks. IEEE Computer, 2002:54-62.
[133]IEEE standard 802.15.4:Wireless medium access control (MAC) and physical layer (PHY) specifications for low-rate wireless personal area networks (LWPANs),2003.