Stochastic models in queueing theory
Stochastic models in queueing theory
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
On Approximate Computer System Models
Journal of the ACM (JACM)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Measurement and performance of a cognitive packet network
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on networking middleware: selected papers from the TERENA networking conference 2001
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Autonomous Smart Routing for Network QoS
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Ad Hoc Networking
IEEE Communications Magazine
Diffusion Approximation Model for the Distribution of Packet Travel Time at Sensor Networks
Wireless Systems and Mobility in Next Generation Internet
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
A diffusion approximation for batch queues of type GX/G(b,b)/1
Performance Evaluation
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Packets travelling in non-homogeneous networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Adaptive random re-routing for differentiated QoS in sensor networks
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Journal of Network and Computer Applications
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
Hi-index | 0.00 |
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.