A STOCHASTIC ANALYSIS OF A GREEDY ROUTING SCHEME IN SENSOR NETWORKS

We address the stochastic characteristics of a recently proposed greedy routing scheme. The behavior of individual hop advancements is examined, and asymptotic expressions for the hop length moments are obtained. The change of the hop distribution as the sink distance is varied is quantified with a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on applied mathematics 2010-01, Vol.70 (7/8), p.2214-2238
Hauptverfasser:	KEELER, H. P., TAYLOR, P. G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Area function Asymptotic methods Asymptotic properties Computer networks Data transmission Fourier transforms Mathematical models Mathematical moments Modeling Musical intervals Path dependence Random variables Routing (telecommunications) Sensors Sleep Stochastic models Stochasticity Studies Tasks
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!