CONSTRUCTION OF STRATEGIC CONNECTED DOMINATING SET FOR MOBILE AD HOC NETWORKS

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.