机会网络数据分发关键技术研究
|
摘要
机会网络是一种不需要源节点和目标节点之间存在完整的通信链路,利用节点移动带来的相遇机会实现数据通信的自组织网络。作为一种全新的组网方式,它突破了传统网络对于延迟和传输率的限制,使得机会网络在很多领域有着巨大的应用潜力。其数据通信有着如下典型特征：1)节点移动频繁,网络常处于不连通状态,数据端到端延时较长。2)数据传输强依赖于节点移动带来的相遇机会,从而以刻画节点相遇概率与时间周期分布的移动模型成为影响网络性能的关键因素。3)缓存空间需求矛盾比MANET更加突出；由于数据在网络中要滞留较长时间,使得中继节点的存储空间消耗较快。其对缓存容量有着更高的要求。
机会网络数据分发的研究难点在于如何在高延迟、低数据率的网络环境下确保其效率与数据的可靠传输。由于机会网络节点采用“缓存-移动-转发”的机制进行数据通信,这就需要对于协作缓存、缓存替换、路由以及支持移动性的底层通信协议等方面进行全面地考虑。基于此,本文在提高数据分发效率和传输性能密切相关的算法和协议方面展开研究,主要的工作和创新性成果包括：
(1)基于刻画相遇概率与时间周期分布的机会网络节点移动模型,提出了一种机会网络节点协作缓存优化策略
已有缓存策略研究并未将节点移动规律作为一个重要因素进行考虑,实际上在机会网络中节点的移动规律影响着节点之间的协作关系与局部域的稳定,并进
一步影响着数据块的有效性和可用性。为此,提出了一种以人为载体的机会网络协作缓存优化策略：HMP-Cache。深入研究了人类移动模式中节点运动状态与相对静止状态下的特点,利用目标地址匹配标准来严格选择协作缓存节点,对数据无用多跳转发造成的影响进行有效控制；并采用同步Cache数据表来达到局部域内缓存信息共享的目的,力求弥补单个节点缓存资源有限的不足,从而进行cache信息有效共享,以此达到充分利用各个移动节点有限的缓存资源,有效提高热点数据命中率的目标。
(2)基于前述的协作缓存优化策略,以节点与数据相关度为标准,进一步提出了一种机会网络节点缓存替换策略
已有缓存替换策略工作大多是以数据的相关访问信息作为替换标准,如访问次数,最后一次访问时间,数据项尺寸大小等,以此来对数据项替换策略进行设计。而对于数据的有效性考虑不够。为此,提出了一种新的节点缓存替换策略：ON-CRP,深入讨论了节点移动模式对缓存区内数据项“有用性”的影响,采用特定数据与特定节点的相关度来进行替换标准的设计；同时将数据的访问与更新频率作为影响缓存数据有效性的重要因素进行了设计；并讨论了齐夫分布在不同的参数取值情况下对性能的影响。仿真实验结果表明本文策略能够有效降低数据的远程访问延迟,提高数据缓存命中率。
(3)根据节点不同运动状态,利用多因素综合评判理论,提出了一种采用混合数据转发行为的机会网络路由算法
目前已有的机会网络路由研究绝大多数仅采用单一的数据转发行为来进行设计,并未结合节点运动状态的改变来综合考虑性能。同时,单一的数据转发行为往往并不能完全适用于现实环境。针对现有工作的不足,本文根据节点不同运动状态进行相应的数据转发行为设计,在节点正常移动状态下,采用节点信任度,目标地址匹配标志,网络跳数来严格选择有效的中继节点以控制无用多跳转发的影响和资源耗费,在节点小幅度往返移动的状态下则采用有限洪泛来降低数据时延。在此基础上提出了一种采用混合数据转发行为的机会网络路由算法,并且讨论了算法的性能上下界。
(4)基于无比率编码理论,提出了一种改进移动状态下数据传输性能的机会网络MAC层通信协议
由于机会网络节点的移动特性使得目前应用程度较高的蓝牙协议在数据通信过程中丢包率,抖动与随机链路错误有所上升。为此,本文提出了一种基于BlueTorrent改进的协议：BlueTorrent-ED,协议对蓝牙的关键通讯参数集进行优化设计,并采用无比率编码算法进行了数据分发优化,从而降低数据丢包影响并提高网络可靠性。
Opportunistic network is self-organization Network that utilizes the mobile node contact opportunity to achieve data communications. It does not require one complete communication path exists between source and destination. As a new Network formation, it breaks through the data latency and transfer rate restrictions of traditional networks. Therefore, Opportunistic network has great potential applications in many areas. It is more suitable for practical self-organization network applications than traditional Mobile Ad Hoc Network in real environment. There are the following typical characteristics in data communication of opportunistic networks.
1) The nodes move frequently with large range in opportunistic networks, the network is often divided into several sub-regions which are not mutually connected. Moreover, the low wireless channel capacity leads to the long data end to end latency.
2) The data communication depends on contact chance arising from node movement. Thus the node mobile model that characterizes the probability of the node contact and time period data distribution becomes the key factor in network communication performance.
3) Contradictions of node cache space are more prominent than the MANET, data lives long time in network because relay nodes adopt "store-carry-forward" pattern to transfer data. Therefore, relay node's cache space consume fast. It has a higher buffer capacity requirements comparing with traditional MANET.
Difficulty of Opportunistic network data dissemination is to ensure its efficiency and reliability of data transmission in high latency and low data rate network environment. It needs to think about cooperative cache, cache replacement, routing and MAC layer protocol and so on because nodes adopt "cache-move-forward" mode to communication. Therefore, the main work and contributions are presented in the following aspects:
(1) An Opportunistic network data cooperative caching policy based on mobile Patterns of Humans is proposed, which is characterized by the probability of the node contact and time period data distribution
The node movement pattern is not considered as an important factor in many of existing policies that has impact on cache performance. In fact, node movement trajectory affects collaborative relationships between nodes and the stability of the local network domain. Moreover, it has impact on the effectiveness and availability of data blocks. Therefore, a cooperative caching policy based on human mobility patterns is proposed, which is referred as HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. Also, the sharing caching information is done by synchronization of caching table in local region. Therefore, the shortcoming of limited caching resources is compensated and the remote data latency is reduced. Moreover, the cache hit ratio is improved.
(2) Taking the correlation between the nodes and the data item as replace standard, a cache replacement policy for opportunistic networks is further proposed, which is based on the foregoing cooperative caching policy.
Most existing cache replace policies take the data access information as replace standard, such as access times, the data item size and the last access time. But the validity of data is not considered in existing research. Thus, a novel cache replacement policy is proposed, which referred as ON-CRP. ON-CRP chooses the data item to replace based on the correlation between the nodes and the item. It utilizes the probability of destination-matching to judge the correlation which is gotten from humans mobile patterns. Furthmore, the visit and update frequency ratio is used to design the standard of cache data replacement. In addition, the performance impact of Zipf distribution parameter is dicussed. The simulation results show that our policy can reduce the latency of remote data access while cache hit ratio of data is improved.
(3) Using a general evaluating mechanism, an opportunistic networks routing policy based on node different movement staus is proposed, which uses hybird data forwarding behaviors.
Most existing routing algorithms assume a single forward behavior during the entire data transfer process without considering human movement changes in mobility patterns. In the real world, however, a single forward behavior may not be applicable in different contexts. Therefore, we utilize different data forwarding behavior according to the node move staus. The key factor of data dissemination policy is discussed in depth. In normal move status, the network traffic and resource consumption caused by useless data dissemination of multiple hops are reduced efficiently through the design of selecting relaying nodes. In small move status, the limit flooding is used to reduce the data latency. Furthermore, a routing policy based on node different movement staus is proposed referred as HMP. Moreover the upper and lower bounds of HMP performance are analyzed.
(4) A Bluetooth MAC layer protocol based on rateless coding theory is proposed, which is improved data transmission performance upon bluetorrent protocol.
Bluetooth protocol is employed as the MAC layer protocol given its popularity and technical maturity in mobile devices. However, the Bluetooth is a low data rate and short distance communication protocol. The opportunistic networks mobile features make the packet loss rate, jitter and random link error increased in communication. Therefore, a novel Bluetooth protocol is proposed. It is improved upon Bluetorrent, referred as Bluetorrent-ED. Bluetorrent-ED optimizes Bluetooth communication parameters to improve the efficiency. Furthermore, to improve network reliability, On-Line coding algorithm is used for reduce the impact of data drop and optimization in data dissemination.
机会网络数据分发的研究难点在于如何在高延迟、低数据率的网络环境下确保其效率与数据的可靠传输。由于机会网络节点采用“缓存-移动-转发”的机制进行数据通信,这就需要对于协作缓存、缓存替换、路由以及支持移动性的底层通信协议等方面进行全面地考虑。基于此,本文在提高数据分发效率和传输性能密切相关的算法和协议方面展开研究,主要的工作和创新性成果包括：
(1)基于刻画相遇概率与时间周期分布的机会网络节点移动模型,提出了一种机会网络节点协作缓存优化策略
已有缓存策略研究并未将节点移动规律作为一个重要因素进行考虑,实际上在机会网络中节点的移动规律影响着节点之间的协作关系与局部域的稳定,并进
一步影响着数据块的有效性和可用性。为此,提出了一种以人为载体的机会网络协作缓存优化策略：HMP-Cache。深入研究了人类移动模式中节点运动状态与相对静止状态下的特点,利用目标地址匹配标准来严格选择协作缓存节点,对数据无用多跳转发造成的影响进行有效控制；并采用同步Cache数据表来达到局部域内缓存信息共享的目的,力求弥补单个节点缓存资源有限的不足,从而进行cache信息有效共享,以此达到充分利用各个移动节点有限的缓存资源,有效提高热点数据命中率的目标。
(2)基于前述的协作缓存优化策略,以节点与数据相关度为标准,进一步提出了一种机会网络节点缓存替换策略
已有缓存替换策略工作大多是以数据的相关访问信息作为替换标准,如访问次数,最后一次访问时间,数据项尺寸大小等,以此来对数据项替换策略进行设计。而对于数据的有效性考虑不够。为此,提出了一种新的节点缓存替换策略：ON-CRP,深入讨论了节点移动模式对缓存区内数据项“有用性”的影响,采用特定数据与特定节点的相关度来进行替换标准的设计；同时将数据的访问与更新频率作为影响缓存数据有效性的重要因素进行了设计；并讨论了齐夫分布在不同的参数取值情况下对性能的影响。仿真实验结果表明本文策略能够有效降低数据的远程访问延迟,提高数据缓存命中率。
(3)根据节点不同运动状态,利用多因素综合评判理论,提出了一种采用混合数据转发行为的机会网络路由算法
目前已有的机会网络路由研究绝大多数仅采用单一的数据转发行为来进行设计,并未结合节点运动状态的改变来综合考虑性能。同时,单一的数据转发行为往往并不能完全适用于现实环境。针对现有工作的不足,本文根据节点不同运动状态进行相应的数据转发行为设计,在节点正常移动状态下,采用节点信任度,目标地址匹配标志,网络跳数来严格选择有效的中继节点以控制无用多跳转发的影响和资源耗费,在节点小幅度往返移动的状态下则采用有限洪泛来降低数据时延。在此基础上提出了一种采用混合数据转发行为的机会网络路由算法,并且讨论了算法的性能上下界。
(4)基于无比率编码理论,提出了一种改进移动状态下数据传输性能的机会网络MAC层通信协议
由于机会网络节点的移动特性使得目前应用程度较高的蓝牙协议在数据通信过程中丢包率,抖动与随机链路错误有所上升。为此,本文提出了一种基于BlueTorrent改进的协议：BlueTorrent-ED,协议对蓝牙的关键通讯参数集进行优化设计,并采用无比率编码算法进行了数据分发优化,从而降低数据丢包影响并提高网络可靠性。
Opportunistic network is self-organization Network that utilizes the mobile node contact opportunity to achieve data communications. It does not require one complete communication path exists between source and destination. As a new Network formation, it breaks through the data latency and transfer rate restrictions of traditional networks. Therefore, Opportunistic network has great potential applications in many areas. It is more suitable for practical self-organization network applications than traditional Mobile Ad Hoc Network in real environment. There are the following typical characteristics in data communication of opportunistic networks.
1) The nodes move frequently with large range in opportunistic networks, the network is often divided into several sub-regions which are not mutually connected. Moreover, the low wireless channel capacity leads to the long data end to end latency.
2) The data communication depends on contact chance arising from node movement. Thus the node mobile model that characterizes the probability of the node contact and time period data distribution becomes the key factor in network communication performance.
3) Contradictions of node cache space are more prominent than the MANET, data lives long time in network because relay nodes adopt "store-carry-forward" pattern to transfer data. Therefore, relay node's cache space consume fast. It has a higher buffer capacity requirements comparing with traditional MANET.
Difficulty of Opportunistic network data dissemination is to ensure its efficiency and reliability of data transmission in high latency and low data rate network environment. It needs to think about cooperative cache, cache replacement, routing and MAC layer protocol and so on because nodes adopt "cache-move-forward" mode to communication. Therefore, the main work and contributions are presented in the following aspects:
(1) An Opportunistic network data cooperative caching policy based on mobile Patterns of Humans is proposed, which is characterized by the probability of the node contact and time period data distribution
The node movement pattern is not considered as an important factor in many of existing policies that has impact on cache performance. In fact, node movement trajectory affects collaborative relationships between nodes and the stability of the local network domain. Moreover, it has impact on the effectiveness and availability of data blocks. Therefore, a cooperative caching policy based on human mobility patterns is proposed, which is referred as HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. Also, the sharing caching information is done by synchronization of caching table in local region. Therefore, the shortcoming of limited caching resources is compensated and the remote data latency is reduced. Moreover, the cache hit ratio is improved.
(2) Taking the correlation between the nodes and the data item as replace standard, a cache replacement policy for opportunistic networks is further proposed, which is based on the foregoing cooperative caching policy.
Most existing cache replace policies take the data access information as replace standard, such as access times, the data item size and the last access time. But the validity of data is not considered in existing research. Thus, a novel cache replacement policy is proposed, which referred as ON-CRP. ON-CRP chooses the data item to replace based on the correlation between the nodes and the item. It utilizes the probability of destination-matching to judge the correlation which is gotten from humans mobile patterns. Furthmore, the visit and update frequency ratio is used to design the standard of cache data replacement. In addition, the performance impact of Zipf distribution parameter is dicussed. The simulation results show that our policy can reduce the latency of remote data access while cache hit ratio of data is improved.
(3) Using a general evaluating mechanism, an opportunistic networks routing policy based on node different movement staus is proposed, which uses hybird data forwarding behaviors.
Most existing routing algorithms assume a single forward behavior during the entire data transfer process without considering human movement changes in mobility patterns. In the real world, however, a single forward behavior may not be applicable in different contexts. Therefore, we utilize different data forwarding behavior according to the node move staus. The key factor of data dissemination policy is discussed in depth. In normal move status, the network traffic and resource consumption caused by useless data dissemination of multiple hops are reduced efficiently through the design of selecting relaying nodes. In small move status, the limit flooding is used to reduce the data latency. Furthermore, a routing policy based on node different movement staus is proposed referred as HMP. Moreover the upper and lower bounds of HMP performance are analyzed.
(4) A Bluetooth MAC layer protocol based on rateless coding theory is proposed, which is improved data transmission performance upon bluetorrent protocol.
Bluetooth protocol is employed as the MAC layer protocol given its popularity and technical maturity in mobile devices. However, the Bluetooth is a low data rate and short distance communication protocol. The opportunistic networks mobile features make the packet loss rate, jitter and random link error increased in communication. Therefore, a novel Bluetooth protocol is proposed. It is improved upon Bluetorrent, referred as Bluetorrent-ED. Bluetorrent-ED optimizes Bluetooth communication parameters to improve the efficiency. Furthermore, to improve network reliability, On-Line coding algorithm is used for reduce the impact of data drop and optimization in data dissemination.
引文
[1]国家中长期科学和技术发展规划纲要(2006-2020年)[EB/OL]. http://www.gov.cn/jrzg/2006-02/09/content_183787.htm
[2]熊永平、孙利民、牛建伟等。机会网络[J],软件学报,2009,20(1)：124-137
[3]欧中洪、宋美娜、战晓苏等。移动对等网络关键技术[J],软件学报,2008,19(2)：404-418
[4]S. Jung, U. Lee, A. Chang, et al. BlueTorrent:Cooperative Content Sharing for Bluetooth Users IEEE PerCom'07, White Plains, NY, Mar.2007.
[5]Uichin Lee, Sewook Jung, Alexander Chang et al. Bluetooth-based P2P Content Distribution to Mobile Users UCLA Technical Report:TR-070013,2008
[6]Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, et.al. CarTel:A distributed mobile sensor computing system. In:Proc. of the 4th Int'1 Conf. on Embedded Networked Sensor Systems. Boulder:ACM,2006.125-138.
[7]Pentland A, Fletcher R, Hasson A. DakNet:Rethinking connectivity in developing nations. Computer,2004,37(1):78-83.
[8]Juang P, Oki H, Wang Y, Martonosi M, et,al. Energy-Efficient computing for wildlife tracking:Design tradeoffs and early experiences with ZebraNet. In:Proc. of the 10th Int'1 Conf. on Architectural Support for Programming Languages and Operating Systems. New York:ACM,2002.96.107.
[9]Small T, Haas ZJ. The shared wireless infostation model:A new ad hoc networking paradigm (or where there is a whale, there is away). In:Proc. of the 4th ACM Int'1 Symp. On Mobile Ad Hoc Networking. Annapolis:ACM,2003.233-244.
[10]BBC NEWS:Music trial taps into Bluetooth.http://news.bbc.co.uk/1/hi/technology/4392534.stm
[11]CBS Goes Bluetooth To Promote Fall TV Line-Up. http://www.telecomweb.com/tnd/18847.html
[12]张帆,延迟容忍传感器网络性能研究：[博士学位论文],武汉：华中科技大学,2007.
[13]孙利民、熊永平、马建,机会移动传感器网络中的自适应数据收集机制[J],通信学报,2008,29(11)：186-193
[14]朱金奇,延迟容忍无线传感器网络中的动态数据收集技术及其研究：[博士学位论文],成都：电子科技大学,2009.
[15]李向群、刘立祥、 胡晓惠等,延迟/中断可容忍网络研究进展[J],计算机研究与发展,2009,46(8)：1270-1277
[16]Fall K. A delay-tolerant network architecture for challenged Internets. In:Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe:ACM,2003.27-34.
[17]Pentland A, Fletcher R, Hasson A. DakNet:Rethinking connectivity in developing nations. Computer,2004,37(l):78-83.
[18]Avri D, Maria U, and Durga PP. Providing connectivity to the Saami nomadic community. In:Proc. of the 2nd Int'1 Conf. on Open Collaborative Design for Sustainable Innovation. Bangalore,2002.
[19]Brewer E, et al. Tier project.2006. http://tier.cs.berkeley.edu/wiki/Home
[20]K.Fall,"A Delay-Tolerant Network Architecture for Challenged Internets",Intel Research Technical Report,IRB-TR-03-003,Feb.,2003
[21]http://www.ipnsig.org
[22]Rajesh Krishnan, Prithwish Basu, Joanne M.Mikkelson. the SPINDLE Disruption-Tolerant Networking System. IEEE MILCOM 2007.2007.10:29-31
[23]http://www.dtnrg.org
[24]http://www.ee.surrey.ac.uk/Personal/L.Wood/dtn/
[25]Broch J, Maltz DA, Johnson DB, Hu Y, Jetcheva J. A performance comparison of multi-hop wireless ad hoc network routing protocols. In:Proc. of the 4th Annual ACM/IEEE Int'1 Conf. on Mobile Computing and Networking. Dallas:ACM,1998. 85-97.
[26]Bettstetter C. Mobility modeling in wireless networks:Categorization, smooth movement, and border effects. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):55-66.
[27]Small T, Haas ZJ. Resource and performance tradeoffs in delay-tolerant wireless networks. In:Proc. of the ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.260-267.
[28]Jindal A, Psounis K. Performance analysis of epidemic routing under contention. In: Proc. of the 2006 Int'l Conf. on Wireless Communications and Mobile Computing. Vancouver:ACM,2006.539-544.
[29]S.Farrell, V.Cahill, D.Geraghty, I.Humphreys et al.When TCP Breaks:Delay-and Disruption-Tolerant Networking.IEEE Internet Computing,2006,10(4):72-78
[30]A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on the Design of Opportunitic Forwarding Algorithms. In Proc. IEEE INFOCOM,2006.
[31]L.-J. Chen, Y.-C. Chen, T. Sun, P. Sreedevi, K.-T. Chen, C.-H. Yu and H. hua Chu. Finding Self-Similarities in Opportunistic People Networks. In Proc. IEEE INFOCOM, Mini-Symposium,2007.
[32]Eagle N, Pentland A. Reality mining:sensing complex social systems. Personal Ubiquitous Computing,2006,10(4):255-268.
[33]UCSD.Wireless topology discovery project,2004. http://sysnet.ucsd.edu/wtd/wtd.html
[34]Diot C, et al. Haggle project.2004. http://www.haggleproject.org
[35]Zhang X, Kurose J, Levine BN, Towsley D, Zhang H. Study of a bus-based disruption-tolerant network:Mobility modeling and impact on routing. In:Proc. of the 13th Annual ACM Int'l Conf. on Mobile Computing and Networking. Montreal: ACM,2007.195-206.
[36]Cai H, Eun DY. Crossing over the bounded domain:from exponential to power-law inter-meeting time in MANET. In:Proc. of the 13th Annual ACM Int'l Conf. on Mobile Computing and Networking. Montreal:ACM,2007.159—170.
[37]Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM. 2005.244-251.
[38]M. Kim, D. Kotz, and S. Kim. Extracting a Mobility Model from Real User Traces. In Proc. IEEE INFOCOM,2006.
[39]Spyropoulos T, Psounis K, Raghavendra CS. Performance analysis of mobility-assisted routing. In:Proc. of the 7th ACM Int'1 Symp. On Mobile Ad Hoc Networking and Computing. Florence:ACM,2006.49-60.
[40]Hsu WJ, Spyropoulos T, Psounis K, Helmy A. Modeling time-variant user mobility in wireless mobile networks. In:Proc. of the 26th IEEE Int'1 Conf. on Computer Communications.2007.758-766.
[41]Injong Rhee, Minsu Shin, Seongik Hong, et al. On the Levy-Walk Nature of Human Mobility. In Proc. IEEE INFOCOM,2008, pp.924-932
[42]Kyunghan Lee, Seongik Hong, Seong Joon Kim, Injong Rhee. "SLAW:A Mobility Model for Human Walks", IEEE INFOCOM,2009.
[43]Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In:Proc. of the 8th ACM Int'1 Symp. On Mobile Ad Hoc Networking and Computing. Montreal:ACM,2007.32-40.
[44]Musolesi M, Mascolo C. A community based mobility model for ad hoc network research. In:Proc. of the 2nd Int'1 Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality. New York:ACM,31-38.
[45]S.Ni, Y.Tseng,Y.Chen and J.Sheu,The broadcast storm Problem in a mobile ad hoc network, in Proeeedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking,1999.
[46]P.Nuggehalli, Vikram Srinivasan and C.Chiasserini, Energy-efficient Caching Strategies in Ad hoc Wireless Networks, in Proc. of MobiHoc,2003.
[47]Q.Ren and M.H.Dunham. Using semantic caching to manage location dependent data in mobile computing, in the 6th annual International conference on Mobile ComPuting and Networking (MobiCom), August 2000
[48]W. Lau, M. Kumar, and S. Venkatesh, "A Cooperative Cache Architecture in Supporting Caching Multimedia Objects in MANETs," The Fifth International Workshop on Wireless Mobile Multimedia,2002.
[49]G. Cao, "Proactive Power-Aware Cache Management for Mobile Computing Systems," IEEE Transactions on Computer, vol.51, no.6, pp.608-621, June 2002
[50]G. Cao, "A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments," IEEE Transactions on Knowledge and Data Engineering, vol.15, no.5,2003
[51]LJ Yin; G. Cao, "Supporting cooperative caching in ad hoc networks," IEEE Transactions on Mobile Computing, Volume 5, Issue 1, Jan.2006 Page(s):77-89.
[52]Y.-W. Ting, Y.-K. Chang, "A Novel Cooperative Caching Scheme for Wireless Ad Hoc Networks:GroupCaching" The International Conference on Networking, Architecture, and Storages (NAS 2007), pp.62-68
[53]Y. Huang, J. Cao, and B. Jin. A predictive approach to achieving consistency in cooperative caching in Manet. In InfoScale' 06, New York, NY, USA,2006. ACM.
[54]Y. Huang, J. Cao, Z. Wang, B. Jin, and Y. Feng. Achieving flexible cache consistency for pervasive internet access. In PERCOM' 07, Washington, DC, USA, 2007. IEEE Computer Society, pages 239-250.
[55]Huaping Shen, Mary Suchitha Joseph, Mohan Kumar, Sajal K.Das. PReCinCt:A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems, the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), Denver, USA,2005, pages 88-94.
[56]L. Yin, G. Cao, Y. Cai, A generalized Target-Driven Cache Replacement Policy for Mobile Environments [A]. The IEEE Symposium on Applications on the Internet[C]. January 2003,14-21.
[57]朱金奇、刘明、龚海刚等。延迟容忍移动传感器网络中基于选择复制的数据传输[J],软件学报,2009,20(8)：2227-2240
[58]牛新征,佘堃,秦科。移动P2P网络的协作缓存优化策略[J].计算机研究与发展,2008,45(4)：656-665
[59]G. Cao, "A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments [J]. IEEE Transactions on Knowledge and Data Engineering, vol.15, no.5,2003
[60]J. Xu, Q. Hu, W.-C. Lee, and D.L. Lee, Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination [J]. IEEE Trans. Knowledge and Data Eng., vol.16, no.1,2004,125-139.
[61]J. Xu, Q. Hu, D.L. Lee, and W.-C. Lee, "SAIU:An Efficient Cache Replacement Policy for Wireless On-Demand Broadcasts[A] Proc. Ninth ACM Int'1 Conf. Information and Knowledge Management [C], Nov.2000,46-53.
[62]M S Joseph, M Kumar, Huaping Shen,et al. Energy efficient data retrieval and caching in mobile peer-to-peer networks [C] The 3rd Int'1 Conf on Pervasive Computing and Communications Workshops (PerCom'05), Hawaii, USA,2005
[63]Elias Leontiadis, Vassilios V Dimakopoulos,et al. Cache up-dates in a peer-to-peer network of mobile agents [C].The 4th IEEE Int'1 Conf on Peer-to-Peer Computing, Zurich, Switzerland,2004
[64]Chi-Yin Chow, Hong Va Leong, Alvin Chan-Peer-to-peer co-operative caching in mobile environments [C]·The 24th Int'1Conf on Distributed Computing Systems Workshops (ICDCSW'04), Hachioji, Japan,2004
[65]P.Nuggehalli, V.Srinivasan, C. F. Chiasserini, Energy-Efficient Caching Strategies in Ad Hoc Wireless Networks, Proceedings of MobiHoc 2003, Annapolis, MD, June 2003
[66]B. Tang, H. Gupta, and S. Das. Benefit-based Data Caching in Ad Hoc Networks. IEEE International Conference on Network Protocols (ICNP),2006
[67]X.Tang, S.T. Chanson, Analysis of Replica placement under ExPiration-based Consistency Management, IEEE Trans.on Paralleland Distributed Systems, VOI.17, No.11, Nov.2006, pp1253-1263.
[68]Qun Ren,Margaret H. Dunham, Using semantic caching to manage location dependent data in mobile computing, Proceedings of the 6th annual international conference on Mobile computing and networking(MobiCom), pp:210-221
[69]Shengfei Shi, Jianzhong Li and Chaokun Wang, A New Semantic Cache Management Method in Mobile Databases, Journal of Computer Science 1 (3): 351-354,2005
[70]C. Aggarwal, J. Wolf, P. Yu, Caching on the World Wide Web, IEEE Trans. Knowledge Data Eng.11 (January/February 1999).
[71]Mary Magdalene Janef, R. Parameswaran, R Nadarajan, Maytham Safar,PINE-guided cache replacement policy for location-dependent data in mobile environment, Proceedings of the 1st international conference on Pervasive Technologies Related to Assistive Environments, Jul.2008.
[72]Ajey Kumar, PManoj Misra, PA. K. Sarje, A weighted cache replacement policy for location dependent data in mobile environments, Proceedings of the ACM symposium on Applied computing, Mar.2007.
[73]J. Xu, Q. Hu, W. Lee, D. Lee, Performance evaluation of an optimal cache replacement policy for wireless data dissemination under cache consistency,2001 International Conference on Parallel Processing, September 2001.
[74]YIN L, CAO G, CAI Y. A generalized target-driven cache replacement policy for mobile environments. The IEEE Symposium on Applications on the Internet[C]. January 2003,14-21
[75]Hui Y, ZhiGang C, QinHua L, "Research of Improved QoS of Data Transmission in Bluetooth Mobile P2P Networks[A] Proceedings of the 9th ICYCS 2008[C], Nov 2008,336-341
[76]UCBT[EB/OL]. http://www.cs.uc.edu/-cdmc/ucbt/
[77]NS-2[EB/OL].URL:http://www.isi.edu/nsnam/ns/
[78]Vahdat and D. Becker, Epidemic routing for partially connected ad hoe networks, Tech.Report CS-2000-06, Department of Computer Science, Duke University, Durham, NC,2000.
[79]Khaled Harras, Kevin Almeroth and Elizabeth Belding-Royer, Delay Tolerant Mobile Networks(DTMNs):Controlled Flooding Schemes in Sparse Mobile Networks, IFIP Networking, Waterloo, Canada, May 2005.
[80]Spyropoulos T, Psounis K, Raghavendra CS. Spray and wait:An efficient routing scheme for intermittently connected mobile networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005. 252-259.
[81]Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2003,7(3):19-27.
[82]Wang Y, Wu H. DFT-MSN:The Delay/Fault-Tolerant mobile sensor network for pervasive information gathering. In:Proc. of the 25th IEEE Int'1 Conf. on Computer Communications.2006.1-12.
[83]Spyropoulos T, Psounis K, Raghavendra C. Single-Copy routing in intermittently connected mobile networks. In:Proc. of the 20041st Annual IEEE Communications Society Conf. on Sensor and Ad Hoc Communications and Networks.2004.235-244.
[84]K. Tan, Q. Zhang, and W. Zhu, Shonest path routing in partially connected ad hoc networks, IEEE Globecom,2003.
[85]Jones EPC, Li L, Ward PAS. Practical routing in delay-tolerant networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.237-243.
[86]Chen C, Chen Z. Evaluating contacts for routing in highly partitioned mobile networks. In:Proc. of the 1st Int'1 MobiSys Workshop on Mobile Opportunistic Networking. San Juan:ACM,2007.17-24.
[87]Widmer J, Boudec J Y Le. Network coding for efficient communication in extreme networks [C] Proc of ACM SIGCOMM 05. New York:ACM,2005:284-291
[88]Wang Y, Jain S, Martonosi M, et al. Erasure-coding based routing for opportunistic networks [C] Proc of ACM SIGCOMM 05. New York:ACM,2005:229-236
[89]Sushant Jain, K.Fall and R.Patra, Routing in a Delay Tolerant Network,Sigcomm'04.Aug.30,2004
[90]Liao Yong, Tan Kun, Zhang Zhensheng, et al. Estimation based erasure-coding routing in delay tolerant networks [C] Proc of IWCMC 06. New York:ACM,2006: 557-56
[91]A1-Karaki J N, Kamal A E. Routing techniques in wireless sensor networks:A survey [J]. IEEE Wireless Communications,2004,11(6):6-28
[92]Wang Y, Jain S, Martonosi M, Fall K. Erasure-Coding based routing for opportunistic networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.229-236.
[93]Brown, J. David, Pasupathy. Adaptive demodulation using rateless erasure codes. IEEE Transactions on Communications,September,2006,1574-1585
[94]Rahnavard, Nazanin. Rateless codes with unequal error protection property IEEE Transactions on Information Theory,53(4), April,2007,1521-1532
[95]P. Maymounkov and D. Mazieres. Rateless Codes and Big Downloads. In IPTPS'03, Berkeley, CA, Feb.2003.
[96]M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution. In IEEE Symposium on Security and Privacy,2004.
[97]Widmer J, Boudec JL. Network coding for efficient communication in extreme networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking.Philadelphia:ACM,2005.284-291.
[98]Ye Tian, D. Wu, and K.-W. Ng. Modeling, analysis and improvement for bittorrent-like file sharing networks[C]. In IEEE INFOCOM,2006
[99]M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution[C]. In IEEE Symposium on Security and Privacy,2004.
[100]Merhav, Neri. Minimax universal decoding with an erasure option[J]. IEEE Transactions on Information Theory,53(5), May,2007,1664-1675
[101]Marta C. Gonza'lez, Ce'sar A. Hidalgo, and Albert-La'szlo' Baraba'si. Understanding individual human mobility patterns. Nature.2008,453,779-782.
[102]Yunhao Liu, Xiaomei Liu, Li Xiao Ni. Location-aware topology matching in P2P systems. In Proc. IEEE INFOCOM,2004.
[103]Yilin Wang, Chan, E.; Wenzhong Li; "Location Dependent Cooperative Caching in MANET", In 37th International Conference on Parallel Processing Vol 9, Sept.2008. Page(s):470-477
[104]BOLDRINI C, CONTI M, PASSARELLA A. Exploiting users' social relations to forward data in opportunistic networks:the HiBOp solution[J]. Pervasive and Mobile Computing (PMC),2008,(4):633-657
[105]Watts D.J, Strogatz S H. Collective dynamics of 'small-world' networks[J]. Nature,1998,393,440-442
[106]Shah R, Roy S, Jain S, Brunette W. Data MULEs:Modeling a three-tier architecture for sparse sensor networks. In:Proc. of the 1st IEEE,2003 IEEE Int'l Workshop on Sensor Network Protocols and Applications.2003.30-41.
[107]B. Bums, O. Brock, and B. N. Levine, "MV Routing and capacity building in disruption tolerant networks", Proceedings of the IEEE INFOCOM 2005, Miami, FL, March,2005.
[108]Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In:Proc. of the 5th ACM Int'l Symp. on Mobile Ad Hoc Networking and Computing. Roppongi Hills:ACM,2004.187-198.
[109]Pan Hui, Jon Crowcroft, et al. "Bubble rap:social-based forwarding in delay tolerant networks." In the 9th ACM international symposium on Mobile ad hoc networking and computing,2008,241-250
[110]Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In:Proc. of the 8th ACM Int'l symposium on Mobile Ad Hoc Networking and Computing. Montreal:ACM,2007.32-40.
[111]Quan Yuan, Ionut Cardei and Jie Wu. Predict and Relay:An Efficient Routing in Disruption-Tolerant Networks. In Proceedings of ACM MobiHoc,2009.
[112]J.Zhao and G.Cao, "VADD:Vehiele-Assisted DataD eliveryin Vehicular Ad Hoc Networks, in proceeding of IEEE INFOCOM'06, April 2006.
[113]葛志辉,陈志刚,邓晓衡等。移动自组网中新的智能丢包区分机制。通信学报,2007,28(3)：112-120
[114]邓晓衡,陈志刚,张连明等.TCP Yuelu:一种基于有线/无线混合网络端到端的拥塞控制机制。计算机学报,2005,28(8).35-44
[115]任丰原,林闯,魏丫丫等.主动队列管理中的智能分组丢弃新机制.电子学报,2002,30(12A)：1933-1937.
[116]Qinghua Li; Sencun Zhu; Guohong Cao. Routing in Socially Selfish Delay Tolerant Networks[C], IEEE Conference on Computer Communications, IEEE INFOCOM2010, Pages:9-17
[117]S. Martello and P. Toth, "Knapsack Problems:Algorithms and Computer Implementations." John Wiley & Sons,1990.
[118]T. Small and Z. J. Haas. The Shared Wireless Infostation Model-A New AdHoc Networking Paradigm (or Where There is a Whale, There is a Way). In ACM MOBIHOC'03, Annapolis, Maryland, USA, June 2003.
[119]Bluetooth Specification v2.1,2007. [EB/OL] www.bluetooth.com/Bluetooth/Technology/Works/Core_Specification_v21_EDR.h tm
[120]B. S. Peterson, R. O. Baldwin, and J. P. Kharoufeh. Bluetooth Inquiry Time Characterization and Selection[C].IEEE Transactions on Mobile Computing, 5(9):1173-1187, Sep.2006.
[121]S. Jung, U. Lee, A. Chang, et al. BlueTorrent:Cooperative Content Sharing for Bluetooth Users[C] IEEE PerCom'07, White Plains, NY, Mar.2007.
[122]P. S. L 'or' ant Farkas, Bal'azs Bakos. A Practical Approach to Multicasting in Bluetooth Piconets. [C] In WCNC'06, Las Vegas, USA, Apr.2006.
[123]J. LeBrun and C.-N. Chuah. Feasibility Study of Bluetooth-Based Content Distribution Stations on Public Transit Systems[C]. In ACM MobiShare, Los Angeles, CA, Sept.2006.
[124]L. M. Feeney and M. Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc network. In INFOCOM,2001
[125]J. Sorber, N. Banerjee, M. D. Corner, and S. Rollins.Turducken:Hierarchical power management for mobile devices. In Mobisys,2005.
[126]Jun H, Ammar M, Corner M, Zegura E (2006) Hierarchical power management in disruption tolerant networks with traffic-aware optimization. In:ACM Sigcomm Workshop on Challenged Networks (CHANTS), Pisa,15 September 2006
[127]Jun H, Ammar MH, Zegura EW (2005) Power management in delay tolerant networks:a framework and knowledge-based mechanisms. In:Proceedings of IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON), Santa Clara,26-29 September 2005
[128]P. Maymounkov. Online Codes. Technical Report TR2002-833, New York University, October 2002.
[2]熊永平、孙利民、牛建伟等。机会网络[J],软件学报,2009,20(1)：124-137
[3]欧中洪、宋美娜、战晓苏等。移动对等网络关键技术[J],软件学报,2008,19(2)：404-418
[4]S. Jung, U. Lee, A. Chang, et al. BlueTorrent:Cooperative Content Sharing for Bluetooth Users IEEE PerCom'07, White Plains, NY, Mar.2007.
[5]Uichin Lee, Sewook Jung, Alexander Chang et al. Bluetooth-based P2P Content Distribution to Mobile Users UCLA Technical Report:TR-070013,2008
[6]Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, et.al. CarTel:A distributed mobile sensor computing system. In:Proc. of the 4th Int'1 Conf. on Embedded Networked Sensor Systems. Boulder:ACM,2006.125-138.
[7]Pentland A, Fletcher R, Hasson A. DakNet:Rethinking connectivity in developing nations. Computer,2004,37(1):78-83.
[8]Juang P, Oki H, Wang Y, Martonosi M, et,al. Energy-Efficient computing for wildlife tracking:Design tradeoffs and early experiences with ZebraNet. In:Proc. of the 10th Int'1 Conf. on Architectural Support for Programming Languages and Operating Systems. New York:ACM,2002.96.107.
[9]Small T, Haas ZJ. The shared wireless infostation model:A new ad hoc networking paradigm (or where there is a whale, there is away). In:Proc. of the 4th ACM Int'1 Symp. On Mobile Ad Hoc Networking. Annapolis:ACM,2003.233-244.
[10]BBC NEWS:Music trial taps into Bluetooth.http://news.bbc.co.uk/1/hi/technology/4392534.stm
[11]CBS Goes Bluetooth To Promote Fall TV Line-Up. http://www.telecomweb.com/tnd/18847.html
[12]张帆,延迟容忍传感器网络性能研究：[博士学位论文],武汉：华中科技大学,2007.
[13]孙利民、熊永平、马建,机会移动传感器网络中的自适应数据收集机制[J],通信学报,2008,29(11)：186-193
[14]朱金奇,延迟容忍无线传感器网络中的动态数据收集技术及其研究：[博士学位论文],成都：电子科技大学,2009.
[15]李向群、刘立祥、 胡晓惠等,延迟/中断可容忍网络研究进展[J],计算机研究与发展,2009,46(8)：1270-1277
[16]Fall K. A delay-tolerant network architecture for challenged Internets. In:Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe:ACM,2003.27-34.
[17]Pentland A, Fletcher R, Hasson A. DakNet:Rethinking connectivity in developing nations. Computer,2004,37(l):78-83.
[18]Avri D, Maria U, and Durga PP. Providing connectivity to the Saami nomadic community. In:Proc. of the 2nd Int'1 Conf. on Open Collaborative Design for Sustainable Innovation. Bangalore,2002.
[19]Brewer E, et al. Tier project.2006. http://tier.cs.berkeley.edu/wiki/Home
[20]K.Fall,"A Delay-Tolerant Network Architecture for Challenged Internets",Intel Research Technical Report,IRB-TR-03-003,Feb.,2003
[21]http://www.ipnsig.org
[22]Rajesh Krishnan, Prithwish Basu, Joanne M.Mikkelson. the SPINDLE Disruption-Tolerant Networking System. IEEE MILCOM 2007.2007.10:29-31
[23]http://www.dtnrg.org
[24]http://www.ee.surrey.ac.uk/Personal/L.Wood/dtn/
[25]Broch J, Maltz DA, Johnson DB, Hu Y, Jetcheva J. A performance comparison of multi-hop wireless ad hoc network routing protocols. In:Proc. of the 4th Annual ACM/IEEE Int'1 Conf. on Mobile Computing and Networking. Dallas:ACM,1998. 85-97.
[26]Bettstetter C. Mobility modeling in wireless networks:Categorization, smooth movement, and border effects. ACM SIGMOBILE Mobile Computing and Communications Review,2001,5(3):55-66.
[27]Small T, Haas ZJ. Resource and performance tradeoffs in delay-tolerant wireless networks. In:Proc. of the ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.260-267.
[28]Jindal A, Psounis K. Performance analysis of epidemic routing under contention. In: Proc. of the 2006 Int'l Conf. on Wireless Communications and Mobile Computing. Vancouver:ACM,2006.539-544.
[29]S.Farrell, V.Cahill, D.Geraghty, I.Humphreys et al.When TCP Breaks:Delay-and Disruption-Tolerant Networking.IEEE Internet Computing,2006,10(4):72-78
[30]A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on the Design of Opportunitic Forwarding Algorithms. In Proc. IEEE INFOCOM,2006.
[31]L.-J. Chen, Y.-C. Chen, T. Sun, P. Sreedevi, K.-T. Chen, C.-H. Yu and H. hua Chu. Finding Self-Similarities in Opportunistic People Networks. In Proc. IEEE INFOCOM, Mini-Symposium,2007.
[32]Eagle N, Pentland A. Reality mining:sensing complex social systems. Personal Ubiquitous Computing,2006,10(4):255-268.
[33]UCSD.Wireless topology discovery project,2004. http://sysnet.ucsd.edu/wtd/wtd.html
[34]Diot C, et al. Haggle project.2004. http://www.haggleproject.org
[35]Zhang X, Kurose J, Levine BN, Towsley D, Zhang H. Study of a bus-based disruption-tolerant network:Mobility modeling and impact on routing. In:Proc. of the 13th Annual ACM Int'l Conf. on Mobile Computing and Networking. Montreal: ACM,2007.195-206.
[36]Cai H, Eun DY. Crossing over the bounded domain:from exponential to power-law inter-meeting time in MANET. In:Proc. of the 13th Annual ACM Int'l Conf. on Mobile Computing and Networking. Montreal:ACM,2007.159—170.
[37]Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM. 2005.244-251.
[38]M. Kim, D. Kotz, and S. Kim. Extracting a Mobility Model from Real User Traces. In Proc. IEEE INFOCOM,2006.
[39]Spyropoulos T, Psounis K, Raghavendra CS. Performance analysis of mobility-assisted routing. In:Proc. of the 7th ACM Int'1 Symp. On Mobile Ad Hoc Networking and Computing. Florence:ACM,2006.49-60.
[40]Hsu WJ, Spyropoulos T, Psounis K, Helmy A. Modeling time-variant user mobility in wireless mobile networks. In:Proc. of the 26th IEEE Int'1 Conf. on Computer Communications.2007.758-766.
[41]Injong Rhee, Minsu Shin, Seongik Hong, et al. On the Levy-Walk Nature of Human Mobility. In Proc. IEEE INFOCOM,2008, pp.924-932
[42]Kyunghan Lee, Seongik Hong, Seong Joon Kim, Injong Rhee. "SLAW:A Mobility Model for Human Walks", IEEE INFOCOM,2009.
[43]Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In:Proc. of the 8th ACM Int'1 Symp. On Mobile Ad Hoc Networking and Computing. Montreal:ACM,2007.32-40.
[44]Musolesi M, Mascolo C. A community based mobility model for ad hoc network research. In:Proc. of the 2nd Int'1 Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality. New York:ACM,31-38.
[45]S.Ni, Y.Tseng,Y.Chen and J.Sheu,The broadcast storm Problem in a mobile ad hoc network, in Proeeedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking,1999.
[46]P.Nuggehalli, Vikram Srinivasan and C.Chiasserini, Energy-efficient Caching Strategies in Ad hoc Wireless Networks, in Proc. of MobiHoc,2003.
[47]Q.Ren and M.H.Dunham. Using semantic caching to manage location dependent data in mobile computing, in the 6th annual International conference on Mobile ComPuting and Networking (MobiCom), August 2000
[48]W. Lau, M. Kumar, and S. Venkatesh, "A Cooperative Cache Architecture in Supporting Caching Multimedia Objects in MANETs," The Fifth International Workshop on Wireless Mobile Multimedia,2002.
[49]G. Cao, "Proactive Power-Aware Cache Management for Mobile Computing Systems," IEEE Transactions on Computer, vol.51, no.6, pp.608-621, June 2002
[50]G. Cao, "A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments," IEEE Transactions on Knowledge and Data Engineering, vol.15, no.5,2003
[51]LJ Yin; G. Cao, "Supporting cooperative caching in ad hoc networks," IEEE Transactions on Mobile Computing, Volume 5, Issue 1, Jan.2006 Page(s):77-89.
[52]Y.-W. Ting, Y.-K. Chang, "A Novel Cooperative Caching Scheme for Wireless Ad Hoc Networks:GroupCaching" The International Conference on Networking, Architecture, and Storages (NAS 2007), pp.62-68
[53]Y. Huang, J. Cao, and B. Jin. A predictive approach to achieving consistency in cooperative caching in Manet. In InfoScale' 06, New York, NY, USA,2006. ACM.
[54]Y. Huang, J. Cao, Z. Wang, B. Jin, and Y. Feng. Achieving flexible cache consistency for pervasive internet access. In PERCOM' 07, Washington, DC, USA, 2007. IEEE Computer Society, pages 239-250.
[55]Huaping Shen, Mary Suchitha Joseph, Mohan Kumar, Sajal K.Das. PReCinCt:A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems, the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), Denver, USA,2005, pages 88-94.
[56]L. Yin, G. Cao, Y. Cai, A generalized Target-Driven Cache Replacement Policy for Mobile Environments [A]. The IEEE Symposium on Applications on the Internet[C]. January 2003,14-21.
[57]朱金奇、刘明、龚海刚等。延迟容忍移动传感器网络中基于选择复制的数据传输[J],软件学报,2009,20(8)：2227-2240
[58]牛新征,佘堃,秦科。移动P2P网络的协作缓存优化策略[J].计算机研究与发展,2008,45(4)：656-665
[59]G. Cao, "A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments [J]. IEEE Transactions on Knowledge and Data Engineering, vol.15, no.5,2003
[60]J. Xu, Q. Hu, W.-C. Lee, and D.L. Lee, Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination [J]. IEEE Trans. Knowledge and Data Eng., vol.16, no.1,2004,125-139.
[61]J. Xu, Q. Hu, D.L. Lee, and W.-C. Lee, "SAIU:An Efficient Cache Replacement Policy for Wireless On-Demand Broadcasts[A] Proc. Ninth ACM Int'1 Conf. Information and Knowledge Management [C], Nov.2000,46-53.
[62]M S Joseph, M Kumar, Huaping Shen,et al. Energy efficient data retrieval and caching in mobile peer-to-peer networks [C] The 3rd Int'1 Conf on Pervasive Computing and Communications Workshops (PerCom'05), Hawaii, USA,2005
[63]Elias Leontiadis, Vassilios V Dimakopoulos,et al. Cache up-dates in a peer-to-peer network of mobile agents [C].The 4th IEEE Int'1 Conf on Peer-to-Peer Computing, Zurich, Switzerland,2004
[64]Chi-Yin Chow, Hong Va Leong, Alvin Chan-Peer-to-peer co-operative caching in mobile environments [C]·The 24th Int'1Conf on Distributed Computing Systems Workshops (ICDCSW'04), Hachioji, Japan,2004
[65]P.Nuggehalli, V.Srinivasan, C. F. Chiasserini, Energy-Efficient Caching Strategies in Ad Hoc Wireless Networks, Proceedings of MobiHoc 2003, Annapolis, MD, June 2003
[66]B. Tang, H. Gupta, and S. Das. Benefit-based Data Caching in Ad Hoc Networks. IEEE International Conference on Network Protocols (ICNP),2006
[67]X.Tang, S.T. Chanson, Analysis of Replica placement under ExPiration-based Consistency Management, IEEE Trans.on Paralleland Distributed Systems, VOI.17, No.11, Nov.2006, pp1253-1263.
[68]Qun Ren,Margaret H. Dunham, Using semantic caching to manage location dependent data in mobile computing, Proceedings of the 6th annual international conference on Mobile computing and networking(MobiCom), pp:210-221
[69]Shengfei Shi, Jianzhong Li and Chaokun Wang, A New Semantic Cache Management Method in Mobile Databases, Journal of Computer Science 1 (3): 351-354,2005
[70]C. Aggarwal, J. Wolf, P. Yu, Caching on the World Wide Web, IEEE Trans. Knowledge Data Eng.11 (January/February 1999).
[71]Mary Magdalene Janef, R. Parameswaran, R Nadarajan, Maytham Safar,PINE-guided cache replacement policy for location-dependent data in mobile environment, Proceedings of the 1st international conference on Pervasive Technologies Related to Assistive Environments, Jul.2008.
[72]Ajey Kumar, PManoj Misra, PA. K. Sarje, A weighted cache replacement policy for location dependent data in mobile environments, Proceedings of the ACM symposium on Applied computing, Mar.2007.
[73]J. Xu, Q. Hu, W. Lee, D. Lee, Performance evaluation of an optimal cache replacement policy for wireless data dissemination under cache consistency,2001 International Conference on Parallel Processing, September 2001.
[74]YIN L, CAO G, CAI Y. A generalized target-driven cache replacement policy for mobile environments. The IEEE Symposium on Applications on the Internet[C]. January 2003,14-21
[75]Hui Y, ZhiGang C, QinHua L, "Research of Improved QoS of Data Transmission in Bluetooth Mobile P2P Networks[A] Proceedings of the 9th ICYCS 2008[C], Nov 2008,336-341
[76]UCBT[EB/OL]. http://www.cs.uc.edu/-cdmc/ucbt/
[77]NS-2[EB/OL].URL:http://www.isi.edu/nsnam/ns/
[78]Vahdat and D. Becker, Epidemic routing for partially connected ad hoe networks, Tech.Report CS-2000-06, Department of Computer Science, Duke University, Durham, NC,2000.
[79]Khaled Harras, Kevin Almeroth and Elizabeth Belding-Royer, Delay Tolerant Mobile Networks(DTMNs):Controlled Flooding Schemes in Sparse Mobile Networks, IFIP Networking, Waterloo, Canada, May 2005.
[80]Spyropoulos T, Psounis K, Raghavendra CS. Spray and wait:An efficient routing scheme for intermittently connected mobile networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005. 252-259.
[81]Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2003,7(3):19-27.
[82]Wang Y, Wu H. DFT-MSN:The Delay/Fault-Tolerant mobile sensor network for pervasive information gathering. In:Proc. of the 25th IEEE Int'1 Conf. on Computer Communications.2006.1-12.
[83]Spyropoulos T, Psounis K, Raghavendra C. Single-Copy routing in intermittently connected mobile networks. In:Proc. of the 20041st Annual IEEE Communications Society Conf. on Sensor and Ad Hoc Communications and Networks.2004.235-244.
[84]K. Tan, Q. Zhang, and W. Zhu, Shonest path routing in partially connected ad hoc networks, IEEE Globecom,2003.
[85]Jones EPC, Li L, Ward PAS. Practical routing in delay-tolerant networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.237-243.
[86]Chen C, Chen Z. Evaluating contacts for routing in highly partitioned mobile networks. In:Proc. of the 1st Int'1 MobiSys Workshop on Mobile Opportunistic Networking. San Juan:ACM,2007.17-24.
[87]Widmer J, Boudec J Y Le. Network coding for efficient communication in extreme networks [C] Proc of ACM SIGCOMM 05. New York:ACM,2005:284-291
[88]Wang Y, Jain S, Martonosi M, et al. Erasure-coding based routing for opportunistic networks [C] Proc of ACM SIGCOMM 05. New York:ACM,2005:229-236
[89]Sushant Jain, K.Fall and R.Patra, Routing in a Delay Tolerant Network,Sigcomm'04.Aug.30,2004
[90]Liao Yong, Tan Kun, Zhang Zhensheng, et al. Estimation based erasure-coding routing in delay tolerant networks [C] Proc of IWCMC 06. New York:ACM,2006: 557-56
[91]A1-Karaki J N, Kamal A E. Routing techniques in wireless sensor networks:A survey [J]. IEEE Wireless Communications,2004,11(6):6-28
[92]Wang Y, Jain S, Martonosi M, Fall K. Erasure-Coding based routing for opportunistic networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia:ACM,2005.229-236.
[93]Brown, J. David, Pasupathy. Adaptive demodulation using rateless erasure codes. IEEE Transactions on Communications,September,2006,1574-1585
[94]Rahnavard, Nazanin. Rateless codes with unequal error protection property IEEE Transactions on Information Theory,53(4), April,2007,1521-1532
[95]P. Maymounkov and D. Mazieres. Rateless Codes and Big Downloads. In IPTPS'03, Berkeley, CA, Feb.2003.
[96]M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution. In IEEE Symposium on Security and Privacy,2004.
[97]Widmer J, Boudec JL. Network coding for efficient communication in extreme networks. In:Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking.Philadelphia:ACM,2005.284-291.
[98]Ye Tian, D. Wu, and K.-W. Ng. Modeling, analysis and improvement for bittorrent-like file sharing networks[C]. In IEEE INFOCOM,2006
[99]M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution[C]. In IEEE Symposium on Security and Privacy,2004.
[100]Merhav, Neri. Minimax universal decoding with an erasure option[J]. IEEE Transactions on Information Theory,53(5), May,2007,1664-1675
[101]Marta C. Gonza'lez, Ce'sar A. Hidalgo, and Albert-La'szlo' Baraba'si. Understanding individual human mobility patterns. Nature.2008,453,779-782.
[102]Yunhao Liu, Xiaomei Liu, Li Xiao Ni. Location-aware topology matching in P2P systems. In Proc. IEEE INFOCOM,2004.
[103]Yilin Wang, Chan, E.; Wenzhong Li; "Location Dependent Cooperative Caching in MANET", In 37th International Conference on Parallel Processing Vol 9, Sept.2008. Page(s):470-477
[104]BOLDRINI C, CONTI M, PASSARELLA A. Exploiting users' social relations to forward data in opportunistic networks:the HiBOp solution[J]. Pervasive and Mobile Computing (PMC),2008,(4):633-657
[105]Watts D.J, Strogatz S H. Collective dynamics of 'small-world' networks[J]. Nature,1998,393,440-442
[106]Shah R, Roy S, Jain S, Brunette W. Data MULEs:Modeling a three-tier architecture for sparse sensor networks. In:Proc. of the 1st IEEE,2003 IEEE Int'l Workshop on Sensor Network Protocols and Applications.2003.30-41.
[107]B. Bums, O. Brock, and B. N. Levine, "MV Routing and capacity building in disruption tolerant networks", Proceedings of the IEEE INFOCOM 2005, Miami, FL, March,2005.
[108]Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In:Proc. of the 5th ACM Int'l Symp. on Mobile Ad Hoc Networking and Computing. Roppongi Hills:ACM,2004.187-198.
[109]Pan Hui, Jon Crowcroft, et al. "Bubble rap:social-based forwarding in delay tolerant networks." In the 9th ACM international symposium on Mobile ad hoc networking and computing,2008,241-250
[110]Daly EM, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In:Proc. of the 8th ACM Int'l symposium on Mobile Ad Hoc Networking and Computing. Montreal:ACM,2007.32-40.
[111]Quan Yuan, Ionut Cardei and Jie Wu. Predict and Relay:An Efficient Routing in Disruption-Tolerant Networks. In Proceedings of ACM MobiHoc,2009.
[112]J.Zhao and G.Cao, "VADD:Vehiele-Assisted DataD eliveryin Vehicular Ad Hoc Networks, in proceeding of IEEE INFOCOM'06, April 2006.
[113]葛志辉,陈志刚,邓晓衡等。移动自组网中新的智能丢包区分机制。通信学报,2007,28(3)：112-120
[114]邓晓衡,陈志刚,张连明等.TCP Yuelu:一种基于有线/无线混合网络端到端的拥塞控制机制。计算机学报,2005,28(8).35-44
[115]任丰原,林闯,魏丫丫等.主动队列管理中的智能分组丢弃新机制.电子学报,2002,30(12A)：1933-1937.
[116]Qinghua Li; Sencun Zhu; Guohong Cao. Routing in Socially Selfish Delay Tolerant Networks[C], IEEE Conference on Computer Communications, IEEE INFOCOM2010, Pages:9-17
[117]S. Martello and P. Toth, "Knapsack Problems:Algorithms and Computer Implementations." John Wiley & Sons,1990.
[118]T. Small and Z. J. Haas. The Shared Wireless Infostation Model-A New AdHoc Networking Paradigm (or Where There is a Whale, There is a Way). In ACM MOBIHOC'03, Annapolis, Maryland, USA, June 2003.
[119]Bluetooth Specification v2.1,2007. [EB/OL] www.bluetooth.com/Bluetooth/Technology/Works/Core_Specification_v21_EDR.h tm
[120]B. S. Peterson, R. O. Baldwin, and J. P. Kharoufeh. Bluetooth Inquiry Time Characterization and Selection[C].IEEE Transactions on Mobile Computing, 5(9):1173-1187, Sep.2006.
[121]S. Jung, U. Lee, A. Chang, et al. BlueTorrent:Cooperative Content Sharing for Bluetooth Users[C] IEEE PerCom'07, White Plains, NY, Mar.2007.
[122]P. S. L 'or' ant Farkas, Bal'azs Bakos. A Practical Approach to Multicasting in Bluetooth Piconets. [C] In WCNC'06, Las Vegas, USA, Apr.2006.
[123]J. LeBrun and C.-N. Chuah. Feasibility Study of Bluetooth-Based Content Distribution Stations on Public Transit Systems[C]. In ACM MobiShare, Los Angeles, CA, Sept.2006.
[124]L. M. Feeney and M. Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc network. In INFOCOM,2001
[125]J. Sorber, N. Banerjee, M. D. Corner, and S. Rollins.Turducken:Hierarchical power management for mobile devices. In Mobisys,2005.
[126]Jun H, Ammar M, Corner M, Zegura E (2006) Hierarchical power management in disruption tolerant networks with traffic-aware optimization. In:ACM Sigcomm Workshop on Challenged Networks (CHANTS), Pisa,15 September 2006
[127]Jun H, Ammar MH, Zegura EW (2005) Power management in delay tolerant networks:a framework and knowledge-based mechanisms. In:Proceedings of IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON), Santa Clara,26-29 September 2005
[128]P. Maymounkov. Online Codes. Technical Report TR2002-833, New York University, October 2002.