Distributed (Δ + 1)-Coloring in the Physical Model

Yu, Dongxiao; Wang, Yuexuan; Hua, Qiang-Sheng; Lau, Francis C. M.

doi:10.1007/978-3-642-28209-6_12

Cited by 25 publications

(30 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the global interference feature of the SINR model makes designing local or distributed algorithms difficult, and there have been only a handful of recent studies [6], [23], [21], [22] assuming the SINR model, let alone for unstructured wireless networks.…”

Section: Related Workmentioning

confidence: 99%

“…Finally, all the leaders which comprise a connected backbone network are responsible for broadcasting the messages. In order to compute the connected dominating set, we execute the MIS (Maximal Independent Set) algorithm in [22] to obtain a maximal independent set in terms of R M /3.…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

“…If v becomes a non-leader after executing the MIS algorithm, it chooses the first node that sent a dominating message to it as the leader, as shown in the MIS algorithm [22]. If initially, v has a message that it wants to share in the network, it starts the local information collection process as shown in Algorithm 3.…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

“…In the above definitions, ϕ is the upper bound of the transmission probability sum of nodes in any disk with radius R M /2 that are executing the MIS algorithm. In [22], it has been proved that ϕ is a known constant less than 1 3 with probability 1−O(n −1 ). χ(R 1 , R 2 ) denotes the number of disks with radius R 2 needed to cover a disk with radius R 1 , where…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

“…In [22], it is shown that as long as the transmission probability sum in any local region can be bounded by a constant, the MIS algorithm is correct even if there are some other algorithms executing concurrently in the network. The following Lemma 1 has been proved and Property 2 is also shown to be correct with probability at least 1 − O(n −1 ) in [22].…”

Section: Algorithmmentioning

confidence: 99%

See 4 more Smart Citations

Efficient distributed multiple-message broadcasting in unstructured wireless networks

Hua

Wang

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-Multiple-message broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured wireless networks under the physical interference model (also known as the SINR model). The unstructured wireless network assumes unknown network topology, no collision detection and asynchronous communications. Our proposed randomized distributed algorithm can accomplish multiple-message broadcast in O((D + k) log n + log 2 n) timeslots with high probability, where D is the network diameter and n is the number of nodes in the network. To our best knowledge, this work is the first one to consider distributively implementing multiplemessage broadcasting in unstructured wireless networks under a global interference model, which may shed some light on how to efficiently solve in general a "global" problem in a "local" fashion with "global" interference constraints in asynchronous wireless ad hoc networks. Apart from the algorithm, we also show an Ω(D+k+log n) lower bound for randomized distributed multiple message broadcast algorithms under the assumed network model.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: A Algorithm Descriptionmentioning

confidence: 99%

Section: A Algorithm Descriptionmentioning

confidence: 99%

Section: A Algorithm Descriptionmentioning

confidence: 99%

Section: Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

Efficient distributed multiple-message broadcasting in unstructured wireless networks

Hua

Wang

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

Local Broadcasting with Arbitrary Transmission Power in the SINR Model

Fuchs

Wagner

2014

Structural Information and Communication Complexity

View full text Add to dashboard Cite

Simple Distributed Δ + 1 Coloring in the SINR Model

Fuchs

Prutkin

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 ∆, a ∆ + 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose ∆ + 1 coloring algorithms for the synchronous and asynchronous setting. All algorithms have a runtime of O(∆ 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).

show abstract

Distributed (Δ + 1)-Coloring in the Physical Model

Cited by 25 publications

References 16 publications

Efficient distributed multiple-message broadcasting in unstructured wireless networks

Efficient distributed multiple-message broadcasting in unstructured wireless networks

Local Broadcasting with Arbitrary Transmission Power in the SINR Model

Simple Distributed Δ + 1 Coloring in the SINR Model

Contact Info

Product

Resources

About