• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3309-3328
• /
• 2017

The application of Internet of Things (IoT) in the next generation cellular networks imposes a new characteristic on the data traffic, where a massive number of small packets need to be transmitted. In addition, some emerging IoT-based emergency services require a real-time data delivery within a few milliseconds, referring to as ultra-low latency transmission. However, current techniques cannot provide such a low latency in combination with a mice-flow traffic. In this paper, we propose a dynamic resource reservation schema based on an air-interface slicing scheme in the context of a massive number of sensors with emergency flows. The proposed schema can achieve an air-interface latency of a few milliseconds by means of allowing emergency flows to be transported through a dedicated radio connection with guaranteed network resources. In order to schedule the delay-sensitive flows immediately, dynamic resource updating, silence-probability based collision avoidance, and window-based re-transmission are introduced to combine with the frame-slotted Aloha protocol. To evaluate performance of the proposed schema, a probabilistic model is provided to derive the analytical results, which are compared with the numerical results from Monte-Carlo simulations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.1
• /
• pp.89-96
• /
• 2015

The various services applied internet have been provided by the rapid development of wireless networks and providing multimedia contents are also increasing. It is caused a number of problems such as increasing of network traffic rapidly. P2P technique is gaining popularity for solving these problems. In particular, P2P technique in a wireless network environment has gained much popularity. Among them, MANET-based P2P techniques has been studied actively. It is not easy to be applied the existing technique as it is due to the dynamic topology and low bandwidth by moving nodes in MANET that is consisted of only mobile nodes. In this paper, we proposed sharing group construction technique for providing a stable connection between mobile nodes and reducing the load of network traffic and overhead of sharing group reconfiguration in order to improve data transmission performance between mobile nodes. The sharing group member nodes applied virtual sharing group generation technique with neighboring nodes of 1-hop distance in order to reduce traffic for file sharing. We performed comparative experiments with DHT technique to evaluate the performance of the proposed technique in this paper and the excellent performance is confirmed through experiments.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.4
• /
• pp.316-321
• /
• 2008

Advanced computer network technology enables computers to be connected in an open network environment. Despite the growing numbers of security threats to networks, most intrusion detection identifies security attacks mainly by detecting misuse using a set of rules based on past hacking patterns. This pattern matching has a high rate of false positives and can not detect new hacking patterns, which makes it vulnerable to previously unidentified attack patterns and variations in attack and increases false negatives. Intrusion detection and analysis technologies are thus required. This paper investigates the asymmetric costs of false errors to enhance the performances the detection systems. The proposed method utilizes the network model to consider the cost ratio of false errors. By comparing false positive errors with false negative errors, this scheme achieved better performance on the view point of both security and system performance objectives. The results of our empirical experiment show that the network model provides high accuracy in detection. In addition, the simulation results show that effectiveness of anomaly traffic detection is enhanced by considering the costs of false errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1234-1244
• /
• 2009

Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services and applications on Internet, which makes the need of application-level traffic classification important for the efficient management and control of network resources. Although lots of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in terms of accuracy and completeness. In this paper we propose an application traffic classification method using statistic signatures, defined as a directional sequence of packet size in a flow, which is unique for each application. The statistic signatures of each application are collected by our automatic grouping and extracting mechanism which is mainly described in this paper. By matching to the statistic signatures we can easily and quickly identify the application name of traffic flows with high accuracy, which is also shown by comprehensive excrement with our campus traffic data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1B
• /
• pp.39-45
• /
• 2006

In this paper, existing technology that uses broadcasting and multicasting IP addrsses at the wireless access network, based on Internet as a core network, is upgraded. By employing broadcasting service request by receivers, convergence of multicasting and broadcasting, and lower level filtering of broadcast data, the load and traffic of network, server, base station, and receiver is substantially reduced. The technology proposed in this paper could be useful for general broadcasting services, and especially optimum for LBS and Telematics services.

• Speech Sciences
• /
• v.11 no.4
• /
• pp.67-73
• /
• 2004

Packet loss, jitter, and delay in the Internet are caused mainly by the shortage of network bandwidth. It is due to queuing and routing process in the intermediate nodes of the packet network. In the Internet whose bandwidth is changing very rapidly in time depending on the number of users and data traffic, controlling the peak transmission bit-rate of a VoIP. system depending on the channel condition could be very helpful for making use of the available network bandwidth. Adapting packet size to the channel condition can reduce packet loss to improve the speech quality. It has been shown in [1] that a VoIP system with an AMR speech codec provides better speech quality than VoIP systems with fixed rate speech codecs. With the adaptive codec mode assignment. algorithm proposed in [1], in this paper, we performed the voice transmission experiments using the wireless LAN through the real Internet environment. Experimental results are analyzed and discussed with our findings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3435-3454
• /
• 2016

Device-to-device (D2D) communication is a potential solution to the incessant increase in data traffic on cellular networks. The greatest problem is how to control the interference between D2D users and cellular mobile users, and between D2D users themselves. This paper proposes a solution for this issue by putting the full control privilege in cellular network using the software-defined networking (SDN) concept. A software virtual switch called Open vSwitch and several components are integrated into mobile devices for data forwarding and radio resource mapping, whereas the control functions are executed in the cellular network via a SDN controller. This allows the network to assign radio resources for D2D communication directly, thus reducing interference. This solution also brings out many benefits, including resource efficiency, energy saving, topology flexibility, etc. The advantages and disadvantages of this architecture are analyzed by both a mathematical method and a simple implementation. The result shows that implementation of this solution in the next generation of cellular networks is feasible.

• Journal of Advanced Navigation Technology
• /
• v.16 no.1
• /
• pp.96-102
• /
• 2012

The goal of mobile internet system is to provide a high-data-rate, low-latency and optimized packet radio access technology supporting flexible bandwidth deployments. Therefore, network architecture is designed with the goal to support packet-switched traffic with seamless mobility, quality of service and minimal latency. An important requirement for the mobile internet system is improved cell-edge BER performance and data throughput. This is to provide some level of service consistency in terms of geographical coverage as well as in terms of available data throughput within the communication coverage area. In a cellular system, however, the signal to interference plus noise power ratio gap between cell-center and cell-edge users can be of the order of 20 [dB]. The disparity can be even higher in a communication coverage limited cellular system. This leads to vastly lower data throughputs for the cell-edge users relative to cell-center users creating a large QoS gap. This paper proposes a analytical approach that tries to reduce inter-cell interference, and shows the SIR and BER performance according to the OFDM system parameters in mobile Internet environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3892-3912
• /
• 2021

The recent rapid growth of mobile network traffic places multi-access edge computing in an important position to reduce network load and improve network capacity and service quality. Contrasting with traditional mobile cloud computing, multi-access edge computing includes a base station cooperative cache layer and user cooperative cache layer. Selecting the most appropriate cache content according to actual needs and determining the most appropriate location to optimize the cache performance have emerged as serious issues in multi-access edge computing that must be solved urgently. For this reason, a cache placement algorithm based on comprehensive utility in big data multi-access edge computing (CPBCU) is proposed in this work. Firstly, the cache value generated by cache placement is calculated using the cache capacity, data popularity, and node replacement rate. Secondly, the cache placement problem is then modeled according to the cache value, data object acquisition, and replacement cost. The cache placement model is then transformed into a combinatorial optimization problem and the cache objects are placed on the appropriate data nodes using tabu search algorithm. Finally, to verify the feasibility and effectiveness of the algorithm, a multi-access edge computing experimental environment is built. Experimental results show that CPBCU provides a significant improvement in cache service rate, data response time, and replacement number compared with other cache placement algorithms.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.33-39
• /
• 2010

In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.