A packet scheduling algorithm for max-min fairness in multihop wireless LANs

Authors:
Kensaku Wakuda;Shoji Kasahara;Yutaka Takahashi;Yoshinobu Kure;Eisaburo Itakura
Affiliations:
Graduate School of Informatics, Kyoto University, 36-1 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan;Graduate School of Informatics, Kyoto University, 36-1 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan;Graduate School of Informatics, Kyoto University, 36-1 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan;B2B Solutions Business Group, Sony Corporation, 4-14-1 Asahi-cho, Atsugi-shi, Kanagawa 243-0014, Japan;B2B Solutions Business Group, Sony Corporation, 4-14-1 Asahi-cho, Atsugi-shi, Kanagawa 243-0014, Japan
Venue:
Computer Communications
Year:
2009

Citing 4
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Rate Performance Objectives of Multihop Wireless Networks

IEEE Transactions on Mobile Computing
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?

IEEE Communications Magazine

An improved security-aware packet scheduling algorithm in real-time wireless networks

Information Processing Letters

Quantified Score

Hi-index	0.25

Visualization

Abstract

In this paper, we propose a probabilistic packet scheduling scheme achieving max-min fairness without changing the existing IEEE 802.11 medium access control (MAC) protocol. In the proposed scheme, packets at each wireless node are managed on a per-flow basis. When a wireless node is ready to send a packet, the packet scheduler of the node is likely to select the queue whose number of packets sent in a certain time is the smallest. If the selected queue has no packet, the node defers the transmission by a fixed duration. In order to verify the improvement in per-flow fairness, we evaluate the performance of the proposed scheme by ns-2. The numerical examples show that our proposed scheme achieves better per-flow fairness than the existing schemes in networks of not only chain topologies but also random topologies.