[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Optimal throughput performance in full-duplex relay assisted cognitive networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In this paper, we study a full-duplex cooperative cognitive radio network with multiple full-duplex secondary users acting as potential relays for transmitting the packets of a primary user. In addition to having full-duplex capability, the receivers also have multi-packet reception capability allowing them to simultaneously decode packets incoming from different senders. Our objective is to maximize the sum throughput of the secondary users while stabilizing the primary and relay queues. Towards this objective, we characterize the optimal scheduling of primary and relay packets at the full-duplex secondary users. The resulting problem is non-convex, and thus, we transform it into a linear fractional problem by using the dominant system approach. This, in turn, facilitates an efficient numerical solution by the bisection method. We analyze the effects of different network parameters on the optimal solution numerically for a number of possible scenarios. Our numerical results demonstrate how the multi-packet reception and full-duplex capabilities, as well as the partial relaying and number of secondary users affect the primary and secondary users’ stable throughput revealing new insights into the performance of overlay cognitive networks. In particular, we demonstrate that full-duplex capability of secondary users together with multi-packet reception capability of the primary destination is the key in reaping the benefits of full-duplex cooperative cognitive communications.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Our model is still valid under imperfect sensing, if the false positive and negative probabilities are known. These probabilities will in turn appear in the primary and secondary throughputs only further complicating their expressions. We leave the investigation of the effect of imperfect sensing for future studies, and focus on our primary objective of understanding the effects of FD and MPR capabilities. Our results can be considered as an upper bound on primary and secondary throughputs for a system with imperfect sensing.

  2. If the secondary transmitters are not fully backlogged, this would reduce the secondary sum throughput. However, the exact analysis of a such a system is not tractable due to its sheer computational complexity.

  3. Even though this is a strong assumption, the primary user has the motivation to share its codebook with the relays to increase its gains. Our results in the paper can be considered as an upper bound on the primary performance when this assumption does not hold.

  4. The duration of ACK packets are usually short, so the probability of collision for these packets are assumed negligible.

  5. If P3 is infeasible for \(t_l=0\), then there is no feasible solution, and thus, \(Q_p\) and/or \(Q_{ps,i}\) are not stable.

  6. Recall that the MPR capability is low when the received signal powers at the primary destination are close to each other. Since we assume that transmitter powers are equal, the MPR capability is low when the distances \(r_{S_{p}D_{p}}\) and \(r_{S_{i}D_{p}}\) are close to each other which is the case when \(\alpha\) is low.

References

  1. Simeone, O., Bar-Ness, Y., & Spagnolini, U. (2007). Stable throughput of cognitive radios with and without relaying capability. IEEE Transactions on Communications, 55(12), 2351–2360.

    Article  Google Scholar 

  2. Kompella, S., Nguyen, G. D., Wieselthier, J. E., & Ephremides, A. (2011). Stable throughput tradeoffs in cognitive shared channels with cooperative relaying. In Proceedings of IEEE INFOCOM (pp. 1961–1969).

  3. Urgaonkar, R., & Neely, M. J. (2012). Opportunistic cooperation in cognitive femtocell networks. IEEE Journal on Selected Areas in Communications, 30(3), 607–616.

    Article  Google Scholar 

  4. Wang, L., & Fodor, V. (2013). Cooperate or not: The secondary user’s dilemma in hierarchical spectrum sharing networks. In IEEE international conference on communications (ICC) (pp. 2650–2655).

  5. Choi, J. I., Jain, M., Srinivasan, K., Levis, P., & Katti, S. (2010). Achieving single channel, full duplex wireless communication. In Proceedings of the sixteenth annual international conference on Mobile computing and networking (pp. 1–12). ACM.

  6. Jain, M., Choi, J. I., Kim, T., Bharadia, D., Seth, S., Srinivasan, K., Levis, P., Katti, S., & Sinha, P. (2011). Practical, real-time, full duplex wireless. In Proceedings of the 17th annual international conference on Mobile computing and networking (pp. 301–312). ACM.

  7. Kim, H., Lim, S., Wang, H., & Hong, D. (2012). Optimal power allocation and outage analysis for cognitive full duplex relay systems. IEEE Transactions on Wireless Communications, 11(10), 3754–3765.

    Article  Google Scholar 

  8. Zhong, B., Zhang, Z., Chai, X., Pan, Z., Long, K., & Cao, H. (2015). Performance analysis for opportunistic full-duplex relay selection in underlay cognitive networks. IEEE Transactions on Vehicular Technology, 64(10), 4905–4910.

    Article  Google Scholar 

  9. Nomikos, N., Charalambous, T., Krikidis, I., Skoutas, D. N., Vouyioukas, D., Johansson, M., et al. (2016). A survey on buffer-aided relay selection. IEEE Communications Surveys Tutorials, 18(2), 1073–1097.

    Article  Google Scholar 

  10. Su, Y., Jiang, L., & He, C. (2016). Joint relay selection and power allocation for full-duplex DF co-operative networks with outdated CSI. IEEE Communications Letters, 20(3), 510–513.

    Article  Google Scholar 

  11. Li, P., Guo, S., & Zhuang, W. (2014). Optimal transmission scheduling of cooperative communications with a full-duplex relay. IEEE Transactions on Parallel and Distributed Systems, 25(9), 2353–2363.

    Article  Google Scholar 

  12. Pappas, N., Kountouris, M., Ephremides, A., & Traganitis, A. (2015). Relay-assisted multiple access with full-duplex multi-packet reception. IEEE Transactions on Wireless Communications, 14(7), 3544–3558.

    Article  Google Scholar 

  13. Fanous, A., & Ephremides, A. (2012). Effect of secondary nodes on the primary’s stable throughput in a cognitive wireless network. In Proceedings of IEEE international symposium on information theory (ISIT) (pp. 1807–1811).

  14. Kompella, S., Nguyen, G. D., Kam, C., Wieselthier, J. E., & Ephremides, A. (2014). Cooperation in cognitive underlay networks: Stable throughput tradeoffs. IEEE/ACM Transactions on Networking, 22(6), 1756–1768.

    Article  Google Scholar 

  15. ElAzzouni, S., Ercetin, O., El-Keyi, A., ElBatt, T., & Nafie, M. (2015). Full-duplex cooperative cognitive radio networks. In Proceedings of the international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt) (pp. 475–482).

  16. Zheng, G., Krikidis, I., & Ottersten, B. (2013). Full-duplex cooperative cognitive radio with transmit imperfections. IEEE Transactions on Wireless Communications, 12(5), 2498–2511.

    Article  Google Scholar 

  17. Zhang, H., Xing, H., Cheng, J., Nallanathan, A., & Leung, V. C. M. (2016). Secure resource allocation for ofdma two-way relay wireless sensor networks without and with cooperative jamming. IEEE Transactions on Industrial Informatics, 12(5), 1714–1725.

    Article  Google Scholar 

  18. Du, J., Gelenbe, E., Jiang, C., Zhang, H., & Ren, Y. (2017). Contract design for traffic offloading and resource allocation in heterogeneous ultra-dense networks. IEEE Journal on Selected Areas in Communications, 35(11), 2457–2467.

    Article  Google Scholar 

  19. Cover, T. M., & Thomas, J. A. (2012). Elements of information theory. New York: Wiley.

    MATH  Google Scholar 

  20. Pappas, N., Ephremides, A., & Traganitis, A. (2014). Stability and performance issues of a relay assisted multiple access scheme with MPR capabilities. Computer Communications, 42, 70–76.

    Article  Google Scholar 

  21. Dominguez, D. R., & Aazhang, B. (2013). Optimal routing and power allocation for wireless networks with imperfect full-duplex nodes. In IEEE international conference on communications (ICC) (pp. 3370–3375).

  22. Sabharwal, A., Schniter, P., Guo, D., Bliss, D.W., Rangarajan, S., & Wichman, R. (2014). In-band full-duplex wireless: Challenges and opportunities. IEEE Journal on Selected Areas in Communications, 32(9), 1637–1652.

    Article  Google Scholar 

  23. Rao, R. R., & Ephremides, A. (1988). On the stability of interacting queues in a multiple-access system. IEEE Transactions on Information Theory, 34(5), 918–930.

    Article  MathSciNet  MATH  Google Scholar 

  24. Naware, V., Mergen, G., & Tong, L. (2005). Stability and delay of finite-user slotted aloha with multipacket reception. IEEE Transactions on Information Theory, 51(7), 2636–2656.

    Article  MathSciNet  MATH  Google Scholar 

  25. Bertsekas, D . P., Gallager, R . G., & Humblet, P. (1992). Data networks (Vol. 2). Englewood Cliffs: Prentice-Hall International.

    MATH  Google Scholar 

  26. Loynes, R. (1962). The stability of a queue with non-independent inter-arrival and service times. Proceedings of the Cambridge Philosophical Society, 58(3), 497–520.

    Article  MATH  Google Scholar 

  27. Szpankowski, W. (1994). Stability conditions for some distributed systems: Buffered random access systems. Advances in Applied Probability, 26, 498–515.

    Article  MathSciNet  MATH  Google Scholar 

  28. Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.

    Book  MATH  Google Scholar 

