Bottom Line:
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.The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS.

ABSTRACTA 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.

Mentions:
REd is calculated at regular intervals, if this ratio for the dominator becomes less than the threshold (TH) then it will choose another equivalent node and performs activity scheduling. Here in this algorithm we have put TH as 10% of Emax because of energy requirement. We have simulated the network with various values of threshold TH (5%, 10%, 15%, and 20%) of Emax and observed that when TH = 10% of Emax maintains the tradeoff between network lifetime and message cost. When TH = 20% of Emax then frequent disconnections occur which result in high message cost and low network lifetime. When TH = 5% of Emax then network lifetime increases but the dominator node will become unavailable because the node's energy will completely drain out. The results are shown in Figure 15. Here the network is simulated with 200 nodes at various transmission ranges.

Mentions:
REd is calculated at regular intervals, if this ratio for the dominator becomes less than the threshold (TH) then it will choose another equivalent node and performs activity scheduling. Here in this algorithm we have put TH as 10% of Emax because of energy requirement. We have simulated the network with various values of threshold TH (5%, 10%, 15%, and 20%) of Emax and observed that when TH = 10% of Emax maintains the tradeoff between network lifetime and message cost. When TH = 20% of Emax then frequent disconnections occur which result in high message cost and low network lifetime. When TH = 5% of Emax then network lifetime increases but the dominator node will become unavailable because the node's energy will completely drain out. The results are shown in Figure 15. Here the network is simulated with 200 nodes at various transmission ranges.

Bottom Line:
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.The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS.

ABSTRACTA 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.