Skip to main content

Extensions of the LAT Protocol

  • Chapter
  • First Online:
  • 395 Accesses

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSELECTRIC))

Abstract

The basic LAT protocol considers only one PU and one pair of SUs, which is quite limited. In this chapter, we consider the scenarios with multiple FD users that adopt the LAT protocol as their basic PHY sensing protocol. Firstly, we study the cooperative spectrum sensing under the LAT protocol, in which the interference among cooperative users makes the cooperation different from conventional cooperative schemes [1]. We provide a feasible cooperation scheme that is suitable for FD SUs in Sect. 3.1. Then, we consider both distributed [2] and centralized network [3] scenarios that require design of MAC layer protocols for harmonious multiple access and resource allocation. In distributed scenarios, multiple FD SUs contend for the same spectrum resources without any central controller. Thus, an effective multiple access scheme that can not only mitigate collision among SUs, but also fully explore the benefits of FD is needed. In centralized network, a FD cognitive AP, which can be regarded as a central controller over all SUs beneath, needs to sense the spectrum opportunities and allocate the temporal, frequency and power resources to the SUs properly, so that SUs can enjoy high data rate and the sensing performance of the AP can be guaranteed.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    Note that the FC can also use other fusion rules like the AND-rule or majority-rule. However, the main conclusions remain the same regardless of the specific choice of fusion rules. In this book, we adopt OR-rule as an representative.

  2. 2.

    Note that the contention scheme does not need to be the scheme above. Other schemes such as that with changeable contention windows can also be adopted. The expressions of performance may be different but the major conclusions remain the same.

References

  1. Y. Liao, T. Wang, L. Song, and B. Jiao, “Cooperative Spectrum Sensing for Full-duplex Cognitive Radio Networks,” in Proc. IEEE Global Communication Conferences (ICCS), Macau, China, Nov. 2014.

    Google Scholar 

  2. Y. Liao, T. Wang, K. Bian, L. Song, and Z. Han, “Decentralized Dynamic Spectrum Access in Full-Duplex Cognitive Radio Networks,” in Proc. IEEE International Conference on Communications (ICC), London, UK, Jun. 2015.

    Google Scholar 

  3. T. Wang, Y. Liao, B. Zhang, and L. Song, “Joint Spectrum Access and Power Allocation in Full-Duplex Cognitive Cellular Networks,” in Proc. IEEE International Conference on Communications (ICC), London, UK, Jun. 2015.

    Google Scholar 

  4. S. Huang, X. Liu, and Z. Ding, “Opportunistic Spectrum Access in Cognitive Radio Networks,” in IEEE InfoCom 2008, Phoenix, AZ, Apr. 2008.

    Google Scholar 

  5. H. Kim and K. G. Shin, “Efficient Discovery of Spectrum Opportunities with Mac-Layer Sensing in Cognitive Radio Networks,” IEEE Transactions on Mobile Computing, vol. 7, no. 5, pp. 533–545, May 2008.

    Article  MathSciNet  Google Scholar 

  6. A. Motamedi and A. Bahai, “Mac Protocol Design for Spectrum-Agile Wireless Networks: Stochastic Control Approach,” in Proc. IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Dublin, Ireland, Apr. 2007.

    Google Scholar 

  7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: W. H. Freeman and Company, 1979.

    MATH  Google Scholar 

  8. H. W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. E. Hopcroft, R. M. Karp, “An n 5∕2 Algorithm for Maximum Matchings in Bipartite Graphs,” SIAM Journal on Computing, vol. 1, no. 4, pp. 225–231, 1973.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author(s)

About this chapter

Cite this chapter

Liao, Y., Song, L., Han, Z. (2016). Extensions of the LAT Protocol. In: Listen and Talk. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-33979-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33979-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33977-1

  • Online ISBN: 978-3-319-33979-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics