延迟容忍网络及其安全关键技术研究
|
摘要
延迟容忍网络诞生于人类的深空探索活动中，主要面向具有高延迟、频繁中断、高误码率等特性的应用环境，其在军事组网、灾后救援、物种追踪等领域日益凸显其巨大的应用潜力。然而，覆盖层体系结构的设计使得延迟容忍网络无法有效规避传统网络中的各类安全威胁。部署应用环境的制约以及节点在能源配给、存储空间、计算能力和通信能力上的限制也使得传统安全技术无法有效应用于此环境。随着延迟容忍网络在空间任务和地面应用的广泛深入，报文内容篡改、传输数据泄露和自私行为等问题已经成为制约延迟容忍网络发展的瓶颈。因此，研究延迟容忍网络及其安全关键技术，完善安全体系结构至关重要。
有鉴于此，本文紧密结合延迟容忍网络的各类应用需求和发展趋势，深入研究了延迟容忍网络及其安全领域的密钥分享、协议性能测试、信誉机制和安全路由等热点问题。
本文的主要工作和创新点包括：
1.研究了延迟容忍网络密钥分享算法。针对基于门限的Shamir秘密分享算法中存在的安全隐患，分析了完全混淆方案在通信步骤和计算能力上存在的问题，提出了一种部分混淆算法。通过引入反馈时间的动态随机性，设计了秘密分享过程中的动态混淆队列，减少了节点在秘密共享过程中的交互步骤，使得该算法能够更好的适应于受限环境；设计了动态纠错机制，避免了秘密分享过程的重复性计算和频繁网络交互，减少了带宽资源和节点资源的消耗，提高了秘密分享的执行效率。建立了时间消耗模型，验证了算法的有效性。
2.对随机路点(RWP)模型下延迟容忍网络的直接传输概率进行了深入的研究与探讨。通过对RWP模型下的直接传输行为建模，将节点之间的直接传输概率转化为一定的空间分布下，节点间距离小于无线设备覆盖范围的概率。在节点空间分布概率研究的基础上，从一维到二维，从单位区域到一般性区域，推导了节点间距离的累计分布函数和概率密度函数。为了简化计算结果，在Matlab平台上对计算结果进行数学拟合，得到了4阶拟合公式。通过Mathematica平台对推导的公式进行测试，验证了其正确性。
3.针对延迟容忍网络的自私问题，对延迟容忍网络的信誉方案开展了深入的研究。为实现延迟容忍网络环境下对节点行为的观测，引入转发凭据的概念，设计了观测协议，使得节点行为观测摆脱了对混杂监听模式和源路由模式的依赖；提出了基于Beta的信誉模型，实现对节点可信程度的评估，在仿真实验中对几种经典的信誉攻击方式进行了评估测试，证明该模型能够有效应对不可靠服务攻击、欺骗攻击、吹捧攻击和毁谤攻击，验证了其有效性；针对不同的应用需求，提出了一种基于矩阵计算的信誉模型，能够通过信誉矩阵的直接运算，优化信誉的评估过程；为提高评估节点行为的灵活性，提出一种可变行为评分的信誉模型，该模型能够在节点提供转发服务后，根据服务质量进行评分，替代了传统设计中只能记录服务次数的缺陷；提出了一种基于信誉的延迟容忍网络激励方案(PRI)，设计了PRI方案的应用框架。在ONE仿真平台上，验证了信誉模型以及PRI方案的有效性，探讨了路由副本数目的优化配置以及网络荷载对网络性能的影响。
4.以在延迟容忍网络中得到广泛认可的Spray and Wait(SW)协议为研究对象，提出了一种基于信誉的增强SW路由协议，在路由层解决延迟容忍网络环境下自私节点带来的网络性能下降甚至不可用的问题。在概率计算的基础上，采用一种可变的判别准则取代复杂的计算公式，减少对节点计算能力的负担；在ONE仿真平台上，与双重SW路由协议比较，验证了该路由协议能够减少自私行为对网络性能的危害，有效提升网络性能。
综上所述，本文以延迟容忍网络及其安全关键技术为对象，根据其面临的安全威胁和应用需求，对现有的协议和安全技术进行了改进和创新。本课题的研究成果不仅可以加快延迟容忍网络技术的实用化进程，对延迟容忍网络安全领域的研究也具有重要的理论价值。
Delay tolerant networks (DTNs) which are mainly applied to the environments thatsuffered from high latency, intermittent connectivity, and high error rate, are born in theexploration of deep space. DTNs exhibit great potential in military networking, disasterrelief, and species tracking. However, the architecture of overlay layers makes DTNshardly avoid the traditional security threats. The constraints of the deployed environmentandnodecapacityconstraintsinenergy,storage,computationalpowerandcommunicationpower make the classical security technologies not be applied in challenged environment.With the advancement of applications in space missions and terrestrial operation, securityissues, such as the modification of bundles, the selfish behavior, become the bottleneckrestricting the development of DTNs. In conclusion, the research on DTNs and the keytechnologies is curial issue to improve the security architecture.
Integrated with various types of application demands and development trends, wefocus on DTNs and security issues, such as secret sharing, evaluation of protocol perfor-mance, reputation schemes and security route. The contribution can be summarized asfollowing:
1. The secret sharing algorithm in DTNs. According to the vulnerability in Shamir'sthreshold-based secret sharing algorithm, we analyze the problems in the communicationsteps and computing power for complete shuffling algorithm, and propose a partial shuf-fling algorithm. According to the dynamic randomness through the introduction of feed-back time, a dynamic shuffling queue is designed, which reduces the steps of intercom-munication in the process of secret sharing, and make our proposal suitable for challengednetworks. A dynamic correction mechanism is presented to avoid repetitive calculationsand frequent interactions. The mechanism reduces consumption of bandwidth and re-sources, and improves the efficiency of secret sharing. The time consumption model isproposed to verify the validity of our algorithm.
2. The derivation of direct transmission probability for the RWP model. Accordingto the modeling of direct transmission behavior in the RWP model, the direct transmis-sion probability between nodes turns into the probability that the distance between nodesis less than the coverage of wireless devices under a deterministic spatial distribution. On the basis of the research on spatial distribution, the cumulative distribution functionand the probability density function of the distance between nodes are derived from one-dimensional to two-dimensional and from the unit area to the general region. In order tosimplify the calculation, a polynomial fitting is performed on the Matlab platform, and afittingformulaoforder4isobtainedtoapproximatetheoriginalequation. Thecorrectnessof the fitting formula is verified on the Mathematica platform.
3. The reputation models and incentive scheme for DTNs. In order to monitoringneighboring nodes' behavior in challenged environments, the concept of forwarding cre-dential is introduced, and an observation protocol is presented, which make the behaviorobservation get rid of the dependence on promiscuous listening mode and source rout-ing mode. The beta reputation model is presented to assess the trustworthiness of nodes,and several classic attack, e.g. unreliable service attack, spoofing attack, ballot attack andbad-mouthing attack, are tested to prove the effectiveness of the beta model. For differ-ent application requirements, a reputation model based on matrix calculation is presented.Through the direct matrix computation, the assessment process is optimized. In order toimprove the flexibility of the rating on nodes' behavior, a novel model of variable rat-ings on the quality of service is proposed. Nodes give rating on others according to thequality of forwarding, which takes place of the recording of the frequency of service. Apractical reputation-based incentive scheme, named PRI, is presented, and an applicationframework of PRI scheme is given. On the ONE simulation platform, the reputation mod-els and the PRI scheme is verified, and the optimized configuration of forwarding copynumber and the effect of network load on performance are discussed.
4. An enhanced binary spray and wait scheme. Oriented to the spray and wait pro-tocol which is widely recognized in DTNs, we propose an enhanced binary SW routingprotocol. Ourproposaladdressestheselfishnessthatresultsinthedeteriorationofnetworkperformance or even unavailable. On the basis of probability calculation, a variable deci-sion criterion takes place of complex computation formula to reduce the burden on nodes’computation power. Compared to binary SW routing protocol, our protocol is verified toalleviate the hazard of selfishness, and effectively improve the network performance.
Insummary,accordingtothesecuritythreatsandrequirements,withtheaimofDTNsandsecuritykeytechnologies,andtakingtheuniquecharacteristicsofchallengedenviron-ments into consideration, this thesis focuses on improvement and innovation of security protocols and mechanisms. Along with the deepening of application in environmentalmonitoring, military strategy, deep space exploration, counter-terrorism security, earth-quake monitoring, underwater exploration, disaster relief, the research of this subject notonly promote the process of practicality, but also have important theoretical value in thedevelopments of security in DTNs.
有鉴于此，本文紧密结合延迟容忍网络的各类应用需求和发展趋势，深入研究了延迟容忍网络及其安全领域的密钥分享、协议性能测试、信誉机制和安全路由等热点问题。
本文的主要工作和创新点包括：
1.研究了延迟容忍网络密钥分享算法。针对基于门限的Shamir秘密分享算法中存在的安全隐患，分析了完全混淆方案在通信步骤和计算能力上存在的问题，提出了一种部分混淆算法。通过引入反馈时间的动态随机性，设计了秘密分享过程中的动态混淆队列，减少了节点在秘密共享过程中的交互步骤，使得该算法能够更好的适应于受限环境；设计了动态纠错机制，避免了秘密分享过程的重复性计算和频繁网络交互，减少了带宽资源和节点资源的消耗，提高了秘密分享的执行效率。建立了时间消耗模型，验证了算法的有效性。
2.对随机路点(RWP)模型下延迟容忍网络的直接传输概率进行了深入的研究与探讨。通过对RWP模型下的直接传输行为建模，将节点之间的直接传输概率转化为一定的空间分布下，节点间距离小于无线设备覆盖范围的概率。在节点空间分布概率研究的基础上，从一维到二维，从单位区域到一般性区域，推导了节点间距离的累计分布函数和概率密度函数。为了简化计算结果，在Matlab平台上对计算结果进行数学拟合，得到了4阶拟合公式。通过Mathematica平台对推导的公式进行测试，验证了其正确性。
3.针对延迟容忍网络的自私问题，对延迟容忍网络的信誉方案开展了深入的研究。为实现延迟容忍网络环境下对节点行为的观测，引入转发凭据的概念，设计了观测协议，使得节点行为观测摆脱了对混杂监听模式和源路由模式的依赖；提出了基于Beta的信誉模型，实现对节点可信程度的评估，在仿真实验中对几种经典的信誉攻击方式进行了评估测试，证明该模型能够有效应对不可靠服务攻击、欺骗攻击、吹捧攻击和毁谤攻击，验证了其有效性；针对不同的应用需求，提出了一种基于矩阵计算的信誉模型，能够通过信誉矩阵的直接运算，优化信誉的评估过程；为提高评估节点行为的灵活性，提出一种可变行为评分的信誉模型，该模型能够在节点提供转发服务后，根据服务质量进行评分，替代了传统设计中只能记录服务次数的缺陷；提出了一种基于信誉的延迟容忍网络激励方案(PRI)，设计了PRI方案的应用框架。在ONE仿真平台上，验证了信誉模型以及PRI方案的有效性，探讨了路由副本数目的优化配置以及网络荷载对网络性能的影响。
4.以在延迟容忍网络中得到广泛认可的Spray and Wait(SW)协议为研究对象，提出了一种基于信誉的增强SW路由协议，在路由层解决延迟容忍网络环境下自私节点带来的网络性能下降甚至不可用的问题。在概率计算的基础上，采用一种可变的判别准则取代复杂的计算公式，减少对节点计算能力的负担；在ONE仿真平台上，与双重SW路由协议比较，验证了该路由协议能够减少自私行为对网络性能的危害，有效提升网络性能。
综上所述，本文以延迟容忍网络及其安全关键技术为对象，根据其面临的安全威胁和应用需求，对现有的协议和安全技术进行了改进和创新。本课题的研究成果不仅可以加快延迟容忍网络技术的实用化进程，对延迟容忍网络安全领域的研究也具有重要的理论价值。
Delay tolerant networks (DTNs) which are mainly applied to the environments thatsuffered from high latency, intermittent connectivity, and high error rate, are born in theexploration of deep space. DTNs exhibit great potential in military networking, disasterrelief, and species tracking. However, the architecture of overlay layers makes DTNshardly avoid the traditional security threats. The constraints of the deployed environmentandnodecapacityconstraintsinenergy,storage,computationalpowerandcommunicationpower make the classical security technologies not be applied in challenged environment.With the advancement of applications in space missions and terrestrial operation, securityissues, such as the modification of bundles, the selfish behavior, become the bottleneckrestricting the development of DTNs. In conclusion, the research on DTNs and the keytechnologies is curial issue to improve the security architecture.
Integrated with various types of application demands and development trends, wefocus on DTNs and security issues, such as secret sharing, evaluation of protocol perfor-mance, reputation schemes and security route. The contribution can be summarized asfollowing:
1. The secret sharing algorithm in DTNs. According to the vulnerability in Shamir'sthreshold-based secret sharing algorithm, we analyze the problems in the communicationsteps and computing power for complete shuffling algorithm, and propose a partial shuf-fling algorithm. According to the dynamic randomness through the introduction of feed-back time, a dynamic shuffling queue is designed, which reduces the steps of intercom-munication in the process of secret sharing, and make our proposal suitable for challengednetworks. A dynamic correction mechanism is presented to avoid repetitive calculationsand frequent interactions. The mechanism reduces consumption of bandwidth and re-sources, and improves the efficiency of secret sharing. The time consumption model isproposed to verify the validity of our algorithm.
2. The derivation of direct transmission probability for the RWP model. Accordingto the modeling of direct transmission behavior in the RWP model, the direct transmis-sion probability between nodes turns into the probability that the distance between nodesis less than the coverage of wireless devices under a deterministic spatial distribution. On the basis of the research on spatial distribution, the cumulative distribution functionand the probability density function of the distance between nodes are derived from one-dimensional to two-dimensional and from the unit area to the general region. In order tosimplify the calculation, a polynomial fitting is performed on the Matlab platform, and afittingformulaoforder4isobtainedtoapproximatetheoriginalequation. Thecorrectnessof the fitting formula is verified on the Mathematica platform.
3. The reputation models and incentive scheme for DTNs. In order to monitoringneighboring nodes' behavior in challenged environments, the concept of forwarding cre-dential is introduced, and an observation protocol is presented, which make the behaviorobservation get rid of the dependence on promiscuous listening mode and source rout-ing mode. The beta reputation model is presented to assess the trustworthiness of nodes,and several classic attack, e.g. unreliable service attack, spoofing attack, ballot attack andbad-mouthing attack, are tested to prove the effectiveness of the beta model. For differ-ent application requirements, a reputation model based on matrix calculation is presented.Through the direct matrix computation, the assessment process is optimized. In order toimprove the flexibility of the rating on nodes' behavior, a novel model of variable rat-ings on the quality of service is proposed. Nodes give rating on others according to thequality of forwarding, which takes place of the recording of the frequency of service. Apractical reputation-based incentive scheme, named PRI, is presented, and an applicationframework of PRI scheme is given. On the ONE simulation platform, the reputation mod-els and the PRI scheme is verified, and the optimized configuration of forwarding copynumber and the effect of network load on performance are discussed.
4. An enhanced binary spray and wait scheme. Oriented to the spray and wait pro-tocol which is widely recognized in DTNs, we propose an enhanced binary SW routingprotocol. Ourproposaladdressestheselfishnessthatresultsinthedeteriorationofnetworkperformance or even unavailable. On the basis of probability calculation, a variable deci-sion criterion takes place of complex computation formula to reduce the burden on nodes’computation power. Compared to binary SW routing protocol, our protocol is verified toalleviate the hazard of selfishness, and effectively improve the network performance.
Insummary,accordingtothesecuritythreatsandrequirements,withtheaimofDTNsandsecuritykeytechnologies,andtakingtheuniquecharacteristicsofchallengedenviron-ments into consideration, this thesis focuses on improvement and innovation of security protocols and mechanisms. Along with the deepening of application in environmentalmonitoring, military strategy, deep space exploration, counter-terrorism security, earth-quake monitoring, underwater exploration, disaster relief, the research of this subject notonly promote the process of practicality, but also have important theoretical value in thedevelopments of security in DTNs.
引文
[1] Cerf V, R. K. A protocol for packet network intercommunication[J]. IEEE Trans-actions on Communication,1974,22(5):637--648.
[2] Farrell S, Cahill V, Geraghty D, et al. When TCP breaks-Delay-and disruption-tolerant networking[J]. Ieee Internet Computing,2006,10(4):72--78.
[3] McMahon A, Farrell S. Delay-and Disruption-Tolerant Networking[J]. Ieee Inter-net Computing,2009,13(6):82--87.
[4] Burleigh S, Hooke A, Torgerson L, et al. Delay-tolerant networking: An approachto interplanetary Internet[J]. Ieee Communications Magazine,2003,41(6):128--136.
[5] Postel J. Transmission Control Protocol[J]. IETF RFC793,1981.
[6] Cerf V, Burleigh S, Hooke A, et al. Delay-Tolerant Networking Architecture[J].IETF RFC4838,2007.
[7] FallK. Adelay-tolerantnetworkarchitectureforchallengedInternets[J]. ComputerCommunication Review,2003,33(4):27--34.
[8] Wood L, McKim J, Eddy W. Using Saratoga with a bundle agent as a convergencelayer for delay tolerant networking[J].2008. http://www.watersprings.org/pub/id/draft-wood-dtnrg-saratoga-03.txt.
[9] Wood L, Eddy W M, Ivancic W, et al. Saratoga: a Delay-Tolerant Networkingconvergence layer with efficient link utilization[M].2007International Workshopon Satellite and Space Communications, Iwssc '07, Conference Proceedings. NewYork: Ieee,2007.
[10] Farrell S, Ramadas M, Burleigh S. Licklider Transmission Protocol-Security Ex-tensions[J]. IETF RFC5327,2008.
[11] Symington S, Farrell S, Weiss H, et al. Bundle Security Protocol Specification[J].IETF RFC6257,2011.
[12] Warthman F. Delay Tolerant Network (DTNs): A Tutorial[J].2003.
[13]樊秀梅,单志广,张宝贤, et al.容迟网络体系结构及其关键技术研究[J].电子学报,2008,36(1).
[14]李向群,刘立祥,胡晓惠, et al.延迟/中断可容忍网络研究进展[J].计算机研究与发展,2009(08).
[15] Durst R, Miller G, Travis E. TCP extensions for space communication[C]. Con-ference Proceedings of the1996ACM Mobile Communication.1996:15--26.
[16] Scott K, Burleigh S. Bundle Protocol Specification[J]. IETF RFC5050,2007.
[17] BurleighS,RamadasM,FarrellS. LickliderTransmissionProtocol-Motivation[J].IETF RFC5325,2008.
[18] Ramadas M, Burleigh S, Farrell S. Licklider Transmission Protocol-Specifica-tion[J]. IETF RFC5326,2008.
[19] Eddy E, W. M.and Davies. Using Self-Delimiting Numeric Values in Protocols[J].IETF RFC6256,2011.
[20] Wood L, Eddy W M, Ivancic W, et al. Saratoga: a Delay-Tolerant Networkingconvergence layer with efficient link utilization[M].2007International Workshopon Satellite and Space Communications, Iwssc '07, Conference Proceedings. NewYork: Ieee,2007.
[21] Ott J, Kaerkkaeinen T, Pitkaenen M. Application Conventions for Bundle-based Communications[J].2007. http://www.watersprings.org/pub/id/draft-ott-dtnrg-dm-appl-00.txt.
[22] Symington S, Durst R, Scott K. Delay-tolerant netwroking custodialnulticast extensions[J].2007. http://www.watersprings.org/pub/id/draft-symington-dtnrg-bundle-multicast-custodial-03.txt.
[23] Wyllie J, Eddy W, Ishac J. Automated bundle agent discovery for delay/dis-ruption—tolerant networking[M].2007. http://www.watersprings.org/pub/id/draft-wyllie-dtnrg-badisc-01.txt.
[24] Jain S, Fall K, Patra R. Routing in a delay tolerant network[J]. Computer Commu-nication Review,2004,34(4):145--157.
[25] Spyropoulos T, Psounis K, Raghavendra C S. Spray and Wait: An Effcient Rout-ing Scheme for Intermittently Connected Mobile Networks[C]. ACM SIGCOMMWorkshop on Delay-Tolerant Networking(WDTN).2005.
[26] Chuah M, Yang P, Ieee. Node density-based adaptive routing scheme for disruptiontolerant networks[M]. MILCOM2006, Vols1-7. New York: Ieee,2006.
[27] Zhang Z S. Routing in intermittently connected mobile ad hoc network and delaytolerant network: overview and challenges[J]. Ieee Communications Surveys andTutorials,2006,8(1):24--37.
[28] Burgess J, Gallagher B, Jensen D, et al. MaxProp: Routing for vehicle-baseddisruption-tolerant networks[M]. Ieee Infocom. New York: Ieee,2006:1688--1698.
[29] Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resourceallocation problem[J]. Computer Communication Review,2007,37(4):373--384.
[30] Liu C, Wu J, Acm. Scalable Routing in Delay Tolerant Networks[M]. Mobihoc'07:Proceedings of the Eighth Acm International Symposium on Mobile Ad Hoc Net-working and Computing. New York: Assoc Computing Machinery,2007.
[31] Chen Y, Zhao W R, Ammar M, et al. Hybrid Routing in Clustered DTNs withMessageFerrying[M]. Mobiopp'07-ProceedingsoftheFirstInternationalMobisysWorkshop on Mobile Opportunistic Networking. New York: Assoc ComputingMachinery,2007.
[32] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[33] Yin L, Lu H M, Cao Y D, et al. Probabilistic Delay Routing for delay tolerantnetworks[M].10th International Conference on Advanced Communication Tech-nology, Vols I-Iii: Innovations toward Future Networks and Services. Piscataway:Ieee,2008.
[34] Abdulla M, Simon R, Ieee. Controlled Epidemic Routing for Multicasting in DelayTolerant Networks[M]. International Symposium on Modeling Analysis and Simu-lationofComputerandTelecommunicationSystemsProceedings. NewYork: Ieee,2008:1--10.
[35] Cardei I, Liu C, Wu J, et al. DTN Routing with Probabilistic Trajectory Predic-tion[M]. Li Y, Huynh D T, Da S K. Wireless Algorithms, Systems, and Ap-plications, Proceedings.2008. Berlin: Springer-Verlag Berlin, Lecture Notes inComputer Science, vol.5258.
[36] Mundur P, Seligman M, Ieee. Delay tolerant network routing: Beyond epidemicrouting[M].20083rd International Symposium on Wireless Pervasive Computing,Vols1-2. New York: Ieee,2008.
[37] Chuah M C, Yang P. Context-aware multicast routing scheme for Disruption Tol-erant Networks[J]. International Journal of Ad Hoc and Ubiquitous Computing,2009,4(5):269--281.
[38] Spyropoulos T, Bin Rais R N, Turletti T, et al. Routing for disruption tolerantnetworks: taxonomy and design[J]. Wireless Networks,2010,16(8):2349--2370.
[39] Yuan Q, Cardei I, Wu J. An Efficient Prediction-Based Routing in Disruption-TolerantNetworks[J]. IeeeTransactionsonParallelandDistributedSystems,2012,23(1):19--31.
[40] The One Simulator. http://www.netlab.tkk.f/tutkimus/dtn/theone/.
[41] Grossglauser M, Tse D. Mobility increases the capacity of ad hoc wireless net-works[J]. IEEE/ACM Trans. on Networking,2002,10(4):477--486.
[42] VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc net-works[J]. Technical Report CS-200006,2000.
[43] Li J, Burge L, Kaplan K, et al. A Probabilistic routing algorithm for DTNs ofrandomly moving nodes[M]. ICWN '05: Proceedings of the2005InternationalConference on Wireless Networks. Athens: C S R E a Press,2005.
[44] Ip Y K, Lau W C, Yue O C, et al. Forwarding and replication strategies for DTNwith resource constraints[M]. IEEE VTS Vehicular Technology Conference Pro-ceedings. New York: Ieee,2007:1260--1264.
[45] Fazl e H, Shah N, Syed A H, et al. Adaptive anycast: A new anycast protocol forperformance improvement in delay tolerant networks[M].2007IEEE InternationalConference on Integration Technology, Proceedings. New York: Ieee,2007.
[46] Leontiadis I, Mascolo C, Acm. Opportunistic Spatio-Temporal Dissemination Sys-tem for Vehicular Networks[M]. Mobiopp'07-Proceedings of the First Interna-tional Mobisys Workshop on Mobile Opportunistic Networking. New York: AssocComputing Machinery,2007.
[47] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[48] Abdulla M, Simon R, Ieee. Controlled Epidemic Routing for Multicasting in DelayTolerant Networks[M]. International Symposium on Modeling Analysis and Simu-lationofComputerandTelecommunicationSystemsProceedings. NewYork: Ieee,2008:1--10.
[49] Tower J P, Little T D C, Ieee. A Proposed Scheme for Epidemic Routing withActiveCuringforOpportunisticNetworks[M].200822ndInternationalWorkshopsonAdvancedInformationNetworkingandApplications, Vols1-3. NewYork: Ieee,2008.
[50] Olajide T, Washington A N. Epidemic modeling of military networks using groupand entity mobility models[M]. Proceedings of the Fifth International Conferenceon Information Technology: New Generations. Los Alamitos: Ieee Computer Soc,2008.
[51] Mundur P, Seligman M, Ieee. Delay tolerant network routing: Beyond epidemicrouting[M].20083rd International Symposium on Wireless Pervasive Computing,Vols1-2. New York: Ieee,2008.
[52] Tang L, Zheng Q W, Liu J, et al. Selective Message Forwarding in Delay TolerantNetworks[J]. Mobile Networks&Applications,2009,14(4):387--400.
[53] LiuC,WuJ,Acm. AnOptimalProbabilisticForwardingProtocolinDelayTolerantNetworks[M]. Mobihoc'09ProceedingsoftheTenthAcmInternationalSymposiumon Mobile Ad Hoc Networking and Computing. New York: Assoc ComputingMachinery,2009.
[54] Wang X, Shu Y T, Jin Z G, et al. Adaptive Randomized Epidemic Routing forDisruption Tolerant Networks[M].2009Fifth International Conference on MobileAd-Hoc and Sensor Networks. New York: Ieee,2009.
[55]韩秀蓉,康凤举,钟联炯, et al.延迟容忍网络中基于Epidemic算法的组播路由研究[J].系统仿真学报,2009(21).
[56] Acer U G, Kalyanaraman S, Abouzeid A A. DTN routing using explicit and prob-abilistic routing table states[J]. Wireless Networks,2011,17(5):1305--1321.
[57]薛静锋,范志安,李建胜, et al.基于历史信息预测转发概率的DTN路由算法[J].北京理工大学学报,2011(01).
[58] Shahbazi S, Karunasekera S, Harwood A. Improving performance in delay/disrup-tion tolerant networks through passive relay points[J]. Wireless Networks,2012,18(1):9--31.
[59]裴泽艮,肖明军,黄刘生.位置关联的延迟容忍网络路由算法[J].计算机工程.
[60] Conan V, Leguay J, Friedman T. Fixed point opportunistic routing in delay tolerantnetworks[J]. IEEEJournalonSelectedAreasinCommunications,2008,26(5):773--782.
[61] Groenevelt R, Nain P, Koole G. The message delay in mobile ad hoc networks[J].Performance Evaluation,2005,62(1-4):210--228.
[62] Ramanathan R, Hansen R, Basu P, et al. Prioritized epidemic routing for oppor-tunistic networks[C]. In Proc.of the1st Int Workshop on Mobile OpportunisticNetworking. San Juan: ACM Press,2007:62--66.
[63] Nain D, Petigara N, Balakrishnan H. Integrated routing and storage for messagingapplications in mobile ad hoc networks[J]. Mobile Networks and Applications,2004,9(6):595--604.
[64] Zhang X, Neglia G, Kurose J, et al. Performance modeling of epidemic routing[J].Computer Networks,2007,51(10):2867--2891.
[65] Burgess J, Gallagher B, Jensen D, et al. MaxProp: Routing for vehicle-baseddisruption-tolerant networks[M]. Ieee Infocom Series. New York: Ieee,2006:1688--1698.
[66] Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittentlyconnected mobile networks: The multiple-copy case[J]. Ieee-Acm Transactions onNetworking,2008,16(1):77--90.
[67] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[68]周晓波,卢汉成,李津生, et al. AED:一种用于DTN的增强型Earliest-Delivery算法[J].电子与信息学报,2007(08).
[69] LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittentlyconnected networks[J]. The First International Workshop on Service Assurancewith Partial and Intermittent Resources (SAPIR),2004.
[70] Chuah M C, Yang P. Context-aware multicast routing scheme for Disruption Tol-erant Networks[J]. International Journal of Ad Hoc and Ubiquitous Computing,2009,4(5):269--281.
[71] Musolesi M, Mascolo C. CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks[J]. Ieee Transactions on Mobile Computing,2009,8(2):246--260.
[72] Haas Z J, Small T. A new networking model for biological applications of ad hocsensor networks[J]. Ieee-Acm Transactions on Networking,2006,14(1):27--40.
[73] Peoples C, Parr G, Scotney B, et al. A reconfigurable context-aware protocol stackfor interplanetary communication[M].2007International Workshop on Satelliteand Space Communications, Iwssc '07, Conference Proceedings. New York: Ieee,2007.
[74] Mascolo C, Musolesi M, Pásztor B. Opportunistic mobile sensor data collectionwith SCAR[C]. In Proc. of the4th Int Conf. on Embedded Networked SensorSystems. Boulder: ACM,2006:343--344.
[75] Spyropoulos T, Psounis K, Raghavendra C S. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility[M]. Fifth Annual IEEEInternational Conference on Pervasive Computing and Communications Work-shops, Proceedings. Los Alamitos: Ieee Computer Soc,2007.
[76] WangY,JainS,MartonosiM,etal. Erasure-Codingbasedroutingforopportunisticnetworks[C]. Proc. of the2005ACM SIGCOMM Workshop on Delay-TolerantNetworking. Philadelphia: ACM,2005:229--236.
[77] Wu J, Yang S H. Small world model-based polylogarithmic routing using mobilenodes[J]. Journal of Computer Science and Technology,2008,23(3):327--342.
[78] Wittie M P, Harras K A, Almeroth K C, et al. On the implications of routingmetric staleness in delay tolerant networks[J]. Computer Communications,2009,32(16):1699--1709.
[79]郭航,王兴伟,黄敏, et al.容延容断网络研究及进展[J].计算机科学,2010(11).
[80]张龙,周贤伟,王建萍, et al.容迟与容断网络中的路由协议[J].软件学报,2010(10).
[81]苏金树,胡乔林,赵宝康, et al.容延容断网络路由技术[J].软件学报,2010(01).
[82] Bettstetter C. Mobility Modeling in Wireless Networks: Categorization, SmoothMovement,and Border Effects[J]. ACM Mobile Computing and CommunicationsReview,2001,5(3):55--67.
[83] Leguay J, Friedman T, Conan V, et al. Evaluating mobility pattern space routingfor DTNs[M]25th Ieee International Conference on Computer Communications,Vols1-7, Proceedings Ieee Infocom2006.2006. New York: Ieee, Ieee Infocom.
[84] Abdulla M, Simon R, Ieee. The impact of the mobility model on delay tolerantnetworking performance analysis[M]. Proceedings of the Annual Simulation Sym-posia. Los Alamitos: Ieee Computer Soc,2007:177--184.
[85] Hsu W J, Spyropoulos T, Psounis K, et al. Modeling Spatial and Temporal Depen-dencies of User Mobility in Wireless Mobile Networks[J]. Ieee-Acm Transactionson Networking,2009,17(5):1564--1577.
[86] Washington A N, Iziduh R, Society I C. Modeling of Military Networks usingGroup Mobility Models[M]. Proceedings of the2009Sixth International Confer-ence on Information Technology: New Generations, Vols1-3. New York: Ieee,2009.
[87] Park M, Min S, So S, et al. Mobility Pattern Based Routing Algorithm for De-lay/Disruption Tolerant Networks[M]. Balandin S, Dunaytsev R, Koucheryavy Y.Smart Spaces and Next Generation Wired/Wireless Networking.2010. Berlin:Springer-Verlag Berlin, Lecture Notes in Computer Science, vol.6294.
[88] Rhee I, Shin M, Hong S, et al. On the Levy-Walk Nature of Human Mobility[J].Ieee-Acm Transactions on Networking,2011,19(3):630--643.
[89] Bettstetter C, Wagner C. The spatial node distribution of the random waypointmobility model[C]. German Workshop on Mobile Ad Hoc Networks (WMAN).Ulm, Germany,2002.
[90] Eagle N, Pentland A. Reality mining: sensing complex social systems[J]. PersonalUbiquitous Computing,2006,10(4):255--268.
[91] UCSD. Wireless topology discovery project.2004.http://sysnet.ucsd.edu/wtd/wtd.html.
[92] Diot C e a. Haggle project.2004. http://www.haggleproject.org.
[93] Zhang X L, Kurose J, Levine B N, et al. Study of a Bus-based Disruption-TolerantNetwork: Mobility Modeling and Impact on Routing[M]. Mobicom'07: Proceed-ings of the Thirteenth Acm International Conference on Mobile Computing andNetworking. New York: Assoc Computing Machinery,2007.
[94] Pan H, Chaintreau A, Scott J, et al. Pocket switched networks and human mobilityin conference environments[M]. Philadelphia: ACM Press,2005:244--251.
[95] Cai H, Eun D. Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET[C]. Proc. of the13th Annual ACM Int Conf.onMobile Computing and Networking. Montréal: ACM Press,2007:159--170.
[96] Farrell S, Cahill V, Society I C. Security considerations in space and delay tol-erant networks[M]. SMC-IT2006:2nd IEEE International Conference on SpaceMission Challenges for Information Technology, Proceedings. Los Alamitos: IeeeComputer Soc,2006.
[97] Asokan N, Kostiainen K, Ginzboorg P, et al. Applicability of Identity-Based Cryp-tographyforDisruption-TolerantNetworking[M]. Mobiopp'07-ProceedingsoftheFirst International Mobisys Workshop on Mobile Opportunistic Networking. NewYork: Assoc Computing Machinery,2007.
[98] N. Asokan P G J O C L, Kari Kostiainen. Toward Securing Disruption-TolerantNetworking[J].2007.
[99] Burgess J, Bissias G D, Corner M, et al. Surviving Attacks on Disruption-TolerantNetworkswithoutAuthentication[M]. Mobihoc'07: ProceedingsoftheEighthAcmInternational Symposium on Mobile Ad Hoc Networking and Computing. NewYork: Assoc Computing Machinery,2007.
[100] Kate A, Zaverucha G M, Hengartner U. Anonymity and security in delay toler-ant networks[M].2007Third International Conference on Security and Privacy inCommunication Networks and Workshops. New York: Ieee,2007.
[101] PatraR,SuranaS,NedevschiS. HierarchicalIdentityBasedCryptographyforEnd-to-EndSecurityinDTNs[M].2008Ieee4thInternationalConferenceon IntelligentComputer Communication and Processing, Proceedings.2008. New York: Ieee,International Conference on Intelligent Computer Communication and Processing.
[102] Shi M, AlMotairi K, Shen X, et al. Credit-Based User Authentication for DelayTolerant Mobile Wireless Networks[M]. Beijing, China,2008.
[103] Zhu H, Lin X, Lu R, et al. BBA: An Effcient Batch Bundle Authentication Schemefor Delay Tolerant Networks[C]. GLOBECOM2008.2008.
[104] Farrell S, Symington S, Weiss H, et al. Delay-Tolerant Networking SecurityOverview[J]. draft-irtf-dtnrg-sec-overview-06,2009.
[105] Li Y, Su G L, Wang Z C. Evaluating the effects of node cooperation on DTNrouting[J]. Aeu-International Journal of Electronics and Communications,2012,66(1):62--67.
[106] Bulut E, Szymanski B K, Ieee. On Secure Multi-copy based Routing in Compro-mised Delay Tolerant Networks[M]. IEEE International Conference on ComputerCommunications and Networks. New York: Ieee,2011.
[107] Abdelkader T, Naik K, Nayak A, et al. A Socially-based Routing Protocol ForDelay Tolerant Networks[C].2010Ieee Global Telecommunications ConferenceGlobecom2010.2010. New York: Ieee, IEEE Global Telecommunications Con-ference (Globecom).
[108] Tournoux P U, Lochin E, Leguay J, et al. Robust Streaming in Delay TolerantNetworks[C].2010Ieee International Conference on Communications.2010. NewYork: Ieee, IEEE International Conference on Communications.
[109] Fall K, Farrell S. DTN: An architectural retrospective[J]. Ieee Journal on SelectedAreas in Communications,2008,26(5):828--836.
[110] MichiardiP,MolvaR. Core: Acollaborativereputationmechanismtoenforcenodecooperationinmobileadhocnetworks[M]. JermanBlazicB,KlobucarT. AdvancedCommunications and Multimedia Security.2002. Norwell: Kluwer AcademicPublishers, International Federation for Information Processing, vol.100.
[111] Buchegger S, Le Boudec J Y. A Bayesian approach to robust reputation systemsfor mobile ad hoc networks[J]. Ieee Pervasive Computing,2003,2(3):95--96.
[112] Wrona K, Mahonen P. Analytical model of cooperation in ad hoc networks[J].Telecommunication Systems,2004,27(2-4):347--369.
[113] KonorskiJ. FairpacketforwardinginMANETswithanonymousstations: Agame-theoreticapproach[M]. Networking2004-NetworkingTechnologies,Services,andProtocols; Performance of Computer and Communication Networks; Mobile andWireless Communications.2004. Berlin: Springer-Verlag Berlin, Lecture Notes inComputer Science, vol.3042.
[114] Buchegger S, Le Boudec J Y. Self-policing mobile ad hoc networks by reputationsystems[J]. Ieee Communications Magazine,2005,43(7):101--107.
[115] BalasubramanianAR,GhoshJ,WangX. Areputationbasedschemeforstimulatingcooperation in MANETs[M]. Teletraffic Science and Engineering, vol.6A-6C.Beijing: Beijing Univ Posts Telecommunicat Press,2005:543--552.
[116] Adams W J, Hadjichristofi G C, Davis N J. Calculating a node's reputation in a mo-bile ad hoc network[M]. Conference Proceedings of the2005IEEE InternationalPerformance, Computing and Communications Conference.2005. Los Alamitos:Ieee Computer Soc, IEEE International Performance, Computing and Communica-tions Conference (IPCCC).
[117] Yoo Y, Agrawal D P. Why does it pay,to be selfish in a MANET?[J]. Ieee WirelessCommunications,2006,13(6):87--97.
[118] Anker T, Dolev D, Hod B, et al. Cooperative and reliable packet-forwarding on topof AODV[M].20064th International Symposium on Modeling and Optimizationin Mobile, Ad Hoc and Wireless Networks, Vols1and2. New York: Ieee,2006.
[119] Marias G F, Georgiadis P, Flitzanis D, et al. Cooperation enforcement schemesfor MANETs: a survey[J]. Wireless Communications&Mobile Computing,2006,6(3):319--332.
[120] BoukerchA,XuL,El-KhatibK. Trust-basedsecurityforwirelessadhocandsensornetworks[J]. Computer Communications,2007,30(11-12):2413--2427.
[121] AnantvaleeT,WuJ,Ieee. Reputation-basedsystemforencouragingthecooperationof nodes in mobile ad hoc networks[C].2007Ieee International Conference onCommunications, Vols1-14.2007. New York: Ieee, Ieee International Conferenceon Communications.
[122] Wang K, Wu M. Incentive Schemes of Nodes for Ad Hoc and Multi-hop CellularNetworks[J]. China Communications,2007,4(4):79--88.
[123] Zhou R F, Hwang K. PowerTrust: A robust and scalable reputation system fortrusted Peer-to-Peer computing[J]. Ieee Transactions on Parallel and DistributedSystems,2007,18(4):460--473.
[124] Ganeriwal S, Balzano L K, Srivastava M B. Reputation-based framework for highintegrity sensor networks[J]. Acm Transactions on Sensor Networks,2008,4(3).
[125] Hoffman K, Zage D, Nita-Rotaru C. A Survey of Attack and Defense Techniquesfor Reputation Systems[J]. Acm Computing Surveys,2009,42(1).
[126] Tsai H C, Lo N W, Wu T C. A Threshold-Adaptive Reputation System on Mo-bile Ad Hoc Networks[J]. Ieice Transactions on Information and Systems,2009,E92D(5):777--786.
[127]单明辉,贡佳炜,牛尔力, et al. RulerRep:一种基于偏离度的过滤不实评价新方法[J].计算机学报,2010(07).
[128] Azer M A, El-Kassas S M, Hassan A W F, et al. A survey on trust and reputationschemes in ad hoc networks[M]. Ares2008: Proceedings of the Third InternationalConference on Availability, Security and Reliability. Los Alamitos: Ieee ComputerSoc,2008.
[129] Karaliopoulos M. Assessing the Vulnerability of DTN Data Relaying Schemes toNode Selfishness[J]. Ieee Communications Letters,2009,13(12):923--925.
[130] Shevade U, Song H H, Qiu L L, et al. Incentive-Aware Routing in DTNs[M].16thIeee International Conference on Network Protocols: Icnp'08.2008. Los Alamitos:IeeeComputerSoc, IEEEInternationalConferenceonNetworkProtocolsProceed-ings.
[131] Li Q H, Zhu S C, Cao G H, et al. Routing in Socially Selfish Delay Tolerant Net-works[M]2010Proceedings Ieee Infocom.2010. New York: Ieee, Ieee Infocom.
[132] Li Y, Hui P, Jin D P, et al. Evaluating the Impact of Social Selfishness on theEpidemic Routing in Delay Tolerant Networks[J]. Ieee Communications Letters,2010,14(11):1026--1028.
[133] Li Y, Su G L, Wu D O, et al. The Impact of Node Selfishness on Multicastingin Delay Tolerant Networks[J]. Ieee Transactions on Vehicular Technology,2011,60(5):2224--2238.
[134] Zhu H J, Lin X D, Lu R X, et al. SMART: A Secure Multilayer Credit-BasedIncentive Scheme for Delay-Tolerant Networks[J]. Ieee Transactions on VehicularTechnology,2009,58(8):4628--4639.
[135] Lu R X, Lin X D, Zhu H J, et al. Pi: A Practical Incentive Protocol for Delay Toler-antNetworks[J]. IeeeTransactionsonWirelessCommunications,2010,9(4):1483--1493.
[136] Seth A, Hengxrmer U, Keshxv S. Practicxl security for disconnectednodes[M].2005:31--36.
[137] Peter G. An Introduction to Threshold Cryptograph[J]. CryptoBytes,1997,2(7).
[138] BlakleyR,G.R.B,ChanA,etal. ThresholdProtocolswithDisenrollment[M]. Vol.740.1993:540--548.
[139] Alon N, Galil Z, Yung M. Dynamic re-sharing verifiable secret sharing against amobile adversary[M].1995:523--537.
[140] De Santis A, Desmedt Y, Frankel Y, et al. How to share a function securely[C].Proceedings of the26th ACM Symposium on the Theory of Computing.1994:522--533.
[141] Shamir A. How to Share a Secret[J]. Communications of ACM,1979,22(11):612–613.
[142] Herzberg A, Jarecki S, Krawczyk H, et al. Proactive secret sharing[C]. Advancesin Cryptology–CRYPT'95.1995:339--352.
[143] H L, S L. Ubiquitous and robust authentication services for Ad Hoc wireless net-works[J].2000.
[144] Paul F. A Practical Scheme for Non-interactive Verifiable Secret Sharing[C].FOCS.1987:427–437.
[145] Schonenmakers B. A simple publicly verifiable secret sharing scheme and itsapplication to electronic voting[C]. CRYPTO'99.1999.
[146] Hess A, Schafer G. Performance evaluation of AAA/mobile IP authentication[C].2nd Polish-German Teletraffic. Gdansk, Poland,2002.
[147] McNair J, Akylidiz I F. Handoff for real-time traffic in mobile IP version6net-work[C]. IEEE GLOBECOM'01. San Antonio, Texas,2001.
[148] XieJ,AkylidizI. Anoptimalocationmanagementschemeforminimizingsignalingcost in mobile IP[C]. IEEE Int'1Conf on Communications(ICC'02). New York,USA,2002.
[149] Lin Z T, Qu Y G, Ji Y S, et al. Analysis and Design of Mobile Model for DTN[J].Chinese Journal of Electronics,2009,18(4):635--638.
[150] Broch J, Maltz D A, Johnson D B, et al. A performance comparison of multi-hop wireless ad hoc network routing protocols[C]. Proceedings of the Fourth An-nual ACM/IEEE International Conference on Mobile Computing and Network-ing(Mobicom98). ACM Press,1998.
[151] Blough D M, G. R, Santi P. A statistical analysis of the long-run node spatial distri-bution in mobile ad hoc networks[C]. Procedding of ACM International Workshopon Modeling, Analysis and Simulation of Wireless and Mobile Systems(MSWiM).Atlanta, GA,2002.
[152] Royer E M, Melliar-Smith P M, Moser L E. An Analysis of the Optimum NodeDensity for Ad hoc Mobile Networks[C]. Proceedings of the IEEE InternationalConference on Communications(ICC). Helsinki, Finland,2001.
[153] Resta G, Santi P. An analysis of the node spatial distribution of the random way-pointmodelforadhocnetworks[C]. Proc.ACMWorkshoponPrinciplesofMobileComputing (POMC). Toulouse, France,2002.
[154] Balakrishnan K, Deng J, Varshney P K. TWOACK: Preventing Selfishness in Mo-bile Ad Hoc Networks[C].2005.
[155] He Q, Wu D P, Khosla P. A secure incentive architecture for ad hoc networks[J].Wireless Communications&Mobile Computing,2006,6(3):333--346.
[156] LuoJH,LiuX,FanMY. Atrustmodelbasedonfuzzyrecommendationformobilead-hoc networks[J]. Computer Networks,2009,53(14):2396--2407.
[157] Zhu H J, Lin X D, Lu R X, et al. SMART: A Secure Multilayer Credit-BasedIncentive Scheme for Delay-Tolerant Networks[J]. Ieee Transactions on VehicularTechnology,2009,58(8):4628--4639.
[158] Lu R X, Lin X D, Zhu H J, et al. Pi: A Practical Incentive Protocol for Delay Toler-antNetworks[J]. IeeeTransactionsonWirelessCommunications,2010,9(4):1483--1493.
[159] Gong Y L, Xiong Y Q, Zhang Q A, et al. Anycast Routing in Delay Tolerant Net-works[M]. Globecom2006-2006Ieee Global Telecommunications Conference.2006. NewYork: Ieee, IEEEGlobalTelecommunicationsConference(Globecom),
[160] Lindgren A, Phanse K S, Ieee. Evaluation of queueing policies and forwardingstrategies for routing in intermittently connected networks[M].20061st Interna-tional Conference on Communication Systems Software&Middleware, Vols1and2. New York: Ieee,2006.
[161] Xiao M J, Huang L S, Dong Q F, et al. Leapfrog: Optimal Opportunistic Routingin Probabilistically Contacted Delay Tolerant Networks[J]. Journal of ComputerScience and Technology,2009,24(5):975--986.
[162] Spyropoulos T, Turletti T, Obraczka K. Routing in Delay-Tolerant Networks Com-prising Heterogeneous Node Populations[J]. Ieee Transactions on Mobile Comput-ing,2009,8(8):1132--1147.
[163]李凌晶,孙力娟,王汝传, et al.能量有效的无线传感器网络可信路由协议[J].系统工程与电子技术,2010(12).
[164]吴亚辉,邓苏,黄宏斌.延迟容忍网络状态感知的路由策略研究[J].电子与信息学报,2011(03).
[165] Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittentlyconnected mobile networks: The single-copy case[J]. Ieee-Acm Transactions onNetworking,2008,16(1):63--76.
[2] Farrell S, Cahill V, Geraghty D, et al. When TCP breaks-Delay-and disruption-tolerant networking[J]. Ieee Internet Computing,2006,10(4):72--78.
[3] McMahon A, Farrell S. Delay-and Disruption-Tolerant Networking[J]. Ieee Inter-net Computing,2009,13(6):82--87.
[4] Burleigh S, Hooke A, Torgerson L, et al. Delay-tolerant networking: An approachto interplanetary Internet[J]. Ieee Communications Magazine,2003,41(6):128--136.
[5] Postel J. Transmission Control Protocol[J]. IETF RFC793,1981.
[6] Cerf V, Burleigh S, Hooke A, et al. Delay-Tolerant Networking Architecture[J].IETF RFC4838,2007.
[7] FallK. Adelay-tolerantnetworkarchitectureforchallengedInternets[J]. ComputerCommunication Review,2003,33(4):27--34.
[8] Wood L, McKim J, Eddy W. Using Saratoga with a bundle agent as a convergencelayer for delay tolerant networking[J].2008. http://www.watersprings.org/pub/id/draft-wood-dtnrg-saratoga-03.txt.
[9] Wood L, Eddy W M, Ivancic W, et al. Saratoga: a Delay-Tolerant Networkingconvergence layer with efficient link utilization[M].2007International Workshopon Satellite and Space Communications, Iwssc '07, Conference Proceedings. NewYork: Ieee,2007.
[10] Farrell S, Ramadas M, Burleigh S. Licklider Transmission Protocol-Security Ex-tensions[J]. IETF RFC5327,2008.
[11] Symington S, Farrell S, Weiss H, et al. Bundle Security Protocol Specification[J].IETF RFC6257,2011.
[12] Warthman F. Delay Tolerant Network (DTNs): A Tutorial[J].2003.
[13]樊秀梅,单志广,张宝贤, et al.容迟网络体系结构及其关键技术研究[J].电子学报,2008,36(1).
[14]李向群,刘立祥,胡晓惠, et al.延迟/中断可容忍网络研究进展[J].计算机研究与发展,2009(08).
[15] Durst R, Miller G, Travis E. TCP extensions for space communication[C]. Con-ference Proceedings of the1996ACM Mobile Communication.1996:15--26.
[16] Scott K, Burleigh S. Bundle Protocol Specification[J]. IETF RFC5050,2007.
[17] BurleighS,RamadasM,FarrellS. LickliderTransmissionProtocol-Motivation[J].IETF RFC5325,2008.
[18] Ramadas M, Burleigh S, Farrell S. Licklider Transmission Protocol-Specifica-tion[J]. IETF RFC5326,2008.
[19] Eddy E, W. M.and Davies. Using Self-Delimiting Numeric Values in Protocols[J].IETF RFC6256,2011.
[20] Wood L, Eddy W M, Ivancic W, et al. Saratoga: a Delay-Tolerant Networkingconvergence layer with efficient link utilization[M].2007International Workshopon Satellite and Space Communications, Iwssc '07, Conference Proceedings. NewYork: Ieee,2007.
[21] Ott J, Kaerkkaeinen T, Pitkaenen M. Application Conventions for Bundle-based Communications[J].2007. http://www.watersprings.org/pub/id/draft-ott-dtnrg-dm-appl-00.txt.
[22] Symington S, Durst R, Scott K. Delay-tolerant netwroking custodialnulticast extensions[J].2007. http://www.watersprings.org/pub/id/draft-symington-dtnrg-bundle-multicast-custodial-03.txt.
[23] Wyllie J, Eddy W, Ishac J. Automated bundle agent discovery for delay/dis-ruption—tolerant networking[M].2007. http://www.watersprings.org/pub/id/draft-wyllie-dtnrg-badisc-01.txt.
[24] Jain S, Fall K, Patra R. Routing in a delay tolerant network[J]. Computer Commu-nication Review,2004,34(4):145--157.
[25] Spyropoulos T, Psounis K, Raghavendra C S. Spray and Wait: An Effcient Rout-ing Scheme for Intermittently Connected Mobile Networks[C]. ACM SIGCOMMWorkshop on Delay-Tolerant Networking(WDTN).2005.
[26] Chuah M, Yang P, Ieee. Node density-based adaptive routing scheme for disruptiontolerant networks[M]. MILCOM2006, Vols1-7. New York: Ieee,2006.
[27] Zhang Z S. Routing in intermittently connected mobile ad hoc network and delaytolerant network: overview and challenges[J]. Ieee Communications Surveys andTutorials,2006,8(1):24--37.
[28] Burgess J, Gallagher B, Jensen D, et al. MaxProp: Routing for vehicle-baseddisruption-tolerant networks[M]. Ieee Infocom. New York: Ieee,2006:1688--1698.
[29] Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resourceallocation problem[J]. Computer Communication Review,2007,37(4):373--384.
[30] Liu C, Wu J, Acm. Scalable Routing in Delay Tolerant Networks[M]. Mobihoc'07:Proceedings of the Eighth Acm International Symposium on Mobile Ad Hoc Net-working and Computing. New York: Assoc Computing Machinery,2007.
[31] Chen Y, Zhao W R, Ammar M, et al. Hybrid Routing in Clustered DTNs withMessageFerrying[M]. Mobiopp'07-ProceedingsoftheFirstInternationalMobisysWorkshop on Mobile Opportunistic Networking. New York: Assoc ComputingMachinery,2007.
[32] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[33] Yin L, Lu H M, Cao Y D, et al. Probabilistic Delay Routing for delay tolerantnetworks[M].10th International Conference on Advanced Communication Tech-nology, Vols I-Iii: Innovations toward Future Networks and Services. Piscataway:Ieee,2008.
[34] Abdulla M, Simon R, Ieee. Controlled Epidemic Routing for Multicasting in DelayTolerant Networks[M]. International Symposium on Modeling Analysis and Simu-lationofComputerandTelecommunicationSystemsProceedings. NewYork: Ieee,2008:1--10.
[35] Cardei I, Liu C, Wu J, et al. DTN Routing with Probabilistic Trajectory Predic-tion[M]. Li Y, Huynh D T, Da S K. Wireless Algorithms, Systems, and Ap-plications, Proceedings.2008. Berlin: Springer-Verlag Berlin, Lecture Notes inComputer Science, vol.5258.
[36] Mundur P, Seligman M, Ieee. Delay tolerant network routing: Beyond epidemicrouting[M].20083rd International Symposium on Wireless Pervasive Computing,Vols1-2. New York: Ieee,2008.
[37] Chuah M C, Yang P. Context-aware multicast routing scheme for Disruption Tol-erant Networks[J]. International Journal of Ad Hoc and Ubiquitous Computing,2009,4(5):269--281.
[38] Spyropoulos T, Bin Rais R N, Turletti T, et al. Routing for disruption tolerantnetworks: taxonomy and design[J]. Wireless Networks,2010,16(8):2349--2370.
[39] Yuan Q, Cardei I, Wu J. An Efficient Prediction-Based Routing in Disruption-TolerantNetworks[J]. IeeeTransactionsonParallelandDistributedSystems,2012,23(1):19--31.
[40] The One Simulator. http://www.netlab.tkk.f/tutkimus/dtn/theone/.
[41] Grossglauser M, Tse D. Mobility increases the capacity of ad hoc wireless net-works[J]. IEEE/ACM Trans. on Networking,2002,10(4):477--486.
[42] VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc net-works[J]. Technical Report CS-200006,2000.
[43] Li J, Burge L, Kaplan K, et al. A Probabilistic routing algorithm for DTNs ofrandomly moving nodes[M]. ICWN '05: Proceedings of the2005InternationalConference on Wireless Networks. Athens: C S R E a Press,2005.
[44] Ip Y K, Lau W C, Yue O C, et al. Forwarding and replication strategies for DTNwith resource constraints[M]. IEEE VTS Vehicular Technology Conference Pro-ceedings. New York: Ieee,2007:1260--1264.
[45] Fazl e H, Shah N, Syed A H, et al. Adaptive anycast: A new anycast protocol forperformance improvement in delay tolerant networks[M].2007IEEE InternationalConference on Integration Technology, Proceedings. New York: Ieee,2007.
[46] Leontiadis I, Mascolo C, Acm. Opportunistic Spatio-Temporal Dissemination Sys-tem for Vehicular Networks[M]. Mobiopp'07-Proceedings of the First Interna-tional Mobisys Workshop on Mobile Opportunistic Networking. New York: AssocComputing Machinery,2007.
[47] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[48] Abdulla M, Simon R, Ieee. Controlled Epidemic Routing for Multicasting in DelayTolerant Networks[M]. International Symposium on Modeling Analysis and Simu-lationofComputerandTelecommunicationSystemsProceedings. NewYork: Ieee,2008:1--10.
[49] Tower J P, Little T D C, Ieee. A Proposed Scheme for Epidemic Routing withActiveCuringforOpportunisticNetworks[M].200822ndInternationalWorkshopsonAdvancedInformationNetworkingandApplications, Vols1-3. NewYork: Ieee,2008.
[50] Olajide T, Washington A N. Epidemic modeling of military networks using groupand entity mobility models[M]. Proceedings of the Fifth International Conferenceon Information Technology: New Generations. Los Alamitos: Ieee Computer Soc,2008.
[51] Mundur P, Seligman M, Ieee. Delay tolerant network routing: Beyond epidemicrouting[M].20083rd International Symposium on Wireless Pervasive Computing,Vols1-2. New York: Ieee,2008.
[52] Tang L, Zheng Q W, Liu J, et al. Selective Message Forwarding in Delay TolerantNetworks[J]. Mobile Networks&Applications,2009,14(4):387--400.
[53] LiuC,WuJ,Acm. AnOptimalProbabilisticForwardingProtocolinDelayTolerantNetworks[M]. Mobihoc'09ProceedingsoftheTenthAcmInternationalSymposiumon Mobile Ad Hoc Networking and Computing. New York: Assoc ComputingMachinery,2009.
[54] Wang X, Shu Y T, Jin Z G, et al. Adaptive Randomized Epidemic Routing forDisruption Tolerant Networks[M].2009Fifth International Conference on MobileAd-Hoc and Sensor Networks. New York: Ieee,2009.
[55]韩秀蓉,康凤举,钟联炯, et al.延迟容忍网络中基于Epidemic算法的组播路由研究[J].系统仿真学报,2009(21).
[56] Acer U G, Kalyanaraman S, Abouzeid A A. DTN routing using explicit and prob-abilistic routing table states[J]. Wireless Networks,2011,17(5):1305--1321.
[57]薛静锋,范志安,李建胜, et al.基于历史信息预测转发概率的DTN路由算法[J].北京理工大学学报,2011(01).
[58] Shahbazi S, Karunasekera S, Harwood A. Improving performance in delay/disrup-tion tolerant networks through passive relay points[J]. Wireless Networks,2012,18(1):9--31.
[59]裴泽艮,肖明军,黄刘生.位置关联的延迟容忍网络路由算法[J].计算机工程.
[60] Conan V, Leguay J, Friedman T. Fixed point opportunistic routing in delay tolerantnetworks[J]. IEEEJournalonSelectedAreasinCommunications,2008,26(5):773--782.
[61] Groenevelt R, Nain P, Koole G. The message delay in mobile ad hoc networks[J].Performance Evaluation,2005,62(1-4):210--228.
[62] Ramanathan R, Hansen R, Basu P, et al. Prioritized epidemic routing for oppor-tunistic networks[C]. In Proc.of the1st Int Workshop on Mobile OpportunisticNetworking. San Juan: ACM Press,2007:62--66.
[63] Nain D, Petigara N, Balakrishnan H. Integrated routing and storage for messagingapplications in mobile ad hoc networks[J]. Mobile Networks and Applications,2004,9(6):595--604.
[64] Zhang X, Neglia G, Kurose J, et al. Performance modeling of epidemic routing[J].Computer Networks,2007,51(10):2867--2891.
[65] Burgess J, Gallagher B, Jensen D, et al. MaxProp: Routing for vehicle-baseddisruption-tolerant networks[M]. Ieee Infocom Series. New York: Ieee,2006:1688--1698.
[66] Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittentlyconnected mobile networks: The multiple-copy case[J]. Ieee-Acm Transactions onNetworking,2008,16(1):77--90.
[67] Jones E P C, Li L, Schmidtke J K, et al. Practical routing in delay-tolerant net-works[J]. Ieee Transactions on Mobile Computing,2007,6(8):943--959.
[68]周晓波,卢汉成,李津生, et al. AED:一种用于DTN的增强型Earliest-Delivery算法[J].电子与信息学报,2007(08).
[69] LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittentlyconnected networks[J]. The First International Workshop on Service Assurancewith Partial and Intermittent Resources (SAPIR),2004.
[70] Chuah M C, Yang P. Context-aware multicast routing scheme for Disruption Tol-erant Networks[J]. International Journal of Ad Hoc and Ubiquitous Computing,2009,4(5):269--281.
[71] Musolesi M, Mascolo C. CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks[J]. Ieee Transactions on Mobile Computing,2009,8(2):246--260.
[72] Haas Z J, Small T. A new networking model for biological applications of ad hocsensor networks[J]. Ieee-Acm Transactions on Networking,2006,14(1):27--40.
[73] Peoples C, Parr G, Scotney B, et al. A reconfigurable context-aware protocol stackfor interplanetary communication[M].2007International Workshop on Satelliteand Space Communications, Iwssc '07, Conference Proceedings. New York: Ieee,2007.
[74] Mascolo C, Musolesi M, Pásztor B. Opportunistic mobile sensor data collectionwith SCAR[C]. In Proc. of the4th Int Conf. on Embedded Networked SensorSystems. Boulder: ACM,2006:343--344.
[75] Spyropoulos T, Psounis K, Raghavendra C S. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility[M]. Fifth Annual IEEEInternational Conference on Pervasive Computing and Communications Work-shops, Proceedings. Los Alamitos: Ieee Computer Soc,2007.
[76] WangY,JainS,MartonosiM,etal. Erasure-Codingbasedroutingforopportunisticnetworks[C]. Proc. of the2005ACM SIGCOMM Workshop on Delay-TolerantNetworking. Philadelphia: ACM,2005:229--236.
[77] Wu J, Yang S H. Small world model-based polylogarithmic routing using mobilenodes[J]. Journal of Computer Science and Technology,2008,23(3):327--342.
[78] Wittie M P, Harras K A, Almeroth K C, et al. On the implications of routingmetric staleness in delay tolerant networks[J]. Computer Communications,2009,32(16):1699--1709.
[79]郭航,王兴伟,黄敏, et al.容延容断网络研究及进展[J].计算机科学,2010(11).
[80]张龙,周贤伟,王建萍, et al.容迟与容断网络中的路由协议[J].软件学报,2010(10).
[81]苏金树,胡乔林,赵宝康, et al.容延容断网络路由技术[J].软件学报,2010(01).
[82] Bettstetter C. Mobility Modeling in Wireless Networks: Categorization, SmoothMovement,and Border Effects[J]. ACM Mobile Computing and CommunicationsReview,2001,5(3):55--67.
[83] Leguay J, Friedman T, Conan V, et al. Evaluating mobility pattern space routingfor DTNs[M]25th Ieee International Conference on Computer Communications,Vols1-7, Proceedings Ieee Infocom2006.2006. New York: Ieee, Ieee Infocom.
[84] Abdulla M, Simon R, Ieee. The impact of the mobility model on delay tolerantnetworking performance analysis[M]. Proceedings of the Annual Simulation Sym-posia. Los Alamitos: Ieee Computer Soc,2007:177--184.
[85] Hsu W J, Spyropoulos T, Psounis K, et al. Modeling Spatial and Temporal Depen-dencies of User Mobility in Wireless Mobile Networks[J]. Ieee-Acm Transactionson Networking,2009,17(5):1564--1577.
[86] Washington A N, Iziduh R, Society I C. Modeling of Military Networks usingGroup Mobility Models[M]. Proceedings of the2009Sixth International Confer-ence on Information Technology: New Generations, Vols1-3. New York: Ieee,2009.
[87] Park M, Min S, So S, et al. Mobility Pattern Based Routing Algorithm for De-lay/Disruption Tolerant Networks[M]. Balandin S, Dunaytsev R, Koucheryavy Y.Smart Spaces and Next Generation Wired/Wireless Networking.2010. Berlin:Springer-Verlag Berlin, Lecture Notes in Computer Science, vol.6294.
[88] Rhee I, Shin M, Hong S, et al. On the Levy-Walk Nature of Human Mobility[J].Ieee-Acm Transactions on Networking,2011,19(3):630--643.
[89] Bettstetter C, Wagner C. The spatial node distribution of the random waypointmobility model[C]. German Workshop on Mobile Ad Hoc Networks (WMAN).Ulm, Germany,2002.
[90] Eagle N, Pentland A. Reality mining: sensing complex social systems[J]. PersonalUbiquitous Computing,2006,10(4):255--268.
[91] UCSD. Wireless topology discovery project.2004.http://sysnet.ucsd.edu/wtd/wtd.html.
[92] Diot C e a. Haggle project.2004. http://www.haggleproject.org.
[93] Zhang X L, Kurose J, Levine B N, et al. Study of a Bus-based Disruption-TolerantNetwork: Mobility Modeling and Impact on Routing[M]. Mobicom'07: Proceed-ings of the Thirteenth Acm International Conference on Mobile Computing andNetworking. New York: Assoc Computing Machinery,2007.
[94] Pan H, Chaintreau A, Scott J, et al. Pocket switched networks and human mobilityin conference environments[M]. Philadelphia: ACM Press,2005:244--251.
[95] Cai H, Eun D. Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET[C]. Proc. of the13th Annual ACM Int Conf.onMobile Computing and Networking. Montréal: ACM Press,2007:159--170.
[96] Farrell S, Cahill V, Society I C. Security considerations in space and delay tol-erant networks[M]. SMC-IT2006:2nd IEEE International Conference on SpaceMission Challenges for Information Technology, Proceedings. Los Alamitos: IeeeComputer Soc,2006.
[97] Asokan N, Kostiainen K, Ginzboorg P, et al. Applicability of Identity-Based Cryp-tographyforDisruption-TolerantNetworking[M]. Mobiopp'07-ProceedingsoftheFirst International Mobisys Workshop on Mobile Opportunistic Networking. NewYork: Assoc Computing Machinery,2007.
[98] N. Asokan P G J O C L, Kari Kostiainen. Toward Securing Disruption-TolerantNetworking[J].2007.
[99] Burgess J, Bissias G D, Corner M, et al. Surviving Attacks on Disruption-TolerantNetworkswithoutAuthentication[M]. Mobihoc'07: ProceedingsoftheEighthAcmInternational Symposium on Mobile Ad Hoc Networking and Computing. NewYork: Assoc Computing Machinery,2007.
[100] Kate A, Zaverucha G M, Hengartner U. Anonymity and security in delay toler-ant networks[M].2007Third International Conference on Security and Privacy inCommunication Networks and Workshops. New York: Ieee,2007.
[101] PatraR,SuranaS,NedevschiS. HierarchicalIdentityBasedCryptographyforEnd-to-EndSecurityinDTNs[M].2008Ieee4thInternationalConferenceon IntelligentComputer Communication and Processing, Proceedings.2008. New York: Ieee,International Conference on Intelligent Computer Communication and Processing.
[102] Shi M, AlMotairi K, Shen X, et al. Credit-Based User Authentication for DelayTolerant Mobile Wireless Networks[M]. Beijing, China,2008.
[103] Zhu H, Lin X, Lu R, et al. BBA: An Effcient Batch Bundle Authentication Schemefor Delay Tolerant Networks[C]. GLOBECOM2008.2008.
[104] Farrell S, Symington S, Weiss H, et al. Delay-Tolerant Networking SecurityOverview[J]. draft-irtf-dtnrg-sec-overview-06,2009.
[105] Li Y, Su G L, Wang Z C. Evaluating the effects of node cooperation on DTNrouting[J]. Aeu-International Journal of Electronics and Communications,2012,66(1):62--67.
[106] Bulut E, Szymanski B K, Ieee. On Secure Multi-copy based Routing in Compro-mised Delay Tolerant Networks[M]. IEEE International Conference on ComputerCommunications and Networks. New York: Ieee,2011.
[107] Abdelkader T, Naik K, Nayak A, et al. A Socially-based Routing Protocol ForDelay Tolerant Networks[C].2010Ieee Global Telecommunications ConferenceGlobecom2010.2010. New York: Ieee, IEEE Global Telecommunications Con-ference (Globecom).
[108] Tournoux P U, Lochin E, Leguay J, et al. Robust Streaming in Delay TolerantNetworks[C].2010Ieee International Conference on Communications.2010. NewYork: Ieee, IEEE International Conference on Communications.
[109] Fall K, Farrell S. DTN: An architectural retrospective[J]. Ieee Journal on SelectedAreas in Communications,2008,26(5):828--836.
[110] MichiardiP,MolvaR. Core: Acollaborativereputationmechanismtoenforcenodecooperationinmobileadhocnetworks[M]. JermanBlazicB,KlobucarT. AdvancedCommunications and Multimedia Security.2002. Norwell: Kluwer AcademicPublishers, International Federation for Information Processing, vol.100.
[111] Buchegger S, Le Boudec J Y. A Bayesian approach to robust reputation systemsfor mobile ad hoc networks[J]. Ieee Pervasive Computing,2003,2(3):95--96.
[112] Wrona K, Mahonen P. Analytical model of cooperation in ad hoc networks[J].Telecommunication Systems,2004,27(2-4):347--369.
[113] KonorskiJ. FairpacketforwardinginMANETswithanonymousstations: Agame-theoreticapproach[M]. Networking2004-NetworkingTechnologies,Services,andProtocols; Performance of Computer and Communication Networks; Mobile andWireless Communications.2004. Berlin: Springer-Verlag Berlin, Lecture Notes inComputer Science, vol.3042.
[114] Buchegger S, Le Boudec J Y. Self-policing mobile ad hoc networks by reputationsystems[J]. Ieee Communications Magazine,2005,43(7):101--107.
[115] BalasubramanianAR,GhoshJ,WangX. Areputationbasedschemeforstimulatingcooperation in MANETs[M]. Teletraffic Science and Engineering, vol.6A-6C.Beijing: Beijing Univ Posts Telecommunicat Press,2005:543--552.
[116] Adams W J, Hadjichristofi G C, Davis N J. Calculating a node's reputation in a mo-bile ad hoc network[M]. Conference Proceedings of the2005IEEE InternationalPerformance, Computing and Communications Conference.2005. Los Alamitos:Ieee Computer Soc, IEEE International Performance, Computing and Communica-tions Conference (IPCCC).
[117] Yoo Y, Agrawal D P. Why does it pay,to be selfish in a MANET?[J]. Ieee WirelessCommunications,2006,13(6):87--97.
[118] Anker T, Dolev D, Hod B, et al. Cooperative and reliable packet-forwarding on topof AODV[M].20064th International Symposium on Modeling and Optimizationin Mobile, Ad Hoc and Wireless Networks, Vols1and2. New York: Ieee,2006.
[119] Marias G F, Georgiadis P, Flitzanis D, et al. Cooperation enforcement schemesfor MANETs: a survey[J]. Wireless Communications&Mobile Computing,2006,6(3):319--332.
[120] BoukerchA,XuL,El-KhatibK. Trust-basedsecurityforwirelessadhocandsensornetworks[J]. Computer Communications,2007,30(11-12):2413--2427.
[121] AnantvaleeT,WuJ,Ieee. Reputation-basedsystemforencouragingthecooperationof nodes in mobile ad hoc networks[C].2007Ieee International Conference onCommunications, Vols1-14.2007. New York: Ieee, Ieee International Conferenceon Communications.
[122] Wang K, Wu M. Incentive Schemes of Nodes for Ad Hoc and Multi-hop CellularNetworks[J]. China Communications,2007,4(4):79--88.
[123] Zhou R F, Hwang K. PowerTrust: A robust and scalable reputation system fortrusted Peer-to-Peer computing[J]. Ieee Transactions on Parallel and DistributedSystems,2007,18(4):460--473.
[124] Ganeriwal S, Balzano L K, Srivastava M B. Reputation-based framework for highintegrity sensor networks[J]. Acm Transactions on Sensor Networks,2008,4(3).
[125] Hoffman K, Zage D, Nita-Rotaru C. A Survey of Attack and Defense Techniquesfor Reputation Systems[J]. Acm Computing Surveys,2009,42(1).
[126] Tsai H C, Lo N W, Wu T C. A Threshold-Adaptive Reputation System on Mo-bile Ad Hoc Networks[J]. Ieice Transactions on Information and Systems,2009,E92D(5):777--786.
[127]单明辉,贡佳炜,牛尔力, et al. RulerRep:一种基于偏离度的过滤不实评价新方法[J].计算机学报,2010(07).
[128] Azer M A, El-Kassas S M, Hassan A W F, et al. A survey on trust and reputationschemes in ad hoc networks[M]. Ares2008: Proceedings of the Third InternationalConference on Availability, Security and Reliability. Los Alamitos: Ieee ComputerSoc,2008.
[129] Karaliopoulos M. Assessing the Vulnerability of DTN Data Relaying Schemes toNode Selfishness[J]. Ieee Communications Letters,2009,13(12):923--925.
[130] Shevade U, Song H H, Qiu L L, et al. Incentive-Aware Routing in DTNs[M].16thIeee International Conference on Network Protocols: Icnp'08.2008. Los Alamitos:IeeeComputerSoc, IEEEInternationalConferenceonNetworkProtocolsProceed-ings.
[131] Li Q H, Zhu S C, Cao G H, et al. Routing in Socially Selfish Delay Tolerant Net-works[M]2010Proceedings Ieee Infocom.2010. New York: Ieee, Ieee Infocom.
[132] Li Y, Hui P, Jin D P, et al. Evaluating the Impact of Social Selfishness on theEpidemic Routing in Delay Tolerant Networks[J]. Ieee Communications Letters,2010,14(11):1026--1028.
[133] Li Y, Su G L, Wu D O, et al. The Impact of Node Selfishness on Multicastingin Delay Tolerant Networks[J]. Ieee Transactions on Vehicular Technology,2011,60(5):2224--2238.
[134] Zhu H J, Lin X D, Lu R X, et al. SMART: A Secure Multilayer Credit-BasedIncentive Scheme for Delay-Tolerant Networks[J]. Ieee Transactions on VehicularTechnology,2009,58(8):4628--4639.
[135] Lu R X, Lin X D, Zhu H J, et al. Pi: A Practical Incentive Protocol for Delay Toler-antNetworks[J]. IeeeTransactionsonWirelessCommunications,2010,9(4):1483--1493.
[136] Seth A, Hengxrmer U, Keshxv S. Practicxl security for disconnectednodes[M].2005:31--36.
[137] Peter G. An Introduction to Threshold Cryptograph[J]. CryptoBytes,1997,2(7).
[138] BlakleyR,G.R.B,ChanA,etal. ThresholdProtocolswithDisenrollment[M]. Vol.740.1993:540--548.
[139] Alon N, Galil Z, Yung M. Dynamic re-sharing verifiable secret sharing against amobile adversary[M].1995:523--537.
[140] De Santis A, Desmedt Y, Frankel Y, et al. How to share a function securely[C].Proceedings of the26th ACM Symposium on the Theory of Computing.1994:522--533.
[141] Shamir A. How to Share a Secret[J]. Communications of ACM,1979,22(11):612–613.
[142] Herzberg A, Jarecki S, Krawczyk H, et al. Proactive secret sharing[C]. Advancesin Cryptology–CRYPT'95.1995:339--352.
[143] H L, S L. Ubiquitous and robust authentication services for Ad Hoc wireless net-works[J].2000.
[144] Paul F. A Practical Scheme for Non-interactive Verifiable Secret Sharing[C].FOCS.1987:427–437.
[145] Schonenmakers B. A simple publicly verifiable secret sharing scheme and itsapplication to electronic voting[C]. CRYPTO'99.1999.
[146] Hess A, Schafer G. Performance evaluation of AAA/mobile IP authentication[C].2nd Polish-German Teletraffic. Gdansk, Poland,2002.
[147] McNair J, Akylidiz I F. Handoff for real-time traffic in mobile IP version6net-work[C]. IEEE GLOBECOM'01. San Antonio, Texas,2001.
[148] XieJ,AkylidizI. Anoptimalocationmanagementschemeforminimizingsignalingcost in mobile IP[C]. IEEE Int'1Conf on Communications(ICC'02). New York,USA,2002.
[149] Lin Z T, Qu Y G, Ji Y S, et al. Analysis and Design of Mobile Model for DTN[J].Chinese Journal of Electronics,2009,18(4):635--638.
[150] Broch J, Maltz D A, Johnson D B, et al. A performance comparison of multi-hop wireless ad hoc network routing protocols[C]. Proceedings of the Fourth An-nual ACM/IEEE International Conference on Mobile Computing and Network-ing(Mobicom98). ACM Press,1998.
[151] Blough D M, G. R, Santi P. A statistical analysis of the long-run node spatial distri-bution in mobile ad hoc networks[C]. Procedding of ACM International Workshopon Modeling, Analysis and Simulation of Wireless and Mobile Systems(MSWiM).Atlanta, GA,2002.
[152] Royer E M, Melliar-Smith P M, Moser L E. An Analysis of the Optimum NodeDensity for Ad hoc Mobile Networks[C]. Proceedings of the IEEE InternationalConference on Communications(ICC). Helsinki, Finland,2001.
[153] Resta G, Santi P. An analysis of the node spatial distribution of the random way-pointmodelforadhocnetworks[C]. Proc.ACMWorkshoponPrinciplesofMobileComputing (POMC). Toulouse, France,2002.
[154] Balakrishnan K, Deng J, Varshney P K. TWOACK: Preventing Selfishness in Mo-bile Ad Hoc Networks[C].2005.
[155] He Q, Wu D P, Khosla P. A secure incentive architecture for ad hoc networks[J].Wireless Communications&Mobile Computing,2006,6(3):333--346.
[156] LuoJH,LiuX,FanMY. Atrustmodelbasedonfuzzyrecommendationformobilead-hoc networks[J]. Computer Networks,2009,53(14):2396--2407.
[157] Zhu H J, Lin X D, Lu R X, et al. SMART: A Secure Multilayer Credit-BasedIncentive Scheme for Delay-Tolerant Networks[J]. Ieee Transactions on VehicularTechnology,2009,58(8):4628--4639.
[158] Lu R X, Lin X D, Zhu H J, et al. Pi: A Practical Incentive Protocol for Delay Toler-antNetworks[J]. IeeeTransactionsonWirelessCommunications,2010,9(4):1483--1493.
[159] Gong Y L, Xiong Y Q, Zhang Q A, et al. Anycast Routing in Delay Tolerant Net-works[M]. Globecom2006-2006Ieee Global Telecommunications Conference.2006. NewYork: Ieee, IEEEGlobalTelecommunicationsConference(Globecom),
[160] Lindgren A, Phanse K S, Ieee. Evaluation of queueing policies and forwardingstrategies for routing in intermittently connected networks[M].20061st Interna-tional Conference on Communication Systems Software&Middleware, Vols1and2. New York: Ieee,2006.
[161] Xiao M J, Huang L S, Dong Q F, et al. Leapfrog: Optimal Opportunistic Routingin Probabilistically Contacted Delay Tolerant Networks[J]. Journal of ComputerScience and Technology,2009,24(5):975--986.
[162] Spyropoulos T, Turletti T, Obraczka K. Routing in Delay-Tolerant Networks Com-prising Heterogeneous Node Populations[J]. Ieee Transactions on Mobile Comput-ing,2009,8(8):1132--1147.
[163]李凌晶,孙力娟,王汝传, et al.能量有效的无线传感器网络可信路由协议[J].系统工程与电子技术,2010(12).
[164]吴亚辉,邓苏,黄宏斌.延迟容忍网络状态感知的路由策略研究[J].电子与信息学报,2011(03).
[165] Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittentlyconnected mobile networks: The single-copy case[J]. Ieee-Acm Transactions onNetworking,2008,16(1):63--76.