Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI (Department of Mathematics, Shri Sakthikailassh Women's College) ;
  • T. NITHIYA (Department of Mathematics, Government Arts College for Women)
  • Received : 2023.01.06
  • Accepted : 2023.03.26
  • Published : 2023.07.30
Download PDF
⟨ Previous Next ⟩

Abstract

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

Keywords

References

  1. Novitzky and et.al., Nonlinear Dynamics in Queueing Theory: Determining the Size of Oscillations in Queues with Delay, SIAM Journal on Applied Dynamical Systems 18 (2019), 279-311.  https://doi.org/10.1137/18M1170637
  2. Nasir Ganikhodjaev and NurZatul Akmar Hamzah, On Poisson Nonlinear Transformations, e Scientific World Journal 1 (2014), 1-7.  https://doi.org/10.1155/2014/832861
  3. Itoh, Eri and MihaelaMitici, Queue-Based Modeling of the Aircraft Arrival Process at a Single Airport, Aerospace 10 (2019), 103-113.  https://doi.org/10.3390/aerospace6100103
  4. B.H. Fralix and I.J.B.F. Adan, An infinite-server queue influenced by a semi-Markovian environment, Queueing Syst. 61 (2009), 65-84.  https://doi.org/10.1007/s11134-008-9100-y
  5. C. Soussen, J. Idier, J. Duan and D. Brie, Homotopy Based Algorithms for ell Regularized Least-Squares, IEEE Transactions on Signal Processing 63 (2015), 211-222.  https://doi.org/10.1109/TSP.2015.2421476
  6. D. Freund, S. Henderson, and D. Shmoys, Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems, Prod. Oper. Manag. 27 (2008), 2339-2349. 
  7. R.M. Guerra, A. Luviano-Juarez and J.J. Rincon-Pasaye, On nonlinear observers: A differential algebraic approach, 2007 American Control Conference 7 (2007), 1682-1686. 
  8. U. Vargas, L. Renteria, A. Ramirez and M.A. Abdel-Rahman, Floquet domain for open-loop transient simulation of switched devices, IEEE Texas Power and Energy Conference (TPEC) 10 (2018), 1-6. 
  9. G. Segal, REFLECTIONS ON QUILLEN'S ALGEBRAIC K-THEORY, Journal of Mathematics 64(3) (2013), 645-664.  https://doi.org/10.1093/qmath/hat026
  10. E. Gad and M. Nakhla, Efficient model reduction of linear periodically time-varying systems via compressed transient system function, IEEE Transactions on Circuits and Systems I 52(6) (2005), 1188-1204.  https://doi.org/10.1109/TCSI.2005.846661
  11. Ravi. J. and et. al., An Optimal Solution for Transportation problem-DFSD, Journal of Computational Mathematica 3(1) (2019), 2456-8686.  https://doi.org/10.26524/cm46
  12. B.-H. Lee, H.-S. Lee, S. Moon, J.-W. Lee, Enhanced Random Access for Massive Machine Type Communications, IEEE Internet Things J. (2019). 
  13. J. Thota, A. Aijaz, On Performance Evaluation of Random-Access Enhancements for 5G uRLLC, In Proceedings of the 2019 IEEE Wireless Communications and Networking Conference (WCNC) 15(18) (2019), 1-7. 
  14. R. Bajracharya, R. Shrestha, R. Ali, A. Musaddiq, S.W. Kim, LWA in 5G: State-of-the-art architecture, opportunities, and research challenges, IEEE Commun. Mag. 56 (2018), 134-141.  https://doi.org/10.1109/MCOM.2018.1701177
  15. Y. Liu, Y. Deng, N. Jiang, M. Elkashlan, A. Nallanathan, Analysis of Random Access in NB-IoT Networks with Three Coverage Enhancement Groups: A Stochastic Geometry Approach, IEEE Trans. Wirel. Commun. 20 (2021), 549-564.  https://doi.org/10.1109/TWC.2020.3026331
  16. H.D. Althumali, M. Othman, N.K. Noordin, Z.M. Hanapi, Dynamic Backoff Collision Resolution for Massive M2M Random Access in Cellular IoT Networks, IEEE Access 8 (2020), 201345-201359.  https://doi.org/10.1109/ACCESS.2020.3036398
  17. Sophia Antipolis, 3GPP. Study on Scenarios and Requirements for Next-Generation Access Technologies, (Release 14), V14.2.0; Rep. TR 38.913; GPP, France, 14 (2017).