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

Penumalli C, Palanichamy Y - ScientificWorldJournal (2015)

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.

View Article: PubMed Central - PubMed

Affiliation: Department of Information Science & Technology, Anna University, Chennai 600025, India.

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

No MeSH data available.


Related in: MedlinePlus

MANET after algorithm phase 1 with DS.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4477438&req=5

fig3: MANET after algorithm phase 1 with DS.

Mentions: This phase is illustrated with sample MANET topology as shown in Figure 1. After the exchange of IDs and RE (initially not counted) as shown in Figure 2, the nodes with the highest number of neighbors and lowest IDs form as dominating set, DS (BLACK nodes) = {5,13,18} as shown in Figure 3. After this algorithm, phase 2 is implemented.


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

Penumalli C, Palanichamy Y - ScientificWorldJournal (2015)

MANET after algorithm phase 1 with DS.
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4477438&req=5

fig3: MANET after algorithm phase 1 with DS.
Mentions: This phase is illustrated with sample MANET topology as shown in Figure 1. After the exchange of IDs and RE (initially not counted) as shown in Figure 2, the nodes with the highest number of neighbors and lowest IDs form as dominating set, DS (BLACK nodes) = {5,13,18} as shown in Figure 3. After this algorithm, phase 2 is implemented.

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.

View Article: PubMed Central - PubMed

Affiliation: Department of Information Science & Technology, Anna University, Chennai 600025, India.

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

No MeSH data available.


Related in: MedlinePlus