Proceedings of the 8th ACM International Workshop on Mobility Management and Wireless Access 2010
DOI: 10.1145/1868497.1868500
|View full text |Cite
|
Sign up to set email alerts
|

Limiting end-to-end delays in long-lasting sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…For the second perspective, Lu et al [16] try to arrange the wake-up time of nodes and introduce different heuristic algorithms to reduce transmission delay. The LETED approach is proposed to solve the clock drift problem of nodes in [20], in which the nodes on the path can arrange their own transceiver time slots according to the schedules of the last hop and the next hop. The research [10] constructs broadcast tree from sink to each node and schedules the state of nodes to reduce the transmission delay.…”
Section: Related Workmentioning
confidence: 99%
“…For the second perspective, Lu et al [16] try to arrange the wake-up time of nodes and introduce different heuristic algorithms to reduce transmission delay. The LETED approach is proposed to solve the clock drift problem of nodes in [20], in which the nodes on the path can arrange their own transceiver time slots according to the schedules of the last hop and the next hop. The research [10] constructs broadcast tree from sink to each node and schedules the state of nodes to reduce the transmission delay.…”
Section: Related Workmentioning
confidence: 99%
“…We already introduced LETED in our previous work [27] but presented only analytical results of LETED performance. Later we implemented LETED and evaluated it with a network simulator, which revealed some drawbacks of this protocol.…”
Section: Limiting End-to-end Delays (Leted)mentioning
confidence: 99%
“…In our previous work [27], we introduced a solution to the overlap problem. However, simulation runs revealed some drawbacks of this approach, and therefore we apply a simpler but a robust solution based on the ARQ protocol.…”
Section: Overlap Riskmentioning
confidence: 99%
See 1 more Smart Citation
“…By controlling maximum burst transfer delay parameters of constant bit rate (CBR), hybrid offset‐time and burst assembly algorithm can effectively reduced the delay for CBR traffic . In , a packet scheduled method was adopted to lower the delay. In , dual‐QCon was proposed to provide the delay guarantee by dynamically controlling the queue length threshold.…”
Section: Introductionmentioning
confidence: 99%