Advanced Search
Volume 37 Issue 6
Jun.  2015
Turn off MathJax
Article Contents
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

Research on Energy-efficient Contact Probing in Delay Tolerant Networks

doi: 10.11999/JEIT140995
  • Received Date: 2014-07-25
  • Rev Recd Date: 2014-12-11
  • Publish Date: 2015-06-19
  • In the Delay Tolerant Networks (DTNs), in order to discover the neighbors, the nodes in the network have to probe the surrounding environment continually. This can be an extremely energy-consuming process. If the nodes probe very frequently, they consume a lot of energy, and may be energy inefficient. On the other hand, infrequent contact probing might cause loss of many contacts, and thus missing the opportunities to exchange data. Therefore, there exists a trade-off between the energy efficiency and contact opportunities in the DTNs. In order to investigate this trade-off, this study first proposes a model to quantify the contact detecting probability when the contact probing interval is constant based on the Random Way-Point (RWP) model. Moreover, this study also demonstrates that the strategy which probes at a constant interval performs the best performance, among all contact probing strategies with the same average contact probing interval. Then, based on the proposed model, this study analyzes the trade-off between the energy efficiency and contact detecting probability under different situations. Finally, extensive simulations are conducted to validate the correctness of the proposed model.
  • loading
  • 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.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1435) PDF downloads(444) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return