• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• Electronics and Telecommunications Trends
• /
• v.39 no.1
• /
• pp.25-35
• /
• 2024

Wireless communication, including mobile networks and local area networks, has become an essential service in the society. Wireless communication is evolving to include sensing services, as demonstrated by the increasing attention in organizations and standards such as 3GPP and IEEE 802.11. This survey presents technology trends in the integration of sensing and communication. The standardization status along with use cases provided by standards are explained. In addition, core and supporting technologies such as channel modeling, waveform design, and artificial intelligence are analyzed.

• International Journal of Advanced Culture Technology
• /
• v.3 no.2
• /
• pp.77-86
• /
• 2015

In this paper there is an overview of some standards and security models which are implemented in such an IP-based and heterogeneous networks and we also present some security models in an open environment and finally we obtain that as a result of the nature of 4G networks there are still more security holes and open issues for expert to notice. Our survey shows that a number of new security threats to cause unexpected service interruption and disclosure of information will be possible in 4G due mainly to the fact that 4G is an IP-based, heterogeneous network. Other than that, it tells about the security issues and vulnerabilities present in the above 4G standards are discussed. Finally, we point to potential areas for future vulnerabilities and evaluate areas in 4G security which warrant attention and future work by the research and advanced technology industry.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2150-2162
• /
• 2012

In accordance with evolution of next-generation mobile Internet, 2G, 3G, 4G, and B4G mobile communication wireless access networks will be co-existed and service providers will be merged as an integrated service provider. In addition, multiple virtual service operators will appear. In order to provide complicated unified-services, in the future Internet, wireless network virtualization where network resource is shared by various service operators is necessary. Therefore, in this paper, we investigate network architectures and virtualization scenarios for wireless access network virtualization where various wireless access technologies are flexibly operated by multiple service providers over next-generation wireless access networks. We expect that the virtualization scenario and network architecture yielded from this study can play a role as a basis for development of wireless access network virtualization algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.549-559
• /
• 2023

As mobile edge computing (MEC) is gaining attention as a core technology of 5G networks, edge AI technology of 5G network environment based on mobile user data is recently being used in various fields. However, as in traditional AI security, there is a possibility of adversarial interference of standard 5G network functions within the core network responsible for edge AI core functions. In addition, research on data poisoning attacks that can occur in the MEC environment of standalone mode defined in 5G standards by 3GPP is currently insufficient compared to existing LTE networks. In this study, we explore the threat model for the MEC environment using NWDAF, a network function that is responsible for the core function of edge AI in 5G, and propose a feature selection method to improve the performance of detecting data poisoning attacks for Leaf NWDAF as some proof of concept. Through the proposed methodology, we achieved a maximum detection rate of 94.9% for Slowloris attack-based data poisoning attacks in NWDAF.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.1035-1045
• /
• 2001

We present two decomposition approximations for the mean sojourn times in open single class queing networks. If there is a single bottleneck station, the approximations are asymptotically exact in both light and heavy traffic. When applied to a Jackson network or an M/G/1 queue, these approximations are exact for all values of the traffic intensity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.789-796
• /
• 2006

An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.

• Journal of information and communication convergence engineering
• /
• v.20 no.3
• /
• pp.143-152
• /
• 2022

The ongoing adoption of 5G will increase the data traffic, throughput, multimedia services, and power consumption for future wireless applications and services, including sensor and mobile networks. Multipath fading on wireless channels also reduces the system performance and increases energy consumption. To address these issues, device-to-device (D2D) and cooperative communications have been proposed. In this study, we propose two inter-clustering models using the relay selection method to improve system performance and increase energy efficiency in cooperative D2D networks. We develop two inter-clustering models and present their respective algorithms. Subsequently, we run a computer simulation to evaluate each model's outage probability (OP) performance, throughput, and energy efficiency. The simulation results show that inter-clustering model II has the lowest OP, highest throughput, and highest energy efficiency compared with inter-clustering model I and the conventional inter-clustering-based multirelay method. These results demonstrate that inter-clustering model II is well-suited for use in 5G overlay D2D and cellular communications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.108-109
• /
• 2007

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.189-198
• /
• 2008

In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.