Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks

Authors:
Paola Cappanera;Luciano Lenzini;Alessandro Lori;Giovanni Stea;Gigliola Vaglini
Affiliations:
Dipartimento di Sistemi e Informatica, University of Florence, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Italy
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2013

Citing 21
Cited 0

A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Generalized Bundle Methods

SIAM Journal on Optimization
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems

INFORMS Journal on Computing
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Algorithmic aspects of capacity in wireless networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Coloring unstructured radio networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
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
Gateway Placement with QoS Constraints in Wireless Mesh Networks

ICN '08 Proceedings of the Seventh International Conference on Networking
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Real-Time Video Surveillance over IEEE 802.11 Mesh Networks

RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Delay aware link scheduling for multi-hop TDMA wireless networks

IEEE/ACM Transactions on Networking (TON)
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Connection-based scheduling for supporting real-time traffic in wireless mesh networks

IEEE Transactions on Wireless Communications
Designing multihop wireless backhaul networks with delay guarantees

Wireless Networks
Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule

INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal link scheduling for real-time traffic in wireless mesh networks in both per-flow and per-path frameworks

WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks

Computer Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

IEEE Journal on Selected Areas in Communications
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-nonlinear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4x4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspective, and to investigate how the schedulability is affected by the transmission range.