A stochastic analysis of greedy routing in a spatially dependent sensor network

DOI10.1017/S095679251200006XzbMath1244.90054OpenAlexW2963379505MaRDI QIDQ2895871

H. Paul Keeler

Publication date: 13 July 2012

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s095679251200006x

zbMATH Keywords

elliptic integralsad hoc networknon-stationary process

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Stochastic network models in operations research (90B15)

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical computation of real or complex elliptic integrals
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• Computing elliptic integrals by duplication
• Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
• Stochastic Geometry and Wireless Networks: Volume I Theory
• A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks
• On the distribution of points in a cube and the approximate evaluation of integrals

This page was built for publication: A stochastic analysis of greedy routing in a spatially dependent sensor network