Gotowe bibliografie tematyczne / Resolving connected dominating set

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Resolving connected dominating set”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 6 lipca 2025

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

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł 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.

Artykuły w czasopismach na temat "Resolving connected dominating set"

1

Mahistrado, Angelica Mae, and Helen Rara. "Outer-Connected 2-Resolving Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 16, no. 2 (2023): 1180–95. http://dx.doi.org/10.29020/nybg.ejpam.v16i2.4771.

Pełny tekst źródła
Streszczenie:
. Let G be a connected graph. A set S ⊆ V (G) is an outer-connected 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set of G and S = V (G) or the subgraph ⟨V (G)\S⟩ induced by V (G)\S is connected. The outer-connected 2-resolving hop domination number of G, denoted by γ^c2Rh(G) is the smallest cardinality of an outer-connected 2-resolving hop dominating set of G. This study aims to combine the concept of outer-connected hop domination with the 2-resolving hop dominating sets of graphs. The main results generated in this study include the characterization of outer-connected 2-resolving hop dominating sets in the join, corona, edge corona and lexicographic product of graphs, as well as their corresponding bounds or exact values.
Style APA, Harvard, Vancouver, ISO itp.
2

Hausawi, Yasser M., Zaid Alzaid, Olayan Alharbi, Badr Almutairi, and Basma Mohamed. "COMPUTING THE SECURE CONNECTED DOMINANT METRIC DIMENSION PROBLEM OF CLASSES OF GRAPHS." Advances and Applications in Discrete Mathematics 42, no. 3 (2025): 219–33. https://doi.org/10.17654/0974165825015.

Pełny tekst źródła
Streszczenie:
This paper investigates the NP-hard problem of finding the lowest secure connected domination metric dimension of graphs. If each vertex in can be uniquely recognized by its vector of distances to the vertices in Scddim, then every vertex set Scddim of a connected graph resolves . If the subgraph induced by Scddim is a nontrivial connected subgraph of , then the resolving set Scddim of is connected. That resolving set is dominating if each vertex in that is not an element of Scddim is a neighbor of some vertices in Scddim. If there is a in such that is a dominating set for any in , then the dominating set is secure. If for every , there exists such that is a resolving set, then the resolving set is secure. These four cardinality values are the metric dimension of , the connected metric dimension of , the secure metric dimension of , and the connected domination metric dimension of , respectively. They correspond to the cardinality of the smallest resolving set of , the minimal connected resolving set, the minimal secure resolving set, and the minimal connected domination resolving set. In this paper, we introduce the secure connected domination metric dimension of graphs. If each vertex in G can be uniquely recognized by its vector of distances to the vertices in Scddim, then every vertex set Scddim of a connected graph resolves G. If the subgraph induced by Scddim is a nontrivial connected subgraph of G, then the resolving set Scddim of G is connected. That resolving set is dominating if each vertex in G that is not an element of Scddim is a neighbor of some vertices in Scddim. If there is a v in D such that is a dominating set for any in then the dominating set is secure. If for every there exists such that is a resolving set, then the resolving set is secure. These four cardinality values are the metric dimension of $G$, the connected metric dimension of , the secure metric dimension of , and the connected domination metric dimension of G, respectively. They correspond to the cardinality of the smallest resolving set of , the minimal connected resolving set, the minimal secure resolving set, and the minimal connected domination resolving set. In this paper, we introduce the secure connected dominant metric dimension of some graphs such as triangular snake graph, path graph, star tree and alternate quadrilateral snake. In particular, we derive the explicit formulas for the subdivision of triangular snake graph, alternate triangular snake graph, total graph of cycle graph and bistar tree.
Style APA, Harvard, Vancouver, ISO itp.
3

Monsanto, Gerald Bacon, and Helen M. Rara. "Resolving Restrained Domination in Graphs." European Journal of Pure and Applied Mathematics 14, no. 3 (2021): 829–41. http://dx.doi.org/10.29020/nybg.ejpam.v14i3.3985.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. Brigham et al. [3] defined a resolving dominating setas a set S of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is a resolving restrained dominating set of G if S is a resolving dominating set of G and S = V (G) or hV (G) \ Si has no isolated vertex. In this paper, we characterize the resolving restrained dominating sets in the join, corona and lexicographic product of graphs and determine the resolving restrained domination number of these graphs.
Style APA, Harvard, Vancouver, ISO itp.
4

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "Strong Resolving Domination in the Lexicographic Product of Graphs." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 363–72. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4652.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the lexicographic product of graphs and determine the corresponding resolving domination number.
Style APA, Harvard, Vancouver, ISO itp.
5

