A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks

DOI10.1137/080725684zbMath1209.90073DBLPjournals/siamam/KeelerT10OpenAlexW2033001101WikidataQ58645448 ScholiaQ58645448MaRDI QIDQ5392308

H. Paul Keeler, Peter G. Taylor

Publication date: 8 April 2011

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8548a81755b82722a92ca30f3ddfe2f42f76665a

zbMATH Keywords

geometric routingmultihopsleep scheme

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

A stochastic analysis of greedy routing in a spatially dependent sensor network ⋮ Traffic flow densities in large transport networks ⋮ Hop Count Distributions of the Furthest and Nearest Distance Routing Protocols in Mobile Ad Hoc Networks

This page was built for publication: A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks