An Energy-Efficient Data-Centric Routing Algorithm in Wireless Sensor Networks
Date Issued
2005
Date
2005
Author(s)
Lin, Shu-Ping
DOI
en-US
Abstract
Recently wireless sensor networks (WSNs) have attracted a great deal of attention due to their potential for numerous military, environmental detection, and civil applications. Sensor nodes in WSNs are highly energy-constrained, because of the limitations of hardware and the infeasibility of recharging sensor nodes under a severe environment. When a sensor is in operation, therefore, reducing energy consumption during the forwarding and sensing of data is a crucial issue in WSNs. Incorporating sensor nodes with data aggregation capabilities to transmit less data in WSNs could reduce total energy consumption. However, this calls for an efficient and effective data-centric routing algorithm to facilitate this potential advantage.
In this thesis, our work emphasizes on the construction of an energy-efficient data aggregation tree that possesses good QoS and minimizes the total energy consumption of sensor nodes simultaneously. In the first part of this thesis, we model the data-centric routing problem based on a rigorous mixed integer linear mathematical formulation, where the objective function is to minimize the total transmission cost, subject to multicast tree and data aggregation constraints. With the advances in sensor network technology, sensor nodes with configurable transmission radius capability would further reduce energy consumption. Thus, the second part of this paper considers the transmission radius assignment of each sensor node and the data-centric routing assignment jointly. The objective function is to minimize the total power consumption together with consideration of construction of a data aggregation tree and sensor node transmission radius assignment. Finally, the effects of data retransmission and maximum end-to-end delay due to data aggregation delay are also considered in order to reflect the tradeoff between the advantages and the costs of data aggregation. We take the properties of QoS in wireless sensor networks as a new energy consumption metric that can not only maintain the traditional transmission delay, but also simultaneously reduce the energy consumption of sensor nodes operating in idle mode. How to construct a data aggregation tree that is energy-efficient and has QoS properties is a complicated problem that needs to be investigated. We conceive a rigorous mathematical formulation, where the objective function is to minimize the total energy consumption of data transmission subject to tree, data retransmission, and maximum end-to-end delay constraints.
The solution approach is based on Lagrangean relaxation in conjunction with novel optimization-based heuristics. With the exceptional properties of Lagrangean relaxation we are able to efficiently solve this complicated optimization problem, and derive an effective algorithm for routing assignments and construct a data aggregation tree simultaneously. Through our computational experiments, we show that the proposed algorithms calculate better solutions than other existing heuristics. When considering QoS routing in WSNs, the proposed algorithms can not only construct a better data aggregation tree in terms of energy consumption, but also maintain good maximum end-to-end delay.
Subjects
資料集縮
資料中心路由
最佳化
拉格蘭日鬆弛法
混合式整數線性規劃
無線感測網路
Data Aggregation
Data-Centric Routing
Energy-Efficient Routing
Optimization
Lagrangean Relaxation Method
Mixed Integer Linear Programming
Wireless Sensor Networks
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92725018-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):5e22f34b9456c01f51c95a4758cdc67b