Skip to main content

Advertisement

Log in

Graph-Based Radio Resource Sharing Schemes for MTC in D2D-based 5G Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Apart from the the increasing demand of smartphones in human-to-human (H2H) communications, the introduction of machine-to-machine (M2M) devices poses significant challenges to wireless cellular networks. In order to offer the ability to connect billion of devices to propel the society into a new era of connectivity in our homes, officies and smart cities, we design novel radio resource sharing algorithms in a H2H/M2M coexistence case to accommodate M2M communications while not severely degrading existing H2H services. We propose group-based M2M communications that share the same spectrum with H2H communications through device-to-device (D2D) communication, as one of the technology components of 5G architecture. First, we formulate radio resource sharing problem as a sum-rate maximization, problem for which the optimal solution is non-deterministic polynomial-time hard (NP-hard). To overcome the computational complexity of the optimal solution, we model the resource sharing problem as a bipartite graph, then propose a novel interference-aware graph-based resource sharing scheme using a fixed M2M transmit power. To further enhance the protection of H2H services, we introduce an adaptive power control mechanism into the interference-aware graph-based resource sharing scheme. M2M transmit power is efficiently adjusted using one among the two following alternative controllers, namely, either the proportional integral derivative (PID) or the fuzzy logic. The latter is proposed within the aim to assure the desired quality-of-service (QoS) of H2H users and increase the efficiency of M2M spectrum usage. In both cases (fixed and adaptive), a centralized and a semi-distributed instantiations are given. Simulation results show that adaptive M2M radio resource sharing scheme using fuzzy logic is the one that achieves the best compromise. In fact, it guarantees H2H performance in terms of throughput and fairness while maximizing the efficiency of M2M spectrum usage. Simulation results also show that in spite of its quite good performance, semi-distributed M2M resource sharing instantiation achieves them with a decline of up to 10% in terms of H2H throughput compared to the centralized instantiation. This is achieved through a markedly lower communication overhead.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Chen M (2013) Towards smart city: M2M communications with software agent intelligence. Multimed Tools Appl 67(1):167–178

    Article  Google Scholar 

  2. Chen M, Wan J, Li F (2012) Machine-to-Machine communications. KSII Trans Internet Inf Syst (TIIS) 6(2):480–497

    Google Scholar 

  3. Bujari A, Gaggi O, Palazzi CE, Ronzani D (2018) Would current ad-hoc routing protocols be adequate for the internet of vehicles? a comparative study. IEEE Internet Things J 5(5):3683–3691

    Article  Google Scholar 

  4. Bujari A, Palazzi CE, Ronzani D (2018) A comparison of stateless position-based packet routing algorithms for fanets. IEEE Trans Mob Comput 17(11):2468–2482

    Article  Google Scholar 

  5. Taleb T, Kunz A (2012) Machine type communications in 3GPP networks: potential, challenges, and solutions. IEEE Commun Mag 50(3):178–184

    Article  Google Scholar 

  6. Hamdoun S, Rachedi A, Tembine H, Ghamri-Doudane Y (2016) Efficient transmission strategy selection algorithm for M2M communications: An evolutionary game approach. In: 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), IEEE, pp 286–293

  7. T (2010) 3GPP, Technical Specification Group Radio Access Network “Study on RAN improvements for Machine-type Communications (release 10)

  8. Abu-Ali N, Taha A-EM, Salah M, Hassanein H (2014) Uplink scheduling in lte and lte-advanced: tutorial, survey and evaluation framework. IEEE Commun Surv Tut 16(3):1239–1265

    Article  Google Scholar 

  9. Hamdoun S, Rachedi A, Ghamri-Doudane Y (2015) Radio resource sharing for MTC in LTE-a: An interference-aware bipartite graph approach. In: IEEE Global Communication Conference (IEEE Globecom)

  10. Asadi A, Wang Q, Mancuso V (2014) A survey on device-to-device communication in cellular networks. IEEE Commun Surv Tut 16(4):1801–1819

    Article  Google Scholar 

  11. Zhou B, Hu H, Huang S-Q, Chen H-H (2013) Intracluster device-to-device relay algorithm with optimal resource utilization. IEEE Trans Veh Technol 62(5):2315–2326

    Article  Google Scholar 

  12. Wei L, Hu R, He T, Qian Y (2013) Device-to-device (D2D) communications underlaying MU-MIMO cellular networks. In: Global Communications Conference (GLOBECOM), 2013 IEEE, IEEE, pp 4902–4907

  13. Xu S, Wang H, Chen T, Huang Q, Peng T (2010) Effective interference cancellation scheme for device-to-device communication underlaying cellular networks. In: Vehicular Technology Conference Fall (VTC 2010-Fall), 2010 IEEE 72nd, IEEE, pp 1–5

  14. Min H, Lee J, Park S, Hong D (2011) Capacity enhancement using an interference limited area for device-to-device uplink underlaying cellular networks. IEEE Trans Wirel Commun 10(12):3995–4000

    Article  Google Scholar 

  15. Rachedi A, Hasnaoui A (2015) Advanced quality of services with security integration in wireless sensor networks. Wirel Commun Mob Comput 15(6):1106–1116

    Article  Google Scholar 

  16. Ku M-L (2012) Cognitive radio and interference management: Technology and Strategy: Technology and Strategy. IGI Global

  17. Ksentini A, Hadjadj-Aoul Y, Taleb T (2012) Cellular-based machine-to-machine: overload control. Network, IEEE 26(6):54–60

    Article  Google Scholar 

  18. Cho J-w, Chong S (2005) Stabilized m ax-m in flow control using PID and PII 2 controllers. IEICE Trans Commun 88(8):3353–3364

    Article  Google Scholar 

  19. Koivo HN, Elmusrati M (2009) Systems engineering in wireless communications. Wiley

  20. Cox E (1992) Fuzzy fundamentals. Spectrum, IEEE 29(10):58–61

    Article  Google Scholar 

  21. Kwan R, Leung C (2010) A survey of scheduling and interference mitigation in LTE. J Elect Comput Eng 2010:1

    Article  Google Scholar 

  22. Yaacoub E, Dawy Z (2012) A survey on uplink resource allocation in OFDMA wireless networks. IEEE Commun Surv Tutor 14(2):322–337

    Article  Google Scholar 

  23. Lioumpas AS, Alexiou A (2011) Uplink scheduling for =Machine-to-=Machine communications in lte-based cellular systems. In: GLOBECOM Workshops (GC Wkshps), 2011 IEEE, IEEE, pp 353–357

  24. Shin SY, Triwicaksono D (2012) Radio resource control scheme for machine-to-machine communication in lte infrastructure. In: 2012 International Conference on ICT Convergence (ICTC), IEEE, pp 1–6

  25. Lien S-Y, Chen K-C (2011) Massive access management for QoS guarantees in 3GPP machine-to-machine communications. IEEE Commun Lett 15(3):311–313

    Article  Google Scholar 

  26. Lien S-Y, Chen K-C, Lin Y (2011) Toward ubiquitous massive accesses in 3GPP machine-to-machine communications. IEEE Commun Mag 49(4):66–74

    Article  Google Scholar 

  27. Bayat S, Li Y, Han Z, Dohler M, Vucetic B (2014) Distributed massive wireless access for cellular machine-to-machine communication. In: 2014 IEEE International Conference on Communications (ICC), IEEE, pp 2767–2772

  28. Doppler K, Rinne M, Wijting C, Ribeiro CB, Hugl K (2009) Device-to-device communication as an underlay to LTE-advanced networks. IEEE Commun Mag 47(12):42–49

    Article  Google Scholar 

  29. da Silva JMB, Fodor G, Maciel TF (2014) Performance analysis of network-assisted two-hop D2D communications. In: Globecom Workshops (GC Wkshps), 2014, IEEE, pp 1050–1056

  30. Belleschi M, Fodor G, Abrardo A (2011) Performance analysis of a distributed resource allocation scheme for D2D communications. In: GLOBECOM Workshops (GC Wkshps), 2011 IEEE, IEEE, pp 358–362

  31. Qianxi L, Qingyu M, Fodor G, Brahmi N (2013) Radio resource management for network assisted D2D in cellular uplink. In: 2013 IEEE/CIC International Conference on Communications in China-Workshops (CIC/ICCC), IEEE, pp 159–164

  32. Yu G, Xu L, Feng D, Yin R, Li GY, Jiang Y (2014) Joint mode selection and resource allocation for device-to-device communications. IEEE Trans Commun 62(11):3814–3824

    Article  Google Scholar 

  33. Zhang R, Cheng X, Yang L, Jiao B (2013) Interference-aware graph based resource sharing for device-to-device communications underlaying cellular networks. In: Wireless Communications and Networking Conference (WCNC), 2013 IEEE. IEEE, pp 140–145

  34. “Study on RAN improvements for machine-type communications (release 10),” in 3GPP, Evolved Universal Terrestrial Radio Acess (E-UTRA): Physical Channels and Modulation TR 36.211, 3rd Generation Partnership Project (3GPP), 2010

  35. Plaisted D (1978) Some polynomial and integer divisibility problems are NP-hard. SIAM J Comput 7(4):458–464

    Article  MathSciNet  Google Scholar 

  36. Gueguen C, Rachedi A, Guizani M (2013) Incentive scheduler algorithm for cooperation and coverage extension in wireless networks. IEEE Trans Veh Technol 62(2):797–808

    Article  Google Scholar 

  37. Kuhn HW (1955) The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2):83–97

    Article  MathSciNet  Google Scholar 

  38. Series M (2009) Guidelines for evaluation of radio interface technologies for IMT-advanced, Report ITU, 2135–1

  39. Shi H, Prasad RV, Onur E, Niemegeers IG (2014) Fairness in wireless networks: issues, measures and challenges. IEEE Commun Surv Tutor 16(1):5–24

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Safa Hamdoun.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix: Kuhn-munkres algorithm to solve maximum weighted matching problem

