In this paper we show that the problem of adapting minimum connected d-hop dominating set.3 to local topology changes in wireless ad hoc network.3 is NP- ...

In this paper, we show that the problem of adapting minimum connected d-hop dominating sets to local topology changes in wireless ad hoc networks is NP-complete ...

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks. Bolla J.A., Huynh D.T.. Expand. Publication type: Proceedings Article.

In the algorithm, the set is cumulatively built with communication requests between the nodes in the net- work. The set changes as the network topology changes.

Firstly, due to the high degree of mobility, the topology structure of a FANET changes more frequently than that of the typical MANETs or vehicle ad hoc ...

An adaptiveself-stabilizing algorithm for producing a d-hop connected d-Hop dominating set that contains redundancy nodes and can be used as a backbone of ...

Wang et al. [20] proposed a method to construct a virtual backbone network (VBN) based on the graph theory d-hop CDS (d-CDS), which can reduce the excessive ...

Changing the transmission power of the nodes reduces the network topology, saves energy, and increases the lifetime of the network while preserving connectivity ...

Abstract—In this paper, we consider the problem how to interconnect an obtained d-hop MIS into a d-hop CDS. Firstly, we deal with a simple case d = 2 and ...

The nodes in the CDS are called dominators and other nodes are called dominatees. With the help of the CDS, routing is easier and can adapt quickly to network ...