Connected Dominating Set Construction Research Articles

Constructing Connected-Dominating-Set with Maximum Lifetime in Cognitive Radio Networks

Connected-dominating-set (CDS) is a representative technique for constructing virtual backbones of wireless networks and thus facilitates implementation of many tasks including broadcasting, routing, etc. Most of existing works on CDS aim at constructing the minimum CDS (MCDS), so as to reduce the communication overhead over the CDS. However, MCDS may not work well in cognitive radio networks (CRNs) where communication links are prone to failure due to stochastic activities of primary users (PUs). A MCDS without consideration of the stochastic activities of PUs easily becomes invalid when the PUs become active. This study addresses a new CDS construction problem by considering the PUs’ activities. Our problem is to maximize the lifetime of the CDS while minimizing the size of the CDS, where the lifetime of a CDS is defined as the expected duration that the CDS is maintained valid. We show that the problem is NP-hard and propose a three-phase centralized algorithm. Given a CRN, the centralized algorithm can compute a CDS such that the lifetime of the CDS is maximized (optimal), and the size of the CDS is upper-bounded. We further present a two-phase localized algorithm which requires 2-hop information. Extensive simulations are conducted to evaluate the proposed algorithms.

Sustainable Maintenance of Connected Dominating Set by Solar Energy Harvesting for IoT Networks

A new scheme, Sustainability in Dominating Set (SID), to construct and maintain a sustainable and adaptive node disjoint weighted connected dominating set (CDS) is presented for solar energy harvesting-enabled Internet of Things (IoT) networks. The primary contribution of this work is the design of an approximation algorithm for CDS construction and maintenance in energy harvesting-enabled IoT networks, which is triggered when energy of any CDS node falls below a threshold. This is a new CDS construction approach of approximation ratio <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\frac {\delta w(G) + 1}{2} + (1 + \ln 5) |O_{p}|$ </tex-math></inline-formula> , where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta w(G)$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$|O_{p}|$ </tex-math></inline-formula> are weighted average degree of the network and optimal number of Steiner nodes, respectively. The extensive simulation results show that per-slot-rotation-based SID (SIDS) improves residual energy (saves by 14.3%, 25.6%, 8.25% and 8%), message complexity (reduces by 88.5%, 34% and 72.75% and 83.25%), and average CDS size (reduces by 9.01%, 9.09%, 41.75%, and 54.5%) for two scenarios and cloud cover 0.25, 0.5 and 0.8, compared to LMW, Improved LMW (ILMW), DataCDS and UCDS, respectively. Merely based on threshold switching, SID enhances residual energy, message complexity, and CDS size by 3.08%, 51.88%, and 4% for all scenarios and cloud covers compared to SIDS, respectively.

A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks

Energy efficiency is one of the major issues in wireless sensor networks (WSNs) that lack a fixed infrastructure and centralized control. In order to prolong the network lifetime, a connected dominating set (CDS) has been widely used as a virtual backbone in WSNs. The sensor nodes in WSNs are prone to failure due to a lack of battery, hardware damage, link failure, or environmental interference. Therefore, designing an energy-efficient and fault-tolerant CDS algorithm is quite vital in WSNs. A non-masking fault tolerance method denoted self-stabilizing tolerates any finite number of transient faults. In this paper, we propose a fault-tolerant distributed algorithm for a minimal capacitated CDS (CapCDS) construction in WSNs. To the best of our knowledge, this is the first distributed self-stabilizing CapCDS algorithm. It makes an illegitimate system legitimate at most (n23+2n) moves by using an unfair distributed scheduler where n is the number of nodes. The performance of the algorithm is validated through extensive experimental testbeds and simulations.

CDS-Based Topology Control in FANETs via Power and Position Optimization

In a flying ad hoc network (FANET), reliable maintenance of topology confronts a huge challenge due to the highly time-varying connectivity between flying nodes. Aiming at mitigating this issue, this letter proposes a connected dominating set (CDS) based topology control mechanism iteratively for the FANETs by solving a jointed optimization problem on adjusting the node's transmission power and position during the construction of CDS. In particular, a well-tailored group of the topology constructing and maintaining algorithms are developed with a time-discretized approach. Simulation results show that the proposed mechanism has a better performance with respects to overheads and network stability than a general particle swarm optimization (PSO) algorithm, especially in a typical swarm pattern for unmanned aerial vehicle (UAV) team.

RETRACTED ARTICLE: Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks

