Connected Dominating Set in Sensor Networks and MANETs (original) (raw)
Related papers
RCDS: A Ranking-Based Algorithm to Compute the CDS of the Ad Hoc Networks
2008
is the foundation to build virtual backbone subnet or deploy layered routing in ad hoc or wireless sensor networks where packet flooding is extensively used. Current algorithm generally falls into two types: cluster-based and direct algorithm. This paper proposes a direct algorithm with linear time and message complexity. Our algorithm RCDS partitions the network nodes into dominators and dominatees. RCDS is a greedy algorithm which always chooses the farther and steadier node as future dominators. The experiment result shows that RCDS can construct smaller CDS than other algorithms.
International Journal of Engineering Research and Technology (IJERT), 2015
https://www.ijert.org/a-survey-on-connected-dominating-sets-cds-both-in-the-wireless-sensor-networks-and-wireless-ad-hoc-networks https://www.ijert.org/research/a-survey-on-connected-dominating-sets-cds-both-in-the-wireless-sensor-networks-and-wireless-ad-hoc-networks-IJERTV4IS020642.pdf Wireless sensor networks consist of large number of tiny sensors that are deployed randomly. The sensor nodes may be static or mobile forming ad hoc or Sensor networks respectively. These two networks have few similar properties but have their own uniqueness. The ad hoc networks have node mobility. Energy consumption is a fundamental issue in both wireless ad hoc and sensor networks.Sensor nodes in the network monitor different regions of an area.To extend the lifetime of the network and to improve the performance we construct the connected dominant sets (CDS). The CDS acts as the virtual backbone of the network. Given a query over the sensor networks the minimum connected sensor, it should cover the full coverage area. A single sensor node failure in the connected dominant sets leads to network portioning and loss of connectivity. In this paper different types of algorithms of CDS and related problems were discussed. Adding to that some open problems and issues also proposed in this paper.
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization, topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages; however, this minimization is NP complete problem; therefore, approximation algorithms are used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm; however, it generates a relatively high signaling overhead. Utilizing the location information of network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we compare the performance of Wu and Li algorithm with its Location-Information-Based version under two types of Medium Access Control protocols, and several network sizes. The MAC protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use of a virtual ideal MAC enables us to investigate how the real-world performance of these algorithms deviates from their ideal-conditions counterpart. The simulator used in this research is the ns-2 network simulator.
Omparison of Manet S CDS C Reation a Lgorithms U Sing I Deal Mac and Ieee 802 . 11 Mac
2013
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization, topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages; however, this minimization is NP complete problem; therefore, approximation algorithms are used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm; however, it generates a relatively high signaling overhead. Utilizing the location information of network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we compare the performance of Wu and Li algorithm with its Location-Information-Based version under two types of Medium Access Control protocols, and several network sizes. The MAC pr...
Connected dominating sets in wireless ad hoc and sensor networks – A comprehensive survey
Computer Communications, 2013
Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed.
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
2011
The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad hoc networks. Although many distributed algorithms for constructing the CDS have been proposed, nearly all of them require two or more separated phases, which may cause problems such as long delay in the later phases when the network size is large. This paper proposes a Distributed Single-Phase algorithm for constructing a connected dominating set, DSP-CDS, in ad hoc networks. The DSP-CDS is an asynchronous distributed algorithm and converges quickly in a single phase. Each node uses one-hop neighborhood information and makes a local decision on whether to join the dominating set. Each node bases its decision on a key variable, strength, which guarantees that the dominating set is connected when the algorithm converges. The rules for computing strength can be changed to accommodate different application needs. The DSP-CDS adapts well to dynamic network topologies, upon which the algorithm makes only necessary local updates to maintain the CDS of the network. The performance of the DSP-CDS can be tuned by adjusting two main parameters. Extensive simulations have demonstrated that those parameters can affect the CDS size, the CDS diameter, and number of rounds for the algorithm to converge. Comparisons with other multiple-phase CDS algorithms have shown that the DSP-CDS converges fast and generates a CDS of comparable size.
Connected Dominating set based Algorithm in MANET for Efficient Routing
2014
— A wireless ad hoc network is a notable type of network in which a collection of mobile nodes with wireless network interfaces may form a temporary network, without use of any fixed infrastructure or centralized control. The Dynamic Source Routing protocol (DSR) is a efficient routing protocol explicitly designed for multi-hop wireless ad hoc networks of mobile nodes. A connected dominating set (CDS) is used to reduce broadcast overhead in the network. In this paper, we have narrated the design of multi-hop routing in mobile ad hoc network with the help of MCDS.
Enhancing the Performance of Routing in Mobile Ad Hoc Networks using Connected Dominating Sets
Connected Dominating Sets (CDS) are very useful in improving the routing for Mobile Ad Hoc Networks (MANETs). A CDS will act as a virtual backbone for communication in the ad hoc networks. Due to the importance of the CDS in routing, formation and selection of the CDS will have significance impact on routing and performance of the network. In the literature number of metrics was proposed to select and form a CDS in a network. In this paper, we studied and analyzed algorithms to construct CDS based on different metrics. The algorithms examined include Minimum Velocity-based CDS (MinV-CDS), Maximum Density CDS (MaxD-CDS), Node IDbased CDS (ID-CDS), Node Stability Index-based (NSI-CDS) and Strong-Neighborhood based CDS (SN-CDS). The performance metrics for the CDS are its Node size, Edge size, Lifetime, Hop count per path, Diameter and Energy index.