Credit-based slot allocation for multimedia mobile ad hoc networks

Authors:
Hsi-Lu Chao;Wanjiun Liao
Affiliations:
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 8

Optimizing transmission and shutdown for energy-efficient real-time packet scheduling in clustered ad hoc networks

EURASIP Journal on Wireless Communications and Networking
A slot allocation strategy for clustered ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
A Scalable Provisioning and Routing Scheme for Multimedia QoS over Ad Hoc Networks

FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
A distributed fair MAC flow allocation and scheduling framework for IEEE 802.11 based wireless mesh networks

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Recent developments and experimental guidelines in mobile ad-hoc networks

International Journal of Wireless and Mobile Computing
Class-based fair code allocation with delay guarantees for OVSF-CDMA and VSF-OFCDM in next-generation cellular networks

EURASIP Journal on Wireless Communications and Networking
A scalable multimedia QoS architecture for ad hoc networks

Multimedia Tools and Applications
An effective cluster-based slot allocation mechanism in ad hoc networks

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper studies resource management for multimedia mobile ad hoc networks (MANET). In particular, we focus on providing fair scheduling with quality-of-service (QoS) support for MANET. We consider two types of flows: guaranteed and best effort flows. The goal is to satisfy the QoS requirements of guaranteed flows and to provide global fairness for best effort flows. In this paper, a credit-based fair scheduling mechanism called credit-based slot allocation protocol (CSAP) is proposed. In CSAP, nodes are logically grouped into clusters, each with a scheduler. Each scheduler assigns time slots to nodes in its cluster based on the first tier algorithm. The node scheduled to send at the next time slot then in turn assigns the time slot to a relayed flow determined by the second-tier algorithm. Each multihop flow is treated as multiple single-hop flow segments. These segments are then correlated such that a downstream segment will not be allocated a slot unless the upstream segments have all been allocated. We evaluate the performance of CSAP by simulations. The results show that CSAP meets the QoS requirements of guaranteed flows, provides global fairness for best effort flows, and improves overall system throughput.