高级搜索

留言板

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

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

延迟容忍网络中能量有效的接触探测研究

周欢 任东 徐守志 蒋廷耀 黄志勇

周欢, 任东, 徐守志, 蒋廷耀, 黄志勇. 延迟容忍网络中能量有效的接触探测研究[J]. 电子与信息学报, 2015, 37(6): 1285-1290. doi: 10.11999/JEIT140995
引用本文: 周欢, 任东, 徐守志, 蒋廷耀, 黄志勇. 延迟容忍网络中能量有效的接触探测研究[J]. 电子与信息学报, 2015, 37(6): 1285-1290. doi: 10.11999/JEIT140995
Zhou Huan, Ren Dong, Xu Shou-zhi, Jiang Ting-yao, Huang Zhi-yong. Research on Energy-efficient Contact Probing in Delay Tolerant Networks[J]. Journal of Electronics & Information Technology, 2015, 37(6): 1285-1290. doi: 10.11999/JEIT140995
Citation: Zhou Huan, Ren Dong, Xu Shou-zhi, Jiang Ting-yao, Huang Zhi-yong. Research on Energy-efficient Contact Probing in Delay Tolerant Networks[J]. Journal of Electronics & Information Technology, 2015, 37(6): 1285-1290. doi: 10.11999/JEIT140995

延迟容忍网络中能量有效的接触探测研究

doi: 10.11999/JEIT140995
基金项目: 

国家自然科学基金(61174177, 41172298),国家863计划项目(2013AA10230207),湖北省自然科学基金(2014CFB145),湖北省水电工程智能视觉监测重点实验室开放基金(2014KLA07)和三峡大学人才科研启动基金(KJ2014B056, KJ2014B060)资助课题

Research on Energy-efficient Contact Probing in Delay Tolerant Networks

  • 摘要: 在延迟容忍网络中,为了发现在其通信范围内的邻居节点,网络中的节点必须不断地探测周围的环境。这个接触探测过程极其耗费能量。如果网络中的节点探测太过频繁,会耗费很多能量,且使得网络能量的使用效率降低。另一方面,稀疏的探测可能导致节点失去和其它节点的接触,从而错失交换数据的机会。因此,在延迟容忍网络中能量效率和接触机会之间存在着一种折中的关系。为了研究这种折中关系,该文首先对基于随机路点模型(Random Way-Point model, RWP)的接触探测过程进行建模,得到恒定探测间隔下接触探测概率的表达式,并且证明在所有平均探测间隔相同的策略中,以恒定间隔探测的策略是最优的。其次,基于提出的理论模型,分析不同情况下能量效率和接触探测概率之间的折中。最后,通过仿真实验验证该理论模型的正确性。
  • Wei Kai-min, Liang Xiao, and Xu Ke. A survey of social-aware routing protocols in delay tolerant networks: applications, taxonomy and design-related issues[J]. IEEE Communications Surveys and Tutorials, 2014, 16(1): 556-578.
    吴亚辉, 邓苏, 黄宏斌. 延迟容忍网络状态感知的路由策略研究[J]. 电子与信息学报, 2011, 33(3): 575-579.
    Wu Ya-hui, Deng Su, and Huang Hong-bin. Research of situation-aware routing method in delay tolerant network [J]. Journal of Electronics Information Technology, 2011, 33(3): 575-579.
    Zhou Huan, Chen Ji-ming, Fan Jia-lu, et al.. Consub: incentive-based content subscribing in selfish opportunistic mobile networks[J]. IEEE Journal on Selected Areas in Communications, 2013, 31(9): 669-679.
    张振京, 金志刚, 舒炎泰. 基于节点运动预测的社会性DTN高效路由[J]. 计算机学报, 2013, 36(3): 626-635.
    Zhang Zhen-jing, Jin Zhi-gang, and Shu Yan-tai. Efficient routing in social DTN based on nodes, movement prediction [J]. Journal of Computers, 2013, 36(3): 626-635.
    Zhou Huan, Chen Ji-ming, Zhao Hong-yang, et al.. On exploiting contact patterns for data forwarding in duty-cycle opportunistic mobile networks[J]. IEEE Transactions on Vehicular Technology, 2013, 62(9): 4629-4642.
    Drula C, Amza C, Rousseau F, et al.. Adaptive energy conserving algorithms for neighbor discovery in opportunistic bluetooth networks[J]. IEEE Journal on Selected Areas in Communications, 2007, 25(1): 96-107.
    Wang, Wei, Srinivasan V, and Motani M. Adaptive contact probing mechanisms for delay tolerant applications[C]. Proceedings of the ACM MobiCom, Montreal, Canada, 2007: 230-241.
    Wang Wei, Srinivasan V, and Motani M. Opportunistic energy-efficient contact probing in delay-tolerant applications [J]. IEEE/ACM Transactions on Networking, 2009, 17(5): 1592-1605.
    Qin Shuang, Feng Gang, and Zhang Yi-de. How the contact-probing mechanism affects the transmission capacity of delay-tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2011, 60(4): 1825-1834.
    Zhou Huan, Zheng Huan-yang, Wu Jie, et al.. Energy- efficient contact probing in opportunistic mobile networks[C]. Proceedings of the IEEE ICCCN, Nassau, Bahamas, 2013: 1-7.
    李文霁, 郑康锋, 张冬梅, 等. 一种高效的延迟容忍移动传感器网络异步探测机制[J]. 电子与信息学报, 2012, 34(12): 2891-2897.
    Li Wen-ji, Zheng Kang-feng, Zhang Dong-mei, et al.. An efficient asynchronous probing scheme for delay-tolerant mobility sensor network[J]. Journal of Electronics Information Technology, 2012, 34(12): 2891-2897.
    Hess A, Hyyti? E, and Ott J. Efficient neighbor discovery in mobile opportunistic networking using mobility awareness[C]. Proceedings of COMSNETS, Bangalore, India, 2014: 1-8.
    Broch J, Maltz D, Johnson D, et al.. A performance comparison of multi-hop wireless ad hoc network routing protocols[C]. Proceedings of the ACM Mobicom, Dallas, USA, 1998: 85-97.
    McDonald B and Znati T. A path availability model for wireless Ad-hoc networks[C]. Proceedings of the IEEE WCNC, New Orleans, USA, 1999: 35-40.
    Eagle N, Pentland A, and Lazer D. Inferring social network structure using mobile phone data[J]. Proceedings of National Academy of Sciences, 2009, 106(36): 15274-15278.
    Tsao Cheng-lin, Liao Wan-jiun, and Kuo Jia-chun. Link duration of the random way point model in mobile Ad hoc networks[C]. Proceedings of the IEEE WCNC, Las Vegas, USA, 2006: 367-371.
    Wu Yueh-ting, Liao Wan-jiun, Tsao Cheng-lin, et al.. Impact of node mobility on link duration in multihop mobile networks[J]. IEEE Transactions on Vehicular Technology, 2009, 58(5): 2435-2442.
    Abdulla M and Simon R. The impact of intercontact time within opportunistic networks: protocol implications and mobility models[R]. TechRepublic White Paper, 2009.
    Spyropoulos T, Psounis K, and Raghavendra C. Performance analysis of mobility-assisted routing[C]. Proceedings of the ACM Mobihoc, Los Angeles, USA, 2006: 49-60.
  • 加载中
计量
  • 文章访问数:  1432
  • HTML全文浏览量:  135
  • PDF下载量:  444
  • 被引次数: 0
出版历程
  • 收稿日期:  2014-07-25
  • 修回日期:  2014-12-11
  • 刊出日期:  2015-06-19

目录

    /

    返回文章
    返回