延迟容忍移动网络路由协议的研究
|
摘要
随着低功率无线通信技术和集成电路技术的飞速发展，出现了大量低成本、便携的无线终端设备，这些无线终端设备以自组织的方式进行组网并进行数据交换。由于无线网络节点分布的稀疏性、节点自身的移动性以及节点能量消耗的不均匀性的影响，使得网络节点之间的连通是间歇性的，呈现出延迟容忍网络的特征。本文的工作则是基于这种延迟容忍移动网络的。
数据的收集和路由是延迟容忍移动网络的基本功能之一。由于延迟容忍移动网络具有间歇连通、对延迟较为容忍的特性，传统的路由技术难以直接应用，必须结合具体的网络应用并考虑延迟容忍网络的特性设计新的路由协议。本文则针对延迟容忍移动网络中具体的三种应用场景：延迟容忍移动传感器网络（DelayTolerant Mobile Sensor Network，DTMSN）、移动社会网络（Mobile Social Network，MSN）和车载自组织网络（Vehicle Ad Hoc NETwork，VANET），较为深入地研究了这三种网络的路由问题，并取得了一定成果。本文主要工作包括：
（1）在DTMSN网络背景下，针对现有DTMSN网络路由研究工作中假设节点始终处于工作状态的不合理性，提出了一种带周期性睡眠调度机制的路由协议（Periodic Sleeping-based Data routing Protocol，PSDP）。现有的相关研究工作考虑的是数据传输成功率和传输开销之间达到一个折中，为了获得较高的数据传输成功率而牺牲了节点的能量，极大的降低了网络生存时间。PSDP协议在节点的能量消耗和机会连通性之间进行了折中，引入了节点的周期性睡眠机制以节省节点的能量。节点根据自身的传输概率和到Sink的距离，确定自己的睡眠时间。通过周期性的睡眠机制，PSDP协议能够获得很长的网络生存时间以及可以接受的数据传输成功率和数据传输延迟。在更长的网络生存时间内，PSDP协议能够收集更多的数据。
（2）在MSN网络背景下，提出了一种基于热区的网络路由协议（HotArea-based Routing Protocol，HARP）。由于移动社会网络具有一定的社会特征，网络节点的移动符合一定的规律，因此可以利用这种社会特征或移动的规律性来辅助数据的传输和路由。HARP协议利用网络节点的聚集性而形成的热点区域以及节点移动的规律性，给节点赋予了一个参数——区域访问频度，用于表征该节点在网络中的活跃度。区域访问频度越高的节点具有更高的活跃度，也就有更高的可能性与目标节点相遇。针对网络中节点存在自私行为的现象，提出了HARPS（HARP with Selfish nodes）协议，节点将依据对各自的贡献度决定是否进行数据转发，以鼓励节点转发数据。
（3）在VANET背景下，提出了一种拥塞自适应的动态路线规划协议（CongestionAdaptive Trip routing Protocol，CATP）。针对现有车辆路线规划方案中不能适应当前交通拥塞的情况，CATP协议通过收集网络中的交通信息对车辆行驶的路线进行动态优化。在无需架设路边基础设施的前提下，车辆通过获取各路段的平均通行时间或平均停留时间，估计路段的交通状况，并计算新的行车路线，从而帮助用户优化车辆行驶路线，提高道路交通效率。
With the rapid development of low-power wireless communication technology andintegrated circuit technology, there emerged a large number of low-cost, portablewireless devices. The wireless devices connect and exchange data with each other inself-organization mechanism. As the sparse density, mobility and energy consumptioninhomogeneity of the wireless nodes, the mobile network is intermittent connected,showing the characteristics of delay tolerant network. Our works in the thesis are basedon delay tolerant mobile network.
Data gathering and routing is one of the major functions of delay tolerant mobilenetwork. Due to the intermittent connectivity and more delay tolerance of the network,traditional routing methods are difficult to directly apply in delay tolerant mobilenetwork. New routing protocols should be designed taking into account specificnetwork applications and the characteristics of delay tolerant network. The thesisfocuses on three specific applications of delay tolerant network: Delay Tolerant MobileSensor Network (DTMSN), Mobile Social Network (MSN), and Vehicle Ad HocNetwork (VANET). We in-depth studied the routing issue of the three networks and gotsome results. The major works include:
(1) In DTMSN, existing routing researches assume that nodes are alwaysirrationally open in the working state. Based on the irrationality of the assumption, weproposed a new protocol, Periodic Sleeping-based Data routing Protocol (PSDP).Existing relevant researches consider about the compromise between data deliverysuccess ratio and data transmission overhead. Higher data delivery success ratio isobtained at the expense of node energy, so that the network lifetime is dramaticallyreduced. PSDP trades off between node energy consumption and opportunisticconnectivity, introducing periodic node sleep mechanism to save node energy. Thesleep time is decided by node data transmission probability and the distance from nodeto sink. In periodic sleep mechanism, PSDP acquires a long lifetime, acceptable datadelivery success ratio and transmission delay. In the longer lifetime, PSDP can gathermore data.
(2) In Mobile Social Network (MSN), we proposed Hot Area-based RoutingProtocol (HARP). Due to certain social characteristics of MSN, the network nodesmove regularly. We can take advantage of the social characteristics and mobileregularity in data transmission and routing research. According to the hot area with theaggregated nodes and node mobile regularity, HARP gives each node a parameter calledregional access frequency, which shows the activity of the node in the network. Thenode with higher regional access frequency is more active, that is, the node has higherprobability to meet the target node. For selfish behavior of nodes in the network, weproposed HARPS (HARP with Selfish nodes) protocol. In HARPS, nodes will decidewhether or not to forward the data on their respective contributions to encourageforwarding data.
(3) In VANET, we proposed Congestion Adaptive Trip Routing Protocol (CATP).For existing vehicles route planning solutions cannot adapt the real-time trafficcongestion, CATP protocol dynamically optimizes the traffic routes by gathering thetraffic information in the network. Without the assistance of the roadside infrastructure,the new protocol helps people to optimize the traffic route and improve the trafficefficiency by gathering the respective average pass time and average residence time ofthe road segments, estimating the road traffic conditions and then calculating newroutes.
数据的收集和路由是延迟容忍移动网络的基本功能之一。由于延迟容忍移动网络具有间歇连通、对延迟较为容忍的特性，传统的路由技术难以直接应用，必须结合具体的网络应用并考虑延迟容忍网络的特性设计新的路由协议。本文则针对延迟容忍移动网络中具体的三种应用场景：延迟容忍移动传感器网络（DelayTolerant Mobile Sensor Network，DTMSN）、移动社会网络（Mobile Social Network，MSN）和车载自组织网络（Vehicle Ad Hoc NETwork，VANET），较为深入地研究了这三种网络的路由问题，并取得了一定成果。本文主要工作包括：
（1）在DTMSN网络背景下，针对现有DTMSN网络路由研究工作中假设节点始终处于工作状态的不合理性，提出了一种带周期性睡眠调度机制的路由协议（Periodic Sleeping-based Data routing Protocol，PSDP）。现有的相关研究工作考虑的是数据传输成功率和传输开销之间达到一个折中，为了获得较高的数据传输成功率而牺牲了节点的能量，极大的降低了网络生存时间。PSDP协议在节点的能量消耗和机会连通性之间进行了折中，引入了节点的周期性睡眠机制以节省节点的能量。节点根据自身的传输概率和到Sink的距离，确定自己的睡眠时间。通过周期性的睡眠机制，PSDP协议能够获得很长的网络生存时间以及可以接受的数据传输成功率和数据传输延迟。在更长的网络生存时间内，PSDP协议能够收集更多的数据。
（2）在MSN网络背景下，提出了一种基于热区的网络路由协议（HotArea-based Routing Protocol，HARP）。由于移动社会网络具有一定的社会特征，网络节点的移动符合一定的规律，因此可以利用这种社会特征或移动的规律性来辅助数据的传输和路由。HARP协议利用网络节点的聚集性而形成的热点区域以及节点移动的规律性，给节点赋予了一个参数——区域访问频度，用于表征该节点在网络中的活跃度。区域访问频度越高的节点具有更高的活跃度，也就有更高的可能性与目标节点相遇。针对网络中节点存在自私行为的现象，提出了HARPS（HARP with Selfish nodes）协议，节点将依据对各自的贡献度决定是否进行数据转发，以鼓励节点转发数据。
（3）在VANET背景下，提出了一种拥塞自适应的动态路线规划协议（CongestionAdaptive Trip routing Protocol，CATP）。针对现有车辆路线规划方案中不能适应当前交通拥塞的情况，CATP协议通过收集网络中的交通信息对车辆行驶的路线进行动态优化。在无需架设路边基础设施的前提下，车辆通过获取各路段的平均通行时间或平均停留时间，估计路段的交通状况，并计算新的行车路线，从而帮助用户优化车辆行驶路线，提高道路交通效率。
With the rapid development of low-power wireless communication technology andintegrated circuit technology, there emerged a large number of low-cost, portablewireless devices. The wireless devices connect and exchange data with each other inself-organization mechanism. As the sparse density, mobility and energy consumptioninhomogeneity of the wireless nodes, the mobile network is intermittent connected,showing the characteristics of delay tolerant network. Our works in the thesis are basedon delay tolerant mobile network.
Data gathering and routing is one of the major functions of delay tolerant mobilenetwork. Due to the intermittent connectivity and more delay tolerance of the network,traditional routing methods are difficult to directly apply in delay tolerant mobilenetwork. New routing protocols should be designed taking into account specificnetwork applications and the characteristics of delay tolerant network. The thesisfocuses on three specific applications of delay tolerant network: Delay Tolerant MobileSensor Network (DTMSN), Mobile Social Network (MSN), and Vehicle Ad HocNetwork (VANET). We in-depth studied the routing issue of the three networks and gotsome results. The major works include:
(1) In DTMSN, existing routing researches assume that nodes are alwaysirrationally open in the working state. Based on the irrationality of the assumption, weproposed a new protocol, Periodic Sleeping-based Data routing Protocol (PSDP).Existing relevant researches consider about the compromise between data deliverysuccess ratio and data transmission overhead. Higher data delivery success ratio isobtained at the expense of node energy, so that the network lifetime is dramaticallyreduced. PSDP trades off between node energy consumption and opportunisticconnectivity, introducing periodic node sleep mechanism to save node energy. Thesleep time is decided by node data transmission probability and the distance from nodeto sink. In periodic sleep mechanism, PSDP acquires a long lifetime, acceptable datadelivery success ratio and transmission delay. In the longer lifetime, PSDP can gathermore data.
(2) In Mobile Social Network (MSN), we proposed Hot Area-based RoutingProtocol (HARP). Due to certain social characteristics of MSN, the network nodesmove regularly. We can take advantage of the social characteristics and mobileregularity in data transmission and routing research. According to the hot area with theaggregated nodes and node mobile regularity, HARP gives each node a parameter calledregional access frequency, which shows the activity of the node in the network. Thenode with higher regional access frequency is more active, that is, the node has higherprobability to meet the target node. For selfish behavior of nodes in the network, weproposed HARPS (HARP with Selfish nodes) protocol. In HARPS, nodes will decidewhether or not to forward the data on their respective contributions to encourageforwarding data.
(3) In VANET, we proposed Congestion Adaptive Trip Routing Protocol (CATP).For existing vehicles route planning solutions cannot adapt the real-time trafficcongestion, CATP protocol dynamically optimizes the traffic routes by gathering thetraffic information in the network. Without the assistance of the roadside infrastructure,the new protocol helps people to optimize the traffic route and improve the trafficefficiency by gathering the respective average pass time and average residence time ofthe road segments, estimating the road traffic conditions and then calculating newroutes.
引文
[1] IF Akyildiz, W. Su, Y. Sankarasubramaniam, et al.Wireless sensor networks: A Survey[J].Computer Networks,2002,38(4):393-422
[2]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报，2003，l4(7):128-129
[3] J.M. Kahn, R.H. Katz, K.S.J. Pister. Next century challenges: mobile networking for smartdust[C]. Proceedings of the5th Annual ACM/IEEE International Conference on MobileComputing and Networking,1999,271-278
[4]A.B. Maxim, R. Mohammad, Y. Yan. Call and response: experiments in sampling theenvironment[C]. Proceedings of the Second International Conference on Embedded NetworkedSensor Systems,2004,25-38
[5] R. Szewczk, A. Mainwaring, J. Polastre. Analysis of a large scale habitat monitoringapplication[C]. Proceedings of the Second International Conference on Embedded NetworkedSensor Systems,2004,214-226
[6] Great duek island[EB/OL]. http://www.greatduekisland.net/,2008
[7] N. Noury, T. Herve. Monitoring behavior in home using a smart fall sensor[C]. Proceedings ofIEEE-EMBS Special Topic Conference on Micro Technologies in Medicine and Biology,2000,607-610
[8]孙利民,李建中,陈渝等.无线传感器网络[M].北京：清华大学出版社，2005，1-54
[9] MIT technologyreview[EB/OL]. http://www.technologyreview.com/,2003
[10] M. Rudack, M. Meincke, M. Lott. On the dynamics of ad hoc networksfor inter vehicle communication (IVC)[C]. Proceedings of the ICWN,2005,34-39
[11] Q. Xu, T. Mark, et al. Vehicle-to-Vehicle Safety Messaging in DSRC[C]. Proceedings ofVANET,2004,19-27
[12] J. Eriksson, H. Balakrishnan, S. Madden. Cabernet: Vehicular Content Delivery Using WiFi[C].Proceedings of MOBICOM,2008,199-213
[13] R. Panayappan, J. Trivedi, et al. VANET-based approach for parking spaceavailability[C]. Proceedings of ACM VANET,2007,75-79
[14] J. Kulik, W.R. Heinzelman, H. Balakrishnan. Negotiation based protocols for disseminatinginformation in wireless sensor networks[J]. Wireless Networks,2002,8(2):169185
[15] K. Sohrabi, J. Gao, V. Ailawadhi, et al. Protocols for self-organization of a wireless sensornetwork[J]. IEEE Personal Communications,2000,7(5):1627
[16] W. Heinzelman, A. Chandrakasan, H. Balakrishnan. Energy-efficient communication protocolfor wireless microsensor networks[C]. Proceedings of the33rd Annual Hawaii InternationalConference on System Sciences. Maui: IEEE Computer Society,2000:3005-3014
[17] C. Intanagonwiwat, R. Govindan, D. Estrin, et al. Directed diffusion for wireless sensornetworking[J]. IEEE/ACM Transacations on Networking,2003,11(1):216
[18] A. Manjeshwar, D.P. Agrawal. TEEN: A protocol for enhanced efficiency in wireless sensornetworks[C]. Proceedings of the15th Parallel and Distributed Processing Symp. San Francisco,IEEE Computer Society,2001,2009-2015
[19] P. Juang, H. Oki, Y. Wang. Energy-efficient computing for wildlife tracking: design tradeoffsand early experiences with zebranet[C]. Proceedings of the10th Int’l Conf. on ArchitecturalSupport for Programming Languages and Operating Systems,2002,96107
[20] T. Small, Z.J. Haas. The shared wireless infostation model: a new ad hoc networkingparadigm[C]. Proceedings of the4th ACM Int’l Symp. on Mobile Ad Hoc Networking,2003,233244
[21] K. Fall. A Delay-Tolerant Network Architecture for Challenged Internets[C]. Proceedings of the2003conference on Applications, technologies, architectures, and protocols for computercommunications,2003,27-34
[22] B. Burns et al. MV Routing and Capacity Building in Disruption Tolerant Networks[C].Proceedings of INFOCOM2005,2005,398-408
[23] S. Jain, M. Demmer, R. Patra, K. Fall. Using Redundancy to Cope with Failures in a DelayTolerant Network[C]. Proceedings of SIGCOMM2005,2005,109-120
[24] H. Melissa and K. Fall. Poster: Delay Tolerant Networking for Sensor Networks[C]. In the FirstIEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON2004)，2004
[25] C. E. Perkins, E. M. Royer. Ad hoc on-demand distance vector routing[C]. Proceedings of the1999International Workshop on Mobile Computing Systems and Applications,1999,66-73
[26] D. Johnson, D. Maltz. Dynamic source routing in ad-doc wireless networks[J]. MobileComputing,1996,36:153-181
[27] C. E. Perkins, P. Bhagwat. Highly dynamic destination sequenced distance-vector routing(DSDV) for Mobile computers[J]. Computer Communication Review,1994,24(4):234-244
[28] S. Murthy, J. J. Bareia, Luna-Aeeves. An efficient routing protocol for wireless networks[J].ACM Mobile Networks and Applications Journal, Special issue on Routing in MobileCommunication Networks,1996,1(2):183-193
[29] R. C. Shah, S. Roy, S. Jain, W. Brunette. Data MULEs: modeling a three-tier architecture forsparse sensor networks[C]. Proceedings of the First International Workshop on Sensor NetworkProtocols and Applications. Anchorage: IEEE Computer Society Press,2003,30-41
[30] Khaled A. Harras, Kevin C. Almeroth, Elizabeth M. Belding-Royer. Delay Tolerant MobileNetworks (DTMNs): Controlled Flooding in Sparse Mobile Networks[J]. IFIP Networking,2005,1-11
[31]IF Akyildiz, B. Akan, C. Chen C, et al. Interplanetary internet: state-of-the-art and researchchallenges[J]. Computer Networks,2003,43(2):75112
[32] A. Pentland, R. Fletcher, A. Hasson. DakNet: rethinking connectivity in developing nations[J].Computer,2004,37(1):7883
[33] Wizzy Project[EB/OL]. http://www.wizzy.org.za,2003
[34] W. Zhao, M. Ammar, E. Zegura. New directions: a message ferrying approach for data deliveryin sparse mobile ad hoc networks[C]. Proceedings of MobiHoc,2004,67-76
[35] B. Christian, H. Hannes, P.C. Xavier. Stochastic properties of the random waypoint mobilitymodel[J]. Wireless Networks,2004,10(5):555-567
[36] C. Bettstetter. Mobility modeling in wireless networks: Categorization, smooth movement, andborder effects[J]. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):5566
[37] M. Musolesi, C. Mascolo. A community based mobility model for ad hoc network research[C].The2nd Interational Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality, NewYork: ACM,2006,3138
[38] A. Lindgren, A. Doria, O. Schelén. Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):1920
[39] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Performance analysis of mobility-assistedrouting[C]. Proceeding of the7th ACM International Symposium on Mobile Ad Hoc Networkingand Computing, Florence: ACM,2006,4960
[40] W.J. Hsu, T. Spyropoulos, K. Psounis, et al. Modeling time-variant user mobility in wirelessmobile networks[C]. Proceeding of the26th IEEE International Conference on ComputerCommunications, IEEE,2007,758766
[41] Q. Zheng, et al. An agent based mobility model[C]. IEEE ANSS2006,2006,168-175
[42] F. Bai,N. Sadagopan,A. Helmy. Important:a frame work to systematically analyze the impact ofmobility on performance o frouting protocols fo rad hoc networks[C]. Proceeding of the22thIEEE Annual Joint Conference on Computer Communications and Networking INFOCOM.03,2003,825-835
[43] V. DAVIES. Evaluating mobility models within an ad hoc network[D]. USA: Colorado Schoolof Mines,2000,35-38
[44] N. Eagle, A. Pentland. Reality mining: sensing complex social systems[J]. Personal UbiquitousComputing,2006,10(4):255268
[45] C. Diot, M. Martin, N. Erik. Haggle project[EB/OL]. http://www.haggleproject.org,2004
[46] P. Hui, J. Crowcroft. How small labels create big improvements[C]. Proceeding of the5thAnnual IEEE International Conference on Pervasive Computing and CommunicationsWorkshops-Cover,2007,65-70
[47] V. Srinivasan, M. Motani, W. T. Ooi. Analysis and implications of student contact patternsderived from campus schedules[C]. Proceeding of2006ACM International Conference onMobile Computing and Networking,2006,195206
[48] X. Zhang, J. Kurose, B. N. Levine. Study of a bus-based disruption-tolerant network: Mobilitymodeling and impact on routing[C]. Proceeding of2007ACM International Conference onMobile Computing and Networking, Montréal,2007,195206
[49]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报,2003, l4(7):1282-129
[50] A. Mainwaring, et al. Wireless Sensor Networks for Habitat Monitoring[C]. Proceeding ofWSNA2002,133-145
[51] I. F. Akyildiz, D. Pompili, and T. Melodia. Underwater Acoustic Sensor Networks: ResearchChallenges[J]. Ad Hoc Networks (Elsevier),2005,3(3):257-279
[52] H. Bret, B. Vladimir, K. Chen, M. Goraczko, et al. CarTel: A Distributed Mobile SensorComputing System[C]. Proceeding of SenSys’2006,2006,125-138
[53] Y. Wang, F. Lin, H. Wu. Poster: efficient data transmission in delay fault tolerant mobile sensornetworks[C]. Proceeding of IEEE International Conference on Network Protocols,2005,1021-1034
[54] A.Chandrakasan, R.Amirtharajah, S.H.Cho, et al. Design considerations for distributed microsensor systems[C]. Proceeding of the IEEE Custom Integrated Circuits Conference(CICC),1999,279-286
[55] Great Duek Island[EB/OL]. http://www.greatduekisland.net/,2008
[56] A. McMahon, S. Farrell. Delay and disruption-tolerant networking[J]. Internet Computing,2009,13(6):82-87
[57] J. A. Stankovic, et al. Wireless Sensor Networks for In-Home Healthcare: Potential andChallenges[C]. Proceeding of of High Confidence Medical Device Software and Systems(HCMDSS) Workshop,2005,356-367
[58] J. L. Paul. Smart sensor web: Tactical battlefield visualization using sensor fusion[J]. IEEEAerospace and Electronic Systems Magazine,2006,21(1):13-20
[59] H. Pan, A. Chaintreau, J. Scott, et al. Pocket switched networks and human mobility inconference environments[C]. Proceeding of ACM SIGCOMM Workshop on Delay-TolerantNetworking, Philadelphia: ACM,2005,244251
[60] S. Milgram..The small world Problem[J].Psychology today,1967,2(l):60-67
[61]M. E. J. Newman. Coauthor ship networks and patterns of scientific collaboration [J].Proceedings of the National Academy of Sciences of the United States of America,2004,101(Suppll):5200
[62] M. Motani, V. Srinivasan, P. S. Nuggehalli. Peoplenet: engineering a wireless virtual socialnetwork[C]. Proceedings of the1lth aunual international conference on Mobile computing andnetworking,2005,243-257
[63] E. Daly, M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets[C].Proceeding of ACM MobiHoc,2007,32-40
[64] W. Hsu, D. Dutta,A. Helmy. Mining behavioral groups in large wireless LANs[C]. Proceedingsof the13th annual ACM international conference on Mobile computing and networking,2007,338-341
[65] P. Costa, C. Mascolo, M. Musolesi, G.P. Picco. Socially-Aware routing for publish-subscribe indelay-tolerant mobile ad hoc networks[J]. IEEE Journal of Selected Areas in Communication,2008,26(5):748760
[66] Dedicated short range communications home[EB/OL]. http://www.leearmstrong.com/dsrc,2003
[67] Wireless access in vehicular environments[EB/OL]. http://www.ieee802.org/11/Reports,2009
[68] W. Franz, R. Eberhardt, T. Luckenbach. Fleetnet-internet on the road[C]. The8th WorldCongress on Intelligent Transportation Systems,2001,142-150
[69] Car-to-car communication consortium[EB/OL]. http://www.car-to-car.org,2005
[70] Vehicle infrastructure integrationrogram[EB/OL]. http://www.omniair.org/vii/,2006
[71] U.S department of transportation. Intelligent transportation systems[EB/OL].http://www.its.dot.gov,2004
[72] M. Rudack, M. Meincke, M. Lott. On the dynamics of ad hoc networks for inter vehiclecommunication[C]. Proceeding of the ICWN,2002,321-325
[73] S.Y. Ni, Y.C. Tseng. The broadcast storm problem in a mobile ad hoc network[C]. Proceeding ofthe5th Annual ACM/IEEE Int’l Conf. on Mobile Computing and Networking,1999,152-162
[74] A. Mahajan. Evaluation of mobility models for vehicular ad-hoc network simulations[R]. USA:The Florida State University,2005,77-82
[75] Q. Xu, T. Mark. Vehicle-to-vehicle safety messaging in dsrc[C]. Proceeding of ACM VANET,2004,19-28
[76]宋超，刘明，龚海刚.基于分布式实时机制的车载网络出行计划算法[J].计算机应用研究,2009,26(9):3440-3447
[77] Y. Yu, B. Liu, T. Wu, M. Liu. Flow-Based Travel plan via VANET[J]. Journal of JDCTA,2011,5(6),163-171
[78] R. Panayappan, J.M. Trivedi. Vanet-based approach for parking space availability[C].Proceeding of ACM VANET,2007,75-76
[79] J. Zhao, G. Cao. Vadd: vehicle-assisted data delivery in vehicular ad hoc networks[C]. IEEEINFOCOM,2006,1-12
[80]E. P. C. Jones, P. A. S. Ward. Routing strategies for delay tolerant networks[EB/OL].http://www. tct.hut. fi/opetus/s383151/articles/dtn-routing-survey. pdf,2003
[81]肖明军，黄流生.容迟网络路由算法[J].计算机研究与发展,2009,46(7):1065-1073
[82] M. Grossglauser, T. DNC. Mobility increases the capacity of ad hoc wireless networks[J].IEEE/ACM Transactions on Networking,2002,10(4):477486
[83] A. Vahdat, D. Becker. Epidemic routing for partially connected ad hoc networks[R]. TechnicalReport, USA: Duke University,2000
[84] P. Mundur, M. Seligman, J. N. Lee. Immunity-based Epidemic Routing in IntermittentNetworks[C]. Proceeding of Secon2008,609-611
[85] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Spray and wait: An efficient routing scheme forintermittently connected mobile networks[C]. Proceeding of2005ACM SIGCOMM Workshopon DelayTolerant Networking,2005,252259
[86] L. J. Chen, C. H. Yu, T.Sun. A hybrid routing approach for opportunistic networks[C].Proceeding of ACM SICCOMM Workshop on Challenged Networks,2006,213-220
[87] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Spray and focus: Efficient mobility-assistedrouting for heterogeneous and correlated mobility[C]. Proceeding of the IEEE PerComWorkshop on Intermittently Connected Mobile Ad Hoc Networks,2007,902-910
[88] J. EPC, L. Li, W. PAS. Practical routing in delay-tolerant networks[C]. Proceeding of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking,2005,237243
[89] A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connectednetworks[J]. SIGMOBILE: Mobile Computing Communications Review,2003,7:19–20
[90]许富龙,刘明,龚海刚等.延迟容忍传感器网络基于相对距离的数据传输[J].软件学报2010,21(3):490-504
[91] Y. Wang, H.Y. Wu. Replication-Based efficient data delivery scheme (RED) forDelay/Fault-Tolerant mobile sensor network (DFT-MSN)[C]. Proceeding of4thAnnual IEEE International Conference on Pervasive Computing andCommunications Workshops,2006,485-489
[92] Y. Wang, H.Y. Wu. Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A NewParadigm for Pervasive Information Gathering[J]. IEEE Transactions On Mobile Computing,2007,6(9):1021-1034
[93] Y. Wang, H.Y. Wu, H.Dang. Analytic study of Delay/Fault-Tolerant mobile sensornetworks(DFT-MSN’s)[R]. Technical Report, Lafayette:CACS, University of Louisiana atLafayette,2006
[94] B. Pasztor, M. Musolesi, C. Mascolo. Opportunistic Mobile Sensor Data Collection withSCAR[C]. Proceeding of the Fourth IEEE International Conference on Mobile Ad-hoc andSensor Systems. Pisa:2007,1-12
[95] Y. Wang, H.Y. Wu, F. Lin, and N.F. Tzeng. Cross-layer Protocol Design and Optimization forDelay/Fault-Tolerant Mobile Sensor Networks[J]. IEEE Journal on Selected Areas inCommunications (JSAC), Special Issue on Delay and Disruption Tolerant WirelessCommunication,2008,26(5):809-819
[96] P. Hui, J. Crowcroft, E. Yoneki. Bubble rap: social-based forwarding in delay tolerantnetworks[C]. Proceeding of ACM MobiHoc,2008,241-250
[97] E. Daly, M. Haahr. Social network analysis for routing in disconnected delay-tolerantMANETs[C]. Proceeding of ACM MobiHoc,2007,32-40
[98] J. gila Bitsch Link, N. Viol, A. Goliath, and K. Wehrle. SimBetAge: Utilizing TemporalChanges in Social Networks for Pocket Switched Networks[C]. Proceedings of the1st ACMWorkshop on User-provided Networking: Challenges and Opportunities,2009,13-18
[99] K. Jahanbakhsh, G. C. Shoja, and V. King. Social-Greedy: A Socially-based Greedy RoutingAlgorithm for Delay Tolerant Networks[C]. Proceedings of the International Workshop onMobile Opportunistic Networking,2010,159-162
[100] M. Abderrahmen, M. Martin, D. Christophe, et al. Peoplerank: social opportunisticforwarding[C]. Proceeding of INFOCOM,2010,111-115
[101] C. Liu, J. Wu. An optimal probabilistic forwarding protocol in delay tolerant networks[C].Proceeding of ACM MobiHoc,2009,1-10
[102]C. Liu, J. Wu. Routing in a cyclic MobiSpace[C]. Proceeding of ACM MobiHoc,2008,351-360
[103] J. Liu, H. Gong, J. Zeng. Preferance location based routing in delay tolerant netork[J]. JDCTA.2011,5(12):468-474
[104] J. Liu, M. Liu, H. Gong. Expected Shortest Path Routing for Social-oriented IntermittentlyConnected Mobile Network[J]. Journal of Convergence Information Technology,2012,7(1):94-101
[105] W.J. Hsu, D. Dutta, A. Helmy. CSI: a paradigm for behavior-oriented delivery services inmobile human networks[J]. Ad hoc networks,2011,6(4):13-24
[106] V. Namboodiri,M. Agarwal,and L.Gao. A study on the feasibility of mobile gateways forvehicular ad-hoc networks[C]. Proceedings of the First Internationalworkshop on Vehicular AdHoc Networks,2004,66-75
[107] V. Naumov, T.R. Gross. Connectivity-aware routing in vehicular ad doc networks[C].Proceeding of IEEE INFOCOM,2007,1919-1927
[108] D. Yong, W. Chen, L. Xiao. A static-node assisted adaptive routing protocol in vehicularnetworks[C]. Proceeding of ACM VANET,2007,59-68
[109] Q. Li, D. Rus. Sending messages to mobile users in disconnected ad-hoc wireless networks[C].Proceeding of Mobile Computing and Networking,2000,44-55
[110] J. Davis, A. Fagg, B. Levine. Wearable computers as packet transport mechanisms inhighly-partitioned ad-hoc networks[C]. Proceeding of International Symposium on WearableComputing,2001,141-148
[111] B. Burns, O. Brock, B. Levine. Mv routing and capacity building in disruption tolerantnetworks[C]. Proceeding of IEEE INFOCOM,2005,398-408
[112] J. Burgess, B. Gallagher. Maxprop: routing for vehicle-based disruption-tolerantnetworking[C]. Proceeding of IEEE INFOCOM,2006,1-11
[113] D. Niculescu, B. Nath. Trajectory based forwarding and its applications[C]. ProceedingMobiCom,2003,758-761
[114] B. Karp, H.T. Kung. Gpsr: greedy perimeter stateless routing for wireless networks[C].Proceeding of ACM MOBICOM'00,2000,586-589
[115] C. Lochert, H. Hartenstein. A routing strategy for vehicular ad hoc networks in cityenvironments[C]. Proceeding of IEEE Intelligent Vehicles Symposium,2003,156-161
[116] C. Lochert, M. Mauve.Geographic routing in city scenarios[J]. ACM SIGMOBILE MobileComputing and Communications Review,2005,9(1):69-72
[117] L. Fan, W. Yu. Routing in vehicular ad hoc networks: a survey[J]. IEEE Vehicular TechnologyMagazine, June2007,2(2):12-22
[118] C. Maih fer. A survey of geocast routing protocols[J]. IEEE Communications Surveys&Tutorials,2004,6(2):32-42
[119] L. Wischof, A. Ebner, H. Rohling. Information dissemination in self organising intervehiclenetworks[J]. IEEE Trans. on Intelligent Transportation Systems,2005,6(3):90-101
[120] A. Bachir, A. Benslimane. A multicast protocol in ad hoc networks intervehicle geocast[C].Proceeding of the57th IEEE Semiannual Vehicular Technology Conference,2003,2456-2460
[121] C. Maih fer, T. Leinmüller, E. Schoch. Abiding geocast: time-stable geocast for ad hocnetworks[C]. The2nd ACM international workshop on Vehicular ad hoc networks,2005,20-29
[122] H. Wu, R.M. Fujimoto, R. Guensler, M. Hunter. Mddv: s mobility-centric data disseminationalgorithm for vehicular networks[C]. Proceeding of the ACM1st Int’l Workshop on Vehicular AdHoc Networks(VANET2004),2004,47-56
[123] M. Caliskan, D. Graupner, M. Mauve. Decentralized discovery of free parking places[C]. TheACM3rd Int’l Workshop on Vehicular Ad Hoc Networks,2006,30-39
[124]宋超，刘明，龚海刚等.基于分布式实时信息的车载网络路由协议[J].软件学报，2011,22(3):466480
[125] H.Y. Huang, P.E. Luo. Performance evaluation of SUVnet with Real-Time Traffic Data. IEEETransactions on Vehicular Technology,2007,3381-3396
[126] C. L. Kevin, L. Michael. Louvre: landmark overlays for urban vehicular routingenvironments[C]. IEEE68th Vehicular Technology Conference,2008,1-5
[127] B. Wiegel, Y. Gunter, and H. Grossmann. Cross-layer design for packet routing in vehicular adhoc networks[C]. Vehicular Technology Conference,2007,2169-2173
[128] R. E. R.A. Santos and N. Seed. Inter vehicular data exchange between fast moving road trafficusing ad-hoc cluster based location algorithm and802.11b direct sequence spread spectrumradio[C]. Proceeding of PostGraduate Networking Conference,2003,333-343
[129] G. Dantzig, and J. H.Ramser. The Truck Dispatching Problem.[J]. Management Science,1959,6(1):80–91
[130] C. X. Zhao, T. R. Zhou. Prediction-based Energy Efficient Clustering Approach for WirelessSensor Networks [J]. Journal of Convergence Information Technology,2011,6(4):152-158
[131] H. W. Kim, H. S. Seo, et al. Modeling of Energy efficient Applicable Routing Algorithm inWSN [J]. International Journal of Digital Content Technology and its Applications,2010,4(5):13-22
[132] M. Stemm and R. H. Katz. Measuring and reducing energy consumption of network interfacesin hand-held devices[J]. IEICE Trans.Commun.,1997, E80-B(8),1125–1131
[133] The Network Simulator[EB/OL]. http://www.isi.edu/nsnam/ns/,2010
[134] W. B. Heinzelman, A. P. Chandrakasan. An application-specific protocol architecture forwireless microsensor networks [J]. IEEE Transaction on Wireless Communications,2002,1(4):660670
[135] UCSD. Wireless topology discovery project[EB/OL].http://sysnet.ucsd.edu/wtd/wtd.html,2007
[136] S. Zhong, J. Chen, R. Yang. A simple, cheat-proof, credit-based system for mobile ad hocnetworks [C]. Proceedings of the INFOCOM, USA, IEEE Press,2003,1987-1997
[137]W.Wang, S.Eide and Y. Wang. OURS: optimal unicast routing systems in non-cooperativewireless network[C]. Proeeedings of MOBICOM. LosAngeles,2006,402-413
[138]A.Y Ye, L. Xu. Study on cooperation in mobile ad hoc networks[J]. Mini-Micro system,2005,26(11):1886-1889
[139]S. Buchegger, J. L. Boudec. Self-Policing mobile ad hoc networks by reputation systems[J].IEEE Communications Magazine,2005,43(7):101-107
[140]M.Felegyazi, J.P.Hubaux and L.Buttyan. Nash equilibria of packets forwarding strategies inwireless ad hoc networks [J]. IEEE Transactionon Mobile Computing,2006,5(4):463-475
[141]L.Huang, L. X. Liu. Study on cooperation stimulation mechanism in routing discovery of adhoc networks[J]. Chinese Journal of Computers,2008,31(2):262-269
[142] G. Christodoulou, K. Mehlhorn, and E. Pyrga. Improving the Price of Anarchy for SelfishRouting via Coordination Mechanisms[C]. Proceeding of ESA2011,2011,119-130
[143] E. Koutsoupias, C. Papadimitriou. Worst-Case Equilibria[M]. Prceeding of the16thAnuualSymposium on Theoretical Aspects of Computer Sciencee,1999,404-413
[144] M. Gairing, T. Lucking, M. Mavronicolas, et al. The Price of Anarchy for Restricted ParallelLinks[J]. Parallel Processing Letters,2006,16(1):117–132
[145]V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, R.R. Rao. Cooperation in wireless ad hocnetworks [C]. Proceedings of20th Annual Joint Conference of the IEEE Computer andCommunications.2003,808-817
[146]K. SenkoM. A reputation-based service differentiation scheme for mobile Ad Hoc Networks[C]. Proceeding of WiMob2005, NewYork,2005,197-204
[147] U.S. Department of Transportation. Ten-Year National Program Plan and Research Agenda forIntelligent Transportation Systems in the United States [R]. The Intelligent TransportationSociety of America and the United States Department of Transportation,2001
[148] B. Hoh, M. Gruteser, R. Herring, J. Bana, D. Work. Virtual Trip Lines for DistributedPrivacy-Preserving Traffic Monitoring [C]. Proceedings of6th international conference onMobile systems, applications, and services,2008,15-28
[149] The Vehicular Mobility Model[EB/OL]. http://vanet.eurecom.fr/,2010
[2]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报，2003，l4(7):128-129
[3] J.M. Kahn, R.H. Katz, K.S.J. Pister. Next century challenges: mobile networking for smartdust[C]. Proceedings of the5th Annual ACM/IEEE International Conference on MobileComputing and Networking,1999,271-278
[4]A.B. Maxim, R. Mohammad, Y. Yan. Call and response: experiments in sampling theenvironment[C]. Proceedings of the Second International Conference on Embedded NetworkedSensor Systems,2004,25-38
[5] R. Szewczk, A. Mainwaring, J. Polastre. Analysis of a large scale habitat monitoringapplication[C]. Proceedings of the Second International Conference on Embedded NetworkedSensor Systems,2004,214-226
[6] Great duek island[EB/OL]. http://www.greatduekisland.net/,2008
[7] N. Noury, T. Herve. Monitoring behavior in home using a smart fall sensor[C]. Proceedings ofIEEE-EMBS Special Topic Conference on Micro Technologies in Medicine and Biology,2000,607-610
[8]孙利民,李建中,陈渝等.无线传感器网络[M].北京：清华大学出版社，2005，1-54
[9] MIT technologyreview[EB/OL]. http://www.technologyreview.com/,2003
[10] M. Rudack, M. Meincke, M. Lott. On the dynamics of ad hoc networksfor inter vehicle communication (IVC)[C]. Proceedings of the ICWN,2005,34-39
[11] Q. Xu, T. Mark, et al. Vehicle-to-Vehicle Safety Messaging in DSRC[C]. Proceedings ofVANET,2004,19-27
[12] J. Eriksson, H. Balakrishnan, S. Madden. Cabernet: Vehicular Content Delivery Using WiFi[C].Proceedings of MOBICOM,2008,199-213
[13] R. Panayappan, J. Trivedi, et al. VANET-based approach for parking spaceavailability[C]. Proceedings of ACM VANET,2007,75-79
[14] J. Kulik, W.R. Heinzelman, H. Balakrishnan. Negotiation based protocols for disseminatinginformation in wireless sensor networks[J]. Wireless Networks,2002,8(2):169185
[15] K. Sohrabi, J. Gao, V. Ailawadhi, et al. Protocols for self-organization of a wireless sensornetwork[J]. IEEE Personal Communications,2000,7(5):1627
[16] W. Heinzelman, A. Chandrakasan, H. Balakrishnan. Energy-efficient communication protocolfor wireless microsensor networks[C]. Proceedings of the33rd Annual Hawaii InternationalConference on System Sciences. Maui: IEEE Computer Society,2000:3005-3014
[17] C. Intanagonwiwat, R. Govindan, D. Estrin, et al. Directed diffusion for wireless sensornetworking[J]. IEEE/ACM Transacations on Networking,2003,11(1):216
[18] A. Manjeshwar, D.P. Agrawal. TEEN: A protocol for enhanced efficiency in wireless sensornetworks[C]. Proceedings of the15th Parallel and Distributed Processing Symp. San Francisco,IEEE Computer Society,2001,2009-2015
[19] P. Juang, H. Oki, Y. Wang. Energy-efficient computing for wildlife tracking: design tradeoffsand early experiences with zebranet[C]. Proceedings of the10th Int’l Conf. on ArchitecturalSupport for Programming Languages and Operating Systems,2002,96107
[20] T. Small, Z.J. Haas. The shared wireless infostation model: a new ad hoc networkingparadigm[C]. Proceedings of the4th ACM Int’l Symp. on Mobile Ad Hoc Networking,2003,233244
[21] K. Fall. A Delay-Tolerant Network Architecture for Challenged Internets[C]. Proceedings of the2003conference on Applications, technologies, architectures, and protocols for computercommunications,2003,27-34
[22] B. Burns et al. MV Routing and Capacity Building in Disruption Tolerant Networks[C].Proceedings of INFOCOM2005,2005,398-408
[23] S. Jain, M. Demmer, R. Patra, K. Fall. Using Redundancy to Cope with Failures in a DelayTolerant Network[C]. Proceedings of SIGCOMM2005,2005,109-120
[24] H. Melissa and K. Fall. Poster: Delay Tolerant Networking for Sensor Networks[C]. In the FirstIEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON2004)，2004
[25] C. E. Perkins, E. M. Royer. Ad hoc on-demand distance vector routing[C]. Proceedings of the1999International Workshop on Mobile Computing Systems and Applications,1999,66-73
[26] D. Johnson, D. Maltz. Dynamic source routing in ad-doc wireless networks[J]. MobileComputing,1996,36:153-181
[27] C. E. Perkins, P. Bhagwat. Highly dynamic destination sequenced distance-vector routing(DSDV) for Mobile computers[J]. Computer Communication Review,1994,24(4):234-244
[28] S. Murthy, J. J. Bareia, Luna-Aeeves. An efficient routing protocol for wireless networks[J].ACM Mobile Networks and Applications Journal, Special issue on Routing in MobileCommunication Networks,1996,1(2):183-193
[29] R. C. Shah, S. Roy, S. Jain, W. Brunette. Data MULEs: modeling a three-tier architecture forsparse sensor networks[C]. Proceedings of the First International Workshop on Sensor NetworkProtocols and Applications. Anchorage: IEEE Computer Society Press,2003,30-41
[30] Khaled A. Harras, Kevin C. Almeroth, Elizabeth M. Belding-Royer. Delay Tolerant MobileNetworks (DTMNs): Controlled Flooding in Sparse Mobile Networks[J]. IFIP Networking,2005,1-11
[31]IF Akyildiz, B. Akan, C. Chen C, et al. Interplanetary internet: state-of-the-art and researchchallenges[J]. Computer Networks,2003,43(2):75112
[32] A. Pentland, R. Fletcher, A. Hasson. DakNet: rethinking connectivity in developing nations[J].Computer,2004,37(1):7883
[33] Wizzy Project[EB/OL]. http://www.wizzy.org.za,2003
[34] W. Zhao, M. Ammar, E. Zegura. New directions: a message ferrying approach for data deliveryin sparse mobile ad hoc networks[C]. Proceedings of MobiHoc,2004,67-76
[35] B. Christian, H. Hannes, P.C. Xavier. Stochastic properties of the random waypoint mobilitymodel[J]. Wireless Networks,2004,10(5):555-567
[36] C. Bettstetter. Mobility modeling in wireless networks: Categorization, smooth movement, andborder effects[J]. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):5566
[37] M. Musolesi, C. Mascolo. A community based mobility model for ad hoc network research[C].The2nd Interational Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality, NewYork: ACM,2006,3138
[38] A. Lindgren, A. Doria, O. Schelén. Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):1920
[39] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Performance analysis of mobility-assistedrouting[C]. Proceeding of the7th ACM International Symposium on Mobile Ad Hoc Networkingand Computing, Florence: ACM,2006,4960
[40] W.J. Hsu, T. Spyropoulos, K. Psounis, et al. Modeling time-variant user mobility in wirelessmobile networks[C]. Proceeding of the26th IEEE International Conference on ComputerCommunications, IEEE,2007,758766
[41] Q. Zheng, et al. An agent based mobility model[C]. IEEE ANSS2006,2006,168-175
[42] F. Bai,N. Sadagopan,A. Helmy. Important:a frame work to systematically analyze the impact ofmobility on performance o frouting protocols fo rad hoc networks[C]. Proceeding of the22thIEEE Annual Joint Conference on Computer Communications and Networking INFOCOM.03,2003,825-835
[43] V. DAVIES. Evaluating mobility models within an ad hoc network[D]. USA: Colorado Schoolof Mines,2000,35-38
[44] N. Eagle, A. Pentland. Reality mining: sensing complex social systems[J]. Personal UbiquitousComputing,2006,10(4):255268
[45] C. Diot, M. Martin, N. Erik. Haggle project[EB/OL]. http://www.haggleproject.org,2004
[46] P. Hui, J. Crowcroft. How small labels create big improvements[C]. Proceeding of the5thAnnual IEEE International Conference on Pervasive Computing and CommunicationsWorkshops-Cover,2007,65-70
[47] V. Srinivasan, M. Motani, W. T. Ooi. Analysis and implications of student contact patternsderived from campus schedules[C]. Proceeding of2006ACM International Conference onMobile Computing and Networking,2006,195206
[48] X. Zhang, J. Kurose, B. N. Levine. Study of a bus-based disruption-tolerant network: Mobilitymodeling and impact on routing[C]. Proceeding of2007ACM International Conference onMobile Computing and Networking, Montréal,2007,195206
[49]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报,2003, l4(7):1282-129
[50] A. Mainwaring, et al. Wireless Sensor Networks for Habitat Monitoring[C]. Proceeding ofWSNA2002,133-145
[51] I. F. Akyildiz, D. Pompili, and T. Melodia. Underwater Acoustic Sensor Networks: ResearchChallenges[J]. Ad Hoc Networks (Elsevier),2005,3(3):257-279
[52] H. Bret, B. Vladimir, K. Chen, M. Goraczko, et al. CarTel: A Distributed Mobile SensorComputing System[C]. Proceeding of SenSys’2006,2006,125-138
[53] Y. Wang, F. Lin, H. Wu. Poster: efficient data transmission in delay fault tolerant mobile sensornetworks[C]. Proceeding of IEEE International Conference on Network Protocols,2005,1021-1034
[54] A.Chandrakasan, R.Amirtharajah, S.H.Cho, et al. Design considerations for distributed microsensor systems[C]. Proceeding of the IEEE Custom Integrated Circuits Conference(CICC),1999,279-286
[55] Great Duek Island[EB/OL]. http://www.greatduekisland.net/,2008
[56] A. McMahon, S. Farrell. Delay and disruption-tolerant networking[J]. Internet Computing,2009,13(6):82-87
[57] J. A. Stankovic, et al. Wireless Sensor Networks for In-Home Healthcare: Potential andChallenges[C]. Proceeding of of High Confidence Medical Device Software and Systems(HCMDSS) Workshop,2005,356-367
[58] J. L. Paul. Smart sensor web: Tactical battlefield visualization using sensor fusion[J]. IEEEAerospace and Electronic Systems Magazine,2006,21(1):13-20
[59] H. Pan, A. Chaintreau, J. Scott, et al. Pocket switched networks and human mobility inconference environments[C]. Proceeding of ACM SIGCOMM Workshop on Delay-TolerantNetworking, Philadelphia: ACM,2005,244251
[60] S. Milgram..The small world Problem[J].Psychology today,1967,2(l):60-67
[61]M. E. J. Newman. Coauthor ship networks and patterns of scientific collaboration [J].Proceedings of the National Academy of Sciences of the United States of America,2004,101(Suppll):5200
[62] M. Motani, V. Srinivasan, P. S. Nuggehalli. Peoplenet: engineering a wireless virtual socialnetwork[C]. Proceedings of the1lth aunual international conference on Mobile computing andnetworking,2005,243-257
[63] E. Daly, M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets[C].Proceeding of ACM MobiHoc,2007,32-40
[64] W. Hsu, D. Dutta,A. Helmy. Mining behavioral groups in large wireless LANs[C]. Proceedingsof the13th annual ACM international conference on Mobile computing and networking,2007,338-341
[65] P. Costa, C. Mascolo, M. Musolesi, G.P. Picco. Socially-Aware routing for publish-subscribe indelay-tolerant mobile ad hoc networks[J]. IEEE Journal of Selected Areas in Communication,2008,26(5):748760
[66] Dedicated short range communications home[EB/OL]. http://www.leearmstrong.com/dsrc,2003
[67] Wireless access in vehicular environments[EB/OL]. http://www.ieee802.org/11/Reports,2009
[68] W. Franz, R. Eberhardt, T. Luckenbach. Fleetnet-internet on the road[C]. The8th WorldCongress on Intelligent Transportation Systems,2001,142-150
[69] Car-to-car communication consortium[EB/OL]. http://www.car-to-car.org,2005
[70] Vehicle infrastructure integrationrogram[EB/OL]. http://www.omniair.org/vii/,2006
[71] U.S department of transportation. Intelligent transportation systems[EB/OL].http://www.its.dot.gov,2004
[72] M. Rudack, M. Meincke, M. Lott. On the dynamics of ad hoc networks for inter vehiclecommunication[C]. Proceeding of the ICWN,2002,321-325
[73] S.Y. Ni, Y.C. Tseng. The broadcast storm problem in a mobile ad hoc network[C]. Proceeding ofthe5th Annual ACM/IEEE Int’l Conf. on Mobile Computing and Networking,1999,152-162
[74] A. Mahajan. Evaluation of mobility models for vehicular ad-hoc network simulations[R]. USA:The Florida State University,2005,77-82
[75] Q. Xu, T. Mark. Vehicle-to-vehicle safety messaging in dsrc[C]. Proceeding of ACM VANET,2004,19-28
[76]宋超，刘明，龚海刚.基于分布式实时机制的车载网络出行计划算法[J].计算机应用研究,2009,26(9):3440-3447
[77] Y. Yu, B. Liu, T. Wu, M. Liu. Flow-Based Travel plan via VANET[J]. Journal of JDCTA,2011,5(6),163-171
[78] R. Panayappan, J.M. Trivedi. Vanet-based approach for parking space availability[C].Proceeding of ACM VANET,2007,75-76
[79] J. Zhao, G. Cao. Vadd: vehicle-assisted data delivery in vehicular ad hoc networks[C]. IEEEINFOCOM,2006,1-12
[80]E. P. C. Jones, P. A. S. Ward. Routing strategies for delay tolerant networks[EB/OL].http://www. tct.hut. fi/opetus/s383151/articles/dtn-routing-survey. pdf,2003
[81]肖明军，黄流生.容迟网络路由算法[J].计算机研究与发展,2009,46(7):1065-1073
[82] M. Grossglauser, T. DNC. Mobility increases the capacity of ad hoc wireless networks[J].IEEE/ACM Transactions on Networking,2002,10(4):477486
[83] A. Vahdat, D. Becker. Epidemic routing for partially connected ad hoc networks[R]. TechnicalReport, USA: Duke University,2000
[84] P. Mundur, M. Seligman, J. N. Lee. Immunity-based Epidemic Routing in IntermittentNetworks[C]. Proceeding of Secon2008,609-611
[85] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Spray and wait: An efficient routing scheme forintermittently connected mobile networks[C]. Proceeding of2005ACM SIGCOMM Workshopon DelayTolerant Networking,2005,252259
[86] L. J. Chen, C. H. Yu, T.Sun. A hybrid routing approach for opportunistic networks[C].Proceeding of ACM SICCOMM Workshop on Challenged Networks,2006,213-220
[87] T. Spyropoulos, K. Psounis, C. S. Raghavendra. Spray and focus: Efficient mobility-assistedrouting for heterogeneous and correlated mobility[C]. Proceeding of the IEEE PerComWorkshop on Intermittently Connected Mobile Ad Hoc Networks,2007,902-910
[88] J. EPC, L. Li, W. PAS. Practical routing in delay-tolerant networks[C]. Proceeding of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking,2005,237243
[89] A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connectednetworks[J]. SIGMOBILE: Mobile Computing Communications Review,2003,7:19–20
[90]许富龙,刘明,龚海刚等.延迟容忍传感器网络基于相对距离的数据传输[J].软件学报2010,21(3):490-504
[91] Y. Wang, H.Y. Wu. Replication-Based efficient data delivery scheme (RED) forDelay/Fault-Tolerant mobile sensor network (DFT-MSN)[C]. Proceeding of4thAnnual IEEE International Conference on Pervasive Computing andCommunications Workshops,2006,485-489
[92] Y. Wang, H.Y. Wu. Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A NewParadigm for Pervasive Information Gathering[J]. IEEE Transactions On Mobile Computing,2007,6(9):1021-1034
[93] Y. Wang, H.Y. Wu, H.Dang. Analytic study of Delay/Fault-Tolerant mobile sensornetworks(DFT-MSN’s)[R]. Technical Report, Lafayette:CACS, University of Louisiana atLafayette,2006
[94] B. Pasztor, M. Musolesi, C. Mascolo. Opportunistic Mobile Sensor Data Collection withSCAR[C]. Proceeding of the Fourth IEEE International Conference on Mobile Ad-hoc andSensor Systems. Pisa:2007,1-12
[95] Y. Wang, H.Y. Wu, F. Lin, and N.F. Tzeng. Cross-layer Protocol Design and Optimization forDelay/Fault-Tolerant Mobile Sensor Networks[J]. IEEE Journal on Selected Areas inCommunications (JSAC), Special Issue on Delay and Disruption Tolerant WirelessCommunication,2008,26(5):809-819
[96] P. Hui, J. Crowcroft, E. Yoneki. Bubble rap: social-based forwarding in delay tolerantnetworks[C]. Proceeding of ACM MobiHoc,2008,241-250
[97] E. Daly, M. Haahr. Social network analysis for routing in disconnected delay-tolerantMANETs[C]. Proceeding of ACM MobiHoc,2007,32-40
[98] J. gila Bitsch Link, N. Viol, A. Goliath, and K. Wehrle. SimBetAge: Utilizing TemporalChanges in Social Networks for Pocket Switched Networks[C]. Proceedings of the1st ACMWorkshop on User-provided Networking: Challenges and Opportunities,2009,13-18
[99] K. Jahanbakhsh, G. C. Shoja, and V. King. Social-Greedy: A Socially-based Greedy RoutingAlgorithm for Delay Tolerant Networks[C]. Proceedings of the International Workshop onMobile Opportunistic Networking,2010,159-162
[100] M. Abderrahmen, M. Martin, D. Christophe, et al. Peoplerank: social opportunisticforwarding[C]. Proceeding of INFOCOM,2010,111-115
[101] C. Liu, J. Wu. An optimal probabilistic forwarding protocol in delay tolerant networks[C].Proceeding of ACM MobiHoc,2009,1-10
[102]C. Liu, J. Wu. Routing in a cyclic MobiSpace[C]. Proceeding of ACM MobiHoc,2008,351-360
[103] J. Liu, H. Gong, J. Zeng. Preferance location based routing in delay tolerant netork[J]. JDCTA.2011,5(12):468-474
[104] J. Liu, M. Liu, H. Gong. Expected Shortest Path Routing for Social-oriented IntermittentlyConnected Mobile Network[J]. Journal of Convergence Information Technology,2012,7(1):94-101
[105] W.J. Hsu, D. Dutta, A. Helmy. CSI: a paradigm for behavior-oriented delivery services inmobile human networks[J]. Ad hoc networks,2011,6(4):13-24
[106] V. Namboodiri,M. Agarwal,and L.Gao. A study on the feasibility of mobile gateways forvehicular ad-hoc networks[C]. Proceedings of the First Internationalworkshop on Vehicular AdHoc Networks,2004,66-75
[107] V. Naumov, T.R. Gross. Connectivity-aware routing in vehicular ad doc networks[C].Proceeding of IEEE INFOCOM,2007,1919-1927
[108] D. Yong, W. Chen, L. Xiao. A static-node assisted adaptive routing protocol in vehicularnetworks[C]. Proceeding of ACM VANET,2007,59-68
[109] Q. Li, D. Rus. Sending messages to mobile users in disconnected ad-hoc wireless networks[C].Proceeding of Mobile Computing and Networking,2000,44-55
[110] J. Davis, A. Fagg, B. Levine. Wearable computers as packet transport mechanisms inhighly-partitioned ad-hoc networks[C]. Proceeding of International Symposium on WearableComputing,2001,141-148
[111] B. Burns, O. Brock, B. Levine. Mv routing and capacity building in disruption tolerantnetworks[C]. Proceeding of IEEE INFOCOM,2005,398-408
[112] J. Burgess, B. Gallagher. Maxprop: routing for vehicle-based disruption-tolerantnetworking[C]. Proceeding of IEEE INFOCOM,2006,1-11
[113] D. Niculescu, B. Nath. Trajectory based forwarding and its applications[C]. ProceedingMobiCom,2003,758-761
[114] B. Karp, H.T. Kung. Gpsr: greedy perimeter stateless routing for wireless networks[C].Proceeding of ACM MOBICOM'00,2000,586-589
[115] C. Lochert, H. Hartenstein. A routing strategy for vehicular ad hoc networks in cityenvironments[C]. Proceeding of IEEE Intelligent Vehicles Symposium,2003,156-161
[116] C. Lochert, M. Mauve.Geographic routing in city scenarios[J]. ACM SIGMOBILE MobileComputing and Communications Review,2005,9(1):69-72
[117] L. Fan, W. Yu. Routing in vehicular ad hoc networks: a survey[J]. IEEE Vehicular TechnologyMagazine, June2007,2(2):12-22
[118] C. Maih fer. A survey of geocast routing protocols[J]. IEEE Communications Surveys&Tutorials,2004,6(2):32-42
[119] L. Wischof, A. Ebner, H. Rohling. Information dissemination in self organising intervehiclenetworks[J]. IEEE Trans. on Intelligent Transportation Systems,2005,6(3):90-101
[120] A. Bachir, A. Benslimane. A multicast protocol in ad hoc networks intervehicle geocast[C].Proceeding of the57th IEEE Semiannual Vehicular Technology Conference,2003,2456-2460
[121] C. Maih fer, T. Leinmüller, E. Schoch. Abiding geocast: time-stable geocast for ad hocnetworks[C]. The2nd ACM international workshop on Vehicular ad hoc networks,2005,20-29
[122] H. Wu, R.M. Fujimoto, R. Guensler, M. Hunter. Mddv: s mobility-centric data disseminationalgorithm for vehicular networks[C]. Proceeding of the ACM1st Int’l Workshop on Vehicular AdHoc Networks(VANET2004),2004,47-56
[123] M. Caliskan, D. Graupner, M. Mauve. Decentralized discovery of free parking places[C]. TheACM3rd Int’l Workshop on Vehicular Ad Hoc Networks,2006,30-39
[124]宋超，刘明，龚海刚等.基于分布式实时信息的车载网络路由协议[J].软件学报，2011,22(3):466480
[125] H.Y. Huang, P.E. Luo. Performance evaluation of SUVnet with Real-Time Traffic Data. IEEETransactions on Vehicular Technology,2007,3381-3396
[126] C. L. Kevin, L. Michael. Louvre: landmark overlays for urban vehicular routingenvironments[C]. IEEE68th Vehicular Technology Conference,2008,1-5
[127] B. Wiegel, Y. Gunter, and H. Grossmann. Cross-layer design for packet routing in vehicular adhoc networks[C]. Vehicular Technology Conference,2007,2169-2173
[128] R. E. R.A. Santos and N. Seed. Inter vehicular data exchange between fast moving road trafficusing ad-hoc cluster based location algorithm and802.11b direct sequence spread spectrumradio[C]. Proceeding of PostGraduate Networking Conference,2003,333-343
[129] G. Dantzig, and J. H.Ramser. The Truck Dispatching Problem.[J]. Management Science,1959,6(1):80–91
[130] C. X. Zhao, T. R. Zhou. Prediction-based Energy Efficient Clustering Approach for WirelessSensor Networks [J]. Journal of Convergence Information Technology,2011,6(4):152-158
[131] H. W. Kim, H. S. Seo, et al. Modeling of Energy efficient Applicable Routing Algorithm inWSN [J]. International Journal of Digital Content Technology and its Applications,2010,4(5):13-22
[132] M. Stemm and R. H. Katz. Measuring and reducing energy consumption of network interfacesin hand-held devices[J]. IEICE Trans.Commun.,1997, E80-B(8),1125–1131
[133] The Network Simulator[EB/OL]. http://www.isi.edu/nsnam/ns/,2010
[134] W. B. Heinzelman, A. P. Chandrakasan. An application-specific protocol architecture forwireless microsensor networks [J]. IEEE Transaction on Wireless Communications,2002,1(4):660670
[135] UCSD. Wireless topology discovery project[EB/OL].http://sysnet.ucsd.edu/wtd/wtd.html,2007
[136] S. Zhong, J. Chen, R. Yang. A simple, cheat-proof, credit-based system for mobile ad hocnetworks [C]. Proceedings of the INFOCOM, USA, IEEE Press,2003,1987-1997
[137]W.Wang, S.Eide and Y. Wang. OURS: optimal unicast routing systems in non-cooperativewireless network[C]. Proeeedings of MOBICOM. LosAngeles,2006,402-413
[138]A.Y Ye, L. Xu. Study on cooperation in mobile ad hoc networks[J]. Mini-Micro system,2005,26(11):1886-1889
[139]S. Buchegger, J. L. Boudec. Self-Policing mobile ad hoc networks by reputation systems[J].IEEE Communications Magazine,2005,43(7):101-107
[140]M.Felegyazi, J.P.Hubaux and L.Buttyan. Nash equilibria of packets forwarding strategies inwireless ad hoc networks [J]. IEEE Transactionon Mobile Computing,2006,5(4):463-475
[141]L.Huang, L. X. Liu. Study on cooperation stimulation mechanism in routing discovery of adhoc networks[J]. Chinese Journal of Computers,2008,31(2):262-269
[142] G. Christodoulou, K. Mehlhorn, and E. Pyrga. Improving the Price of Anarchy for SelfishRouting via Coordination Mechanisms[C]. Proceeding of ESA2011,2011,119-130
[143] E. Koutsoupias, C. Papadimitriou. Worst-Case Equilibria[M]. Prceeding of the16thAnuualSymposium on Theoretical Aspects of Computer Sciencee,1999,404-413
[144] M. Gairing, T. Lucking, M. Mavronicolas, et al. The Price of Anarchy for Restricted ParallelLinks[J]. Parallel Processing Letters,2006,16(1):117–132
[145]V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, R.R. Rao. Cooperation in wireless ad hocnetworks [C]. Proceedings of20th Annual Joint Conference of the IEEE Computer andCommunications.2003,808-817
[146]K. SenkoM. A reputation-based service differentiation scheme for mobile Ad Hoc Networks[C]. Proceeding of WiMob2005, NewYork,2005,197-204
[147] U.S. Department of Transportation. Ten-Year National Program Plan and Research Agenda forIntelligent Transportation Systems in the United States [R]. The Intelligent TransportationSociety of America and the United States Department of Transportation,2001
[148] B. Hoh, M. Gruteser, R. Herring, J. Bana, D. Work. Virtual Trip Lines for DistributedPrivacy-Preserving Traffic Monitoring [C]. Proceedings of6th international conference onMobile systems, applications, and services,2008,15-28
[149] The Vehicular Mobility Model[EB/OL]. http://vanet.eurecom.fr/,2010