Connected Dominating Set Research Articles

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.

The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network

We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).

FellowMe Cache: Fog Computing approach to enhance (QoE) in Internet of Vehicles

Among metrics that highly affect video quality and quality of experience (QoE), we can cite the delay and cost transmission caused by mobile network overhead. Moreover, Information centric networking (ICN) is a new architecture that is proposed as a technique that offers very high throughput rates and very low latency, especially in QoE sensitive applications such as multimedia content delivery for the future communication networks. Indeed, unused memory in user equipment can be used to cache contents and afford it to the other nearby users on demand. This caching method is considered as one of the most promising solutions to enhance the QoE of users. On the other hand, one of the major research goals is to improve caching nodes decision based on nodes’ characteristics. In this paper, we propose a new programmable architecture named FollowMeCache based on Software Defined Network (SDN), ICN approaches and Fog Computing for cache node selection using the Connected Dominating Sets (CDS) in order to reduce the download delay and cost for the users’ requested video. In fact, we define cache node selection algorithm based on Influence factor to elect the appropriate nodes from the CDS set to build the cache. This metric takes into consideration the connectivity degree, Zone of Interest (ZI), node capacity, user preference and its location. In order to evaluate the proposed solution, we define a smart event use case. The performance evaluation is conducted by using network simulator and the obtained results show that our approach can give significant gain in terms of network throughput and the transmission delay.

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search.

In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.

REINFORCEMENT LEARNING BASED VIRTUAL BACKBONE CONSTRUCTION IN MANET USING CONNECTED DOMINATING SETS

Construction of virtual backbones in MANETs for establishing the routes using Connected Dominating Set (CDS), is an prominent area of research in wireless networks. In addition, Reinforcement Learning (RL) is becoming popular due to its effective exploration process. MANET routing is highly challenging, as the network topology is highly dynamic. The broadcast of route request packet creates broadcast storm due to multiple retransmission of the packet. Due to the constant movement of the nodes, routing decisions are harder to resolve. Hence, this paper proposes an efficient routing technique in MANET using Graph Connected Dominating Sets and Reinforcement Learning. The Q Learning algorithm is used to measure and find the best nodes for constructing the CDS. Link stability and residual energy are the parameters used for estimating the reward values. The algorithm is implemented in NS2 and results are found to be promising and improve the performance of the network.

A game theoretic approach for minimal connected dominating set

Connected dominating set (CDS) is a subset of vertices in a graph which dominates all vertices and induces a connected subgraph. This paper proposes a game theoretic approach to find a CDS, and proves that starting from a non-trivial initial state, every non-trivial Nash equilibrium is a minimal CDS and reaching a non-trivial Nash equilibrium needs O(n) rounds in the worst case.

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.

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs

The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this paper, we formulate a new stochastic variant of the problem. In this problem, each node in the graph has a hidden random state, which represents whether the node is active or inactive, and we seek a CDS of the graph that consists of the active nodes. We consider an adaptive algorithm for this problem, which repeat choosing nodes and observing the states of the nodes around the chosen nodes until a CDS is found. Our algorithms have a theoretical performance guarantee that the sum of the weights of the nodes chosen by the algorithm is at most $O(\alpha \log (1/\delta))$ times that of any adaptive algorithm in expectation, where $\alpha$ is an approximation factor for the node-weighted polymatroid Steiner tree problem and $\delta$ is the minimum probability of possible scenarios on the node states.

Performance of Algorithms using Domination Theory in Wireless Sensor Network with NS2

To prologue about a wireless sensor network let us understand network originally; how to connect host computers as well as communicate. Computers that are connected together are represented as topology, there are different types to name them star, bus, mesh, and grid. Researchers represented it as TCP i.e., transmission control protocol that has to be a wired connection through the network. As researcher worked, even without wired connection to the host computers could even be communicated through UDP called user datagram protocol. UDP gave nativity to the wireless sensor network, it has its own pros and cons. Now a day, there are a number of types of wireless sensor network like adhoc network, under water sensor network and vehicular sensor network. An organized design of routing protocol is available in wireless sensor network, and then Connected Dominating Set (CDS) is broadly used as a essential part as a backbone. To construct the Connected Dominating Set with its size as minimum, meta-heuristic, greedy, approximation, heuristic and distributed algorithmic approaches are predictable. These approaches are concentrated on deriving independent set and then constructing the Connected Dominating Set using Steiner tree, Unit Disk Graph and algorithms gives better result when graph has lesser number of nodes. For the networks that are generated in a fixed simulation area. A new approach is used for building Connected Dominating Set based on the concept of Edge Dominating Set.

