Abstract
An Opportunistic Network (OppNet) is one of the latest domain of wireless communication where information is transferred from the source to the destination without any infrastructure, internet connectivity and any predefined network topology. The mobile nodes participating in the network contribute in establishing a connectivity between the nodes to transmit the information from the source to the destination using a storecarry and forward mechanism. The nodes store the information in their in-built buffer until a suitable forwarder is available within their wi-fi/bluetooth transmission range. Designing a routing protocol in OppNet is thus a challenging task. This paper proposes a Probabilistic Encounter and Distance-based Routing Protocol (P-EDR) for Opportunistic Networks, which is designed as a combination the ProPHet and the Encounter and Distancebased Routing (EDR) protocols. Simulation results are presented, showing that P-EDR outperforms the EDR, History-based Prediction for Routing (HBPR) and ProPHet routing protocols in terms of message delivery probability, messages overhead ratio and number of messages dropped.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Pelusi, A. Passarella, and M. Conti, Opportunistic networking: data forwarding in disconnected mobile ad hoc networks, IEEE Communications Magazine, vol. 44, Issue 11, November 2006, pp. 134-141.
K. Fall, A Delay-Tolerant Network Architecture for Challenged Internets, in proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, 25-29 August, 2003, pp. 27-34.
S. K. Dhurandher, S. Borah, I.Woungang, D. K. Sharma, K. Arora, and D. Agar-wal, EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks, (Accepted Jan 25, 2016), the 30th IEEE International Conference on Advanced Information Networking and Applications (AINA-2016), Crans-Montana, Switzerland, March 23-25, 2016. To appear.
A. Vahdat, and D. Becker, Epidemic routing for partially connected ad hoc networks, Technical Report CS-2000-06, Dept. of Computer Science, Duke University, Durham, NC, 2000.
T. Spyropoulos, K. Psounis and C. S. Raghavendra, Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, in proceedings of SIGCOMMWorkshop on Delay-Tolerant Networking, Philadelphia, USA, 22-26 Aug.2005, pp. 252-259.
A. Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, ACM IGMOBILE, Mobile Computing and Communications, 2003 Review, vol. 7, Issue 3, pp. 1920.
Sanjay K. Dhurandher, Satya Jyoti Borah, Mohammad S. Obaidat, Fellow of IEEE, Deepak Kr. Sharma, Sahil Gupta and Bikash Baruah Probability-based Controlled Flooding in Opportunistic Networks WINSYS 2015 International Conference on Wireless Information.
S. K. Dhurandher, Deepak Kr. Sharma, I. Woungang, and Shruti Bhati, ”HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks” IEEE 27th International Conference on Advanced Information Networking and Applications(AINA 2013), Barcelona, Spain, pp. 931-936
C. Boldrini, M. Conti, I. Iacopini and A. Passarella, HiBOp: A History Based Routing Protocol for Opportunistic Networks, in proceedings Of IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks, 2007 (WoWMoM 2007), Espoo, Finland,18-21 June 2007, pp. 1-12.
S. K. Dhurandher, D. K. Sharma, I. Woungang, R. Gupta, S. Gupta,”GAER: Genetic Algorithm based Energy-efficient Routing Protocol for Infrastructure-less Opportunistic Networks”, Journal of Supercomputing, Springer, vol. 69, Issue 3, Sept. 2014, pp 1183-1214.
Nelson, S.C.; Bakhat, M.; Kravets, R., ”Encounter-Based Routing in DTNs,” INFOCOM 2009, IEEE, Vol., No., pp.846,854, 19-25 April 2009.
A. Keranen. Opportunistic Network Environment Simulator, Special Assignment Report, Helsinki University of Technology, Dept. of Communications and Networking, May 2008.
A. Keranen, J.Andott, 2007, Opportunistic increasing reality for DTN protocol simulations, Special Technical Report, Helsinki University of Technology, Networking Laboratory.
C. Song, Z. Qu, N. Blumm, and A. Barabasi, Limits of Predictability in Human Mobility”, Science, Vol. 327, February 2010, pp. 1018-1021. and 20.
S. K. Dhurandher, D. K. Sharma, and I. Woungang, ”nnnMobility Models-Based Performance Evaluation of the History Based Prediction for Routing Protocol for Infrastructure-less Opportunistic Networks”, Proc. of 10th Intl. Conference, MOBIQUITOUS 2013, Tokyo, Japan, Dec. 2-4, 2013, pp. 757-767.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dhurandher, S.K. et al. (2017). A Probabilistic Encounter and Distance-based Routing Protocol for Opportunistic Networks. In: Barolli, L., Xhafa, F., Yim, K. (eds) Advances on Broad-Band Wireless Computing, Communication and Applications. BWCCA 2016. Lecture Notes on Data Engineering and Communications Technologies, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-49106-6_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-49106-6_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49105-9
Online ISBN: 978-3-319-49106-6
eBook Packages: EngineeringEngineering (R0)