2013
DOI: 10.1155/2013/801758
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Scheduling and Routing Scheme for Delay Guarantee in Wireless Sensor Networks

Abstract: In wireless sensor networks (WSNs), periodical sleeping scheme on sensor nodes is an effective way to save energy. However, it will hinder the capability of the network to provide real-time data reporting due to relay node being sleep. Motivated by this, we propose an adaptive scheduling and routing scheme for guaranteeing dynamic end-to-end delay requirement while minimizing the energy consumption. First of all, we utilize an optimal wake-up scheduling algorithm to achieve the initial wake-up schedules and ro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Yan et al [34] proposed an adaptive scheduling and routing scheme to guarantee dynamic end-to-end delay requirements while minimizing the energy consumption in wireless sensor networks (WSNs). In the case where the endto-end delay requirement of a region changes, they proposed an adaptive adjustment algorithm to locally adjust the wakeup schedule or routing table with the minimum energy cost while satisfying the new delay requirement.…”
Section: B Joint Routing and Tdma Link Schedulingmentioning
confidence: 99%
“…Yan et al [34] proposed an adaptive scheduling and routing scheme to guarantee dynamic end-to-end delay requirements while minimizing the energy consumption in wireless sensor networks (WSNs). In the case where the endto-end delay requirement of a region changes, they proposed an adaptive adjustment algorithm to locally adjust the wakeup schedule or routing table with the minimum energy cost while satisfying the new delay requirement.…”
Section: B Joint Routing and Tdma Link Schedulingmentioning
confidence: 99%
“…An adaptive scheduling and routing scheme in [8] utilizes an optimal sleeping scheduling algorithm to obtain wake-up schedules and routes and thus adaptively adjust wake-up of nodes. It does not consider remaining energy of nodes when the frequency increases so the energy consumption of the entire network is not balanced.…”
Section: Related Workmentioning
confidence: 99%
“…Yan Sun et al [7] proposed a scheduling and routing scheme to guarantee delay adaptive dynamic requirements of end-to-end while minimizing energy consumption. They use a wake-up scheduling algorithm to get optimal schedule wake-up early and routes are designed with an adaptive adjustment algorithm.…”
Section: Introductionmentioning
confidence: 99%