Near-Optimal Algorithm for Self-configuration of Ad-hoc Wireless Networks

Near-Optimal Algorithm for Self-configuration of Ad-hoc Wireless Networks

To quantify the goodness of a configuration, we develop a probabilistic model of network configuration. A probabilistic graph then represents the statistical dependence in network configuration, and shows that self-configuration can be optimized if the graph has nested local dependence.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jeon, Sung-Eok, Ji, Chuanyi
Format: Buchkapitel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To quantify the goodness of a configuration, we develop a probabilistic model of network configuration. A probabilistic graph then represents the statistical dependence in network configuration, and shows that self-configuration can be optimized if the graph has nested local dependence.
ISSN:0302-9743
1611-3349
DOI:10.1007/11428862_39