Skip to main content

Exploiting Spectrum Spatial Reusability for Routing in Multi-hop Wireless Networks

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7405))

  • 1569 Accesses

Abstract

Routing metrics are essential to achieve a good end-to-end throughput on a min-cost path in multi-hop wireless networks. Originally, most routing algorithms were based on min-hop count metric. Then link-quality aware metrics, ETX and ETT, are proposed. After that, the emergence of opportunistic and any-path routing, leads to metrics such as EOTX and EAX. But almost all the previous routing metrics take the sum of all the link weights when choosing a min-cost path. They ignore that a pair of links on a path might be able to transmit at the same time without interference and hence it is inappropriate to include both of their weights in the whole path. In this work, we suggest exploiting such spatial reusability when designing routing metric to improve end-to-end throughput. We propose Spatial Reusability Aware Routing Metric (SAR) with the corresponding Spatial Reusability Aware Routing Algorithm. Our simulation results have shown good improvement in throughput.

This work was supported in part by China NSF grant 61170236 and 61133006. The opinions, findings, conclusions, and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies or the government.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Couto, D., Aguayo, D., Bicket, J., Morris, R.: A High-throughput Path Metric for Multi-Hop Wireless Routing. In: ACM MOBICOM (2003)

    Google Scholar 

  2. Draves, R., Padhye, J., Zill, B.: Routing in Multi-radio, Multi-hop Wireless Mesh Networks. In: ACM MOBICOM (2004)

    Google Scholar 

  3. Chachulski, S.: Trading Structure for Randomness in Wireless Opportunistic Routing. M.S. Thesis (2007)

    Google Scholar 

  4. Zhong, Z., Wang, J., Nelakuditi, S., Lu, G.-H.: On Selection of Candidates for Opportunistic Opportunistic Anypath Forwarding. In: ACM SIGMOBILE (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, T., Wu, F. (2012). Exploiting Spectrum Spatial Reusability for Routing in Multi-hop Wireless Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31869-6_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31868-9

  • Online ISBN: 978-3-642-31869-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics