| Summary: | 碩士 === 朝陽科技大學 === 資訊與通訊系 === 107 === Mobile Ad-hoc NETwork (MANET) is a dynamic network topology and their messages are exchanged or forwarding by each mobile node. However, the broadcasting messages in a MANET waste a lot of bandwidth and cause packet collisions. As a result, the routing performance is reduced and the energy of the node is wasted. Therefore, an efficient routing algorithm between mobile nodes needs to be proposed to solve the above problem. Connected Dominating Set (CDS) is proposed to construct a virtual backbone for MANET. The main concept of CDS is to reduce the search space for the route to the mobile node in the set. Namely, the CDS can be invoked to reduce the bandwidth and energy consumed by routing messages. Then, the virtual backbone can avoid packet collisions and enhance the scalability of the network. However, the previous CDS algorithms cannot find the minimum number of CDS in MANET due to the random distribution of mobile nodes. Therefore, a decentralized Nominate-CDS (Nom-CDS) algorithm is proposed to solve above problems. The concept of Nom-CDS is that each node selects the most influential neighbor node as a member of the CDS, then prunes CDS and ensures the CDS connectivity state. Finally, the simulation results show that the Nom-CDS algorithm can obtain a smaller number of CDS than others.
|
|---|
