1,698 research outputs found

    Generating quality dominating set

    Full text link
    Construction of a small size dominating set is a well known problem in graph theory and sensor networks. A Connected dominating set (CDS) can be used as a backbone structure in sensor networks for message delivery and broadcast. The general dominating set problem is known to be NP-hard and some approximation algorithms have been proposed; In most approximation algorithms for constructing connected dominating set only the size of the dominating set has been considered. In this thesis we address the problem of constructing connected dominating sets with several quality factors that include (i) diameter, (ii) risk-factor, and (iii) interference. We propose algorithms for constructing CDS of small diameter, reduced risk-factor, and reduced interference. We also report on the experimental investigation of the proposed techniques. Experimental results show that the proposed algorithms are very effective in reducing interference without significantly increasing CDS size. The proposed algorithms are the first algorithms in the sensor network community that address both size and interference for designing dominating sets

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

    Get PDF
    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

    Approximation Algorithmic Performance for CEDS in Wireless Network

    Get PDF
    A well-organized design of routing protocols in wireless networks, the connected dominating set (CDS) is widely used as a virtual backbone. To construct the CDS with its size as minimum, many heuristic, meta-heuristic, greedy, approximation and distributed algorithmic approaches have been anticipated. These approaches are concentrated on deriving independent set and then constructing the CDS using UDG, Steiner tree and these algorithms perform well only for the graphs having smaller number of nodes. For the networks that are generated in a fixed simulation area. This paper provides a novel approach for constructing the CDS, based on the concept of total edge dominating set. Since the total dominating set is the best lower bound for the CDS, the proposed approach reduces the computational complexity to construct the CDS through the number of iterations. The conducted simulation reveals that the proposed approach finds better solution than the recently developed approaches when important factors of network such as transmission radio range and area of network density varies

    Distributed Symmetry Breaking in Hypergraphs

    Full text link
    Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and Δ+1\Delta +1-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs. In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in O(log2n)O(\log^2 n) rounds (nn is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper --- an O(Δϵpolylog(n))O(\Delta^{\epsilon}\text{polylog}(n))-round hypergraph MIS algorithm in the CONGEST model where Δ\Delta is the maximum node degree of the hypergraph and ϵ>0\epsilon > 0 is any arbitrarily small constant. To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the {\em balanced minimal dominating set} problem (left open in Harris et al. [ICALP 2013]) and the {\em minimal connected dominating set problem}. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.Comment: Changes from the previous version: More references adde

    Constructing Reliable Virtual Backbones in Probabilistic Wireless Sensor Networks

    Get PDF
    Most existing algorithms used for constructing virtual backbones are based on the ideal deterministic network model (DNM) in which any pair of nodes is either fully connected or completely disconnected. Different from DNM, the probabilistic network model (PNM), which presumes that there is a probability to connect and communicate between any pair of nodes, is more suitable to the practice in many real applications. In this paper, we propose a new algorithm to construct reliable virtual backbone in probabilistic wireless sensor networks. In the algorithm, we firstly introduce Effective Degree of Delivery Probability (EDDP) to indicate the reliable degree of nodes to transfer data successfully, and then exclude those nodes with zero EDDP from the candidate dominator set to construct a reliable connected dominating set (CDS). Moreover, each dominatee selects the neighbor dominator with the maximum delivery probability to transfer data. Through simulations, we demonstrate that our proposed algorithm can remarkably prolong the network lifetime compared with existing typical algorithms
    corecore