Efficient routing and broadcasting among a set of nodes play a critical role in wireless adhoc networks. for energy efficient routing, a connected dominating set (CDS) based virtual backbone is a promising approach. In the network, one-hop neighbors are selected as multi point relay (MPR) by each node to cover all its two-hop neighbors for the purpose of broadcasting and 2-hop repair. To improve the network lifetime, energy efficient MPR based CDS construction has been proposed by considering the node degree, energy level, node ID and velocity of the node. We also propose a route discovery protocol to relay route request messages, which makes use of the CDS nodes to obtain a stable routing path; 2-hop repair for route maintenance, which reduces the path damage (reduced control packets with lesser consumption of bandwidth) and broadcast storm problem. The simulation results show that the proposed protocol increases the network lifetime up to 30% than other works and effectively repair damaged routes by reducing control packets.

A balanced energy efficient virtual backbone construction algorithm in wireless sensor networks

A steady increase in the number of Wireless Sensor Networks (WSN) applications in day-to-day life lead to the design of new algorithms and protocols to solve their various issues such as energy efficiency, topology control and data gathering. Energy efficiency can be achieved by focusing on the communication part, since the communication cost is higher than that of the computation. The use of Connected Dominating Set (CDS) as the virtual backbone for data transmission towards the Base Station improves the network lifetime. Therefore, a Balanced Energy Efficient Virtual Backbone Construction (BEE-VBC) algorithm in WSN is proposed in this paper using the well-known heuristic Genetic Algorithm (GA). This work emphasizes on the design of fitness function using multiple factors such as energy, coverage of neighbors, reliability, data rate, and traffic deviation. The CDS construction using the maximum fitness nodes, provides network longevity. This ensures a steady connectivity among the dominator nodes and path towards the BS, thus improving the quality of the solution. The simulation experiments have been carried out and compared with a few CDS-based and clustering-based algorithms to show the performance improvement achieved in the proposed work.

Efficient Connected Dominating Set Construction with Maximum Lifetime in the Cognitive Radio Networks

Connected dominating set (CDS) is the most representative technology for constructing a virtual backbone in wireless networks and plays an important role in wireless applications including broadcasting, routing and so on. In a cognitive radio networks, the lifetime and efficiency are two important indices for measuring CDS algorithms due to the random activities of primary users (PUs). However, to the best of our knowledge, the existing algorithms for CDS construction in CRNs ignore the execution effectiveness instead of lifetime. In this paper, we propose a four-phase distributed algorithm to maximize the lifetime of CDS while guaranteeing the effectiveness of the algorithm. The proposed algorithm terminates in O(N3 log N) timeslots, which is more effective than that of O(N4).

A Novel Distributed algorithm for constructing virtual backbones in wireless sensor networks

In Wireless Sensor Networks (WSNs), energy saving techniques are critical for efficient routing. The Connected Dominating Set (CDS) used as a virtual backbone for saving energy in WSN has been extensively studied in the past two decades. Since the time complexity and performance ratio are two important metrics to evaluate algorithms, reducing the time expenditure of algorithm and the total number of sensors in CDS are two key problems for CDS construction. In this paper, we propose a novel distributed algorithm, Dominating Set based on Link and Degree and Connecting Tree (LDDS-CT), to find a Minimum CDS (MCDS). LDDS-CT is divided into two phases. In the first phase, a Dominating Set (DS) is constructed using LDDS. In the second phase, a CT algorithm for connecting all sensors in DS is proposed, which can guarantee the number of connectors added to DS is minimized. This paper proves that the time cost of LDDS-CT is at most 2.25n and the performance ratio of LDDS-CT is at most 14.798opt+9.748, where n is the number of sensors and opt is the size of any MCDS. To the best of our knowledge, LDDS-CT is the fastest two-phased distributed algorithm for MCDS construction with unknown network topology. And the performance ratio of the proposed algorithm is close to the sate-of-the-art algorithms in theory. The simulation results show that LDDS-CT outperforms the existing distributed algorithms.

Construction and maintenance of k-hop CDS in MANET with two classes of mobile terminals

Since mobile ad hoc networks (MANETs) do not have fixed or predefined infrastructures, nodes need to frequently flood control messages to discovery and maintain routes, which causes performance problems in traffic and energy consumption, contention, and collision. A general solution is to construct a virtual backbone as the basis of routing and broadcasting, and the connected dominating set (CDS) has been widely used. This paper presents a distributed approach to constructing and maintaining a k-hop CDS in the MANET with two classes of nodes. A unique characteristic that differentiates the proposed approach from existing ones is that, any value can be specified for k, and a larger k contributes to a smaller CDS. If k is large enough, the resulting CDS will contain only a single node. Especially, the constructed CDS will be more robust, and will be little affected by the topology change of a MANET.

