End-to-end real-time traffic scheduling in TDD-based wireless mesh networks

Authors:
Jiaying Song;Xu Li;Zhangdui Zhong;Bo Ai
Affiliations:
Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China;Beijing Jiaotong University, Beijing, China
Venue:
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Year:
2010

Citing 6
Cited 1

Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks

WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
A Distributed Scheduling Algorithm with QoS Provisions in Multi-hop Wireless Mesh Networks

WIMOB '08 Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication
QoS-aware TDMA for end-to-end traffic scheduling in ad hoc networks

IEEE Wireless Communications
A survey on wireless mesh networks

IEEE Communications Magazine
Cross-layer QoS Analysis of Opportunistic OFDM-TDMA and OFDMA Networks

IEEE Journal on Selected Areas in Communications

Review: A comprehensive survey on scheduler for VoIP over WLAN

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe the formatting guidelines for ACM SIG Proceedings. Recently time division duplex based wireless mesh networks (TDD-based WMNs) are emerging as a crucial technology for wireless multihop networks and broadband wireless access (BWA). Supporting real-time traffic in TDD-based WMNs is difficult and one of the main challenges is to provide strict end-to-end time delay guarantee from source node to destination node. In this paper, the cross-layer framework is proposed considering routing schemes, queueing model and resource scheduling schemes. Furthermore, an end-to-end realtime traffic scheduling algorithm is proposed. In the algorithm, a number of control slots are reserved for transmitting real-time routing messages to guarantee delay requirements while data reservation is fulfilled during the process of routing path discovery. Numerical results show that the proposed scheduling algorithm achieves low time delay and can satisfy real-time delay requirements.