Due to limitations of MANETs such as dynamic topology and energy consumption and control overhead, network clustering is one of the promising solutions. Most of clustering algorithms are too complicated and not considering these limitation. To effectively solve some of those problems, this paper proposes a new efficient clustering algorithm based on MOBIC, named EMOBIC. Then we use it to replace the Lowest-ID clustering algorithm in CBRP routing protocol. New algorithm takes into account the mobility and residual energy. We evaluate rate of cluster-head changes, normalization routing overhead and packet delivery ratio in network simulator 2. Comparisons denote that EMOBIC has better performances with respect to the MOBIC and Lowest-ID in CBRP routing protocol.

Keywords