Skip to main content

DOS/SP: Distributed Opportunistic Channel Access with Smart Probing in Wireless Cooperative Networks

  • Conference paper
  • First Online:
IoT as a Service (IoTaaS 2019)

Included in the following conference series:

  • 812 Accesses

Abstract

This paper investigates optimal distributed opportunistic channel access in wireless cooperative networks with multiple relays deployed. While probing all potential relay channels could result in significant overhead and spectrum efficiency affected, distributed OCA strategies with smart relays probing is studied in this research. To achieve reliable communications of high efficiency, number of probed relays and way to use have to be carefully decided in a dynamic manner. Finding that the sequential channel probing and access are coupled, an optimal distributed OCA is much challenging, and main difficult lies in how to exploit multi-source diversity, multi-relay diversity and time diversity in full manner. To tackle this problem, an analytical framework is built based on theory of optimal sequential observation planned decision. This decision-theoretic approach integrates the design of MAC layer and physical layer, enabling smart probing and cooperative transmissions under multiple relays. Based on it, an optimal DOCA/SP strategy is proposed to maximize average system throughput, and the optimality is rigorously proved. The implementation is described, and through numerical and simulation results effectiveness is validated.

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

Institutional subscriptions

Notes

  1. 1.

    The symbol \(\vee \) represents the union of information.

  2. 2.

    When \(j=0\), the sequence \((a_1,a_2,...,a_j)\) does not exit, and is denoted as ().

  3. 3.

    The symbol \(\vee _{m=1}^n\) can be understood as the union of information.

  4. 4.

    Note that the supreme may not be attainable, while the maximum is defined as the attainable supreme.

  5. 5.

    It notes that, since \(h_s\ge 0\) always holds, the negative value is not valid. However, the analysis makes sense for checking the monotonic property and obtaining theoretic bounds for \(M_j\big (R_d\big )\).

  6. 6.

    The factor is norm of beam forming vector in the second hop.

References

  1. Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P., Vijayakumar, R.: Providing quality of service over a shared wireless link. IEEE Commun. Mag. 39(2), 150–154 (2001)

    Article  Google Scholar 

  2. Viswanath, P., Tse, D.N.C., Laroia, R.: Opportunistic beamforming using dumb antennas. IEEE Trans. Inf. Theory 48(6), 1277–1294 (2002)

    Article  MathSciNet  Google Scholar 

  3. Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad hoc networks with random access: an optimal stopping approach. IEEE Trans. Inf. Theory 55(1), 205–222 (2009)

    Article  MathSciNet  Google Scholar 

  4. Ge, W., Zhang, J., Wieselthier, J., Shen, X.: PHY-aware distributed scheduling for ad hoc communications with physical interference model. IEEE Trans. Wireless Commun. 8(5), 2682–2693 (2009)

    Article  Google Scholar 

  5. Tan, S., Zheng, D., Zhang, J., Zeidler, J.: Distributed opportunistic scheduling for ad-hoc communications under delay constraints. In: Proceedings of IEEE INFOCOM (2010)

    Google Scholar 

  6. Gong, X., Chandrashekhar, T.P.S., Zhang, J., Poor, H.V.: Opportunistic cooperative networking: to relay or not to relay. IEEE J. Sel. Areas Commun. 30(2), 307–314 (2012)

    Article  Google Scholar 

  7. Zhang, Z., Jiang, H.: Distributed opportunistic channel access in wireless relay networks. IEEE J. Sel. Areas Commun. 30(9), 1675–1683 (2012)

    Article  Google Scholar 

  8. Laneman, J.N., Tse, D.N.C., Wornell, G.W.: Cooperative diversity in wireless networks: efficient protocols and outage behaviour. IEEE Trans. Inf. Theory 50, 3062–3080 (2004)

    Article  Google Scholar 

  9. Bahareh, S., Kanodia, V., Kumar, P.R.: Opportunistic media access for multirate ad hoc networks. IEEE Trans. Inf. Theory 51(4), 1348–1358 (2005)

    Article  Google Scholar 

  10. Poulakis, M.I., Panagopoulos, A.D., Constantinou, P.: Channel-aware opportunistic transmission scheduling for energy-efficient wireless links. IEEE Trans. Veh. Technol. 62(14), 192–204 (2013)

    Article  Google Scholar 

  11. Tan, S.S., Zeidler, J., Rao, B.: Opportunistic channel-aware spectrum access for cognitive radio networks with interleaved transmission and sensing. IEEE Trans. Wireless Commun. 12(5), 2376–2388 (2013)

    Article  Google Scholar 

  12. Schmitz, N.: Optimally sequentially planned decision procedures. Springer, New York (1993). https://doi.org/10.1007/978-1-4612-2736-6

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhou Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Z., Yan, Y., Sang, W., Xu, Z. (2020). DOS/SP: Distributed Opportunistic Channel Access with Smart Probing in Wireless Cooperative Networks. In: Li, B., Zheng, J., Fang, Y., Yang, M., Yan, Z. (eds) IoT as a Service. IoTaaS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 316. Springer, Cham. https://doi.org/10.1007/978-3-030-44751-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44751-9_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44750-2

  • Online ISBN: 978-3-030-44751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics