無線感測網路是由許多具有感測、計算和無線通訊等能力的感測節點所組成的。近年來，許\\多研究的重心都集中在路由協定的能量消耗方面的議題。無線感測網路中的路由協定根據應用和設計上的不同而有許多不同的方法。在這篇文章中我們所探討的議題主要也是無線感測網路中路由協定的能量消耗方面的議題。我們設計了一個叫ACRP的路由協定，各感測節點會自行地組成許多個叢集，叢集管理者會分配時間槽給自己所屬叢集內的所有感測節點，這些感測節點便可在他們所屬的時間槽內傳送資料給叢集管理者；在叢集管理者整合了所收到的資料後，會藉由事前建立好的路由將資料傳送給基地台。此外，為了能延長無線感測網路的存活時間，基地台會週期性地根據各叢集的一些相關資訊來動態地調整各叢集的節點數量。

Wireless sensor networks consist of many small sensor nodes with sensing, computation, and wireless communications capabilities. Recently, there have been numerous research results in the power consumption for routing protocol. Routing protocols in WSNs might difference depending on the application and network architecture. This paper focuses on reducing the power consumption for routing protocol of wireless sensor networks too. We present a routing protocol called ACRP. sensor nodes will organize many clusters voluntarily. Cluster heads will distribute time slot to the sensor nodes in the same cluster and sensor nodes will transmit data to cluster head in it’s time slot. After the data had been aggregated by cluster heads, they will send the aggregated data to base station through the routing path that had been established. In addition, in order to lengthen the living time of wireless sensor network, the base station will periodically adjust the amount of sensor nodes in all clusters according to the cluster information.

第一章 導論
1–1 前言與研究動機
第二章 相關研究
2–1 LEACH
2–2 BCDCP
第三章 ACRP
3–1 模型架構
3–2 環境假設
3–3 運作流程
3–3–1 Cluster initialization
3–3–2 Set–up Phase
3–3–3 Steady phase
3–3–4 Forwarding phase
第四章 模擬結果與討論
4–1 模擬工具
4–2 模擬參數設定
4-3 模擬圖表及討論
第五章 結論

[1] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Proc. 5th ACM/IEEE Mobicom, Seattle,WA, Aug. 1999. pp. 174–85.
[2] C. Intanagonwiwat, R. Govindan, and D. Estrin,“Directed Diffusion: a Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. ACM Mobi-Com 2000, Boston, MA, 2000, pp. 56–67.
[3] D. Braginsky and D. Estrin, “Rumor Routing Algorithm for Sensor Networks,” Proc. 1st Wksp. Sensor Networks and Apps., Atlanta, GA, Oct. 2002.
[4] F. Ye et al., “A Scalable Solution to Minimum Cost Forwarding in Large Sensor Networks,” Proc. 10th Int’l. Conf. Comp. Commun. and Networks, 2001, pp. 304–09.
[5] C. Schurgers and M.B. Srivastava, “Energy Efficient Routing in Wireless Sensor Networks,” MILCOM Proc. Commun. for Network-Centric Ops.: Creating the Info. Force, McLean, VA, 2001.
[6] M. Chu, H. Haussecker, and F. Zhao, “Scalable Information Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks,” Int’l. J. High Perf. Comp. Apps., vol. 16, no. 3, Aug. 2002.
[7] Y. Yao and J. Gehrke, “The Cougar Approach to Innetwork Query Processing in Sensor Networks,” SIGMOD Record, Sept. 2002.
[8] N. Sadagopan et al., “The ACQUIRE Mechanism for Efficient Querying in Sensor Networks,” Proc. 1st Int’l. Wksp. Sensor Network Protocol and Apps,. Anchorage, AK, May 2003.
[9] R. C. Shah and J. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor Networks,” IEEE WCNC, Orlando, FL, Mar. 17–21, 2002.
[10] W. Heinzelman, A. Chandrakasan and H. Balakrishnan,“Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. 33rd Hawaii Int’l. Conf. Sys. Sci., Jan. 2000.
[11] S. Lindsey and C. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” IEEE Aerospace Conf. Proc., 2002, vol. 3, 9–16, pp. 1125–30.
[12] A. Manjeshwar and D. P. Agarwal, “TEEN: a Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks,” 1st Int’l. Wksp. on Parallel and Distrib. Comp. Issues in Wireless Networks and Mobile Comp., April 2001.
[13] V. Rodoplu and T. H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE JSAC, vol. 17, no. 8, Aug. 1999, pp. 1333–44.

[14] L. Subramanian and R. H. Katz, “An Architecture for Building Self Configurable Systems,” Proc. IEEE/ACM Wksp. Mobile Ad Hoc Net. and Comp., Boston, MA, Aug. 2000.
[15] Q. Fang, F. Zhao, and L. Guibas, “Lightweight Sensing and Communication Protocols for Target Enumeration and Aggregation,” Proc. 4th ACM MOBIHOC, 2003, pp. 165–76.
[16] J. N. Al-Karaki et al., “Data Aggregation in Wireless Sensor Networks — Exact and Approximate Algorithms,” Proc. IEEE Wksp. High Perf. Switching and Routing 2004, Phoenix, AZ, Apr. 18–21, 2004.
[17] Q. Li, J. Aslam and D. Rus, “Hierarchical Power-Aware Routing in Sensor Networks,” Proc. DIMACS Wksp. Pervasive Net., May, 2001.
[18] F. Ye et al., “A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks,” Proc. ACM/IEEE MOBICOM, 2002.
[19] Yao-Chung Chang, Zhi-Sheng Lin, Jiann-Liang Chen, “Cluster based self-organization management protocols for wireless sensor networks,” IEEE Transactions on Consumer Electronics, Volume 52, Issue 1, pp.75–80, Feb. 2006.
[20] Y. Xu, J. Heidemann, and D. Estrin, “Geographyinformed Energy Conservation for Ad-hoc Routing,” Proc. 7th Annual ACM/IEEE Int’l. Conf. Mobile Comp. and Net., 2001, pp. 70–84.
[21] Y. Yu, D. Estrin, and R. Govindan, “Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” UCLA Comp. Sci. Dept. tech. rep., UCLA-CSD TR-010023, May 2001.
[22] I. Stojmenovic and X. Lin, “GEDIR: Loop-Free Location Based Routing in Wireless Networks,” Int’l. Conf. Parallel and Distrib. Comp. and Sys., Boston, MA, Nov. 3–6, 1999.
[23] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad Hoc Routing,” Proc. 4th ACM Int’l. Conf. Mobile Comp. and Net., 2003, pp. 267–78.
[24] B. Chen et al., “SPAN: an Energy-efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Wireless Networks, vol. 8, no. 5, Sept. 2002, pp. 481–94.
[25] S.D. Muruganathan, D.C.F. Ma, R.I. Bhasin, A.O.Fapojuwo, “A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks,” IEEE Communications Magazine conference on Volume 43, Issue 3, pp.8 – 13, March. 2005.
[26] Oh Hayoung and Chae Kijoon, “An Energy-Efficient Sensor Routing with low latency, scalability in Wireless Sensor Networks,” Multimedia and Ubiquitous Engineering, 2007, pp.147–152, April. 2007.
[27] OMNET++ Community Site, http://www.omnetpp.org/filemgmt/viewcat.php?cid=2