Mohamad, Jerson, and Helen Rara. "1-Movable Resolving Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 418–29. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4671.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. A set W ⊆ V (G) is a resolving hop dominating set of G if W is a resolving set in G and for every vertex v ∈ V (G) \ W there exists u ∈ W such that dG(u, v) = 2. A set S ⊆ V (G) is a 1-movable resolving hop dominating set of G if S is a resolving hop dominating set of G and for every v ∈ S, either S \ {v} is a resolving hop dominating set of G or there exists a vertex u ∈ ((V (G) \ S) ∩ NG(v)) such that (S \ {v}) ∪ {u} is a resolving hop dominating set of G. The 1-movable resolving hop domination number of G, denoted by γ 1 mRh(G) is the smallest cardinality of a 1-movable resolving hop dominating set of G. This paper presents the characterization of the 1-movable resolving hop dominating sets in the join, corona and lexicographic product of graphs. Furthermore, this paper determines the exact value or bounds of their corresponding 1-movable resolving hop domination number.
Style APA, Harvard, Vancouver, ISO itp.
6

Sumaoy, Helyn Cosinas, and Helen Rara. "On Movable Strong Resolving Domination in Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1201–10. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4440.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. A strong resolving dominating set S is a 1-movable strong resolving dominating set of G if for every v ∈ S, either S \ {v} is a strong resolving dominating set or there exists a vertex u ∈ (V (G) \ S) ∩ NG(v) such that (S \ {v}) ∪ {u} is a strong resolving dominating set of G. The minimum cardinality of a 1-movable strong resolving dominating set of G,denoted by γ1 msR(G) is the 1-movable strong resolving domination number of G. A 1-movable strong resolving dominating set with cardinality γ1msR(G) is called a γ1msR-set of G. In this paper, we study this concept and the corresponding parameter in graphs resulting from the join, corona and lexicographic product of two graphs. Specifically, we characterize the 1-movable strong resolvingdominating sets in these types of graphs and determine the exact values of their 1-movable strong resolving domination numbers.
Style APA, Harvard, Vancouver, ISO itp.
7

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "On Strong Resolving Domination in the Join and Corona of Graphs." European Journal of Pure and Applied Mathematics 13, no. 1 (2020): 170–79. http://dx.doi.org/10.29020/nybg.ejpam.v13i1.3625.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the join and corona of graphs and determine the bounds or exact values of the strong resolving domination number of these graphs.
Style APA, Harvard, Vancouver, ISO itp.
8

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "On Strong Resolving Domination in the Join and Corona of Graphs." European Journal of Pure and Applied Mathematics 13, no. 1 (2020): 170–79. http://dx.doi.org/10.29020/nybg.ejpam.v1i1.3625.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the join and corona of graphs and determine the bounds or exact values of the strong resolving domination number of these graphs.
Style APA, Harvard, Vancouver, ISO itp.
9

Cabaro, Jean Mansanadez, and Helen Rara. "Restrained 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1047–53. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4451.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. A set S ⊆ V (G) is a restrained 2-resolving dominating set in G if S is a 2-resolving dominating set in G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2R-domination number of G, denoted by γr2R(G), is the smallest cardinality of a restrained 2-resolving dominating set in G. Any restrained 2-resolving dominating set of cardinality γr2R(G) is referred to as a γr2R-set in G. This study deals with the concept of restrained 2-resolving dominating set of a graph. It characterizes the restrained 2-resolving dominating set in the join, corona and lexicographic product of two graphs and determine the bounds or exact values of the restrained 2-resolving domination number of these graphs.
Style APA, Harvard, Vancouver, ISO itp.
10

Cabaro, Jean Mansanadez, and Helen Rara. "On 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1417–25. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4426.

