Weighted flow contention graph and its applications in wireless ad hoc networks

Authors:
Zeng Guo-kai;Xu Yin-long;Wu Ya-feng;Wang Xi
Affiliations:
Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, Hefei, P.R.China;Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, Hefei, P.R.China;Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, Hefei, P.R.China;Department of Computer Science & Technology, University of Science & Technology of China, National High Performance Computing Center at Hefei, Hefei, P.R.China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 7
Cited 0

Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A topology-independent fair queueing model in ad hoc wireless networks

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
A packet scheduling approach to QoS support in multihop wireless networks

Mobile Networks and Applications
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Maxmin fair scheduling in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

To fairly schedule flows in ad hoc networks, this paper defines a weighted flow contention graph, in which a maximal weighted independent set is always computed for scheduling. Two fair scheduling algorithms are then presented. One aims at maximizing network lifetime by setting the weight to the remaining energy, while the other tries to minimize the total delay by adopting the number of packets as the weight. Simulations are performed to compare these algorithms with the one based on unweighted flow contention graph [7]. Considering energy consumption, the network lifetime and the number of scheduled packets are improved evidently. While considering the number of packets, the transmission time and the total delay of the algorithm we propose are much less.