Open Access System for Information Sharing

Login Library

 

Article
Cited 8 time in webofscience Cited 16 time in scopus
Metadata Downloads

Optimal Wake-Up Scheduling of Data Gathering Trees for Wireless Sensor Networks

Title
Optimal Wake-Up Scheduling of Data Gathering Trees for Wireless Sensor Networks
Authors
Ungjin JangLee, SYOO, SUNGJOO
POSTECH Authors
Lee, SYOO, SUNGJOO
Date Issued
Apr-2012
Publisher
Elsevier
Abstract
In order to gather sensor data, a data gathering tree is commonly created as a subnetwork of a wireless sensor network. Power conservation is of paramount importance in such networks, and using periodic sleep-wake cycles for sensor nodes is one of the most effective methods for power conservation. This paper addresses the problem of scheduling the sleep-wake cycles of nodes in a data gathering tree under deadline constraints. After formally modeling the problem being addressed, an optimal wake-up frequency assignment (OWFA) algorithm, which takes into account the data rate at each node and the total permitted delay, is proposed. The results of simulations under various conditions showed that OWFA consumed about 8.6% similar to 24.3% less average power, and thus resulted in a 7.4% similar to 26.0% longer network lifetime, than a previously proposed method that did not consider individual data rates. (C) 2012 Elsevier Inc. All rights reserved.
In order to gather sensor data, a data gathering tree is commonly created as a subnetwork of a wireless sensor network. Power conservation is of paramount importance in such networks, and using periodic sleep-wake cycles for sensor nodes is one of the most effective methods for power conservation. This paper addresses the problem of scheduling the sleep-wake cycles of nodes in a data gathering tree under deadline constraints. After formally modeling the problem being addressed, an optimal wake-up frequency assignment (OWFA) algorithm, which takes into account the data rate at each node and the total permitted delay, is proposed. The results of simulations under various conditions showed that OWFA consumed about 8.6% similar to 24.3% less average power, and thus resulted in a 7.4% similar to 26.0% longer network lifetime, than a previously proposed method that did not consider individual data rates. (C) 2012 Elsevier Inc. All rights reserved.
URI
http://oasis.postech.ac.kr/handle/2014.oak/15792
DOI
10.1016/J.JPDC.2012.01.008
ISSN
0743-7315
Article Type
Article
Citation
Journal of Parallel and Distributed Computing, vol. 72, no. 4, page. 536 - 546, 2012-04
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

 YOO, SUNGJOO
Dept of Electrical Enginrg
Read more

Views & Downloads

Browse