Relevant bibliographies by topics / K-hop connected dominating set

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'K-hop connected dominating set'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'K-hop connected dominating set.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "K-hop connected dominating set"

1

Pabilona, Yamilita M., and Helen M. Rara. "Connected hop domination in graphs under some binary operations." Asian-European Journal of Mathematics 11, no. 05 (October 2018): 1850075. http://dx.doi.org/10.1142/s1793557118500754.

Full text
Abstract:
Let [Formula: see text] be a simple graph. A hop dominating set [Formula: see text] is called a connected hop dominating set of [Formula: see text] if the induced subgraph [Formula: see text] of [Formula: see text] is connected. The smallest cardinality of a connected hop dominating set of [Formula: see text], denoted by [Formula: see text], is called the connected hop domination number of [Formula: see text]. In this paper, we characterize the connected hop dominating sets in the join, corona and lexicographic product of graphs and determine the corresponding connected hop domination number of these graphs. The study of these concepts is motivated with a social network application.
APA, Harvard, Vancouver, ISO, and other styles
2

ZHANG, ZHAO, QINGHAI LIU, and DEYING LI. "TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET." Discrete Mathematics, Algorithms and Applications 01, no. 04 (December 2009): 485–98. http://dx.doi.org/10.1142/s1793830909000361.

Full text
Abstract:
A vertex set D of a connected graph G is a (k, r)-connected dominating set ((k, r)-CDS) if every vertex in V(G)\D is at most r-hops away from at least k vertices in D. Finding a minimum (k, r)-CDS has wireless sensor network as its background. In this paper, we give two approximation algorithms to compute a minimum (k, r)-CDS, which improves previous works in regard of performance ratio.
APA, Harvard, Vancouver, ISO, and other styles
3

LI, DEYING, LIN LIU, and HUIQIANG YANG. "MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS." Discrete Mathematics, Algorithms and Applications 01, no. 01 (March 2009): 45–57. http://dx.doi.org/10.1142/s1793830909000087.

Full text
Abstract:
In this paper, we study the connected r-hop k-dominating set problem in wireless networks. We propose two algorithms for the problem. We prove that algorithm I for UDG has (2r + 1)3 approximate ratio for k ≤ (2r + 1)2 and (2r + 1)((2r + 1)2 + 1)-approximate ratio for k > (2r + 1)2. And algorithm II for any undirected graph has (2r + 1) ln (Δr) approximation ratio, where Δr is the largest cardinality among all r-hop neighborhoods in the network. The simulation results show that our algorithms are efficient.
APA, Harvard, Vancouver, ISO, and other styles
4

Coelho, Rafael S., Phablo F. S. Moura, and Yoshiko Wakabayashi. "The k-hop connected dominating set problem: hardness and polyhedra." Electronic Notes in Discrete Mathematics 50 (December 2015): 59–64. http://dx.doi.org/10.1016/j.endm.2015.07.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Coelho, Rafael S., Phablo F. S. Moura, and Yoshiko Wakabayashi. "The k-hop connected dominating set problem: approximation and hardness." Journal of Combinatorial Optimization 34, no. 4 (March 21, 2017): 1060–83. http://dx.doi.org/10.1007/s10878-017-0128-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Canoy, Jr, Sergio, Reynaldo Villarobe Mollejon, and John Gabriel E. Canoy. "Hop Dominating Sets in Graphs Under Binary Operations." European Journal of Pure and Applied Mathematics 12, no. 4 (October 31, 2019): 1455–63. http://dx.doi.org/10.29020/nybg.ejpam.v12i4.3550.

Full text
Abstract:
Let G be a (simple) connected graph with vertex and edge sets V (G) and E(G),respectively. A set S ⊆ V (G) is a hop dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such that dG(v, w) = 2. The minimum cardinality of a hop dominating set of G, denoted by γh(G), is called the hop domination number of G. In this paper we revisit the concept of hop domination, relate it with other domination concepts, and investigate it in graphs resulting from some binary operations.
APA, Harvard, Vancouver, ISO, and other styles
7

