Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 34 for “"Connected Dominating Set"”.
-
Design and analysis of a connected dominating set algorithm for mobile ad hoc networks
Wireless technology such as IEEE 802.11b allows a set of devices to communicate with each other in a peer-to-peer manner by dynamically forming mobile ad hoc networks. Routing in such networks is challenging due to node mobility, low power, constrained bandwidth and limited radio range. Most of the …
-
Integer programming formulation for contention aware connected dominating set in wireless multi-hop network
… in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using …
-
A LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK
… ad hoc networks (MANETs) is highly desired and connected dominating sets (CDS) have been gaining significant popularity in this regard. The CDS based approach reduces the search for a minimum cost path between a pair of source and destination terminals to the set of terminals forming the …
-
Connected Domination in Graphs
A connected dominating set D is a set of vertices of a graph G = (V, E) such that every vertex in V − D is adjacent to at least one vertex in D and the subgraph hDi induced by the set D is connected. The connected domination number γc(G) is the minimum of the cardinalities of the connected …
-
Weakly Connected Domination
Chapter 1 introduces the concept of weakly connected domination, a review of existing results and some relevant operations. Chapter 2 extends a known lower bound on the weakly connected domination number of trees to the more general class of cycle-disjoint graphs. Chapter 3 presents a …
-
Generating quality dominating set
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 …
-
Adaptive clustering and transmission range adjustment for topology control in wireless sensor networks
… strategy to achieve further energy saving. Connected dominating set (CDS) as a very promising energy saving technique can be used with either a transmission-power-based algorithm or a dutycycle- based algorithm. I have designed a distributed algorithm, DSP-CDS, for constructing CDS quickly …
-
Topology management protocols in ad hoc wireless sensor networks
… is introduced. Finally, we present a Multiple-Connected Dominating Set(MCDS) protocol that can balance the network trac using an on-demand routingprotocol. The MCDS protocol constructs and manages multiple backbone networks,each of which is constructed with a connected dominating set (CDS) to …
-
Generalized Domination in Graphs with Applications in Wireless Networks
… scenarios. In wireless ad-hoc network, a connected dominating set (CDS) can be used to serve as a virtual backbone, facilitating communication among the members in the network. Most literature focuses on creating the smallest virtual backbone without considering the distance that a message …
-
Fault Tolerance in Distributed Systems Using Self-Stabilization
… problems in distributed systems. Two variants of dominating set (i.e., weakly connected dominating set and positive influence dominating set) have been widely used in distributed system applications, such as network security, facility location, message routing and others. In this thesis, three new …
-
Distributed services for mobile ad hoc networks
… we focus on the clock synchronization, connected dominating set, and k-mutual exclusion problems in mobile ad hoc networks.
-
A Multiple-frequency Transmission Scheduling Scheme for Mesh Networks that Employ Spectrum Sharing
… In this thesis, we present the augmented connected dominating set (ACDS) algorithm for selecting bridge nodes from a list of bridge node candidates within a network. Simulation results display the effectiveness of this selection scheme in terms of end-to-end success rate, end-to-end …
-
Optimization in Geometric Graphs: Complexity and Approximation
… less network is strongly related to a minimum connected dominating set in its graph theoretic representation. Motivated by the vastness of application areas, we study several problems including maximum independent set, minimum vertex coloring, minimum clique partition, max-cut and …
-
Simulation-based Performance Evaluation of MANET Backbone Formation Algorithms
… of mobile hosts and/or mobility rates. The Connected Dominating Set (CDS), a.k.a. virtual backbone or Spine, is proposed to facilitate routing, broadcasting, and establishing a dynamic infrastructure for distributed location databases. Minimizing the CDS produces a simpler abstracted …
-
Energy-efficient Data Aggregation Using Realistic Delay Model in Wireless Sensor Networks
… DEDA framework with area coverage and localized connected dominating set algorithms to achieve two more resilient DEDA implementations: A-DEDA and AC-DEDA. The simulation results confirm that our original DEDA and its two enhanced variants save more energy and attain a higher delay reliability …
-
Robust and Survivable Network Design Considering Uncertain Node and Link Failures
… The designed network can still be connected after failures of any k vertices and (l-1) edges or failures of any (k-1) vertices and l edges. After formally proving its relationships to edge and vertex disjoint paths, we present two integer programming (IP) formulations, valid …
-
Scalable ReliableControllerPlacementinSoftwareDefinedNetworking
… concern in SDN, via exploiting the independent dominating set approach to ensure a distribution of controllers with lowest response times. We propose a new node degree-based algorithm named High Degree with Independent Dominating Set (HDIDS) for the controller placement problem in the SDN …
-
Parameterless broadcasting in static to highly mobile wireless ad hoc, sensor and actuator networks
… in the network. Existing solutions range from connected dominating set (CDS) based for static networks, to blind flooding for moderate mobility within connected network, to hyperflooding for highly mobile and frequently partitioned networks. The only existing protocol for all scenarios is based …
-
Comparative Performance Study of Standardized Ad-Hoc Routing Protocols and OSPF-MCDS
… to ad-hoc routing using the concept of a Minimal Connected Dominating Set (MCDS) has been developed at Virginia Tech. The OSPF-MCDS routing protocol is a modified version of the traditional Open Shortest Path First (OSPF) wired routing protocol which incorporates the MCDS framework. Enhancements …
-
Unified Role Assignment Framework For Wireless Sensor Networks
… (RBSHO) protocol that organizes a connected dominating set (CDS) of nodes called dominators. This is done by hierarchically selecting nodes that possess cumulatively high energy, connectivity, and sensing capabilities in their local neighborhood. The RBHSO protocol then assigns …
Page 1 of 2