Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 11 publications
0
3
0
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%
See 1 more Smart Citation
“…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%
“…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%