Zaloguj się

Gotowe bibliografie tematyczne / Resolving connected dominating set / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Resolving connected dominating set.

Rozprawy doktorskie na temat „Resolving connected dominating set”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 19 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 31 najlepszych rozpraw doktorskich naukowych na temat „Resolving connected dominating set”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Wu, Yiwei. "Connected Dominating Set Construction and Application in Wireless Sensor Networks." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/cs_diss/45.

Pełny tekst źródła

Streszczenie:

Wireless sensor networks (WSNs) are now widely used in many applications. Connected Dominating Set (CDS) based routing which is one kind of hierarchical methods has received more attention to reduce routing overhead. The concept of k-connected m-dominating sets (kmCDS) is used to provide fault tolerance and routing flexibility. In this thesis, we first consider how to construct a CDS in WSNs. After that, centralized and distributed algorithms are proposed to construct a kmCDS. Moreover, we introduce some basic ideas of how to use CDS in other potential applications such as partial coverage and

Style APA, Harvard, Vancouver, ISO itp.

2

He, Jing S. "Connected Dominating Set Based Topology Control in Wireless Sensor Networks." Digital Archive @ GSU, 2012. http://digitalarchive.gsu.edu/cs_diss/70.

Pełny tekst źródła

Streszczenie:

Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network. Moreover, Minimum-sized Connected Dominating Set (MCDS) has become a well-known approach for constructing a Virtual Backbone (VB) to alleviate the broadcasting storm for efficient routing in WSNs extensively. However, no work considers the load-balance

Style APA, Harvard, Vancouver, ISO itp.

3

Kim, Kyoung Min Sun Min-Te. "Multi initiator connected dominating set construction for mobile ad hoc networks." Auburn, Ala, 2008. http://hdl.handle.net/10415/1549.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Coelho, Rafael Santos. "The k-hop connected dominating set problem: approximation algorithms and hardness results." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/.

Pełny tekst źródła

Streszczenie:

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is connected, and for every vertex v in G, there is a vertex u in D such that the distance between v and u in G is at most k. We study the problem of finding a minimum k-hop connected dominating set of a graph (Mink-CDS). We prove that Mink-CDS is NP-hard on planar bipartite graphs of maximum degree 4. We also prove that Mink-CDS is APX-complete on bipartite graphs of maximum degree 4. We present inapproximability thresholds for Mink-CDS on bipar-

Style APA, Harvard, Vancouver, ISO itp.

5

Mahalingam, Gayathri. "Connected domination in graphs." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001225.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Lin, Tao. "Mobile Ad-hoc Network Routing Protocols: Methodologies and Applications." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/11127.

Pełny tekst źródła

Streszczenie:

A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peerto- peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and civilian systems. The network topology in a MANET usually changes with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing protocols may not be suitable for MANETs. For example, some assumptions used by these protocols are not valid in MANETs or some protocols cannot efficiently handle topology changes. Research

Style APA, Harvard, Vancouver, ISO itp.

7

Li, Jiakai. "AI-WSN: Adaptive and Intelligent Wireless Sensor Networks." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1341258416.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Cao, Guangtong. "Distributed services for mobile ad hoc networks." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2541.

Pełny tekst źródła

Streszczenie:

A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resour

Style APA, Harvard, Vancouver, ISO itp.

9

Wightman, Rojas Pedro Mario. "Topology Control in Wireless Sensor Networks." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1807.

Pełny tekst źródła

Streszczenie:

Wireless Sensor Networks (WSN) offer a flexible low-cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. WSNs are made of resource-constrained wireless devices, which require energy efficient mechanisms, algorithms and protocols. One of these mechanisms is Topology Control (TC) composed of two mechanisms, Topology Construction and Topology Maintenance. This dissertation expands the knowledge of TC in many ways. First, it introduces a comprehensive taxonomy for topology construction and maintenance algorithms for t

