臺灣博碩士論文加值系統

在這篇論文中，每一個感測器皆可自由調整傳輸能量等級，且資料會經過資料匯集處理後傳向基地台。演算法會找出一個此感測網路中最大生命週期的資料收集樹。接著，我們提出另一個與之相似的演算法，並比較模擬結果。在演算法結束後，我們會找出何時演算法需要重新執行以進一步延長生命週期。

第一章、 Introduction
第二章、 Sensor Network Model
第三章、 Maximum-lifetime Tree Problem
第四章、 Lower Bound on The Normalized Load
第五章、 Algorithm
第六章、 Simulation
第七章、 Conclusion

[1] 李封儒/林華君, “在感測網路中利用資料匯集機制建立擁有最大生命週期的資料收集樹”, 碩士論文, 國立清華大學
[2] Y. Xue, Y. Cui, and K. Nahrstedt, “Maximizing lifetime for data gathering in wireless sensor networks”, Mobile Networks and Applications, vol. 10, no. 6, pp. 853-864, Dec. 2005.
[3] J. Stanford and S. Tongngam, “Approximation algorithm for maximum lifetime in wireless sensor networks with data gathering”, in Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD), pp. 273-277, June 2006.
[4] S. Madden, R. Szewczyk, M. J. Franklin, and D. Culler, “Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks”, In Proceedings of 4th IEEE Workshop on Mobile Computing and Systems Applications, pp. 49-58, June 2002.
[5] K. Kalpakis and S. Tang, “A combinatorial algorithm for the Maximum Lifetime data gathering and Aggregation problem in sensor networks”, in Proceedings of the International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1-8, June 2008.
[6] K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks”, Computer Networks, Vol. 42, no. 6, pp. 697-716, Aug. 2003.
[7] R. C. Prim, “Shortest connection networks and some generalizations”, Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.
[8] N. Garg and J. Könemann, “Faster and simpler algorithms for multicommodity flow and other fractional packing problems”, in Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 300309, Nov. 1998.
[9] H. Ö. Tan and Körpeˇglu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks”, ACM SIGMOD Record, vol. 32, no. 4, pp. 66-71, Dec. 2003.
[10] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition, The MIT Press, 2001.
[11] Y. Wu, S. Fahmy, and N. B. Shroff, “On the Construction of a Maximum- Lifetime data gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm”, in Proceedings of the IEEE INFOCOM, pp. 356-360, April 2008.
[12] M. Fürer and B. Raghavachari, “Approximating the minimum-degree Steiner tree to within one of optimal”, Journal of Algorithms, vol. 17, no. 3, pp. 409423, Nov. 1994.
[13] Texas Instruments, “CC2520 Datasheet: 2.4 GHz IEEE 802.15.4/Zigbee RF Transceiver, SWRS068 December 2007”, [Online]. Available: http://focus.ti.com/docs/prod/folders/print/cc2520.html
[14] H. Karl and A. Willing, Protocols and Architectures for Wireless Sensor Networks, John Wiley & Sons, 2005.
[15] S. Hussain and O. Islam, “An energy efficient spanning tree based multi-hop routing in wireless sensor networks”, in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), March 2007.
[16] S. Rao, “Estimating the ZigBee transmission-range ISM band”, EDN, May 2007, pp. 67-72.