Design and performance of a distributed dynamic clustering algorithm for ad-hoc networks

Routing in ad-hoc networks is a difficult challenge that involves a tradeoff between efficiency and responsiveness. An ad-hoc network routing algorithm must adapt rapidly enough to topology changes to meet the performance demands of users, without over-utilizing network resources. This paper present...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	McDonald, A.B., Znati, T.F.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Ad hoc networks Algorithm design and analysis Clustering algorithms Delay Heuristic algorithms Network topology Robustness Routing Telecommunication network topology Telecommunication traffic
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!