Pełny tekst źródła
Streszczenie:
Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. A 2-resolving set S ⊆ V (G) which isdominating is called a 2-resolving dominating set or simply 2R-dominating set in G. The minimum cardinality of a 2-resolving dominating set in G, denoted by γ2R(G), is called the 2R-domination number of G. Any 2R-dominating set of cardinality γ2R(G) is then referred to as a γ2R-set in G. This study deals with the concept of 2-resolving dominating set of a graph. It characterizes the 2-resolving dominating set in the join, corona and lexicographic product of two graphs and determine the bounds or exact values of the 2-resolving dominating number of these graphs.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Resolving connected dominating set"

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 data dissemination in WSNs.
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 factor of CDSsin WSNs. In this dissertation, we first propose a new concept — the Load-Balanced CDS (LBCDS) and a new problem — the Load-Balanced Allocate Dominatee (LBAD) problem. Consequently, we propose a two-phase method to solve LBCDS and LBAD one by one and a one-phase Genetic Algorithm (GA) to solve the problems simultaneously. Secondly, since there is no performance ratio analysis in previously mentioned work, three problems are investigated and analyzed later. To be specific, the MinMax Degree Maximal Independent Set (MDMIS) problem, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-Degree non Backbone node Allocation (MVBA) problem. Approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the dissertation. On the other hand, in the current related literature, networks are deterministic where two nodes are assumed either connected or disconnected. In most real applications, however, there are many intermittently connected wireless links called lossy links, which only provide probabilistic connectivity. For WSNs with lossy links, we propose a Stochastic Network Model (SNM). Under this model, we measure the quality of CDSs using CDS reliability. In this dissertation, we construct an MCDS while its reliability is above a preset applicationspecified threshold, called Reliable MCDS (RMCDS). We propose a novel Genetic Algorithm (GA) with immigrant schemes called RMCDS-GA to solve the RMCDS problem. Finally, we apply the constructed LBCDS to a practical application under the realistic SNM model, namely data aggregation. To be specific, a new problem, Load-Balanced Data Aggregation Tree (LBDAT), is introduced finally. Our simulation results show that the proposed algorithms outperform the existing state-of-the-art approaches significantly.
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- tite and on (1, 2)-split graphs. Interestingly, one of these thresholds is a parameter of the input graph which is not a function of its number of vertices. We also discuss the complex- ity of computing this graph parameter. On the positive side, we show an approximation algorithm for Mink-CDS. When k = 1, we present two new approximation algorithms for the weighted version of the problem, one of them restricted to graphs with a poly- nomially bounded number of minimal separators. Finally, also for the weighted variant of the problem where k = 1, we discuss an integer linear programming formulation and conduct a polyhedral study of its associated polytope.<br>Seja G um grafo conexo e k um inteiro positivo. Um subconjunto D de vértices de G é um conjunto dominante conexo de k-saltos se o subgrafo de G induzido por D é conexo e se, para todo vértice v em G, existe um vértice u em D a uma distância não maior do que k de v. Estudamos neste trabalho o problema de se encontrar um conjunto dominante conexo de k-saltos com cardinalidade mínima (Mink-CDS). Provamos que Mink-CDS é NP-difícil em grafos planares bipartidos com grau máximo 4. Mostramos que Mink-CDS é APX-completo em grafos bipartidos com grau máximo 4. Apresentamos limiares de inaproximabilidade para Mink-CDS para grafos bipartidos e (1, 2)-split, sendo que um desses é expresso em função de um parâmetro independente da ordem do grafo. Também discutimos a complexidade computacional do problema de se computar tal parâmetro. No lado positivo, propomos um algoritmo de aproximação para Mink-CDS cuja razão de aproximação é melhor do que a que se conhecia para esse problema. Finalmente, quando k = 1, apresentamos dois novos algoritmos de aproximação para a versão do problema com pesos nos vértices, sendo que um deles restrito a classes de grafos com um número polinomial de separadores minimais. Além disso, discutimos uma formulação de programação linear inteira para essa versão do problema e provamos resultados poliédricos a respeito de algumas das desigualdades que constituem o politopo associado à formulação.
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. Researchers are designing new MANET routing protocols and comparing and improving existing MANET routing protocols before any routing protocols are standardized using simulations. However, the simulation results from different research groups are not consistent with each other. This is because of a lack of consistency in MANET routing protocol models and application environments, including networking and user traffic profiles. Therefore, the simulation scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is difficult for one to choose a proper routing protocol for a given MANET application. According to the aforementioned issues, my Ph.D. research focuses on MANET routing protocols. Specifically, my contributions include the characterization of differ- ent routing 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 widely-used network simulator and corresponding protocol implementations, design and development of a novel emulation test bed, evaluation of MANET routing protocols through simulations, verification of our routing protocol using emulation, and development of guidelines for one to choose proper MANET routing protocols for particular MANET applications. Our study shows that reactive protocols do not always have low control overhead, as people tend to think. The control overhead for reactive protocols is more sensitive to the traffic load, in terms of the number of traffic flows, and mobility, in terms of link connectivity change rates, than other protocols. Therefore, reactive protocols may only be suitable for MANETs with small number of traffic loads and small link connectivity change rates. We also demonstrated that it is feasible to maintain full network topology in a MANET with low control overhead. This dissertation summarizes all the aforementioned methodologies and corresponding applications we developed concerning MANET routing protocols.<br>Ph. D.
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 resources and frequent mobility. Most of the research work has been focused on the MAC and routing layer. In this work, we focus on distributed services for mobile ad hoc networks. These services will provide some fundamental functions in developing various applications for mobile ad hoc networks. In particular, we focus on the clock synchronization, connected dominating set, and k-mutual exclusion problems in mobile ad hoc networks.
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 the first time. Second, it includes four new topology construction protocols: A3, A3Lite, A3Cov and A3LiteCov. These protocols reduce the number of active nodes by building a Connected Dominating Set (CDS) and then turning off unnecessary nodes. The A3 and A3-Lite protocols guarantee a connected reduced structure in a very energy efficient manner. The A3Cov and A3LiteCov protocols are extensions of their predecessors that increase the sensing coverage of the network. All these protocols are distributed -they do not require localization information, and present low message and computational complexity. Third, this dissertation also includes and evaluates the performance of four topology maintenance protocols: Recreation (DGTRec), Rotation (SGTRot), Rotation and Recreation (HGTRotRec), and Dynamic Local-DSR (DLDSR). Finally, an event-driven simulation tool named Atarraya was developed for teaching, researching and evaluating topology control protocols, which fills a need in the area of topology control that other simulators cannot. Atarraya was used to implement all the topology construction and maintenance cited, and to evaluate their performance. The results show that A3Lite produces a similar number of active nodes when compared to A3, while spending less energy due to its lower message complexity. A3Cov and A3CovLite show better or similar coverage than the other distributed protocols discussed here, while preserving the connectivity and energy efficiency from A3 and A3Lite. In terms of network lifetime, depending on the scenarios, it is shown that there can be a substantial increase in the network lifetime of 450% when a topology construction method is applied, and of 3200% when both topology construction and maintenance are applied, compared to the case where no topology control is used.
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 MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Resolving connected dominating set"