An Algorithm to Construct Minimum Velocity Based Stable Connected Dominating Sets for MANETs using Strong Neighborhoods

Abstract This paper investigates a stable connected dominating set (CDS) construction algorithm for mobile ad hoc networks(MANETs). The proposed algorithm is based on the node velocity using the notion of Strong Neighborhood determined by the Threshold Neighborhood Distance Ratio (TNDR) constraint, which contributes to a stable CDS without considering unstable edges in the network. If a node has the lowest speed in all competing nodes with at least one neighbor that has not been explored, it is selected as a dominator. When a node becomes a CDS node, we say that all its neighbors are explored and have the opportunities to participate in the next iteration. This process of selecting nodes continues until all nodes in the network are explored. The tradeoff is that the size of the nodes and edges in CDS are slightly larger.

Towards Minimum Inter-Controller Delay Time in Software Defined Networking

Abstract The fundamental idea behind Software Defined Networking (SDN) architectures is to decouple the control plane and data plane of the network to simplify the complexity of the network and centralize the control plane. A major feature of an SDN is the ability to have the controllers distributed over the network to solve the problem of a single point of failure at the controller, and to increase scalability and flexibility. Despite the flexibility and scalability of using multiple controllers, which facilitates the use of a larger number of network switches, yet the intercommunication cost between distributed controllers is still a key challenge in SDN. This paper presents an effective approach for the controller placement problem in software defined networks that aim to minimize the communication delay time between the controllers and the delay time between controller and switch. The major concept employed in this work is the Connected Dominating Set (CDS). Furthermore, an algorithm using the Minimum Connected Dominating Set (MCDS) is presented in which the delay time between the distributed SDN controllers is minimized. Simulation results are presented to show the efficiency of our approach compared to previous methods.

New Computation of Resolving Connected Dominating Sets in Weighted Networks

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the graph are connected to vertices in the CDS. The connected dominating set with minimum cardinality, or minimum CDS (MCDS), is an adequate virtual backbone for information interchange in a network. When distinct vertices of G have also distinct representations with respect to a subset of vertices in the MCDS, it is said that the MCDS includes a resolving set (RS) of G. With this work, we explore different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.

Energy Measure Semigraph-Based Connected Edge Domination Routing Algorithm in Wireless Sensor Networks

In wireless sensor networks (WSNs), batteries are used as power source which is limited, and replacement of the battery is difficult. Since communication between nodes consumes most of the node power, topology-based power control is essential for reducing energy consumption. It is necessary to use optimized topology-based energy control model, so the selected nodes are used to generate a virtual backbone, which reduces unwanted routing of data. The virtual backbone for optimized topology can be created by connected dominating set (CDS) of graph theory. However, generating the virtual backbone by using the CDS algorithm is an NP-hard problem because of larger network size. To overcome this problem, in this paper, a novel distributed connected edge dominating set-based semigraph model (S-CEDS) is proposed. The performance ratio of the proposed S-CEDS is measured as (4 + ln∆′) |opt|, where |opt| represents the network size. The proposed S-CEDS is implemented using the ns-2 simulator and evaluated with conventional routing protocols such as AODV and DSDV. The results show that the proposed S-CEDS approach increases throughput and network lifetime. Also, it reduces energy consumption and average number of hops required for data transmission.

An Efficient Connected Dominating Set Clustering Based Routing Protocol with Dynamic Channel Selection in Cognitive Mobile Ad Hoc Networks

In mobile ad-hoc networks (MANETs), nodes are mobility naturally which renders a great challenge in topology controls. Connected dominating set (CDS) has been considered as an efficient solution to solve such a problem by constructing a virtual backbone network to achieve the scalability and efficiency of wireless networks. In this paper, we propose an efficient connected dominating set clustering based routing protocol with dynamic channel selection (CRD) in multi-channel cognitive radio MANETs to obtain high packet delivery ratio (PDR), low control overheads, low delay and low energy consumption when node is moving in high speed. Moreover, CRD protocol can apply for Vehicular Ad Hoc Network, IoT and 5G. The proposed CRD protocol includes clustering and routing phases under multi-channel cognitive radio approach. In the clustering phase, we propose CDS selection, CDS size reduction and CDS based clustering algorithms to formulate clusters and provide a set of intermediate nodes which is latter used as a route searching space for the routing phase. In the routing phase, a sending channel based focus region selection (CFS) algorithm is adopted dynamically to establish an efficient route from a set of intermediate nodes that avoids the affected region of a primary user. The CRD routing protocol is then implemented in environmental conditions close to reality (OMNET++ platform) to demonstrate its superiority over the conventional AODV protocol in terms of PDR, control overhead, delay and energy consumption.

