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

DOI10.1017/S095679251200006XzbMATH Open1244.90054OpenAlexW2963379505MaRDI QIDQ2895871FDOQ2895871

H. P. 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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing elliptic integrals by duplication
• Numerical computation of real or complex elliptic integrals
• On the distribution of points in a cube and the approximate evaluation of integrals
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• 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

Cited In (5)

• A distributed routing algorithm for sensor networks derived from macroscopic models
• Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
• Sensitivity Analysis of an Optimal Routing Policy in an Ad Hoc Wireless Network
• Asymptotics of search strategies over a sensor network
• Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895871)