An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

Abstract EN

A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed.

This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node’s remaining energy.

The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN].

The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks.

Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG].

The node’s mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS.

The performance is evaluated at various node densities, various transmission ranges, and mobility rates.

The theoretical analysis and simulation results of this algorithm are also presented which yield better results.