Appendix: Kuhn-munkres algorithm to solve maximum weighted matching problem

  • Step 0 For each cluster, start with an arbitrary feasible vertex labeling \(f^{l} ={f^{l}_{0}}\), determine the equality subgraph \(G_{f^{l}}\).

  • Step 1 Choose an arbitrary maximum matching Ml in \(G_{f^{l}}\). If Ml is perfect for Gl, then Ml is optimal. Stop. Otherwise, there is some unmatched UiUn,k. Set \(S= \left \{U_{i} \right \}\) and T =

  • Step 2 If \(J_{G_{f^{l}}}\)T, go to step 3. Otherwise, \(J_{G_{f^{l}}}=T\). Find

    $$ {\alpha_{f}^{l}}= \displaystyle \min_{U_{i} \in , U_{j} \in T^{c}} \left\{ f^{l}(U_{i})+f^{l}(U_{j}) - w(e_{i,j}^{l}) \right\} $$

    Where Tc denotes the complement of T in Ui, and construct a new labeling \({f^{l}}^{\prime }\) by

    $$ {f^{l}}^{\prime}=\left\{ \begin{array}{l} f^{l}(u_{i})-\alpha_{1}, u_{i} \in S \\ f^{l}(u_{i})+\alpha_{1}, u_{i} \in T \\ f^{l}(u_{i}), otherwise \end{array} \right. $$

    Note that α1 > 0 and \(J_{G_{f^{l}}}\) ≠ T. Replace fl by \({f^{l}}^{\prime }\) and \({G_{f^{l}}}\) by \({G_{f^{l}}^{\prime }}\)

  • Step 3 Choose a vertex \(U_{j} \in J_{G_{f^{l}}}(S) \setminus T\). If Uj is matched in M, say with UkUi, replace S by SUk and T by TUj, and go to step 2. Otherwise, there will be an M-alternating path from Ui to Uj, and we may use this path and a larger matching \({M^{l}}^{\prime }\)\( {G_{l}}^{\prime }\). Replace Ml by \({M^{l}}^{\prime }\) and go to step 1.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hamdoun, S., Rachedi, A. & Ghamri-Doudane, Y. Graph-Based Radio Resource Sharing Schemes for MTC in D2D-based 5G Networks. Mobile Netw Appl 25, 1095–1113 (2020). https://doi.org/10.1007/s11036-020-01527-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-020-01527-1

Keywords

Navigation