• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1018-1021
• /
• 2009

Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

• Journal of Internet of Things and Convergence
• /
• v.9 no.6
• /
• pp.75-81
• /
• 2023

This study propose the traffic shaping scheme on IoT Network. The proposed scheme can be operated on the gateway which called sink node and control the IoT traffic with considering the traffic type(real-time based or non real-time based). It is proved that the proposed scheme shows a efficient and compatible result by the numerical analysis and the simulation on the proposed model. And the efficient of the proposed scheme by the numerical analysis has a approximate result of the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1142-1147
• /
• 2015

As a method to increase the scalability and efficiency of wireless sensor networks, a scheme to construct networks hierarchically has received considerable attention among researchers. Researches on the methods to construct wireless networks hierarchically have been conducted focusing on how to select nodes such that they constitute a backbone network of wireless network. Nodes comprising the backbone network should be connected themselves and can cover other remaining nodes. A problem to find the minimum number of nodes which satisfy these conditions is known as the minimum connected dominating set (MCDS) problem. The MCDS problem is NP-hard, therefore there is no efficient algorithm which guarantee the optimal solutions for this problem at present. In this paper, we propose a novel multi-start local search algorithm to solve the MCDS problem efficiently. For the performance evaluation of the proposed method, we conduct extensive experiments and report the results.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.81-88
• /
• 2010

Sensors in sensor networks are operated by their embedded batteries and they can not work any more if the batteries run out. The data collected by sensors should be transferred to a sink node through the efficient routes. Many energy efficient routing algorithms were proposed. However, the previous algorithms consume more energy since they did not consider the transmission range and direction. In this paper we propose an algorithm TDRP(Transmission range and Direction Routing Protocol) that considers the transmission range and direction for the efficient data transmission. Since TDRP does not produce clusters or grids but four quadrants and send data to the nodes in one quadrant in the direction of the sink node, it has less network overhead. Furthermore since the proposed algorithm sends data to the smaller number of nodes compared to the previous algorithms, the energy efficiency is better than other algorithms in communication node fields that are located in packet transmit directions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.188-195
• /
• 2012

Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.1
• /
• pp.64-72
• /
• 2009

Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

• Journal of Korea Port Economic Association
• /
• v.31 no.3
• /
• pp.155-166
• /
• 2015

This study selected container terminals of Gwangyang and Busan Ports to evaluate the influence of efficient container terminals. For the study, after data envelopment analysis (DEA) using the CCR and BCC models, the decision-making unit (DMU) system was used to define nodes; and with the use of a reference group in DEA (BCC model) and a lambda value, this study created a social network and analyzed the influences of efficient DMUs through a centrality analysis of eigenvectors. The results are presented as follows: First, as a result of the DEA, CCR efficiencies in PNC, HJNC, and HPNT container terminals of Busan Port were 1 and BCC efficiencies at Singamman Terminal, Wooam Terminal, PNC, HJNC, HPNT, and BNCT container terminals of Busan Port were 1. Second, as a result of undertaking social network analysis (SNA), according to an eigenvector centrality analysis, HJNC Terminal was referred to the most (influence score of 0.515), which indicates that it is the most influential as a container terminal. The influence of PNC Terminal was 0.512, while that of Wooam Terminal was 0.379. CJ Korea Express in Gwangyang Port was ranked fourth in influence, but its influence score of 0.256 indicates that it was the most influential of the container terminals at Gwangyang Port.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.610-618
• /
• 2005

As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.

• Journal of Advanced Navigation Technology
• /
• v.14 no.3
• /
• pp.343-350
• /
• 2010

Wireless Sensor Network is an event-driven system that a large number of micro sensor nodes are collected, giving and Wing information. Congestion can take place easily since a great number of sensor nodes are sensing data and transferring them to sink nodes when an event occurs, comparing to the existing wired network. Current internet transport protocol is TCP/UDP, however, this is not proper for wireless sensor network event-driven ESRT, STCP and CODA are being studied for reliable data transport in the wireless sensor network. Congestion are being detected local buffer and channel loading with these techniques. Broadcasting is mainly used and can avoid congestion when one happens. The way that combining local buffer and channel loading information and detecting congestion is being studied in this paper. When congestion occurs, buffering state is divided into three in order to lessen the broadcasting sending the message on congestion control to the node having frequent channel loading. Thus they have advantage of decreasing network's loading.