An Energy and Delay Efficient Scheduling Algorithm for Data-Centric Wireless Sensor Networks
Date Issued
2006
Date
2006
Author(s)
Wang, Hung-Shi
DOI
en-US
Abstract
Wireless sensor networks (WSNs) consist of a number of small nodes with sensing, computation, and wireless communication abilities. Because of the deployment of sensors would be typically in random fashion. It would not be feasible to recharge the batteries of a moribund sensor. Hence, how to prolong the lifetime becomes a principal issue in wireless sensor networks.
In this thesis, we emphasize on a problem of routing and scheduling the activities of all sensors in a data-centric wireless sensor network. We propose a mathematical formulation to model this problem as an integer programming problem, where the objective function is to minimize the total energy consumption, including transmitting, receiving, idling and sleeping. By Lagrangean Relaxation method, we can find a near optimal solution out and verify whether the algorithm we proposed achieves energy efficiency, fulfils data aggregation, and ensures the latency within a reasonable range.
Subjects
排程
低延遲
資料中心路由
最佳化
拉格蘭日鬆弛法
整數線性規劃
無線感測網路
Scheduling
Data aggregation
Energy-Efficient
Delay-Efficient
Data-centric Routing
Optimization
Lagrangean Relaxation Method
Integer Linear Programming
Wireless Sensor Network.
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93725038-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):a2bf3773f5660b3fe5721b44225a180b