A distributed routing protocol for providing QoS in Wireless Mesh Networks operating above 10 GHz

Authors:
Markos P. Anastasopoulos;Athanasios D. Panagopoulos;Panayotis G. Cottis
Affiliations:
Wireless and Satellite Communications Group, Division of Information Transmission Systems and Materials Technology, School of Electrical & Computer Engineering, National Technical University of At ...;Wireless and Satellite Communications Group, Division of Information Transmission Systems and Materials Technology, School of Electrical & Computer Engineering, National Technical University of At ...;Wireless and Satellite Communications Group, Division of Information Transmission Systems and Materials Technology, School of Electrical & Computer Engineering, National Technical University of At ...
Venue:
Wireless Communications & Mobile Computing
Year:
2008

Citing 0
Cited 2

An autonomic framework for reliable multicast: A game theoretical approach based on social psychology

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A cross-layer routing design for multi-interface wireless mesh networks

EURASIP Journal on Wireless Communications and Networking - Special issue on enabling Wireless Technologies for Green Pervasive Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Wireless Mesh Networks (WMNs) are considered for a plethora of complex applications, where different QoS specifications should be satisfied. In such applications, QoS issues concerning the delay and the reliability of data transmission are of utmost importance. In this paper, a distributed routing protocol for WMNs operating above 10 GHz to support services with distributed QoS is presented. As far as propagation is concerned, the major factor limiting the performance of millimetre wave radio systems is rain attenuation. The routing problem is formulated as a problem of linear programming, where the objective is to determine the path with minimum transmission delay while at the same time, satisfying a given set of constraints. Lagrangian Relaxation and dual decomposition are used to solve the problem in a distributed way. The proposed algorithm exhibits a low computational complexity, it is scalable and guarantees convergence to an optimal routing scheme. Its performance is verified through extended simulations employing an accurate spatial-temporal channel model. Copyright © 2007 John Wiley & Sons, Ltd.