Skip to main content
SpringerLink
Log in

A discrete collaborative swarm optimizer for resource scheduling problem in mobile cellular networks

  • S.I. : New Trends of Neural Computing for Advanced Applications
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This study proposes a discrete collaborative swarm optimizer (DCCSO) for solving the resource scheduling problem in mobile cellular networks, which aims to employ minimum wireless bandwidth to meet various channel demands from each cell without violation of interference constraint. Many current algorithms can provide satisfactory solutions in dealing with simple problems, while some complex problems still need efficient scheduling schema, due to the limited resources. The proposed algorithm is inspired by the competitive swarm optimizer, whose superiority on continuous optimization problems has been proven by theory and verification. With the characteristics of the resource scheduling problem, the generalized order learning mechanism is designed, which updates the information of the loser particles by learning the sequential knowledge of the winners. Besides, plenty of invalid solutions will generate during the searching process in the original solution space degeneration of the exploration capability and coverage speed. To that end, an ensemble self-learning strategy is arisen by helping the neighborhood search by problem-specific information in the transformed solution space. The effectiveness of the proposed DCCSO is demonstrated on a set of real-world problems, and the experimental results show that the proposed algorithm exhibits better than or at least comparable performance to other state-of-the-art algorithms on most problems.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Teshome AK, Kibret B, Lai DTH (2019) A review of implant communication technology in WBAN: progress and challenges. IEEE Rev Biomed Eng 12:88

    Article  Google Scholar 

  2. Asadi A, Wang Q, Mancuso V (2013) A survey on device-to-device communication in cellular networks. CoRR

  3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., USA

    MATH  Google Scholar 

  4. Battiti R, Bertossi A, Cavallaro D (1999) A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans Veh Technol 50(2):364

    Article  Google Scholar 

  5. Ksairi N, Bianchi P, Ciblat P (2011) Nearly optimal resource allocation for downlink OFDMA in 2-D cellular networks. IEEE Trans Wirel Commun 10(7):2101

    Article  Google Scholar 

  6. Madan R, Boyd SP, Lall S (2010) Fast algorithms for resource allocation in wireless cellular networks. IEEE/ACM Trans Netw 18(3):973

    Article  Google Scholar 

  7. Chakraborty G (2001) An efficient heuristic algorithm for channel assignment problem in cellular radio networks. IEEE Trans Veh Technol 50(6):1528

    Article  Google Scholar 

  8. Zhao L, Wang H, Zhong X (2018) Interference graph based channel assignment algorithm for D2D cellular networks. IEEE Access 6:3270

    Article  Google Scholar 

  9. Li Z, Chen S, Guo C (2018) Location-aware hypergraph coloring based spectrum allocation for D2D communication. In: 2018 15th international symposium on wireless communication systems (ISWCS), pp 1–6

  10. Cankaya HC, Iridon M, Matula DW (1999) Performance analysis of a graph model for channel assignment in a cellular network. In: Proceedings. Twenty-third annual international computer software and applications conference (Cat. No.99CB37032), pp 239–240

  11. Sharma PC, Chaudhari NS (2011) A graph coloring approach for channel assignment in cellular network via propositional satisfiability. In: 2011 international conference on emerging trends in networks and computer communications (ETNCC), pp 23–26

  12. Sharma PC, Chaudhari NS (2012) Channel assignment problem in cellular network and its reduction to satisfiability using graph k-colorability. In: 2012 7th IEEE conference on industrial electronics and applications (ICIEA), pp 1734–1737

  13. Ghosh SC, Sinha BP, Das N (2006) Coalesced CAP: an improved technique for frequency assignment in cellular networks. IEEE Trans Veh Technol 55(2):640

    Article  Google Scholar 

  14. Coskun CC, Davaslioglu K, Ayanoglu E (2017) Three-stage resource allocation algorithm for energy-efficient heterogeneous networks. IEEE Trans Veh Technol PP(8):1

    Google Scholar 

  15. Yu J, Han S, Li X (2018) A robust game-based algorithm for downlink joint resource allocation in hierarchical OFDMA femtocell network system. IEEE Trans Syst Man Cybern Syst 1–11

  16. Chour H, Jorswieck EA, Bader F, Nasser Y, Bazzi O (2019) Global optimal resource allocation for efficient FD-D2D enabled cellular network. IEEE Access 7:59690

    Article  Google Scholar 

  17. Zhao C, Gan L (2011) Dynamic channel assignment for large-scale cellular networks using noisy chaotic neural network. IEEE Trans Neural Netw 22(2):222

    Article  Google Scholar 

  18. Ansari AQ, Saxena PC, Gupta KD (2012) In: 2012 fourth international conference on computational intelligence and communication networks, pp 815–818

  19. Liao X, Shi J, Li Z, Zhang L, Xia B (2020) A model-driven deep reinforcement learning heuristic algorithm for resource allocation in ultra-dense cellular networks. IEEE Trans Veh Technol 69(1):983

    Article  Google Scholar 

  20. Zhao N, Liang Y, Niyato D, Pei Y, Wu M, Jiang Y (2019) Deep reinforcement learning for user association and resource allocation in heterogeneous cellular networks. IEEE Trans Wirel Commun 18(11):5141

    Article  Google Scholar 

  21. Zomaya AY, Smith A, Seredynski F (2010) The use of the simulated annealing algorithm for channel allocation in mobile computing. Wirel Commun Mob Comput 3(2):239

    Article  Google Scholar 

  22. Girdinio P, Nervi M, Rossi M (2006) An improved simulated annealing algorithm for the channel allocation problem in cellular networks. In: 2006 12th Biennial IEEE conference on electromagnetic field computation, pp 126

  23. Peng Y, Wang L, Soong BH (2003) Optimal channel assignment in cellular systems using tabu search. In: 14th IEEE proceedings on personal, indoor and mobile radio communications. PIMRC 2003, vol 1, pp 31–35

  24. Gozupek D, Genc G, Ersoy C (2009) Channel assignment problem in cellular networks: a reactive tabu search approach. In: 2009 24th international symposium on computer and information sciences, pp 298–303

  25. Khanbary LMO, Vidyarthi DP (2008) A GA-based effective fault-tolerant model for channel allocation in mobile computing. IEEE Trans Veh Technol 57(3):1823–1833

    Article  Google Scholar 

  26. Marappan R, Sethumadhavan G (2016) Solving channel allocation problem using new genetic algorithm with clique partitioning method. In: 2016 IEEE international conference on computational intelligence and computing research (ICCIC), pp 1–4

  27. An J, Hines EL, Leeson MS, Sun L, Ren W, Iliescu DD (2007) Genetic algorithms and fuzzy logic for dynamic channel allocation in cellular radio networks. In: 2007 IEEE radio and wireless symposium, pp 19–22

  28. Shafi F, Sheikh JA, Mehboob-ul-Amin (2018) Efficient resource allocation in future networks using bio-inspired algorithm. In: 2018 international conference on smart systems and inventive technology (ICSSIT), pp 527–531

  29. Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695

  30. Amaya I, Ortiz-Bayliss JC, Rosales-Perez A, Gutierrez-Rodriguez AE, Conant-Pablos SE, Terashima-Marin H, Coello Coello CA (2018) Enhancing selection hyper-heuristics via feature transformations. IEEE Comput Intell Mag 13(2):30

    Article  Google Scholar 

  31. Sabar NR, Ayob M, Kendall G, Qu R (2013) Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans Evol Comput 17(6):840

    Article  Google Scholar 

  32. Pandiri V, Alok S (2018) A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem. Inf Sci 463–464:S0020025518304675

    MATH  Google Scholar 

  33. Kendall G, Mohamad M (2004) Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings. 2004 12th IEEE international conference on networks (ICON 2004) (IEEE Cat. No.04EX955), vol 2, pp 769–773

  34. Kendall G, Mohamad M (2004) Channel assignment optimisation using a hyper-heuristic. In: IEEE conference on cybernetics and intelligent systems, vol 2, pp 791–796

  35. Jiao L, Wu J, Dong B (2015) A two-phase knowledge based hyper-heuristic scheduling algorithm in cellular system. Knowl Based Syst 88(1):244–252

    Google Scholar 

  36. Dong B, Su Y, Zhou Y, Wu X (2020) Coordinative hyper-heuristic resource scheduling in mobile cellular networks

  37. Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191

    Article  Google Scholar 

  38. Gu S, Cheng R, Jin Y (2016) Feature selection for high-dimensional classification using a competitive swarm optimizer. Soft Comput 1–12

  39. Ling T, Zhan ZH, Wang YX, Wang ZJ, Zhang J (2018) A PSO-based hyper-heuristic for evolving dispatching rules in job shop scheduling. In: 2018 IEEE congress on evolutionary computation (CEC), pp 882–889

  40. Zhang L, Zhu Y, Zhong S, Lan R, Luo X (2020) Multi-level competitive swarm optimizer for large scale optimization

  41. Audhya GK, Sinha K, Mandal K, Dattagupta R, Ghosh SC (1814) Sinha BP (2013) A new approach to fast near-optimal channel assignment in cellular mobile networks. IEEE Trans Mob Comput 12(9)

Download references

Acknowledgements

This work was supported by the National Science Foundation of China (Grant Nos. 61703258, 61701291 and U1813205), the China Postdoctoral Science Foundation funded project (Grant Nos. 2017M613054, and 2017M613053), the Shaanxi Postdoctoral Science Foundation funded project (Grant No. 2017BSHYDZZ33) and the Fundamental Research Funds for the Central Universities of Shaanxi Normal University (Grant No. GK202103092).

Author information

Authors and Affiliations

  1. Key Laboratory of Modern Teaching Technology, Ministry of Education, Xi’an, 710062, China

    Bei Dong, Yuping Su, Shi Cheng & Xiaojun Wu

  2. School of Computer Science, Shaanxi Normal University, Xi’an, 710119, China

    Bei Dong, Yuping Su, Shi Cheng & Xiaojun Wu

  3. School of Education, Shaanxi Normal University, Xi’an, 710119, China

    Yun Zhou

Authors
  1. Bei Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuping Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yun Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shi Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xiaojun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bei Dong.

Ethics declarations

Conflict of interest

The authors declare that they do not have any conflict of interest.

Human or animal participation

All authors are informed and agree the submission. And this research does not involve any human or animal participation.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dong, B., Su, Y., Zhou, Y. et al. A discrete collaborative swarm optimizer for resource scheduling problem in mobile cellular networks. Neural Comput & Applic 35, 12319–12329 (2023). https://doi.org/10.1007/s00521-021-05803-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-05803-3

Keywords

Search

Navigation