Routing protocol based on social characteristics for opportunistic networks  

作　　者：CHENG Gang SONG Mei ZHANG Yong XING Yi-hai BAO Xu-yan 

机构地区：[1]School of Electronic Engineering,Beijing University of Posts and Telecommunications [2]Potevio Institute of Technology company Limited

出　　处：《The Journal of China Universities of Posts and Telecommunications》2014年第1期67-73,103,共8页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61171097);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 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 

分 类 号：TN929.5[电子电信—通信与信息系统]