Research Article
Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks
@INPROCEEDINGS{10.1109/CHINACOM.2008.4685156, author={Yi-hua Zhu and Wan-deng Wu and Victor Leung and Liang-huai Yang}, title={Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks}, proceedings={ChinaCom2008-Wireless Communications and Networking Symposium}, publisher={IEEE}, proceedings_a={CHINACOM2008-WCN}, year={2008}, month={11}, keywords={Wireless sensor networks; message ferrying routing; cluster-based routing}, doi={10.1109/CHINACOM.2008.4685156} }- Yi-hua Zhu
Wan-deng Wu
Victor Leung
Liang-huai Yang
Year: 2008
Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks
CHINACOM2008-WCN
IEEE
DOI: 10.1109/CHINACOM.2008.4685156
Abstract
Wireless sensor networks (WSNs) are prone to partitioning due to limited energy in sensor nodes and unreliable radio communications between them. Message ferrying (MF) has been proposed as an effective means to deliver data between separated parts of a partitioned WSN. In this paper, we propose a tree-based MF algorithm (TMFA), in which minimum-weight spanning trees of each partition of the WSN are evaluated with different alternate root nodes. Appropriate choice of the weights allows overall energy consumption or delay to be minimized. Two kinds of tree-constructing algorithms respectively named Least Energy Tree (LET) and Minimum Hop Tree (MHT) are presented and evaluated by deriving an energy model. For comparison, Minimum Spanning Tree (MST) at a single root node and One Level Tree (OLT) that maximizes the use of the MF are considered. Simulation experiments show that LET and MHT outperform both MST and OLT when we take the message ferry’s moving cost into account.
