ATBAS: an efficient fair bandwidth allocation approach for multihop wireless ad hoc network

Authors:
Xiaomei Zhang;Liansheng Tan;Jie Li;Sufen Zhao;Hsiao-Hwa Chen
Affiliations:
Department of Computer Science, Central China Normal University, Wuhan 430079, China.;Department of Computer Science, Central China Normal University, Wuhan 430079, China.;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Japan.;Department of Computer Science, Central China Normal University, Wuhan 430079, China;National Cheng Kung University, Tainan, Taiwan
Venue:
International Journal of Sensor Networks
Year:
2008

Citing 5
Cited 1

Bandwidth allocation in wireless networks with guaranteed packet-loss performance

IEEE/ACM Transactions on Networking (TON)
Distributed multi-hop scheduling and medium access with delay and throughput constraints

Proceedings of the 7th annual international conference on Mobile computing and networking
Price-Based Channel Time Allocation in Wireless LANs

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Dynamic bandwidth management in single-hop ad hoc wireless networks

Mobile Networks and Applications
Price-based resource allocation in wireless ad hoc networks

IWQoS'03 Proceedings of the 11th international conference on Quality of service

A survey of communication/networking in Smart Grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The application of multihop Wireless Ad Hoc Networks (WANETs) has been facing a great challenge to implement cooperative control over user transmission rates under the resource restrictions. In this paper, we propose an efficient bandwidth allocation scheme called Active-Time-Based Bandwidth Allocation Scheme (ATBAS) that can ensure fair bandwidth allocation among the users in a multihop WANET model. This scheme operates at each hop and fairly allots each competing flow a part of channel time, according to which each hop then computes the updating rate for each flow traversing the hop and records their updated rates into each data packet's special control header. The source of each flow in this scheme can eventually adjust its sending rate to reach its fair share. An algorithm is developed to implement the above mechanism. We will show through simulation results that our proposed algorithm is able to fairly distribute bandwidth among multihop flows.