• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.451-453
• /
• 2019

Recently, as the use of wireless communication devices has increased, the wireless network usage has increased, and a wired network and a wireless network have been mixed to form a network. Existing TCP algorithms are designed for wired networks. Therefore, in the modern network environment, packet loss can not be accurately distinguished and improper congestion control is performed, resulting in degradation of TCP performance. In this paper, we propose SLDA (Support Vector Machine based Loss Discrimination Algorithm) which can accurately classify the packet loss environment to improve TCP performance and evaluate its performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5819-5840
• /
• 2018

Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

• Journal of information and communication convergence engineering
• /
• v.16 no.4
• /
• pp.252-257
• /
• 2018

A wideband double radiator circular disc annular monopole antenna is proposed is this work. The radiators are etched on the surfaces of two Taconic TLY-5 substrates with a circular hole cut out of each of the radiators initially at the centers of the radiators with subsequent downward displacement of the holes. The antenna is designed with a two-step feeding transformer system for impedance matching between the input power source supplied by a $50-{\Omega}$ SMA connector and the monopole radiators. The transformer system improves the bandwidth performance at higher frequencies. The proposed antenna achieves a wideband having the capability of working between 0.645 and 18.775 GHz, corresponding to a -10 dB bandwidth of 186.7% with gain ranging from 0.95 to 8.26 dBi. In comparison to other metal disc planar monopole antennas, the proposed antenna has a small total size width due to the size of the ground plane, which has a diameter 100 mm. The frequency range of the antenna provides applications in global positioning systems, mobile communications, ultra-wideband short distance communications, and wireless computer networks.

• Convergence Security Journal
• /
• v.21 no.3
• /
• pp.3-11
• /
• 2021

Most of the internet security protocols rely on classical algorithms based on the mathematical complexity of the integer factorization problem, which becomes vulnerable to a quantum computer. Recent progresses of quantum computing technologies have highlighted the need for applying quantum key distribution (QKD) on existing network protocols. We report the development and integration of a plug & play QKD device with a commercial IPSec device by replacing the session keys used in IPSec protocol with the quantum ones. We expect that this work paves the way for enhancing security of the star-type networks by implementing QKD with the end-to-end IP communication.

• International journal of advanced smart convergence
• /
• v.10 no.3
• /
• pp.17-25
• /
• 2021

As a new paradigm in non-orthogonal multiple access (NOMA), correlated superposition coding (CSC) has gained an attention in the literature of NOMA, in contrast to standard independent superposition coding (ISC). In the conventional 3-user CSC scheme, it has been reported that the average allocated power can be reduced, owing to an introduced correlation between transmitted signals. Thus, this paper proposes a 3-user cross CSC scheme with purely-imaginary correlation coefficients. First, we derive the achievable data rates of the proposed 3-user cross CSC scheme, for each of the three users. Then, simulations demonstrate that for the proposed 3-user cross CSC scheme, the achievable data rates of the first and second users increase greatly and slightly, respectively, whereas the achievable data rate of the third user decreases little, compared to those of the conventional 3-user CSC scheme. In addition, we also show that the sum rate of the three users of the proposed 3-user cross CSC scheme is much larger than that of the three users of the conventional 3-user CSC scheme. As a result, the proposed 3-user cross CSC scheme could be a solution to the problem of the reduction of the average allocated total power in the conventional 3-user CSC scheme toward the fifth-generation (5G) NOMA mobile networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.619-622
• /
• 2009

P2P networks are undergoing rapid progress and inspiring numerous developments by gossip-based protocol. Gossip-based protocols for group communication have attractive scalability and reliability properties. We propose a self-organizing algorithm in the sense that the size of neighbor list achieved without any node knowing the group size. We also propose an efficient mechanism to reduce the redundancy of the system by backing up the nodes in the neighbor list. We present the design, theoretical analysis, and a detailed evaluation of the proposed algorithm and its refinements.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.214-217
• /
• 2013

Advancements in automobile industries and the communication technologies caused VANET (Vehicular Ad Hoc NETwork) to evolve to VANET-based clouds before its deployment. It is more likely that VANET clouds will replace the traditional VANET in the deployment phase. It is to be noted that an abrupt deployment is out of question because it would require mass of resources and money to do so; instead incremental deployment is more ideal. In this paper, we aim at the incremental deployment phase of VANET clouds and focus on the well-established public transport networks. Data aggregation is one of the essential aspects in traditional VANET and has been researched for quite long time. However the previously proposed schemes are still controversial. Keeping in mind the time and space prediction of public buses, we leverage these buses as potential aggregators and MG (Mobile Gateways) in VANET clouds. Buses gather cooperative whereabouts information from neighbors, aggregate that information, disseminate it to the neighbor MGs and also send it to the cloud for storage and for services exchange. In our proposed scheme, we believe that the dissemination will be effective and cover most of the urban area since at any instant of time; buses cover most part of the urban areas. Besides, the effective transmission range is higher due to tall buses.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.33-46
• /
• 2000

IPsec is a protocol suite to protect the data communication between computers on internet and many VPNs(Virtual Private Networks) use IPsec protocol. IKE protocol is used to exchange keys in IPsec. Formal analysis method is used increasingly in computer science to increase the reliability of a system. In this paper, the IKE protocol is analyzed formally. This paper shows that IKE with Authentication with Signature and Authentication with Pre-Shared Key is safe, but Authentication with Public Key Encryption and A Revised Method of Authentication with Public Key Encryption are safe only with the assumption that a participant has the correct public key of the correspondent. To make sure that a participant has the correct public key of the correspondent, the usage of certificate is recommended.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.21-39
• /
• 2021

The acceptance of smartphone applications in the learning field is one of the most significant challenges for higher education institutions in Saudi Arabia. These institutions serve large and varied sectors of society and have a tremendous impact on the knowledge gained by student segments at various ages. M-learning is of great importance because it provides access to learning through a wide range of mobile networks and allows students to learn at any time and in any place. There is a lack of quality requirements for M-learning applications in Saudi societies partly because of mandates for high levels of privacy and gender segregation in education (Garg, 2013; Sarrab et al., 2014). According to the Saudi Arabian education ministry policy, gender segregation in education reflects the country's religious and traditional values (Ministry of Education, 2013, No. 155). The opportunity of many applications would help the Saudi target audience more easily accept M-learning applications and expand their knowledge while maintaining government policy related to religious values and gender segregation in the educational environment. In addition, students can share information through the online framework without breaking religious restrictions. This study uses a quantitative perspective to focus on defining the technical aspects and learning requirements for distributing knowledge among students within the digital environment. Additionally, the framework of the unified theory of acceptance and use of technology (UTAUT) is used to modify new constructs, called application quality requirements, that consist of quality requirements for systems, information, and interfaces.