Mohamad, Jerson Saguin, and Helen M. Rara. "On Resolving Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 14, no. 3 (August 5, 2021): 1015–23. http://dx.doi.org/10.29020/nybg.ejpam.v14i3.4055.

Full text
Abstract:
A set S of vertices in a connected graph G is a resolving hop dominating set of G if S is a resolving set in G and for every vertex v ∈ V (G) \ S there exists u ∈ S such that dG(u, v) = 2. The smallest cardinality of such a set S is called the resolving hop domination number of G. This paper presents the characterizations of the resolving hop dominating sets in the join, corona and lexicographic product of two graphs and determines the exact values of their corresponding resolving hop domination number.
APA, Harvard, Vancouver, ISO, and other styles
8

CHEN, YUANZHU PETER, and ARTHUR L. LIESTMAN. "A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS." International Journal of Foundations of Computer Science 14, no. 02 (April 2003): 305–22. http://dx.doi.org/10.1142/s0129054103001741.

Full text
Abstract:
A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defined to be the set of vertices dominated by a particular vertex in the dominating set. As it is NP-complete to determine whether a given graph has a weakly-connected dominating set of a particular size, we present a zonal distributed algorithm for finding small weakly-connected dominating sets. In this new approach, we divide the graph into regions, construct a weakly-connected dominating set for each region, and make adjustments along the borders of the regions to produce a weakly-connected dominating set of the entire graph. We present experimental evidence that this zonal algorithm has similar performance to and provides better cluster connectivity than previous algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Natarajan, C., and S. K. Ayyaswamy. "Hop Domination in Graphs-II." Analele Universitatii "Ovidius" Constanta - Seria Matematica 23, no. 2 (June 1, 2015): 187–99. http://dx.doi.org/10.1515/auom-2015-0036.

Full text
Abstract:
Abstract Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G). In this paper we characterize the family of trees and unicyclic graphs for which γh(G) = γt(G) and γh(G) = γc(G) where γt(G) and γc(G) are the total domination and connected domination numbers of G respectively. We then present the strong equality of hop domination and hop independent domination numbers for trees. Hop domination numbers of shadow graph and mycielskian graph of graph are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
10

Bent-Usman, Wardah Masanggila, Rowena Isla, and Sergio Canoy. "Neighborhood Connected k-Fair Domination Under Some Binary Operations." European Journal of Pure and Applied Mathematics 12, no. 3 (August 2, 2019): 1337–49. http://dx.doi.org/10.29020/nybg.ejpam.v12i3.3506.

Full text
Abstract:
Let G=(V(G),E(G)) be a simple graph. A neighborhood connected k-fair dominating set (nckfd-set) is a dominating set S subset V(G) such that |N(u) intersection S|=k for every u is an element of V(G)\S and the induced subgraph of S is connected. In this paper, we introduce and invistigate the notion of neighborhood connected k-fair domination in graphs. We also characterize such dominating sets in the join, corona, lexicographic and cartesians products of graphs and determine the exact value or sharp bounds of their corresponding neighborhood connected k-fair domination number.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "K-hop connected dominating set"

1

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/.

