• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.831-834
• /
• 2011

LEACH(One of the leading algorithms in the field of WSN) for the life of the system, even by the number of all nodes to ensure that the cluster header. However, each round does not guarantee a certain number of cluster header. So sometimes cluster header is elected of small number or not elected. If cluster header number is to small, takes a heavy load on cluster header. And empty cluster is occur depending on the location of the cluster header. The algorithm proposed in this paper, the area of interest is divided into sectors. And randomly, cluster header be elected one the in each sector. When clustering the sensor nodes will belong to the nearest cluster header. So clustering is independent of the sector. This algorithm is guarantee a certain number of cluster header in each round. And has prevent occurrence of empty cluster.

• Informatization Policy
• /
• v.26 no.2
• /
• pp.81-95
• /
• 2019

This study explores how the advanced data analysis capabilities of intelligent information technology are being utilized in politics. In particular, we focus on the fact that voter behavioral targeting in election campaigns comes into conflict with the democratic process in various ways. For this purpose, this study examines political micro-targeting and political bots. It is aimed at showing that these technology-based campaign techniques work as a factor preventing free expression of opinions and discussions, which are the core of democracy itself. Then we identify the attributes of the algorithm that affects them. As a result, this study suggests that the following issues might arise regarding intelligent information technology-based politics and democracy. First, inequality in political participation becomes more severe. Second, the public debate between voters gets more difficult. Third, superficial politics is prevalent. Fourth, single-issue politics and the exclusion of political representation is likely to increase. Fifth, political privacy might also be invaded. Based on our discussions, this study concludes that it is our role to find ways by which intelligent information technology and democracy can coexist.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.267-277
• /
• 2017

One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.514-537
• /
• 2020

Wireless sensor network (WSN) is a distributed network composed of many sensory nodes. It is precisely due to the clustering unevenness and cluster head election randomness that the energy consumption of WSN is excessive. Therefore, a many-objective optimization WSN energy balance model is proposed for the first time in the clustering stage of LEACH protocol. The four objective is considered that the cluster distance, the sink node distance, the overall energy consumption of the network and the network energy consumption balance to select the cluster head, which to better balance the energy consumption of the WSN network and extend the network lifetime. A many-objective optimization algorithm to optimize the model (LEACH-ABF) is designed, which combines adaptive balanced function strategy with penalty-based boundary selection intersection strategy to optimize the clustering method of LEACH. The experimental results show that LEACH-ABF can balance network energy consumption effectively and extend the network lifetime when compared with other algorithms.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.2099-2100
• /
• 2006

제한된 전력의 노드들로 구성된 무선 센서 네트워크에서 효율적인 정보 수집이 이루어지기 위해서는 전체 네트워크의 Life Time을 늘리는 게 중요하다. 각각의 센서 노드들이 멀리 떨어져 있는 BS(Base Station)으로 직접 데이터를 전송하면 전력소비가 매우 크고 비효율 적이다. 그리하여 네트워크의 life time을 늘리기 위한 많은 연구가 이루어지고 있다. 그중에 클러스터링 기법은 가장 널리 연구되는 기법 중에 하나이다. 대표적인 클러스터링 기법 LEACH(Low-Energy Adaptive Clustering Hierarchy)[1]는 전체 노드 수의 5%클 클러스터 헤드로 결정하여 나머지 노드들로부터 데이터를 수집하여 BS로 전송함으로써 에너지를 효율적으로 사용하는 알고리즘이다. 그러나 클러스터 헤드를 결정하는데 있어서 잔여 에너지를 고려하지 않고 순환적으로 결정하는 문제점을 가지고 있다. 그래서 본 논문에서는 SVM(Supprt Vector Machine)을 이용하여 FND(First Node Dic)가 발생했을 때 각 노드들의 에너지 잔량 정도를 따져서 영역을 나눈 후, 에너지가 더 많은 영역에서 클러스터 헤드를 선정하는 방법을 제안한다. 잔량 에너지가 많은 노드를 클러스터 헤드로 결정함으로써 전체 네트워크의 life time을 늘릴 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1801-1810
• /
• 2016

The OpenDaylight controller has been receiving significant attention as one of the enabling open source framework for SDN, and this paper analyzes the architecture and procedure of OpenDaylight based controller cluster. The OpenDaylight controller cluster uses shard based distributed datastore and Raft algorithm to maintain consistency among controllers inside a cluster. The performance evaluation analyzes the leader re-election time as well as latencies of CRUD and Routed RPC according to cluster size, shard role, and sharding strategy, and we discuss the optimal operation strategy for OpenDaylight controller cluster.

• Journal of Information Technology Services
• /
• v.18 no.1
• /
• pp.219-234
• /
• 2019

Fake news threaten democratic elections and causes social conflicts, resulting in major damage. However, the concept of fake news is hard to define, as there is a saying, "News is not fake, fake is not news." Fake news, however, has irreversible characteristics that can not be recovered or reversed completely through post-punishment of economic and political benefits. It is also rapidly spreading in the early days. Therefore, it is very important to preemptively detect these types of articles and prevent their blind proliferation. The existing countermeasures are focused on reporting fake news, raising the level of punishment, and the media & academia to determine the authenticity of the news. Researchers are also trying to determine the authenticity by analyzing its contents. Apart from the contents of fake news, determining the behavioral characteristics of the promoters and its qualities can help identify the possibility of having fake news in advance. The online community has a fake news interception and response tradition through its long-standing community-based activities. As a result, I attempted to model the fake news by analyzing the affirmation-denial analysis and posting behavior by securing the web board crawl of the 'M community' bulletin board during the 2017 Korean presidential election period. Random forest algorithm deemed significant. The results of this research will help counteract fake news and focus on preemptive blocking through behavioral analysis rather than post-judgment after semantic analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1187-1208
• /
• 2022

One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.126-132
• /
• 2023

Web technology is evolving with the passage of time, from a single node server to high availability and then in the form of Kubernetes. In recent years, the research community have been trying to provide high availability in the form of multi master cluster with a solid election algorithm. This is helpful in increasing the resources in the form of pods inside the worker node. There are new impact of known DDoS attack, which is utilizing the resources at its peak, known as Yoyo attack. It is kind of burst attack that can utilize CPU and memory to its limit and provide legit visitors with a bad experience. In this research, we tried to mitigate the Yoyo attack by introducing a firewall at load-balancer level to prevent the attack from going to the cluster network.