GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
On the latency for information dissemination in mobile wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Analytic Combinatorics
The capacity of wireless networks
IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
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: Volume II Applications
Foundations and Trends® in Networking
Testbed results of an opportunistic routing for multi-robot wireless networks
Computer Communications
Hi-index | 0.00 |
Classical routing strategies for mobile ad hoc networks operate in a hop by hop "push mode" basis: packets are forwarded on pre-determined relay nodes, according to previously and independently established link performance metrics (e.g., using hellos or route discovery messages). Conversely, recent research has highlighted the interest in developing opportunistic routing schemes, operating in "pull mode": the next relay can be selected dynamically for each packet and each hop, on the basis of the actual network performance. This allows each packet to take advantage of the local pattern of transmissions at any time. The objective of such opportunistic routing schemes is to minimize the end-to-end delay required to carry a packet from the source to the destination. In this paper, we provide upper bounds on the packet propagation speed for opportunistic routing, in a realistic network model where link conditions are variable. We analyze the performance of various opportunistic routing strategies and we compare them with classical routing schemes. The analysis and the simulations show that opportunistic routing performs significantly better. We also investigate the effects of mobility and of random fading. Finally, we present numerical simulations that confirm the accuracy of our bounds.