摘要
This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.
This paper proposes a connected dominating set （CDS） based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks （MANETs）, which ensures the connectivity and efficiency of the CDS. Compared with Wu＇s algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.
