A packet scheduling algorithm for max–min fairness in multihop wireless LANs.pdfVIP

Computer Communications 32 (2009) 1437–1444 Contents lists available at ScienceDirect Computer Communications journal homepage: www.else /locate/comcom A packet scheduling algorithm for max–min fairness in multihop wireless LANs Kensaku Wakuda a, Shoji Kasahara a,*, Yutaka Takahashi a, Yoshinobu Kure b, Eisaburo Itakura b a Graduate School of Informatics, Kyoto University, 36-1 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan b B2B Solutions Business Group, Sony Corporation, 4-14-1 Asahi-cho, Atsugi-shi, Kanagawa 243-0014, Japan a r t i c l e i n f o a b s t r a c t Article history: In this paper, we propose a probabilistic packet scheduling scheme achieving max–min fairness without Received 7 May 2008 changing the existing IEEE 802.11 medium access control (MAC) protocol. In the proposed scheme, pack- Received in revised form 24 April 2009 ets at each wireless node are managed on a per-flow basis. When a wireless node is ready to send a Accepted 24 April 2009 packet, the packet scheduler of the node is likely to select the queue whose number of packets sent in Available online 3 May 2009 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 Keywords: of the proposed scheme by ns-2. The numerical examples show that our proposed