• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.307-315
• /
• 2010

Although a substantial amount of studies have been carried out in order to improve the performance of IEEE 802.11, most of them focused on how to slowly decrease the Contention Window size, instead of resetting it to its initial value. Slow decreasing of the window size reduces the collision probability and increases the channel throughput. Therefore, it is difficult to achieve good results in a heterogeneous network which coexists with the original DCF. For instance, a Gentle DCF(GDCF) has good performance in a homogeneous environment, while it can hardly transmit frames in a heterogeneous environment including the original DCF. It is because the slow decreasing of the window size reduces the transmission probability. In this paper, we propose a Fast Recovery DCF(FRDCF) to solve this problem. In the FRDCF, the reset mechanism of the original DCF is maintained to keep the transmission probability high, while a new counter is used to enhance the performance of the wireless LAN. We prove that, compared with the GDCF, the FRDCF has better performance in a heterogeneous wireless LAN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1638-1654
• /
• 2018

The heterogeneous network (HetNet) has been one of the key technologies in Long Term Evolution-Advanced (LTE-A) with growing capacity and coverage demands. However, the introduction of femtocells has brought serious co-layer interference and cross-layer interference, which has been a major factor affecting system throughput. It is generally acknowledged that the resource allocation has significant impact on suppressing interference and improving the system performance. In this paper, we propose a hybrid-clustering algorithm based on the $Mat{\acute{e}}rn$ hard-core process (MHP) to restrain two kinds of co-channel interference in the HetNet. As the impracticality of the hexagonal grid model and the homogeneous Poisson point process model whose points distribute completely randomly to establish the system model. The HetNet model based on the MHP is adopted to satisfy the negative correlation distribution of base stations in this paper. Base on the system model, the spectrum sharing problem with restricted spectrum resources is further analyzed. On the basis of location information and the interference relation of base stations, a hybrid clustering method, which takes into accounts the fairness of two types of base stations is firstly proposed. Then, auction mechanism is discussed to achieve the spectrum sharing inside each cluster, avoiding the spectrum resource waste. Through combining the clustering theory and auction mechanism, the proposed novel algorithm can be applied to restrain the cross-layer interference and co-layer interference of HetNet, which has a high density of base stations. Simulation results show that spectral efficiency and system throughput increase to a certain degree.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.585-588
• /
• 2007

With several enhanced access technologies, users have many changes to select their preference access network. There are great differences between access technologies, users' need to handover from one access network to another is getting bigger. As users' need grows there are several works to archive fast handover between heterogeneous and homogeneous access networks. However traditional handover mechanisms work only on L2 or L3 have several limits that prevent fast and heterogeneous handover. To overcome those limits, IEEE 802.21 WG and IRTF MOBOPTS RG are working for developing handover mechanisms that uses L2 information on theupper layers like L3. This paper introduces two new L2 information and properties can be used to archive fast handover of mobile nodes.

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

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.223-228
• /
• 2008

Recently, various types of wireless access networks, such as WLAN, WiBro and HSDPA, etc, have been successfully deployed by commercial service providers (i.e., KT, KTF). In this situation, there are many efforts to provide high quality of services to guarantee seamless mobility between heterogeneous networks. The IP layer mobility protocols are efficient mechanisms to provide seamless mobility between IP based heterogeneous networks as well as homogeneous networks. However, to apply IP mobility protocols in real heterogeneous networks (i.e., WiBro and HSDPA), we must consider not only the basic features of techniques of wireless access networks (i.e., Data rate, Coverage, Quality of Service) but also the problem of real environment of service provider (i.e., Expanse cost to change the access network). Due to this reason, it is difficult to satisfy required conditions by using only one IP mobility protocol in real heterogeneous networks. Therefore, in this paper, we propose an efficient mobility protocol to solve the complex problems that are occurred in real heterogeneous networks. The proposed protocol, so-called, "Hybrid Mobile IP" tries to provide a synergy effect by integrating Client Mobile IPv4 (CMIPv4) and Proxy Mobile IPv4 (PMIPv4), and using the two mobility protocols selectively according to the situation of real heterogeneous networks.

• Journal of Information Technology Applications and Management
• /
• v.27 no.1
• /
• pp.125-145
• /
• 2020

We explore technology ecosystem of smart surgical medical system by analyzing patent data applied for in Korea and Japan. First, a review of trends of patent application by country/technological domain show that there exist a minority of technology domains focused on R&D, which represent their trends have been increasingly active. Also, while a number of Japanese firms mainly consist of the patent market of Japan, in case of the Korean market, a few universities, SMEs, and foreign firms are found to be the main applicants. As a result of the network analysis with the links as the relations of co-patenting, the relationships, which are active of convergence and knowledge spillover among the heterogeneous technology domains within each market, as well as the technology domains, which are the most active in international cooperation among each homogeneous domain, could get derived and visualized in the ecosystem. In addition, the technology domains in each patent market with leading locations, roles, and influence in the network can also be identified through the centrality analysis. In this study, the analysis for technology competitiveness are carried out focusing on patent activity and patent impact. The results denote that across all domains, the Japanese market may possess higher patent activity and patent impact compared to the Korean market. In consequence, we derive the position map for comparison by country and technology domain from a perspective considering comprehensively the multi-dimensional attributes based on the results of both network analysis and technology competitiveness.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.364-374
• /
• 2016

With vast amounts of spectrum available in the millimeter wave (mmWave) band, small cells at mmWave frequencies densely deployed underlying the conventional homogeneous macrocell network have gained considerable interest from academia, industry, and standards bodies. Due to high propagation loss at higher frequencies, mmWave communications are inherently directional, and concurrent transmissions (spatial reuse) under low inter-link interference can be enabled to significantly improve network capacity. On the other hand, mmWave links are easily blocked by obstacles such as human body and furniture. In this paper, we develop a multi-hop relaying transmission (MHRT) scheme to steer blocked flows around obstacles by establishing multi-hop relay paths. In MHRT, a relay path selection algorithm is proposed to establish relay paths for blocked flows for better use of concurrent transmissions. After relay path selection, we use a multi-hop transmission scheduling algorithm to compute near-optimal schedules by fully exploiting the spatial reuse. Through extensive simulations under various traffic patterns and channel conditions, we demonstrate MHRT achieves superior performance in terms of network throughput and connection robustness compared with other existing protocols, especially under serious blockage conditions. The performance ofMHRT with different hop limitations is also simulated and analyzed for a better choice of the maximum hop number in practice.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.1-9
• /
• 2003

In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1788-1796
• /
• 1997

In this paper, we propose a new connection admission control(CAC) algorithm for traffic control in ATM network in which traffic estimation is performed based on user-specified parameters at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. And traffic estimation using cell flow measurement is carried out when the number of connectioned calls does not change during a measurement reflection period. Performance analysis of the proposed method is carried out using several aspects for homogeneous and heterogeneous bursty traffic. The results showed that the proposed CAC method revealed better performance, than conventional CAC method for burst model in both utilization and QoS point of view.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.641-648
• /
• 2003

In this paper, we propose a general analysis tool that derives guaranteed delay bounds for real-time sessions when those sessions pass through heterogeneous schedulers in general packet networks. This tool characterizes each different scheduler by a homogeneous service curve server. We show that service curve servers can characterize a strictly larger class of schedulers than LR servers. That is, we can characterize not only all LR servers but also RC-EDF and SC scheduler by service curve servers. Even with such advantage over LR servers, service curve servers provide accurate analysis results. We prove mathematically that if we analyze a network that can be analyzed by both LR servers and service curve servers,,both cases yield the same delay bound.