An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Blair, Jean R. S.; Manne, Fredrik

doi:10.1007/978-3-642-11476-2_19

Cited by 8 publications

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we make R calls at most with a probability equal to 1 − 1 ∆ 2 log n , from equations (12) and (13) it is clear that with a probability 1 − 5 4∆ 2 log n at the end of the second loop the following double inequality is satisfied:…”

Section: Proofmentioning

confidence: 99%

“…In terms of graph theory, solving this issue of communication amounts to solve the distance-2 coloring problem on the network. A large number of works [11][12][13][14][15][16][17][18][19][20] have proposed distributed vertex coloring algorithms applicable to wireless networks. Unfortunately, so far these proposed coloring protocols are not robust to both conflicts and collisions on the level of communication channels.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Time Slots Assignment Protocol in Dynamic Networks

Lakhlef

Jaber

Bouabdallah

et al. 2020

2020 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Buy / Rent full text

This paper addresses the problem of communication in resource-limited broadcast/receive wireless networks. In large scale and resource-limited wireless networks, as the Internet of Things (IoT), a massive amount of data is becoming increasingly available, and consequently implementing protocols achieving error-free communication channels presents an important challenge. Indeed, in this new kind of network, the prevention of message conflicts and message collisions is a crucial issue. In terms of graph theory, solving this issue amounts to solve the distance-2 coloring problem on the network. This paper presents a first study on dynamic management in distance-2 coloring in resource-limited wireless networks. We propose a distributed distance-2 coloring in a dynamic network where a new node can join the network. Thanks to the proposed protocol, we assign a time slot to the new node without re-running the whole algorithm of time slot assigning. Our protocol is time-efficient and uses only local information with a high probability.

show abstract

Section: Proofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distributed Time Slots Assignment Protocol in Dynamic Networks

Lakhlef

Jaber

Bouabdallah

et al. 2020

2020 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Buy / Rent full text

show abstract

“…We show that after a small number of rounds, the system is able to use the previous strategy for allocating the network bandwidth for single-hop-distance broadcasting when basing the interference model on discrete graphs. Further mitigation efforts of transmission pathologies, such as hidden terminal phenomena when unicast are considered, can be taken, for example, self-stabilizing two-hop-distance vertex coloring [27], equalizing transmission power, and coding-based methods [28], to name a few.…”

Section: Introductionmentioning

confidence: 99%

Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks

Leone

Schiller

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Buy / Rent full text

In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology.

show abstract

An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Cited by 8 publications

References 11 publications

Distributed Time Slots Assignment Protocol in Dynamic Networks

Distributed Time Slots Assignment Protocol in Dynamic Networks

Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks

Contact Info

Product

Resources

About