2014
DOI: 10.1007/s11276-014-0732-z
|View full text |Cite
|
Sign up to set email alerts
|

Approximation algorithms for broadcasting in duty cycled wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
36
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
10

Relationship

1
9

Authors

Journals

citations
Cited by 19 publications
(37 citation statements)
references
References 28 publications
1
36
0
Order By: Relevance
“…Only the nodes on the broadcast backbone are always active, so the energy consumption is relatively small, but it can effectively reduce the delay. Similar research on duty cycle WSNs was also presented in [56,57]. …”
Section: Related Worksupporting
confidence: 53%
“…Only the nodes on the broadcast backbone are always active, so the energy consumption is relatively small, but it can effectively reduce the delay. Similar research on duty cycle WSNs was also presented in [56,57]. …”
Section: Related Worksupporting
confidence: 53%
“…Zhao et al [48] considered MLBS in duty-cycled WSNs. In this scheme, nodes do not wake up simultaneously; thus, not all neighbor nodes can receive data packet from nodes in the same time.…”
Section: Related Workmentioning
confidence: 99%
“…(2) The minimum latency broadcast scheduling (MLBS): in this scheme, it reduces not only the energy consumption of node, but also the transmission time for broadcasting [25,26].…”
Section: Related Workmentioning
confidence: 99%