Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

Authors:
J. Czyzowicz;S. Dobrev;E. Kranakis;J. Opatrny;J. Urrutia
Affiliations:
Département dinformatique, Université du Québec en Outaouais, Gatineau, QC, J8X 3X7, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, K1N 6N5, Canada;School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada;Department of Computer Science, Concordia University, Montréal, QC, H3G 1M8, Canada;Instituto de Matemáticas, Universidad Nacional Autónoma de México, Área de la investigación cientifica, Circuito Exterior, Ciudad Universitaria, Coyoacán 04510, D.F. ...
Venue:
Theoretical Computer Science
Year:
2009

Citing 11
Cited 2

Locality in distributed graph algorithms

SIAM Journal on Computing
What Can Be Computed Locally?

SIAM Journal on Computing
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Localized construction of bounded degree and planar spanner for wireless ad hoc networks

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels

IEEE/ACM Transactions on Networking (TON)
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Local construction of planar spanners in unit disk graphs with irregular transmission ranges

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Localized Delaunay triangulation with application in ad hoc wireless networks

IEEE Transactions on Parallel and Distributed Systems

Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Survey of local algorithms

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	5.24

Visualization

Abstract

The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disk Graphs. These are geometric graphs such that for some positive integers l,k the following property holds at each node v: if we partition the unit circle centered at v into 2k equally sized wedges then each wedge can contain at most l points different from v. We assume that the nodes are location aware, i.e. they know their Cartesian coordinates in the plane. The algorithm presented is local in the sense that each node can receive information emanating only from nodes which are at most a constant (depending on k and l, but not on the size of the graph) number of hops (measured in the original underlying Unit Disk Graph) away from it, and hence the algorithm terminates in a constant number of steps. The number of colours used is 2kl+1 and this is optimal for local algorithms (since the maximal degree is 2kl and a colouring with 2kl colours can only be constructed by a global algorithm), thus showing that in this class of graphs the price for locality is only one additional colour.