[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2107502.2107505acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

O3: optimized overlay-based opportunistic routing

Published: 17 May 2011 Publication History

Abstract

Opportunistic routing achieves significant performance gain under lossy wireless links. In this paper, we develop a novel approach that exploits inter-flow network coding in opportunistic routing. A unique feature of our design is that it systematically optimizes end-to-end performance (e.g., total throughput). A key challenge to achieve this goal is a strong tension between opportunistic routing and inter-flow network coding: to achieve high reliability, opportunistic routing uses intra-flow coding to spread information across multiple nodes; this reduces the information reaching an individual node, which in turn reduces inter-flow coding opportunity. To address this challenge, we decouple opportunistic routing and inter-flow network coding by proposing a novel framework where an overlay network performs overlay routing and inter-flow coding without worrying about packet losses, while an underlay network uses optimized opportunistic routing and rate limiting to provide efficient and reliable overlay links for the overlay network to take advantage of. Based on this framework, we develop the first optimization algorithm to jointly optimize opportunistic routes, rate limits, inter-flow and intra-flow coding. We then develop a practical opportunistic routing protocol (O3) based on the optimization results. Using Qualnet simulation, we study the individual and aggregate benefits of opportunistic routing, inter-flow coding, and rate limits. Our results show that (i) rate limiting significantly improves the performance of all routing protocols, (ii) opportunistic routing is beneficial under high loss rates, whereas inter-flow coding is more effective under low loss rates, and (iii) O3 significantly out-performs state-of-the-art routing protocols by simultaneously leveraging optimized opportunistic routing, inter-flow coding, and rate limits.

References

[1]
S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. In Proc. of ACM SIGCOMM, Aug. 2005.
[2]
S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proc. of SIGCOMM, 2007.
[3]
P. Chaporkar and A. Proutiere. Adaptive network coding and scheduling for maximizing throughput in wireless networks. In Proc. of ACM MobiCom, 2007.
[4]
D. D. Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proc. of ACM MobiCom, Sept. 2003.
[5]
S. Das, Y. Wu, R. Chandra, and C. Hu. Context based routing: Technique, applications and experience. In Proc. of NSDI, Apr. 2008.
[6]
H. Feng, Y. Shu, S. Wang, and M. Ma. SVM-based models for predicting WLAN traffic. In Proc. of IEEE ICC, 2006.
[7]
R. Haemmerle. LP solve -- incremental version. http://pauillac.inria.fr/~haemmerl/lp_solve_inc/.
[8]
S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. XORs in the air: Practical wireless network coding. In Proc. of ACM SIGCOMM, Sept. 2006.
[9]
F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 1998.
[10]
T. Kim, S. Vural, and I. Broustis. A framework for joint network coding and transmission rate control in wireless networks. In Proc. of IEEE INFOCOM, 2010.
[11]
D. Koutsonikolas, Y. C. Hu, and C. Wang. XCOR: Synergistic interflow network coding and opportunistic routing. In MobiCom SRC, 2008.
[12]
D. Koutsonikolas, C.-C. Wang, and Y. C. Hu. CCACK: efficient network coding based opportunistic routing through cumulative coded acknowledgments. In Proc. of IEEE INFOCOM, 2010.
[13]
J. Le, J. Lui, and D. Chiu. DCAR: distributed coding-aware routing in wireless networks. IEEE Transactions on Mobile Computing, 2010.
[14]
Y. Li, L. Qiu, Y. Zhang, R. Mahajan, and E. Rozner. Predictable performance optimization for wireless networks. In Proc. of ACM SIGCOMM, Aug. 2008.
[15]
Y. Li, L. Qiu, Y. Zhang, R. Mahajan, Z. Zhong, G. Deshpande, and E. Rozner. Effects of interference on throughput of wireless mesh networks: Pathologies and a preliminary solution. In Proc. of HotNets-VI, Nov. 2007.
[16]
Y. Lin, B. Li, and B. Liang. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding. In Proc. of ICNP, Oct. 2008.
[17]
M.-H. Lu, P. Steenkiste, and T. Chen. Design, implementation, and evaluation of an efficient opportunistic retransmission protocol. In Proc. of ACM MobiCom, 2009.
[18]
D. Lun, M. Medard, and R. Koetter. Network coding for efficient wireless unicast. 2006 International Zurich Seminar on Communications, 2006.
[19]
A. K. Miu, H. Balakrishnan, and C. E. Koksal. Improving loss resilience with multi-radio diversity in wireless networks. In Proc. of ACM MobiCom, 2005.
[20]
A. K. Miu, G. Tan, H. Balakrishnan, and J. Apostolopoulos. Divert: Fine-grained path selection for wireless LANs. In Proc. of ACM MobiSys, 2004.
[21]
J. Moy. OSPF version 2. In Internet Engineering Task Force, RFC 2328, Apr. 1998. http://tools.ietf.org/html/rfc2328.
[22]
C. Qin, Y. Xian, C. Gray, N. Santhapuri, and S. Nelakuditi. I2MIX: Integration of intra-flow and inter-flow wireless network coding. In Proc. of WiNC, 2008.
[23]
B. Radunovic, C. Gkantsidis, P. Key, and P. Rodriguez. An optimization framework for opportunistic multipath routing in wireless mesh networks. In Proc. of IEEE INFOCOM, Apr. 2008.
[24]
B. Randunovi and J. Y. L. Boudec. Rate performance objectives of multihop wireless networks. In Proc. of IEEE INFOCOM, Apr. 2004.
[25]
C. Reis, R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Measurement-based models of delivery and interference. In Proc. of ACM SIGCOMM, 2006.
[26]
MIT Roofnet. http://www.pdos.lcs.mit.edu/roofnet/.
[27]
B. Scheuermann, W. Hu, and J. Crowcroft. Near-optimal coordinated coding in wireless multihop networks. In Proc. of CoNEXT, 2007.
[28]
S. Sengupta, S. Rayanchu, and S. Banerjee. An analysis of wireless network coding for unicast sessions: The case for coding-aware routing. In Proc. of IEEE INFOCOM, Apr. 2007.
[29]
F. Soldo, A. Markopoulou, and A. Toledo. A simple optimization model for wireless opportunistic routing with intra-session network coding. In Proc. of IEEE NetCod, Jun. 2010.
[30]
J. J. T. Ho and H. Viswanathan. On network coding and routing in dynamic wireless multicast networks. In Proc. of Workshop on Information Theory and its Applications, 2006.
[31]
Y. Yan, B. Zhang, H. T. Mouftah, and J. Ma. Practical coding-aware mechanism for opportunistic routing in wireless mesh networks. In Proc. of ICC, 2008.
[32]
Y. Yuan, H. Yuan, S. H. Wong, S. Lu, and W. Arbaugh. ROMER: resilient opportunistic mesh routing for wireless mesh networks. In Proc. of IEEE WiMESH, Sept. 2005.
[33]
S. Yun and H. Kim. Rate diverse network coding: Breaking the broadcast bottleneck. In Proc. of ACM MobiHoc, 2010.
[34]
J. Zhang, Y. P. Chen, and I. Marsic. Network coding via opportunistic forwarding in wireless mesh networks. In Proc. of IEEE WCNC, 2008.
[35]
X. Zhang and B. Li. Optimized multipath network coding in lossy wireless networks. In Proc. of ICDCS, 2008.
[36]
Z. Zhong and S. Nelakuditi. On the efficacy of opportunistic routing. In Proc. of IEEE SECON, Jun. 2007.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
MobiHoc '11: Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
May 2011
269 pages
ISBN:9781450307222
DOI:10.1145/2107502
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 May 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. network coding
  2. opportunistic routing
  3. wireless mesh networks

Qualifiers

  • Research-article

Funding Sources

Conference

MobiHoc '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)VORTEX: Network-Driven Opportunistic Routing for Ad Hoc NetworksSensors10.3390/s2306289323:6(2893)Online publication date: 7-Mar-2023
  • (2023)Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility ModelsSN Computer Science10.1007/s42979-023-02054-y4:5Online publication date: 28-Aug-2023
  • (2022)Realizing Opportunistic Routing in Multi-Channel EnvironmentsIEEE Access10.1109/ACCESS.2022.320046710(90655-90668)Online publication date: 2022
  • (2022)Proliferation of Opportunistic Routing: A Systematic ReviewIEEE Access10.1109/ACCESS.2021.313692710(5855-5883)Online publication date: 2022
  • (2021)TSOR: Thompson Sampling-Based Opportunistic RoutingIEEE Transactions on Wireless Communications10.1109/TWC.2021.308208020:11(7272-7285)Online publication date: Nov-2021
  • (2021)Coexistent Routing and Flooding Using WiFi Packets in Heterogeneous IoT NetworkIEEE/ACM Transactions on Networking10.1109/TNET.2021.310194929:6(2807-2819)Online publication date: Dec-2021
  • (2021)Coding-Aware Opportunistic Routing for Sparse Underwater Wireless Sensor NetworksIEEE Access10.1109/ACCESS.2021.30690779(50170-50187)Online publication date: 2021
  • (2021)Opportunistic routing in mobile ad hoc delay-tolerant networks (DTNs)Advances in Delay-Tolerant Networks (DTNs)10.1016/B978-0-08-102793-6.00009-6(179-194)Online publication date: 2021
  • (2021)Energy efficient data correlation aware opportunistic routing protocol for wireless sensor networksPeer-to-Peer Networking and Applications10.1007/s12083-021-01124-3Online publication date: 16-Apr-2021
  • (2019)Moving From Topology-Dependent to Opportunistic Routing Protocols in Dynamic Wireless Ad Hoc NetworksAlgorithms, Methods, and Applications in Mobile Computing and Communications10.4018/978-1-5225-5693-0.ch001(1-23)Online publication date: 2019
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media