Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Computational investigations of low-discrepancy sequences
ACM Transactions on Mathematical Software (TOMS)
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Why Are High-Dimensional Finance Problems Often of Low Effective Dimension?
SIAM Journal on Scientific Computing
Ad hoc networks beyond unit disk graphs
Wireless Networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
GNU Scientific Library Reference Manual - Third Edition
GNU Scientific Library Reference Manual - Third Edition
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Stochastic Geometry and Wireless Networks, Part I: Theory
Stochastic Geometry and Wireless Networks, Part I: Theory
On routing in random Rayleigh fading networks
IEEE Transactions on Wireless Communications
Position-based routing in ad hoc networks
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Scalable geographic routing algorithms for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is give a better understanding of stochastic dependencies arising in the system and to offer a method of computing the advancement of message under greedy routing. We observe that the majority of the stochastic dependence from a routing path is captured by including only the previous forwarding node location. We examine a simple uncoordinated power-saving scheme with a new understanding of its effects on local node density. We propose a method for sensibly limiting the number of transmission reattempts before concluding there is no node in the forwarding region. All expressions involving multidimensional integrals are derived and evaluated readily with quasi-Monte Carlo integration methods. An importance sampling function is derived to speed up the quasi-Monte Carlo methods. The integral expressions are compared to simulations and give very agreeable results.