• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.285-298
• /
• 2009

According to the development of ubiquitous technologies, sensor networks is used in various area. In particular, medical field is one of the significant application areas using sensor networks, and recently it has come to be more important according to standardization of the body sensor networks technology. There are special characteristics of their own for medical sensor networks, which are different from the one of sensor networks for general application or environment. In this paper, we propose a hierarchical medical sensor networks structure considering own properties of medical applications, and also introduce transmission mechanism based on hierarchical structure. Our mechanism uses the priority and threshold value for medical sensor nodes considering patient's needs and health condition. Through this way Cluster head can transmit emergency data to the Base station rapidly. We also present the new key establishment mechanism based on key management mechanism which is proposed by L. Eschenauer and V. Gligor for our proposed structure and transmission mechanism. We use key provisioning for emergency nodes that have high priority based on patients' health condition. This mechanism guarantees the emergency nodes to establish the key and transmit the urgent message to the new cluster head more rapidly through preparing key establishment with key provisioning. We analyze the efficiency of our mechanism through comparing the amount of traffic and energy consumption with analysis and simulation with QualNet simulator. We also implemented our key management mechanism on TmoteSKY sensor board using TinyOS 2.0 and through this experiments we proved that the new mechanism could be actually utilized in network design.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.363-373
• /
• 2010

The existing QoS mechanisms for video streaming are short of the consideration for various user environments and the characteristic of streaming applying programs. In order to overwhelm this problem, studies on the video streaming protocols exploiting scalable video coding (SVC), which provide spatial, temporal, and qualitative scalability in video coding, are progressing actively. However, these protocols also have the problem to deepen network congestion situation, and to lower fairness between other traffics, as they are not equipped with congestion control mechanisms. SVC based streaming protocols also have the problem to overlook the property of videos encoded in SVC, as the protocols transmit the streaming simply by extracting the bitstream which has the maximum bit rate within available bandwidth of a network. To solve these problems, this study suggests TCP-friendly network adaptive SVC streaming(T-NASS) protocol which considers both network status and SVC bitstream property. T-NASS protocol extracts the optimal SVC bitstream by calculating TCP-friendly transmission rate, and by perceiving the network status on the basis of packet loss rate and explicit congestion notification(ECN). Through the performance estimation using an ns-2 network simulator, this study identified T-NASS protocol extracts the optimal bitstream as it uses TCP-friendly transmission property and perceives the network status, and also identified the video image quality transmitted through T-NASS protocol is improved.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.30-41
• /
• 2002

We focus on the mobile agents which are considered as new paradigm to solve information retrieval of large volumes of data in the distributed and heterogeneous environment. The mobile agent moves the computation to data instead of large volumes of data to computations. In this paper, we propose an information retrieval model, which can effectively search data in the distributed and heterogeneous environment, using mobile agents. Our model is applied to the design and implementation of an Q&A(Question and Answer) retrieval system. Our Q&A retrieval system, called QASSMA(Q&A Search System using Mobile Agents), uses mobile agents to retrieve articles from Q&A boards and newsgroups that exist in the heterogeneous and distributed environment. QASSMA has the following features and advantages. First, the mobile retrieval agent moves to the destination server to retrieve articles to reduce the retrieval time by eliminating data traffics from the server to the client host. Also it can reduce the traffic that was occurred in the centralized network system, and reduce the usage of resources by sending its agent and running in the destination host. Finally, the mobile retrieval agent of QASSMA can add and update dynamically the class file according to its retrieval environment, and support other retrieval manner. In this paper, we have shown that our Q&A retrieval system using mobile agents is more efficient than the retrieval system using static agents by our experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.97-106
• /
• 2008

Quality of Protection(QoP) provides a standard that can evaluate networks offering protection. Also, QoP estimates stability of the system by quantifying intensity of the security. Security should be established based on the circumstance which applied to appropriate level, and this should chose a security policy which fit to propose of network because it is not always proportioned that between stability of security mechanism which is used at network and performance which has to be supported by system. With evolving wireless networks, a variety of security services are defined for providing secure wireless network services. In this paper, we propose a new QoP model which makes up for weak points of existing QoP model to choose an appropriate security policy for wireless network. Proposed new QoP model use objectively organized HVM by Flow-based Abnormal Traffic Detection Algorithm for constructing Utility function and relative weight for constructing Total reward function.

