JOURNAL ARTICLE

End-to-end throughput optimization in multi-hop wireless ad hoc networks

Abstract

In this paper, a simple yet efficient algorithm called Active Relinquish Scheme (ARS) is proposed to enhance the end-to-end throughput of multi-hop ad hoc networks. The principle of our scheme is to equalize the throughput of each node through a multi-hop flow. Consequently, the fairness of the network is improved. Simulation results through OPNET show that our scheme works well in different kinds of topologies, regardless of the scale of the network.

Keywords:
Computer science Wireless ad hoc network Computer network Hop (telecommunications) Maximum throughput scheduling Throughput Scheme (mathematics) Network topology Distributed computing Node (physics) Mobile ad hoc network Wireless network Wireless Quality of service Network packet Engineering Telecommunications Dynamic priority scheduling Mathematics

Metrics

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

Citation History

Topics

Wireless Networks and Protocols
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.