在本篇論文中所提出了兩個方法，多收集樹法與單一收集樹法，這兩個方法 由實驗得知每個都能提升整個網路的存活時間，除此之外，我們也順利解決了感 測點電源消耗不平均的問題，讓感測點不會有耗電量過大而提早衰竭盡進而導致 網路功能喪失，使其他感測點仍有相當多的電源而無用武之地的情況發生。
我們的方法經實驗比較得知，適用於任何的情況，包括感測點的感測距離大 小，或感測點的起始電源分佈，不管多收集樹法與單一收集樹法都能讓網路有較 高的存活時間，讓我們所提出的方法適用範圍更加的廣大。
而我們所提出的方法中單一收集樹法，雖然在收集器增加時網路的存活時間 提升的幅度較小，不過當壓縮比較小時單一收集樹法所造成的效果較高，這是由 於這樣所累積的封包較小多收集樹並沒有完全的發揮出他的功用，加上在切換收 集器時並不需要廣播所有的控制封包，使得控制封包在網路上的情況降低，額外 的耗電量也減少許多。
由於我們所要解決的問題是感測網路中耗電量不平均的問題，而我們也確實 辦到了，但是由於實驗中所顯示的不管是感測點平均所剩下的電源，或者是感測 點剩下電源的標準差，都只是大幅的降低，使感測點的耗電量達到平衡，不過離 真正的平衡還有一段距離，所以我們未來的研究方向將會更努力研究耗電量的平 衡期望真正能使所有的感測點在同一時間電源耗竭，而不會有感測點有多餘的殘 留電源剩下，完美的利用所有感測點的電量。
而研究中單一收集樹法中所提到的切換收集器順序是否有還有更好的切換 方法，而此是否也是使網路生命週期能夠更長整個網路存在更久的原因之一，能 否讓感測點之間的耗電量更佳的平衡，在未來的研究中也將深入探討，使網路生 命週期能夠更長整個網路存在更久，且更不會有感測點提早死亡而浪費其他感測
資源，讓整個網路的使用效能達到更好。
參考文獻
[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
[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.