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 sets"”.
-
Διάχυση πληροφορίας και κυρίαρχα σύνολα σε ασύρματα δίκτυα αισθητήρων
… second proposed method is based on the use of connected dominating sets. Connected Dominating Sets can ensure that all nodes in a network will either belong to them or they are at least a certain number of hops away from at least one node of them. This creates a backbone that facilitates the …
-
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 …
-
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 …
-
Deep learning and its applications in wireless big data networks performance
… formation using the fewest possible nodes (connected dominating sets - CDS).
-
Efficient Data Dissemination in Wireless Ad Hoc Networks
… data before sending it to a central unit. Often connected dominating sets have been used for such purposes. However, a connected dominating set is often vulnerable due to frequent node failures in wireless sensor networks. Hence, to provide a degree of fault-tolerance we consider in problem (1) a …
-
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 …
-
Privacy of Contextual Information in Wireless Sensor Networks
… fake sources to the problem of finding a minimum connected dominating set (MCDS) that covers the WSN deployment area. We then impose transmission schedules on the fake sources to accelerate the delivery of real event reports. Finally, we propose strong privacy traffic normalization techniques that …
-
Backbones for military multilayer wireless ad hoc networks based on networks science concepts
… Ad hoc Networks (MANETS) which will be all connected together as part of a seamless overarching network, allowing information, from multiple sources, to flow faster among its participants. Towards the implementation of this vision first we build on the (minimum) Connected node Dominating …