Scheduling links for heavy traffic on interfering routes in wireless mesh networks

Authors:
Fabio R. J. Vieira;José F. de Rezende;Valmir C. Barbosa;Serge Fdida
Affiliations:
Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972 Rio de Janeiro - RJ, Brazil and Laboratoire d'Informatique d ...;Programa de Engenharia Elétrica, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68504, 21941-972 Rio de Janeiro - RJ, Brazil;Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972 Rio de Janeiro - RJ, Brazil;Laboratoire d'Informatique de Paris 6, 4, Place Jussieu, 75252 Paris Cedex 05, France
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2012

Citing 25
Cited 2

Concurrency in heavily loaded neighborhood-constrained systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to distributed algorithms

An introduction to distributed algorithms
An Atlas of Edge-Reversal Dynamics

An Atlas of Edge-Reversal Dynamics
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control meets SINR: the scheduling complexity of arbitrary topologies

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Wireless hotspots: current challenges and future directions

Mobile Networks and Applications - Special issue: Wireless mobile wireless applications and services on WLAN hotspots
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Resource-sharing system scheduling and circular chromatic number

Theoretical Computer Science
Beyond the Future Internet--Requirements of Autonomic Networking Architectures to Address Long Term Future Networking Challenges

FTDCS '07 Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems
Joint bandwidth allocation, element assignment and scheduling for wireless mesh networks with MIMO links

Computer Communications
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

Journal of Parallel and Distributed Computing
Exact and approximate link scheduling algorithms under the physical interference model

Proceedings of the fifth international workshop on Foundations of mobile computing
Embracing interference in ad hoc networks using joint routing and scheduling with multiple packet reception

Ad Hoc Networks
Graph Theory

Graph Theory
How to correctly use the protocol interference model for multi-hop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Wireless link scheduling under a graded SINR interference model

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms

Ad Hoc Networks
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation

Networks - Network Optimization (INOC 2007)
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky

IEEE Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
MAC protocols for wireless sensor networks: a survey

IEEE Communications Magazine
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Local heuristic for the refinement of multi-path routing in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider wireless mesh networks and the problem of scheduling the links of a given set of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol provides a background of synchronized time slots and seek to schedule the routes' links to maximize the number of packets that get delivered to their destinations per time slot. Our approach is to construct an undirected graph G and to heuristically obtain node multicolorings for G that can be turned into efficient link schedules. In G each node represents a link to be scheduled and the edges are set up to represent every possible interference for any given set of interference assumptions. We present two multicoloring-based heuristics and study their performance through extensive simulations. One of the two heuristics is based on relaxing the notion of a node multicoloring by dynamically exploiting the availability of communication opportunities that would otherwise be wasted. We have found that, as a consequence, its performance is significantly superior to the other's.