Research Article Open Access

CONSTRUCTION OF STRATEGIC CONNECTED DOMINATING SET FOR MOBILE AD HOC NETWORKS

Victor Ceronmani Sharmila1 and Amalanathan George1
  • 1 Hindustan University, India

Abstract

Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone (minimum size CDS) incurs less communication overhead. Unfortunately, computing a minimum size CDS is NP-hard and thus many algorithms were developed which concentrates on how to construct smaller CDSs. Aiming for minimum number of nodes in CDS, results in CDSs that are highly unstable. Here we present four CDS algorithms which are constructed based on strategy, density, Threshold Neighborhood Distance Ratio (TNDR) and velocity. Any node in the network can be a strategic node depending upon the application and need and will be selected as the starting node instead of the node with highest density which concentrates on minimum size CDS. Simulation methods are used to establish the efficiency of the proposed algorithm.

Journal of Computer Science
Volume 10 No. 2, 2014, 285-295

DOI: https://doi.org/10.3844/jcssp.2014.285.295

Submitted On: 18 September 2013 Published On: 16 November 2013

How to Cite: Sharmila, V. C. & George, A. (2014). CONSTRUCTION OF STRATEGIC CONNECTED DOMINATING SET FOR MOBILE AD HOC NETWORKS. Journal of Computer Science, 10(2), 285-295. https://doi.org/10.3844/jcssp.2014.285.295

  • 2,761 Views
  • 2,212 Downloads
  • 10 Citations

Download

Keywords

  • Mobile Ad Hoc Network (MANET)
  • Connected Dominating Set (CDS)
  • CDS Node Size
  • CDS Algorithms
  • Broadcast
  • Strategic Nodes