An Algorithmic Approach to Improve Routing Efficiency in Mobile Ad

In wireless networks, due to the lack of fixed infrastructure or centralized administration, a Connected Dominating Set (CDS) of the graph representing the network is an ideal candidate which can serve as the virtual backbone of a wireless network. Connected Dominating Set based routing is a promising approach for enhancing the routing efficiency and communication range in case of wireless ad hoc networks. However, finding the Minimal Connected dominating set in an arbitrary graph is a NP which we will be able to enhance the “Routing Efficiency & Communication Range” of networks by choosing some specific nodes. These very specific nodes will be assumed to be “Dominator” nodes. In case of wireless networks, the node represents the Workstations and a temporary connection between them is the links which connect any two nodes. This concept can be clearer by the theory of Graph. Connected Dominating Set (CDS) has been a well known a the broadcasting storm in wireless networks