臺灣博碩士論文加值系統

無線感測網路(sensor networks)是在無線網路中的最新應用，使用低成本的感測點，密集的散佈在需要感測的區域。一般來說，在無線感測網路上，因為成本和環境因素的考量，在一定的感測區域內所部署的感測點是有限的，加上密集的散佈以及任務的需求使得感測點體積不會太大，因此感測點所擁有的電量總是有限的，所以感測網路的生命週期是有其限制。如何能夠降低所有感測點的耗電量，或利用其他技術，以延長感測網路的存活時間，便是一個相當重要的研究問題。前人成果大多只思考如何建造一棵省電的收集樹為主，卻忽略感測點因任務的不同或處理資料量的不同，而常會造成每個感測點的電源衰竭情況大不相同，導致每個感測點的存活時間長短不一，反而縮短整個整體網路存活時間。本篇論文目的除了提出一個較省電的資料收集樹外，我們也提出利用平衡電源消耗的技巧來延長感測網路的存活時間。我們也同時作模擬實驗來驗證這些技巧確實可延長感測網路的存活時間。

摘要 I
致謝 II
目錄 III
圖目錄 IV
表目錄 VI
第一章 簡介 1
第二章 相關研究 4
2.1 Low-Energy Adaptive Clustering Hierarchy 4
2.2 Balanced tree 5
2.3 其他aggregation tree的方法 6
第三章 定義 8
第四章 多收集樹法 10
4.1 建樹的演算法 10
4.2 樹的切換 14
第五章 單一收集樹法 16
5.1 建樹的演算法 16
5.2 切換樹上資料之流動方向 18
第六章 實驗 20
6.1 環境參數 20
6.2 模擬結果 22
第七章 結論與未來方向 37
參考文獻 39

[1]I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, no. 4, pp. 393-422, March, 2002.
[2]A.M. Zoubir, I.J. Chant, C.L. Brown, B. Barkat, and C. Abeynayake, “Signal processing techniques for landmine detection using impulse ground penetrating radar,” IEEE Sensors J., vol. 2, no. 1, pp. 41–51, 2002.
[3]R. Cristescu, B. Beferull-Lozano, M. Vetterli and R. Wattenhofer, “Network correlated data gathering with explicit communication: NP-completeness and algorithms,” IEEE/ACM Transactions on Networking, vol. 14, no 1, pp. 41 – 54, 2006.
[4]W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” Proceedings of the 33rd Hawaii International Conference on System Sciences, 2000, pp. 3005-3014.
[5]S. Lindsey, C. Raghavendra, and K.M. Sivalingam, “Data gathering algorithms in sensor networks using energy metrics,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 924–935, 2002.
[6]Hyun-sook Kim and Ki-jun Han, “A power efficient routing protocol based on balanced tree in wireless sensor networks,” Distributed Frameworks for Multimedia Applications, 2005, pp. 138-143.
[7]Luo Huiyu and G.J. Pottie, “Balanced aggregation trees for routing correlated data in wireless sensor networks,” International Symposium on Information Theory, 2005, pp. 14-18.
[8]S. Banerjee and A. Misra., “Minimum energy paths for reliable communication in multi-hop wireless networks,” MOBIHOC, 2002, pp. 146-156.
[9]M.A. Youssef, M.F. Younis and K.A. Arisha, “A constrained shortest-path energy-aware routing algorithm for wireless sensor networks,” Wireless Communications and Networking Conference, vol. 2, pp. 794-799, 2002.
[10]R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “On network correlated data gathering,” IEEE Infocom, 2004, pp. 2571-2582.
[11]M. Ding, X. Cheng and G. Xue, “Aggregation tree construction in sensor networks,” IEEE 58th Vehicular Technology Conference, vol. 4, pp. 2168-2172, 2003.
[12]Yu Yang, B. Krishnamachari and V.K Prasanna, “Energy-latency tradeoffs for data gathering in wireless sensor networks,” Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 245-255, 2004.
[13]Zongkai Yang, Yong Yuan and Jianhua He, “Energy aware data gathering based on adaptive modulation scaling in wireless sensor networks,” IEEE 60th Vehicular Technology Conference, vol. 4, pp. 2794-2798, 2004.
[14]Jae-Hwan Chang and L. Tassiulas, “Maximum lifetime routing in wireless sensor network,” IEEE/ACM Transactions on Networking, vol. 12, no. 4, pp. 609–619, 2004.
[15]C. Taddia and G. Mazzini, “On the energy impact of four information delivery methods in wireless,” IEEE Communications Letters, vol. 9, no. 2, pp.118 – 120, 2005.
[16]S.D. Muruganathan, D.C.F Ma, R.I. Bhasin, and A.O. Fapojuwo, “A centralized energy-efficient routing protocol for wireless sensor,” IEEE Communications Magazine, vol. 43, no. 3, pp. 8–13, 2005.
[17]Zongheng Zhou, S. Das, and H. Gupta, “Variable radii connected sensor cover in sensor networks,” IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004, pp. 387–396.
[18]Yunxia Chen and Qing Zhao, “On the lifetime of wireless sensor networks,”IEEE Communications Letters, vol. 9, no. 11, pp. 976–978, 2005.
[19]Sangsik Kim and Sangha KimA, “Energy Conservation Scheme to Maintain Data Aggregation Tree in Sensor Networks,” Asia-Pacific Conference on Communications, 2005, pp. 367–370.
[20]R. Jurdak, P. Baldi, and C.V. Lopes, “State-driven energy optimization in wireless sensor networks,” Proceedings of the 2005 Systems Communications (ICW05), pp. 356–363, 2005.
[21]Fei Hu, C. May and Xiaojun Cao, “Data Aggregation in Distributed Sensor Networks: Towards An Adaptive Timing Control,” Third International Conference on Information Technology: New Generations, 2006, pp. 256-261.
[22]I. Solis and K. Obraczka, “The impact of timing in data aggregation for sensor networks,” IEEE International Conference on Communications, vol. 6, pp. 3640-3645, 2004.
[23]Jiangzhuo Chen, Lujun Jia, Xin Liu, G. Noubir and R. Sundaram, “Minimum energy accumulative routing in wireless networks,” 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1875-1886, 2005.
[24]M. Perillo, Zhao Cheng and W. Heinzelman, “On the problem of unbalanced load distribution in wireless sensor networks,” Global Telecommunications Conference Workshops, 2004, pp.74-79.
[25]T. Banerjee, K. Chowdhury and D.P. Agrawal, “Tree based data aggregation in sensor networks using polynomial regression,” 8th International Conference on Information Fusion, vol. 2, pp. 1146-1153, 2005.