无线自组织网络保护路由及其关键技术研究
|
摘要
无线自组织网络是一种完全对等的网络通信系统,由具有收发功能的通信终端组成,通过采用相应的MAC协议和路由协议能够在不依赖网络设施的情况下迅速展开,实现通信终端间无线多跳的数据传输。部署的灵活性、网络的自管理性使得其能被广泛的应用于战场通信、紧急救灾通信、车载通信和公共场合临时通信等领域。由于无线自组织网络是完全自治的系统,路由功能需通过部署在节点的路由协议来完成,节点移动和节点行为不受任何外界因素的支配,导致网络变化频繁,势必造成通信链路中断经常发生；此外,节点资源的有限性制约了其缓存网络信息的能力,因此,获得必要的网络信息并基于这些信息设计高效的机制来保证网络运行性能成为了该领域研究的热点。
本文在总结无线自组织网络路由关键问题的基础上,针对保护路由的设计展开了研究,在网络边界信息获取方法和分布式保护路由设计方面取得了较好的成果,主要成果可以分为以下五个方面：
(1)从搜索论的角度,以信息为主线总结了无线自组织网络路由设计中的关键问题。通过对无线自组织网络路由开展深入的研究,分析了目前路由机制中源节点建立路由过程中所依赖的目的节点信息,并对这些信息进行了分类；在分析这些信息对路由机制效率和网络运行性能影响的基础上,总结了无线自组织网络路由机制设计中应重点关注的关键因素,确定了网络边界值是影响被动式路由机制效率和性能的最重要因素之一。
(2)针对网络边界值的确定问题,从节点连接关系角度定义了网络的边界,考虑日益广泛应用的多信道通信模式,提出了多信道确定网络边界值的搜索模型。为满足探询分组容量受信道容量影响规模受限的要求,重点研究了利用容量受限探询分组确定网络边界值的模型,证明了该情况下假设网络边界值上限已知与否对应相同的最优搜索算法,设计了一种能精确确定网络边界值、且所需平均探询次数最少的搜索算法,并从理论上给出了严格证明。
(3)基于确定网络边界值的通用模型,为适应信息传输不可靠的无线信道,考虑了搜索反馈信息可能出现错误情况下确定网络边界值的问题,建立了基于探测分组受限的容错搜索模型,针对假设探询过程中所有反馈中至多出现1次错误的特殊情况,设计了最坏情形下探询次数最少的容错搜索算法,并从理论上给出了严格证明。
(4)针对无线自组织网络分布式的特点,为提高终端节点对自身存储信息的利用效率,建立了依据终端节点所拥有信息对节点进行分类的方法；通过把节点分为主活动节点、活动节点、备份节点和一般节点,明确了各类节点在路由机制中可行的行为及各类型节点间的转化关系,方便了路径建立和维护；基于上述性质,从关键路径选取、备份节点设定、路径失效处理等方面给出了基于多关键路径的保护路由机制MKRP。
(5)此外,为更好地了解无线自组织网络的运行机制及其相关关键问题,在深入研究路由机制关键问题的基础上,基于商业路由器、嵌入式开发板及x86主机建立了无线自组织网络综合测试平台QoS-WADN,并对本文所设计的算法进行了测试与分析。
An ad hoc wireless network is a complete autonomous system that consists ofdevices with transmitter and receiver. Recently, Ad hoc wireless networks have beenextensively applied in battle field communication, emergency communication and ve-hicle communication etc. However, nodal mobility lead to that the network topologychanges rapidly and unpredictably over time, and which has became an essential fea-ture considered for designing an efcient network. On the other hand, nodes lack suf-cient power restricts their ability to obtain and maintain sufcient network information.Therefore study on mechanisms to enhance network performance with limited networkinformation becomes one of the hottest direction in this field.
Without information about the destination, a route discovery involving expensivenetwork-wide flooding is typically used by reactive routing protocols. Through in-depth studying routing protocols in ad hoc wireless networks, we determine criticalreasons causing broadcast storm when finding routes to the destination and prove thatthe diameter of the network is one of the most fundamental factors. In this article, wepropose a search model of determine the value of network diameter and obtain severaloptimal algorithms. To enhance robustness of routing, we introduce protection routingfor ad hoc wireless networks and obtain a distributed protection routing protocol, sayMKRP (Multiple Key-Routes Protection routing). In detail, the main contributionsinclude the follows.
(1) We conclude several critical problems for designing routing protocols. Therouting protocols are modeled with search processes, we model routing protocol withsearch processes and classify information it used as position, direction and distance etc.Through comparing these information’s roles in protocols, we sort their importance andfilters the most critical factors.
(2) We propose a method to search the upper boundary of the network diame-ter. With the group testing model, we obtain a method to determine exact value of a network’s diameter. To fit the limitation of resource of nodes, we propose a modelof search with small sets through restricting the above model with limited query vol-ume, and design an algorithm with minimum average queries and prove its optimalitytheoretically.
(3) We propose a method to determine the exact value of network diameter eventhough there exists at most feedback fault during whole search process. To fit the un-reliability of wireless channel, based on the general search with small sets, we presenta search with lies and small sets model to design fault tolerant strategies of computingthe networks’diameter. For the case of allowing at most one lie is allowed, we obtaina worst-case optimal algorithm and prove it theoretically.
(4) We propose a distributed protection routing MKRP (Multiple Key Routesbased Protection routing). All nodes are classified into primary active nodes, activenodes, backup nodes and normal nodes, according to the information stored in them,and their transfer relationship is defined. Based on the above techniques we obtain andistributed protection routing including node-disjoint key paths discovery, secondarypaths selection, failure maintenance and routing table discard, say MKRP, and its cor-rectness and performance is verified theoretically and experimentally.
Besides, we develop a comprehensive performance evaluation test-bed Qos WADN with commercial routing devices, embedded boards and computer servers andverify our designed algorithms such as MKRP in this dissertation.
本文在总结无线自组织网络路由关键问题的基础上,针对保护路由的设计展开了研究,在网络边界信息获取方法和分布式保护路由设计方面取得了较好的成果,主要成果可以分为以下五个方面：
(1)从搜索论的角度,以信息为主线总结了无线自组织网络路由设计中的关键问题。通过对无线自组织网络路由开展深入的研究,分析了目前路由机制中源节点建立路由过程中所依赖的目的节点信息,并对这些信息进行了分类；在分析这些信息对路由机制效率和网络运行性能影响的基础上,总结了无线自组织网络路由机制设计中应重点关注的关键因素,确定了网络边界值是影响被动式路由机制效率和性能的最重要因素之一。
(2)针对网络边界值的确定问题,从节点连接关系角度定义了网络的边界,考虑日益广泛应用的多信道通信模式,提出了多信道确定网络边界值的搜索模型。为满足探询分组容量受信道容量影响规模受限的要求,重点研究了利用容量受限探询分组确定网络边界值的模型,证明了该情况下假设网络边界值上限已知与否对应相同的最优搜索算法,设计了一种能精确确定网络边界值、且所需平均探询次数最少的搜索算法,并从理论上给出了严格证明。
(3)基于确定网络边界值的通用模型,为适应信息传输不可靠的无线信道,考虑了搜索反馈信息可能出现错误情况下确定网络边界值的问题,建立了基于探测分组受限的容错搜索模型,针对假设探询过程中所有反馈中至多出现1次错误的特殊情况,设计了最坏情形下探询次数最少的容错搜索算法,并从理论上给出了严格证明。
(4)针对无线自组织网络分布式的特点,为提高终端节点对自身存储信息的利用效率,建立了依据终端节点所拥有信息对节点进行分类的方法；通过把节点分为主活动节点、活动节点、备份节点和一般节点,明确了各类节点在路由机制中可行的行为及各类型节点间的转化关系,方便了路径建立和维护；基于上述性质,从关键路径选取、备份节点设定、路径失效处理等方面给出了基于多关键路径的保护路由机制MKRP。
(5)此外,为更好地了解无线自组织网络的运行机制及其相关关键问题,在深入研究路由机制关键问题的基础上,基于商业路由器、嵌入式开发板及x86主机建立了无线自组织网络综合测试平台QoS-WADN,并对本文所设计的算法进行了测试与分析。
An ad hoc wireless network is a complete autonomous system that consists ofdevices with transmitter and receiver. Recently, Ad hoc wireless networks have beenextensively applied in battle field communication, emergency communication and ve-hicle communication etc. However, nodal mobility lead to that the network topologychanges rapidly and unpredictably over time, and which has became an essential fea-ture considered for designing an efcient network. On the other hand, nodes lack suf-cient power restricts their ability to obtain and maintain sufcient network information.Therefore study on mechanisms to enhance network performance with limited networkinformation becomes one of the hottest direction in this field.
Without information about the destination, a route discovery involving expensivenetwork-wide flooding is typically used by reactive routing protocols. Through in-depth studying routing protocols in ad hoc wireless networks, we determine criticalreasons causing broadcast storm when finding routes to the destination and prove thatthe diameter of the network is one of the most fundamental factors. In this article, wepropose a search model of determine the value of network diameter and obtain severaloptimal algorithms. To enhance robustness of routing, we introduce protection routingfor ad hoc wireless networks and obtain a distributed protection routing protocol, sayMKRP (Multiple Key-Routes Protection routing). In detail, the main contributionsinclude the follows.
(1) We conclude several critical problems for designing routing protocols. Therouting protocols are modeled with search processes, we model routing protocol withsearch processes and classify information it used as position, direction and distance etc.Through comparing these information’s roles in protocols, we sort their importance andfilters the most critical factors.
(2) We propose a method to search the upper boundary of the network diame-ter. With the group testing model, we obtain a method to determine exact value of a network’s diameter. To fit the limitation of resource of nodes, we propose a modelof search with small sets through restricting the above model with limited query vol-ume, and design an algorithm with minimum average queries and prove its optimalitytheoretically.
(3) We propose a method to determine the exact value of network diameter eventhough there exists at most feedback fault during whole search process. To fit the un-reliability of wireless channel, based on the general search with small sets, we presenta search with lies and small sets model to design fault tolerant strategies of computingthe networks’diameter. For the case of allowing at most one lie is allowed, we obtaina worst-case optimal algorithm and prove it theoretically.
(4) We propose a distributed protection routing MKRP (Multiple Key Routesbased Protection routing). All nodes are classified into primary active nodes, activenodes, backup nodes and normal nodes, according to the information stored in them,and their transfer relationship is defined. Based on the above techniques we obtain andistributed protection routing including node-disjoint key paths discovery, secondarypaths selection, failure maintenance and routing table discard, say MKRP, and its cor-rectness and performance is verified theoretically and experimentally.
Besides, we develop a comprehensive performance evaluation test-bed Qos WADN with commercial routing devices, embedded boards and computer servers andverify our designed algorithms such as MKRP in this dissertation.
引文
[1]Murthy C S R, Manoj B S. Ad Hoc wireless networks:architectures and protocols[M]. Prentice Hall PTR,2004.[2]Bruno R, Conti M, Gregori E. Mesh networks:commodity multihop ad hoc networks[J]. IEEE Communications Magazine,2005,43(3):123-131.[3]任丰原,黄海宁,林闯.无线传感器网络[J].电子学报,2003,14(7)：1282-1291.[4]涂序彦.大系统控制论[M].国防工业出版社,北京.[5]Clark D D. The design philosophy of the DARPA Internet Protocols[J]. SIGCOMM Com-put. Commun. Rev.,1995,25:102-111.[6]"DARPA HOME PAGE". http://www.darpa.mil.[7]Kahn R E, Gronemeyer S A, Burchfiel J, et al. Advances in packet ratio technology [J]. IEEE JPROC,1978,66(11):1468-1496.[8]Toh C K. Ad hoc mobile wireless networks:protocols and systems[M]. Prentice Hall PTR, 2002.[9]Basagni S, Conti M, Giordano S, et al. Mobile Ad Hoc Networking[M]. Wiley-IEEE Press, 2004.[10]Lee S J. Routing and Multicasting strategies in wireless mobile Ad hoc networks[D]. Uni-versity of California Los Angeles,2000.[11]徐佳.移动Ad Hoc网络路由研究[D].南京理工大学,2010.[12]刘刚.移动自组织网络路由关键技术研究[D].哈尔滨工业大学,2010.[13]吴磊.无线自组织网络中的路由技术相关问题研究[D].电子科技大学,2010.[14]Raju J. Routing strategies in Ad-hoc wireless networks [D]. University of California Santa Cruz,2002.[15]Corson S, Macker J. Mobile Ad hoc Networking (MANET):Routing Protocol Performance Issues and Evaluation Considerations. IETF RFC 2501 1999.[16]Guang L, Assi C, Benslimane A. MAC layer misbehavior in wireless networks:challenges and solutions[J]. IEEE Wireless Communication,2008,15(4):6-14.[17]Tobagi F, Kleinrock L. Packet Switching in Radio Channels:Part II-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution[J]. IEEE Transac-tions on Communications,1975,23(12):1417-1433.[18]Karn P. MACA-a new channel access method for packet radio[C]. Proceedings of ARRL-CRRL Amateur radio 9th computer networking conference, volume 140,1990.1-5.[19]Bharghavan V, Demers A, Shenker S, et al. MACAW:a media access protocol for wireless LAN's[J]. SIGCOMM Comput. Commun. Rev.,1994,24:212-225.[20]Garcia-Luna-Aceves J J, Fullmer C L. Floor acquisition multiple access (FAMA) in single-channel wireless networks[J]. Mob. Netw. Appl.,1999,4:157-174.[21]Wu C, Li V. Receiver-initiated busy-tone multiple access in packet radio networks [J]. SIG-COMM Comput. Commun. Rev.,1987,17:336-342.[22]崔勇,张鹏.无线移动互联网：原理、技术与应用[M].机械工业出版社,北京,2004.[23]Basagni S, Conti M, Giordano S, et al. EnergyEfficient Communication in AD HOC Wire-less Networks. Proceedings of Mobile Ad Hoc Networking. IEEE,:301-327.[24]Albiero F, Fitzek F H P, Katz M. Cooperative Power Saving Strategies in Wireless Networks: an Agent-based Model[C]. Proceedings of 4th Int. Symp. Wireless Communication Systems ISWCS 2007,2007.287-291.[25]Das S, Papagiannaki K, Banerjee S, et al. SWARM:The Power of Structure in Community Wireless Mesh Networks [J]. IEEE/ACM Transactions on Networking,2011,19(3):760-773.[26]Kibilda J, Kandeepan S, Piesiewicz R. Novel Cluster Formation Framework for Energy Ef-ficient Short-Range Cooperative Strategies [C]. Proceedings of IEEE 73rd Vehicular Tech-nology Conf. (VTC Spring),2011.1-5.[27]Yan H, Maltz D A, Ng T S E, et al. Tesseract:A 4D network control plane [C]. Proceedings of NSDI,2007.[28]Jurdak R, Lopes C V, Baldi P. A survey, classification and comparative analysis of medium access control protocols for ad hoc networks [J]. IEEE Communications Surveys & Tutorials, 2004,6(1):2-16.[29]Booysen M J, Zeadally S, Rooyen G J. Survey of media access control protocols for vehic-ular ad hoc networks[J]. IET Communications,2011,5(11):1619-1631.[30]Kravets R, Krishnan P. Application-driven power management for mobile communica-tion[J]. Wirel. Netw.,2000,6:263-277.[31]Pei G Y, Gerla M, Chen T W. Fisheye state routing:a routing scheme for ad hoc wireless networks [C]. Proceedings of IEEE Int. Conf. Communications, ICC 2000, volume 1,2000. 70-74.[32]Haas Z J, Pearlman M R. The performance of query control schemes for the zone routing protocol[J]. IEEE/ACM Transactions on Networking,2001,9(4):427-438.[33]Perkins C, Bhagwat P. Highly destination sequenced distance vector routing for mobile ad hoc networks[J]. ACM Sigcomm'94,1994..[34]Perkins C, Belding-Royer E, Das S. Ad hoc on-demand distance vector (AODV) routing, IETF RFC 3561.[35]Johnson D, Hu Y, Maltz D. The dynamic source routing (DSR) for mobile Ad hoc networks for IPv4, IETF RFC 4728.[36]Marina M K, Das S R. On-demand multipath distance vector routing in Ad hoc networks[C]. Proceedings of ICNP,2001.[37]Loseri V, De Rango F, Marano S. A correction for ad hoc on demand multipath distance vec-tor routing protocol (AOMDV)[C]. Proceedings of VTC-2005-Fall Vehicular Technology Conf.2005 IEEE 62nd, volume 4,2005.2775-2779.[38]Lee S J, Gerla M. AODV-BR:backup routing in ad hoc networks[C]. Proceedings of WCNC Wireless Communications and Networking Confernce 2000 IEEE, volume 3,2000. 1311-1316.[39]Park V D, Corson M S. A highly adaptive distributed routing algorithm for mobile wireless networks [C]. Proceedings of IEEE Sixteenth Annual Joint Conf. of the IEEE Computer and Communications Societies INFOCOM'97, volume 3,1997.1405-1413.[40]Clausen T, Jacquet E. Optimized Link State Routing Protocol (OLSR), IETF RFC 3626. 2006.[41]Ogier R, Lewis M, Templin F, et al. Topology Broadcast based on Reverse-Path Forwarding (TBRPF), IETF Internet Draft 2006.[42]Chiang C C, Wu H K, Liu W, et al. Routing in clustered multihop, mobile wireless networks with fading channel[C]. Proceedings of Wireless Networks, volume 97. Citeseer,1997. 197-211.[43]Iwata A, Chiang C C, Pei G, et al. Scalable Routing Strategies for Ad Hoc Wireless Net-works [J]. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks.,1999.1369-1379.[44]Johnson D B. Routing in Ad Hoc Networks of Mobile Hosts [C]. Proceedings of IEEE Workshop on Mobile Computing Systems and Applications,158-163,1994.[45]Murthy S, Garcia-Luna-Aceves J J. An efficient routing protocol for wireless networks [J]. Mobile Networks and Applications,1996,1(2):183-197.[46]Toh C K. Associativity-Based Routing for Ad Hoc Mobile Networks[J]. Wirel. Pers. Com-mun.,1997,4:103-139.[47]Chakeres I D, Perkins C E. Dynamic MANET On-demand Routing Protocol. IETF Internet Draft, draft-ietf-manet-dymo-12.txt,2008.[48]Ni S Y, Tseng Y C, Hen Y S V, et al. The boradcast storm problem in mobile ad-hoc networks [C]. Proceedings of Proceedings of Mobicom,2001.[49]DabideenJ S, Garcia-Luna-Aceves J J. An efficient routing in MANET using ordered walk-s[J]. Wireless networks,2011,17 (4):1095-1112.[50]Frischknecht S, Holzer S, Wattenhofer R. Networks cannot compute their diameter in sub-linear time[C]. Proceedings of Proceedings of the Twenty-Third Annual ACM-SIAM Sym-posium on Discrete Algorithms (SODA'12),2012.[51]Shand M, Bryant S. IP fast reroute framework, IETF 5714,2010.[52]林闯,王元卓,单志广,等.网格服务可管理性模型及策略研究[J].计算机学报,2008,31(10)：1716-1726.[53]Feamster N, Balakrishnan H, Rexford J, et al. The case for separating routing from router-s[C]. Proceedings of ACM SIGCOMM FDNA Workshop,2004.[54]Greenberg A, Hjalmtysson G, Maltz D A, et al. A clean slate 4D approach to network control and management[J]. Comput. Commun. Rev,2005,35 (5):41-54.
[55] Kwong K W, Gao L, Guerin R, et al. On the Feasibility and Efcacy of Protection Routingin IP Networks[J]. IEEE/ACM Transaction on Networking, 2011, 19(5):1543–1556.
[56] Racherla V. Algorithms for routing and rerouting in mobile wireless and ad-hoc network-s[D]. University of Oklahoma, 1999.
[57] Zang H, Ou C, Mukherjee B. Path-protection routing and wavelength assignment (RWA) inWDM mesh networks under duct-layer constraints[J]. IEEE Trans. NET, 2003, 11(2):248–258.
[58] Peterson H, Sen S, Chandrashekar J, et al. Message-efcient dissemination for loop-freecentralized routing[J]. Comput. Commun. Rev., 2008, 38 ( 3):63 74.
[59] Kwong K W, Gao L X, Guerin R, et al. On the Feasibility and Efcacy of Protection Routingin IP Networks[C]. Proceedings of IEEE INFOCOM, 2010. 1–9.
[60] Atlas A, Zinin A. Basic specification for IP fast reroute: Loopfree alternates, IETF RFC5286, Sep. 2008..
[61] Reichert C, Magedanz T. Topology requirements for resilient IP networks[C]. Proceedingsof 12th GI/ITG Conf. on Meas., Mod. & Eval. of Comp. & Comm. Sys, 2004.
[62] Reichert C, Glickmann Y, Magedanz T. Two routing algorithms for failure protection in IPnetworks[C]. Proceedings of ISCC, 2005.
[63] Ray S, Gu erin R, Kwong K W, et al. Always acyclic distributed path computation[J].IEEE/ACM Transactions on Networking, 2009, 18 (1):307 319.
[64] Ohara Y, Imahori S, Meter R V. MARA: Maximum alternative routing algorithm[C]. Pro-ceedings of IEEE INFOCOM, 2009.
[65] Cicic T, Hansen A, Kvalbein A, et al. Relaxed multiple routing configurations: IP fast reroutefor single and correlated failures[J]. IEEE Trans. Netw. Service Manage, 2009, 6(1):1 14.
[66] Kvalbein A, Hansen A F, Cicic T, et al. Multiple Routing Configurations for Fast IP NetworkRecovery[J]. IEEE/ACM Transaction on Networking, 2009, 17(2):473–486.
[67] Lakshminarayanan K, Caesar M, Rangan M, et al. Achieving convergence-free routingusing failure-carrying packets[C]. Proceedings of ACM SIGCOMM, 2007.
[68] Menth M, Hartmann M, Martin R, et al. Loopfree alternates and not-via addresses: A propercombination for IP fast reroute[J]. Comput. Netw., 2010, 54(8):1300 1315.
[69] Shand M, Bryant S, Previdi S. IP fast reroute using NotVia addresses, Internet draft(work in progress), Jul. 2009..
[70] Zhong Z, Nelakuditi S, Yu Y, et al. Failure inferencing based fast rerouting for handlingtransient link and node failures[C]. Proceedings of IEEE INFOCOM, 2005.
[71] Lai W K, Hsiao S Y, Lin Y C. Adaptive backup routing for ad-hoc networks[J]. Comput.Commun., 2007, 30:453–464.
[72] Li X, Cuthbert L. On-demand node-disjoint multipath routing in wireless ad hoc network-s[C]. Proceedings of 29th Annual IEEE Int Local Computer Networks Conf, 2004. 419–420.[73]Li X, Cuthbert L. Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks[C]. Proceedings of IEEE Computer Society's 12th Annual Int. Symp. Model-ing, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS 2004),2004.184-191.[74]Yang C C, Tseng L P. Fisheye zone routing protocol for mobile ad hoc networks [C]. Pro-ceedings of CCNC Consumer Communications and Networking Conf.2005 Second IEEE, 2005.1-6.[75]Johnson D B, Maltz D A. Mobile Computing[M]. Kluwer Academic Publishers,1996: 153-181.[76]Marina M K, Das S R. Ad hoc on-demand multipath distance vector routing[C]. Proceedings of Wireless Communications and Mobile Computing.969-988.[77]Cidon I, Rom R, Shavitt Y. Analysis of Multi-Path Routing[J]. IEEE/ACM Transactions on Networking,1999,7(6):885-896.[78]Leon-Garcia A, Widjaja I. Communication networks, Fundamental Concepts and Key Ar-chitectures [M]. McGraw-Hill Higher Education, Singapore, International Editions,2000.[79]Feeney L M, Nilsson M. Investigating the energy consumption of a wireless network in-terface in an ad hoc networking environment[C]. Proceedings of Infocom,3:1548-1557, 2001.[80]林闯,单志广,任丰原.计算机网络的服务质量(QoS)[M].清华大学出版社,北京,2004.[81]Ni S Y, Tseng Y C, Chen Y S, et al. The Broadcast Storm Problem in a Mobile Ad hoc Network[C]. Proceedings of Mobicom 1999 Seattle Washington USA,1999.[82]Wesel E K. Wireless Multimedia Communications:Networking Video, Voice, and Data[M]. Addison-Wesley, One Jacob Way, Reading, Massachusetts 01867 USA,1998.[83]Jiang M, Li J, Tay Y C. Cluster based routing protocol (CBRP) functional specification,[J]. Internet Draft,1998..[84]Chang N, Liu M. Revisiting the TTL-based controlled flooding search:optimality and ran-domization[C]. Proceedings of Proceedings of the 10th annual international conference on Mobile computing and networking, New York, NY, USA:ACM,2004.85-99.[85]Knuth D E. The art of computer programming, Vol 3:Sorting and searching (Second Edi-tion)[M]. Reading, Massachusetts:Addison-Wesley,1998.[86]Baryshnikov Y, Coffman E, Jelenkovic P, et al. Flood search under the California Split rule[J]. Operations Research Letters,2004,32:199-206.[87]Chang N B, Liu M Y Optimal controlled flooding search in a large wireless network[C]. Proceedings of Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless networks (WiOpt'05), Riva Del Garda. Italy,229-237,2005.[88]Chang N B, Liu M Y Controlled flooding search in a large network[J]. IEEE/ACM Trans-actions on Networking,2007,15(1):436-449.[89]OHKatona G. Finding at least one excellent element in two rounds[J]. Journal of Statistical Planning and Inference,2011,141:2946-2952.
[90] Fekete S P, Kaufmann M, Kroller A, et al. A new approach for boundary recognition ingeometric sensor networks[C]. Proceedings of 17th Canadian Conference on ComputationalGeometry, 2005.
[91] Kroller A, Fekete S P, DPfisterer, et al. Deterministic boundary recognition and topologyextraction for large sensor networks[C]. Proceedings of ACM SODA’06, 2006.
[92] Wang Y, Gao J, Mitchell J S. Boundary recognition in sensor networks by topologicalmethods[C]. Proceedings of ACM MobiCom’06, 2006.
[93] Dong D Z, Li M, Liu Y H, et al. Fine-grained boundary recognition in Wireless Ad Hoc andSensor Networks By topological Methods[C]. Proceedings of ACM Mobihoc’09, 2009.
[94] Spira P M, pan A. On finding and updating spanning trees and shortest paths[J]. SIAMJournal on computing, 1975, 4(3):375–380.
[95] Floyd R W. Algorithm 97: Shortest path[J]. Comm. ACM, 1962., 5:345.
[96] Coppersmith D, Winograd S. Matrix multiplication via arithmetic progressions[J]. J. Sym-bolic Comput, 1990, 9:251–280.
[97] Takaoka T. Shortest path algorithms for nearly acyclic directed graphs[J]. TheoreticalComputer Science, 1998, 203:143–150.
[98] Tanenbaum A S. [M].èù, , 2004.
[99] Aigner M. Combinatorial Search[M]. Wiley-Teuber, New York, 1988.
[100] Du D, Hwang F. Combinatorial Group Testing and its Applications, 2nd Ed[M]. WorldScientific, Singapore, 2000.
[101] Baranyai Z. On a search problem of GO H Katona[C]. In: Baranyai Z, (eds.). Proceedingsof Combinatorics . Coll. Soc. Janos Bolyai 18, 1978, North-holland., volume 1, Proceedingsof the 5th Hungarian Coll., Keszthely, 1976. 61–76.
[102] Katona G. On separating systems of a finite set[J]. J. Combin. Theory, 1966, 1:174–194.
[103] Wegener I. On separating systems whose elements are sets of at most k elements[J]. DiscreteMath, 1979, 28:219–222.
[104] Luzgin V N. Separation systems of partitions of a finite set Combinatorial Analysis[J].Moskov. Gos Univ., Moscow, 1980, 5:39–45.
[105] Katona G. Search with small sets in presence of a liar[J]. J. Statist. Plann. Inference, 2002,100:319–336.
[106] Liu W A, Ma H Y. Minimal average cost of searching for a counterfeit coin: Restrictedmodel[J]. Discrete Appl. Math., 2006, 154(14):1996–2009.
[107] Ko Y B, HVaidya N. Lacation aided routing (LAR) in mobile ad hoc networks[J]. Wirelessnetworks, 2000, 6:307–321.
[108] Das S M, Pucha H, Hu Y. Performance comparison of scalable location services for geo-graphic Ad hoc Routing[C]. Proceedings of IEEE INFOCOM, 2005.
[109] Koutsonikolas D, Das S, Pucha H, et al. On optimal TTL sequence-based route discov-ery in MANETs[C]. Proceedings of The 2nd International Workshop on Wireless Ad Hoc[110]Pettie S, Ramachandran V. An optimal minimum spanning tree algorithm[J]. Journal of Association for Computing Machinery,2002,49(1):16-34.[111]Pettie S, Ramachandran V. Minimizing randomness in minimum spanning tree, parallel connectivity and set maximal algorithms [C]. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA'02),2002.[112]Papadimitratos P, Poturalski M, Schaller P, et al. Secure neighborhood discovery:a funda-mental element for mobile ad hoc networking[J]. IEEE Communication Magazine,2008, 46(2):132-139.[113]周炯槃,庞沁华,续大我,等.通信原理[M].北京邮电大学出版社,北京.[114]Ulam S M. Adventures of a Mathematician[M]. Scribner's, New York,1976.[115]Hill R. Searching with lies[J]. Surveys in combinatorics, in:Lecture Note Series,1995, 218:41-70.[116]Pelc A. Searching games with errors-fifty years of coping with liars [J]. Theoret. Comput. Sci.,2002,270:71-109.[117]Pelc A. Solution of Ulam's problem on seraching with a lie[J]. J. Combin. Theory Ser. A, 1987,44:129-142.[118]Guzicki W. Ulam's searching game with two lies[J]. J. Combin. Theory Ser. A,,1990,,54 (1):1-19.[119]Deppe C. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correctiong codes[J]. Discrete Appl. Math,2000,224 (1-3):79-98.[120]Spencer J. Ulam's searching game with a fixed number of lies [J]. Theoret. Comput. Sci., 1992,95:307-321.[121]Liu W, Nie Z. Optimal detection of two counterfeit coins with two-arms balance[J]. Discrete Appl. Math.,2004,137 (3):267-291.[122]Aigner M. Searching with lies[J]. J. Combin Theory, Ser A,1996,74(1):43-56.[123]Malinowski A.k-ary searching game with a lie [J]. Ars Combin.,1994,37:301-308.[124]Deppe C. Coding with Feedback and Searching with Lies[M]. Berlin, Germany:Springer, 2007:27-70.[125]Nasipuri A, Castaeda R, Das S R. Performance of Multipath Routing for On-Demand Proto-cols in Mobile Ad Hoc Networks [J]. Mobile Networks and Applications,2001,6:339-349.[126]Kwon S, Shroff N B. Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks [J]. IEEE/ACM Transaction on Networking,2009,17(3):857-869.[127]Anantapalli M K, Li W. Multipath Maltihop routing analysis in mobile Ad hoc networks [J]. Wireless networks,2010,16:79-94.[128]M R Pearlman P S, Tabrizi S S. On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad Hoc Networks [C]. Proceedings of MobiHoc,2000.[129]Ishida K, Kakuda Y, Kikuno T. A routing protocol for finding two node-disjoint paths in computer networks [C]. Proceedings of ICNP,1995.
[130] Sakurai Y, Katto J. AODV multipath extension using source route lists with optimized routeestablishment[C]. Proceedings of Int Wireless Ad-Hoc Networks Workshop, 2004. 63–67.
[131] Jing F, Bhuvaneswaran R S, Katayama Y, et al. On-demand multipath routing protocol withpreferential path selection probabilities for MANET[C]. Proceedings of 20th Int. Conf.Advanced Information Networking and Applications AINA 2006, volume 2, 2006.
[132] Garcia-Luna-Aceves J, Mosko M, Perkins C E. A New Approach to On-Demand Loop-FreeRouting in ad hoc networks. Technical report, University of California Santa Cruz, 2003.
[133] Park J, Moh S, Chung I. A multipath AODV routing protocol in mobile ad hoc networks withSINR-based route selection[C]. Proceedings of IEEE Int. Symp. Wireless CommunicationSystems 2008. ISWCS’08., 2008. 682–686.
[134] Yuan P, Bai Y, Wang H. A Multipath Energy-Efcient Routing Protocol for Ad hoc Net-works[C]. Proceedings of Conf. Int Communications, Circuits and Systems, volume 3, 2006.1462–1466.
[135] Yuan Y H, Chen H M, Jia M. An Optimized Ad-hoc On-demand Multipath Distance Vec-tor(AOMDV) Routing Protocol[C]. Proceedings of Asia-Pacific Conf. Communications,2005. 569–573.
[136] Raju J, Garcia-Luna-Aceves J J. A new approach to on-demand loop-free multipath rout-ing[C]. Proceedings of Eight Int Computer Communications and Networks Conf, 1999.522–527.
[137] Vidhyapriya R, Vanathi P T. Performance of Multipath Routing for on Demand Protocols inWireless Sensor Networks[C]. Proceedings of Int. Symp. Ad Hoc and Ubiquitous Comput-ing ISAUHC’06, 2006. 196–197.
[138] Maltz D, Broch J, Johnson D B. Experiences Designing and Building a Multi-Hop WirelessAd Hoc Network Testbed[M]. School of Computer Science, Carnegie Mellon University,1999.
[139] Maltz D A, Broch J, Johnson D B. Lessons from a full-scale multihop wireless ad hocnetwork testbed[J]. IEEE Personal Communications, 2001, 8(1):8–15.
[140]“ONE LAB”. http://www.onelab.eu/index.php/services/testbed-components.
[141] Morris R, Kohler E, Jannotti J, et al. The Click modular router[J]. SIGOPS Oper. Syst. Rev.,1999, 33:217–231.
[55] Kwong K W, Gao L, Guerin R, et al. On the Feasibility and Efcacy of Protection Routingin IP Networks[J]. IEEE/ACM Transaction on Networking, 2011, 19(5):1543–1556.
[56] Racherla V. Algorithms for routing and rerouting in mobile wireless and ad-hoc network-s[D]. University of Oklahoma, 1999.
[57] Zang H, Ou C, Mukherjee B. Path-protection routing and wavelength assignment (RWA) inWDM mesh networks under duct-layer constraints[J]. IEEE Trans. NET, 2003, 11(2):248–258.
[58] Peterson H, Sen S, Chandrashekar J, et al. Message-efcient dissemination for loop-freecentralized routing[J]. Comput. Commun. Rev., 2008, 38 ( 3):63 74.
[59] Kwong K W, Gao L X, Guerin R, et al. On the Feasibility and Efcacy of Protection Routingin IP Networks[C]. Proceedings of IEEE INFOCOM, 2010. 1–9.
[60] Atlas A, Zinin A. Basic specification for IP fast reroute: Loopfree alternates, IETF RFC5286, Sep. 2008..
[61] Reichert C, Magedanz T. Topology requirements for resilient IP networks[C]. Proceedingsof 12th GI/ITG Conf. on Meas., Mod. & Eval. of Comp. & Comm. Sys, 2004.
[62] Reichert C, Glickmann Y, Magedanz T. Two routing algorithms for failure protection in IPnetworks[C]. Proceedings of ISCC, 2005.
[63] Ray S, Gu erin R, Kwong K W, et al. Always acyclic distributed path computation[J].IEEE/ACM Transactions on Networking, 2009, 18 (1):307 319.
[64] Ohara Y, Imahori S, Meter R V. MARA: Maximum alternative routing algorithm[C]. Pro-ceedings of IEEE INFOCOM, 2009.
[65] Cicic T, Hansen A, Kvalbein A, et al. Relaxed multiple routing configurations: IP fast reroutefor single and correlated failures[J]. IEEE Trans. Netw. Service Manage, 2009, 6(1):1 14.
[66] Kvalbein A, Hansen A F, Cicic T, et al. Multiple Routing Configurations for Fast IP NetworkRecovery[J]. IEEE/ACM Transaction on Networking, 2009, 17(2):473–486.
[67] Lakshminarayanan K, Caesar M, Rangan M, et al. Achieving convergence-free routingusing failure-carrying packets[C]. Proceedings of ACM SIGCOMM, 2007.
[68] Menth M, Hartmann M, Martin R, et al. Loopfree alternates and not-via addresses: A propercombination for IP fast reroute[J]. Comput. Netw., 2010, 54(8):1300 1315.
[69] Shand M, Bryant S, Previdi S. IP fast reroute using NotVia addresses, Internet draft(work in progress), Jul. 2009..
[70] Zhong Z, Nelakuditi S, Yu Y, et al. Failure inferencing based fast rerouting for handlingtransient link and node failures[C]. Proceedings of IEEE INFOCOM, 2005.
[71] Lai W K, Hsiao S Y, Lin Y C. Adaptive backup routing for ad-hoc networks[J]. Comput.Commun., 2007, 30:453–464.
[72] Li X, Cuthbert L. On-demand node-disjoint multipath routing in wireless ad hoc network-s[C]. Proceedings of 29th Annual IEEE Int Local Computer Networks Conf, 2004. 419–420.[73]Li X, Cuthbert L. Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks[C]. Proceedings of IEEE Computer Society's 12th Annual Int. Symp. Model-ing, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS 2004),2004.184-191.[74]Yang C C, Tseng L P. Fisheye zone routing protocol for mobile ad hoc networks [C]. Pro-ceedings of CCNC Consumer Communications and Networking Conf.2005 Second IEEE, 2005.1-6.[75]Johnson D B, Maltz D A. Mobile Computing[M]. Kluwer Academic Publishers,1996: 153-181.[76]Marina M K, Das S R. Ad hoc on-demand multipath distance vector routing[C]. Proceedings of Wireless Communications and Mobile Computing.969-988.[77]Cidon I, Rom R, Shavitt Y. Analysis of Multi-Path Routing[J]. IEEE/ACM Transactions on Networking,1999,7(6):885-896.[78]Leon-Garcia A, Widjaja I. Communication networks, Fundamental Concepts and Key Ar-chitectures [M]. McGraw-Hill Higher Education, Singapore, International Editions,2000.[79]Feeney L M, Nilsson M. Investigating the energy consumption of a wireless network in-terface in an ad hoc networking environment[C]. Proceedings of Infocom,3:1548-1557, 2001.[80]林闯,单志广,任丰原.计算机网络的服务质量(QoS)[M].清华大学出版社,北京,2004.[81]Ni S Y, Tseng Y C, Chen Y S, et al. The Broadcast Storm Problem in a Mobile Ad hoc Network[C]. Proceedings of Mobicom 1999 Seattle Washington USA,1999.[82]Wesel E K. Wireless Multimedia Communications:Networking Video, Voice, and Data[M]. Addison-Wesley, One Jacob Way, Reading, Massachusetts 01867 USA,1998.[83]Jiang M, Li J, Tay Y C. Cluster based routing protocol (CBRP) functional specification,[J]. Internet Draft,1998..[84]Chang N, Liu M. Revisiting the TTL-based controlled flooding search:optimality and ran-domization[C]. Proceedings of Proceedings of the 10th annual international conference on Mobile computing and networking, New York, NY, USA:ACM,2004.85-99.[85]Knuth D E. The art of computer programming, Vol 3:Sorting and searching (Second Edi-tion)[M]. Reading, Massachusetts:Addison-Wesley,1998.[86]Baryshnikov Y, Coffman E, Jelenkovic P, et al. Flood search under the California Split rule[J]. Operations Research Letters,2004,32:199-206.[87]Chang N B, Liu M Y Optimal controlled flooding search in a large wireless network[C]. Proceedings of Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless networks (WiOpt'05), Riva Del Garda. Italy,229-237,2005.[88]Chang N B, Liu M Y Controlled flooding search in a large network[J]. IEEE/ACM Trans-actions on Networking,2007,15(1):436-449.[89]OHKatona G. Finding at least one excellent element in two rounds[J]. Journal of Statistical Planning and Inference,2011,141:2946-2952.
[90] Fekete S P, Kaufmann M, Kroller A, et al. A new approach for boundary recognition ingeometric sensor networks[C]. Proceedings of 17th Canadian Conference on ComputationalGeometry, 2005.
[91] Kroller A, Fekete S P, DPfisterer, et al. Deterministic boundary recognition and topologyextraction for large sensor networks[C]. Proceedings of ACM SODA’06, 2006.
[92] Wang Y, Gao J, Mitchell J S. Boundary recognition in sensor networks by topologicalmethods[C]. Proceedings of ACM MobiCom’06, 2006.
[93] Dong D Z, Li M, Liu Y H, et al. Fine-grained boundary recognition in Wireless Ad Hoc andSensor Networks By topological Methods[C]. Proceedings of ACM Mobihoc’09, 2009.
[94] Spira P M, pan A. On finding and updating spanning trees and shortest paths[J]. SIAMJournal on computing, 1975, 4(3):375–380.
[95] Floyd R W. Algorithm 97: Shortest path[J]. Comm. ACM, 1962., 5:345.
[96] Coppersmith D, Winograd S. Matrix multiplication via arithmetic progressions[J]. J. Sym-bolic Comput, 1990, 9:251–280.
[97] Takaoka T. Shortest path algorithms for nearly acyclic directed graphs[J]. TheoreticalComputer Science, 1998, 203:143–150.
[98] Tanenbaum A S. [M].èù, , 2004.
[99] Aigner M. Combinatorial Search[M]. Wiley-Teuber, New York, 1988.
[100] Du D, Hwang F. Combinatorial Group Testing and its Applications, 2nd Ed[M]. WorldScientific, Singapore, 2000.
[101] Baranyai Z. On a search problem of GO H Katona[C]. In: Baranyai Z, (eds.). Proceedingsof Combinatorics . Coll. Soc. Janos Bolyai 18, 1978, North-holland., volume 1, Proceedingsof the 5th Hungarian Coll., Keszthely, 1976. 61–76.
[102] Katona G. On separating systems of a finite set[J]. J. Combin. Theory, 1966, 1:174–194.
[103] Wegener I. On separating systems whose elements are sets of at most k elements[J]. DiscreteMath, 1979, 28:219–222.
[104] Luzgin V N. Separation systems of partitions of a finite set Combinatorial Analysis[J].Moskov. Gos Univ., Moscow, 1980, 5:39–45.
[105] Katona G. Search with small sets in presence of a liar[J]. J. Statist. Plann. Inference, 2002,100:319–336.
[106] Liu W A, Ma H Y. Minimal average cost of searching for a counterfeit coin: Restrictedmodel[J]. Discrete Appl. Math., 2006, 154(14):1996–2009.
[107] Ko Y B, HVaidya N. Lacation aided routing (LAR) in mobile ad hoc networks[J]. Wirelessnetworks, 2000, 6:307–321.
[108] Das S M, Pucha H, Hu Y. Performance comparison of scalable location services for geo-graphic Ad hoc Routing[C]. Proceedings of IEEE INFOCOM, 2005.
[109] Koutsonikolas D, Das S, Pucha H, et al. On optimal TTL sequence-based route discov-ery in MANETs[C]. Proceedings of The 2nd International Workshop on Wireless Ad Hoc[110]Pettie S, Ramachandran V. An optimal minimum spanning tree algorithm[J]. Journal of Association for Computing Machinery,2002,49(1):16-34.[111]Pettie S, Ramachandran V. Minimizing randomness in minimum spanning tree, parallel connectivity and set maximal algorithms [C]. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA'02),2002.[112]Papadimitratos P, Poturalski M, Schaller P, et al. Secure neighborhood discovery:a funda-mental element for mobile ad hoc networking[J]. IEEE Communication Magazine,2008, 46(2):132-139.[113]周炯槃,庞沁华,续大我,等.通信原理[M].北京邮电大学出版社,北京.[114]Ulam S M. Adventures of a Mathematician[M]. Scribner's, New York,1976.[115]Hill R. Searching with lies[J]. Surveys in combinatorics, in:Lecture Note Series,1995, 218:41-70.[116]Pelc A. Searching games with errors-fifty years of coping with liars [J]. Theoret. Comput. Sci.,2002,270:71-109.[117]Pelc A. Solution of Ulam's problem on seraching with a lie[J]. J. Combin. Theory Ser. A, 1987,44:129-142.[118]Guzicki W. Ulam's searching game with two lies[J]. J. Combin. Theory Ser. A,,1990,,54 (1):1-19.[119]Deppe C. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correctiong codes[J]. Discrete Appl. Math,2000,224 (1-3):79-98.[120]Spencer J. Ulam's searching game with a fixed number of lies [J]. Theoret. Comput. Sci., 1992,95:307-321.[121]Liu W, Nie Z. Optimal detection of two counterfeit coins with two-arms balance[J]. Discrete Appl. Math.,2004,137 (3):267-291.[122]Aigner M. Searching with lies[J]. J. Combin Theory, Ser A,1996,74(1):43-56.[123]Malinowski A.k-ary searching game with a lie [J]. Ars Combin.,1994,37:301-308.[124]Deppe C. Coding with Feedback and Searching with Lies[M]. Berlin, Germany:Springer, 2007:27-70.[125]Nasipuri A, Castaeda R, Das S R. Performance of Multipath Routing for On-Demand Proto-cols in Mobile Ad Hoc Networks [J]. Mobile Networks and Applications,2001,6:339-349.[126]Kwon S, Shroff N B. Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks [J]. IEEE/ACM Transaction on Networking,2009,17(3):857-869.[127]Anantapalli M K, Li W. Multipath Maltihop routing analysis in mobile Ad hoc networks [J]. Wireless networks,2010,16:79-94.[128]M R Pearlman P S, Tabrizi S S. On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad Hoc Networks [C]. Proceedings of MobiHoc,2000.[129]Ishida K, Kakuda Y, Kikuno T. A routing protocol for finding two node-disjoint paths in computer networks [C]. Proceedings of ICNP,1995.
[130] Sakurai Y, Katto J. AODV multipath extension using source route lists with optimized routeestablishment[C]. Proceedings of Int Wireless Ad-Hoc Networks Workshop, 2004. 63–67.
[131] Jing F, Bhuvaneswaran R S, Katayama Y, et al. On-demand multipath routing protocol withpreferential path selection probabilities for MANET[C]. Proceedings of 20th Int. Conf.Advanced Information Networking and Applications AINA 2006, volume 2, 2006.
[132] Garcia-Luna-Aceves J, Mosko M, Perkins C E. A New Approach to On-Demand Loop-FreeRouting in ad hoc networks. Technical report, University of California Santa Cruz, 2003.
[133] Park J, Moh S, Chung I. A multipath AODV routing protocol in mobile ad hoc networks withSINR-based route selection[C]. Proceedings of IEEE Int. Symp. Wireless CommunicationSystems 2008. ISWCS’08., 2008. 682–686.
[134] Yuan P, Bai Y, Wang H. A Multipath Energy-Efcient Routing Protocol for Ad hoc Net-works[C]. Proceedings of Conf. Int Communications, Circuits and Systems, volume 3, 2006.1462–1466.
[135] Yuan Y H, Chen H M, Jia M. An Optimized Ad-hoc On-demand Multipath Distance Vec-tor(AOMDV) Routing Protocol[C]. Proceedings of Asia-Pacific Conf. Communications,2005. 569–573.
[136] Raju J, Garcia-Luna-Aceves J J. A new approach to on-demand loop-free multipath rout-ing[C]. Proceedings of Eight Int Computer Communications and Networks Conf, 1999.522–527.
[137] Vidhyapriya R, Vanathi P T. Performance of Multipath Routing for on Demand Protocols inWireless Sensor Networks[C]. Proceedings of Int. Symp. Ad Hoc and Ubiquitous Comput-ing ISAUHC’06, 2006. 196–197.
[138] Maltz D, Broch J, Johnson D B. Experiences Designing and Building a Multi-Hop WirelessAd Hoc Network Testbed[M]. School of Computer Science, Carnegie Mellon University,1999.
[139] Maltz D A, Broch J, Johnson D B. Lessons from a full-scale multihop wireless ad hocnetwork testbed[J]. IEEE Personal Communications, 2001, 8(1):8–15.
[140]“ONE LAB”. http://www.onelab.eu/index.php/services/testbed-components.
[141] Morris R, Kohler E, Jannotti J, et al. The Click modular router[J]. SIGOPS Oper. Syst. Rev.,1999, 33:217–231.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |