Abstract

We propose a new scheme to reduce route discovery latency for reactive routing protocols, named HOp-based adaptive reduction (HOBAR). In the route discovery phase of reactive routing protocols, source nodes spend extra waiting time to get optimal routes after receiving the first route reply. Our scheme appropriately sets this waiting time period depending on the number of hops in the first route reply. Our simulation results show that HOBAR offers fewer hop routes, significantly reduces route discovery latency, and is more scalable in highly loaded and large networks.

Keywords:
Computer science Computer network Scalability Latency (audio) Hop (telecommunications) Routing Information Protocol Routing protocol Distributed computing Dynamic Source Routing Link-state routing protocol Routing (electronic design automation) Telecommunications

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
11
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Hop by Hop Routing Problems in MANETs

Hamdy H. El-Sayed

Journal:   Applied Mathematics & Information Sciences Letters Year: 2017 Vol: 5 (2)Pages: 57-61
JOURNAL ARTICLE

CPRM: Cooperative Position based Routing scheme for MANETs

Ginumol JoseProf. Kuttyamma A J

Journal:   IOSR Journal of Computer Engineering Year: 2014 Vol: 16 (4)Pages: 64-70
JOURNAL ARTICLE

PARS: Position based Anonymous Routing Scheme in MANETs

S RemyaK S Lakshmi

Journal:   IOSR Journal of Computer Engineering Year: 2014 Vol: 16 (3)Pages: 75-82
© 2026 ScienceGate Book Chapters — All rights reserved.