|dc.description.abstract||The connected dominating set (CDS) has been extensively used for
routing and broadcast in mobile ad hoc networks. While existing CDS
protocols are successful in constructing CDS of small size,
they either require localized information beyond immediate neighbors, lack the mechanism to properly handle nodal mobility, or involve lengthy
recovery procedure when CDS becomes corrupted. In this paper, we introduce the tree-based CDS protocols, which first elect a number of initiators distributively and then utilize timers to construct a CDS from initiators with the minimum localized information. We demonstrate that our CDS protocols are capable of maintaining CDS in the presence of changes of network topology. Depending on the number of initiators, there are two versions of our tree-based CDS protocols. The Single-Initiator (SI) works the best when the network diameter is given. On the other hand, the Multi-Initiator version (MI) built on top of SI is a localized CDS protocol and possesses all of the advantages of SI. We evaluate our protocols by both the ns-2 simulation and an analytical model. Compared with the other known CDS protocols, the simulation results demonstrate that both SI and MI produce and maintain CDS of very competitive size. The analytical model shows the expected convergence time and the number of messages required by SI and MI in the construction of CDS, which match closely to our simulation results. This helps to establish the validity of our simulation.
In addition to the two tree-based CDS protocols, we proposed the two post optimization techniques, Fast-Convergence Dominator Tree Construction (FC-DTC) and Extended Mobility Handling (EMH). FC-DTC significantly reduces the convergence time required by SI and MI, and EMH enables SI and MI to adapt to the topology changes more efficiently. The simulation and analytical studies demonstrate these extensions drastically improve the performance of SI and MI.||en