透過您的圖書館登入
IP:3.145.46.18
  • 學位論文

具資料集縮能力無線感測網路系統生命週期之最大化

Maximization of System Lifetime for Data-Centric Wireless Sensor Networks

指導教授 : 林永松

摘要


近年來,無線感測網路在於諸多應用上都具有其優越性。然而,在硬體和環境的限制下,感測器對於能源消耗具有高度限制性。採用資料集縮(data aggregation)能夠有效率地降低資料傳送量,以達到節省能耗的目的。 本篇論文研究在感測器具有資料集縮能力之無線感測網路中,使用集縮樹的適當路由分配以完成最大化系統生命週期。我們將問題化為一個數學模式,目的函式為最大化系統生命週期,並採用拉格蘭日鬆馳法獲得近似最佳解。

並列摘要


In recent years, wireless sensor networks have the advantages in a variety of applications. However, due to the limitations of hardware and the environment, the sensors are highly energy-constrained. By adopting data aggregation, we can effectively reduce the amount of data and thereby save energy consumption. In this thesis, we adopt data aggregation trees to efficiently arrange routing assignments in order to maximize the system lifetime of data-centric WSNs. We model the problem a mathematical formulation, where the objective function is to maximize the system lifetime, and use Lagrangean Relaxation method to derive an optimal solution.

參考文獻


[3] H. O. Tan and I. Korpeoglu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks”, ACM SIGMOD Record, vol. 32, no. 4, pp. 66-71, 2003.
[4] B. Krishnamachari, D. Estrin, and S.Wicker, "Modelling Data-Centric Routing in Wireless Sensor Networks." IEEE INFOCOM 2002.
[5] M.L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problems,” Management Science, Volume 27, Number 1, pp. 1-18, January 1981.
[6] M.L. Fisher, “An Application Oriented Guide to Lagrangian Relaxation,” Interfaces, Volume 15, Number 2, pp. 10-21, April 1985.
[7] A.M. Geoffrion, “Lagrangean Relaxation and its Use in Integer Programming,” Mathematical Programming Study, Volume 2, pp. 82-114, 1974.

延伸閱讀