• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.155-163
• /
• 2001

There are cases that revoke the certification because of disclosure of private key, deprivation of qualification and the expiration of a term of validity based on PKI. So, a user have to confirm the public key whether valid or invalid in the certification. There are many method such as CRL, Delta-CRL, OCSP for the cert-validation of certification. But these method many problems which are overload traffic on network and the CRL server because of processing for cert-validation of certification. In this paper we proposed the realtime cert-validation of certification method which solved problems that are data integrity by different time between transmission and receiving for CRL, and overload traffic on network and the CRL server based on DARC.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.4
• /
• pp.237-244
• /
• 2007

In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.499-511
• /
• 2000

We consider a stable tandem network which consists of two M/M/1 nodes and study the probability that the total backlog exceeds a large level N. Since the excessive backlog is a rare event, it is difficult to estimate this probability efficiently by using the crude Monte Carlo simulation. Instead we perform the ;$h$-transform proposed by McDonald(1999) to obtain the twisted network, in which the node with the larger load is overloaded. Then we use it to run the fast simulation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1073-1080
• /
• 2023

The development and speed improvement of the Internet network, and the development of many platforms based on it, have brought about a rapid expansion of production and consumption of various contents. However, the existing IP-based Internet system cannot efficiently cope with such an urgent increase in data. Accordingly, an alternative called the CCN(Contents Centric Network) has emerged, enabling more efficient data transmission and reception centered on content rather than host. In this paper, we will deal with the mobility of intermediate nodes in CCN real-time streaming service, which is one of the major research fields of CCN, and minimize network overload through more efficient path switching through RSSI detection. In other words, by improving the method of selecting and switching a spare path when an intermediate node located between the requester(consumer) and the provider moves, a mechanism for managing data transmission is not interrupted and unnecessary load due to route switching does not occur in the network.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.5
• /
• pp.885-896
• /
• 2013

MTC(Machine Type Communications), providing a variety of services anytime and anywhere by connecting the cellular network to the machine and things without human intervention, is being considered as a major challenge of the next-generation communications. Currently, When a massive MTC devices simultaneously connect to the network, each MTC device needs an independent access authentication process. Because of this process, authentication signaling congestion and overload problems will cause in LTE-Advanced. In this paper, we propose a group-based authentication protocol and a key management protocol. For managing the MTC devices as group units, the proposed protocol elects a group leader and authentications only once with the core network. After the authentication is completed, a group leader manages the rest members and MME(Mobility Management Entity) by constructing a binary tree. Finally, the propose protocol analysis show that the proposed protocol not only can reduces the authentication signaling which generated in between the MTC devices and the core network but also can manages the MTC devices, efficiently.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.76-78
• /
• 2002

Multicasting over mobile IP network becomes more important with the increasing needs of supporting multimedia services in mobile network. The IETF has suggested two approaches which are remote subscription and bidirectional tunneling for supporting mobility management in multicasting over mobile IP. But these protocols have problems - the frequent reconstruction of multicast delivery tree, packet less during handoff, convergence problem, and so on. In this paper, we propose to use preconfiguration of multicast delivery tree when mobile host enters the foreign network. It will decrease the frequency of multicast delivery tree reconstruction, and reduce the packet loss during handoff, Also the multicast delivery tree maintained by Keep Alive messages makes the signaling overload of networks diminished.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.37-43
• /
• 2003

Current Internet system of the entrance exam information to the university that is depending on searching key to solve the overloaded problem in the network and DB server or other tools to support HTML edit, haven't satisfied user's wants by supplying uniformed searching system. So this thesis will establish EEIS(Entrance Examination Information System) to prevent database overload phenomena when many users request a great amount of data at the same time and improve the decrease of speed and overload problem in DB server. EEIS playa role of bridge between outside client and DB server by placing VVS(Virtual View Server) between web server and DB server. By that method this system give users several usefulness in convenience and variety by supplying realtime data searching function to user. EEIS also give inner system manager more efficiency and speed in control the management system by solving those problem. This system is design and implementation to satisfy user's desire and give them more convenience and bring up the confidence of university that adopt this system at the end.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.545-551
• /
• 2001

Current Internet system of the entrance exam information to the university that is depending on searching key to solve the overloaded p개blem in the network and DB server or other tools to support HTML edit, haven't satisfied user's wants by supplying uniformed searching system. So this thesis will establish EEIS(Entrance Examination Information System) to prevent database overload phenomena when many users request a great amount of data at the same time and improve the decrease of speed and overload problem in DB server. EEIS play a role of bridge between outside client and DB server by placing VVS(Virtual View Server) between web server and DB server. By that method this system give users several usefulness in convenience and variety by supplying realtime data searching function to user EEIS also give inner system manager more efficiency and speed in control the management system by solving those problem. This system is design and implementation to satisfy user's desire and give them more convenience and bring up the confidence of university that adopt this system at the end.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.168-180
• /
• 2018

Due to the spread of mobile devices and the introduction of high-quality services, mobile traffic is expected to increase sharply and overload of cellular networks is expected. D2D communication is a way to reduce the load and evolve to 5th generation. Since D2D communication directly communicates between the terminals, it can reduce the overload of the cellular network and improve energy efficiency, data rate and network performance. This paper proposes a D2D handover scheme for D2D communication in cellular networks. The cellular network is a 3GPP EPS, and the proposed D2D handover method improves the existing EPS handover process considering compatibility between existing EPS and D2D communication. We also demonstrate the superiority of the proposed handover scheme using the network simulator ns-3. Simulation results show that the proposed handover scheme is superior to existing handover methods in terms of CUE variation, packet transmission delay time, and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1102-1112
• /
• 2012

We propose a cell selection and resource allocation scheme that assigns users to nearby accessible cells in heterogeneous wireless networks consisting of macrocell, femtocells, and Wi-Fi access points, under overload situation. Given the current power level of all accessible cells nearby users, the proposed scheme finds all possible cell assignment mappings of which user should connect to which cell to maximize the number of users that the network can accommodate at the same time. We formulate the cell selection problem with heterogeneous cells into an optimization problem of binary integer programming, and compute the optimal solution. We evaluate the proposed algorithm in terms of network access failure compared to a local ad-hoc based cell selection scheme used in practical systems using network level simulations. We demonstrate that our cell selection algorithm dramatically reduces network access failure in overload situation by fully leveraging network resources evenly across heterogeneous networks. We also validate the practical feasibility in terms of computational complexity of our binary integer program by measuring the computation time with respect to the number of users.