Skip to main content

Collision-Free MAC for Wireless Mesh Backbones

  • Chapter
  • First Online:
Distributed Medium Access Control in Wireless Networks

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 595 Accesses

Abstract

In this chapter, we study a wireless mesh backbone, which consists of a number of routers located at fixed sites and covers a large geographical area. Different from the existing MAC schemes, our MAC scheme design benefits greatly from the fixed network topology. With the router location information, collision-free transmissions are scheduled in a deterministic way, without the request to RTS/CTS handshaking prior to every packet transmission. Thus, the overhead is greatly reduced, as compared with contention-based MAC schemes. Meanwhile, the deterministic schedule in our MAC scheme is adaptive to the traffic dynamic and can achieve maximal spatial frequency reuse. By eliminating collisions, reducing overhead, and achieving maximal spatial frequency reuse, the proposed scheme achieves much higher resource utilization than contention-based MAC schemes. Unlike most of the existing MAC schemes which are limited to single-hop communications, the proposed MAC scheme takes the end-to-end QoS provisioning for multi-hop flows into consideration.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Notes

  1. 1.

    Two links are two-hop away when the receiver of each link is two-hop away from the source of the other link.

  2. 2.

    Here we consider a good propagation environment. When router A sends a jamming signal, it is possible that some of its two-hop neighbors may not hear the jamming signal if there are obstacles in between. In this case, we let each router send jamming signals to its one-hop neighbors (with lower power), and split one mini-slot into two parts. In the first part, router A sends a jamming signal to its one-hop neighbors. Upon hearing the jamming signal, all its one-hop neighbors relay the jamming signal in the second part. Therefore, all the two-hop neighbors of router A can hear the jamming signal.

  3. 3.

    Note that the flow here is not referred to as the end-to-end multi-hop flow, but the one-hop sub-flow from the relay router to the next hop.

  4. 4.

    According to [24, 29, 77], the current synchronization technology can achieve synchronization accuracy of less than 20 μs.

References

  1. IEEE 802.11 WG, IEEE 802.11g, IEEE Standard for Information technology-Telecommunications and information exchange between systems-Local and metropolitan area networks-Specific requirements – Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications: Amendment 4: Further Higher Data Rate Extension in the 2.4 GHz Band (2003)

    Google Scholar 

  2. IEEE Standard for Information technology-Telecommunications and information exchange between systems-Local and metropolitan area networks-Specific requirements-Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) specifications: Amendment 7: Medium Access Control(MAC) Quality of Service (QoS) Enhancements. IEEE 802.11 WG, IEEE 802.11e/D11 (2004)

    Google Scholar 

  3. Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Computer Networks 47(4), 445–487 (2005)

    Article  MATH  Google Scholar 

  4. Elson, J., Girod, L., Estrin, D.: Fine-grained network time synchronization using reference broadcasts. ACM SIGOPS Operating Systems Review 36, 147–163 (2002)

    Article  Google Scholar 

  5. Ganeriwal, S., Kumar, R., Srivastava, M.: Timing-sync protocol for sensor networks. In: Proc. the first international conference on Embedded networked sensor systems, pp. 138–149 (2003)

    Google Scholar 

  6. He, Q., Cai, L., Shen, X., Ho, P.H.: Improving tcp performance over wireless ad hoc networks with busy tone assisted scheme. EURASIP Journal on Wireless Communications and Networking 2006 (2006)

    Google Scholar 

  7. Jain, R., Durresi, A., Babic, G.: Throughput fairness index: an explanation. ATM Forum Document Number: ATM_Forum/99-0045 (1999)

    Google Scholar 

  8. Jiang, H., Zhuang, W., Shen, X., Abdrabou, A., Wang, P.: Differentiated services for wireless mesh backbone. IEEE Wireless Commun. Mag. 44(7), 113–119 (2006)

    Article  Google Scholar 

  9. Liang, B., Dong, M.: Balancing distance and lifetime in delay constrained ad hoc networks. In: Proc. ACM MOBIHOC, pp. 97–107 (2006)

    Google Scholar 

  10. Liang, B., Dong, M.: Packet Prioritization in Multihop Latency Aware Scheduling for Delay Constrained Communication. IEEE J. Select. Areas Commun. 25(4), 819–830 (2007)

    Article  Google Scholar 

  11. Robinson, J.W., Randhawa, T.S.: Saturation throughput analysis of IEEE 802.11e enhanced distributed coordination function. IEEE J. Select. Areas Commun. 22(5), 917–928 (2004)

    Google Scholar 

  12. Tian, Z., Luo, X., Giannakis, G.B.: Cross-layer sensor network synchronization. In: Proc. the 38th Asilomar Conference on Signals, Systems and Computers, vol. 1 (2004)

    Google Scholar 

  13. Wang, Y., Zhang, Y., Ostermann, J.: Video Processing and Communications. Prentice Hall PTR Upper Saddle River, NJ, USA (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 The Author(s)

About this chapter

Cite this chapter

Wang, P., Zhuang, W. (2013). Collision-Free MAC for Wireless Mesh Backbones. In: Distributed Medium Access Control in Wireless Networks. SpringerBriefs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6602-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6602-4_6

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6601-7

  • Online ISBN: 978-1-4614-6602-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics