Mulyono Mulyono
Universitas Islam Negeri Sultan Syarif Kasim Riau

Published : 4 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : journal of informatics and telecommunication engineering

IS-OWC Point-to-Multipoint System Utilizing UDWDM Technology and NGPON Architecture Mulyono Mulyono; Rika Susanti
JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Vol. 10 No. 1 (2026): Issues July 2026
Publisher : Universitas Medan Area

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31289/jite.v10i1.15384

Abstract

Inter-Satellite Optical Wireless Communication (IS-OWC) has emerged as a promising solution for long-distance satellite communications due to its high bandwidth capacity, low attenuation, and immunity to electromagnetic interference. However, most previous studies have focused on point-to-point communication systems with limited scalability and transmission capacity. This study aims to develop a point-to-multipoint IS-OWC system based on Ultra Dense Wavelength Division Multiplexing (UDWDM) and the Next-Generation Passive Optical Network (NGPON) architecture to improve transmission efficiency and the performance of multi-satellite communication networks. UDWDM is employed to enhance spectral efficiency through ultra-dense channel spacing, while the NGPON architecture enables efficient signal distribution to multiple satellite nodes. The proposed system is evaluated through simulations by varying the split ratio (1:2–1:64), transmission distance (200–40,000 km), input power (0–40 dBm), and bit rate (10 and 20 Gbps). System performance is assessed using the Bit Error Rate (BER) criterion based on the ITU-T G.698.1 recommendation, where acceptable performance is defined as BER ≤ 10⁻¹². The simulation results demonstrate reliable performance across all evaluated split ratios. At a 1:2 split ratio with an input power of 20 dBm, the proposed system achieves transmission distances of up to 16,000 km at 10 Gbps and 14,000 km at 20 Gbps while maintaining the required BER threshold. Increasing the split ratio reduces the maximum transmission distance, whereas higher input power extends the transmission range. These findings indicate that the proposed architecture is a scalable and effective solution for future high-capacity inter-satellite communication networks.
Antenna Azimuth and Radius Optimization in Heterogeneous Cellular Networks Based on Genetic Algorithms Mulyono Mulyono; Oktaf Brillian Kharisma; Hasdi Radiles
JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Vol. 10 No. 1 (2026): Issues July 2026
Publisher : Universitas Medan Area

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31289/jite.v10i1.18416

Abstract

As cellular networks evolve into microcells or smaller ones, the number of sites required to serve an area will also increase, making network optimization impossible to perform manually. This study provides an overview of the implementation of Genetic Algorithms in solving radius and azimuth configuration problems for cell coverage. The main contribution of this study is the use of Fixed Step and Variable Step azimuth selection methods in the Genetic Algorithm coding process. This study also raises the issue of interference detection mechanisms in two adjacent cells. The problem presentation method uses a model with a measurable level of complexity by deriving from a homogeneously distributed layout model. This study uses Matlab in building an algorithm simulator and MapInfo in displaying the results visually. The results show that the proposed Variable Step method provides better optimization performance than the Fixed Step method, which was only able to resolve 62.5% of interference spots. To account for the stochastic nature of the Genetic Algorithm, the simulation was executed 10 independent times using identical parameter settings. Statistical evaluation indicates that the algorithm achieved an average fitness value of 59.40 with a standard deviation of 3.84, while requiring an average computational time of 635.41 seconds with a standard deviation of 9.23 seconds. Furthermore, the algorithm reached convergence at an average generation of 957.10 with a standard deviation of 34.98 generations. These results demonstrate that the proposed algorithm exhibits good stability across multiple runs, although it was unable to reach the global optimum in all simulations.