• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.534-543
• /
• 2006

As the topology frequently varies, more cluster reconstructing is needed and also management overheads increase in the wireless ad hoc/sensor networks. In this paper, we propose a multi-hop clustering algorithm for wireless sensor network topology management using dynamic pre-clusterhead scheme to solve cluster reconstruction and load balancing problems. The proposed scheme uses weight map that is composed with power level and mobility, to choose pre-clusterhead and construct multi-hop cluster. A clusterhead has a weight map and threshold to hand over functions of clusterhead to pre-clusterhead. As a result of simulation, our algorithm can reduce overheads and provide more load balancing well. Moreover, our scheme can maintain the proper number of clusters and cluster members regardless of topology changes.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.9-15
• /
• 2011

It is difficult to identify attack requests from normal ones when those attacks are based on CSRF which enables an attacker transmit fabricated requests of a trusted user to the website. For the protection against the CSRF, there have been a lot of research efforts including secret token, custom header, proxy, policy model, CAPTCHA, and user reauthentication. There remains, however, incapacitating means and CAPTCHA and user reauthentication incur user inconvenience. In this paper, we propose a method to detect CSRF attacks by analyzing the structure of websites and the usage patterns. Potential victim candidates are selected and website usage patterns according to the structure and usage logs are analyzed. CSRF attacks can be detected by identifying normal usage patterns. Also, the proposed method does not damage users' convenience not like CAPTCHA by requiring user intervention only in case of detecting abnormal requests.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.25-34
• /
• 2006

In this paper DynaMoNET is suggested as a novel IPv6-based multi-homed mobile network architecture which is composed of nested mobile ad hoc networks dynamically coming together through wireless personal area networks. Each ad hoc network has a mobile router which may work as a root mobile router instead of fixed mobile routers in a DynaMoNET. A root mobile router provides the reliable Internet connectivity for the entire mobile network. This paper includes a innovative handover protocol for multi-homed mobile networks, network switchover algorithm considering multiple decision factors, root mobile router election process based on token-based algorithm fast root mobile router discovery algorithm and fault avoidance mechanism to support reliable Internet connectivity. Finally the system architecture of a mobile router is given in detail.

• Journal of the Korean Society for Library and Information Science
• /
• v.50 no.3
• /
• pp.155-169
• /
• 2016

The purpose of this study is to find a policy and to predict the needs of legislative information service of the 20th National Assembly. For this purpose, It is critical to understand the use behavior of legislative information service according to the attribute for the member of the 19th National Assembly. Thus, this study examined the results of reference service of National Assembly Library of Korea using the politics attribute and the relation attribute as independent variables for the member of the National Assembly in the First Half of the 19th National Assembly. Consequently, there were meaningful differences in the use of legislative information service between users by party affiliation, method of an election and introversion. Also, the increased demand of legislative information service was predicted in that the 20th National Assembly is the status of the opposition majority and the three major parties.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.115-122
• /
• 2011

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Korean Journal of Environmental Biology
• /
• v.31 no.3
• /
• pp.225-231
• /
• 2013

To study the characteristics of rocky intertidal invertebrate fauna on the coastal areas of the East Sea, seven regions including Dokdo, Ulleungdo, Gyeongju, Pohang, Yeongdeok, Uljin, and Gangwondo, the common species ratio (%) and similarity index using Bray-Curtis similarity matrix were calculated. The contributed species for dissimilarity between Dokdo and the other East Sea's coastal areas were selected by using SIMPER. The common species ratio and the cluster analysis showed that Ulleungdo presented the highest similarity. However, Yeongdeok showed the highest similarity in the eastern costal areas, and Gangwondo showed the lowest one. However the cluster analysis revealed the discrimination of the rocky intertidal invertebrate community on Dokdo with others region caused by the particularity of rocky shores exposed to strong wave action and by the particular distribution of rocky intertidal invertebrate fauna in Dokdo.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.6
• /
• pp.1501-1509
• /
• 2017

Wins above replacement (WAR) is the most commonly used statistics of the sabermetrics that measure baseball players' abilities. The advantage of a WAR is that it enables to compare performances of players even though they have different roles such as pitcher and hitter. However, WAR is difficult to obtain with common records. Thus, a past studies (Lee and Kim, 2016) suggested the batting ability index to determine the ability of the batter focused on the sabermetrics statistics WAR. In this paper, we selected the best hitter with applying Korea baseball 2016 data based on a proposed model and then observed a total raking of others according to BAI. We are assured that BAI is very excellent statistics through comparing BAI and WAR which is in the spotlight in evaluating performances of players.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.692-702
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is proposed. The algorithm finds a motion vector using the increasing SAD transition curve for each predefined candidates, not a coarse-to-fine approach as a conventional method. To remove low-probability candidates at the early stage of accumulation, a dispersed accumulation matrix is also proposed. This matrix guarantees high-linearity to the SAD transition curve. Therefore, base on this method, we present a new fast block-matching algorithm with the slice competition technique. The Candidate Selection Step and the Candidate Competition Step makes an out-performance model that considerably reduces computational power and not to be trapped into local minima. The computational power is reduced by 10%~70% than that of the conventional BMAs. Regarding computational time, an 18%~35% reduction was achieved by the proposed algorithm. Finally, the average MAD is always low in various bit-streams. The results were also very similar to the MAD of the full search block-matching algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.5
• /
• pp.885-896
• /
• 2013

MTC(Machine Type Communications), providing a variety of services anytime and anywhere by connecting the cellular network to the machine and things without human intervention, is being considered as a major challenge of the next-generation communications. Currently, When a massive MTC devices simultaneously connect to the network, each MTC device needs an independent access authentication process. Because of this process, authentication signaling congestion and overload problems will cause in LTE-Advanced. In this paper, we propose a group-based authentication protocol and a key management protocol. For managing the MTC devices as group units, the proposed protocol elects a group leader and authentications only once with the core network. After the authentication is completed, a group leader manages the rest members and MME(Mobility Management Entity) by constructing a binary tree. Finally, the propose protocol analysis show that the proposed protocol not only can reduces the authentication signaling which generated in between the MTC devices and the core network but also can manages the MTC devices, efficiently.