Full text
Abstract:
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.
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.
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
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.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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 pas une fin en soi. Dans cet axe, on a exploité les apports de notre mécanisme de clusterisation conjointement avec le mode veille, à travers la proposition de l’approche de conservation d’énergie baptisée CPPCM ‘Cluster based Prioritized Power Conservation Mechanism’ avec deux variantes. Notre objectif principal est de réduire la consommation d’énergie tout en assurant l’acheminement des paquets de données sans endurer des temps d’attente importants aux niveaux des files d’attente des nœuds impliqués dans le transfert. Nous avons proposé aussi un algorithme de routage LCR ‘Layered Cluster based Routing’ se basant sur l’existence d’une infrastructure virtuelle. L’exploitation des apports de notre mécanisme TBCA et la limitation des tâches de routage additionnelles à un sous ensemble de nœuds sont des atouts pour assurer le passage à l’échelle de notre algorithme
Relying on a virtual infrastructure seems a promising approach to overcome the scalability problem in large scale ad hoc networks. First, we propose a clustering mechanism, TBCA ‘Tiered based Clustering algorithm’, operating in a layered manner and exploiting the eventual collision to accelerate the clustering process. Our mechanism does not necessitate any type of neighbourhood knowledge, trying to alleviate the network from some control messages exchanged during the clustering and maintenance process. Since the energy consumption is still a critical issue, we combining a clustering technique and the power saving mode in order to conserve energy without affecting network performance. The main contribution of our power saving approach lies on the differentiation among packets based on the amount of network resources they have been so far consumed. Besides, the proposed structure of the beacon interval can be adjusted dynamically and locally by each node according to its own specific requirements. We propose also a routing algorithm, LCR ‘Layered Cluster based Routing’. The basic idea consists on assigning additional tasks to a limited set of dominating nodes, satisfying specific requirements while exploiting the benefits of our clustering algorithm TBCA
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
碩士
國立清華大學
資訊工程學系
92
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. In this paper, the node property of a connected k-hop dominating set is found, and it is proved that a k-hop dominating set is connected if all nodes in V belong to the node property. By its aid, a connected k-hop dominating set is constructed and maintained using only 2-hop neighbor information. Our simulation shows that the connected dominating set shrinks consistently as the hop count of k grows.
APA, Harvard, Vancouver, ISO, and other styles
8

Janáčik, Peter [Verfasser]. "Self-organizing construction of connected k-hop dominating sets in wireless sensor networks / Peter Janáčik." 2010. http://d-nb.info/1007084669/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
Abstract:
碩士
元智大學
資訊工程學系
94
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 the dominating set is selected as the forwarding nodes to rebroadcast the packet to control the number of packets effectively. Then, the number of packets transmission, the power consumption, the contention and the collision problem can be reduced. However, their methods may need more overhead for creating the dominating set. This paper will propose an efficient approach to improve the above problem. Basically, we will design an election algorithm to select a connected dominating set from Ad Hoc Networks. The election algorithm is based on the AODV, with which the hello message may contain the election information to select the connected dominating set. In this way, the backbone can be established with the minimum cost. After the backbone is created, the number of rebroadcast packets can be reduced effectively.
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
碩士
朝陽科技大學
資訊與通訊系
106
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, this type of architecture is suitable for emergency relief and military, because of its flexible network architecture. However, in the Ad-Hoc network, there are some issues in the Ad-Hoc network need to be considered, such as bandwidth, transmission range restrictions, processing power and battery power. As a result of the above restrictions, how to reduce the power and bandwidth consumption in Ad-Hoc network by using efficient routing that is very important issue. Based on reason above, the Connected Dominating Set (CDS) is proposed and used as a virtual backbone in the Ad-Hoc wireless network. However, the previous algorithm cannot reduce the size of CDS effectively due to poor node configuration. Therefore, a Relative Complement Sufferage CDS (RCS-CDS) protocol is proposed to construct the minimum size of CDS by using the relative complement theory.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "K-hop connected dominating set"

1

Aldama, Frederick Luis, ed. Graphic Indigeneity. University Press of Mississippi, 2020. http://dx.doi.org/10.14325/mississippi/9781496828019.001.0001.

