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

DOI10.1017/S095679251200006XMaRDI QIDQ2895871zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A stochastic analysis of a greedy routing scheme in sensor networks
• Random transmission radii in greedy routing models for ad hoc sensor networks
• A state-based model of sensor protocols
• On random routing in wireless sensor grids: a mathematical model for rendezvous probability and performance optimization
• Distributed computation of virtual coordinates for greedy routing in sensor networks

Cites work

• scientific article; zbMATH DE number 44103 (Why is no real title available?)
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• A stochastic analysis of a greedy routing scheme in sensor networks
• 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

Cited in

(8)

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

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)