Achieving delay and throughput decoupling in distributed fair queueing over ad hoc networks

Author

Cheng, Jerry ; Lu, Songwu

Author_Institution

Comput. Sci. Dept., UCLA, Los Angeles, CA, USA

fYear

2003

fDate

20-22 Oct. 2003

Firstpage

217

Lastpage

222

Abstract

This paper describes an algorithm that achieves delay and throughput decoupling in distributed fair scheduling in multihop ad-hoc wireless networks. The solution allows to support both low-bandwidth, low-delay and high-bandwidth, high delay applications in a single framework, without wasting much bandwidth to realize the low-delay requirement. We demonstrate the effectiveness of our algorithm in servicing various types of applications through ns-2 simulations.

Keywords

ad hoc networks; distributed algorithms; frequency hop communication; queueing theory; scheduling; delay decoupling; distributed fair queueing algorithm; distributed fair scheduling; high delay application; high-bandwidth application; low-bandwidth application; low-delay application; multihop ad-hoc wireless network; ns-2 simulation; throughput decoupling; Ad hoc networks; Bandwidth; Computer science; Delay; Intelligent networks; Scheduling algorithm; Spread spectrum communication; Throughput; Wireless networks; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2003. ICCCN 2003. Proceedings. The 12th International Conference on

ISSN

1095-2055

Print_ISBN

0-7803-7945-4

Type

conf

DOI

10.1109/ICCCN.2003.1284173

Filename

1284173