Energy-Efficient Data-Centric Routing in Wireless Sensor Networks

Hong-Hsu YEN  Frank Yeong-Sung LIN  Shu-Ping LIN  

IEICE TRANSACTIONS on Communications   Vol.E88-B   No.12   pp.4470-4480
Publication Date: 2005/12/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.12.4470
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems)
Category: Ad hoc, Sensor Network and P2P
energy saving,  data aggregation,  data-centric routing,  Lagrangean relaxation,  wireless sensor networks,  

Full Text: PDF>>
Buy this Article

Incorporating sensor nodes with data aggregation capability to transmit less data flow in wireless sensor networks could reduce the total energy consumption. This calls for the efficient and effective data-centric routing algorithm to facilitate this advantage. In the first part of this paper, we model the data-centric routing problem by rigorous mixed integer and linear mathematical formulation, where the objective function is to minimize the total transmission cost subject to multicast tree constraints. With the advancement of sensor network technology, sensor nodes with configurable transmission radius capability could further reduce energy consumption. 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. The solution approach is based on Lagrangean relaxation in conjunction with the novel optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithms calculate better solution than other existing heuristics with improvement ratio up to 169% and 59% with respect to fixed transmission radius and configurable transmission radius for network with 300 random generated nodes.