留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

基于ICT分布的容迟网络接触模型

王海泉 马伟建 顾娟娟 刘丹 王亚

王海泉, 马伟建, 顾娟娟, 等 . 基于ICT分布的容迟网络接触模型[J]. 北京航空航天大学学报, 2015, 41(8): 1422-1429. doi: 10.13700/j.bh.1001-5965.2014.0557
引用本文: 王海泉, 马伟建, 顾娟娟, 等 . 基于ICT分布的容迟网络接触模型[J]. 北京航空航天大学学报, 2015, 41(8): 1422-1429. doi: 10.13700/j.bh.1001-5965.2014.0557
WANG Haiquan, MA Weijian, GU Juanjuan, et al. ICT distribution-based contact model for delay tolerant networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2015, 41(8): 1422-1429. doi: 10.13700/j.bh.1001-5965.2014.0557(in Chinese)
Citation: WANG Haiquan, MA Weijian, GU Juanjuan, et al. ICT distribution-based contact model for delay tolerant networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2015, 41(8): 1422-1429. doi: 10.13700/j.bh.1001-5965.2014.0557(in Chinese)

基于ICT分布的容迟网络接触模型

doi: 10.13700/j.bh.1001-5965.2014.0557
基金项目: 国家自然科学基金(61300173);国家部委基金(A212010006);航空科学基金(2013ZC51026);北京市教育委员会联合资助项目(JD100060630);中央高校基本科研业务费专项资金(YWF-12-LXGY-001)
详细信息
    通讯作者:

    王海泉(1978-),男,云南昭通人,讲师,whq@buaa.edu.cn,主要研究方向为移动容迟网络.

  • 中图分类号: TP393.03

ICT distribution-based contact model for delay tolerant networks

  • 摘要: 在容迟网络中,掌握节点之间的接触间隔时间(ICT)的特性,能够为网络性能分析、路由协议设计以及算法优化等研究提供理论指导和帮助,但目前的ICT模型往往缺乏普适性.通过对节点运动做出一般性假设,基于可靠性数学方法,给出了一个基于ICT分布的接触模型——IDCM.该模型证明了两个移动节点之间的ICT服从指数分布,且指数分布的参数仅与两个节点的历史接触次数和累积ICT有关.在随机方向(RD)移动模型、随机路点(RWP)移动模型、北京市出租车网络、口袋交换网4个数据集上进行了仿真验证,并与基于统计拟合参数的指数分布模型进行对比.仿真实验结果表明,IDCM能够准确反映节点对之间的接触间隔时间分布,且模型准确性优于基于统计拟合参数的指数分布模型.

     

  • [1] Ahmed S A, Salil S K S.Characterization of a large-scale delay tolerant network[C]//Local Computer Networks (LCN).Piscataway,NJ:IEEE Press,2010:56-63.
    [2] Karagiannis T, le Boudec J,Vojnovic M.Power law and exponential decay of intercontact times between mobile devices[J].IEEE Transactions on Mobile Computing,2010,9(10):1377-1390.
    [3] Zhu H Z, Li M L,Fu L Y,et al.Impact of traffic influxes:Revealing exponential intercontact time in urban VANETs[J].IEEE Transactions on Parallel and Distributed Systems,2011,22(8):1258-1266.
    [4] Li Y, Jiang Y R,Jin D P,et al.Energy-efficient optimal opportunistic forwarding for delay-tolerant networks[J].IEEE Transactions on Vehicular Technology,2010,59(9):4500-4512.
    [5] Sharma G, Mazumdar R R.Delay and capacity tradeoffs for wireless ad hoc networks with random mobility[J].IEEE/ACM Transactions on Networking,2007,15(5):981-992.
    [6] Muhammad A, Simon R.A simulation study of common mobility models for opportunistic networks[C]//Simulation Symposium.Piscataway,NJ:IEEE Press,2008:43-50.
    [7] Muhammad A, Simon R.Characteristics of common mobility models for opportunistic networks[C]//ACM Second Workshop Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks.New York:ACM,2007:105-109.
    [8] Zhang X L, Kurose J,Levine B N,et al.Study of a bus-based disruption-tolerant network:Mobility modeling and impact on routing[C]//Proceedings of the Annual International Conference on Mobile Computing and Networking.New York:ACM,2007:195-206.
    [9] Hu Y T, Wang H Q,Xia C H,et al.On the distribution of inter contact time for DTNs[C]//Local Computer Networks (LCN).Piscataway,NJ:IEEE Press,2012:152-155.
    [10] Sharma G, Mazumdar R R.Scaling laws for capacity and delay in wireless ad hoc networks with random mobility[C]//IEEE International Conference on Communications.Piscataway,NJ:IEEE Press,2004:3869-3873.
    [11] Spyropoulos T, Psounis K,Raghavendra C S.Performance analysis of mobility-assisted routing[C]//Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).New York:ACM,2006:49-60.
    [12] Li Y,Hui P, Jin D P,et al.Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks[J].IEEE Communications Letters,2010,14(11):1026-1028.
    [13] Niu J W,Guo J K, Cai Q S,et al.Predict and spread:An efficient routing algorithm for opportunistic networking[C]//Wireless Communications and Networking Conference.Piscataway,NJ:IEEE Press,2011:498-503.
    [14] James S, Richard G,Jon C,et al.The Cambridge/haggle dataset[EB/OL].Cambridge:Cambridge University,2005(2013-01-15).http://crawdad.cs.dartmouth.edu/cambridge/haggle/.
    [15] Erdds P, R Wi A.On random graphs[J].Computer Engineering,1959,109(4):339-340.
    [16] 戴冠中,王林. 复杂网络的Scale-free性、Scale-free现象及其控制[M].北京:科学出版社,2009:1-5. Dai G Z,Wang L.Scale-free property,Scale-free phenomenon and control of complex network[M].Beijing:Science Press,2009:1-5(in Chinese).
    [17] 冯允成,吕春连, 杜瑞甫.随机网络及其应用[M].北京:北京航空学院出版社,1987:1-8. Feng Y C,Lv C L,Du R F.Random network and its application[M].Beijing:Beihang University Press,1987:1-8(in Chinese).
    [18] Erd s P, Rényi A.On the existence of a factor of degree one of a connected random graph[J].Acta Mathematica Academiae Scientiarum Hungarica,1966,17(3-4):359-368.
    [19] Cai H, Eun D Y.Crossing over the bounded domain:From exponential to power-law intermeeting time in mobile ad hoc networks[J].IEEE/ACM Transactions on Networking,2009,17(5):1578-1591.
    [20] Zhu H Z, Fu L Y,Xue G T,et al.Recognizing exponential inter-contact time in VANETs[C]//2010 Proceedings IEEE INFOCOM.Piscataway,NJ:IEEE Press,2010:101-105.
  • 加载中
计量
  • 文章访问数:  571
  • HTML全文浏览量:  2
  • PDF下载量:  660
  • 被引次数: 0
出版历程
  • 收稿日期:  2014-09-11
  • 刊出日期:  2015-08-20

目录

    /

    返回文章
    返回
    常见问答