Style APA, Harvard, Vancouver, ISO itp.

10

Liu, Hui. "Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/cs_diss/3.

Pełny tekst źródła

Streszczenie:

A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MA

Style APA, Harvard, Vancouver, ISO itp.

11

Marie, Sylvain. "Déploiement optimal d’un réseau de capteurs sous des contraintes de couverture et de connectivité." Thesis, Paris, CNAM, 2019. http://www.theses.fr/2019CNAM1248/document.

Pełny tekst źródła

Streszczenie:

L'objet de cette thèse sur les réseaux de capteurs est l'étude du déploiement minimal de capteurs lorsque ceux-ci doivent couvrir un ensemble discret de cibles plutôt que des superficies. Après la présentation des caractéristiques d'un réseau de capteurs, et l'intérêt d'un déploiement minimal, nous en proposons une modélisation en théorie des graphes. Nous présentons ensuite un état de l'art décrivant certaines techniques de résolution par la programmation mathématique de diverses problématiques dans ce type de réseau. Nous utilisons plusieurs programmes linéaires en variables mixtes afin de r

Style APA, Harvard, Vancouver, ISO itp.

12

Jemili, Imen. "Clusterisation et conservation d’énergie dans les réseaux ad hoc hybrides à grande échelle." Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13818/document.

Pełny tekst źródła

Streszczenie:

Dans le cadre des réseaux ad hoc à grande envergure, le concept de clusterisation peut être mis à profit afin de faire face aux problèmes de passage à l'échelle et d'accroître les performances du système. Tout d’abord, cette thèse présente notre algorithme de clusterisation TBCA ‘Tiered based Clustering algorithm’, ayant pour objectif d’organiser le processus de clusterisation en couches et de réduire au maximum le trafic de contrôle associé à la phase d’établissement et de maintenance de l’infrastructure virtuelle générée. La formation et la maintenance d’une infrastructure virtuelle ne sont

Style APA, Harvard, Vancouver, ISO itp.

13

Marie, Sylvain. "Déploiement optimal d’un réseau de capteurs sous des contraintes de couverture et de connectivité." Electronic Thesis or Diss., Paris, CNAM, 2019. http://www.theses.fr/2019CNAM1248.

Pełny tekst źródła

Streszczenie:

L'objet de cette thèse sur les réseaux de capteurs est l'étude du déploiement minimal de capteurs lorsque ceux-ci doivent couvrir un ensemble discret de cibles plutôt que des superficies. Après la présentation des caractéristiques d'un réseau de capteurs, et l'intérêt d'un déploiement minimal, nous en proposons une modélisation en théorie des graphes. Nous présentons ensuite un état de l'art décrivant certaines techniques de résolution par la programmation mathématique de diverses problématiques dans ce type de réseau. Nous utilisons plusieurs programmes linéaires en variables mixtes afin de r

Style APA, Harvard, Vancouver, ISO itp.

14

Mameri, Djelloul. "L'indépendant faiblement connexe : études algorithmiques et polyédrales." Thesis, Clermont-Ferrand 2, 2014. http://www.theses.fr/2014CLF22513/document.

Pełny tekst źródła

Streszczenie:

Dans ce travail, nous nous intéressons à une topologie pour les réseaux de capteurs sans fil. Un réseau de capteurs sans fil peut être modélisé comme un graphe non orienté G = (V,E). Chaque sommet de V représente un capteur et une arête e = {u, v} dans E indique une transmission directe possible entre deux capteurs u et v. Contrairement aux dispositifs filaires, les capteurs sans fil ne sont pas a priori agencé en réseau. Une topologie doit être créée en sélectionnant des noeuds "dominants" qui vont gérer les transmissions. Les architectures qui ont été examinées dans la littérature reposent e

Style APA, Harvard, Vancouver, ISO itp.

15

Letourneur, Romain. "Algorithmes exacts et exponentiels pour des problèmes de graphes." Thesis, Orléans, 2015. http://www.theses.fr/2015ORLE2022/document.

