Simple Distributed Δ + 1 Coloring in the SINR Model

Conference paper

DOI: 10.1007/978-3-319-25258-2_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9439)
Cite this paper as:
Fuchs F., Prutkin R. (2015) Simple Distributed Δ + 1 Coloring in the SINR Model. In: Scheideler C. (eds) Structural Information and Communication Complexity. SIROCCO 2015. Lecture Notes in Computer Science, vol 9439. Springer, Cham

Abstract

In wireless ad hoc networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree Δ, a Δ + 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose a very simple 4Δ coloring along with a color reduction technique to achieve Δ + 1 colors. All algorithms have a runtime of \(\mathcal{O}(\Delta \log n)\) time slots. This improves on previous algorithms for the SINR model either in terms of the number of required colors or the runtime, and matches the runtime of local broadcasting in the SINR model (which can be seen as an asymptotical lower bound).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Karlsruhe Institute for Technology (KIT)KarlsruheGermany

Personalised recommendations