Full text
Abstract:
Graphic Indigeneity: Comics in the Americas and Australasia brings together scholarship that interrogates mainstream comic book traditions that have negatively stereotyped as well as positively complicated Indigenous identities and experiences of terra America and Australasia. It also includes scholarship that analyzes how Indigenous comic book creators are themselves clearing new visual-verbal narrative spaces for articulating complex histories, cultures, experiences, and identities. Here, the volume also seeks to shed light on how the violent wounds of colonial and imperial domination across the globe connect Indigenous comic books creators in their expressions of survival, resistance, and affirmation. Comics analyzed include, but are not limited to, the following: The Phantom, Uncanny X-Men, Comanche Moon, Captain Canuck, Alpha Flight, Fighting Indians of the West, Footrot Flats, Ngarimu Te Tohu Toa, Turey el Taíno, La Borinqueña, Manuel Antonio Ay, Zotz, Will I See?, Super Indian, Deer Woman, Moonshot, Trickster: Native American Tales, Pablo’s Inferno, Supercholo, La Chola Power, Turbochaski, and Supay. This volume reminds the world of the ways pop culture has violently misrepresented Native and Indigenous peoples. It reminds the world of the significant presence of Native and Indigenous artists in creating counter-narratives that powerfully shape global histories and cultures.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "K-hop connected dominating set"

1

Basuchowdhuri, Partha, and Subhashis Majumder. "Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set." In Applied Algorithms, 137–51. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04126-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chiang, Mao-Lun, Ze-Yu Chen, Hui-Ching Hsieh, and Tsui-Ping Chang. "Nominate Connected Dominating Set Algorithm in Mobile Ad Hoc Network." In Recent Advances in Intelligent Information Hiding and Multimedia Signal Processing, 233–40. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03745-1_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramalakshmi, R., and S. Radhakrishnan. "Energy Efficient Stable Connected Dominating Set Construction in Mobile Ad Hoc Networks." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 63–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27299-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Meghanathan, Natarajan. "A Node Stability Index-Based Connected Dominating Set Algorithm for Mobile Ad Hoc Networks." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 31–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27299-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yan, Xinfang, Yugeng Sun, and Yanlin Wang. "A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks." In Grid and Cooperative Computing, 719–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24680-0_116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Butenko, Sergiy, Xiuzhen Cheng, Carlos A. Oliveira, and P. M. Pardalos. "A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks." In Cooperative Systems, 61–73. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4613-0219-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gao, Bo, Huiye Ma, and Yuhang Yang. "A New Distributed Approximation Algorithm for Constructing Minimum Connected Dominating Set in Wireless Ad Hoc Networks." In Parallel and Distributed Processing and Applications, 352–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30566-8_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anitha, V. S., and M. P. Sebastian. "Multi-Purpose DS-Based Cluster Formation and Management in Mobile Ad Hoc Networks." In Innovations in Mobile Multimedia Communications and Applications, 1–20. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-563-6.ch001.

Full text
Abstract:
This chapter proposes a scenario-based and diameter-bounded algorithm for cluster formation and management in mobile ad hoc networks (MANETs). A (k, r) -Dominating Set is used for the selection of clusterheads and gateway nodes depending on the topology of the network. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node selects the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. The long-term service as a clusterhead depletes its energy, causing it to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and can adversely affect the network performance. Load balancing among the clusterheads and correct positioning of the clusterhead in a cluster are vital to increase the lifespan of a network. The proposed centralized algorithm periodically calculates the quality of all dominating nodes in the network and if it goes below the threshold level it resigns the job as the clusterhead and sends this message to all other members in the cluster. Since these nodes have k dominating nodes within the r -hop distance, it can choose the current best-qualified node as its clusterhead. Simulation experiments are conducted to evaluate the performance of the algorithm in terms of the number of elements in the (k, r)-DS, the load balancing factor, the number of re-affiliations per unit time and the number of dominating set updates per unit time. The results establish the potential of this algorithm for use in MANETs.
APA, Harvard, Vancouver, ISO, and other styles
9

"A Survey of Connected Dominating Set Construction Techniques for Ad Hoc Sensor Networks." In Wireless Sensor Networks, 267–84. CRC Press, 2013. http://dx.doi.org/10.1201/b15425-14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Meghanathan, Natarajan. "Algorithms to Determine Stable Connected Dominating Sets for Mobile Ad Hoc Networks." In Advances in Wireless Technologies and Telecommunication, 249–74. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-5170-8.ch009.

