在無線行動隨意網路中，叢集是將節點區分成一至數個子集合；這是為了要支援網路的規模可伸縮性、有效的資料彙集、電量管理、以及有效的頻寬利用。由於網路中節點的移動，導致叢集必須要重組。然而，叢集重組是有訊息交換的負擔。在這篇論文中，我們研究如何建立穩定的叢集以減少叢集重組的負擔。在模擬實驗中可以展示出我們的方法可以減少資訊交換的負擔。

In a mobile ad hoc network, nodes are usually broken into one or more subsets, called clusters, for supporting network scalability, efficient data aggregation, energy management, and bandwidth utilization. Clusters need to be reformed due to the movement of mobile nodes. However, cluster reformation requires an overhead of message exchange. In this thesis, we study how to form stable clusters, thus reducing the overhead of cluster reformation. Simulation shows our approach has lower overhead of message exchange.

[1] P. Basu, N. Khan, and T. Little, “A mobility based metric for clustering in Mobile ad hoc networks,” Proceedings of IEEE ICDCS 2001 Workshop on Wireless Networks and Mobile Computing, Phoenix, AZ, Apr. 2001.
[2] M. Chatterjee, S. K. Das, and D. Turgut, “WCA: a weighted clustering algorithm for mobile ad hoc networks,” Cluster Computing, vol. 5, no. 2, pp. 193—204, 2002.
[3] S. Chen and K. Nahrstedt, “Distributed quality of service routing in ad-hoc networks,” IEEE Journal on Selected Areas in Communication, vol. 17, no. 8, Aug. 1999.
[4] G. Chen, F. G. Nocetti, J. S. Gonzalez, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks,” Telecommunication Systems, vol. 22, no. 1—4, pp. 205—220, 2003.
[5] C. C. Chiang, H. K. Wu, W. Liu, and M. Gerla, “Routing in clustered multihop, mobile wireless networks with fading channel,” Proceedings of IEEE Singapore International Conference on Networks (SICON), pp. 197—211, 1997.
[6] B. Das, R. Sivakumar, and V. Bharghavan, “Routing in ad hoc networks using a spine,” Proceedings of IEEE Computer Communication and Networks, pp. 34—39, 1997.
[7] A. Ephremides, J. E. Wieselthier, and D. J. Baker, “A design concept for reliable mobile radio networks with frequency hoping signaling,” Proceedings of the IEEE, vol. 75, no. 1, pp. 56—73, 1987.
[8] A. Fox, S. Gribble, Y. Chawathe, E. Brewer, and P. Gauthier, “Cluster-based scalable network services,” Proceedings of ACM Symposium Operating Systems Principles (SOSP), pp. 78—91, Oct. 1997.
[9] M. Gerla and J. T. C. Tsai, “Multicluster, mobile, multimedia radio networks,” ACM/Baltzer Journal of Wireless Networks, vol. 1, no. 3, pp. 255—265, 1995.
[10] T. C. Hou and T. J. Tsai, “Adaptive clustering in a hierarchical ad hoc network,” Proceedings of ICS Workshop on Computer Networks, Internet, and Multimedia, pp. 171—176, 1998.
[11] M. Jiang, J. Y. Li, and Y. C. Tay, “Cluster based routing protocol (CBRP) functional specification,” IETF Internet draft, Aug. 1999. http://www.ietf.org/ietf/draft-ietf-manetcbrp-spec-01.txt.
[12] M. Joa-ng and I. T. Lu, “A peer to peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications , vol. 17, no. 8, pp. 1415—1425, Aug. 1999.
[13] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, “Scenario-based performance analysis of routing protocols for mobile ad hoc networks,” Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pp. 195—206, Aug. 1999.
[14] D. Kim, S. Ha, and Y. Choi, “K-hop cluster-based dynamic source routing in wireless ad-hoc packet radio network,” Proceedings of Vehicular Technology Conference, vol.1, pp. 224—228, 1998.
[15] A. McDonald and T. Znati, “A mobility-based framework for adaptive Clustering in wireless ad hoc networks,” IEEE Journal on Selected Area in Communications, vol. 17, no. 8, pp. 1466—1487, Aug. 1999.
[16] A. K. Parekh, “Selecting routers in ad-hoc wireless networks,” Proceedings of the SBT/IEEE International Telecommunications Symposium, Aug. 1994.
[17] G. Pei and M. Gerla, “Mobility management in hierarchical multi-hop mobile wireless networks,” Proceedings of IEEE International Conference on Computer Communications and Networks, pp. 324—329, 1999.
[18] S. Sivavakeesar and G. Pavlou, “A prediction-based clustering algorithm to achieve quality of service in multihop ad hoc networks,” London Communication Symposium, 2002, http://www.ee.ucl.ac.uk/lcs/papers2002/.
[19] R. Sivakumar, P. Sinha, and, V. Bharghvan, “CEDAR: a core-extraction distributed ad hoc routing algorithm,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, Aug. 1999.
[20] M. Younis, M. Youssef, and K. Arisha, “Energy-aware management for cluster-based sensor networks,” Computer Networks: The International Journal of Computer and Telecommunications Networking, vol. 43, issue 5, pp. 649—668, 2003.