• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.30-38
• /
• 2000

In distributed HLR environment, the pointer forwarding with distributed HLR(Pointer Forwarding Scheme) has been proposed for eliminating the cost of updating multiple HLRs. In Pointer Forwarding Scheme, the find cost can be changed according to from which HLR a call originates. If a user changes PCS registration areas frequently, but receives calls relatively infrequently, and call for such a user originates from any other HLRs than the recently updated HLR, many VLRs should be traversed in order to find that user. In this paper, location tracking with jumping pointer in distributed HLR(Jumping Pointer Scheme) is proposed. The jumping pointer can be connected between the recently updated VLR and the VLR in which the mobile host currently resides. In case of call delivery, the mobile host can be found sooner by using the jumping pointer. In terms of 'find' cost, Jumping Pointer scheme improves about 17% over Forwarding Pointer scheme. Otherwise, Jumping Pointer scheme takes additional update charge in order to manage the jumping pointer. However the total costs of 'find' cost and 'update' cost for Jumping Pointer scheme are cheaper than them for Forwarding Pointer scheme when call-to-mobility ratio is smaller.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.561-572
• /
• 2003

Broadcast-based data delivery has attracted a lot of attention as an efficient way of disseminating data to very large client populations. The main motivation of broadcast-based information systems (BBISs) is that the number of clients that they serve can grow arbitrarily large without any effect on their performance. The performance of BBISs depends mainly on client caching strategies and on data broadcast scheduling mechanisms. This paper addresses the former issue and proposes a new client cache management scheme, named 2Q-CFP, that is suitable to BBISs. This paper also evaluates the performance of 2Q-CFP on the basis of a simulation model. The performance results indicate that 2Q-CFP scheme shows superior performances over GRAY, LRU and CF in the average response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.536-549
• /
• 2012

An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.874-890
• /
• 2021

With the widespread deployment of the fifth-generation (5G) communication networks, various real-time applications are rapidly increasing and generating massive traffic on backhaul network environments. In this scenario, network congestion will occur when the communication and computation resources exceed the maximum available capacity, which severely degrades the network performance. To alleviate this problem, this paper proposed an intelligent resource allocation (IRA) to integrate with the extant resource adjustment (ERA) approach mainly based on the convergence of support vector machine (SVM) algorithm, software-defined networking (SDN), and mobile edge computing (MEC) paradigms. The proposed scheme acquires predictable schedules to adapt the downlink (DL) transmission towards off-peak hour intervals as a predominant priority. Accordingly, the peak hour bandwidth resources for serving real-time uplink (UL) transmission enlarge its capacity for a variety of mission-critical applications. Furthermore, to advance and boost gateway computation resources, MEC servers are implemented and integrated with the proposed scheme in this study. In the conclusive simulation results, the performance evaluation analyzes and compares the proposed scheme with the conventional approach over a variety of QoS metrics including network delay, jitter, packet drop ratio, packet delivery ratio, and throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.478-488
• /
• 2005

To conserve the usage of energy, indexing techniques have been developed in a wireless mobile environment. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based location dependent data delivery scheme (BBS) for dynamic range queries. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. Then, we present a data prefetching and caching scheme, designed to reduce the query response time. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients, and the size of the service area.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.157-159
• /
• 2006

본 논문에서는 FTTH 환경에 의해 가입자까지 100Mbps 이상의 대역폭을 보장하면서 실제 서비스 되어 질 수 있는 응용 시스템인 개인 인터넷 방송 시스템을 호스트 멀티캐스트 Scheme을 이용하여 설계 및 구현하였다. 전송 방식인 호스트 멀티캐스트에 대해 알아보고 개인 인터넷 방송 서버(Contents Provider)와 클라이언트(Host)의 구조에 효율적인 호스트 멀티캐스트 알고리즘인 Data Delivery Tree Algorithm(DDTA)를 제안하고, DDTA 알고리즘이 FTTH 환경에서 HDTV급 고화질 영상을 전송할 수 있는 개인 인터넷 방송 시스템에 효율적인 알고리즘이라는 것을 보인다.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.137-150
• /
• 2011

Mobile ad hoc networks are expected to be widely used in the near future. However, they are susceptible to various security threats because of their inherent characteristics. Malicious flooding attacks are one of the fatal attacks on mobile ad hoc networks. These attacks can severely clog an entire network, as a result of clogging the victim node. If collaborative multiple attacks are conducted, it becomes more difficult to prevent. To defend against these attacks, we propose a novel defense mechanism in mobile ad hoc networks. The proposed scheme enhances the amount of legitimate packet processing at each node. The simulation results show that the proposed scheme also improves the end-to-end packet delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5035-5048
• /
• 2016

Nano scale networks are futuristic networks deemed as enablers for the Internet of Nano Things, Body area nano networks, target tracking, anomaly/ abnormality detection at molecular level and neuronal therapy / drug delivery applications. Molecular communication is considered the most compatible communication technology for nano devices. However, connectivity in such networks is very low due to inter-symbol interference (ISI). Few research papers have addressed the issue of ISI mitigation in molecular communication. However, many of these methods are not adaptive to dynamic environmental conditions. This paper presents an enhancement over original Memory-1 ISI cancellation scheme using maximum likelihood estimation of a channel parameter (λ) to make it adaptable to variable channel conditions. Results of the Monte Carlo simulation show that, the connectivity (P_conn) improves by 28% for given simulation parameters and environmental conditions by using enhanced Memory-1 cancellation method. Moreover, this ISI mitigation method allows reduction in symbol time (Ts) up to 50 seconds i.e. an improvement of 75% is achieved.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.97-104
• /
• 2006

For successfully deploying many multicast service in the mobile environment, security infrastructures must be developed that manage the keys needed to provide access control to content. In this paper, we propose two methods for designing the key management scheme for the mobile multicast environment. The proposed schemes match the key management tree to the mobile multicast environment for localizing the delivery of he rekeying messages, reducing the communication costs, and solving the handoff problem in wireless region.