Pełny tekst źródła

Streszczenie:

De nombreux problèmes algorithmiques sont « difficiles », dans le sens où on ne sait pas les résoudre en temps polynomial par rapport à la taille de l’entrée, soit parce qu’ils sont NP-difficiles, soit, pour certains problèmes d’énumération, à cause du nombre exponentiel d'objets à énumérer. Depuis une quinzaine d’années on trouve un intérêt grandissant dans la littérature pour la conception d'algorithmes exacts sophistiqués afin de les résoudre le plus efficacement possible. Dans le cadre de cette thèse, nous nous intéressons à la conception d'algorithmes exacts exponentiels autour de trois p

Style APA, Harvard, Vancouver, ISO itp.

16

Levy, Eythan. "Approximation algorithms for covering problems in dense graphs." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359.

Pełny tekst źródła

Streszczenie:

We present a set of approximation results for several covering problems in dense graphs. These results show that for several problems, classical algorithms with constant approximation ratios can be analyzed in a finer way, and provide better constant approximation ratios under some density constraints. In particular, we show that the maximal matching heuristic approximates VERTEX COVER (VC) and MINIMUM MAXIMAL MATCHING (MMM) with a constant ratio strictly smaller than 2 when the proportion of edges present in the graph (weak density) is at least 3/4, or when the normalized minimum degree (stro

Style APA, Harvard, Vancouver, ISO itp.

17

CHE, HE-MINE, and 何明哲. "Construction Schemes of Connected Dominating Set on Hypercubes." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/33031735142138963652.

Pełny tekst źródła

Streszczenie:

碩士<br>明新科技大學<br>資訊管理研究所<br>102<br>In a wired or wireless network, routing efficiently among immobile or mobile devices is an important issue. A routing based on connected dominating sets is considered as an efficient approach. The connected dominating set can be served as a virtual backbone of a network, and it always adapted easily to new network topology. A virtual backbone is a set of vertices which can help with routing. Any vertex outside the virtual backbone can send messages or signals to another vertex through the virtual backbone. So the virtual backbone has great benefits to routing

Style APA, Harvard, Vancouver, ISO itp.

18

許雅綾. "Connected Dominating Set of Hypercubes and Star Graphs." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/82374709531160994459.

Pełny tekst źródła

Streszczenie:

碩士<br>明新科技大學<br>資訊管理研究所<br>100<br>In wired or wireless networks, routing efficiently among immobile or mobile devices is an important issue. A connected dominating set (CDS) brings benefits to network routing. The CDS can be served as a virtual backbone of a network, and it always adapted easily to new network topology. A virtual backbone is a set of vertices which can help with routing. Any vertex outside the virtual backbone can send messages or signals to another vertex through the virtual backbone. So the virtual backbone has great benefits to routing and management of networks. We may imp

Style APA, Harvard, Vancouver, ISO itp.

19

Liu, Kuan-Pu, and 劉冠甫. "Broadcasting based on Connected Dominating Set Prediction in VANETs." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/37607747181836207990.

Pełny tekst źródła

Streszczenie:

碩士<br>臺北市立大學<br>資訊科學系<br>103<br>This thesis aims to study the performance enhancement of applying connected dominating set on broadcasting in vehicular ad-hoc networks (VANETs). First, a broadcast mechanism based on the connected dominating set (CDS) prediction is proposed for VANETs where movements of vehicles are typically anticipated. With the mechanism, the accurate and up-to-date CDS can be obtained and the better coverage of broadcasting can be achieved. Moreover, to provide the stability of broadcasting in VANETs, we propose the robust enhancement mechanism which excludes those in weak

Style APA, Harvard, Vancouver, ISO itp.

20

Shiu, Tzu-Lin, and 徐紫菱. "A Connected Dominating Set Routing Protocol for Ad Hoc Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/23258266120685294668.

Pełny tekst źródła

Streszczenie:

碩士<br>元智大學<br>資訊工程學系<br>94<br>In order to transmit the same message information to all the nodes over the network, the routing protocol for discovering the routing path will utilize broadcasting mechanism for Ad hoc network and the blind blooding strategy is usually adopted for broadcast. The blind blooding is a strategy that each node rebroadcasts the packet to other nodes after receiving the packet at the first time. Then, the same packet is transmitted repeatedly and the broadcast storm will happen. In order to solve the broadcast storm problem, some researchers proposed an approach that

Style APA, Harvard, Vancouver, ISO itp.

21

Chiang, Yue-Han, and 蔣岳翰. "An Implementation of Algorithms for the Minimum Connected Dominating Set Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/04123107328211242422.

Pełny tekst źródła

Streszczenie:

碩士<br>國立中正大學<br>資訊工程研究所<br>100<br>Let G = (V;E) be a simple undirected graph. A dominating set S in G is a subset of V such that each vertex in V \S is adjacent to some vertices in S. The minimum connected dominating set problem is to find a dominating set S of minimum cardinality such that G[S] is connected. It is known that the minimum connected dominating set problem is equivalent to the maximum leaf spanning tree problem. In this thesis, we slightly modify the exact algorithm given in the paper, Solving Connected Dominating Set Faster than 2n(Fomin et al.(2008)) mainly for implementation r

Style APA, Harvard, Vancouver, ISO itp.

22

LIN, XIN-ZHI, and 林信志. "An Improved Connected Dominating Set Algorithm by Relative Complement Set Theory in Ad Hoc Network." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/r97nsh.

Pełny tekst źródła

Streszczenie:

碩士<br>朝陽科技大學<br>資訊與通訊系<br>106<br>With the rapid development of mobile devices, users can always obtain the mobility and convenience of the network by using the mobile devices. One of the popular network structures named Ad-Hoc is used to non-infrastructure topology. When the network information is transmission in the Ad-Hoc, it mainly depends on the peer-to-peer communication or the forwarding technology without any wired network architecture or devices supported. From this point, the network structure can change easily in any time and no limit of the movement direction or the range. Therefore

Style APA, Harvard, Vancouver, ISO itp.

23

Hung, Hao-Hsiang, and 洪浩翔. "Constructing and Maintaining a Connected k-hop Dominating Set in Mobile Ad Hoc Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/47639529569080188365.

Pełny tekst źródła

Streszczenie:

碩士<br>國立清華大學<br>資訊工程學系<br>92<br>In a graph G = (V,E), a k-hop dominating set Dk is a subset of such that all nodes in V are either in or at most k-hop to a node Dk. A k-hop dominating set Dk is connected if there is a path, in which each node is in Dk, between any two nodes in Dk. In a mobile ad hoc network, a node communicates with its neighbors by sending messages across channels, and the others by routing messages via the network. The hierarchical routing protocol that constructs and maintains a connected k-hop dominating set attempts to reduce transmission power and communication overhead.

Style APA, Harvard, Vancouver, ISO itp.

24

Cai, Kan. "Design and analysis of a connected dominating set algorithm for mobile ad hoc networks." Thesis, 2004. http://hdl.handle.net/2429/15472.

Pełny tekst źródła

Streszczenie:

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 previous works are based on strategies that combine flooding and caching to discover routes proactively or on demand. But these algorithms suffer from scalability problems when there exist many spontaneous and short-term connections. This thesis describes the design and implementation of a ba

Style APA, Harvard, Vancouver, ISO itp.

25

Lo, Cheng-Feng, and 羅健峰. "Using a Connected Dominating Set as the Virtual Backbone of a Wireless Sensor Network." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/25292529363229661892.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>應用數學系所<br>98<br>In a wireless sensor network, the relationship between nodes can be modeled by us- ing a graph. Consequently, a connected dominating set of such a graph is usually used to serve as a virtual backbone of the original wireless sensor network. Thus finding a minimum connected dominating set of a graph becomes a problem discussed by many researchers. It has been proven that this problem is NP-hard. Hence many researchers consider finding approximation solutions instead of the optimal solution and many ap- proximation algorithms have been proposed. In particular, in

Style APA, Harvard, Vancouver, ISO itp.

26

Chiang, Mao-Lun, and 江茂綸. "The Anatomy Study of Agreement in Connected-Dominating-Set-Based Mobile Ad-hoc Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/05236708354444558433.

Pełny tekst źródła

Streszczenie:

博士<br>國立中興大學<br>資訊科學與工程學系<br>96<br>Reliability is an important research topic of distributed systems. To achieve fault-tolerance in the distributed systems, healthy processors need to reach a common agreement before performing certain special tasks, even if faults exist in many circumstances. This problem is called as the Byzantine Agreement (BA) problem and it must be addressed. In general, the traditional BA problem is solved in well-defined networks, such as a fully connected network or a broadcast network. However, the MANETs (Mobile Ad-hoc NETworks) are increasing in popularity and its ne

Style APA, Harvard, Vancouver, ISO itp.

27

黃思綸. "A polynomial-time approximation algorithm for the constrained connected dominating set problem in wireless networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/56310814524978450685.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>應用數學系所<br>98<br>In wireless ad hoc networks, selecting a set of nodes to form a virtual backbone has been investigated for more than two decades. It has been shown that a connected dominating set (CDS) can be used as a virtual backbone. There are many results for finding CDSs. In this thesis, we propose a new idea: a constrained connected dominating set (CCDS), which is a CDS having the property that some specified nodes must be included in it due to some special reason. For example, the specified nodes could be nodes with more remaining energy or nodes located at important loc

Style APA, Harvard, Vancouver, ISO itp.

28

Li, Kuen-Han, and 李坤翰. "Weakly Connected Dominating Set Assisted Ant-based On-demand Clustering Routing Protocol for Mobile Ad-hoc Network." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/77191916828662234846.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣科技大學<br>電子工程系<br>101<br>Advances in wireless ad-hoc network techniques have spurred the development of new approaches to increase network efficiency. One of the more popular approaches is swarm intelligence, which imitates the collective behavior of biological species to solve network routing problems. Meanwhile, weakly connected dominating sets (WCDS) can serve as auxiliary structures for clustering nodes in the network. This paper uses the clustering concept of WCDS to propose an improved ant-based on-demand clustering routing (AOCR) protocol for wireless ad-hoc networks. Network s

Style APA, Harvard, Vancouver, ISO itp.

29

Chen, Kun-Wei, and 陳堃維. "Centralized Algorithms based on Energy-Aware and Maintained Mechanism for Constructing Connected Dominating Set in Ad Hoc Networks." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/27012270816114241089.

Pełny tekst źródła

Streszczenie:

碩士<br>朝陽科技大學<br>資訊與通訊系<br>102<br>There exist some problems in wireless ad hoc networks, such as the limitations of bandwidth, the processing capability of nodes, and the battery power. This is because the network topology may dramatically change due to node mobility in wireless ad hoc networks. To solve the above problems, the design of routing algorithms based on connected dominating set (CDS) has been recognized as a suitable approach for routing in ad hoc networks, because the CDS as a virtual backbone to relay data not only can reduce redundant message and power consumption but also can ad

Style APA, Harvard, Vancouver, ISO itp.

30

Chen, Jyun-Rong, and 陳俊榮. "A Localized Algorithm Using ID-Reassignment Technique to Construct Power-Aware Minimum Connected Dominating Set for Ad Hoc Network." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/03811297651968616530.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Soualah, Sofiane. "Algorithmes heuristiques et exacts pour le problème de l’ensemble dominant connexe minimum." Thèse, 2014. http://hdl.handle.net/1866/11501.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!