2011
DOI: 10.1016/j.comcom.2010.11.011
|View full text |Cite
|
Sign up to set email alerts
|

Realizing and benchmarking broadcast algorithms in wireless mesh networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…Many communication mechanisms have been introduced in WMN including link scheduling , gateway placement , gateway selection , relay selection , broadcast routing , and multicast routing to support its applications. A vital question in all these designing issues is how to assign the available channels to interfaces of nodes in such a way that the minimal interference is achieved.…”
Section: Introductionmentioning
confidence: 99%
“…Many communication mechanisms have been introduced in WMN including link scheduling , gateway placement , gateway selection , relay selection , broadcast routing , and multicast routing to support its applications. A vital question in all these designing issues is how to assign the available channels to interfaces of nodes in such a way that the minimal interference is achieved.…”
Section: Introductionmentioning
confidence: 99%
“…In [68] the schemes adaptation hop by hop [128] and ECS [73] are compared to other deterministic broadcasting schemes.…”
Section: Real Implementationsmentioning
confidence: 99%
“…In ACCPF, nodes take into account both the Euclidean distance and the number of copies received in order to compute the forwarding probability (68). In this scheme, each node maintains the number of copies m, and the smallest additional coverage area S min for each broadcast packet m. After a waiting period of time RAD, the nodes retransmit with a probability,…”
Section: 222mentioning
confidence: 99%