Full text
Abstract:
This chapter presents three algorithms to determine stable connected dominating sets (CDS) for wireless mobile ad hoc networks (MANETs) whose topology changes dynamically with time. The three stability-based CDS algorithms are (1) Minimum Velocity (MinV)-based algorithm, which prefers to include a slow moving node as part of the CDS as long as it covers one uncovered neighbor node; (2) Node Stability Index (NSI)-based algorithm, which characterizes the stability of a node as the sum of the predicted expiration times of the links (LET) with its uncovered neighbor nodes, the nodes preferred for inclusion to the CDS in the decreasing order of their NSI values; (3) Strong Neighborhood (SN)-based algorithm, which prefers to include nodes that cover the maximum number of uncovered neighbors within its strong neighborhood (region identified by the Threshold Neighborhood Ratio and the fixed transmission range of the nodes). The three CDS algorithms have been designed to capture the node size—lifetime tradeoff at various levels. In addition to presenting a detailed description of the three stability-based CDS algorithms with illustrative examples, the authors present an exhaustive simulation study of these algorithms and compare their performance with respect to several metrics vis-à-vis an unstable maximum density-based MaxD-CDS algorithm that serves as the benchmark for the minimum CDS Node Size.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "K-hop connected dominating set"

1

Wang, Jiahong, Yuhiro Yonamine, Eiichiro Kodama, and Toyoo Takata. "A Distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks." In 2013 International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2013. http://dx.doi.org/10.1109/icpads.2013.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Moulahi, Tarek, Herve Guyennet, Salem Nasri, and Rjab Hajlaoui. "On the construction of load-balanced (k, r-hop)-connected dominating set for WSNs." In 2012 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS). IEEE, 2012. http://dx.doi.org/10.1109/ants.2012.6524232.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xianyue, Xiaofeng Gao, and Chenxia Zhao. "A New Greedy Algorithm for D-Hop Connected Dominating Set." In 2014 10th International Conference on Mobile Ad-hoc and Sensor Networks (MSN). IEEE, 2014. http://dx.doi.org/10.1109/msn.2014.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xing, Kai, Wei Cheng, E. K. Park, and Shmuel Rotenstreich. "Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs." In 2008 28th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, 2008. http://dx.doi.org/10.1109/icdcs.2008.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Harutyunyan, Louisa, and Lata Narayanan. "Minimum 2-connected distance-k p-dominating set in wireless sensor networks." In 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). IEEE, 2012. http://dx.doi.org/10.1109/wimob.2012.6379076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wenyong Wang, Jun Zhang, Yong Tang, Yu Xiang, and Ting Yang. "One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set." In Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010). IEEE, 2010. http://dx.doi.org/10.1109/paap.2010.64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Yefang, Tianping Shuai, and Wenbao Ai. "Construction of 1- and 2-Connected k-Totally Dominating Set in Disk Graph." In 2011 Fourth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2011. http://dx.doi.org/10.1109/cso.2011.110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tiwari, Ravi, Tania Mishra, Yingshu Li, and My T. Thai. "k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links." In 2007 International Conference on Wireless Algorithms, Systems and Applications. IEEE, 2007. http://dx.doi.org/10.1109/wasa.2007.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Yun, Kai Li, and Qiang Xu. "A Distributed Topology Control Algorithm for k-Connected Dominating Set in Wireless Sensor Networks." In 2007 2nd International Conference on Pervasive Computing and Applications. IEEE, 2007. http://dx.doi.org/10.1109/icpca.2007.4365521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xu, Li, Penggui Pan, Xiaoding Wang, and Wei Wu. "Physical-Layer Network Coding and Connected Dominating Set Based Routing Protocol in Wireless Multi-hop Network." In 2012 4th International Conference on Intelligent Networking and Collaborative Systems (INCoS). IEEE, 2012. http://dx.doi.org/10.1109/incos.2012.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "K-hop 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, August 2009. http://dx.doi.org/10.17487/rfc5614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'K-hop connected dominating set' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography