Abstract
The prime provocation during evolvement of latest routing protocol for opportunistic networks (Oppnets) is the arbitrary behavior of network topology. The fulfillment of already present routing protocols is limited by constituents such as irregular connectivity and bounded bandwidth. The gateway access protocol (GAP) is introduced which is a latest factor cognizant routing protocol. The proposed protocol proficiently merges the assistance of probability-based routing along with genetic algorithm for providing direction to message, to let it reach the target. The genetic algorithm is used by this protocol for anticipating the route, the information would prefer when relocated to the adjacent node. The effectiveness of speculated route is estimated by fitness function. The condition is that information is only forwarded on to the nearest node if the threshold value is lesser than the fitness value for the anticipated route. The value of threshold is determined by enacting the postulates present in probabilistic routing. The facsimile outcome depicts that gateway access protocol of routing surpass PRoPHET, geographic and energy aware routing (GAER) protocol, and Spray and Wait as to conveyance ratio of message, standard latency along with overhead ratio.
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
References
Lilien L, Gupta A, Yang Z (2007) Opportunistic networks for emergency applications and their standard implementation framework. In: 2007 IEEE international performance, computing, and communications conference. IEEE, pp 588–593
Toh C. K (2001) Ad hoc mobile wireless networks: protocols and systems, 1st edn. Prentice Hall PTR, Englewood Cliffs
Lilien L, Kamal ZH, Bhuse V, Gupta A (2007) The concept of opportunistic networks and their research challenges in privacy and security. In: Mobile and wireless network security and privacy. Springer, Boston, MA, pp 85–117
Dhurandher SK, Sharma DK, Woungang I, Gupta R, Garg S (2014) GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks. J Supercomput 69(3):1183–1214
Huang CM, Lan KC, Tsai CZ (2008) A survey of opportunistic networks. In: 22nd International Conference on Advanced Information Networking and Applications-Workshops (AINA). IEEE, pp 1672–1677
Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Comput Commun Rev 7(3):19–20
Dhurandher SK, Borah S, Woungang I, Sharma DK (2016) EDR: An encounter and distance based routing protocol for opportunistic networks. In: Proceedings of 30th International Conference on Advanced Information Networking and Applications-Workshops (AINA). IEEE
Boldrini C, Conti M, Jacopini J, Passarella A (2007) Hibop: a history-based routing protocol for opportunistic networks. In: 2007 IEEE international symposium on a world of wireless, mobile, and multimedia networks. IEEE, pp 1–12
Dhurandher SK, Sharma DK, Woungang I, Bhati S (2013) HBPR: History based prediction for routing in infrastructure-less opportunistic networks. In: Proceedings. of 27th International Conference on Advanced Information Networking and Applications-Workshops (AINA), IEEE. Spain, pp 931–936
Keranen A (2008) Opportunistic network environment simulator. Special assign–ment report. Helsinki University of Technology, Department of Communication Networking
Avasthi S, Chauhan R, Acharjya DP (2021) Techniques, applications, and issues in mining large-scale text databases. In: Advances in information communication technology and computing. Springer, Singapore pp 385–396
Avasthi S, Chauhan R, Acharjya DP (2021) Processing large text corpus using N-gram language modeling and smoothing. In: Proceedings of the second international conference on information management and machine intelligence. Springer, Singapore, pp 21–32
Nautiyal N, Malik S, Avasthi S, Tyagi E (2021) A dynamic gesture recognition system for mute person. In: Proceedings of the second international conference on information management and machine intelligence. Springer, Singapore, pp 33–39
Gupta A, Bansal A, Naryani D, Sharma DK (2017) CRPO: Cognitive routing protocol for opportunistic networks. In: Proceedings of International conference on high performance compilation, computing and communications (HP3C), Kuala Lumpur, Malaysia
Goyal M, Goyal D, Kumar S (2020) Dragon-AODV: efficient Ad Hoc on-demand distance vector routing protocol using dragon fly algorithm. Soft computing: theories and applications. Springer, Singapore, pp 181–191
Goyal M, Kumar S, Sharma VK, Goyal D (2020) Modified dragon-Aodv for efficient secure routing. In advances in computing and intelligent systems. Springer, Singapore, pp 539–546
Goyal A, Sharma VK, Kumar S (2020) Development of hybrid Ad Hoc on demand distance vector routing protocol in mobile Ad hoc network. Int J Emerg Technol 135–9
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sharma, S., Avasthi, S. (2021). Routing Protocol Based on Probability Along with Genetic Algorithm for Opportunistic Network. In: Kumar, S., Purohit, S.D., Hiranwal, S., Prasad, M. (eds) Proceedings of International Conference on Communication and Computational Technologies. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-16-3246-4_17
Download citation
DOI: https://doi.org/10.1007/978-981-16-3246-4_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-3245-7
Online ISBN: 978-981-16-3246-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)