Energy efficient hybrid MCDS algorithm for MANETS

In this paper a new Hybrid Minimum Connected Dominating Set [MCDS] algorithm is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [1]. The minimum connected dominating set (MCDS) is widely used as a virtual spine for mobile ad-hoc networks. Here the MCDS is a mixture of Centralized and Distributed approaches based on Unit Disk Graph [2]. The node´s mobility and energy are also considered in the maintenance of MCDS. The time complexity of this algorithm is O (n) and the message complexity is O (n). The performance evaluation of this algorithm yields better results in both dense and sparse networks. Size of the MCDS is also optimal compared to other MCDS algorithms [3] [4] [5].