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 10 of 10 for “"Connected dominating set"”.
-
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 …
-
Improved distributed algorithms for fundamental graph problems
… for solving graph problems in distributed settings and more generally for performing distributed computation in networks. These algorithms are applicable in a wide variety of settings, ranging from computer networks to massively parallel computing and beyond. This thesis addresses a number …
-
The bidimensionality theory and its algorithmic applications
… of such problems include feedback vertex set, vertex cover, minimum maximal matching, face cover, a series of vertex- removal parameters, dominating set, edge dominating set, r-dominating set, connected dominating set, connected edge dominating set, connected r-dominating set, and …
-
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 …
-
Graph-theoretic channel modeling and topology control protocols for wireless sensor networks
… evaluates why the backbone construction using connected dominating set (CDS) in certain cases remains unable to provide connected sensing coverage in the area covered. For this purpose, a novel protocol that reduces the topology while considering sensing area coverage is presented.
-
Mobile Ad-hoc Network Routing Protocols: Methodologies and Applications
… protocols using a novel systematic relay node set (RNS) framework, design of a new routing protocol for MANETs, a study of node mobility, including a quantitative study of link lifetime in a MANET and an adaptive interval scheme based on a novel neighbor stability criterion, improvements of a …
-
A Proactive Routing Protocol for Multi-Channel Wireless Ad-hoc Networks
… (DSDV), Open Shortest Path First-Minimal Connected Dominating Set (OSPF-MCDS), and Optimized Link State Routing (OLSR) protocol to multiple channel (MC) versions, denoted as DSDV-MC, OSPF-MCDS-MC, and OLSR-MC, respectively. Simulation results for DSDV-MC, OSPF-MCDS-MC, and OLSR-MC are …
-
Network Based Approaches for Clustering and Location Decisions
… relaxation called a k-community is defined as a connected subgraph such that endpoints of every edge have at least k common neighbors within the subgraph. It is used to develop scale reduction techniques to obtain the maximum clique on very large scale real life networks. Analytically, the …