Improving Energy Efficiency in Wireless Sensor Networks through Virtual-Backbone–Based Topology Control Mechanism

Abstract This article presents a design of a virtual-backbone–based topology control scheme that builds the virtual backbone with the help of localized information. Initially, the dominating set is constructed using spanning tree application. The resultant dominating set spanning tree is further optimized to remove dominant act nodes because, originally, they are the regular nodes, and it forms a small-sized backbone with selected sufficient energy capacity nodes. Then the 3-hop message forward algorithm is used to identify the relay nodes. The roles of the relay nodes are to make the dominating set as a connected dominating set (CDS). Finally, a minimal CDS is formed by a heuristic approach to remove redundant sensors from the CDS.

CONE: A Connected Dominating Set-Based Flooding Protocol for Wireless Sensor Networks.

Wireless sensor networks (WSNs) play a significant role in a large number of applications, e.g., healthcare and industry. A WSN typically consists of a large number of sensor nodes which rely on limited power sources in many applications. Therefore, improving the energy efficiency of WSNs becomes a crucial topic in the research community. As a fundamental service in WSNs, network flooding offers the advantages that information can be distributed fast and reliably throughout an entire network. However, network flooding suffers from low energy efficiency due to the large number of redundant transmissions in the network. In this work, we exploit connected dominating sets (CDS) to enhance the energy efficiency of network flooding by reducing the number of transmissions. For this purpose, we propose a connected dominating set-based flooding protocol (CONE). CONE inhibits nodes that are not in the CDS from rebroadcasting packets during the flooding process. Furthermore, we evaluate the performance of CONE in both simulations and a real-world testbed, and then we compare CONE to a baseline protocol. Experimental results show that CONE improves the end-to-end reliability and reduces the duty cycle of network flooding in the simulations. Additionally, CONE reduces the average energy consumption in the FlockLab testbed by 15%.

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.

Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks.

To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to construct MCDS, the best among which is adopting the two-stage idea, that is, to construct a maximum independent set (MIS) firstly and then realize the connectivity through the Steiner tree construction algorithm. For the first stage, this paper proposes an improved collaborative coverage algorithm for solving maximum independent set (IC-MIS), which expands the selection of the dominating point from two-hop neighbor to three-hop neighbor. The coverage efficiency has been improved under the condition of complete coverage. For the second stage, this paper respectively proposes an improved Kruskal–Steiner tree construction algorithm (IK–ST) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution. Finally, the simulation results show that the algorithm proposed in this paper is a great improvement over the previous algorithm in optimizing the scale of the connected dominating set (CDS).

CDS-MIP: CDS-based Multiple Itineraries Planning for mobile agents in wireless sensor network

using multi agents in the wireless sensor networks (WSNs) for aggregating data has gained significant attention. Planning the optimal itinerary of the mobile agent is an essential step before the process of data gathering. Many approaches have been proposed to solve the problem of planning MAs itineraries, but all of those approaches are assuming that the MAs visit all SNs and large number of intermediate nodes. This assumption imposed a burden; the size of agent increases with the increase in the visited SNs, therefore consume more energy and spend more time in its migration. None of those proposed approaches takes into account the significant role that the connected dominating nodes play as virtual infrastructure in such wireless sensor networks WSNs. This article introduces a novel energy-efficient itinerary planning algorithmic approach based on the minimum connected dominating sets (CDSs) for multi-agents dedicated in data gathering process. In our proposed approach, instead of planning the itineraries over all sensor nodes SNs, we plan the itineraries among subsets of the MCDS in each cluster. Thus, no need to move the agent in all the SNs, and the intermediate nodes (if any) in each itinerary will be few. Simulation results have demonstrated that our approach is more efficient than other approaches in terms of overall energy consumption and task execution time.