ORIGINAL RESEARCH Synthesized hybrid ZRP through aggregated routes Deepa Mehta 1 • Indu Kashyap 1,2 • Sherin Zafar 1,2 Received: 17 May 2017 / Accepted: 20 November 2017 Ó Bharati Vidyapeeth’s Institute of Computer Applications and Management 2017 Abstract Routing issues pertaining to Mobile adhoc net- works (MANET) have been under scrutiny over the past many years. The rigorous researches have yielded proac- tive and reactive protocols but with various pros and cons in different network conditions. A set of protocols com- bining the advantages of both reactive and proactive were designed to handle security and QOS issues. Out of the hybrid protocols, ZRP has emerged as a highly capable hybrid routing protocol with limited proactive scope due to the formation of zones. However, the existence of over- lapping zones and a few more hindrances leave some scope for modifications, required to enhance the performance of ZRP. This paper focuses to resolve the drawback by aggregating the routes into a central entity chosen ran- domly. The algorithm for synthesizing route aggregation in ZRP starts with formation of additional zones where the participating nodes act as members of the aggregation. Then the zone head is selected for the newly formed nodes, followed by aggregation of all the routes and then buffering them to the link state table. This process is stopped with the active zone head otherwise the above procedure is continued. Keywords ZRP Á Route aggregated ZRP Á Aggregation Á QOS 1 Introduction The proliferation of technology has manifested the mar- ketability of infrastructure less multihop wireless networks [1] also known as adhoc networks [2, 3]. The augmented popularity owes itself to the flexibility of economical net- work formation in emergency situations such as disaster management, search and rescue operations, various edu- cational operations such as Conferences, Meetings etc. The feasibility of infrastructure less operation is based on the specifically designed routing protocols defining the func- tionality of how to control the participating nodes to determine the method to route packets between source and destination. One of the adhoc routing [4] method is proactive routing [5] which involves the maintenance of latest routes to all nodes in a routing table. The limitation of this protocol [6] is, in the case of large networks, the maintenance of routing information becomes too heavy and bandwidth consuming [7]. Another routing method is called reactive routing [8, 9] which involves the initiation of route discovery only when demanded for. This is done with the help of ROUTE REQUEST packets. The problems faced by this methodology is the time consumed while procuring the route hence introduction of delay [10] and hence latency [11] problems. There is also a possibility of network flooding in case of too many ROUTE REQUESTS. The third type of routing method called the hybrid routing [12] consolidates the desirable features of both the above-mentioned types into its operation and manages a tradeoff between the high overhead and latency. However, hybrid protocols have effectively been able to & Deepa Mehta deepa.mehta12@gmail.com Indu Kashyap indu.fet@mriu.edu.in Sherin Zafar zafarsherin@gmail.com 1 Manav Rachna International University, Faridabad, Haryana, India 2 Jamia Hamdard, New Delhi, India 123 Int. j. inf. tecnol. https://doi.org/10.1007/s41870-017-0064-1