• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.725-730
• /
• 2022

Named Data Networking (NDN) is a representative technology of ICN that realizes the future Internet architecture. NDN searches for data by its content and not by its host IP address. The consumer generates an interest packet and sends it to the NDN network. The NDN network uses three tables such as CS, FIB, and PIT and forwards the received interest packet to the next hop. The producer transmits the data packet to the consumer through a name-based forwarding scheme. In this paper, we design and implement an ndnSIM-based NDN network and perform performance evaluation. We analyze the ndnSIM structure and develop a 6-node congested NDN network and a 9-node grid NDN network using ndnSIM. In the simulation, the performance of latency and throughput of the interest packet rate are measured. We analyze the effect of congestion on the latency and throughput of the NDN network. This approach will help researchers in the future.

• Journal of Information Science Theory and Practice
• /
• v.2 no.2
• /
• pp.6-15
• /
• 2014

Initial based disambiguation of author names is a common data pre-processing step in bibliometrics. It is widely accepted that this procedure can introduce errors into network data and any subsequent analytical results. What is not sufficiently understood is the precise impact of this step on the data and findings. We present an empirical answer to this question by comparing the impact of two commonly used initial based disambiguation methods against a reasonable proxy for ground truth data. We use DBLP, a database covering major journals and conferences in computer science and information science, as a source. We find that initial based disambiguation induces strong distortions in network metrics on the graph and node level: Authors become embedded in ties for which there is no empirical support, thus increasing their sphere of influence and diversity of involvement. Consequently, networks generated with initial-based disambiguation are more coherent and interconnected than the actual underlying networks, and individual authors appear to be more productive and more strongly embedded than they actually are.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.26-32
• /
• 2007

Although the Java bytecode has numerous advantages, it also has certain shortcomings such as its slow execution speed and difficulty of analysis. In order to overcome such disadvantages, a bytecode analysis and optimization must be performed. The control flow of the bytecode should be analyzed; next, information is required regarding where the variables are defined and used to conduct a dataflow analysis and optimization. There may be cases where variables with an identical name contain different values at different locations during execution, according to the value assigned to a given variable in each location. Therefore, in order to statically determine the value and type, the variables must be separated according to allocation. In order to achieve this, variables can be expressed using a static single assignment form. After transformation into a static single assignment form, the type information of each node expressed by each variable and expression must be configured to perform a static analysis and optimization. Based on the basic type information, this paper proposes a method for finding the related equivalent nodes, setting nodes with strong connection components, and efficiently assigning each node type.

• Journal of Korean Medical classics
• /
• v.13 no.1
• /
• pp.74-101
• /
• 2000

Geungyul(根結) means roots and nodes of meridians. If human body gets damaged by energy which each seasons has, the meridians get some troubles. Healing for symptom, meridians consist of root, stay, follow, inpouring and node of acupuncture points should be in harmony. 1. This chapter explain roots and node parts of each meridian, acupuncture points name and root, stay, follow, inpouring of acupuncture points which in arm and leg of three Yin and Yang. 2. The opening, closing, axis function, the symptom, and the needling of both meridians of Yin and Yang are explained. 3. The method that predicts the rise-and-fall of visceral energy and the time of death by using an order of pulse and intermittent pulse is explained. 4. It is explained that since the physical condition of the rich and the poor are different, the method using a needling for each person to be healed, such as the deep-and-shallow and the quick-and-slow, are different. 5. It is explained that the excess and the deficiency in the energy of shape should be considered when a acupuncture is given.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.28-38
• /
• 2014

In this paper, we propose the distributed cache management scheme to efficiently access small files in Hadoop Distributed File Systems(HDFS). The proposed scheme can reduce the number of metadata managed by a name node since many small files are merged and stored in a chunk. It is also possible to reduce the file access costs, by keeping the information of requested files using the client cache and data node caches. The client cache keeps small files that a user requests and metadata. Each data node cache keeps the small files that are frequently requested by users. It is shown through performance evaluation that the proposed scheme significantly reduces the processing time over the existing scheme.

• Journal of the Korean Professional Engineers Association
• /
• v.29 no.3
• /
• pp.94-104
• /
• 1996

When Broadband Integrated Services Digital Network(BISDN) becomes commercially available In public network, conventional Local Area Network(LAN)s will still be in use. The first wide spread application for B-ISDN will be the interconnection of LANs. The equipment providing the connection between the LAN and the BISDN will be given the general name Inter Working Unit(IWU). We addresses the congestion problem of many interworking issues. In this paper, Our study is concentrated on applying connectionless network protocol for interworking. We suggest a rate control method in the network layer to prevent a buffer overflow in the IWU. Since this rate control method can be applied to prevent buffer overflow in a congested IWU, We investigate the use of rate control to solve congestion problems of IWU and parallize network layer with rate control to lessen the congestion problem in IWU.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.63-68
• /
• 2015

In this paper, we propose a new energy efficient scheme which can prolong the life of sensor networks, it should be able to reduce the number of sensing. We use the concept of safe zone for manage the appropriate range of properties. We measure the distance between the sensed temperature value and the center of the zone, and calculate the next sensing interval based on this distance. We name our proposed scheme "VIS". To assess the performance of the proposed scheme the actual temperature data was collected using the sensor node. The algorithm was implemented through the programming and was evaluated in a variety of settings. Experimental results show that the proposed algorithm is to significantly reduce the number of sensing in terms of energy efficiency while having the ability to know the state of the sensor nodes periodically. Our VIS algorithm can be useful in applications which will require the ability of control to the temperature within a proper range.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.26 no.6
• /
• pp.818-822
• /
• 2012

We in this paper propose a prognosis graph, analyzing prognoses of each pattern described in the Korean medicine literatures. This graph is represented as the integrated graphs about knowledge of patterns and their transitions in the prognoses, where a node becomes a pattern name and a edge becomes a transition between patterns, along with a condition with respect to cause or mechanism of the pattern. The knowledge of prognoses which a pattern is transit into another pattern can be identified at a glance by using this model. We also construct a upper-level prognosis graph, excluding five viscera and six entrails from the model. This upper-level prognosis graph contains the conceptual knowledge than clinical one so that it may be helpful to students and researchers in the Korean medicine fields.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5252-5268
• /
• 2018

To support a large-scale Hadoop cluster, Hadoop heartbeat messages are designed to deliver the significant messages, including task scheduling and completion messages, via piggybacking to reduce the number of messages received by the NameNode. Although Hadoop is designed and optimized for high-throughput computing via batch processing, the real-time processing of large amounts of data in Hadoop is increasingly important. This paper evaluates Hadoop's performance and costs when the heartbeat period is controlled to support latency sensitive applications. Through an empirical study based on Hadoop 2.0 (YARN) architecture, we improve Hadoop's I/O performance as well as application performance by up to 13 percent compared to the default configuration. We offer a guideline that predicts the performance, costs and limitations of the total system by controlling the heartbeat period using simple equations. We show that Hive performance can be improved by tuning Hadoop's heartbeat periods through extensive experiments.