• ETRI Journal
• /
• v.44 no.6
• /
• pp.903-914
• /
• 2022

Mobile and telecommunication networking uses temporary and random identifiers (IDs) to protect user privacy. For greater intelligence and security o the communications between the core network and the mobile user, we design and build a dynamic randomization scheme for the temporary IDs for mobile networking, including 5G and 6G. Our work for ID randomization (ID-RZ) advances the existing state-of-the-art ID re-allocation approach in 5G in the following ways. First, ID-RZ for ID updates is based on computing, as opposed to incurring networking for the re-allocation-based updates, and is designed for lightweight and low-latency mobile systems. Second, ID-RZ changes IDs proactively (as opposed to updating based on explicit networking event triggers) and provides stronger security (by increasing the randomness and frequency of ID updates). We build on the standard cryptographic primitives for security (e.g., hash) and implement our dynamic randomization scheme in the 5G networking protocol to validate its design purposes, which include time efficiency (two to four orders of magnitude quicker than the re-allocation approach) and appropriateness for mobile applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4054-4071
• /
• 2015

Named-Data Networking (NDN) is one of the promising approaches for the Future Internet to cope with the explosion and current usage pattern of Internet traffic. Content provider mobility in the NDN allows users to receive real-time traffic when the content providers are on the move. However, the current solutions for managing these mobile content providers suffer several issues such as long handover latency, high cost, and non-optimal routing path. In this paper, we survey main approaches for provider mobility in NDN and propose an optimal scheme to support the mobile content providers in the large-scale NDN domain. Our scheme predicts the movement of the provider and uses state information in the NDN forwarding plane to set up an optimal new routing path for mobile providers. By numerical analysis, our approach provides NDN users with better service access delay and lower total handover cost compared with the current solutions.

• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.16-24
• /
• 2024

With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.81-91
• /
• 2014

Widely spreading smart devices have become an important information sharing channel in everyday life. In particular, social networking services (SNS) are the hub for content creation and sharing. Users post their contents on SNS servers and receive contents of interest. Contents are delivered in either pull or push. Regarding delivery, cost and wait time are two important factors to be minimized, but they are in a trade-off relationship. The Push-N-scheme (PNS) and timeout-based push scheme (TPS) have been proposed for content delivery. PNS has an advantage in cost over TPS, whereas TPS has an edge in terms of the wait time over PNS. We propose a hybrid push scheme of PNS and TPS, called push-N-scheme with timeout (PNT), to balance the cost and the wait time. We evaluate PNT through simulations, with the results showing that PNT is effective in balancing PNS and TPS.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.29-43
• /
• 2019

In recent years, as the network traffic in the WSN(Wireless Sensor Network) has been increased by the growing number of IoT wireless devices, SDWSN(Software-Defined Wireless Sensor Network) and its security that aims a secure SDN(Software-Defined Networking) for efficiently managing network resources in WSN have received much attention. In this paper, we study on how to efficiently and securely design a PUF(Physical Unclonable Function)-assisted group key distribution scheme for the SDWSN environment. Recently, Huang et al. have designed a group key distribution scheme using the strengths of SDN and the physical security features of PUF. However, we observe that Huang et al.'s scheme has weak points that it does not only lack of authentication for the auxiliary controller but also it maintains the redundant synchronization information. In this paper, we securely design an authentication process of the auxiliary controller and improve the vulnerabilities of Huang et al.'s scheme by adding counter strings and random information but deleting the redundant synchronization information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2398-2415
• /
• 2017

Content-Centric Networking (CCN) is a new Internet architecture with routing and caching centered on contents. Through its receiver-driven and connectionless communication model, CCN natively supports the seamless mobility of nodes and scalable content acquisition. In-network caching is one of the core technologies in CCN, and the research of efficient caching scheme becomes increasingly attractive. To address the problem of unbalanced cache load distribution in some existing caching strategies, this paper presents a neighbor cooperation based in-network caching scheme. In this scheme, the node with the highest betweenness centrality in the content delivery path is selected as the central caching node and the area of its ego network is selected as the caching area. When the caching node has no sufficient resource, part of its cached contents will be picked out and transferred to the appropriate neighbor by comprehensively considering the factors, such as available node cache, cache replacement rate and link stability between nodes. Simulation results show that our scheme can effectively enhance the utilization of cache resources and improve cache hit rate and average access cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.215-221
• /
• 2016

Data failure in wireless communications considerably affects the reconstruction quality of transmitted data. Traditionally, fascinating trials have been conducted to overcome the data failure intensifying reliable reconstruction of a media. But, none of these efforts neither effective, computationally inexpensive nor simply configurable to reduce the problems of transmitting media or images. In practice, it is necessary to maintain the quality of transmitted image without sacrificing any data, content, or information. So, to deal with dynamic events such as sensor node participation and departure, during transmission, an efficient scheme is important. For this reason, a new robust scheme has been presented in this paper to minimize the limitation of traditional wireless networking. This scheme uses Software-Defined Image Sensor Network (SD-ISN) to ensure scalability and dependability of the sensor network of handling data losses. Finally, a comparison of our proposed SD-ISN with conventional wireless networking has been presented in simulation to test the robustness and effectiveness of our proposed SD-ISN approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.196-201
• /
• 2018

Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.37-41
• /
• 2018

As individuals generate and share various content anytime and anywhere, new networking architectures, such as content-centric networking (CCN) using the content name as a packet identifier, have been in the spotlight recently. However, the current CCN hardly takes into account node mobility problems, especially the mobility of content sources. The movement of content sources causes long delivery latency and long service disruptions. To solve that, the tunneling-based redirection scheme was proposed. However, the tunneling-based scheme requires a location-update procedure whenever the network changes, which creates many control messages and causes long latency. So, this paper presents hierarchical mobility management of mobile CCN to reduce the number of control messages and handoff latency. Performance evaluation shows that the proposed scheme can provide low control overhead, which results in network scalability.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.3
• /
• pp.317-324
• /
• 2009

Tactical Information Communication Network(TICN) uses both a wireless and wired network. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. However, Ad-hoc network is faced to many security threats due to its intrinsic characteristics. Therefore, to apply the Ad-hoc networking technology to battlefield environments and TICN, an intensive study on security countermeasure must go side by side with the development of enabling technology. In this paper, we suggest an efficient key management scheme for TICN of which the Ad-hoc networking technology is applied.