Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Fair scheduling in wireless packet networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Adapting packet fair queueing algorithms to wireless networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A wireless fair service algorithm for packet cellular networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling multimedia services in a low-power MAC for wireless andmobile ATM networks
IEEE Transactions on Multimedia
The Demand Priority MAC protocol
IEEE Network: The Magazine of Global Internetworking
Multiple Channel Scheduling in UWB based IEEE 802.15.3 Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Access control in heterogeneous multichannel wireless networks
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Hi-index | 0.24 |
This paper describes algorithms for scheduling traffic in wireless data networks with multiple channels per cell. The paper assumes that a reservation-based medium access control protocol is used. The main objective of the scheduling algorithms is to reduce the computation time while maximizing the utilization of the network resources, thereby improving the system throughput. The scheduling problem is presented as a variant of the bin-packing problem. In this paper, we consider two type of algorithms-contiguous and non-contiguous allocations. The algorithms are studied for wireless networks with single priority traffic and multiple priority traffic. A performance study that considers network utilization, computation time, and the throughput for 10 and 54Mbps data-streams is presented. The results show that both the proposed algorithms perform better than MULTI-FIT in terms of overall throughput and computation time; and that the non-contiguous allocation performs better than the contiguous algorithm since the former results in smaller number of wasted slots.