Opportunistic routing in multi-hop wireless networks
ACM SIGCOMM Computer Communication Review
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
On selection of candidates for opportunistic anypath forwarding
ACM SIGMOBILE Mobile Computing and Communications Review
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Link Probability Based Opportunistic Routing Metric in Wireless Network
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
Computer Communications
Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions
IEEE Communications Magazine
Candidate selection algorithms in opportunistic routing
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Modeling and comparison of candidate selection algorithms in opportunistic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new multicast opportunistic routing protocol for wireless mesh networks
NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking
On the number of candidates in opportunistic routing for multi-hop wireless networks
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
| Hi-index | 0.00 |
In this paper we propose a discrete time Markov model to assess the improvement that may be achieved using opportunistic routing. We show that our model can be used to compute the probability distribution and moments of the number of transmissions needed to send a packet from the source to the destination in a variety of scenarios. We use our model to compute some opportunistic routing performance measures in a network with a shadowing radio propagation model with different network topologies, and varying the maximum number of candidates used by the opportunistic routing algorithm. Our model can be easily extended to evaluate other aspects of opportunistic routing not covered in this paper. Therefore, we believe that our model yields a simple, yet flexible and powerful tool to evaluate opportunistic routing protocols.