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

© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4477438&req=5

Mentions: Algorithm Phases 3 and 4. This phase plays a crucial role where it prunes the previous CDS to obtain optimal CDS and it performs activity scheduling (Phase 4) among different adjacent dominators (BLACK nodes) with at most the same N1 list to conserve the dominator's energy. Activity scheduling shifts the role of dominators at intervals, δT and their residual energies REs are also calculated as shown in (3). That is, the equivalent adjacent dominators turn on (WAKEUP) and off (SLEEP) alternatively to conserve the energy and increase the lifetime without compromising the delivery ratio. Here a new regular interval based activity scheduling algorithm is designed to suit the mobility of nodes. Here we maintained a trade-off between optimal CDS and number of dominators to perform the activity scheduling (see Algorithms 3 and 4).


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

Penumalli C, Palanichamy Y - ScientificWorldJournal (2015)

© Copyright Policy - open-access
Related In: Results  -  Collection

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

Mentions: Algorithm Phases 3 and 4. This phase plays a crucial role where it prunes the previous CDS to obtain optimal CDS and it performs activity scheduling (Phase 4) among different adjacent dominators (BLACK nodes) with at most the same N1 list to conserve the dominator's energy. Activity scheduling shifts the role of dominators at intervals, δT and their residual energies REs are also calculated as shown in (3). That is, the equivalent adjacent dominators turn on (WAKEUP) and off (SLEEP) alternatively to conserve the energy and increase the lifetime without compromising the delivery ratio. Here a new regular interval based activity scheduling algorithm is designed to suit the mobility of nodes. Here we maintained a trade-off between optimal CDS and number of dominators to perform the activity scheduling (see Algorithms 3 and 4).

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