A location Prediction-based routing scheme for opportunistic networks in an IoT scenario

被引:24
作者
Dhurandher, Sanjay K. [1 ]
Borah, Satya J. [1 ]
Woungang, I. [2 ]
Bansal, Aman [1 ]
Gupta, Apoory [1 ]
机构
[1] Univ Delhi, Netaji Subhas Inst Technol, Div Informat Technol, CAITFS, Delhi, India
[2] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
关键词
Opportunistic networks (OppNets); Opportunistic loT systems; Markov chain; Epidemic; Prophet; HBPR; ProWait; Delay-tolerant networks (DTN); INTERNET;
D O I
10.1016/j.jpdc.2017.08.008
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Opportunistic Internet of Things (OppIoT) is a paradigm, technology, and system that promotes the opportunistic exploitation of interactions between loT devices to achieve increased connectivity, reliability, network capacity, and overall network lifetime. The increased demand for identifying such opportunistic exploitation is illustrated by loT scenarios, where the goal is to recognize when an opportunity for communication is possible, thereby allowing for data forwarding and routing. In an OppIoT system, devising a routing scheme is a challenging task due to the difficulty in guaranteeing the existence of connectivity between devices (nodes) and in identifying an intermediate node as a packet forwarder towards its destination. Considering that opportunistic networks (oppNets) are a subclass of OppIoT and considering IoT scenarios where the opportunistic exploitation of IoT devices is possible even in case the device's presence is uncertain or may change over time, this paper proposes a novel routing scheme for OppNets (called Location Prediction-based Forwarding for Routing using Markov Chain (LPFR-MC)) that can also be used in IoT scenarios. The proposed LPFR-MC scheme considers the node's present location and the angle formed by it and the corresponding source (resp. destination) to predict the node's next location or region using a Markov chain and to determine the probability of a node moving towards the destination. Simulation results are provided, showing that the proposed LPFR-MC outperforms the existing traditional protocols in terms of message delivery probability, hop count, number of messages dropped, message overhead ratio, and average buffer time.
引用
收藏
页码:369 / 378
页数:10
相关论文
共 13 条
[1]  
[Anonymous], CS200006 DUK U
[2]   The Internet of Things: A survey [J].
Atzori, Luigi ;
Iera, Antonio ;
Morabito, Giacomo .
COMPUTER NETWORKS, 2010, 54 (15) :2787-2805
[3]  
Boldrini C, 2007, I S WORLD WIREL MOBI, P78
[4]  
Dhurandher SK, 2015, 2015 12TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS (ICETE), VOL 6, P3
[5]   HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks [J].
Dhurandher, Sanjay K. ;
Sharma, Deepak Kumar ;
Woungang, Isaac ;
Bhati, Shruti .
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, :931-936
[6]   EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks [J].
Dhurandher, Sanjay Kumar ;
Borah, Satya ;
Woungang, Isaac ;
Sharma, Deepak Kumar ;
Arora, Kunal ;
Agarwal, Divyansh .
IEEE 30TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS IEEE AINA 2016, 2016, :297-302
[7]   Opportunistic IoT: Exploring the harmonious interaction between human and the internet of things [J].
Guo, Bin ;
Zhang, Daqing ;
Wang, Zhu ;
Yu, Zhiwen ;
Zhou, Xingshe .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2013, 36 (06) :1531-1539
[8]   A dynamic Markov chain prediction model for delay-tolerant networks [J].
Jeon, Il-kyu ;
Lee, Kang-whan .
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (09) :1-7
[9]  
Keranen A., 2008, OPPORTUNISTIC NETWOR
[10]  
Lindgren A., 2003, ACM SIGMOBILE mobile computing and communications review, V7, P19, DOI DOI 10.1145/961268.961272