无线传感网络多播、路由与位置管理研究
|
摘要
无线传感器网络是一种新型的网络和计算技术,它可以将客观世界中不断变化的信息持续高效地传递给人们,为人们提供各种形式的数据与服务。这种网络的自适应性、抗毁性、易部署性和低成本,使得它在环境监测、多媒体服务、医疗卫生、智能家居、军事等领域有着广泛的应用前景。而随着应用的深入,如何提高无线传感网络中的多播路由的性能,保证网络的可用性和对故障的容错性以提高网络的整体性能是一个重要的研究课题,本文围绕这一主题展开了研究。同时针对间歇性连接移动传感网络的路由问题也提出了自己的思考。本文的侧重点在共享树多播算法、间歇性连接移动传感网络路由算法、位置管理和与其相关的Quorum构造算法。论文的主要贡献包括：
(1)基于双向筛选的共享树多播路由研究
提出了一种在无线传感网络下的基于MAODV算法的双向筛选多播路由算法。首先,在源节点路由的过程中,通过对请求报文(RREQ)的筛选和反馈报文(RREP)的优化选择,只对满足业务需求、性能较好的链路进行转发,这种方法减少了请求报文和反馈报文的转发数量,降低了通信代价；第二,在报文转发和路由建立过程中,考虑链路的稳定性因素,把邻居节点变化率作为路径稳定因素加以考虑,增加了动态环境中多播路由的稳定性和路由成功率。
(2)基于QUORUM系统的多播共享树路由修复机制研究
多播过程中由于接收节点的移动,容易造成链路中断而脱离多播树,而一些实时应用则要求能够马上修复并重新建立到多播树的路由。本文提出了一种基于Quorum系统的多播共享树路由修复机制。这种机制下Quorum系统能够为移动节点快速查询可用汇合节点,并为其选择合适的汇合节点,建立到多播树的路由以保证数据的连续提供。本算法首先建立一个遍布于网络中的虚拟骨干网络,并在每个虚拟骨干节点建立位置数据库,这些位置数据库存储了汇合节点的相对位置信息。然后将骨干节点上的位置数据库组建成两两相交的Quorum系统。接收节点通过查询Quorum系统内的位置数据库能够快速知道汇合节点的位置信息并与之建立路由。仿真结果显示,该算法在切换时间和耗费代价上均比同类算法有明显提高,同时还具有一定的冗余容错特性。
(3)基于非规则网格Quorum的位置管理
位置管理是移动环境下无线传感网络中需要解决的一个重要问题,它能为移动节点提供快速的路由选择。建立在虚拟骨干网上Quorum系统能为WSN环境下的位置管理提供了良好的解决办法。本文提出的非规则网格Quorum构建算法,将虚拟骨干网节点组织在非规则网格中,按照一定的规律构成Quorum,并使得Quorum系统的规模最小,效率最高,提高了位置管理的效率。通过仿真对比,非规则网格Quorum的位置管理算法在切换时间、网络耗费和网络容错性上比同类的算法均有明显提高。
(4)基于K任播的对数网格Quorum系统的位置管理及优化
基于Quourm的位置管理系统要求在系统的建立初期就形成固定关系的Quorum。位置更新和位置调度的报文必须转发给Quorum预先定义的节点。这种预定对象的转发机制在移动的节点和不稳定的链路环境下常常会效率低下甚至不能执行。本文提出的基于K任播非规则网格Quorum系统不需要维护固定结构的Quorum,而是以K任播的方式按照非规则网格Quorum的规则从不同组中选择最快响应节点进行更新或调度。仿真结果显示比固定Quorum系统性能上有较大提高。另外本文也对非规则网格的结构进行了优化,提出了一种对数网格以满足K任播机制。
(5)间歇性连接移动传感网络中的基于兴趣域的消息转发模式
间歇性连接移动传感网络中的节点活动一般具有“小世界”的特性,其活动范围具有一定的“兴趣性”。本文提出了一种基于“兴趣域”的消息转发模式IRBD (Interest Region-Based Delivery),该算法先通过扩散算法将消息副本投递到能力效用值较高的域中,再通过兴趣牵引算法将副本从兴趣值低的域向兴趣值高的域转移。仿真实验结果验证了在确定性路由模式下,该算法在投递率和延迟性能等方面优于其它同类算法。
Wireless sensor network (WSN) has been a new research area for some years. WSN consists of a large amount of wireless sensor nodes integrated with sensing, computing and communication modules. It senses information from physical world and transmits the messages to the users. The features of self-adaptive, ruin-resistant, easy deployment and low cost enable WSN to conduct many special applications, such as environment surveillance, multimedia service, smart homing and military application. To improve WSN's multicast performance, ensure its availibility and guarantee the fault-tolerance is. an important issue for mobile WSN. This thesis focuses on multicast routing, location management, quorum construction algorithms and delivery in ICWSN (Intermittently Connected Mobile Sensor Networks). The main contributions of the thesis are as follows:
(1) A shared tree algorithm for bilaterally filtering multicast
A bilaterally filtering multicast routing algorithm for multicast service is proposed for wireless multi-hop ad hoc networks, satisfying constraints such as end-to-end latency, bandwidth limit and node-stability. The proposed algorithm is based on MAODV, a shared-tree multicast algorithm, and can reduce the routing cost through bilaterally filtering the invalid and inefficient routing path. The simulation results show that the improved protocol reduces average routing cost and increase the stability for mobility of nodes.
(2) A quorum based route repair for shared tree multicast in mobile WSN
The mobility of recipient in multicast process is easy to break away link between it with multicast tree. Some realtime applictions, however, require quick route repair to link recipient to multicast tree. We propose a quorum-based route repair for shared-tree muliticast. This scheme provides a mechanism of quick looking-up rendezvous point for recipient and establish route between it and multicast tree. Results obtained through simulations demonstrate that the algorithm reduces switch time and average routing cost.
(3) Irregular Grid Quorum Based Location Management for Wireless Sensor Network
Location service provides position of mobile destination to source node so that position based routing can be applied. Several quorum-based location services have been proposed. We propose a novel irregular grid quorum based location service. In the proposed scheme, location databases are stored in the network nodes themselves, which form a self-organizing virtual backbone network. Quorum system is constructed on the virtual backbone network in conformity to irregular grid rule. Every mobile node will notify its location update information to irregular grid quorum system so that other hosts can obtain the other node's location through irregular grid quorum system. The simulation results show that our proposed location service leads to low switch time, and low control cost.
(4) K-Anycast Quorum-based location management in wireless sensor network
We present a novel algorithm for location management in wireless sensor network, which called K-anycast-based irregular grid quorum location management. K-anycast irregular grid quorum doesn't require the quorum construction process in initialization, but choose the fastest nodes as quorum elements according to irregular grid rule in routing phase. The simulation results show that KLGQ can not only reduce the cost of location service, but also support more failure on quorum systems.
(5) Interest Region-Based Delivery in Intermittently Connected Mobile Sensor Networks
The mobility of nodes in Intermittently Connected Mobile Sensor Networks is normally with "small world dynamics",and its movement is restricted with some "interest".This paper propose a interest region-based delivery mode,named IRBD (Interest Region-Based Delivery,which first deliver message duplications to regions with high spread utility value, and through intrest-oriented algorithm, drag duplication to regions with higher interest value. Our results show, with respect to both message delivery ratio and delay, our scheme outperforms others in deterministic rouging enviroment.
(1)基于双向筛选的共享树多播路由研究
提出了一种在无线传感网络下的基于MAODV算法的双向筛选多播路由算法。首先,在源节点路由的过程中,通过对请求报文(RREQ)的筛选和反馈报文(RREP)的优化选择,只对满足业务需求、性能较好的链路进行转发,这种方法减少了请求报文和反馈报文的转发数量,降低了通信代价；第二,在报文转发和路由建立过程中,考虑链路的稳定性因素,把邻居节点变化率作为路径稳定因素加以考虑,增加了动态环境中多播路由的稳定性和路由成功率。
(2)基于QUORUM系统的多播共享树路由修复机制研究
多播过程中由于接收节点的移动,容易造成链路中断而脱离多播树,而一些实时应用则要求能够马上修复并重新建立到多播树的路由。本文提出了一种基于Quorum系统的多播共享树路由修复机制。这种机制下Quorum系统能够为移动节点快速查询可用汇合节点,并为其选择合适的汇合节点,建立到多播树的路由以保证数据的连续提供。本算法首先建立一个遍布于网络中的虚拟骨干网络,并在每个虚拟骨干节点建立位置数据库,这些位置数据库存储了汇合节点的相对位置信息。然后将骨干节点上的位置数据库组建成两两相交的Quorum系统。接收节点通过查询Quorum系统内的位置数据库能够快速知道汇合节点的位置信息并与之建立路由。仿真结果显示,该算法在切换时间和耗费代价上均比同类算法有明显提高,同时还具有一定的冗余容错特性。
(3)基于非规则网格Quorum的位置管理
位置管理是移动环境下无线传感网络中需要解决的一个重要问题,它能为移动节点提供快速的路由选择。建立在虚拟骨干网上Quorum系统能为WSN环境下的位置管理提供了良好的解决办法。本文提出的非规则网格Quorum构建算法,将虚拟骨干网节点组织在非规则网格中,按照一定的规律构成Quorum,并使得Quorum系统的规模最小,效率最高,提高了位置管理的效率。通过仿真对比,非规则网格Quorum的位置管理算法在切换时间、网络耗费和网络容错性上比同类的算法均有明显提高。
(4)基于K任播的对数网格Quorum系统的位置管理及优化
基于Quourm的位置管理系统要求在系统的建立初期就形成固定关系的Quorum。位置更新和位置调度的报文必须转发给Quorum预先定义的节点。这种预定对象的转发机制在移动的节点和不稳定的链路环境下常常会效率低下甚至不能执行。本文提出的基于K任播非规则网格Quorum系统不需要维护固定结构的Quorum,而是以K任播的方式按照非规则网格Quorum的规则从不同组中选择最快响应节点进行更新或调度。仿真结果显示比固定Quorum系统性能上有较大提高。另外本文也对非规则网格的结构进行了优化,提出了一种对数网格以满足K任播机制。
(5)间歇性连接移动传感网络中的基于兴趣域的消息转发模式
间歇性连接移动传感网络中的节点活动一般具有“小世界”的特性,其活动范围具有一定的“兴趣性”。本文提出了一种基于“兴趣域”的消息转发模式IRBD (Interest Region-Based Delivery),该算法先通过扩散算法将消息副本投递到能力效用值较高的域中,再通过兴趣牵引算法将副本从兴趣值低的域向兴趣值高的域转移。仿真实验结果验证了在确定性路由模式下,该算法在投递率和延迟性能等方面优于其它同类算法。
Wireless sensor network (WSN) has been a new research area for some years. WSN consists of a large amount of wireless sensor nodes integrated with sensing, computing and communication modules. It senses information from physical world and transmits the messages to the users. The features of self-adaptive, ruin-resistant, easy deployment and low cost enable WSN to conduct many special applications, such as environment surveillance, multimedia service, smart homing and military application. To improve WSN's multicast performance, ensure its availibility and guarantee the fault-tolerance is. an important issue for mobile WSN. This thesis focuses on multicast routing, location management, quorum construction algorithms and delivery in ICWSN (Intermittently Connected Mobile Sensor Networks). The main contributions of the thesis are as follows:
(1) A shared tree algorithm for bilaterally filtering multicast
A bilaterally filtering multicast routing algorithm for multicast service is proposed for wireless multi-hop ad hoc networks, satisfying constraints such as end-to-end latency, bandwidth limit and node-stability. The proposed algorithm is based on MAODV, a shared-tree multicast algorithm, and can reduce the routing cost through bilaterally filtering the invalid and inefficient routing path. The simulation results show that the improved protocol reduces average routing cost and increase the stability for mobility of nodes.
(2) A quorum based route repair for shared tree multicast in mobile WSN
The mobility of recipient in multicast process is easy to break away link between it with multicast tree. Some realtime applictions, however, require quick route repair to link recipient to multicast tree. We propose a quorum-based route repair for shared-tree muliticast. This scheme provides a mechanism of quick looking-up rendezvous point for recipient and establish route between it and multicast tree. Results obtained through simulations demonstrate that the algorithm reduces switch time and average routing cost.
(3) Irregular Grid Quorum Based Location Management for Wireless Sensor Network
Location service provides position of mobile destination to source node so that position based routing can be applied. Several quorum-based location services have been proposed. We propose a novel irregular grid quorum based location service. In the proposed scheme, location databases are stored in the network nodes themselves, which form a self-organizing virtual backbone network. Quorum system is constructed on the virtual backbone network in conformity to irregular grid rule. Every mobile node will notify its location update information to irregular grid quorum system so that other hosts can obtain the other node's location through irregular grid quorum system. The simulation results show that our proposed location service leads to low switch time, and low control cost.
(4) K-Anycast Quorum-based location management in wireless sensor network
We present a novel algorithm for location management in wireless sensor network, which called K-anycast-based irregular grid quorum location management. K-anycast irregular grid quorum doesn't require the quorum construction process in initialization, but choose the fastest nodes as quorum elements according to irregular grid rule in routing phase. The simulation results show that KLGQ can not only reduce the cost of location service, but also support more failure on quorum systems.
(5) Interest Region-Based Delivery in Intermittently Connected Mobile Sensor Networks
The mobility of nodes in Intermittently Connected Mobile Sensor Networks is normally with "small world dynamics",and its movement is restricted with some "interest".This paper propose a interest region-based delivery mode,named IRBD (Interest Region-Based Delivery,which first deliver message duplications to regions with high spread utility value, and through intrest-oriented algorithm, drag duplication to regions with higher interest value. Our results show, with respect to both message delivery ratio and delay, our scheme outperforms others in deterministic rouging enviroment.
引文
[1]C. Chong, and S. Kumar, "Sensor Networks:Evaluation, opportunities, and challenges", in Proc. Of Mobicom99,1999.
[2]I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks", IEEE Communications Magazine, vol.40, no.8, Aug.2002, pp. 102-114.
[3]任丰原,黄海宁,林闯,“无线传感器网络”,软件学报,2003,vol.14,no.7,pp.1281-1291.
[4]孙利民,李建中,陈渝等,“无线传感器网络”,清华大学出版社,2005.
[5]李建中,李金宝,石胜飞,“传感器网络机器数据管理的概念、问题与进展”,软件学报,2003,vol.14,no.10,pp.1717-1727.
[6]Gyula Simon, Miklos Maroti, Akos Ledeczi, et al., "Sensor Network-Based Countersniper System ", in Proc. of Sensys04,2004.
[7]Maxim A. Batalin, Mohammad Rahimi, Yan Yu, et al., "Call and Response: Experiments in Sampling the Environment", In Proc. of Sensys04,2004.
[8]Robert Szewczyk, Alan Mainwaring, Joseph Polastre, "An Analysis of a Large Scale Habitat Monitoring Application", in Proc. of Sensys04,2004.
[9]Ning Xu, Sumit Rangwala, Krishna Kant Chintalapudi, and Deepak Ganesan, et al., "A Wireless Sensor Network For Structural Monitoring", in Proc. of Sensys04, 2004.
[10]Kirk Martinez, Royan Ong and Jane Hart, "Glacsweb:a sensor network for hostile environments", in Proc. of Secon04,2004.
[11]Susan Cotterell, Kelly Downey and Frank Vahid, "Applications and Experiments with eBlocks-Electronic Blocks for Basic Sensor-Based Systems", in Proc. of Secon04,2004.
[12]Nicholas F. Timmons and William G. Scanlon, "Analysis of the Performance of IEEE 802.15.4 for Medical Sensor Body Area Networking", in Proc. of Secon04, 2004.
[13]Jyh-How Huang, Saqib Amjad and Shivakant Mishra, "CenWits:A Sensor-Based Loosely Coupled Search and Rescue System Using Witnesses", in Proc. of Sensys05,2005.
[14]Gilman Tolle, Joseph Polastre, Robert Szewczyk, et al., "A Macroscope in the Redwoods", in Proc. of Sensye05,2005.
[15]Vipul Singhvi, Andreas Krause, Carlos Guestrin, et al., "Intelligent Light Control using Sensor Networks", in Proc. of Sensys05,2005.
[16]Lin Gu, Dong Jia, Pascal Vicaire, et al., "Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments", in Proc. of Sensys05,2005.
[17]UCLA CENS project, URL:www.cens.ucla.edu
[18]N. Noury, T. Herve, V. Rialle, G Virone, E. Mercier, G. Morey, A. Moro, T. Porcheron "Monitoring behavior in home using a smart fall sensor", IEEE-EMBS Special Topic Conference on Microtechnologies in Medicine and Biology, October 2000, pp.607-610.
[19]Santosh Kumar, Ten H. Lai and Anish Arora, "Barrier Coverage With Wireless Sensors", in Proc. of Mobicom05,2005.
[20]Sensor Webs. URL:http://sensorwebs.jpl.nasa.gov/.
[21]WINS (Wireless Integrated Network Sensors) project, URL: http://www.janet.ucla.edu/WINS/.
[22]PicoRadio project, URL:http://bwrc.eecs.berkeley.edu/Research/PicoRadio/ Default.htm.
[23]MIT uAMPS project, URL:http://www-mtl.mit.edu/research/icsystems/uamps/.
[24]Katayoun Sohrabi and Gregory J. Pottie, "Performance of a novel self-organization protocol for wireless ad hoc sensor networks", in Proc. Of the IEEE 50th Vehicular Technology Conf. pp.1222-1226,1999.
[25]Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks", in Proceedings of the 33rd Hawaii International Conference on System Sciences, 2000.
[26]Bluetooth SIG Inc., Specification of the Bluetooth system:Core, http://www.bluetooth.org/,2001.
[27]Jaap C. Haartsen, "The Bluetooth radio system", IEEE Personal Communications Magazine, pp.28-36,2000.
[28]Phil Karn, "MACA-a new channel access method for packet radio", APRL/CRRL Amateur Radio 9th Computer Networking Conf.,1990, pp.134-140.
[29]Vaduvur Bharghavan et al., "MACAW:A Media Access Protocol for Wireless Lans", in Proc. of ACM SIGCOMM'94,1994.
[30]J. J. Garcia-Luna-Aceves, Chane L. Fullmer, "Floor acquisition multiple access(FAMA) in single channel wireless networks", ACM Mobile Networks and Applications, Vol.4, No.3, pp.157-174,1999.
[31]LAN MAN Standards Committee of the IEEE Computer Society, "Wireless LAN medium access control (MAC) and physical layer (PHY) specification", IEEE, New York, NY, USA, IEEE Std 802.11-1999 edition,1999.
[32]Wei Ye, John Heidemann, Deborah Estrin, "An Energy-Efficient MAC Protocol for Wireless Sensor Networks", in Proc. of IEEE INFOCOM 2002,2002.
[33]Tijs van Dam and Koen Langendoen, "An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks", in Proc. of ACM SenSys'03,2003.
[34]A. El-Hoiydi, J.-D. Decotignie, C. Enz and E. Le Roux, "Poster Abstract: WiseMAC, an Ultra Low Power MAC Protocol for the WiseNET Wireless Sensor Network", in Proc. of ACM SenSys'03,2003.
[35]Charles E. Perkins, Pravin Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers", in Proceeding of ACM SIGCOMM'94, August,1994.
[36]C. Perkins, "Adhoc on demand distance vector (AODV) routing", Internet draft, draft-ietf-manet-aodv-04.txt, October 1999.
[37]D. Johnson and D. Maltz, "Dynamic source routing in adhoc wireless networks", in T. Imielinski and H. Korth, editors, Mobile Computing, pages 153-181. Kluwer Academic Publishers,1996.
[38]V. Park and S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks", in Proceedings of IEEE INFOCOM97, April 1997.
[39]Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network", in Proceeding of ACM/IEEE MOBICOM99, August,1999.
[40]Zygmunt J. Haas, Joseph Y. Halpern and Li Li, "Gossip-Based Ad Hoc Routing", in Proceeding of IEEE Infocom2002,2002.
[41]David Braginsky and Deborah Estrin, "Rumor Routing Algorithm For Sensor Networks", in Proceeding of ACM WSNA2002,2002.
[42]Sergio D. Servetto and Guillermo Barrenechea, "Constrained Random Walks on Random Graphs:Routing Algorithms for Large Scale Wireless Sensor Networks", in Proceeding of ACM WSNA2002,2002.
[43]J. Kulik, W. R. Heinzelman, and H. Balakrishnan, "Negotiation-based protocols for disseminating information in wireless sensor networks," Wireless Networks, Vol.8,pp.169-185,2002.
[44]Chalermek Intanagonwiwat,Ramesh Govindan,Deborah Estrin,John Heidemann,and Fabio Silva, "Directed Diffusion for Wireless Sensor Networking",IEEE／ACM Transaction on Networking,Vol.11,No.1,February 2003.
[45]C.Schurgers and M.B.Srivastava,"Energy efficient routing in wireless sensornetworks", in the MILCOM Proceedings on Communications forNetwork-Centric Operations:Creating the Information Force,McLean,VA,2001.
[46]A.Manjeshwar and D.P.Agarwal,"TEEN:a routing protocol for enhancedefficiency in wireless sensor networks,”in 1st International Workshop on Paralleland Distributed Computing Issues in Wireless Networks and Mobile Computing,April 2001.
[47]Arati Manjeshwar and Dharma P.Agrawal,"APTEEN:A Hybrid Protocol forEfficient Routing and Comprehensive Information Retrieval in Wireless SensorNetworks",in Proceeding of International Parallel and Distributed ProcessingSymposium 2002(IPDPS 2002),2002.
[48]Rahul C.Shah and Jan M.Rabaey,"Energy Aware Routing for Low Energy AdHoc Sensor Networks",in Proceeding of IEEE Wireless Communications andNetworking Conference(WCNC2002),Mar.,2002.
[49]Y. Yu,D.Estrin,and R.Govindan,"Geographical and Energy-Aware Routing:ARecursive Data Dissemination Protocol for Wireless Sensor Networks".UCLAComputer Science Department Technical Report,UCLA-CSD TR-01-0023,May2001.
[50]Iyengar.R.,Sikdar.B,"Scalable and distributed GPS free positioning for sensornetworks",in Proc.of the IEEE ICC'03,2003.pp.338-342.
[51]Neal Patwari,A1fred O.Hero,"Using proximity and quantized RSS for sensorlocalization in wireless networks",in Proc.of the ACM WSNA'03,2003.pp.20-29.
[52]Andreas Savvides,Heemin Park and Mani B.Srivastava,"The Bits and Flops ofthe N-hop Multilateration Primitive For Node Localization Problems",in Proc.ofthe ACM WSNA'02,2002.pp.112-121.
[53]Asis Nasipuri and Kai Li,"A Directionality based Location Discovery Schemefor Wireless Sensor Networks",in Proc.of the ACM WSNA'02,2002.pp.105-111.
[54]Y Xu,J.Heindemann,D.Estrin,"Geographic-informed Energy Conservation for Ad Hoc Routing", in Proceedings of Mobicom 2001, pp.70-84,2001.
[55]Benjie Chen, Kyle Jamieson, Han Balakrishnan and Robert Morris, "SPAN:An Energy Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks", in Proceedings of Mobicom 2001,2001.
[56]Alberto Cerpa and Deborah Estrin, "ASCENT:Adaptive Self-Configuring sEnsor Network Topologies", in Proceedings of Infocom 2002,2002.
[57]Curt Schurgers, Vlasios Tsiatsis, Mani B. Srivastava, "STEM:Topology Management for Energy Efficient Sensor Networks", in Proc. of IEEE Aerospace Conference, vol(3),2002, pp.1099-1108.
[58]P. Brighten Godfrey and David Ratajczak, "Naps:Scalable, Robust Topology Management in Wireless Ad Hoc Networks", in Proceedings of IPSN 2004,2004.
[59]J. Elson, L. Girod and D. Estrin, "Fine-Grained Network Time Synchronization Using Reference Broadcasts", in Proc. of 5th Symprosium on Operating systems Design and Implementation,2002.
[60]S. Ganeriwal, R. Kumar, S. Adlakha et al., "Network-wide Time Synchronizaiton in Sensor Networks", UCLA Technical Report, NESL01-01-2003.
[61]J. Greunen, J. Rabaey, "Lightweight time synchronization for sensor networks", in Proc. of WSNA03,2003.
[62]Su Ping, "Delay Measurement Time Synchronization for Wireless Sensor Networks", Intel Research Berkeley Lab,2003.
[63]M. Maroti, B. Kusy, G. Simon et al., "The Flooding Time Synchronization Protocol", Technical Report, Vanderbilt University,2004.
[64]Hedetn. Iem. I. S, Liestman A,"A Survey of Gossipingand Broadcasting in Communication Networks [J]",NetWorks,1988,18(4):319—349.
[65]Greenstein B, Estrin D, Govindanr, "Difs:A Distributed Index for Features in Sensor Networks", Proc of the 1st IEFF Workshop on Sensor Network Protocols and Applications[C],Washington,IEEE Computer Society,2003: 163-173.
[66]HE MAN W R, ANDRAKASAN A, BAIAKR ANH," An Application Specific Protocol Architecture for Wireless Mi2 crosensor Networks ",IEEE Trans on Wireless Communications,2002,1(4):pp660—670.
[67]杨志成,王军,强小应,朱妮,“移动AdHoc网络组播路由协议的研究综述”,现代电子技术,2006,Vol29.1,pp10-13
[68]Ji L S, Corson S,"Differential Destination Multicast",A MANET Multicast Routing Protocol for Small Groups It]. InProc INFOCOM,2001.1, pp192-1202.
[69]Lee S J, Gerla M, Chiang C C. On demand Multicast Routing Protocol(ODMRP)Proceedings of IEEE WCNC 99 New Orleans. La. Sep.1999.1298-1302.
[70]Garcia Luna Aceves J J, Madruga E L,"The Core Assisted Mesh Protocol(CAMP)", IEEE Journal on Selected Areas in Communications, Special Issue on Ad HOC Networks.1999.17(8):1380—1394.
[71]Lee S, Kim C. Neighbor Supporting Ad Hoe Multicast Rouring Protocol。2000 First Annual Workshop on Mobile and Ad Hoe Networking and Co mputing。 2000.37-44.
[72]Mingyan Liu, Rajesh R Talpade, Anthony Mcauley, "Ad HOC Multicast Routing Protocol(AMroute)。UMD TechReport 99—8.
[73]Elizabeth M Royer, Charles E Perkins. Multicast Ad Hoe On demand Distance Vector Routing (MAODV), Internet Draft, draft-ietf-manet-maodv-00. txt.
[74]Lindsey, S.; Raghavendra, C.S, "PEGASIS:Power-efficient gathering in sensor information systems",IEEE Aerospace Conference Proceedings,2002. Volume 3,pp776-782
[75]Huang C F, Tseng Y C,"The coverage problem in a wireless sensor network[C]", Proc ofthe ACM Int'Workshop on Wireless SensorNetworks and Applications(WSNA'03). New York:ACMPress,2003:115-121
[76]Wang X, Xing G, Zhang Y, et al,"Integrated coverage and connectivity configuration in wireless sensor networks"[C],Proe of the 1 st ACM Conference on Embedded Networked Sensor Systems,2003:28-39.
[77]L Van Hoesel, P Havinga,"A lightweight medium access protocol (LMAC) for wireless sensor networks",1st Int. Workshop on Networked Sensing Systems (INSS 2004),2004,pp209-216
[78]Ye W, Heidemann J, Estrin D,"Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks"IEEE/ACMTransactions on Networking,2004,12(3):493—506
[79]Lin P, Qiao C, Wang X,"Medium access control with a dynamic duty cycle for sensor networks",IEEE Wireless Communications and Networking Conference, 2004,3:1534—1539.
[80]X Wang, G Xing, Y Zhang, C Lu, R Pless, "Integrated coverage and connectivity configuration in wireless sensor networks", Proceedings of the 1st international conference on Embedded, pp349-358,2003
[81]Cerf V, Burleigh V, Hooke A, et al, Delay tolerant networking architecture. [2007-06-01]. http://tools.ietf.org/html/draft-irtf-dtnrg-arch-08
[82]Fall K. A delay tolerant network architecture for challenged Internets[c]//Proc of the ACM SIGCOMM 2003. New York:ACM,2003:27-34
[1]CHONG Chee-Yee, KUMAR Srikanta P.,"Sensor networks:Evolution, opportunities, and challenges", Proceedings of the IEEE,2003 vol91,pp 1247-1256.
[2]Perkins. Royer, "Multicast Ad Hoc On-Demand DistanceVector Routing(MAODV)"[S], IETF draft,11 July,2000
[3]K.Chert and K.Nahrstedt,"Effective Location-Guided Tree Construction Algorithm for Small Group multicast in MANET"[R],In Proceedings of IEEE Infocom 02, May,2002.
[4]Sahasrabuddhe.L. H and Mukherjee B,"Multicast routing algorithms and protocols:A tutorial", IEEE Network,2000 14(1),pp.90-104.
[5]Bluetooth SIG, "Bluetooth Specifications",V1.0, July 1999.
[6]Y-B. Ko and N. H. Vaidya,"Location-based multicast in mobile ad hoc networks"[R],Technical Report 98-018.CS Dept, Texas A&M University, September 1998.
[7]EL-SAYED A., ROCA V, MATHY L," A survey of proposals for an alternative group communication service"[J], IEEE Network,2003,17(1),pp.46-51.
[8]CHU Y H, RAO S G, SESHAN S, ZHANG H," A case for end system multicast"[J],ACM SIGMETRICS Performance Evaluation Review,2000, 28(1):1-12.
[9]CHU Y H, RAO S G, SESHAN S, ZHANG H,"Enabling conferencing applications on the internet using an overlay multicast architecture"[J], ACM SIGCOMM Computer Communication Review,2001,31(4):55-67.
[10]ZHANG Bei-chuan, JAMIN S, ZHANG Li-xia," Host multicast:a framework for delivering multicast to end users"[A], KERMANI P. IEEE INFOCOM 2002. New York, NY, USA:IEEE Press,2002.1366-1375.
[11]Hyojun Lim, Chongkwon Kim,"Multicast tree construction and flooding in wireless Ad Hoc Networks"[C]. Proceedings of ACM M SW IM, Boston:ACM Press.2000:61-68.
[12]马立平.统计数据标准化-无量纲化方法[J].北京统计.2003.03,pp34-38
[13]LIU Shan, ZHAO Heng, LIU Xuan,"Multicast routing approach with delay-constrained minimum-cost", Computer Engineering and Applications, 2007,43(16):118-120.
[14]陈敏.OPNET网络仿真[M].北京：清华大学出版社,2004.
[15]Chandra, R. Ramasubramanian, V. Birman, K," Anonymous Gossip: improving multicast reliability in mobile ad-hocnetworks"[C],21st International Conference on Distributed Computing Systems,2001.
[16]CheeOnn Chow, Hiroshi Ishii," Video Multicast Over Mobile AD Hoc Networks: Multiple-Tree Multicast AD HOC On-Demand Distance Vector Routing Protocol (MT-MAODV)" [C], PIMRC07.2007
[17]Sun BaoLin,Li Layuan," On the Reliability of MAODV in Ad Hoc Networks"[C]. IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings,2005
[18]Lei Chen,Adel Ben Mnaouer," Performance evaluation of new hybrid multicast routing protocols for ad-hoc networks"[C],9th International Conference on Communication System,2004
[19]Neugebauer. M," A new beacon order adaptation algorithm for IEEE 802.15.4 networks", Wireless Sensor Networks,2005. Proceeedings of the Second European Workshop,2005
[20]C Perkins, E Belding-Royer, S Das,"Ad hoc on-demand distance vector (AODV) routing",IETF draft.2002-06
[1]Calvert, K. L., Zegura, E. W., and Donahoo, M. J., "Core Selection Methods for Multicast Routing," Proc. Int. Conf. on Computer Communications and Networks, pp.638-642, July 1995
[2]Z. J. Haas and M. R. Pearlman, "Providing ad-hoc connectivity with the reconfigurable wireless networks," in Proc. ACM SIGCOMM'98, pp.167-177, Sept. 1998.
[3]J. L. Alvisi, D. Malkhi, E. Pierce, and M. Reiter"Fault detection for Byzantine quorum systems" In Proceedings of the 7th International Working Conference on Dependable Computing for Critical Applications, pages 357-372, January 1999.
[4]D. Malkhi, M. Reiter, and R. Wirght, "Probabilistic Quorum Systems,"Proc. ACM PODC, pp.267-273, Santa Barbara,1997.
[5]R. Prakash and M. Singhal, "Dynamic hashing+quorum=efficient location management for mobile computing systems," in Proc. ACM Symp. Principles Distributed Computing, Aug.1997, p.291.
[6]A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol.75, pp. 56-83, Jan.1987.
[7]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[8]A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol.75, pp. 56-83,Jan.1987.
[9]Z. J. Haas and B. Liang, "Ad Hoc Mobility Management with Uniform Quorum Systems", IEEE/ACM Trans. Net., vol.7, no.2, Apr.1999, pp.228-40.
[10]D Liu, I Stojmenovic and X Jia," A scalable Quorum based location service in ad hoc and sensor networks", Proc. of IEEE MASS,2006
[11]Richard A. Golding and Darrell D. E. Long, "Quorum-oriented multicast protocols for data replication"
[12]Sung Mo Chung, Chan-Hyun Youn, "Core Selection algorithm for multicast routing under multiple QoS constraints", IEE Electronics Letters, Volume:36 Issue:4, 17 Feb.2000, pp.278-279
[13]Billhartz, T., Cain, J. B., Farrey-Goudreau, E., Fieg, D.,and Batsell, S. G., "Performance and Resource Cost Comparisons for the CBT and PIM Multicast Routing Protocols," IEEE Journal on Selected Areas in Communications, Vol.15, No. 3, pp.304-315, April 1997
[14]Yih Huang, Fleur,E., McKinley, P.K., "LCM:a multicast core management protocol for link-state routing netowrks", Communications 1999. ICC 98. Conference Record.1998 IEEE International Conference on, Volume:2,1998, pp.1197-1201
[15]A.D. Raghavendra, S. Rai, and S.S Iyengar, "Multicast Routing in Internetworks Using Dynamic Core Based Trees", Conf. Proc. of the 1996 IEEE 15th annual Int. Phoenix Conf. On the Computers and Communications, PP.232-238, March 1996
[16]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," presented at IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[17]J. Sharony, "A mobile radio network architecture with dynamically changing topology using virtual subnets," MONET, vol.1, no.1, pp.75-86,1996.
[18]T. Crossman and A. wool. "computational experience with approximation algorithms for the set covering problem," European Jounurl of Operutional Research, no.101, pp.81-92,1997.
[19]Liang, B, Haas. Z.J,"Virtual backbone generation and maintenance in ad hoc network mobility management",INFOCOM2000, vol.3 pp1293-1302, Mar 2000
[20]M. R. Pearlman and Z.J. Haas, "litermining the optimal configuration for the Zone Routing Protocol," IEEE Journal on Selected Areas in Communications, vol.7, no.8. pp.1395-1414, August 1999.
[21]K.N. Amouris, S. Papavassiliou, M. Li, "A position based multi-zone routing protocol for wide area mobile ad-hoc networks", Proc.49th IEEE Vehicular Technology Conference,1999,1365-1369.
[22]C Shields, JJ Garcia-Luna-Aceves," The Ordered Core Based Tree Protocol", INFOCOM'97.,1997,page 884
[23]马钰璐,王重钢,程时端,多核单向共享树多播路由协议,计算机学报[J],2001vol24,p 710-715,2001.7
[24]ARON I D, GUPTA S," Analytical comparison of local and end-to-end error recovery in reactive routing protocols for mobile ad hoc networks" [C],Proceedings of the 3rd ACM International Workshop on Modeling Analysis and Simulation of W ireless and Mobile Systems. New York, USA:ACM,2000:69—76.
[25]王玉明,杨宗凯,赵大胜.基于缓存旁路和本地修复的多跳网络路由重建机制[J].电子与信息学报[J],2007,29(7)：1622-1627
[26]FENG Meiyu, CHENG Sheng, ZHANG Xu, et al. A self-healing routing scheme based on AODV in ad hoc Networks[C], Proceedings of the 4th International Conference on Computer and Information Technology. Los Alamitos, CA, USA: IEEE Computer Society,2004:616-620.
[27]PANDEY M, PACK R, IEIW, et al. To repair or not to repair:helping ad hoc routing protocols to distinguish mobility from congestion[c],INFOCOM 2007. Piscataway, NJ, USA:IEEE,2007:2311-2315.
[28]赵季红,曲桦,张鹏,Ad Hoc网络中基于链路故障的路由修复机制,西安交通大学学报[J],2009. vol43.p47-52,2009.10
[29]肖百龙,郭伟,刘军,祝思路,移动自组网路由局部修复算法的研究,计算机研究与发展[J],2007.vol44.p1383-1389
[30]C Gui, P Mohapatra. SHORT:Self-healing and optimizing routing techniques for mobile ad hoc networks[C]. ACM MOBIHOC. Annapolis.2003
[31]G P Liu, K J Wong, et al. PATCH:A novel local recovery mechanism for mobile ad hoc networks[C]. IEEE VTC, Orlando, USA.2003
[1]S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A.Woodward, "A distance routing effect algorithm for mobile wireless sensor network", Proc. MOBICOM,2008,76-84.
[2]Y.B. Ko and N.H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks", MOBICOM,1998,66-75.
[3]I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE Int. Conf. on Parallel Processing, August 21-24,2000, Toronto,173-180
[4]S. Mohan and R. Jain, "Two user location strategies for personal communications services," IEEE Personal Commun. Mag., First Quarter, pp.42-50,1994.
[5]J. Li et al., "A Scalable Location Service for Geographic Ad Hoc Routing,"Proc. 6th Annual ACM/IEEE Int'l. Conf. Mobile Comp. Net., Boston, MA,2000, pp. 120-30.
[6]R. Morris et al., Carnet:A Scalable Ad Hoc Wireless Network System,"Proc.9th ACM SIGOPS Euro. Wksp.:Beyond the PC:New Challenges for the Op. Sys., Kolding, Denmark, Sept.2000.
[7]S. Giordano and M. Hamdi, "Mobility Management:The Virtual Home Region," Tech. report, Oct.1999.
[8]I. Stojmenovic, "Home Agent Based Location Update and Destination Search Schemes in Ad Hoc Wireless Networks," Tech. rep. TR-99-10, Comp. Science, SITE, Unive. Ottawa, Sept.1999.
[9]Z. J. Haas and B. Liang, "Ad Hoc Mobility Management with Uniform Quorum Systems", IEEE/ACM Trans. Net., vol.7, no.2, Apr.1999, pp.228-40.
[10]Tsuchiya, T., Kikuno, T.,2002. Byzantine Quorum systems with maximum availability. information Processing Letters.83:71-77.
[11]Peleg, D, W ool. A,1997. Crumbling walls:a class of practical and efficient Quorum systems. Distributed Computing.10(2):87.98.
[12]Kumar.A,2002. An Efficient Super Grid Protocol for High Availability and Load Balancing. IEEE Transactions On Computer. P.1126-1133.
[13]Kafri.N, Janecek.J,2002. Dynamic Behavior of the Distributed Tree Quorum Algorithm.22nd International Conference on Distributed Computing Systems(ICD CS'2002). Vienna. Austria
[14]Fu, A. W. C., Wong, M., Yat, S.,2002. Diamond Quorum Consensus for High Capacity and Efficient in a Replicated Data System. Distributed and Parallel Databases. P.25.
[15]S. B. Davidson,H. Garcia Molina and D.Skeen, "Consistency in partitioned networks", ACM Computing Surveys,17(3):341-370,1985
[16]S.J.Mullender and P.M.B.Vitanyi,"Distributed match-making",Algorithmica,3:367-391,1988
[17]T.W.Yan and H.Garcia-Molina, "Distributed selective dissemination of information",In PROC.3rd Inter.Conf.Par.Dist.Info.Sys..paged89-98,1994
[18]M. Naor and A. Wool," Access control and signatures via Quorum secret sharing",In Proc 3rd ACM Conf. Comp and Comm. Security, pages157-168 1996
[19]D Liu, I Stojmenovic and X Jia," A scalable Quorum based location service in ad hoc and sensor networks", Proc. of IEEE MASS,2006
[20]Y. Zou and K. Chakrabarty, "Sensor Deployment and Target Localization Based on Virtual Forces," INFOCOM,2003.
[21]A. Howard, M. J. Mataric and G S. Sukhatme, "An Incremental Self-Deployment Algorithm for Mobile Sensor Networks," Autonomous Robots, Special Issue on Intelligent Embedded Systems, September 2002.
[22]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," presented at IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[23]J. Sharony, "A mobile radio network architecture with dynamically changing topology using virtual subnets," MONET, vol.1, no.1, pp.75-86,1996.
[24]Sung Mo Chung, Chan-Hyun Youn, "Core Selection algorithm for multicast routing under multiple QoS constraints", IEE Electronics Letters, Volume:36 Issue:4, 17 Feb.2000, pp.278-279
[25]D. Peleg and A. Wool, "Crumbling walls:A class of practical and efficient Quorum systems," in Proc.14th ACM Symp. Principle Distributed Computing,1995, pp.120-129.
[26]M. L. Neilsen," Quorum Structures in Distributed Systems" PhD thesis, Dept. Computing and Information Sciences Kansas State University,1992
[27]M.Naor and A. Wool," The load capacity and availability of Quorum systems",In Proc 35th IEEE Symp Foundations of Comp. Sci (FOCS) pages 214-225,1994
[1]Afergan M, Wein J, LaMeyer, "Experience with some Principles for Building an Internet-scale reliable System", Proceeding of Second Workshop on Real Large Distributed System,Dec.2005
[2]Ballani H, Francis P,"Towards a Global IP Anycast Service", Proceeding of the 2005 Co nference on Applications, Technologies, Architectures, and Protocols for Computer Communictions,Aug.2005
[3]Adaptec,"Advanced SCSI Programming Interface"[Z], Adaptec White Paper,1998:3-10
[4]Metz. C, "IP Anycast Point-to-(Any)Point Communication",IEEE Internet Computing,2002.04
[5]IETF, Multicast and Anycast Group Membership Charter, http://www.ietf.org/html/charters/magma-charter.html
[6]IETF, Mobile Ad Hoc Networks Working Group,http://www.ietf.org/html.charters/manetcharter.html
[7]Basturk E,"Using Network Layer Anycast for Load Distribution in the Intemet",IBM Research Report, RC20938,1997-07
[8]Peng Chao,Zhou Yini,"Anycast Routing Algofims on the Internet",IEEE,2001
[9]Xuan D,Jia W,Zhao W,"Routing Algorithms for Anycast M essages",Proc. ICPP98, 1998-08
[10]Bing Wu, Jie Wu,"k-anycast routing schemes for mobile ad hoc networks ", Parallel and Distributed Processing Symposium",2006. IPDPS 2006, pp25-29
[11]Weizhao Wang,Xiang-Yang Li," k-anycast game in selfish networks Frieder", 13th International Conference on Computer Communications and Networks, ICCCN 2004. Proceedings.11-13 Oct.2004
[12]王晓喃,唐振民,钱焕延,”IPv6中k-Anycast通信模型的研究与设计”,通信学报,200930(6),pp224-232
[13]王晓喃唐振民钱焕延,”IPv6中k-Anycast通信模型的分析与研究”,南京理工大学学报,2009 vol33(3),pp876-882
[1]孙利民,熊永平,马建,机会移动传感器网络中的自适应数据收集机制[J],通信学报,2008 vol29,186-192
[2]肖明军,黄刘生,容迟网络路由算法,计算机研究与发展[J],2009Vol46,p1065-1073
[3]熊永平,孙利民,牛建伟,刘燕,机会网络[J],软件学报,2009 vol20,p124-137
[4]JUANG OKI H, WANG Y,et al,Energy efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet [J]. SIGPI. AN Note,2002, 37(10):96-107
[5]Burns B, Brock O, Levine B N, MV routing and capacity building in disruption tolerant networks[C],Proc of the IEEE INFOCOM 2005,Piscataway, NJ:IEEE, 2005:398-408
[6]Vahdat A, Beeker D, Epidemic routing for partially connected ad hoc networks, CS-2000-06[R], Durham, NC:Duke University,2000
[7]Z Zhang, Routing in intermittently connected mobile Ad hoc networks and delay tolerant networks:overview and challenge [A]. IEEE Communications Surveys& Tutorials,st Quarter 2006.24-37.
[8]T Spyropoulos, K Psounis, Performance Analysis of Mobility assisted Routing[C]roceedings of the 8th ACM international symposium,2007
[9]Daly E, Haahr M, Social network analysis for routing in disconnected delay-tolerant MANETs[C],Proc of the ACM MOBIHOC:ACM,2007.32-40
[10]T Spyropoulos, K Psounis,Spray and Focus:Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility[C],
[11]A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the design of opportunistic forwarding algorithms[C]. In Proceedings of IEEE INFOCOM,2006.
[12]M. McNett and G. M. Voelker. Access and mobility of wireless pda users[C]. ACM Mobile Computing and Communication Review,2003.
[13]H Guo, J Li, AN Washington, C Liu, M Alfred, Performance Analysis of Homing Pigeon based Delay Tolerant Networks[C], MILCOM 2007,2007
[14]Spyropoulos T, Psounis K, Raghavendra C S, Spray and wait:An efficient routing scheme for intermittently connected mobile networks [C], Proc of the ACM SIGC()MM Workshop on Delay-Tolerant Networking (WDTN 2005), New York: ACM,2005:252-259
[15]J Whitbeck, HYMAD:Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks, https://www-rp.lip6.fr/site_npa/site_rp/_publications/1041-whitbeckaoc09_camera_re ady.pdf
[16]P Costa, C Mascolo, M Musolesi, GP Picco, Socially Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks[J], IEEE Journal on Selected Areas In Communications,Vol 26-No5, June 2008
[17]W Zhao, M Ammar, E Zegura, A message ferrying approach for data delivery in sparse mobile ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, p187-198,2004
[2]I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks", IEEE Communications Magazine, vol.40, no.8, Aug.2002, pp. 102-114.
[3]任丰原,黄海宁,林闯,“无线传感器网络”,软件学报,2003,vol.14,no.7,pp.1281-1291.
[4]孙利民,李建中,陈渝等,“无线传感器网络”,清华大学出版社,2005.
[5]李建中,李金宝,石胜飞,“传感器网络机器数据管理的概念、问题与进展”,软件学报,2003,vol.14,no.10,pp.1717-1727.
[6]Gyula Simon, Miklos Maroti, Akos Ledeczi, et al., "Sensor Network-Based Countersniper System ", in Proc. of Sensys04,2004.
[7]Maxim A. Batalin, Mohammad Rahimi, Yan Yu, et al., "Call and Response: Experiments in Sampling the Environment", In Proc. of Sensys04,2004.
[8]Robert Szewczyk, Alan Mainwaring, Joseph Polastre, "An Analysis of a Large Scale Habitat Monitoring Application", in Proc. of Sensys04,2004.
[9]Ning Xu, Sumit Rangwala, Krishna Kant Chintalapudi, and Deepak Ganesan, et al., "A Wireless Sensor Network For Structural Monitoring", in Proc. of Sensys04, 2004.
[10]Kirk Martinez, Royan Ong and Jane Hart, "Glacsweb:a sensor network for hostile environments", in Proc. of Secon04,2004.
[11]Susan Cotterell, Kelly Downey and Frank Vahid, "Applications and Experiments with eBlocks-Electronic Blocks for Basic Sensor-Based Systems", in Proc. of Secon04,2004.
[12]Nicholas F. Timmons and William G. Scanlon, "Analysis of the Performance of IEEE 802.15.4 for Medical Sensor Body Area Networking", in Proc. of Secon04, 2004.
[13]Jyh-How Huang, Saqib Amjad and Shivakant Mishra, "CenWits:A Sensor-Based Loosely Coupled Search and Rescue System Using Witnesses", in Proc. of Sensys05,2005.
[14]Gilman Tolle, Joseph Polastre, Robert Szewczyk, et al., "A Macroscope in the Redwoods", in Proc. of Sensye05,2005.
[15]Vipul Singhvi, Andreas Krause, Carlos Guestrin, et al., "Intelligent Light Control using Sensor Networks", in Proc. of Sensys05,2005.
[16]Lin Gu, Dong Jia, Pascal Vicaire, et al., "Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments", in Proc. of Sensys05,2005.
[17]UCLA CENS project, URL:www.cens.ucla.edu
[18]N. Noury, T. Herve, V. Rialle, G Virone, E. Mercier, G. Morey, A. Moro, T. Porcheron "Monitoring behavior in home using a smart fall sensor", IEEE-EMBS Special Topic Conference on Microtechnologies in Medicine and Biology, October 2000, pp.607-610.
[19]Santosh Kumar, Ten H. Lai and Anish Arora, "Barrier Coverage With Wireless Sensors", in Proc. of Mobicom05,2005.
[20]Sensor Webs. URL:http://sensorwebs.jpl.nasa.gov/.
[21]WINS (Wireless Integrated Network Sensors) project, URL: http://www.janet.ucla.edu/WINS/.
[22]PicoRadio project, URL:http://bwrc.eecs.berkeley.edu/Research/PicoRadio/ Default.htm.
[23]MIT uAMPS project, URL:http://www-mtl.mit.edu/research/icsystems/uamps/.
[24]Katayoun Sohrabi and Gregory J. Pottie, "Performance of a novel self-organization protocol for wireless ad hoc sensor networks", in Proc. Of the IEEE 50th Vehicular Technology Conf. pp.1222-1226,1999.
[25]Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks", in Proceedings of the 33rd Hawaii International Conference on System Sciences, 2000.
[26]Bluetooth SIG Inc., Specification of the Bluetooth system:Core, http://www.bluetooth.org/,2001.
[27]Jaap C. Haartsen, "The Bluetooth radio system", IEEE Personal Communications Magazine, pp.28-36,2000.
[28]Phil Karn, "MACA-a new channel access method for packet radio", APRL/CRRL Amateur Radio 9th Computer Networking Conf.,1990, pp.134-140.
[29]Vaduvur Bharghavan et al., "MACAW:A Media Access Protocol for Wireless Lans", in Proc. of ACM SIGCOMM'94,1994.
[30]J. J. Garcia-Luna-Aceves, Chane L. Fullmer, "Floor acquisition multiple access(FAMA) in single channel wireless networks", ACM Mobile Networks and Applications, Vol.4, No.3, pp.157-174,1999.
[31]LAN MAN Standards Committee of the IEEE Computer Society, "Wireless LAN medium access control (MAC) and physical layer (PHY) specification", IEEE, New York, NY, USA, IEEE Std 802.11-1999 edition,1999.
[32]Wei Ye, John Heidemann, Deborah Estrin, "An Energy-Efficient MAC Protocol for Wireless Sensor Networks", in Proc. of IEEE INFOCOM 2002,2002.
[33]Tijs van Dam and Koen Langendoen, "An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks", in Proc. of ACM SenSys'03,2003.
[34]A. El-Hoiydi, J.-D. Decotignie, C. Enz and E. Le Roux, "Poster Abstract: WiseMAC, an Ultra Low Power MAC Protocol for the WiseNET Wireless Sensor Network", in Proc. of ACM SenSys'03,2003.
[35]Charles E. Perkins, Pravin Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers", in Proceeding of ACM SIGCOMM'94, August,1994.
[36]C. Perkins, "Adhoc on demand distance vector (AODV) routing", Internet draft, draft-ietf-manet-aodv-04.txt, October 1999.
[37]D. Johnson and D. Maltz, "Dynamic source routing in adhoc wireless networks", in T. Imielinski and H. Korth, editors, Mobile Computing, pages 153-181. Kluwer Academic Publishers,1996.
[38]V. Park and S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks", in Proceedings of IEEE INFOCOM97, April 1997.
[39]Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network", in Proceeding of ACM/IEEE MOBICOM99, August,1999.
[40]Zygmunt J. Haas, Joseph Y. Halpern and Li Li, "Gossip-Based Ad Hoc Routing", in Proceeding of IEEE Infocom2002,2002.
[41]David Braginsky and Deborah Estrin, "Rumor Routing Algorithm For Sensor Networks", in Proceeding of ACM WSNA2002,2002.
[42]Sergio D. Servetto and Guillermo Barrenechea, "Constrained Random Walks on Random Graphs:Routing Algorithms for Large Scale Wireless Sensor Networks", in Proceeding of ACM WSNA2002,2002.
[43]J. Kulik, W. R. Heinzelman, and H. Balakrishnan, "Negotiation-based protocols for disseminating information in wireless sensor networks," Wireless Networks, Vol.8,pp.169-185,2002.
[44]Chalermek Intanagonwiwat,Ramesh Govindan,Deborah Estrin,John Heidemann,and Fabio Silva, "Directed Diffusion for Wireless Sensor Networking",IEEE／ACM Transaction on Networking,Vol.11,No.1,February 2003.
[45]C.Schurgers and M.B.Srivastava,"Energy efficient routing in wireless sensornetworks", in the MILCOM Proceedings on Communications forNetwork-Centric Operations:Creating the Information Force,McLean,VA,2001.
[46]A.Manjeshwar and D.P.Agarwal,"TEEN:a routing protocol for enhancedefficiency in wireless sensor networks,”in 1st International Workshop on Paralleland Distributed Computing Issues in Wireless Networks and Mobile Computing,April 2001.
[47]Arati Manjeshwar and Dharma P.Agrawal,"APTEEN:A Hybrid Protocol forEfficient Routing and Comprehensive Information Retrieval in Wireless SensorNetworks",in Proceeding of International Parallel and Distributed ProcessingSymposium 2002(IPDPS 2002),2002.
[48]Rahul C.Shah and Jan M.Rabaey,"Energy Aware Routing for Low Energy AdHoc Sensor Networks",in Proceeding of IEEE Wireless Communications andNetworking Conference(WCNC2002),Mar.,2002.
[49]Y. Yu,D.Estrin,and R.Govindan,"Geographical and Energy-Aware Routing:ARecursive Data Dissemination Protocol for Wireless Sensor Networks".UCLAComputer Science Department Technical Report,UCLA-CSD TR-01-0023,May2001.
[50]Iyengar.R.,Sikdar.B,"Scalable and distributed GPS free positioning for sensornetworks",in Proc.of the IEEE ICC'03,2003.pp.338-342.
[51]Neal Patwari,A1fred O.Hero,"Using proximity and quantized RSS for sensorlocalization in wireless networks",in Proc.of the ACM WSNA'03,2003.pp.20-29.
[52]Andreas Savvides,Heemin Park and Mani B.Srivastava,"The Bits and Flops ofthe N-hop Multilateration Primitive For Node Localization Problems",in Proc.ofthe ACM WSNA'02,2002.pp.112-121.
[53]Asis Nasipuri and Kai Li,"A Directionality based Location Discovery Schemefor Wireless Sensor Networks",in Proc.of the ACM WSNA'02,2002.pp.105-111.
[54]Y Xu,J.Heindemann,D.Estrin,"Geographic-informed Energy Conservation for Ad Hoc Routing", in Proceedings of Mobicom 2001, pp.70-84,2001.
[55]Benjie Chen, Kyle Jamieson, Han Balakrishnan and Robert Morris, "SPAN:An Energy Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks", in Proceedings of Mobicom 2001,2001.
[56]Alberto Cerpa and Deborah Estrin, "ASCENT:Adaptive Self-Configuring sEnsor Network Topologies", in Proceedings of Infocom 2002,2002.
[57]Curt Schurgers, Vlasios Tsiatsis, Mani B. Srivastava, "STEM:Topology Management for Energy Efficient Sensor Networks", in Proc. of IEEE Aerospace Conference, vol(3),2002, pp.1099-1108.
[58]P. Brighten Godfrey and David Ratajczak, "Naps:Scalable, Robust Topology Management in Wireless Ad Hoc Networks", in Proceedings of IPSN 2004,2004.
[59]J. Elson, L. Girod and D. Estrin, "Fine-Grained Network Time Synchronization Using Reference Broadcasts", in Proc. of 5th Symprosium on Operating systems Design and Implementation,2002.
[60]S. Ganeriwal, R. Kumar, S. Adlakha et al., "Network-wide Time Synchronizaiton in Sensor Networks", UCLA Technical Report, NESL01-01-2003.
[61]J. Greunen, J. Rabaey, "Lightweight time synchronization for sensor networks", in Proc. of WSNA03,2003.
[62]Su Ping, "Delay Measurement Time Synchronization for Wireless Sensor Networks", Intel Research Berkeley Lab,2003.
[63]M. Maroti, B. Kusy, G. Simon et al., "The Flooding Time Synchronization Protocol", Technical Report, Vanderbilt University,2004.
[64]Hedetn. Iem. I. S, Liestman A,"A Survey of Gossipingand Broadcasting in Communication Networks [J]",NetWorks,1988,18(4):319—349.
[65]Greenstein B, Estrin D, Govindanr, "Difs:A Distributed Index for Features in Sensor Networks", Proc of the 1st IEFF Workshop on Sensor Network Protocols and Applications[C],Washington,IEEE Computer Society,2003: 163-173.
[66]HE MAN W R, ANDRAKASAN A, BAIAKR ANH," An Application Specific Protocol Architecture for Wireless Mi2 crosensor Networks ",IEEE Trans on Wireless Communications,2002,1(4):pp660—670.
[67]杨志成,王军,强小应,朱妮,“移动AdHoc网络组播路由协议的研究综述”,现代电子技术,2006,Vol29.1,pp10-13
[68]Ji L S, Corson S,"Differential Destination Multicast",A MANET Multicast Routing Protocol for Small Groups It]. InProc INFOCOM,2001.1, pp192-1202.
[69]Lee S J, Gerla M, Chiang C C. On demand Multicast Routing Protocol(ODMRP)Proceedings of IEEE WCNC 99 New Orleans. La. Sep.1999.1298-1302.
[70]Garcia Luna Aceves J J, Madruga E L,"The Core Assisted Mesh Protocol(CAMP)", IEEE Journal on Selected Areas in Communications, Special Issue on Ad HOC Networks.1999.17(8):1380—1394.
[71]Lee S, Kim C. Neighbor Supporting Ad Hoe Multicast Rouring Protocol。2000 First Annual Workshop on Mobile and Ad Hoe Networking and Co mputing。 2000.37-44.
[72]Mingyan Liu, Rajesh R Talpade, Anthony Mcauley, "Ad HOC Multicast Routing Protocol(AMroute)。UMD TechReport 99—8.
[73]Elizabeth M Royer, Charles E Perkins. Multicast Ad Hoe On demand Distance Vector Routing (MAODV), Internet Draft, draft-ietf-manet-maodv-00. txt.
[74]Lindsey, S.; Raghavendra, C.S, "PEGASIS:Power-efficient gathering in sensor information systems",IEEE Aerospace Conference Proceedings,2002. Volume 3,pp776-782
[75]Huang C F, Tseng Y C,"The coverage problem in a wireless sensor network[C]", Proc ofthe ACM Int'Workshop on Wireless SensorNetworks and Applications(WSNA'03). New York:ACMPress,2003:115-121
[76]Wang X, Xing G, Zhang Y, et al,"Integrated coverage and connectivity configuration in wireless sensor networks"[C],Proe of the 1 st ACM Conference on Embedded Networked Sensor Systems,2003:28-39.
[77]L Van Hoesel, P Havinga,"A lightweight medium access protocol (LMAC) for wireless sensor networks",1st Int. Workshop on Networked Sensing Systems (INSS 2004),2004,pp209-216
[78]Ye W, Heidemann J, Estrin D,"Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks"IEEE/ACMTransactions on Networking,2004,12(3):493—506
[79]Lin P, Qiao C, Wang X,"Medium access control with a dynamic duty cycle for sensor networks",IEEE Wireless Communications and Networking Conference, 2004,3:1534—1539.
[80]X Wang, G Xing, Y Zhang, C Lu, R Pless, "Integrated coverage and connectivity configuration in wireless sensor networks", Proceedings of the 1st international conference on Embedded, pp349-358,2003
[81]Cerf V, Burleigh V, Hooke A, et al, Delay tolerant networking architecture. [2007-06-01]. http://tools.ietf.org/html/draft-irtf-dtnrg-arch-08
[82]Fall K. A delay tolerant network architecture for challenged Internets[c]//Proc of the ACM SIGCOMM 2003. New York:ACM,2003:27-34
[1]CHONG Chee-Yee, KUMAR Srikanta P.,"Sensor networks:Evolution, opportunities, and challenges", Proceedings of the IEEE,2003 vol91,pp 1247-1256.
[2]Perkins. Royer, "Multicast Ad Hoc On-Demand DistanceVector Routing(MAODV)"[S], IETF draft,11 July,2000
[3]K.Chert and K.Nahrstedt,"Effective Location-Guided Tree Construction Algorithm for Small Group multicast in MANET"[R],In Proceedings of IEEE Infocom 02, May,2002.
[4]Sahasrabuddhe.L. H and Mukherjee B,"Multicast routing algorithms and protocols:A tutorial", IEEE Network,2000 14(1),pp.90-104.
[5]Bluetooth SIG, "Bluetooth Specifications",V1.0, July 1999.
[6]Y-B. Ko and N. H. Vaidya,"Location-based multicast in mobile ad hoc networks"[R],Technical Report 98-018.CS Dept, Texas A&M University, September 1998.
[7]EL-SAYED A., ROCA V, MATHY L," A survey of proposals for an alternative group communication service"[J], IEEE Network,2003,17(1),pp.46-51.
[8]CHU Y H, RAO S G, SESHAN S, ZHANG H," A case for end system multicast"[J],ACM SIGMETRICS Performance Evaluation Review,2000, 28(1):1-12.
[9]CHU Y H, RAO S G, SESHAN S, ZHANG H,"Enabling conferencing applications on the internet using an overlay multicast architecture"[J], ACM SIGCOMM Computer Communication Review,2001,31(4):55-67.
[10]ZHANG Bei-chuan, JAMIN S, ZHANG Li-xia," Host multicast:a framework for delivering multicast to end users"[A], KERMANI P. IEEE INFOCOM 2002. New York, NY, USA:IEEE Press,2002.1366-1375.
[11]Hyojun Lim, Chongkwon Kim,"Multicast tree construction and flooding in wireless Ad Hoc Networks"[C]. Proceedings of ACM M SW IM, Boston:ACM Press.2000:61-68.
[12]马立平.统计数据标准化-无量纲化方法[J].北京统计.2003.03,pp34-38
[13]LIU Shan, ZHAO Heng, LIU Xuan,"Multicast routing approach with delay-constrained minimum-cost", Computer Engineering and Applications, 2007,43(16):118-120.
[14]陈敏.OPNET网络仿真[M].北京：清华大学出版社,2004.
[15]Chandra, R. Ramasubramanian, V. Birman, K," Anonymous Gossip: improving multicast reliability in mobile ad-hocnetworks"[C],21st International Conference on Distributed Computing Systems,2001.
[16]CheeOnn Chow, Hiroshi Ishii," Video Multicast Over Mobile AD Hoc Networks: Multiple-Tree Multicast AD HOC On-Demand Distance Vector Routing Protocol (MT-MAODV)" [C], PIMRC07.2007
[17]Sun BaoLin,Li Layuan," On the Reliability of MAODV in Ad Hoc Networks"[C]. IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings,2005
[18]Lei Chen,Adel Ben Mnaouer," Performance evaluation of new hybrid multicast routing protocols for ad-hoc networks"[C],9th International Conference on Communication System,2004
[19]Neugebauer. M," A new beacon order adaptation algorithm for IEEE 802.15.4 networks", Wireless Sensor Networks,2005. Proceeedings of the Second European Workshop,2005
[20]C Perkins, E Belding-Royer, S Das,"Ad hoc on-demand distance vector (AODV) routing",IETF draft.2002-06
[1]Calvert, K. L., Zegura, E. W., and Donahoo, M. J., "Core Selection Methods for Multicast Routing," Proc. Int. Conf. on Computer Communications and Networks, pp.638-642, July 1995
[2]Z. J. Haas and M. R. Pearlman, "Providing ad-hoc connectivity with the reconfigurable wireless networks," in Proc. ACM SIGCOMM'98, pp.167-177, Sept. 1998.
[3]J. L. Alvisi, D. Malkhi, E. Pierce, and M. Reiter"Fault detection for Byzantine quorum systems" In Proceedings of the 7th International Working Conference on Dependable Computing for Critical Applications, pages 357-372, January 1999.
[4]D. Malkhi, M. Reiter, and R. Wirght, "Probabilistic Quorum Systems,"Proc. ACM PODC, pp.267-273, Santa Barbara,1997.
[5]R. Prakash and M. Singhal, "Dynamic hashing+quorum=efficient location management for mobile computing systems," in Proc. ACM Symp. Principles Distributed Computing, Aug.1997, p.291.
[6]A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol.75, pp. 56-83, Jan.1987.
[7]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[8]A. Ephremides, J. E. Wieselthier, and D. J. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. IEEE, vol.75, pp. 56-83,Jan.1987.
[9]Z. J. Haas and B. Liang, "Ad Hoc Mobility Management with Uniform Quorum Systems", IEEE/ACM Trans. Net., vol.7, no.2, Apr.1999, pp.228-40.
[10]D Liu, I Stojmenovic and X Jia," A scalable Quorum based location service in ad hoc and sensor networks", Proc. of IEEE MASS,2006
[11]Richard A. Golding and Darrell D. E. Long, "Quorum-oriented multicast protocols for data replication"
[12]Sung Mo Chung, Chan-Hyun Youn, "Core Selection algorithm for multicast routing under multiple QoS constraints", IEE Electronics Letters, Volume:36 Issue:4, 17 Feb.2000, pp.278-279
[13]Billhartz, T., Cain, J. B., Farrey-Goudreau, E., Fieg, D.,and Batsell, S. G., "Performance and Resource Cost Comparisons for the CBT and PIM Multicast Routing Protocols," IEEE Journal on Selected Areas in Communications, Vol.15, No. 3, pp.304-315, April 1997
[14]Yih Huang, Fleur,E., McKinley, P.K., "LCM:a multicast core management protocol for link-state routing netowrks", Communications 1999. ICC 98. Conference Record.1998 IEEE International Conference on, Volume:2,1998, pp.1197-1201
[15]A.D. Raghavendra, S. Rai, and S.S Iyengar, "Multicast Routing in Internetworks Using Dynamic Core Based Trees", Conf. Proc. of the 1996 IEEE 15th annual Int. Phoenix Conf. On the Computers and Communications, PP.232-238, March 1996
[16]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," presented at IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[17]J. Sharony, "A mobile radio network architecture with dynamically changing topology using virtual subnets," MONET, vol.1, no.1, pp.75-86,1996.
[18]T. Crossman and A. wool. "computational experience with approximation algorithms for the set covering problem," European Jounurl of Operutional Research, no.101, pp.81-92,1997.
[19]Liang, B, Haas. Z.J,"Virtual backbone generation and maintenance in ad hoc network mobility management",INFOCOM2000, vol.3 pp1293-1302, Mar 2000
[20]M. R. Pearlman and Z.J. Haas, "litermining the optimal configuration for the Zone Routing Protocol," IEEE Journal on Selected Areas in Communications, vol.7, no.8. pp.1395-1414, August 1999.
[21]K.N. Amouris, S. Papavassiliou, M. Li, "A position based multi-zone routing protocol for wide area mobile ad-hoc networks", Proc.49th IEEE Vehicular Technology Conference,1999,1365-1369.
[22]C Shields, JJ Garcia-Luna-Aceves," The Ordered Core Based Tree Protocol", INFOCOM'97.,1997,page 884
[23]马钰璐,王重钢,程时端,多核单向共享树多播路由协议,计算机学报[J],2001vol24,p 710-715,2001.7
[24]ARON I D, GUPTA S," Analytical comparison of local and end-to-end error recovery in reactive routing protocols for mobile ad hoc networks" [C],Proceedings of the 3rd ACM International Workshop on Modeling Analysis and Simulation of W ireless and Mobile Systems. New York, USA:ACM,2000:69—76.
[25]王玉明,杨宗凯,赵大胜.基于缓存旁路和本地修复的多跳网络路由重建机制[J].电子与信息学报[J],2007,29(7)：1622-1627
[26]FENG Meiyu, CHENG Sheng, ZHANG Xu, et al. A self-healing routing scheme based on AODV in ad hoc Networks[C], Proceedings of the 4th International Conference on Computer and Information Technology. Los Alamitos, CA, USA: IEEE Computer Society,2004:616-620.
[27]PANDEY M, PACK R, IEIW, et al. To repair or not to repair:helping ad hoc routing protocols to distinguish mobility from congestion[c],INFOCOM 2007. Piscataway, NJ, USA:IEEE,2007:2311-2315.
[28]赵季红,曲桦,张鹏,Ad Hoc网络中基于链路故障的路由修复机制,西安交通大学学报[J],2009. vol43.p47-52,2009.10
[29]肖百龙,郭伟,刘军,祝思路,移动自组网路由局部修复算法的研究,计算机研究与发展[J],2007.vol44.p1383-1389
[30]C Gui, P Mohapatra. SHORT:Self-healing and optimizing routing techniques for mobile ad hoc networks[C]. ACM MOBIHOC. Annapolis.2003
[31]G P Liu, K J Wong, et al. PATCH:A novel local recovery mechanism for mobile ad hoc networks[C]. IEEE VTC, Orlando, USA.2003
[1]S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A.Woodward, "A distance routing effect algorithm for mobile wireless sensor network", Proc. MOBICOM,2008,76-84.
[2]Y.B. Ko and N.H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks", MOBICOM,1998,66-75.
[3]I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE Int. Conf. on Parallel Processing, August 21-24,2000, Toronto,173-180
[4]S. Mohan and R. Jain, "Two user location strategies for personal communications services," IEEE Personal Commun. Mag., First Quarter, pp.42-50,1994.
[5]J. Li et al., "A Scalable Location Service for Geographic Ad Hoc Routing,"Proc. 6th Annual ACM/IEEE Int'l. Conf. Mobile Comp. Net., Boston, MA,2000, pp. 120-30.
[6]R. Morris et al., Carnet:A Scalable Ad Hoc Wireless Network System,"Proc.9th ACM SIGOPS Euro. Wksp.:Beyond the PC:New Challenges for the Op. Sys., Kolding, Denmark, Sept.2000.
[7]S. Giordano and M. Hamdi, "Mobility Management:The Virtual Home Region," Tech. report, Oct.1999.
[8]I. Stojmenovic, "Home Agent Based Location Update and Destination Search Schemes in Ad Hoc Wireless Networks," Tech. rep. TR-99-10, Comp. Science, SITE, Unive. Ottawa, Sept.1999.
[9]Z. J. Haas and B. Liang, "Ad Hoc Mobility Management with Uniform Quorum Systems", IEEE/ACM Trans. Net., vol.7, no.2, Apr.1999, pp.228-40.
[10]Tsuchiya, T., Kikuno, T.,2002. Byzantine Quorum systems with maximum availability. information Processing Letters.83:71-77.
[11]Peleg, D, W ool. A,1997. Crumbling walls:a class of practical and efficient Quorum systems. Distributed Computing.10(2):87.98.
[12]Kumar.A,2002. An Efficient Super Grid Protocol for High Availability and Load Balancing. IEEE Transactions On Computer. P.1126-1133.
[13]Kafri.N, Janecek.J,2002. Dynamic Behavior of the Distributed Tree Quorum Algorithm.22nd International Conference on Distributed Computing Systems(ICD CS'2002). Vienna. Austria
[14]Fu, A. W. C., Wong, M., Yat, S.,2002. Diamond Quorum Consensus for High Capacity and Efficient in a Replicated Data System. Distributed and Parallel Databases. P.25.
[15]S. B. Davidson,H. Garcia Molina and D.Skeen, "Consistency in partitioned networks", ACM Computing Surveys,17(3):341-370,1985
[16]S.J.Mullender and P.M.B.Vitanyi,"Distributed match-making",Algorithmica,3:367-391,1988
[17]T.W.Yan and H.Garcia-Molina, "Distributed selective dissemination of information",In PROC.3rd Inter.Conf.Par.Dist.Info.Sys..paged89-98,1994
[18]M. Naor and A. Wool," Access control and signatures via Quorum secret sharing",In Proc 3rd ACM Conf. Comp and Comm. Security, pages157-168 1996
[19]D Liu, I Stojmenovic and X Jia," A scalable Quorum based location service in ad hoc and sensor networks", Proc. of IEEE MASS,2006
[20]Y. Zou and K. Chakrabarty, "Sensor Deployment and Target Localization Based on Virtual Forces," INFOCOM,2003.
[21]A. Howard, M. J. Mataric and G S. Sukhatme, "An Incremental Self-Deployment Algorithm for Mobile Sensor Networks," Autonomous Robots, Special Issue on Intelligent Embedded Systems, September 2002.
[22]B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," presented at IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
[23]J. Sharony, "A mobile radio network architecture with dynamically changing topology using virtual subnets," MONET, vol.1, no.1, pp.75-86,1996.
[24]Sung Mo Chung, Chan-Hyun Youn, "Core Selection algorithm for multicast routing under multiple QoS constraints", IEE Electronics Letters, Volume:36 Issue:4, 17 Feb.2000, pp.278-279
[25]D. Peleg and A. Wool, "Crumbling walls:A class of practical and efficient Quorum systems," in Proc.14th ACM Symp. Principle Distributed Computing,1995, pp.120-129.
[26]M. L. Neilsen," Quorum Structures in Distributed Systems" PhD thesis, Dept. Computing and Information Sciences Kansas State University,1992
[27]M.Naor and A. Wool," The load capacity and availability of Quorum systems",In Proc 35th IEEE Symp Foundations of Comp. Sci (FOCS) pages 214-225,1994
[1]Afergan M, Wein J, LaMeyer, "Experience with some Principles for Building an Internet-scale reliable System", Proceeding of Second Workshop on Real Large Distributed System,Dec.2005
[2]Ballani H, Francis P,"Towards a Global IP Anycast Service", Proceeding of the 2005 Co nference on Applications, Technologies, Architectures, and Protocols for Computer Communictions,Aug.2005
[3]Adaptec,"Advanced SCSI Programming Interface"[Z], Adaptec White Paper,1998:3-10
[4]Metz. C, "IP Anycast Point-to-(Any)Point Communication",IEEE Internet Computing,2002.04
[5]IETF, Multicast and Anycast Group Membership Charter, http://www.ietf.org/html/charters/magma-charter.html
[6]IETF, Mobile Ad Hoc Networks Working Group,http://www.ietf.org/html.charters/manetcharter.html
[7]Basturk E,"Using Network Layer Anycast for Load Distribution in the Intemet",IBM Research Report, RC20938,1997-07
[8]Peng Chao,Zhou Yini,"Anycast Routing Algofims on the Internet",IEEE,2001
[9]Xuan D,Jia W,Zhao W,"Routing Algorithms for Anycast M essages",Proc. ICPP98, 1998-08
[10]Bing Wu, Jie Wu,"k-anycast routing schemes for mobile ad hoc networks ", Parallel and Distributed Processing Symposium",2006. IPDPS 2006, pp25-29
[11]Weizhao Wang,Xiang-Yang Li," k-anycast game in selfish networks Frieder", 13th International Conference on Computer Communications and Networks, ICCCN 2004. Proceedings.11-13 Oct.2004
[12]王晓喃,唐振民,钱焕延,”IPv6中k-Anycast通信模型的研究与设计”,通信学报,200930(6),pp224-232
[13]王晓喃唐振民钱焕延,”IPv6中k-Anycast通信模型的分析与研究”,南京理工大学学报,2009 vol33(3),pp876-882
[1]孙利民,熊永平,马建,机会移动传感器网络中的自适应数据收集机制[J],通信学报,2008 vol29,186-192
[2]肖明军,黄刘生,容迟网络路由算法,计算机研究与发展[J],2009Vol46,p1065-1073
[3]熊永平,孙利民,牛建伟,刘燕,机会网络[J],软件学报,2009 vol20,p124-137
[4]JUANG OKI H, WANG Y,et al,Energy efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet [J]. SIGPI. AN Note,2002, 37(10):96-107
[5]Burns B, Brock O, Levine B N, MV routing and capacity building in disruption tolerant networks[C],Proc of the IEEE INFOCOM 2005,Piscataway, NJ:IEEE, 2005:398-408
[6]Vahdat A, Beeker D, Epidemic routing for partially connected ad hoc networks, CS-2000-06[R], Durham, NC:Duke University,2000
[7]Z Zhang, Routing in intermittently connected mobile Ad hoc networks and delay tolerant networks:overview and challenge [A]. IEEE Communications Surveys& Tutorials,st Quarter 2006.24-37.
[8]T Spyropoulos, K Psounis, Performance Analysis of Mobility assisted Routing[C]roceedings of the 8th ACM international symposium,2007
[9]Daly E, Haahr M, Social network analysis for routing in disconnected delay-tolerant MANETs[C],Proc of the ACM MOBIHOC:ACM,2007.32-40
[10]T Spyropoulos, K Psounis,Spray and Focus:Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility[C],
[11]A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the design of opportunistic forwarding algorithms[C]. In Proceedings of IEEE INFOCOM,2006.
[12]M. McNett and G. M. Voelker. Access and mobility of wireless pda users[C]. ACM Mobile Computing and Communication Review,2003.
[13]H Guo, J Li, AN Washington, C Liu, M Alfred, Performance Analysis of Homing Pigeon based Delay Tolerant Networks[C], MILCOM 2007,2007
[14]Spyropoulos T, Psounis K, Raghavendra C S, Spray and wait:An efficient routing scheme for intermittently connected mobile networks [C], Proc of the ACM SIGC()MM Workshop on Delay-Tolerant Networking (WDTN 2005), New York: ACM,2005:252-259
[15]J Whitbeck, HYMAD:Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks, https://www-rp.lip6.fr/site_npa/site_rp/_publications/1041-whitbeckaoc09_camera_re ady.pdf
[16]P Costa, C Mascolo, M Musolesi, GP Picco, Socially Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks[J], IEEE Journal on Selected Areas In Communications,Vol 26-No5, June 2008
[17]W Zhao, M Ammar, E Zegura, A message ferrying approach for data delivery in sparse mobile ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, p187-198,2004