JOURNAL ARTICLE

Fairness improvement in long chain multihop wireless ad hoc networks

Abstract

In asymmetric multihop wireless ad hoc networks the original medium access control protocol does not perform well, especially when the offered load is high. Many papers have studied this issues, and premeditated to obtain better fairness in multihop wireless ad hoc networks. These techniques provide some degree of fairness but either provide low throughput or assume MAC layer fairness and hence need improvements. In this paper we have proposed a new method based probabilistic control on round robin queue, and have obtained better results in terms of fairness. Our proposed method perform better than FIFO scheduling, RR scheduling, and PCRQ scheduling. For evaluating the performance of the proposed method, we have used Network Simulator version-2 (NS-2). Simulation results have shown that our proposed method produces higher degree of fairness.

Keywords:
Computer science Maximum throughput scheduling Wireless ad hoc network Fairness measure Computer network Scheduling (production processes) Ad hoc wireless distribution service Fair queuing Max-min fairness Distributed computing Wireless network Queue Optimized Link State Routing Protocol Mobile ad hoc network Vehicular ad hoc network Wireless Round-robin scheduling Throughput Dynamic priority scheduling Network packet Quality of service Mathematical optimization Resource allocation

Metrics

22
Cited By
3.62
FWCI (Field Weighted Citation Impact)
10
Refs
0.94
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
Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.