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

Yan Sun, Cong Chen and Hong Luo

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 8, 801758

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 routes and design an adaptive adjustment algorithm. When the end-to-end delay requirement of a region changes, our proposed adaptive adjustment algorithm can locally adjust the wake-up schedules or the routing tables of the nodes which are the nearest ones to the source node, so as to minimize energy consumption and the impact on other regions while guaranteeing the new end-to-end delay requirement of the region. Through experiments in a real wireless sensor network and extensive simulations, we can get that the proposed scheme can conserve at least 20% energy consumption comparing to other existing adjustment algorithms, and its performance approaches that of the optimal solution.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/801758 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:8:p:801758

DOI: 10.1155/2013/801758

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().