Strong edge coloring for channel assignment in wireless radio networks

@article{Barrett2006StrongEC,
  title={Strong edge coloring for channel assignment in wireless radio networks},
  author={C. Barrett and V. S. A. Kumar and M. Marathe and Shripad Thite and Gabriel Istrate},
  journal={Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)},
  year={2006},
  pages={5 pp.-110}
}
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network 
A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring
TLDR
This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. Expand
Distance edge coloring and collision-free communication in wireless sensor networks
TLDR
This work investigates the l-distance edge coloring problem on several families of graphs that can be used as topologies in sensor deployment and focuses on determining the minimum number of colors needed and optimal coloring algorithms. Expand
Algorithms for Routing and channel Assignment in Wireless Infrastructure Networks
TLDR
A novel approach based on cycle-embedding is developed to obtain two node-disjoint paths between all source-destination pairs with reduced number of routing table entries maintained at a node, small average path lengths, and less packet overhead. Expand
Joint channel allocation and routing in wireless mesh networks
TLDR
A mixed integer linear programming (MILP) formulation of the channel allocation and routing problem for data transfer in wireless mesh networks with half duplex communication links is proposed to maximize the minimum spare capacity of each link. Expand
Analyzing channel assignment with rearrangement in multi-channel wireless line networks
TLDR
Through extensive simulations, the developed analytical model closely approximates the values obtained through simulations of the blocking performance of a channel assignment scheme in a multi-channel wireless line network. Expand
Two Edge Coloring Algorithms Using a Simple Matching Discovery Automata
  • J. Daigle, S. Prasad
  • Computer Science
  • 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
  • 2012
TLDR
Two probabilistic edge coloring algorithms for a message passing model of distributed computing are presented which find an edge coloring of a graph which is guaranteed to use no more than 2Δ - 1 colors and completes in O( Δ) communication rounds using only one hop information. Expand
QoS aware distributed matching algorithm for link scheduling in wireless networks
  • A. Ghiasian, H. Saidi
  • Computer Science
  • 2009 International Conference on Ultra Modern Telecommunications & Workshops
  • 2009
TLDR
A QoS aware algorithm for link scheduling in wireless networks is proposed that uses generalization and modification to a recently presented distributed matching algorithm which computes the matching in O(1) but does not consider QoS aspects. Expand
Partially Overlapping Channel Assignments in Wireless Mesh Networks
TLDR
This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate. Expand
Distributed Algorithms for TDMA Link Scheduling in Sensor Networks
TLDR
The full duplex link scheduling problem (FDLSP) is formulated as distance-2 edge coloring in bi-directed graphs and tighter lower and upper bounds for the FDLSP problem are proved. Expand
Local Algorithms for Edge Colorings in UDGs
TLDR
This paper develops local distributed approximation algorithms for the edge coloring and the strong edge coloring problems on unit disk graphs and shows that the locality upper bound can be improved to 28 while keeping the same approximation ratio, at the expense of increasing the computation time at each node. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Models and Approximation Algorithms for Channel Assignment in Radio Networks
TLDR
Efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks, including (r,s)-civilized graphs, planar graphs, graphs with bounded genus, etc. Expand
Distance-2 Edge Coloring is NP-Complete
We prove that it is NP-complete to determine whether there exists a distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite 2-inductive graph with girth 6 and maximum degree 3.
On the computational complexity of strong edge coloring
TLDR
This paper proves that the strong edge coloring problem is NP-complete even in a very restricted setting, and a closely related problem, namely the maximum antimatching problem, is studied, and some NP-completeness results and a polynomial time algorithm for a subproblem are derived. Expand
On Coloring Unit Disk Graphs
TLDR
It is shown that the coloring problem for UD graphs remains NP-complete for any fixed number of colors k≥ 3, and a new 3-approximation algorithm for the problem is presented which is based on network flow and matching techniques. Expand
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks
TLDR
This work is the first attempt at characterizing an important "maximum" measure of wireless network capacity, and can be used to shed light on previous topology formation protocols like Span and GAF that attempt to produce "good" or "capacity-preserving" topologies, while allowing nodes to alternate between sleep and awake states. Expand
A polynomial time algorithm for strong edge coloring of partial k-trees
TLDR
Here, it is shown that the strong edge coloring problem is solved in polynomial time on graphs with bounded treewidth, i.e partial k-trees, and answers an open question of Mahdian. Expand
Balanced media access methods for wireless networks
Fairness algorithms and access methods enable non-zero channel access for wireless communication systems operating in a random access channel environment. Fair access to a random access channel forExpand
A Tourist Guide through Treewidth
A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions, algorithms thatExpand
Efficient vertex- and edge-coloring of outerplanar graphs
The problems of finding values of the chromatic number and the chromatic index of a graph are NP-hard even for some restricted classes of graphs. Every outerplanar graph has an associated treeExpand
Scheduling algorithms for multi-hop radio networks
TLDR
New algorithms for transmission scheduling in multihop broadcast radio networks are presented, showing that, for both types of scheduling, the new algorithms (experimentally) perform consistently better than earlier methods. Expand
...
1
2
3
4
...