Selection diversity forwarding in a multihop packet radio network with fading channel and capture
ACM SIGMOBILE Mobile Computing and Communications Review
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
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
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
On the performance modeling of opportunistic routing
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the maximum performance in opportunistic routing
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
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
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
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.02 |
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently.