An Energy-Efficient Algorithm for Constructing Object Tracking Trees in Wireless Sensor Networks

• Main Authors: Yen-Yi Hsu, 許宴毅
• Other Authors: 林永松
• Format: Others
• Language: en_US
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/87300561350481268977

碩士 === 國立臺灣大學 === 資訊管理學研究所 === 97 === In recent years, due to the rapid growth in sensor technology and wireless communication, Wireless Sensor Networks (WSNs) have been applied in various applications. Nevertheless, sensor nodes are highly energy-constrained, because of the limitation of hardware and the infeasibility of recharging the battery under a harsh environment. Therefore, energy consumption of sensor nodes becomes one of the popular issues. In this thesis, our purpose is to achieve energy-efficient object tracking for an arbitrary topology in WSNs. Object tracking typically contains two basic operations: update and query. Most research only considers the update cost during the design phase, or adjusts the structure by taking the query cost into consideration in the second round. We aim to construct an object tracking tree with minimum total cost including both the update and query costs. This problem is formulated as an integer programming problem. We use the Lagrangean relaxation method to find an optimal solution and to develop a heuristic algorithm for constructing an object tracking tree with minimum cost.