Affiliation:
1. Imperial College London, London, UK
Abstract
We consider a wireless network in which packets are forwarded opportunistically from the source towards the destination, without accurate knowledge of the direction that they should take. A Brownian motion model that includes the effect of packet losses, and subsequent retransmission after a time-out, is used to compute the average travel time of the packet. The results indicate that the average travel time is always finite provided that a time-out is used, and that there is an element of randomness in the manner in which successive nodes are being chosen. We show that the average packet travel time can be minimized by a judicious choice of the time-out, and its optimum value in turn depends on other system parameters such as packet-loss probabilities. We present simulations that illustrate the analytical results.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference15 articles.
1. A survey on sensor networks
2. Einstein A. 1926. Investigations on the Theory of Brownian Motion. Dutton and Dover New York. Einstein A. 1926. Investigations on the Theory of Brownian Motion. Dutton and Dover New York.
3. Computing Reliability and Message Delay for Cooperative Wireless Distributed Sensor Networks Subject to Random Failures
4. On Approximate Computer System Models
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献