| Summary: | 碩士 === 明新科技大學 === 資訊管理研究所 === 102 === In a wired or wireless network, routing efficiently among immobile or mobile devices is an important issue. A routing based on connected dominating sets is considered as an efficient approach. The connected dominating set can be served as a virtual backbone of a network, and it always adapted easily to new network topology. A virtual backbone is a set of vertices which can help with routing. Any vertex outside the virtual backbone can send messages or signals to another vertex through the virtual backbone. So the virtual backbone has great benefits to routing and management of networks. We may impose a virtual backbone to support short path routing, fault-tolerant routing, multicasting, and radio broadcasting, etc. Furthermore, a virtual backbone of a wireless network may reduce communication overhead, increase bandwidth efficiency, and decrease energy consumption.
Therefore, to establish a network with minimum connected dominating set is an important issue. However, the minimum connected dominating set problem is NP-hard in interconnection networks. In recent years, many literature references discussed minimum connected dominating sets with various algorithms on many wired and wireless networks. The authors in literature reference [11] proposed a construction scheme of the minimum connected dominating set on an n-dimensional hypercube network in 2012. With their construction scheme, the minimum connected dominating set contains 2n2 + 2 vertices. In this thesis, we propose a different construction scheme for the minimum connected dominating set of an n-dimensional hypercube.
|
|---|
