Energy Efficient Dynamic Route Discovery Protocol for Mobile Ad Hoc Networks

Nishat, Humaira; Rao, D. Sreenivasa

doi:10.5120/8907-2946

Cited by 2 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Destination Search Routing for 5G and beyond Networks

Waqas

Saeed

Mahmood

et al. 2022

Sensors

View full text Add to dashboard Cite

Fifth-generation and beyond networks target multiple distributed network application such as Internet of Things (IoT), connected robotics, and massive Machine Type Communication (mMTC). In the absence of a central management unit, the device need to search and establish a route towards the destination before initializing data transmission. In this paper, we proposes a destination search and routing method for distributed 5G and beyond networks. In the proposed method, the source node makes multiple attempts to search for a route towards the destination by expanding disk-like patterns originating from the source node. The source node increases the search area in each attempt, accommodating more nodes in the search process. As a result, the probability of finding the destination increases, which reduces energy consumption and time delay of routing. We propose three variants of routing for high, medium, and low-density network scenarios and analyze their performance for various network configurations. The results demonstrate that the performance of the proposed solution is better than previously proposed techniques in terms of time latency and reduced energy consumption, making it applicable for 5G and beyond networks.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In the subsequent section, we discuss the proposed routing algorithm in detail. Distributed Routing [15] Waiting time as a function of network density is used to reduce number of rebroadcast of RREQ packets.…”

Section: Related Workmentioning

confidence: 99%

Distributed Destination Search Routing for 5G and beyond Networks

Waqas

Saeed

Mahmood

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…In the event that the energy level is lesser than the edge esteem, at that point a backup way to go will be resolved progressively to course the parcel. Humaira Nishat et al [8] presented an Energy Efficient Dynamic Route Discovery (EEDRD) convention where the introduction of course revelation is done simply in the wake of sending some ideal number of information parcels dependent on the size and energy levels of hubs in the organization. EEDRD displays better execution contrasted with DRD by expanding the organization life expectancy as far as throughput, delay, bundle conveyance proportion and steering overhead.…”

Section: Introductionmentioning

confidence: 99%