Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

Abstract

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.

Optimal Node Routing Layouts in Mobile Adhoc Network

“…Step 6: The relay is created by using encryption via key During the incidence of attacks, the potential of network entities to the hash feature investigated by means of using survivability analysis [15]. With the creation of hash chain and virtual signature, cluster oriented key distribution mechanism refers Cluster Based Secure Routing Protocol (CBSRP) [21] became created.…”

“…Hence, DHT primarily based routing protocols primarily based on LID and anchor node determined the bodily intra neighbor relationship to limit the stretch ratio, routing overhead, cease to end put off. The extension of DHT blanketed the light-weight gossip protocol to offer the disbursed spatial index referred to geo-availability grid [15]. The evaluation of Geo-availability back the set of garage nodes in which spatial records protected query barriers.…”

“…The identity based key mechanism is the easy public key management for the discount of reminiscence storage and price. But high level of safety warranty calls for the utilization of facts path statistics in routing validation [15][16][17][18][19][20][21]. The network traffic minimization is the important standards inside the layout of MANET.…”

“…A research painting on DHT investigates the security, velocity with the provision of Classified Source Routing (CSR) and a modified finger desk. The extension of DHT to multi-index hashing and hash tree gives the fastest search in hamming area and higher matching performance [12][13][14][15][16][17][18][19].…”

Distributed Destination Search Routing for 5G and beyond Networks

“…There are many reactive routing protocols in the literature to search a route within the network area [14][15][16]. The conventional approach is to locate the destination with simple flooding, in which the source node broadcasts the RREQ packet in the entire network.…”