Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Multicluster, mobile, multimedia radio network
Wireless Networks
Fair Scheduling with QoS Support in Ad Hoc Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
A topology-independent fair queueing model in ad hoc wireless networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
A centralized TDMA-based scheme for fair bandwidth allocation in wireless IP networks
IEEE Journal on Selected Areas in Communications
Credit-based slot allocation for multimedia mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
This work studies the allocation of bandwidth resources in wireless ad hoc networks. The highest-density clustering algorithm is presented to promote reuse of the spatial channel and a new slot allocation algorithm is proposed to achieve conflict-free scheduling for transmissions. Since the location-dependent contention is an important characteristic of ad hoc networks, in this paper we consider this feature of ad hoc networks to present a new cluster formation algorithm, by increasing the number of simultaneous links to enhance spatial channel reuse. Furthermore, because each cluster has its own scheduler and schedulers operate independently of each other, the transmissions may conflict among the clusters. In this paper, we classify the flows by the locations of their endpoints to prevent this problem. Finally, the proposed mechanism is implemented by simulation and the results reveal that the conflicts can be efficiently avoided without global information and the network throughput is improved without violating fairness.