scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Distributed construction of connected dominating set in wireless ad hoc networks

01 Apr 2004-Mobile Networks and Applications (Springer-Verlag New York, Inc.)-Vol. 9, Iss: 2, pp 141-149
TL;DR: This paper presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the Ω(nlog n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, thus message-optimal.
Abstract: Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms cannot guarantee to generate a CDS of small size. Their message complexities can be as high as O(n2), and their time complexities may also be as large as O(n2) and O(n3). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(n log n) message complexity. By establishing the Ω(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.
Citations
More filters
Journal ArticleDOI
TL;DR: This paper proposes a dominant pruning rule (called Rule k) that is more effective in reducing the dominating set derived from the marking process than the combination of Rules 1 and 2 and, surprisingly, in a restricted implementation with local neighborhood information, Rule k has the same communication complexity and less computation complexity.
Abstract: Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the system are either in the set or neighbors of hosts in the set. The efficiency of dominating-set-based routing mainly depends on the overhead introduced in the formation of the dominating set and the size of the dominating set. In this paper, we first review a localized formation of a connected dominating set called marking process and dominating-set-based routing. Then, we propose a dominant pruning rule to reduce the size of the dominating set. This dominant pruning rule (called Rule k) is a generalization of two existing rules (called Rule 1 and Rule 2, respectively). We prove that the vertex set derived by applying Rule k is still a connected dominating set. Rule k is more effective in reducing the dominating set derived from the marking process than the combination of Rules 1 and 2 and, surprisingly, in a restricted implementation with local neighborhood information, Rule k has the same communication complexity and less computation complexity. Simulation results confirm that Rule k outperforms Rules 1 and 2, especially in networks with relatively high vertex degree and high percentage of unidirectional links. We also prove that an upper bound exists on the average size of the dominating set derived from Rule k in its restricted implementation.

533 citations

Proceedings ArticleDOI
09 Jun 2002
TL;DR: This paper proposes the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emphlinear message complexity.
Abstract: A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some node in V1, and V1 induces a connected subgraph. A CDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a CDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the CDS in the case of mobility and topology changes.In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emph linear message complexity. This algorithm is fully localized, and does not depend on the spanning tree. Thus, the maintenance of the CDS after changes of topology guarantees the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its single-hop neighbors, and only a constant number of two-hop and three-hop neighbors. The message length is O( log n) bits.

420 citations

Journal ArticleDOI
TL;DR: This survey focuses on the energy efficiency issue and presents a comprehensive study of topology control techniques for extending the lifetime of battery powered WSNs, and identifies a number of open research issues for achieving energy efficiency through topological control.
Abstract: Large-scale, self-organizing wireless sensor and mesh network deployments are being driven by recent technological developments such as The Internet of Things (IoT), Smart Grids and Smart Environment applications. Efficient use of the limited energy resources of wireless sensor network (WSN) nodes is critically important to support these advances, and application of topology control methods will have a profound impact on energy efficiency and hence battery lifetime. In this survey, we focus on the energy efficiency issue and present a comprehensive study of topology control techniques for extending the lifetime of battery powered WSNs. First, we review the significant topology control algorithms to provide insights into how energy efficiency is achieved by design. Further, these algorithms are classified according to the energy conservation approach they adopt, and evaluated by the trade-offs they offer to aid designers in selecting a technique that best suits their applications. Since the concept of "network lifetime" is widely used for assessing the algorithms' performance, we highlight various definitions of the term and discuss their merits and drawbacks. Recently, there has been growing interest in algorithms for non-planar topologies such as deployments in underwater environments or multi-level buildings. For this reason, we also include a detailed discussion of topology control algorithms that work efficiently in three dimensions. Based on the outcomes of our review, we identify a number of open research issues for achieving energy efficiency through topology control.

335 citations

Journal ArticleDOI
TL;DR: In this work, the θ-logarithmic barrier-based method is employed to reformulate the economic dispatch problem, and the consensus-based approach is considered for developing fully distributed technology-enabled algorithms.
Abstract: To reduce information exchange requirements in smart grids, an event-triggered communication-based distributed optimization is proposed for economic dispatch. In this work, the $\theta$ -logarithmic barrier-based method is employed to reformulate the economic dispatch problem, and the consensus-based approach is considered for developing fully distributed technology-enabled algorithms. Specifically, a novel distributed algorithm utilizes the minimum connected dominating set (CDS), which efficiently allocates the task of balancing supply and demand for the entire power network at the beginning of economic dispatch. Further, an event-triggered communication-based method for the incremental cost of each generator is able to reach a consensus, coinciding with the global optimality of the objective function. In addition, a fast gradient-based distributed optimization method is also designed to accelerate the convergence rate of the event-triggered distributed optimization. Simulations based on the IEEE 57-bus test system demonstrate the effectiveness and good performance of proposed algorithms.

295 citations

Book ChapterDOI
01 Jan 2004
TL;DR: This paper presents a meta-analysed version of the Butenko’s Algorithm, a version of which was previously described in detail in [Bouchut-Boyaval, M3AS (23) 2013].
Abstract: 3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338 3.3 Cheng’s Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 340 3.4 Min’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 3.5 Butenko’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 341

282 citations

References
More filters
Journal ArticleDOI
TL;DR: It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.
Abstract: Let A be a binary matrix of size m × n, let cT be a positive row vector of length n and let e be the column vector, all of whose m components are ones. The set-covering problem is to minimize cTx subject to Ax ≥ e and x binary. We compare the value of the objective function at a feasible solution found by a simple greedy heuristic to the true optimum. It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A. When all the components of cT are the same, our result reduces to a theorem established previously by Johnson and Lovasz.

2,645 citations

Journal ArticleDOI
TL;DR: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support that provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
Abstract: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.

1,695 citations


"Distributed construction of connect..." refers methods in this paper

  • ...Three rankings are used: the ID only [8, 9 ], an ordered pair of degree and ID [3], and an order pair of degree and location [11]....

    [...]

Journal ArticleDOI
TL;DR: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented that supports multimedia traffic and relies on both time division and code division access schemes.
Abstract: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments.

1,610 citations


"Distributed construction of connect..." refers methods in this paper

  • ...Three rankings are used: the ID only [ 8 ,9], an ordered pair of degree and ID [3], and an order pair of degree and location [11]....

    [...]

Journal ArticleDOI
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.

1,525 citations


"Distributed construction of connect..." refers background in this paper

  • ...However, finding an MCDS in unit-disk graphs is NP-hard [ 6 ], and thus only distributed approximation algorithms in polynomial time are practical for wireless ad hoc networks....

    [...]

  • ...The topology of such wireless ad hoc network can be modeled as a unit-disk graph [ 6 ], a geometric graph in which there is an edge between two nodes if and only if their distance is at most one (see figure 1)....

    [...]

Proceedings ArticleDOI
01 Aug 1999
TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Abstract: Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.

1,198 citations