机会网络数据转发与缓存调度研究
|
摘要
处理器速度、移动通信和电池寿命的的快速发展促使计算机完成了从完全连接到完全移动的演变，在最极端的情况下，所有节点都是移动的，只有利用可获得的机会：传统的通信基础设施和中间节点的移动性，才能实现节点间的数据通信，这就是机会网络。同时，大量低成本、具备短距离无线通信能力的智能设备的出现，让机会网络在一些极端通信环境中有着巨大的应用潜力。机会网络中的数据通信主要有以下特点：①由于节点的移动导致网络拓扑动态变化，节点对之间不能建立端到端的通信路径，从而引起数据通信的低速率和高时延；②数据成功传输主要依靠节点移动带来的相遇机会，因而根据节点相遇机会制定的数据转发策略成为影响数据传输性能的重要技术；③网络资源有限，对节点缓存空间的需求矛盾较为突出，由于大量数据没有得到及时转发而长时间滞留在网络中，过度消耗节点的缓存资源，因此对缓存容量的利用率要求更为严格。
在机会网络中转发数据面临的挑战性问题为：节点移动的不可预知性和网络资源的有限。因此在网络资源有限的情况下，有效的数据转发策略、缓存调度管理是保证数据成功传输的两个关键问题。围绕这两个关键问题，本文主要开展了以下几个方面的研究工作：
首先，本文提出了一种基于效用的代表转发策略，该策略根据节点中心度、节点间的关联度和相似度计算出综合效用值，用来表征节点间未来的相遇概率，携带消息的当前节点依据效用值选择最佳的相遇节点作为代表来转发消息，仿真结果表明该算法能更准确地为消息选择下一跳携带节点，提高了网络的消息投递成功率。
其次，针对节点静止的机会网络中存在的网络分割现象，提出了静态多摆渡路径设计方案。该方案引入了局部摆渡(Local Ferry)和全局摆渡(Global Ferry)两种移动实体负责不同地区范围内数据通信，为不能直接通信的静止节点之间提供消息转发。并且通过控制局部摆渡和全局摆渡的移动轨迹，实现在线同步协作转发消息，以提高分裂机会网络的消息投递成功率，降低消息投递时延。
然后，针对移动机会网络中存在的网络分割现象，提出了局部摆渡节点的动态路径设计算法。该算法在满足节点丢弃消息最小化的条件下，采用流量感知启发式算法为局部摆渡节点计算出最优移动路径，引入固定的中继节点完成局部摆渡和全局摆渡节点之间的异步协作通信，仿真结果表明该算法提高了分裂机会网络的数据传输性能。
最后，针对机会网络的间断连接性导致节点间通信时间有限，节点不能将缓存中的消息在一次相遇机会中全部转发，提出了基于接触频率的缓存调度算法。该算法通过计算相遇节点与消息的目标节点之间的历史接触频率，以此确定当前节点缓存中消息的调度优先级，同时结合基于消息副本的丢弃策略，提高了节点缓存空间和链路通信带宽的利用率，消息的转发效率也因此提高。
综上所述，本文在机会网络数据转发策略和缓存调度管理方面做了大量的分析研究，针对现有策略的不足，提出了以上几种数据转发和缓存调度管理策略。仿真验证表明，本文提出的相关算法在消息投递成功率、传输时延和网络资源开销等方面能明显改善机会网络的传输性能。
With the rapid development of the processor speed, mobile communication andbattery life, Computers evolve from completely wired to completey mobile.In the mostextreme case, even all nodes are mobile, only relying on available opportunities:traditional communication infrastructure and the mobility of intermediate nodes, thedata communication can realize between pair nodes. These are Opportunistic Networks(ONs). Moreover, the appearance of plenty of low-price intelligent devices equippedwith short-distance wireless communication interface boosts the fast rise ofopportunistic networks application in many extreme communication circumstances.Several typical characteristics in terms of data communication in ONs are shown asfollows.
①Network topology dynamically change due to the mobility of nodes.End-to-end communication paths can not been established between pairs of nodes,which cause the low rate and high delay take place in data communication;
②Successful rate of data forwarding mainly relies on the contact opportunitiesarising from the movement of nodes. Thus data forwarding policy made based onmeeting probability between pair nodes becomes the essential technique, whichinfluences the performance of data transmission.
③Contention about the buffer space is very prominent in ONs when the networkresources are constrained. Due to a plenty of data that has not been forwarded timelystays in networks for long time，the storage space of nodes is consumed fast. Thus thenodal buffer is requested to obtain more efficient utilization.
Data forwarding in opportunistic networks has two key challeges: theunpredictable mobility of nodes the network resouces constraints.With the limitedresources, Effective forwarding strategies and high-performance schedulingmanagement schemes become two key factors in the process of data transmission.Around such two key factors, study works in this thesis are shown as follows.
Firstly, A delegation forwarding policy based on utility is proposed for ONs.Theforwarding policy computes a hybrid utility based on the information that containsnodal centrality, contact degree and similarity between pair nodes. The utility representsthe meeting probability between two nodes in the near future. Current node carryingmessages selects the best encountered node as delegation to forward message based on the utility. Simulation results show that the forwarding algorithm can select correctlythe appropriate carrying node for messages and improve the successful rate of deliverymessage for networks.
Secondly, focus on the existence of partition in stationary opportunistic networks,stationary ferry route design for multiple ferries is proposed for ONs. The route designfor multiple ferries introduces two types of mobile entities which are called as LocalFerry (short as LF) and Global Ferry (short as GF). They are responsible for datacommunication within different areas respectively and provide forwarding message forstationary nodes that can not communicate directly. The route design makes LF and GFrealize online collaboration to delivery messages in order to improve the delivery rateand reduce latency for messages in patitioned ONs.
In addition, aiming at the existence of partition in mobile opportunistic networks,dynamic ferry route design for local ferries is proposed for partitioned ONs. The ferryroute design utilizes traffic-aware heuristic to find the optimal movement path for localferries with the goal of minimizing message drops of nodes. At the same time,stationary relay nodes are used to complete asynchronous cooperative communicationbetween LF and GF. Finally simulation results demonstrate the multi-ferry routescheme can improve the performance of data transmission in partitioned ONs
Finally, to solve the problem that nodes can not forward all buffered messagesduring limited contact duration because of intermittent connectivity of ONs, a bufferscheduling algorithm is proposed based on historical contact frequencies between pairnodes. The scheduling algorithm decides the forwarded priority for buffered messagesin current node based on historical contact frequencies between the encountered nodeand messages’ destinations. Furthermore, combining with dropping policy based onmessage copies, the utilization ratio of the nodal storage and the communication linkbandwidth get improvement，and the delivery efficiency for messages has beenheightened accordingly.
In summary, this dissertation widely analyses data forwarding polices and bufferscheduling management policies in ONs. In order to overcome the limitations of theexisting strategies，a few data forwarding scheme and buffer scheduling policies abovementioned are proposed. Simulation experiments demonstrate that the above proposedmethods can significantly improve the performance of opportunistic networks in termsof the message delivery rate, message transmission delay and the network overheads.
在机会网络中转发数据面临的挑战性问题为：节点移动的不可预知性和网络资源的有限。因此在网络资源有限的情况下，有效的数据转发策略、缓存调度管理是保证数据成功传输的两个关键问题。围绕这两个关键问题，本文主要开展了以下几个方面的研究工作：
首先，本文提出了一种基于效用的代表转发策略，该策略根据节点中心度、节点间的关联度和相似度计算出综合效用值，用来表征节点间未来的相遇概率，携带消息的当前节点依据效用值选择最佳的相遇节点作为代表来转发消息，仿真结果表明该算法能更准确地为消息选择下一跳携带节点，提高了网络的消息投递成功率。
其次，针对节点静止的机会网络中存在的网络分割现象，提出了静态多摆渡路径设计方案。该方案引入了局部摆渡(Local Ferry)和全局摆渡(Global Ferry)两种移动实体负责不同地区范围内数据通信，为不能直接通信的静止节点之间提供消息转发。并且通过控制局部摆渡和全局摆渡的移动轨迹，实现在线同步协作转发消息，以提高分裂机会网络的消息投递成功率，降低消息投递时延。
然后，针对移动机会网络中存在的网络分割现象，提出了局部摆渡节点的动态路径设计算法。该算法在满足节点丢弃消息最小化的条件下，采用流量感知启发式算法为局部摆渡节点计算出最优移动路径，引入固定的中继节点完成局部摆渡和全局摆渡节点之间的异步协作通信，仿真结果表明该算法提高了分裂机会网络的数据传输性能。
最后，针对机会网络的间断连接性导致节点间通信时间有限，节点不能将缓存中的消息在一次相遇机会中全部转发，提出了基于接触频率的缓存调度算法。该算法通过计算相遇节点与消息的目标节点之间的历史接触频率，以此确定当前节点缓存中消息的调度优先级，同时结合基于消息副本的丢弃策略，提高了节点缓存空间和链路通信带宽的利用率，消息的转发效率也因此提高。
综上所述，本文在机会网络数据转发策略和缓存调度管理方面做了大量的分析研究，针对现有策略的不足，提出了以上几种数据转发和缓存调度管理策略。仿真验证表明，本文提出的相关算法在消息投递成功率、传输时延和网络资源开销等方面能明显改善机会网络的传输性能。
With the rapid development of the processor speed, mobile communication andbattery life, Computers evolve from completely wired to completey mobile.In the mostextreme case, even all nodes are mobile, only relying on available opportunities:traditional communication infrastructure and the mobility of intermediate nodes, thedata communication can realize between pair nodes. These are Opportunistic Networks(ONs). Moreover, the appearance of plenty of low-price intelligent devices equippedwith short-distance wireless communication interface boosts the fast rise ofopportunistic networks application in many extreme communication circumstances.Several typical characteristics in terms of data communication in ONs are shown asfollows.
①Network topology dynamically change due to the mobility of nodes.End-to-end communication paths can not been established between pairs of nodes,which cause the low rate and high delay take place in data communication;
②Successful rate of data forwarding mainly relies on the contact opportunitiesarising from the movement of nodes. Thus data forwarding policy made based onmeeting probability between pair nodes becomes the essential technique, whichinfluences the performance of data transmission.
③Contention about the buffer space is very prominent in ONs when the networkresources are constrained. Due to a plenty of data that has not been forwarded timelystays in networks for long time，the storage space of nodes is consumed fast. Thus thenodal buffer is requested to obtain more efficient utilization.
Data forwarding in opportunistic networks has two key challeges: theunpredictable mobility of nodes the network resouces constraints.With the limitedresources, Effective forwarding strategies and high-performance schedulingmanagement schemes become two key factors in the process of data transmission.Around such two key factors, study works in this thesis are shown as follows.
Firstly, A delegation forwarding policy based on utility is proposed for ONs.Theforwarding policy computes a hybrid utility based on the information that containsnodal centrality, contact degree and similarity between pair nodes. The utility representsthe meeting probability between two nodes in the near future. Current node carryingmessages selects the best encountered node as delegation to forward message based on the utility. Simulation results show that the forwarding algorithm can select correctlythe appropriate carrying node for messages and improve the successful rate of deliverymessage for networks.
Secondly, focus on the existence of partition in stationary opportunistic networks,stationary ferry route design for multiple ferries is proposed for ONs. The route designfor multiple ferries introduces two types of mobile entities which are called as LocalFerry (short as LF) and Global Ferry (short as GF). They are responsible for datacommunication within different areas respectively and provide forwarding message forstationary nodes that can not communicate directly. The route design makes LF and GFrealize online collaboration to delivery messages in order to improve the delivery rateand reduce latency for messages in patitioned ONs.
In addition, aiming at the existence of partition in mobile opportunistic networks,dynamic ferry route design for local ferries is proposed for partitioned ONs. The ferryroute design utilizes traffic-aware heuristic to find the optimal movement path for localferries with the goal of minimizing message drops of nodes. At the same time,stationary relay nodes are used to complete asynchronous cooperative communicationbetween LF and GF. Finally simulation results demonstrate the multi-ferry routescheme can improve the performance of data transmission in partitioned ONs
Finally, to solve the problem that nodes can not forward all buffered messagesduring limited contact duration because of intermittent connectivity of ONs, a bufferscheduling algorithm is proposed based on historical contact frequencies between pairnodes. The scheduling algorithm decides the forwarded priority for buffered messagesin current node based on historical contact frequencies between the encountered nodeand messages’ destinations. Furthermore, combining with dropping policy based onmessage copies, the utilization ratio of the nodal storage and the communication linkbandwidth get improvement，and the delivery efficiency for messages has beenheightened accordingly.
In summary, this dissertation widely analyses data forwarding polices and bufferscheduling management policies in ONs. In order to overcome the limitations of theexisting strategies，a few data forwarding scheme and buffer scheduling policies abovementioned are proposed. Simulation experiments demonstrate that the above proposedmethods can significantly improve the performance of opportunistic networks in termsof the message delivery rate, message transmission delay and the network overheads.
引文
[1]叶晖.机会网络数据分发关键技术研究[D].湖南:中南大学,2010.
[2]国家中长期科学和技术发展规划纲要(2006-2020年)[EB/OL]. http://www.gov.cn/jrzg/2006-02/09/content_183787.htm.
[3]许富龙.机会网络中数据传输问题研究[D].成都：电子科技大学，2011.
[4]欧中洪,宋美娜,战晓苏等.移动对等网络关键技术[J].软件学报,2008,19(2):404-418.
[5] Hull B, Bychkovsky V, Zhang Y, et al. CarTel: A distributed mobile sensor computingsystem[C]. In: Proc. of the4th Int’l Conf. on Embedded Networked Sensor Systems. Boulder:ACM,2006:125-138.
[6] S.Jung, U.Lee, A.Chang, et al. BlueTorrent: Cooperative Content Sharing for Bluetooth Users
[C]. IEEE PerCom’07, White Plains, NewYork, Mar,2007.
[7] Uiehin Lee, Sewook Jung, Alexander Chang, et al. Bluetooth-based P2P Content Distribution toMobile Users UCLA Technical RePort[R]. TR-070013,2008.
[8] Juang P, Oki H, Wang Y, Martonosi M, et al. Energy-Effieient computing for Wild life tracking:Design tradeoffs and early experiences with ZebraNet[C]. In: Proc of the10th Int’1Conf. onArchitectural Support for Programming Languages and Operating Systems. NewYork: ACM,2002:96-107.
[9] Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc network paradigm(orwhere there is a whale, there is away)[C]. In: Proc.of the4th ACM Int’l Symp. On Mobile AdHoc Networking. Annapolis: ACM,2003:233-244.
[10] A. Beaufour, M. Leopold, and P. Bonnet. Smart-tag based data dissemination[C]. In First ACMWSNA Workshop, September2002.
[11] S. Corson, J. Macker. Mobile Ad Hoc Networking (MANET): Routing Protocol Perfor-manceIssues and Evaluation Considerations, RFC2501,1999.
[12] Charies E, Perkins, Elizabeth M et al. Ad-hoc on-demand distance vector routing. IETF RFC3561, July2003.
[13] Josh Broch, David B Johnson and David A Maltz. The dynamic source routing protocol formobile ad hoc networks. IETF draft, March1998, work in progess.
[14] L. Pelusi, A. Passarella, M. Conti. Opportunistic networking: data forwarding in disconnectedmobile ad hoc networks[J]. Communications Magazine,2006,4(11):134-141.
[15] M. Conti, S. Giordano. Multihop ad hoc networking: The reality[J]. Communications Magazine,2007,45(4):88-95.
[16]熊永平,孙利民,牛建伟等.机会网络[J].软件学报,2009,20(1):124-137.
[17]胡四泉,汪洪兵,王俊峰.机会网络研究综述.计算机科学[J],2009,36(10):32-36.
[18] C. Huang, K. Lan, C. Tsai. A survey of opportunistic networks[C]. the22nd InternationalConference on Advanced Information Networking and Applications. IEEE Press,2008:1672-1677.
[19] Pan Hui. Pocket switched networks and human mobility in conference environments [C].Proceedings of the2005ACM SIGCOMM workshop on Delay-tolerant networking,2005:244-251.
[20] I. Akyildiz, B. Akan, C. Chen, et al. Interplanetary internet: state-of-the-art and researchchallenges[J]. Computer Networks,2003,43(2):75-112.
[21] Pentland A, Fleteher R, Hasson A. DakNet: Rethinking connectivityin developing nations[J].Computer,2004,37(l):78-83.
[22] K. Fall. A delay-tolerant network architecture for challenged internets[C].2003ACMSI-GCOMM Conference on Computer Communications,2003:27-34.
[23] http: www. ipnsig. org
[24] http: www. dtnrg. org
[25] Farrell S, Cahill V. Delay-and disruptioin-tolerant networking [M]. Norwood, MA: ArtechHouse, Inc.,2006.
[26]孙利民,熊永平,马建.机会移动传感器网络中的自适应数据收集机制[J].通信学报,2005,29(11):186-293.
[27]朱金奇.延迟容忍无线传感器网络中的动态数据收集技术及其研究[D].成都:电子科技大学,2009.
[28]李向群,刘立祥,胡晓惠等.延迟/中断可容忍网络研究进展[J].计算机研究与发展,2009,46(8):1270-1277.
[29]刘期烈.机会网络中路由机制与缓存管理策略研究[D].重庆：重庆大学，2012.
[30] Brewer E et al. Tier project.2006. http://tier.cs.berkeley.edu/wiki/Home.
[31] Avri D, MariaU and Durga PP. Providing connectivity to the Saami nomadic communit-y. In: Proc. Of the2nd Int’1Conf. on Open Collaborative Design for Sustainable Inn-ovation. Bangalore,2002.
[32] R. J. D'Souza, Johny Jose. Routing approaches in delay tolerant networks: a survey[J]. International Journal of Computer Applications,2010,1(17)：9-15.
[33] Nguyen Hoang Anh, Giordano Silvia. Routing in opportunistic Networks[J]. InternationalJournal of Ambient Computing and Intelligence,2009,1(3):19-38.
[34] Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks[R].Tech.RePort CS-2000-06, Department of Computer Science, Duke University, Durham, NC,2000.
[35] T. Spyropoulos, K. Psounis and C. S. Raghavendra. Single-copy routing in intermittentl-y connected mobile networks[C]. First Annual IEEE Communications Society Conferenceon Sensor and Ad Hoc Communications and Networks,2004:235-244.
[36] M. Grossglauser and D. N. Tse. Mobility increases the capacity of ad hoc wireless networks[J].IEEE/ACM Transactions on Networking, August2002,10(4):477-486.
[37] R. Groenevelt, P. Nain and G. Koole.The message delay in mobile ad hoc networks[J].Performance Evaluation, Oct.2005,62(1-4):210-228.
[38] SpyroPoulos T, Psounis K and Raghavendra CS. Spray and wait: An efficient routing schemefor intermittently connected mobile networks[C]. In: Proc. of the2005ACM SIGCO-MMWorkshop on Delay-Tolerant Networking. PhiladelPhia: ACM2005:252-259.
[39] Makhlouta Jad, Harkous Hamza1and Hutayt Farah et al. Adaptive fuzzy spray and wait:efficient routing for opportunistic networks[C].2011International Conference on Select-ed Topics in Mobile and Wireless Networking,2011:64-69.
[40] Xu Jia, Sun Li-Juan and Wang Ru-Chuan et al. Adaptive seed spray routing for opportunistic networks[J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica,2010,38(10):2315-2321.
[41] Xu Jia1, Li Qianmu and Zhang Hong et al. Performance evaluation of adaptive spray routingfor opportunistic networks[J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development,2010,47(9):1622-1632.
[42] Pan Daru, Lin Mu and Chen Liangjie et al. An improved spray and wait with probability choicerouting for opportunistic networks[J]. Journal of Networks,2012,7(9):1486-1492.
[43] A. Al Hanbali, P. Nain and E. Altman. Performance of ad hoc networks with two-hop relayrouting and limited packet lifetime[C]. Proc. of IEEE/ACM Value Tools, Pisa, Italy, Oct.2006.
[44] Khaled Harras, Kevin Almeroth and Elizabeth Belding-Royer. Delay tolerant mobile net-works(DTMNs): controlled flooding schemes in sparse mobile networks[C]. IFIP Netwo-rking,Waterloo, Canada, May2005.
[45] Balasubramanian, B. N. Levine and A. Venkataramani. Dtn routing as a resource allocationproblem [C]. ACM SIGCOMM,2007.
[46] R. Ramanathan, R. Hansen, and P. Basu et al. Krishnan. Prioritized Epidemic Routing forOpportunistic Networks[C]. MobiOpp’07, June11,2007.
[47] Ren Zhi, Li Yulan and Huang Yong. A low-delay routing algorithm for opportunisticnetworks[C].2nd World Congress on Computer Science and Information Engineering,2012:267-273.
[48] Liu Heng, Chen Yan. A moving scope aware routing approach for opportunistic networks[C].2010International Conference on Wireless Communications and Signal Processing,2010.
[49] Kathiravelu Thabotharan, Ranasinghe Nalin and Pears Arnold. An enhanced congestion awareadaptive routing protocol for opportunistic networks[C].20116th International Conference onIndustrial and Information Systems,2011:210-215.
[50] Kathiravelu Thabotharan, Ranasinghe Nalin and Pears Arnold. A robust proactive routingprotocol for intermittently connected opportunistic networks[C].7th IEEE and IFIPInternational Conference on Wireless and Optical Communications Networks,2010.
[51] Li Yun, Xu Meng and Liu Qilie et al. HMPR: Forwarding based on history meeting predictionrouting in opportunistic networks[C].7th International Conference on Wireless Algorithms,Systems, and Applications,2012:584-594.
[52]周强,应晶和吴明晖.基于特征分类的机会网络多因素预测路由[J].浙江大学学报,2010,44(3)：413-419.
[53] Chen Honglong, Lou Wei. Group aware cooperative routing for opportunistic networks underresource constraints[C].2012IEEE Global Communications Conference,2012:5705-5710.
[54] J. Widmer and J. Y. L. Boudec. Network coding for efficient communication in extremenetworks[C]. Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking(WDTN),2005.
[55] Y. Lin, B. Liang, and B. Li. Performance modeling of network coding in epidemic routing.MobiOpp’07, June11,2007.
[56] Socievole Annalisa, De Rango Floriano. Evaluation of routing schemes in opportunisticnetworks considering energy consumption[C]. International Symposium on PerformanceEvaluation of Computer and Telecommunication Systems,2012:41-47.
[57] Y. Wang, S. Jain, and M. Martonosi, et al. Erasure coding based routing for opportunisticnetworks[C]. Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking(WDTN),2005.
[58] S. Jain, M. Demmer, and R. Patra, et al. Using redundancy to cope with failures in a delaytolerant network[C]. SIGCOMM’05, August22-26,2005.
[59] Y. Liao, K. Tan, and Z. Zhang, et al. Estimation based erasure coding routing in delaytolerantNetworks[C]. International Wireless Communications and Mobile ComputingCo-nference,2006.
[60] Y. Liao, K. Tan, and Z. Zhang, et al. Combining erasure-coding and relay node evaluation indelay tolerant network routing[R]. Microsoft Technical Report, MR-TR,2006.
[61] L. J. Chen, C. H. Yu, and T. Sun. A hybrid routing approach for opportunistic networ-ks[C]. ACM SIGCOMM Workshop on Challenged Networks,2006.
[62] J. Davis, A. Fagg, and B. Levine.Wearable computers as packet transport mechanismsin highly partitioned ad hoc networks[C]. Proceedings of5IEEE International Symposium on Wearable Computers, Zurich, Switzerland,2001.
[63] Al-Karaki J N, Kamal A E. Routing techniques in wireless sensor networks: A survey[J]. IEEEWireless Communications,2004,11(6):6-28.
[64] Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connectednetworks[J]. ACM SIGMOBILE CCR,2003,7(3):19-20.
[65] H. Dubois-Ferriere, M. Grossglauser and M. Vetterli. Age matters: Efficient route discovery inmobile ad hoc networks using encounter ages[C]. Proceedings of ACM OBIHOC,2003.
[66] K. Tan, Q. Zhang and W. Zhu. Shortest path routing in partially connected ad hoc networks[C].IEEE Globecom,2003.
[67] Burns, O. Brock and B. N. Levine. MV routing and capacity building in disruption tolerantnetworks[C]. Proceedings of IEEE INFOCOM,2005.
[68] S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network[C]. Proceedings of ACMSIGCOMM,2004.
[69] Jones EPC, Li L and Ward PAS. Practical routing in delay-tolerant networks. In: Proc. of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking[C]. Philadelphia: ACM,2005:237-243.
[70] J. Burgess, B. Gallagher and D. Jensen et al. Maxprop: Routing for vehicle-based disruptiontolerant networks[C]. Proceedings of INFOCOM,2006.
[71] E. C. R. de Oliveira and C′elio V. N. de Albuquerque. NECTAR: A DTN routing protocolbased on neighbourhood contact history[C].SAC09March,2009.
[72] Q. Yuan, I. Cardei, and J. Wu. Predict and relay: an efficient routing in disruption-tolerantnetworks. mobihoc’09, May,2009.
[73] Chen C, Chen Z. Evaluating contacts for routing in highly partitioned mobile networks[C]. In:Proc. of the1st Int’l MobiSys Workshop on Mobile Opportunistic Networking. San Juan: ACM,2007:17-24.
[74] Musolesi M, Mascolo C. CAR: Context-Aware adaptive routing for delay tolerant mobi-le networks[J]. IEEE Trans on Mobile ComComputing,2009,8(2):246-260.
[75] Jacquet P, Mans B. Routing in intermittently connected networks: Age rumors in connectedcomponents[C]. In: Proc. of the5th Annual IEEE Int’l Conf. on Pervasive Computing andCommunications Workshops, PerCom Workshops2007,2007:53-58.
[76] R. H. Frenkiel and T. Innielinski. Infostations: The joy of ‘manytime, many-where’ co-mmunications[J]. Journal on Mobile Computing, May,1996.
[77] D. Goodman, J. Borras, and N. Mandayam et al. INFOSTATIONS: A new system model fordata and messaging services[J]. IEEE VTC’97, May1997, vol.(2):969-973.
[78] W. Zhao, Y. Chen, and M. Ammar, et al. Capacity enhancement using throwboxes in dtns[C].IEEE MASS, October2006.
[79] F. Farahmand, I. Cerutti, and A. N. Patel, et al. Relay node placement in vehicular delaytolerant networks[C]. IEEE Global Telecommunications Conference-GLOBECOM2008,November2008,27(1):2514-2518.
[80] I. Chatzigiannakis, S. Nikoletseas and P. Spirakis. Analysis and experimental evaluation of aninnovative and efficient routing protocol for ad-hoc mobile networks[J]. Lecture Notes inComputer Science,2001, vol.1982:99-111.
[81] I. Chatzigiannakis, S. Nikoletseas, and N. Paspallis, et al. An Experimental Study of BasicCommunication Protocols in Ad-Hoc Mobile Networks[C]. Proceedings of the5th Workshopon Algorithmic Engineering,2001.
[82] R. C. Shah, S. Roy, and S. Jain, et al. DataMules: modeling and analysis of a three-tierarchitecture for sparse sensor networks[J]. Elsevier Ad Hoc Networks Journal,2003.
[83] W. Zhao and M. Ammar. Proactive routing in highly partitioned wireless ad hoc networks[C].9th IEEE International Workshop on Future Trends of Distributed Computing Systems, May,2003.
[84] A. Kansal, A. A. Somasundara and D. D. Jea, et al. Intelligent fluid infrastructure for embeddednetworks[C]. ACM MobiSys2004,2004.
[85] A. A. Somasundara, A. Ramamoorthy and M. B.Srivastava. Mobile element scheduling forefficient data collection in wireless sensor networks with dynamic deadlines[C].Proceedings ofthe25th IEEE International Real Time Systems Symposium2004,2004.
[86] M. M. B. Tariq, M. Ammar and E. Zegura. Message ferry route design for sparse ad hocnetworks with mobile nodes[C]. ACM MobiHoc’06, May22-25,2006.
[87] W. Zhao, M. Ammar and E. Zegura. A message ferrying approach for data delivery in sparsemobile ad hoc networks[C]. Proceedings of MobiHoc,2004:187-198.
[88] W. Zhao, M. Ammar and E. Zegura.Controlling the Mobility of Multiple Data TransportFerries in a Delay-Tolerant Network[C]. INFOCOM,2005.
[89] D. Jea, A. Somasundara and M. Srivastava. Multiple controlled mobile elements (data mules)for data collection in sensor networks[C]. DCOSS,2005.
[90] K. Harras and K. Almeroth. Inter-regional messenger scheduling in delay tolerant mobilenetworks[C]. Proceedings of WoWMoM'06, June2006.
[91] Y. Gu, D. Bozdag and E. Ekici, et al. Partitioning based mobile element scheduling inwireless sensor networks[C]. Proceedings of the2nd Annual IEEE Conference on Sensor andAd Hoc Communications and Networks,2005.
[92] Y. Gu, D. Bozda g and E. Ekici. Mobile element based differentiated message delivery inwireless sensor networks[C]. Proceedings of the2006International Symposium on a World ofWireless, Mobile and Multimedia Networks (WoWMoM'06),2006.
[93] Broch J, Maltz DA, Johnson DB, Hu Y, Jetcheva J. A performance comparison of multi-hopwireless ad hoc network routing protocols[C]. In: Proc. of the4th Annual ACM/IEEE Int’lConf. on Mobile Computing and Networking. Dallas: ACM,1998:85-97.
[94] Small T, Haas ZJ. Resource and performance tradeoffs in delay-tolerant wireless networks[C].In: Proc. of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005:260-267.
[95] Bettstetter C. Mobility modeling in wireless networks: Categorization, smooth movement, andborder effects[J]. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):55-66.
[96] Jindal A, Psounis K. Performance analysis of epidemic routing under contention. In: Proc. ofthe2006Int’l Conf. on Wireless Communications and Mobile Computing. Vancouver: ACM,2006:539-544.
[97] UCSD. Wireless topology discovery project,2004. http://sysnet.ucsd.edu/wtd/wtd.html
[98] Eagle N, Pentland A. Reality mining: sensing complex social systems[J]. Personal UbiquitousComputing,2006,10(4):255-268.
[99] Diot C, et al. Haggle project.2004. http://www.haggleproject.org
[100] Zhang X, Kurose J, and Levine BN, et al. Study of a bus-based disruption-tolerant network:Mobility modeling and impact on routing[C]. In: Proc. of the13th Annual ACM Int’l Conf. onMobile Computing and Networking. Montréal: ACM,2007:195-206.
[101] Cai H, Eun DY. Crossing over the bounded domain: from exponential to power-lawinter-meeting time in MANET[C]. In: Proc. of the13th Annual ACM Int’l Conf. on MobileComputing and Networking. Montréal: ACM,2007:159-170.
[102] Conti M, Giordano S. Multihop ad hoc networking: the reality[J]. Communications Magazine,2007,45(4):88-95.
[103] Musolesi M, Mascolo C. A community based mobility model for ad hoc network research[C].In Proc. of the2nd Int’l Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality.New York: ACM,2006:31-38.
[104] Spyropoulos T, Psounis K, Raghavendra CS. Performance analysis of mobility-assistedr-outing[C]. In Proc. of the7th ACM Int’l Symp. on Mobile Ad Hoc Networking andComputing. Florence: ACM,2006:49-60.
[105] Hsu WJ, Spyropoulos T, Psounis K, Helmy A. Modeling time-variant user mobility inwireless mobile networks[C]. In Proc. of the26th IEEE Int’l Conf. on ComputerCommunications. IEEE,2007:758-766.
[106] Hui P, Crowcroft J. How small labels create big improvements[C]. In Proc. of the5th IEEEInt’l Conf. on Pervasive Computing and Communications Workshops. IEEE Computer Society,2007:65-70.
[107] Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerantMANETs[C]. In Proc. of the8th ACM Int’l Symp. on Mobile Ad Hoc Networking andComputing. Montreal: ACM,2007:32-40.
[108] A. Lindgren and K. S. Phanse. Evaluation of queuing policies and forwarding strategies forrouting in intermittently connected networks[C]. In Proc, of IEEE COMSWARE,2006.
[109] A. Krifa, C. Barakat and T. Spyropoulos. Optimal buffer management policies for delaytolerant networks[C]. In proceedings of the2008IEEE Communications Society Conference onSensor and AdHoc Communications and Networks(SECON’08), San Francisco, USA,2008:260-268.
[110] Y. Li, M. Qian, D. Jin et al. Adaptive optimal buffer management policies for realisticDTN[C]. In Proceedings of IEEE GLOBECOM2009, Honolulu, HI, USA,2009.
[111] Y. Ma, J. Abbas. Cooperative content dissemination in intermittently connected networks[C].In Proceedings of IEEE ICC, Tel Aviv, Israel,2009:245-254.
[112] L. Yin, H. Lu, Y. d. Cao et al. Buffer Scheduling Policy in DTN Routing Protocols[C]. InProceedings of2nd International Conference on Future Computer and Communication, Beijing,China,2010:808-813.
[113] Yazhou JIAO, Zhigang JIN and Yantai Shu et al. Data dissemination in delay and disruptiontolerant networks based on content classification[C]. In2009Fifth international conference onmobile ad-hoc and sensor networks,2009:1-5.
[114] Elizabeth Daly and Mads Haahr. Social network analysis for routing in disconnecteddelay-tolerant MANETs[C]. Proc of the MobiHoc2007. Montreal: ACM Press,2007:32-40.
[115] Peter V. Marsden. Egocentric and sociocentric measures of network centrality[J]. Socialnetworks. October,2002:407-422.
[116] Martin Everetta and Stephen P. Borgattib. Ego network betweenness[J]. Social networks27(1),2005:31-38.
[117]王博，黄传河，杨文忠.时延容忍网络中基于效用转发的自适应机会路由算法[J].通信学报，2010，31(10):36-47.
[118]彭敏.延迟容忍网络中移动模型与路由技术研究[D].合肥:中国科学技术大学,2011.
[119] Veeraruna Kavitha, Eitan Altman. Analysis and design of message ferry routes in sensornetworks using polling models[C]. Proceedings of International Symposium on Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Avignon, France,2010:247-255.
[120] Wenrui Zhao. Routing and network design in delay tolerant networks[D]. Georgia Institute ofTechnology.2006
[121] Mooi Choo Chuah, Peng Yang. A message ferrying scheme with differentiated services[C].Proceedings of IEEE Military Communications Conference, Atlantic City, NJ, USA,2005:1521-1527.
[122] Wenrui Zhao and Mostafa H. Ammar. Proactive routing in highly-partitioned wireless ad hocnetworks[C]. In the9thIEEE International Workshop on Future Trends of DistributedComputing Systems, May,2003.
[123] G. Nemhauser. A. Rinnooy Kan. and M. Todd (editors). Optimization[M].1989.
[124] Zhen Zhang, Zongming Fei. Route design for multiple ferries in delay tolerant net-works[C].Proceedings of IEEE Wireless Communications and Networking Conference, Hong Kong,China,2007:3460-3465.
[125] D. S. Johnson, L. A. McGeoch, and E. E. Rothberg. Aaymptotic experimental analysisfor the herd-karp traveling salesman bound[C]. In Proc.7thAnn. ACM-SIAM Symp.On Discrete Algorithems,1996.
[126] J.Bentley. Fast algorithms for geometric traveling salesman problems [J]. ORSA Journal onComputing,1992,4:387-411.
[127] Ari Ker nen, J rg Ott, Teemu K rkk inen. The ONE Simulator for DTN ProtocolEvaluation[C]. SIMUTools’09: Proceedings of the2nd International Conference on SimulationTools and Techniques,2009.
[128] Chen X and Murphy A.L. Enabling disconnected transitive communication in mobile ad hocnetworks[C]. In Proc. of the Workshop on Principles of Mobile Computing (POMC’01),Newport, RI (USA), August2001.
[129] Kamal Mistry, Sanjay Srivastava, R. B. Lenin. Buffer aware routing in interplanetary ad hocnetwork[J]. In Communication Systems and Networks and Workshops,2009:1-10.
[130] Sulma Rashid, Qaisar Ayub. Effective buffer management policy: DLA for DTN routingprotocols under congestion[J]. International Journal of Computer and Network Security,2010:118-121.
[131] Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid et al. Abdullah. Optimization of DTNrouting protocols by using forwarding strategy (TSMF) and queuing drop policy (DLA)[J].International Journal of Computer and Network Security,2010:71-75.
[132] Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid et al., E-DROP: an effective dropbuffer management policy for DTN routing protocols[J]. International Journal of Comp-uter Applications (0975-8887),2011:8-13.
[133] X. Zhang, G. Neglia, J. Kurose et al. Performance modeling of epidemic routing[C]. InProceeding of IFIP Networking,2006:1-29.
[134] A. Krifa, C. Barakat, and T. Spyropoulos. An optimal joint scheduling and drop polic-y for delay tolerant networks[C]. In WoWMoM workshop on Autonomic and Opportunistic Communication (AOC),2008.
[135] Stylianos Dimitriou, Vassilis Tsaoussidis. Effective buffer and storage management in DTNnodes [C]. In Ultra Modern Telecommunications&Workshops,2009, ICUMT’09,2009:1-3.
[136] Sathita Kaveevivitchai, Hideya Ochiai et al. Message deletion and mobility patterns forefficient message delivery in DTNs [C]. Pervasive Computing and Communication Workshops(PERCOM Workshops),20108th IEEE International Conference,2010:760-763.
[137] Liao Yong, Tan Kun. Estimation based erasure-coding routing in delay tolerant networks [C].IWCMC’06,2006:557-562.
[138]唐丽均,李云,柴毅等.一种结合传染路由的缓存调度算法[J].西安电子科技大学学报,2012, vol.39(1):169-174.
[139] Lijun Tang, Yi Chai, Yun Li, et al. Buffer management policies in opportunistic networks [J].Journal of Computational Information Systems,2012, vol.8(12):5149-5159.
[2]国家中长期科学和技术发展规划纲要(2006-2020年)[EB/OL]. http://www.gov.cn/jrzg/2006-02/09/content_183787.htm.
[3]许富龙.机会网络中数据传输问题研究[D].成都：电子科技大学，2011.
[4]欧中洪,宋美娜,战晓苏等.移动对等网络关键技术[J].软件学报,2008,19(2):404-418.
[5] Hull B, Bychkovsky V, Zhang Y, et al. CarTel: A distributed mobile sensor computingsystem[C]. In: Proc. of the4th Int’l Conf. on Embedded Networked Sensor Systems. Boulder:ACM,2006:125-138.
[6] S.Jung, U.Lee, A.Chang, et al. BlueTorrent: Cooperative Content Sharing for Bluetooth Users
[C]. IEEE PerCom’07, White Plains, NewYork, Mar,2007.
[7] Uiehin Lee, Sewook Jung, Alexander Chang, et al. Bluetooth-based P2P Content Distribution toMobile Users UCLA Technical RePort[R]. TR-070013,2008.
[8] Juang P, Oki H, Wang Y, Martonosi M, et al. Energy-Effieient computing for Wild life tracking:Design tradeoffs and early experiences with ZebraNet[C]. In: Proc of the10th Int’1Conf. onArchitectural Support for Programming Languages and Operating Systems. NewYork: ACM,2002:96-107.
[9] Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc network paradigm(orwhere there is a whale, there is away)[C]. In: Proc.of the4th ACM Int’l Symp. On Mobile AdHoc Networking. Annapolis: ACM,2003:233-244.
[10] A. Beaufour, M. Leopold, and P. Bonnet. Smart-tag based data dissemination[C]. In First ACMWSNA Workshop, September2002.
[11] S. Corson, J. Macker. Mobile Ad Hoc Networking (MANET): Routing Protocol Perfor-manceIssues and Evaluation Considerations, RFC2501,1999.
[12] Charies E, Perkins, Elizabeth M et al. Ad-hoc on-demand distance vector routing. IETF RFC3561, July2003.
[13] Josh Broch, David B Johnson and David A Maltz. The dynamic source routing protocol formobile ad hoc networks. IETF draft, March1998, work in progess.
[14] L. Pelusi, A. Passarella, M. Conti. Opportunistic networking: data forwarding in disconnectedmobile ad hoc networks[J]. Communications Magazine,2006,4(11):134-141.
[15] M. Conti, S. Giordano. Multihop ad hoc networking: The reality[J]. Communications Magazine,2007,45(4):88-95.
[16]熊永平,孙利民,牛建伟等.机会网络[J].软件学报,2009,20(1):124-137.
[17]胡四泉,汪洪兵,王俊峰.机会网络研究综述.计算机科学[J],2009,36(10):32-36.
[18] C. Huang, K. Lan, C. Tsai. A survey of opportunistic networks[C]. the22nd InternationalConference on Advanced Information Networking and Applications. IEEE Press,2008:1672-1677.
[19] Pan Hui. Pocket switched networks and human mobility in conference environments [C].Proceedings of the2005ACM SIGCOMM workshop on Delay-tolerant networking,2005:244-251.
[20] I. Akyildiz, B. Akan, C. Chen, et al. Interplanetary internet: state-of-the-art and researchchallenges[J]. Computer Networks,2003,43(2):75-112.
[21] Pentland A, Fleteher R, Hasson A. DakNet: Rethinking connectivityin developing nations[J].Computer,2004,37(l):78-83.
[22] K. Fall. A delay-tolerant network architecture for challenged internets[C].2003ACMSI-GCOMM Conference on Computer Communications,2003:27-34.
[23] http: www. ipnsig. org
[24] http: www. dtnrg. org
[25] Farrell S, Cahill V. Delay-and disruptioin-tolerant networking [M]. Norwood, MA: ArtechHouse, Inc.,2006.
[26]孙利民,熊永平,马建.机会移动传感器网络中的自适应数据收集机制[J].通信学报,2005,29(11):186-293.
[27]朱金奇.延迟容忍无线传感器网络中的动态数据收集技术及其研究[D].成都:电子科技大学,2009.
[28]李向群,刘立祥,胡晓惠等.延迟/中断可容忍网络研究进展[J].计算机研究与发展,2009,46(8):1270-1277.
[29]刘期烈.机会网络中路由机制与缓存管理策略研究[D].重庆：重庆大学，2012.
[30] Brewer E et al. Tier project.2006. http://tier.cs.berkeley.edu/wiki/Home.
[31] Avri D, MariaU and Durga PP. Providing connectivity to the Saami nomadic communit-y. In: Proc. Of the2nd Int’1Conf. on Open Collaborative Design for Sustainable Inn-ovation. Bangalore,2002.
[32] R. J. D'Souza, Johny Jose. Routing approaches in delay tolerant networks: a survey[J]. International Journal of Computer Applications,2010,1(17)：9-15.
[33] Nguyen Hoang Anh, Giordano Silvia. Routing in opportunistic Networks[J]. InternationalJournal of Ambient Computing and Intelligence,2009,1(3):19-38.
[34] Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks[R].Tech.RePort CS-2000-06, Department of Computer Science, Duke University, Durham, NC,2000.
[35] T. Spyropoulos, K. Psounis and C. S. Raghavendra. Single-copy routing in intermittentl-y connected mobile networks[C]. First Annual IEEE Communications Society Conferenceon Sensor and Ad Hoc Communications and Networks,2004:235-244.
[36] M. Grossglauser and D. N. Tse. Mobility increases the capacity of ad hoc wireless networks[J].IEEE/ACM Transactions on Networking, August2002,10(4):477-486.
[37] R. Groenevelt, P. Nain and G. Koole.The message delay in mobile ad hoc networks[J].Performance Evaluation, Oct.2005,62(1-4):210-228.
[38] SpyroPoulos T, Psounis K and Raghavendra CS. Spray and wait: An efficient routing schemefor intermittently connected mobile networks[C]. In: Proc. of the2005ACM SIGCO-MMWorkshop on Delay-Tolerant Networking. PhiladelPhia: ACM2005:252-259.
[39] Makhlouta Jad, Harkous Hamza1and Hutayt Farah et al. Adaptive fuzzy spray and wait:efficient routing for opportunistic networks[C].2011International Conference on Select-ed Topics in Mobile and Wireless Networking,2011:64-69.
[40] Xu Jia, Sun Li-Juan and Wang Ru-Chuan et al. Adaptive seed spray routing for opportunistic networks[J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica,2010,38(10):2315-2321.
[41] Xu Jia1, Li Qianmu and Zhang Hong et al. Performance evaluation of adaptive spray routingfor opportunistic networks[J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development,2010,47(9):1622-1632.
[42] Pan Daru, Lin Mu and Chen Liangjie et al. An improved spray and wait with probability choicerouting for opportunistic networks[J]. Journal of Networks,2012,7(9):1486-1492.
[43] A. Al Hanbali, P. Nain and E. Altman. Performance of ad hoc networks with two-hop relayrouting and limited packet lifetime[C]. Proc. of IEEE/ACM Value Tools, Pisa, Italy, Oct.2006.
[44] Khaled Harras, Kevin Almeroth and Elizabeth Belding-Royer. Delay tolerant mobile net-works(DTMNs): controlled flooding schemes in sparse mobile networks[C]. IFIP Netwo-rking,Waterloo, Canada, May2005.
[45] Balasubramanian, B. N. Levine and A. Venkataramani. Dtn routing as a resource allocationproblem [C]. ACM SIGCOMM,2007.
[46] R. Ramanathan, R. Hansen, and P. Basu et al. Krishnan. Prioritized Epidemic Routing forOpportunistic Networks[C]. MobiOpp’07, June11,2007.
[47] Ren Zhi, Li Yulan and Huang Yong. A low-delay routing algorithm for opportunisticnetworks[C].2nd World Congress on Computer Science and Information Engineering,2012:267-273.
[48] Liu Heng, Chen Yan. A moving scope aware routing approach for opportunistic networks[C].2010International Conference on Wireless Communications and Signal Processing,2010.
[49] Kathiravelu Thabotharan, Ranasinghe Nalin and Pears Arnold. An enhanced congestion awareadaptive routing protocol for opportunistic networks[C].20116th International Conference onIndustrial and Information Systems,2011:210-215.
[50] Kathiravelu Thabotharan, Ranasinghe Nalin and Pears Arnold. A robust proactive routingprotocol for intermittently connected opportunistic networks[C].7th IEEE and IFIPInternational Conference on Wireless and Optical Communications Networks,2010.
[51] Li Yun, Xu Meng and Liu Qilie et al. HMPR: Forwarding based on history meeting predictionrouting in opportunistic networks[C].7th International Conference on Wireless Algorithms,Systems, and Applications,2012:584-594.
[52]周强,应晶和吴明晖.基于特征分类的机会网络多因素预测路由[J].浙江大学学报,2010,44(3)：413-419.
[53] Chen Honglong, Lou Wei. Group aware cooperative routing for opportunistic networks underresource constraints[C].2012IEEE Global Communications Conference,2012:5705-5710.
[54] J. Widmer and J. Y. L. Boudec. Network coding for efficient communication in extremenetworks[C]. Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking(WDTN),2005.
[55] Y. Lin, B. Liang, and B. Li. Performance modeling of network coding in epidemic routing.MobiOpp’07, June11,2007.
[56] Socievole Annalisa, De Rango Floriano. Evaluation of routing schemes in opportunisticnetworks considering energy consumption[C]. International Symposium on PerformanceEvaluation of Computer and Telecommunication Systems,2012:41-47.
[57] Y. Wang, S. Jain, and M. Martonosi, et al. Erasure coding based routing for opportunisticnetworks[C]. Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking(WDTN),2005.
[58] S. Jain, M. Demmer, and R. Patra, et al. Using redundancy to cope with failures in a delaytolerant network[C]. SIGCOMM’05, August22-26,2005.
[59] Y. Liao, K. Tan, and Z. Zhang, et al. Estimation based erasure coding routing in delaytolerantNetworks[C]. International Wireless Communications and Mobile ComputingCo-nference,2006.
[60] Y. Liao, K. Tan, and Z. Zhang, et al. Combining erasure-coding and relay node evaluation indelay tolerant network routing[R]. Microsoft Technical Report, MR-TR,2006.
[61] L. J. Chen, C. H. Yu, and T. Sun. A hybrid routing approach for opportunistic networ-ks[C]. ACM SIGCOMM Workshop on Challenged Networks,2006.
[62] J. Davis, A. Fagg, and B. Levine.Wearable computers as packet transport mechanismsin highly partitioned ad hoc networks[C]. Proceedings of5IEEE International Symposium on Wearable Computers, Zurich, Switzerland,2001.
[63] Al-Karaki J N, Kamal A E. Routing techniques in wireless sensor networks: A survey[J]. IEEEWireless Communications,2004,11(6):6-28.
[64] Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connectednetworks[J]. ACM SIGMOBILE CCR,2003,7(3):19-20.
[65] H. Dubois-Ferriere, M. Grossglauser and M. Vetterli. Age matters: Efficient route discovery inmobile ad hoc networks using encounter ages[C]. Proceedings of ACM OBIHOC,2003.
[66] K. Tan, Q. Zhang and W. Zhu. Shortest path routing in partially connected ad hoc networks[C].IEEE Globecom,2003.
[67] Burns, O. Brock and B. N. Levine. MV routing and capacity building in disruption tolerantnetworks[C]. Proceedings of IEEE INFOCOM,2005.
[68] S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network[C]. Proceedings of ACMSIGCOMM,2004.
[69] Jones EPC, Li L and Ward PAS. Practical routing in delay-tolerant networks. In: Proc. of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking[C]. Philadelphia: ACM,2005:237-243.
[70] J. Burgess, B. Gallagher and D. Jensen et al. Maxprop: Routing for vehicle-based disruptiontolerant networks[C]. Proceedings of INFOCOM,2006.
[71] E. C. R. de Oliveira and C′elio V. N. de Albuquerque. NECTAR: A DTN routing protocolbased on neighbourhood contact history[C].SAC09March,2009.
[72] Q. Yuan, I. Cardei, and J. Wu. Predict and relay: an efficient routing in disruption-tolerantnetworks. mobihoc’09, May,2009.
[73] Chen C, Chen Z. Evaluating contacts for routing in highly partitioned mobile networks[C]. In:Proc. of the1st Int’l MobiSys Workshop on Mobile Opportunistic Networking. San Juan: ACM,2007:17-24.
[74] Musolesi M, Mascolo C. CAR: Context-Aware adaptive routing for delay tolerant mobi-le networks[J]. IEEE Trans on Mobile ComComputing,2009,8(2):246-260.
[75] Jacquet P, Mans B. Routing in intermittently connected networks: Age rumors in connectedcomponents[C]. In: Proc. of the5th Annual IEEE Int’l Conf. on Pervasive Computing andCommunications Workshops, PerCom Workshops2007,2007:53-58.
[76] R. H. Frenkiel and T. Innielinski. Infostations: The joy of ‘manytime, many-where’ co-mmunications[J]. Journal on Mobile Computing, May,1996.
[77] D. Goodman, J. Borras, and N. Mandayam et al. INFOSTATIONS: A new system model fordata and messaging services[J]. IEEE VTC’97, May1997, vol.(2):969-973.
[78] W. Zhao, Y. Chen, and M. Ammar, et al. Capacity enhancement using throwboxes in dtns[C].IEEE MASS, October2006.
[79] F. Farahmand, I. Cerutti, and A. N. Patel, et al. Relay node placement in vehicular delaytolerant networks[C]. IEEE Global Telecommunications Conference-GLOBECOM2008,November2008,27(1):2514-2518.
[80] I. Chatzigiannakis, S. Nikoletseas and P. Spirakis. Analysis and experimental evaluation of aninnovative and efficient routing protocol for ad-hoc mobile networks[J]. Lecture Notes inComputer Science,2001, vol.1982:99-111.
[81] I. Chatzigiannakis, S. Nikoletseas, and N. Paspallis, et al. An Experimental Study of BasicCommunication Protocols in Ad-Hoc Mobile Networks[C]. Proceedings of the5th Workshopon Algorithmic Engineering,2001.
[82] R. C. Shah, S. Roy, and S. Jain, et al. DataMules: modeling and analysis of a three-tierarchitecture for sparse sensor networks[J]. Elsevier Ad Hoc Networks Journal,2003.
[83] W. Zhao and M. Ammar. Proactive routing in highly partitioned wireless ad hoc networks[C].9th IEEE International Workshop on Future Trends of Distributed Computing Systems, May,2003.
[84] A. Kansal, A. A. Somasundara and D. D. Jea, et al. Intelligent fluid infrastructure for embeddednetworks[C]. ACM MobiSys2004,2004.
[85] A. A. Somasundara, A. Ramamoorthy and M. B.Srivastava. Mobile element scheduling forefficient data collection in wireless sensor networks with dynamic deadlines[C].Proceedings ofthe25th IEEE International Real Time Systems Symposium2004,2004.
[86] M. M. B. Tariq, M. Ammar and E. Zegura. Message ferry route design for sparse ad hocnetworks with mobile nodes[C]. ACM MobiHoc’06, May22-25,2006.
[87] W. Zhao, M. Ammar and E. Zegura. A message ferrying approach for data delivery in sparsemobile ad hoc networks[C]. Proceedings of MobiHoc,2004:187-198.
[88] W. Zhao, M. Ammar and E. Zegura.Controlling the Mobility of Multiple Data TransportFerries in a Delay-Tolerant Network[C]. INFOCOM,2005.
[89] D. Jea, A. Somasundara and M. Srivastava. Multiple controlled mobile elements (data mules)for data collection in sensor networks[C]. DCOSS,2005.
[90] K. Harras and K. Almeroth. Inter-regional messenger scheduling in delay tolerant mobilenetworks[C]. Proceedings of WoWMoM'06, June2006.
[91] Y. Gu, D. Bozdag and E. Ekici, et al. Partitioning based mobile element scheduling inwireless sensor networks[C]. Proceedings of the2nd Annual IEEE Conference on Sensor andAd Hoc Communications and Networks,2005.
[92] Y. Gu, D. Bozda g and E. Ekici. Mobile element based differentiated message delivery inwireless sensor networks[C]. Proceedings of the2006International Symposium on a World ofWireless, Mobile and Multimedia Networks (WoWMoM'06),2006.
[93] Broch J, Maltz DA, Johnson DB, Hu Y, Jetcheva J. A performance comparison of multi-hopwireless ad hoc network routing protocols[C]. In: Proc. of the4th Annual ACM/IEEE Int’lConf. on Mobile Computing and Networking. Dallas: ACM,1998:85-97.
[94] Small T, Haas ZJ. Resource and performance tradeoffs in delay-tolerant wireless networks[C].In: Proc. of the2005ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005:260-267.
[95] Bettstetter C. Mobility modeling in wireless networks: Categorization, smooth movement, andborder effects[J]. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):55-66.
[96] Jindal A, Psounis K. Performance analysis of epidemic routing under contention. In: Proc. ofthe2006Int’l Conf. on Wireless Communications and Mobile Computing. Vancouver: ACM,2006:539-544.
[97] UCSD. Wireless topology discovery project,2004. http://sysnet.ucsd.edu/wtd/wtd.html
[98] Eagle N, Pentland A. Reality mining: sensing complex social systems[J]. Personal UbiquitousComputing,2006,10(4):255-268.
[99] Diot C, et al. Haggle project.2004. http://www.haggleproject.org
[100] Zhang X, Kurose J, and Levine BN, et al. Study of a bus-based disruption-tolerant network:Mobility modeling and impact on routing[C]. In: Proc. of the13th Annual ACM Int’l Conf. onMobile Computing and Networking. Montréal: ACM,2007:195-206.
[101] Cai H, Eun DY. Crossing over the bounded domain: from exponential to power-lawinter-meeting time in MANET[C]. In: Proc. of the13th Annual ACM Int’l Conf. on MobileComputing and Networking. Montréal: ACM,2007:159-170.
[102] Conti M, Giordano S. Multihop ad hoc networking: the reality[J]. Communications Magazine,2007,45(4):88-95.
[103] Musolesi M, Mascolo C. A community based mobility model for ad hoc network research[C].In Proc. of the2nd Int’l Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality.New York: ACM,2006:31-38.
[104] Spyropoulos T, Psounis K, Raghavendra CS. Performance analysis of mobility-assistedr-outing[C]. In Proc. of the7th ACM Int’l Symp. on Mobile Ad Hoc Networking andComputing. Florence: ACM,2006:49-60.
[105] Hsu WJ, Spyropoulos T, Psounis K, Helmy A. Modeling time-variant user mobility inwireless mobile networks[C]. In Proc. of the26th IEEE Int’l Conf. on ComputerCommunications. IEEE,2007:758-766.
[106] Hui P, Crowcroft J. How small labels create big improvements[C]. In Proc. of the5th IEEEInt’l Conf. on Pervasive Computing and Communications Workshops. IEEE Computer Society,2007:65-70.
[107] Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerantMANETs[C]. In Proc. of the8th ACM Int’l Symp. on Mobile Ad Hoc Networking andComputing. Montreal: ACM,2007:32-40.
[108] A. Lindgren and K. S. Phanse. Evaluation of queuing policies and forwarding strategies forrouting in intermittently connected networks[C]. In Proc, of IEEE COMSWARE,2006.
[109] A. Krifa, C. Barakat and T. Spyropoulos. Optimal buffer management policies for delaytolerant networks[C]. In proceedings of the2008IEEE Communications Society Conference onSensor and AdHoc Communications and Networks(SECON’08), San Francisco, USA,2008:260-268.
[110] Y. Li, M. Qian, D. Jin et al. Adaptive optimal buffer management policies for realisticDTN[C]. In Proceedings of IEEE GLOBECOM2009, Honolulu, HI, USA,2009.
[111] Y. Ma, J. Abbas. Cooperative content dissemination in intermittently connected networks[C].In Proceedings of IEEE ICC, Tel Aviv, Israel,2009:245-254.
[112] L. Yin, H. Lu, Y. d. Cao et al. Buffer Scheduling Policy in DTN Routing Protocols[C]. InProceedings of2nd International Conference on Future Computer and Communication, Beijing,China,2010:808-813.
[113] Yazhou JIAO, Zhigang JIN and Yantai Shu et al. Data dissemination in delay and disruptiontolerant networks based on content classification[C]. In2009Fifth international conference onmobile ad-hoc and sensor networks,2009:1-5.
[114] Elizabeth Daly and Mads Haahr. Social network analysis for routing in disconnecteddelay-tolerant MANETs[C]. Proc of the MobiHoc2007. Montreal: ACM Press,2007:32-40.
[115] Peter V. Marsden. Egocentric and sociocentric measures of network centrality[J]. Socialnetworks. October,2002:407-422.
[116] Martin Everetta and Stephen P. Borgattib. Ego network betweenness[J]. Social networks27(1),2005:31-38.
[117]王博，黄传河，杨文忠.时延容忍网络中基于效用转发的自适应机会路由算法[J].通信学报，2010，31(10):36-47.
[118]彭敏.延迟容忍网络中移动模型与路由技术研究[D].合肥:中国科学技术大学,2011.
[119] Veeraruna Kavitha, Eitan Altman. Analysis and design of message ferry routes in sensornetworks using polling models[C]. Proceedings of International Symposium on Modeling andOptimization in Mobile, Ad Hoc and Wireless Networks, Avignon, France,2010:247-255.
[120] Wenrui Zhao. Routing and network design in delay tolerant networks[D]. Georgia Institute ofTechnology.2006
[121] Mooi Choo Chuah, Peng Yang. A message ferrying scheme with differentiated services[C].Proceedings of IEEE Military Communications Conference, Atlantic City, NJ, USA,2005:1521-1527.
[122] Wenrui Zhao and Mostafa H. Ammar. Proactive routing in highly-partitioned wireless ad hocnetworks[C]. In the9thIEEE International Workshop on Future Trends of DistributedComputing Systems, May,2003.
[123] G. Nemhauser. A. Rinnooy Kan. and M. Todd (editors). Optimization[M].1989.
[124] Zhen Zhang, Zongming Fei. Route design for multiple ferries in delay tolerant net-works[C].Proceedings of IEEE Wireless Communications and Networking Conference, Hong Kong,China,2007:3460-3465.
[125] D. S. Johnson, L. A. McGeoch, and E. E. Rothberg. Aaymptotic experimental analysisfor the herd-karp traveling salesman bound[C]. In Proc.7thAnn. ACM-SIAM Symp.On Discrete Algorithems,1996.
[126] J.Bentley. Fast algorithms for geometric traveling salesman problems [J]. ORSA Journal onComputing,1992,4:387-411.
[127] Ari Ker nen, J rg Ott, Teemu K rkk inen. The ONE Simulator for DTN ProtocolEvaluation[C]. SIMUTools’09: Proceedings of the2nd International Conference on SimulationTools and Techniques,2009.
[128] Chen X and Murphy A.L. Enabling disconnected transitive communication in mobile ad hocnetworks[C]. In Proc. of the Workshop on Principles of Mobile Computing (POMC’01),Newport, RI (USA), August2001.
[129] Kamal Mistry, Sanjay Srivastava, R. B. Lenin. Buffer aware routing in interplanetary ad hocnetwork[J]. In Communication Systems and Networks and Workshops,2009:1-10.
[130] Sulma Rashid, Qaisar Ayub. Effective buffer management policy: DLA for DTN routingprotocols under congestion[J]. International Journal of Computer and Network Security,2010:118-121.
[131] Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid et al. Abdullah. Optimization of DTNrouting protocols by using forwarding strategy (TSMF) and queuing drop policy (DLA)[J].International Journal of Computer and Network Security,2010:71-75.
[132] Sulma Rashid, Qaisar Ayub, M. Soperi Mohd Zahid et al., E-DROP: an effective dropbuffer management policy for DTN routing protocols[J]. International Journal of Comp-uter Applications (0975-8887),2011:8-13.
[133] X. Zhang, G. Neglia, J. Kurose et al. Performance modeling of epidemic routing[C]. InProceeding of IFIP Networking,2006:1-29.
[134] A. Krifa, C. Barakat, and T. Spyropoulos. An optimal joint scheduling and drop polic-y for delay tolerant networks[C]. In WoWMoM workshop on Autonomic and Opportunistic Communication (AOC),2008.
[135] Stylianos Dimitriou, Vassilis Tsaoussidis. Effective buffer and storage management in DTNnodes [C]. In Ultra Modern Telecommunications&Workshops,2009, ICUMT’09,2009:1-3.
[136] Sathita Kaveevivitchai, Hideya Ochiai et al. Message deletion and mobility patterns forefficient message delivery in DTNs [C]. Pervasive Computing and Communication Workshops(PERCOM Workshops),20108th IEEE International Conference,2010:760-763.
[137] Liao Yong, Tan Kun. Estimation based erasure-coding routing in delay tolerant networks [C].IWCMC’06,2006:557-562.
[138]唐丽均,李云,柴毅等.一种结合传染路由的缓存调度算法[J].西安电子科技大学学报,2012, vol.39(1):169-174.
[139] Lijun Tang, Yi Chai, Yun Li, et al. Buffer management policies in opportunistic networks [J].Journal of Computational Information Systems,2012, vol.8(12):5149-5159.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |