Trading optimality for scalability in large-scale opportunistic routing

Yanhua Li, Abedelaziz Mohaisen, Zhi Li Zhang

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


Opportunistic routing utilizes the broadcast nature of wireless networks, significantly promoting the unicast throughput. Many variations of opportunistic routing designs have been proposed, although all of the current designs consistently rely on all of the topology information to construct forwarder lists and process data forwarding, which indeed restricts the application in large-scale wireless networks, where collecting global optimal information is very costly. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS-B) algorithm to partition the topology into several nested close-node-sets (CNSs) using local information. LOR can locally realize the optimal opportunistic routing for a large-scale wireless network with low control overhead cost. Since it does not use global topology information, LOR highlights an interesting tradeoff between the global optimality of the used forwarder lists and scalability inferred from the incurred overhead. Extensive simulation results show that LOR dramatically improves performances over extremely opportunistic routing (ExOR) and MAC-independent opportunistic routing protocol (MORE), which are two well-known designs from the literature, in terms of control overhead, end-to-end delay, and throughputs. It also exhibits promising performance in vehicular ad hoc networks (VANETs).

Original languageEnglish (US)
Article number6399622
Pages (from-to)2253-2263
Number of pages11
JournalIEEE Transactions on Vehicular Technology
Issue number5
StatePublished - 2013


  • Distributed routing
  • graph partitioning
  • local information
  • opportunistic routing


Dive into the research topics of 'Trading optimality for scalability in large-scale opportunistic routing'. Together they form a unique fingerprint.

Cite this