中国邮电高校学报(英文)

中国邮电高校学报(英文) ›› 2014, Vol. 21 ›› Issue (1): 67-73.doi: 10.1016/S1005-8885(14)60270-3

• Networks • 上一篇    下一篇

Routing protocol based on social characteristics for opportunistic networks

程刚1,宋梅1,张勇1XING Yi-hai2, BAO Xu-yan1   

  1. 1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. Potevio Institute of Technology company Limited, Beijing 100876, China
  • 收稿日期:2013-06-25 修回日期:2013-10-11 出版日期:2014-02-28 发布日期:2014-02-28
  • 通讯作者: 程刚 E-mail:chenggangby@gmail.com
  • 基金资助:

    This work was supported by the National Natural Science Foundation of China (61171097), and the State Major Science and Technology Special Projects (2012ZX03004001).

Routing protocol based on social characteristics for opportunistic networks

  1. 1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. Potevio Institute of Technology company Limited, Beijing 100876, China
  • Received:2013-06-25 Revised:2013-10-11 Online:2014-02-28 Published:2014-02-28
  • Contact: Gang CHENG E-mail:chenggangby@gmail.com
  • Supported by:

    This work was supported by the National Natural Science Foundation of China (61171097), and the State Major Science and Technology Special Projects (2012ZX03004001).

摘要：

Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people’s movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes’ mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.

关键词:

opportunistic networks, delay tolerant networks, social characteristics, Markov chain, transition probability

Abstract:

Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people’s movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes’ mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.

Key words:

opportunistic networks, delay tolerant networks, social characteristics, Markov chain, transition probability

版权所有 © 2020 中国邮电高校学报(英文)编辑部　
　 地址：北京邮电大学图书馆1层119 室　邮政编码：100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持：support@magtech.com.cn