Download references

Acknowledgements

This paper was made possible by a NPRP Grant No. 4-1119-2-427 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely responsibility of the authors. The work of Ozgur Ercetin was supported by the Marie Curie International Research Staff Exchange Scheme Fellowship PIRSES-GA-2010-269132 AGILENet within the 7th European Community Framework Program.

Author information

Authors and Affiliations

  1. Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey

    M. Emre Ozfatura & Ozgur Ercetin

  2. Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA

    Sherif ElAzzouni

  3. Computer Science and Engineering Department, The American University in Cairo, AUC Avenue, New Cairo, Egypt

    Tamer ElBatt

  4. Electronics and Communications Engineering Department, Faculty of Engineering, Cairo University, Giza, Egypt

    Tamer ElBatt

Authors
  1. M. Emre Ozfatura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sherif ElAzzouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ozgur Ercetin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tamer ElBatt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sherif ElAzzouni.

Additional information

Sherif ElAzzouni: This work was done when Sherif ElAzzouni was with WINC, Nile University, Egypt.

Tamer ElBatt: This work was done when Tamer ElBatt was with WINC, Nile University, Egypt.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ozfatura, M.E., ElAzzouni, S., Ercetin, O. et al. Optimal throughput performance in full-duplex relay assisted cognitive networks. Wireless Netw 25, 1931–1947 (2019). https://doi.org/10.1007/s11276-018-1692-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-018-1692-5

Keywords

Search

Navigation