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

Energy-efficient scheduling with delay constraints for wireless sensor networks: A calculus-based perspective

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 21 publications
(57 reference statements)
0
1
0
Order By: Relevance
“…easy, least-time, energy-efficient path protocol by means of one-level data aggregation which guarantees improved life span for the network. The energy-efficient data development issue [5]. through person packet delay limitations to an energy-efficient service curve construction issue is developed and solves the difficulty by developing a local optimality theorem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…easy, least-time, energy-efficient path protocol by means of one-level data aggregation which guarantees improved life span for the network. The energy-efficient data development issue [5]. through person packet delay limitations to an energy-efficient service curve construction issue is developed and solves the difficulty by developing a local optimality theorem.…”
Section: Literature Reviewmentioning
confidence: 99%