Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications
Authors:
Open Access
- 12 November 2014
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 47 (2) , 1-36
Abstract
Opportunistic Routing (OR) is a new promising paradigm that has been proposed for wireless networks. OR has gained a lot of attention from the research communities for its ability to increase the performance of wireless networks. It benefits from the broadcast characteristic of wireless mediums to improve network performance. The basic function of OR is its ability to overhear the transmitted packet and to coordinate among relaying nodes. In OR, a candidate set is a potential group of nodes that is selected as the next-hop forwarders. Hence, each node in OR can use different potential paths to send packets toward the destination. Any of the candidates of a node that have received the transmitted packet may forward it. The decision of choosing the next forwarder is made by coordination between candidates that have successfully received the transmitted packet. In OR, by using a dynamic relay node to forward the packet, the transmission reliability and network throughput can be increased. In this article, we explain the fundamental idea of OR and its important issues by providing some examples. We then categorize each of the important issues and explain them in detail. Furthermore, we illustrate different protocols from each category and compare their benefits and drawbacks. Finally, some potential directions for future research in OR is explained.Keywords
This publication has 62 references indexed in Scilit:
- Direction-based adaptive data propagation for heterogeneous sensor mobilityJournal of Parallel and Distributed Computing, 2012
- Opportunistic routing – A review and the challenges aheadComputer Networks, 2011
- Survey on diversity-based routing in wireless mesh networks: Challenges and solutionsComputer Communications, 2010
- Exploiting path diversity in the link layer in wireless ad hoc networksAd Hoc Networks, 2008
- On selection of candidates for opportunistic anypath forwardingACM SIGMOBILE Mobile Computing and Communications Review, 2006
- ExORACM SIGCOMM Computer Communication Review, 2005
- Opportunistic routing in multi-hop wireless networksACM SIGCOMM Computer Communication Review, 2004
- Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performanceIEEE Transactions on Mobile Computing, 2003
- Selection diversity forwarding in a multihop packet radio network with fading channel and captureACM SIGMOBILE Mobile Computing and Communications Review, 2001
- Network information flowIEEE Transactions on Information Theory, 2000