Skip to main content

Advertisement

Springer Nature Link
Log in

Improvement of borrowing channel assignment for patterned traffic load by online cellular probabilistic self-organizing map

  • Original Article
  • Published:
Neural Computing & Applications Aims and scope Submit manuscript

Abstract

This paper describes an improvement of borrowing channel assignment (BCA) for patterned traffic load by using the short-term traffic prediction ability of cellular probabilistic self-organizing map (CPSOM). The fast growing cellular mobile systems demand more efficient and faster channel allocation techniques today. In case of patterned traffic load, the traditional BCA methods are not efficient to further enhance the performance because heavy-traffic cells cannot borrow channels from their neighboring cells with light or medium traffic that may have unused nominal channels. The performance can be increased if the short-term traffic load can be predicted. The predicted results can then be used for channel re-assignment. Therefore, the unused nominal channels of the light-or-medium-traffic cells can be transferred to the heavy-traffic cells that need more nominal channels. In this paper, CPSOM is used online for traffic prediction. In this sense, the proposed CPSOM-based BCA method is able to enhance the performance for patterned traffic load compared with the traditional BCA methods. Simulation results corroborate that the proposed method enables the system to work with better performance for patterned traffic load than the traditional BCA methods.

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
$34.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 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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Personal Commun 3(3):10–30

    Article  Google Scholar 

  2. Lee WCY (1989) Mobile cellular telecommunications systems. McGraw-Hill, New York

    Google Scholar 

  3. Tamura H, Sengoku M, Shinoda S, Abe T (1991) Channel assignment problem in a cellular system and a new coloring problem of networks. IEICE Trans Commun Electr Inf Syst 74(10):2983–2989

    Google Scholar 

  4. Wang L, Li S, Tian F, Fu X (2004) A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing. IEEE Tans Syst Man Cybern Part B 34(5):2119–2125

    Article  Google Scholar 

  5. Kunz D (1991) Channel assignment for cellular radio using neural networks. IEEE Trans Vehicular Technol 40(1):188–193

    Article  MathSciNet  Google Scholar 

  6. Funabiki N, Takefuji Y (1992) A neural network parallel algorithm for channel assignment problems in cellular radio networks. IEEE Trans Vehicular Technol 41(4):430–437

    Article  Google Scholar 

  7. Smith K, Palaniswami M (1997) Static and dynamic channel assignment using neural networks. IEEE Trans Select Areas Commun 15(4):238–249

    Article  Google Scholar 

  8. Mathar R, Mattfeldt J (1993) Channel assignment in cellular radio networks. IEEE Trans Vehicular Technol 42(4):647–656

    Article  Google Scholar 

  9. Duque-Antón M, Kunz D, Rüber B (1993) Channel assignment for cellular radio using simulated annealing. IEEE Trans Vehicular Technol 42(1):14–21

    Article  Google Scholar 

  10. Capone A, Trubian M (1999) Channel assignment problem in cellular systems: a new model and a Tabu search algorithm. IEEE Trans Vehicular Technol 48(4):1252–1260

    Article  Google Scholar 

  11. Montemanni R, Moon JNJ, Smith DH (2003) An improved Tabu search algorithm for the fixed-spectrum frequency-assignment problem. IEEE Trans Vehicular Technol 52(3):891–901

    Article  Google Scholar 

  12. Ngo Y, Li VOK (1998) Fixed channel assignment in cellular radio networks using a modified genetic algorithm. IEEE Trans Vehicular Technol 47(1):163–172

    Article  Google Scholar 

  13. Montemanni R, Smith DH, Allen SM (2002) An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Trans Vehicular Technol 51(5):949–953

    Article  Google Scholar 

  14. Battiti R, Bertossi A, Cavallaro D (2001) A randomized saturation degree heuristics for channel assignment in cellular radio networks. IEEE Trans Vehicular Technol 50(2):364–374

    Article  Google Scholar 

  15. Fernando XN, Fapojuwo AO (2002) A Viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks. IEEE Trans Vehicular Technol 51(1):73–87

    Article  Google Scholar 

  16. Kim S, Kim SL (1994) A two-phase algorithm for frequency assignment in cellular mobile systems. IEEE Trans Vehicular Technol 43(3):542–548

    Article  Google Scholar 

  17. Funabiki N, Okutani N, Nishikawa S (2000) A three-stage heuristic combined neural-network algorithm for channel assignment in cellular mobile systems. IEEE Trans Vehicular Technol 49(2):397–403

    Article  Google Scholar 

  18. Lázaro O, Girma D (2000) A Hopfield neural-network-based dynamic channel allocation with handoff channel reservation control. IEEE Trans Vehicular Technol 49(5):1578–1587

    Article  Google Scholar 

  19. Chan PTH, Palaniswami M, Everitt D (1994) Neural network-based dynamic channel assignment for cellular mobile communication system. IEEE Trans Vehicular Technol 43(2):279–288

    Article  Google Scholar 

  20. DelRe E, Fantacci R, Ronga L (1996) A dynamic channel allocation technique based on Hopfield neural networks. IEEE Trans Vehicular Technol 45(1):26–32

    Article  Google Scholar 

  21. Engel JS, Peritsky MM (1973) Statistically-optimum dynamic sever assignment in system with interfering severs. IEEE Trans Vehicular Technol 22(4):203–209

    Article  Google Scholar 

  22. Kahwa TJ, Georganas ND (1978) A hybrid channel assignment scheme in large-scale cellular-structured mobile communication systems. IEEE Trans Commun 26(4):432–438

    Article  Google Scholar 

  23. Elnoubi SM, Singh R, Gupta SC (1982) A new frequency channel assignment algorithm in high capacity mobile communication systems. IEEE Trans Vehicular Technol 31(3):125–131

    Article  Google Scholar 

  24. Zhang M, Yum TKP (1989) Comparison of channel-assignment strategies in cellular mobile telephone system. IEEE Trans Vehicular Technol 38(4):211–215

    Article  Google Scholar 

  25. Chang KN, Kim JT, Yim CS, Kim S (1998) An efficient borrowing channel assignment scheme for cellular mobile systems. IEEE Trans Vehicular Technol 47(2):602–608

    Article  Google Scholar 

  26. Sandalidis HG, Stavroulakis PP, Rodriguez-Tellez J (1999) Borrowing channel assignment strategies based on heuristic techniques for cellular systems. IEEE Trans Neural Netw 10(1):176–181

    Article  Google Scholar 

  27. Chow TWS, Wu S (2004) An online cellular probabilistic self-organizing map for static and dynamic data sets. IEEE Trans Circuit Syst Part I 51(4):732–747

    Article  Google Scholar 

  28. Kohonen T (1997) Self-organizing maps. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  29. Weigend S, Gershenfeld NA (1994) Time series prediction: forecasting the future and understanding the past. Addison-Wesley, Reading

    Google Scholar 

  30. Haykin S (1999) Neural networks: a comprehensive foundation. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  31. Bakker R, Schouten JC, Giles CL, et al (2000) Learning chaotic attractors by neural networks. Neural Comput 12(10):2355–2383

    Article  Google Scholar 

  32. Ho KL, Hsu YY, Yang CC (1992) Short term load forecasting using a multilayer neural network with an adaptive learning algorithm. IEEE Trans Power Syst 7(1):141–149

    Article  Google Scholar 

  33. Leung H, Lo T, Wang S (2001) Prediction of noisy chaotic time series using an optimal radial basis function neural network. IEEE Trans Neural Netw 12(5):1163–1172

    Article  Google Scholar 

  34. Chang FJ, Liang JM, Chen YC (2001) Flood forecasting using radial basis function neural networks. IEEE Trans Syst Man Cybern Part C 31(4):530–535

    Article  Google Scholar 

  35. Hansen JV, Nelson RD (1997) Neural networks and traditional time series methods: a synergistic combination in state economic forecasts. IEEE Trans Neural Netw 8(4):863–873

    Article  Google Scholar 

  36. Waibel A (1989) Modular construction of time-delay neural networks for speech recognition. Neural Comput 1(1):39–46

    Article  Google Scholar 

  37. Han M, Xi J, Xu S, Yin FL (2004) Prediction of chaotic time series based on the recurrent predictor neural network. IEEE Trans Neural Netw 52(12):3409–3416

    MathSciNet  Google Scholar 

  38. Conner JT, Martin D, Atlas LE (1994) Recurrent neural networks and robust time series prediction. IEEE Trans Neural Netw 5(2):240–253

    Article  Google Scholar 

  39. Mastorocostas PA, Theocharis JB (2002) A recurrent fuzzy-neural model for dynamic system identification. IEEE Trans Syst Man Cybern Part B 32 (2):176–190

    Article  Google Scholar 

  40. Cao LJ, Tay FEH (2003) Support vector machine with adaptive parameters in financial time series forecasting. IEEE Trans Neural Netw 14(6):1506–1518

    Article  Google Scholar 

  41. Chen BJ, Chang MW, Lin CJ (2004) Load forecasting using support vector machines: a study on EUNITE competition 2001. IEEE Trans Power Syst 19(4):1821–1830

    Article  Google Scholar 

  42. Chow TWS, Leung CT (1996) Neural Network based short-term load forecasting using weather compensation. IEEE Trans Power Syst 11(4):1736–1742

    Article  Google Scholar 

  43. Chow TWS, Leung CT (1996) A non-linear autoregressive integrated neural network model for short-term load forecasting. IEE Proc Generat Transm Distrib 143(5):500–506

    Article  Google Scholar 

  44. Chow TWS, Cho SY (1997) Development of a recurrent Sigma–Pi neural network rainfall forecasting system in Hong Kong. Neural Comput Appl 5(2):66–75

    Article  Google Scholar 

Download references

Acknowledgements

The work described in this paper was fully supported by a grant from the Research Council of the Hong Kong SAR Region of Competitive Earmarked Research Grant 9040803-570.

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, China

    Sitao Wu, Tommy W. S. Chow, Kai Tat Ng & Kim Fung Tsang

Authors
  1. Sitao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tommy W. S. Chow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai Tat Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kim Fung Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tommy W. S. Chow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, S., Chow, T.W.S., Ng, K.T. et al. Improvement of borrowing channel assignment for patterned traffic load by online cellular probabilistic self-organizing map. Neural Comput & Applic 15, 298–309 (2006). https://doi.org/10.1007/s00521-006-0032-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-006-0032-3

Keywords

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy