Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs

The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this paper, we formulate a new stochastic variant of the problem. In this problem, each node in the graph has a hidden...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking Jg. 28; H. 1; S. 387 - 398
1. Verfasser: Fukunaga, Takuro
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.02.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Ad hoc networks
Adaptation models
Adaptive algorithms
adaptive optimization
Algorithms
Approximation algorithms
Computational modeling
Connected dominating set
Decision trees
Distributed algorithms
Minimization
Minimum weight
Nodes
polymatroid Steiner tree
Wireless communication
ISSN:1063-6692, 1558-2566
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this paper, we formulate a new stochastic variant of the problem. In this problem, each node in the graph has a hidden random state, which represents whether the node is active or inactive, and we seek a CDS of the graph that consists of the active nodes. We consider an adaptive algorithm for this problem, which repeat choosing nodes and observing the states of the nodes around the chosen nodes until a CDS is found. Our algorithms have a theoretical performance guarantee that the sum of the weights of the nodes chosen by the algorithm is at most <inline-formula> <tex-math notation="LaTeX">O(\alpha \log (1/\delta)) </tex-math></inline-formula> times that of any adaptive algorithm in expectation, where <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula> is an approximation factor for the node-weighted polymatroid Steiner tree problem and <inline-formula> <tex-math notation="LaTeX">\delta </tex-math></inline-formula> is the minimum probability of possible scenarios on the node states.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2019.2963361