arXiv 1502.024262015-02-09cs.DScs.DCcs.NI

Simple Distributed Delta + 1 Coloring in the SINR Model

Fabian Fuchs, Roman Prutkin

英文摘要：

In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree Delta, a Delta + 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose Delta + 1 coloring algorithms for the synchronous and asynchronous setting. All algorithms have a runtime of O(Delta log n) time slots. This improves on the 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 a lower bound).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Arbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS

In the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few algorithmic results are known. In this paper we consider nodes with arbitrary, possibly variable, transmission power in the so-called physical or SINR model. Our first result is a bound on the probabilistic interference from all simultaneously transmitting nodes on receivers. This result implies that current local broadcasting algorithms can be generalized to the cas…

2014-04-28cs.DS

Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

We consider coloring problems in the distributed message-passing setting. The previously-known deterministic algorithms for edge-coloring employed at least (2Delta - 1) colors, even though any graph admits an edge-coloring with Delta + 1 colors [V64]. Moreover, the previously-known deterministic algorithms that employed at most O(Delta) colors required superlogarithmic time [B15,BE10,BE11,FHK15]. In the current paper we devise deterministic edge-coloring algorithms that employ only Delta + o(Delta) colors, for a very wide family of graphs. Specifically, as long as the arboricity is a = O(Delta…

2016-10-21cs.DCcs.DS

Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks

In this paper we evaluate distributed node coloring algorithms for wireless networks using the network simulator Sinalgo [by DCG@ETHZ]. All considered algorithms operate in the realistic signal-to-interference-and-noise-ratio (SINR) model of interference. We evaluate two recent coloring algorithms, Rand4DColor and ColorReduction (in the following ColorRed), proposed by Fuchs and Prutkin in [SIROCCO'15], the MW-Coloring algorithm introduced by Moscibroda and Wattenhofer [DC'08] and transferred to the SINR model by Derbel and Talbi [ICDCS'10], and a variant of the coloring algorithm of Yu et al.…

2015-11-13cs.DS

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

The problem of coloring the edges of an $n$-node graph of maximum degree $Δ$ with $2Δ- 1$ colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this problem, the dependency of the running time on $Δ$ has been a long-standing open question. Very recently, Kuhn [SODA '20] showed that the problem can be solved in time $2^{O(\sqrt{\logΔ})}+O(\log^* n)$. In this paper, we study the edge coloring problem in the distributed LOCAL model. We show that the $(\mathit{degree}+1)$-list edge colori…

2020-02-25cs.DCcs.DS

带宽限制下的分布式Delta着色

Distributed Delta-Coloring under Bandwidth Limitations

针对带宽受限分布式场景下的最大度Δ图Δ着色问题，提出CONGEST模型下poly log log n轮随机算法，接近已有下界，核心是归约为构造性LLL特殊实例与deg+1列表着色问题。

2024-05-16cs.DCcs.DS

迈向最优分布式 $Δ$-染色

Towards Optimal Distributed Delta Coloring

针对常数度图分布式染色问题，提出一种适用于稠密图的 $O(\log n)$ 轮确定性 $Δ$-染色算法，匹配已知下界，并扩展出匹配下界的随机化算法，为解决一般情况的最优算法提供了新思路。

2025-04-03cs.DCcs.DS

更多相关论文收起更多论文

Approximate Graph Coloring by Semidefinite Programming

We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on $n$ vertices with min O(Delta^{1/3} log^{1/2} Delta log n), O(n^{1/4} log^{1/2} n) colors where Delta is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the first non-trivial approximation result as a function of the maximum degree Delta. This result can be generalized to k-colorable graphs to obtain a coloring using min O(Delta^{1-2/k} log^{1/2} Delta log n), O(…

1998-12-08cs.DS

Jamming-Resistant Learning in Wireless Networks

We consider capacity maximization in wireless networks under adversarial interference conditions. There are n links, each consisting of a sender and a receiver, which repeatedly try to perform a successful transmission. In each time step, the success of attempted transmissions depends on interference conditions, which are captured by an interference model (e.g. the SINR model). Additionally, an adversarial jammer can render a (1-delta)-fraction of time steps unsuccessful. For this scenario, we analyze a framework for distributed learning algorithms to maximize the number of successful transmis…

2013-07-23cs.DScs.GTcs.NI

算法简化：网络流与NP完全性在现实调度问题中的应用

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems

本文通过网络流和NP完全性分析，解决现实中的医院患者分配和大学课程安排问题，并提供高效的算法方案与实验验证。

2026-01-11cs.DS

On the Locality of Some NP-Complete Problems

We consider the distributed message-passing {LOCAL} model. In this model a communication network is represented by a graph where vertices host processors, and communication is performed over the edges. Computation proceeds in synchronous rounds. The running time of an algorithm is the number of rounds from the beginning until all vertices terminate. Local computation is free. An algorithm is called {local} if it terminates within a constant number of rounds. The question of what problems can be computed locally was raised by Naor and Stockmayer \cite{NS93} in their seminal paper in STOC'93. Si…

2012-04-30cs.DCcs.DS