1

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5242-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Du, Ding-Zhu. Connected Dominating Set: Theory and Applications. Springer New York, 2013.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer, 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Connected Dominating Set Theory And Applications. Springer, 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer New York, 2014.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Resolving connected dominating set"

1

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_89.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_89-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Cheng, Xiuzhen, Feng Wang, and Ding-Zhu Du. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_89.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_476.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_619.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_619-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_476.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Kim, Donghyun, Wei Wang, Weili Wu, and Alade O. Tokuta. "Fault-Tolerant Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_622.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kim, Donghyun, Wei Wang, Weili Wu, and Alade O. Tokuta. "Fault-Tolerant Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_622-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Du, Hongwei, and Haiming Luo. "Routing-Cost Constrained Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_621.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Resolving connected dominating set"

1

Yılmaz, Aziz Can, and Çağatay Berke Erdaş. "Distributed Connected Dominating Set Based Algorithm for Mobile Ad-Hoc Networks." In 2024 11th International Conference on Electrical and Electronics Engineering (ICEEE). IEEE, 2024. https://doi.org/10.1109/iceee62185.2024.10779296.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Yu, Dongxiao, Yifei Zou, Yong Zhang, et al. "Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model." In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2019. http://dx.doi.org/10.1109/ipdps.2019.00092.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Vakili, Sattar, and Qing Zhao. "Distributed node-weighted connected dominating set problems." In 2013 Asilomar Conference on Signals, Systems and Computers. IEEE, 2013. http://dx.doi.org/10.1109/acssc.2013.6810267.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Yang, Zhi, Pengfei Li, Yanxiang Bao, and Xiao Huang. "A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm." In 2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2019. http://dx.doi.org/10.1109/iaeac47372.2019.8997653.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Yu, Jiguo, Wenchao Li, and Li Feng. "Connected Dominating Set Construction in Cognitive Radio Networks." In 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI). IEEE, 2015. http://dx.doi.org/10.1109/iiki.2015.66.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Singh, Amit, and Aitha Nagaraju. "Connected dominating set based network coding for SDN." In 2016 2nd International Conference on Contemporary Computing and Informatics (IC3I). IEEE, 2016. http://dx.doi.org/10.1109/ic3i.2016.7918792.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Yi, Li, Weidong Fang, Wei Chen, Wuxiong Zhang, and Guoqing Jia. "Overlapped Connected Dominating Set for Big Data Security." In IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2022. http://dx.doi.org/10.1109/infocomwkshps54753.2022.9798337.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Jinqin Tian and Hongsheng Ding. "Solving Minimum Connected Dominating Set on Proper Interval Graph." In 2013 6th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2013. http://dx.doi.org/10.1109/iscid.2013.25.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Wu, Zemin, and Hai Wang. "Target Tracking Based on Connected Dominating Set in WSN." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.910.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Chandra, Anita, Nachiketa Tarasia, Ashu Kumari, and Amulya Ratan Swain. "A distributed connected dominating set using adjustable sensing range." In 2014 International Conference on Advanced Communication, Control and Computing Technologies (ICACCCT). IEEE, 2014. http://dx.doi.org/10.1109/icaccct.2014.7019217.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Resolving connected dominating set"

1

Ogier, R., and P. Spagnolo. Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding. RFC Editor, 2009. http://dx.doi.org/10.17487/rfc5614.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Resolving connected dominating set” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie
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!

Do bibliografii