• KNOM Review
• /
• v.23 no.2
• /
• pp.29-41
• /
• 2020

Networks are growing faster than ever before causing a multi-domain complexity. The diversity, variety and dynamic nature of network traffic and services require enhanced orchestration and management approaches. While many standard orchestrators and network operators are resulting in an increase of complexity for handling E2E slice orchestration. Besides, there are multiple domains involved in E2E slice orchestration including access, edge, transport and core network each having their specific challenges. Hence, handling of multi-domain, multi-platform and multi-operator based networking environments manually requires specified experts and using this approach it is impossible to handle the dynamic changes in the network at runtime. Also, the manual approaches towards handling such complexity is always error-prone and tedious. Hence, this work proposes an automated and abstracted solution for handling E2E slice orchestration using an intent-based approach. It abstracts the domains from the operators and enable them to provide their orchestration intention in the form of high-level intents. Besides, it actively monitors the orchestrated resources and based on current monitoring stats using the machine learning it predicts future utilization of resources for updating the system states. Resulting in a closed-loop automated E2E network orchestration and management system.

• Journal of Internet Computing and Services
• /
• v.24 no.1
• /
• pp.1-7
• /
• 2023

Recently, the technology of device-to-device(D2D) communication has been receiving big attention to improve the system performance since the amount of high quality/large capacity data traffic from smart phones and various devices of Internet of Things increase rapidly in 5G/6G based next generation cellular networks. However, even though the system performance of macro cells increase by reusing the frequency, the performance of macro user equipments(MUEs) decrease because of the strong interference from D2D user equipments(DUEs). Therefore, this paper proposes a dynamic channel management(DCM) scheme for DUEs to guarantee the performance of MUEs as the number of DUEs increases in next generation downlink cellular networks. In the proposed D2D DCM scheme, macro base stations dynamically assign subchannels to DUEs based on the interference information and signal to interference and noise ratio(SINR) of MUEs. Simulation results show that the proposed D2D DCM scheme outperforms other schemes in terms of the mean MUE capacity as the threshold of the SINR of MUEs incareases.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.1-7
• /
• 2023

This paper proposes a small cell resource partitioning allocation method to solve interference to machine type communication devices (MTCD) and improve performance in 5G heterogeneous networks (HetNet) where macro base station (MBS) and many small cell base stations (SBS) are overlaid. In the 5G HetNet, since various types of MTCDs generate data traffic, the load on the MBS increases. Therefore, in order to reduce the MBS load, a cell range expansion (CRE) method is applied in which a bias value is added to the received signal strength from the SBS and MTCDs satisfying the condition is connected to the SBS. More MTCDs connecting to the SBS through the CRE will reduce the load on the MBS, but performance of MTCDs will degrade due to interference, so a method to solve this problem is needed. The proposed small cell resource partitioning allocation method allocates resources with less interference from the MBS to mitigate interference of MTCDs newly added in the SBS with CRE, and improve the overall MTCD performace using separating resources according to the performance of existing MTCDs in the SBS. Through simulation results, the proposed small cell resource partitioning allocation method shows performance improvement of 21% and 126% in MTCDs capacity connected to MBS and SBS respectively, compared to the existing resource allocation methods.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.18 no.2
• /
• pp.67-79
• /
• 2023

The bounce rate is the rate at which a user leaves immediately after visiting, and this study aimed to find out what attributes of a website affect the bounce rate. Web site evaluation items were defined as a total of 4 items and 27 evaluation attributes, including usability, information, service interaction, and technology, so that they can be commonly applied to venture companies in various industries through prior research. As a result of the study, 6 website attributes that affect the bounce rate were verified to be significant by discriminant analysis and decision tree analysis. Suggestions to reduce the bounce rate of venture business websites through this study are as follows. First, the path name of the website is displayed as mandatory and a pull-down menu function is added to facilitate movement to other pages. Second, it is good to expose core content that can attract users' attention in the form of a banner, and place internal link banners in the right place on sub-pages. Third, external links should be linked to a new window so that they do not leave the current page immediately so that they can be re-entered. Lastly, it is recommended to expose the contact information of the person in charge and consultation function as direct information for communication with customers, but if individual response is difficult, at least the consultation function must be added. These suggestions are expected to be of practical help in various fields such as website development, operation, and marketing. However, in special cases, a high bounce rate may be normal, so it should be considered according to the situation.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.