‎Let $G=(V,E)$ be a graph‎. ‎A subset $Ssubset V$ is a hop dominating set‎‎if every vertex outside $S$ is at distance two from a vertex of‎‎$S$‎. ‎A hop dominating set $S$ which induces a connected subgraph‎ ‎is called a connected hop dominating set of $G$‎. ‎The‎‎connected hop domination number of $G$‎, ‎$ gamma_{ch}(G)$,‎‎‎ ‎is the minimum cardinality of a connected hop‎‎dominating set of $G$...

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

Abstract. We propose a notion of extended dominating set whereby each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks where transmitting independent copies of a packet generates diversity and combats the effects of fading. In this paper we propose several efficient ...

A subset S of V (G), where G is a simple undirected graph, hop dominating if for each v ∈ (G) \ S, there exists w such that dG(v, w) = 2 and it differentiating N2 G[u] ∩ ̸= G[v] any two distinct vertices u, (G). set ⊆ both in G. The minimum cardinality G, denoted by γdh(G), called the domination number In this paper, we investigate some properties newly defined parameter. particular, characteriz...

The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal dominating set (MDS) of the network. According to this algorithm, each node determines the membership in the MDS for itself and its one-hop nei...

Wireless sensor networks (WSNs) consist of battery-constrained sensors often deployed in harsh environments with little to no human control, thereby necessitating scalable and energy-efficient techniques. For this reason, self-organizing and maintenance mechanisms are very appealing to the design of WSNs. In this paper, we propose a routing scheme, called WCDSDCR, that meets these design requir...

In this paper, we propose an adaptive selfstabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with communication requests between the nodes in the network. The set changes as the network topology changes. It contains redundancy nodes and can be used as a backbone of an ad hoc mobile network.

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI),...

—In this paper, a Connected Dominating Set (CDS) construction algorithm CSCDS (Connected Subset based CDS) is proposed, which is based on the connected subset concept. The CSCDS contains two main stages, which are dominating set construction stage and connected dominating set construction stage respectively. In the first stage, the dominators are proposed based on the one hop white neighbor in...

By exploring the intelligent cooperation of unmanned aerial vehicle (UAV) swarms, formed flying ad-hoc networks (FANETs) can support a variety collaborative operations with real-time communications in emergency scenarios. To reduce prohibitively high routing overhead connectivity guaranteed multi-hop links, UAV swarms construct virtual backbone network (VBN) based on graph-theoretical <inline-f...