Construction and maintenance of k-hop CDS in MANET with two classes of mobile terminals

Since mobile ad hoc networks (MANETs) do not have fixed or predefined infrastructures, nodes need to frequently flood control messages to discovery and maintain routes, which causes performance problems in traffic and energy consumption, contention, and collision. A general solution is to construct a virtual backbone as the basis of routing and broadcasting, and the connected dominating set (CDS) has been widely used. This paper presents a distributed approach to constructing and maintaining a k-hop CDS in the MANET with two classes of nodes. A unique characteristic that differentiates the proposed approach from existing ones is that, any value can be specified for k, and a larger k contributes to a smaller CDS. If k is large enough, the resulting CDS will contain only a single node. Especially, the constructed CDS will be more robust, and will be little affected by the topology change of a MANET.

Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Efficient routing between nodes is the most important challenge in a Mobile Ad Hoc Network (MANET). A Connected Dominating Set (CDS) acts as a virtual backbone for routing in a MANET. Hence, the construction of CDS based on the need and its application plays a vital role in the applications of MANET. The PipeLined Strategic CDS (PLS-CDS) is constructed based on strategy, dynamic diameter and transmission range. The strategy used for selecting the starting node is, any source node in the network, which has its entire destination within a virtual pipelined coverage, instead of the node with maximum connectivity. The other nodes are then selected based on density and velocity. The proposed CDS also utilizes the energy of the nodes in the network in an optimized manner. Simulation results showed that the proposed algorithm is better in terms of size of the CDS and average hop per path length. ACM CCS (2012) Classification : Networks → Network Protocols; Networks → Network types → Ad hoc networks → Mobile ad hoc networks *To cite this article: C. Sharmila and G. Amalanathan, Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks, CIT. Journal of Computing and Information Technology , vol. 24, no. 2, pp. 121–132, 2016.

Target-Aware, Transmission Power-Adaptive, and Collision-Free Data Dissemination in Wireless Sensor Networks

Software update in wireless sensor networks requires the ability of disseminating bulk data to specified sensors of a network with low latency in an energy efficient manner. This paper proposes a target-aware, transmission power-adaptive, and collision-free data dissemination protocol to fulfill these requirements. This protocol disseminates data to sensors of a network by first constructing a connected dominating set (CDS) in the network. We propose a target-aware CDS construction to exclude many unnecessary non-target sensors from the data dissemination process. By allowing some dominators of the CDS to increase their transmission power to disseminate data to more dominatees, the protocol efficiently reduces the total energy consumption. In addition, we propose a collision-based channel assignment strategy to eliminate communication collisions among dominators so as to reduce latency. We have implemented the protocol and evaluated it through simulations and a real application scenario. Our experimental results show that the proposed protocol at most reduces non-target sensors by 75.3%, total energy consumption by 57.1%, and latency by 39.8% compared to existing dissemination protocols.

An Efficient Timer Based Minimum Path D-Equivalence CDS Construction for Wireless Adhoc Networks

Objective: The main intent of this research is to enhance the network capacity and compute the shortest path for reducing congestion in the wireless adhoc networks. Methods: In this manuscript, an innovative technique is introduced which is used to enhance the performance of α-MOC-CD based broadcasting and routing by using D equivalence classes of CDS. With that, we also apply minimum spanning tree for calculating the shortest path for avoiding the congestion to accomplish proficient broadcasting and routing in wireless networks. Results: The alpha-DEC-MOC-CDS (alpha-D-equivalence classMOC-CDS) shows high network capacity when compared to the existing alpha-MOC-CDS. The proposed method improves the network capacity by using D equivalence classes and also the minimum spanning tree is used to recognize the shortest path. If the number of iterations is increased, the transmission capacity in alpha-DEC-MOC-CDS is 4.07, the medium, routing path length is 6.72 and the average routing path length is 5.73. The comparison result shows that the proposed method achieves better network capacity when compared to the existing system. Conclusion: The findings demonstrate that the alpha-D-equivalence class-MOC-CDS method is presented and suggested that this method high network capacity.Keywords: ConnectedDominating Set(CDS),D-Equivalence Classes, Minimum Routing Cost CDS (α-MOC-CDS), Minimum Support Tree, Shortest Path

On mobility handling of sub-optimal timer-based CDS construction

Connected dominating sets (CDSs) can be used as virtual backbones in mobile ad hoc networks (MANETs) to simplify the design of network primitives and improve their performance. An ideal CDS protocol for MANETs should create a small CDS and adapt to nodal mobility. Unfortunately, none of the CDS protocols capable of mobility handling have been shown to create a sub-optimal CDS in the past. In this paper, we first prove that our timer-based CDS protocols create a CDS with a sub-optimal size. Although the approximation factors of our timer-based protocols are not the best known result, our protocols can easily accommodate nodal mobility. In addition, we propose the Extended Mobility Handling (EMH) procedures for timer-based CDS protocols to further enhance CDS maintenance in MANETs. Simulation results show that our protocols incorporating EMH successfully prolong the CDS service time while maintaining a competitive size of CDS in MANETs.

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

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.

Cooperative Approaches to Construction and Maintenance of Networks’ Virtual Backbones for Extreme Wireless Sensor Applications

Wireless sensing technology is becoming a new scientific instrument for environmental monitoring under extreme conditions. This class of applications requires reliable, energy-efficient, and self-organizing approaches. Connected dominating sets (CDSs) have been widely used for virtual backbone construction in unstructured wireless sensor networks to control topology, facilitate routing, and extend network lifetime. This paper proposes two distributed algorithms for CDS construction and maintenance in extreme wireless sensor networks. The proposed approaches efficiently construct and maintain a small CDS for challenging environments. Simulation shows that our proposed approaches provide significant energy efficiency without introducing any performance degradation in terms of CDS size.

Distributed Energy-Efficient Approaches for Connected Dominating Set Construction in Wireless Sensor Networks

Energy efficiency is one of the major issues in wireless sensor networks (WSNs) and their applications. Distributed techniques with low message and time complexities are expected in WSNs. Connected dominating sets (CDSs) have been widely used for virtual backbone construction in WSNs to control topology, facilitate routing, and extend network lifetime. Most of the existing CDS approaches suffer from a very poor approximation ratio, high time, and message complexities. This paper proposes two novel approaches for CDS distributed construction in WSNs. The proposed approaches are intended to construct a small CDS as well as allowing energy-efficient CDS construction and maintenance in WSNs. Simulation shows that our distributed approaches have an approximation factor of 7.5 to the optimal CDS. This approximation outperforms the existing distributed CDS construction algorithms.

Trusted-CDS Based Intrusion Detection System in Wireless Sensor Network (TC-IDS)

Security mechanism is a fundamental requirement of wireless networks in general and Wireless Sensor Networks (WSN) in particular. The Intrusion Detection System (IDS) has become a critical component of wireless sensor networks security strategy. There are several architectures for embedding IDS in WSN. Due to Energy Limitation, in this paper we use a distributed architecture which activates intrusion detection system for limited number of nodes. For this purpose we select a secure set of nodes called secure Connected Dominating Set (CDS). In this paper first, we propose a heuristic for selecting CDS based on weighing factor which uses the trust value. Trust is based on reputation and reputation refers to the opinion of one node about another node. Hence only well behaving and good quality nodes are selected as a dominant node for CDS construction. Then we activate IDS on these selected node set. In our proposed work the task of all dominating nodes is to discover any attack and threat that can affect the normal behavior of sensor nodes by analyzing actual status of a node, packet sent and received by node and measurement made to the environment. The simulation results show that our TC-IDS model have high packet delivery ratio, high throughput and low delay than existing IDS Schemes such as Lightweight IDS.

Algorithms for Constructing Strongly Connected Dominating Set in Heterogeneous Wireless Sensor Networks

Energy-efficient routing is a very important issue in wireless sensor networks. An efficient routing method can avoid unnecessary data transmission and thus saves more power to extend the life of a network. The Connected Dominating Set (CDS) is a commonly used routing method which serves as a virtual backbone for a sensor network to achieve better transmission performance. The primary advantage of a CDS is its ability to adapt to the rapidly changed network topology. The construction of the CDS is a well-studied problem in an undirected unit disk graph, in which sensors are assumed to have the same transmission range. However, in practice, the sensors could have different transmission ranges due to their residual power or energy-saving mechanisms. The difference of transmission radius may form a one-way link between two nodes. Therefore, in this paper, we model the network as a directed graph and consider the CDS construction problem in such environment. We propose algorithms to construct a Strongly Connected Dominating Set (SCDS) which is a routing backbone that provides the service of efficient bidirectional data transmission between any two sensor nodes in the network.

Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks

One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.