無線行動隨意網路是一種特殊之網路架構，節點自組網路拓樸不需預先建構網路相關基礎設備即可進行資訊之交換。由於無線行動隨意網路不需預先建立網路架構，所以少了許多網路設備之幫助產生以下之問題：節點裝置傳輸範圍有限、網路拓樸變化迅速、節點能源不足、網路頻寬限制…等。無線行動隨意網路之架構可以分成平面式架構以及階層式架構，其中階層式架構擁有良好之節點擴充性，即網路架構可以容納較多之節點，為目前研究之方向。階層式架構的穩定性是影響網路效能非常重大之因素，若所建立之階層式架構穩定可以節省許多電量以及控制負擔在非傳送有效資料上。階層式架構，即叢集架構，可以分成one-hop 以及k-hop 架構，先前之研究方向主要為固定k 值之k-hop 叢集架構。
本論文，D2-CS，提出了分散式以及動態的叢集大小調整，即分散式調整每個叢集之大小，使每個叢集能夠更符合其周遭網路環境而調整叢集大小。D2-CS之叢集轉換機制可以有效地調整出更穩定之叢集架構，並且分散資料流量給不同叢集，避免單一叢集快速耗盡電量，提供高穩定性之網路架構。

"none"

第一章 導論.......................................................................................................................... 1
1.1 簡介 ............................................................................................................................ 1
1.2 研究動機 .................................................................................................................... 4
1.3 論文架構 .................................................................................................................... 6
第二章 相關研究 .................................................................................................................. 7
2.1 相關研究 .................................................................................................................... 7
2.2 Low Energy Adaptive Clustering Hierarchy ............................................................ 10
2.3 Least Cluster Change Algorithm, LCC .................................................................... 11
2.4 Grid Cluster Algorithm(網格叢集演算法) .............................................................. 12
2.5 K-hop Compound Metric Based Clustering Scheme，KCMBC ............................. 14
第三章 分散式叢集架構動態調整演算法 ........................................................................ 20
3.1 環境假設 .................................................................................................................. 21
3.2 D2-CS ...................................................................................................................... 22
3.2.1 D2-CS 之叢集建構演算法 ............................................................................... 22
3.2.2 D2-CS 之叢集維護機制 ................................................................................... 38
第四章 模擬結果與討論 .................................................................................................... 40
4.1 模擬環境與設定 ...................................................................................................... 41
4.2 評測項目 .................................................................................................................. 43
4.3 模擬圖表及討論 ...................................................................................................... 45
4.3.1 節點移動速度對於網路效能之影響 ................................................................... 45
4.3.2 Traffic Loads 對於網路效能之影響 ..................................................................... 53
第五章結論 ........................................................................................................................... 59
參考文獻 60

[1] Cong Liu, and Jie Wu, “Adaptive Routing in Dynamic Ad Hoc Networks,”
Wireless Communications and Networking Conference, pp.2603-2608, 2008.
[2] Mao Ye, Chengfa Li, Guihai Chen, and Jie Wu, “EECS: an energy efficient
clustering scheme in wireless sensor networks,” Performance, Computing, and
Communications Conference, pp.535-540, 2005.
[3] Jiannong Cao, Lifan Zhang, Guojun Wang, and Hui Cheng, “SSR:
Segment-by-Segment Routing in Large-Scale Mobile Ad Hoc Networks,”
Mobile Adhoc and Sensor Systems (MASS) Conference, pp. 216-225, 2006.
[4] L. Ritchie, H.S. Yang, A.W. Richa, and M. Reisslein, ” Cluster overlay broadcast
(COB): MANET routing with complexity polynomial in source-destination
distance,” Mobile Computing, vol. 5, pp. 653-667, 2006.
[5] Li Wang, Ting Liu, and Kai Liu, “An adaptive forwarding cluster routing
protocol for large scale wireless Mobile Ad Hoc networks,” Communications
14th Asia-Pacific Conference, pp.1-5, 2008.
[6] Canourgues Lucile, Lephay Jerome, Soyer Laurent, and Beylot Andre-Luc, “An
efficient Scalable structure-Free Inter cluster multicast Routing (SAFIR) protocol
for large tactical Mobile Ad hoc Networks,” Military Communications
Conference, pp.1-7, 2007.
[7] P. Bellavista, and E. Magistretti, ” How node mobility affects k-hop cluster
quality in Mobile Ad Hoc NETworks: A quantitative evaluation,” Computers and
Communications, pp.750-756, 2008.
[8] P. Bellavista, and E. Magistretti, “k-hop Backbone Formation in Ad Hoc
Networks,” Computer Communications and Networks, pp.479-484, 2007.
[9] Supeng Leng, Yan Zhang, Hsiao-Hwa Chen, Liren Zhang, and Ke Liu, “A novel
k-hop Compound Metric Based Clustering scheme for ad hoc wireless
networks,” Wireless Communications, vol. 8, pp.367-375, 2009.
[10] Supeng Leng, Liren Zhang, Huirong Fu, and Jianjun Yang, “A Novel
Location-Service Protocol Based on k -Hop Clustering for Mobile Ad Hoc
Networks,” Vehicular Technology, vol. 58, pp.810-817, 2007.
[11] M. Chatterjee, S.K. Sas, and D. Turgut, “An on-demand weighted clustering
algorithm (WCA) for ad hoc networks,” Global Telecommunications Conference,
vol. 3, pp.1697-1701, 2000.
[12] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-Efficient
Communication Protocol for Wireless Microsensor Networks,” Proceedings of
the 33rd Annual Hawaii International Conference, vol.2, pp.10, 2000.
[13] C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop,
Mobile Wireless Networks with Fading Channel,” Proc. IEEE Singapore Int’l
Conf. Networks, pp. 197-211, 1997.
[14] Wang-Cheol Song, S.-U. Rehman, and H. Lutfiyya, “A scalable PBNM
framework for MANET management,” Integrated Network Management,
pp.234-241, 2009.
[15] T. Rasheed, L. Reynaud, K. AI Agha, and U. Javaid, “Cluster-quality based
hybrid routing for large scale mobile multi-hop networks," Wireless
Communications and Networking Conference, pp. 3052-3057, 2007.
[16] S. Leng, L. Zhang, H. Fu, and J. Yang, “Mobility analysis of mobile hosts with
random walking in ad hoc networks," Computer Networks, vol. 51, no. 10, pp.
2514-2528, 2007.