A venues-aware message routing scheme for delay-tolerant networks

被引:1
作者
Niu, Jianwei [1 ]
Liu, Mingzhu [1 ]
Liu, Yazhi [2 ]
Shu, Lei [3 ]
Wu, Dapeng [4 ]
机构
[1] Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China
[2] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[3] Guangdong Univ Petrochem Technol, Guangdong Petrochem Equipment Fault Diag Key Lab, Maoming 525000, Peoples R China
[4] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL USA
基金
中国国家自然科学基金;
关键词
delay tolerant networks; message forwarding; Markov chain; mobility model;
D O I
10.1002/wcm.2454
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With their proliferation and increasing capabilities, mobile devices with local wireless interfaces can be organized into delay-tolerant networks (DTNs) that exploit communication opportunities arising out of the movement of their users. As the mobile devices are usually carried by people, these DTNs can also be viewed as social networks. Unfortunately, most existing routing algorithms for DTNs rely on relatively simple mobility models that rarely consider these social network characteristics, and therefore, the mobility models in these algorithms cannot accurately describe users' real mobility traces. In this paper, we propose two predict and spread (PreS) message routing algorithms for DTNs. We employ an adapted Markov chain to model a node's mobility pattern and capture its social characteristics. A comparison with state-of-the-art algorithms demonstrates that PreS can yield better performance in terms of delivery ratio and delivery latency, and it can provide a comparable performance with the epidemic routing algorithm with lower resource consumption. Copyright (C) 2013 John Wiley & Sons, Ltd.
引用
收藏
页码:1695 / 1710
页数:16
相关论文
共 37 条
[21]   How small labels create big improvements [J].
Hui, Pan ;
Crowcroft, Jon .
FIFTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2007, :65-+
[22]   Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet [J].
Juang, P ;
Oki, H ;
Wang, Y ;
Martonosi, M ;
Peh, LS ;
Rubenstein, D .
ACM SIGPLAN NOTICES, 2002, 37 (10) :96-107
[23]  
Jungkeun Yoon, 2006, MobiSys2006. The Fourth International Conference on Mobile Systems, Applications and Services, P177, DOI 10.1145/1134680.1134699
[24]  
Keranen A., 2009, P SIMUTOOLS, P1, DOI 10.4108/ICST.SIMUTOOLS2009.5674
[25]  
Lindgren A., 2003, ACM SIGMOBILE mobile computing and communications review, V7, P19, DOI DOI 10.1145/961268.961272
[26]  
Liu C, 2008, MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P351
[27]  
Mtibaa A., 2010, P 29 C INFORM COMMUN, P111
[28]   Encounter-Based Routing in DTNs [J].
Nelson, Samuel C. ;
Bakht, Mehedi ;
Kravets, Robin .
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :846-854
[29]   Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times [J].
Samuel, Hany ;
Zhuang, Weihua ;
Preiss, Bruno .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2011,
[30]   Limits of Predictability in Human Mobility [J].
Song, Chaoming ;
Qu, Zehui ;
Blumm, Nicholas ;
Barabasi, Albert-Laszlo .
SCIENCE, 2010, 327 (5968) :1018-1021