• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.412-414
• /
• 2004

수십 대의 PC들로 구성된 학교 PC 실 또는 교육 목적 PC 실에서는 컴퓨터들이 분산 구조로 되어 있어서 각 컴퓨터별로 셋업. 유지보수, 업그레이드가 각각 따로따로 수행된다. 이러한 분산 구조에 대한 대안으로 씬 클라이언트 컴퓨팅 환경을 고려해 볼 수 있다. 씬 클라이언트 컴퓨팅 환경에서, 클라이언트 쪽 장치는 사용자에게 친숙한 GUI 와 멀티미디어 지원과 함께 주로 IO 기능들을 제공하는 반면에 터미널 서버라 불리는 원격 서버들은 컴퓨팅 파워를 제공한다. 이 환경에서는 많은 클라이언트를 지원하기 위해서 터미널 서버들을 클러스터로 구성할 수 있다. 그러나 이러한 구조에서는 터미널 세션의 유지와 사용자의 다양한 컴퓨팅 사용 패턴 요인으로 부하 분산이 어렵고 결과적으로 터미널 서버 자원의 활용도가 낮아지는 단점을 가진다. 이러한 단점을 보완하기 일해 본 논문에서는 적응적 터미널 클러스터를 제안한다. 이 구조에서는 부하가 적은 그룹에 속한 터미널 서버가 부하가 큰 그룹으로 실시간에 동적으로 재 할당될 수 있다. 제안된 적응적 터미널 클러스터를 일반적인 터미널 클러스터와 그룹 기반 비적응적 터미널 클러스터와 비교하고 실험을 통해 제안된 방법의 유효성을 검증하였다.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.661-672
• /
• 2008

Mobile Ad-hoc NETwork is a kind of self-controlled network composed only of mobile hosts. Since its range of use is gradually expanding into various sections applicable to practical lives, active researches are being conducted on it. However, as it depends on cooperation of nodes composing the entire network, due to weakness of wireless link and lack of its central infrastructure, so it is exposed to more serious risk than general network in security. Therefore, this paper proposes Cluster-Based Dynamic Authentication that enables only reliable nodes to participate in communication, by solving lack of centralized infrastructure, using hierarchical Mobile Ad hoc NETwork structure based on cluster, and by complementing security weakness through mutual authentication between hierarchical nodes. Simulation shows that the proposed scheme can complement security weakness of Mobile Ad hoc NETwork and that it is more adequate in reliability and expandability than the existing schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.715-723
• /
• 2015

In this paper, we propose a context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm in Mobile Ad Hoc Networks. The existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. The proposed algorithm performs cluster formation using a range of direction and threshold of velocity for the base-station, we calculate the exchange of the cluster head node probability using the direction and velocity for maintaining cluster formation. The DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.4
• /
• pp.279-284
• /
• 2007

There ate various studies being conducted regarding efficient routing schemes to reduce energy consumption in the wireless sensor network, for which energy transformation is difficult. In terms of routing, many believe that the dynamic clustering technique is most efficient. The dynamic clustering technique consists of cluster construction and data transmission. Energy consumption for data transmission is proportional to $d^2$ and $d^4$ around the crossover area. This paper proposed algorithms for reducing energy consumption by improving efficiency of the cluster construction process that in the dynamic cluster mechanism and minimizing long-distance data transmission outside the crossover area. The proposed algorithms reduced energy consumption by implementing bridge clusters in the crossover area and decreasing the data transmission distance. The benefits of the proposed algorithms were confirmed through simulation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1064-1072
• /
• 2005

For the efficient operation of sensor networks, it is very important to design sensor networks for sensors to utilize their energies in very effective ways. Cluster-based routing schemes such as LEACH can achieve their energy efficiencies by delivering data between cluster heads and sensor nodes. In those cluster-based schemes, cluster reconfiguration algorithm is one of the most critical issues to achieve longer operation lifetime of sensor networks. In this paper, we propose a new energy efficient cluster reconfiguration algorithm. Proposed method does not require any location or energy information of sensors, and can configure clusters with fair cluster regions such that all the sensors in a sensor network can utilize their energies equally. The performances of the proposed scheme have been compared with LEACH and LEACH-C.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1209-1212
• /
• 2003

애드 혹 네트웍(Ad Hoc Networks)은 유선 기반 망을 배제한 완전한 모바일 네트웍이다. 이동성이 큰 애드 혹 네트웍 노드간에는 경로 설정을 위해서 주기적으로 라우팅 패킷이 전송된다. 라우팅 방법은 소스 전송 요구에 따른 요구 기반 라우팅과 주기적으로 라우팅 테이블을 갱신하는 테이블 기반 라우팅으로 나누어진다. 또한, 이 두가지 방법을 혼합한 라우팅을 사용할 수 있는데, 기존의 연구에서 동등한 노드의 자원과 역할을 가정하기 때문에, 실제 네트웍에 적용하는데 한계가 있다. 본 논문에서는 클러스터를 이용한 라우팅 방법을 제안한다. 단순한 클러스터를 이용한 노드 관리는 클러스터 구성에 따른 관리 오버헤드가 발생하게 된다. 따라서 클러스터 구성 노드의 적정 수준을 유지하고, 전파 자원이 충분한 글러스터 선출 방법을 제안함으로써, 네트웍 전체의 관리 오버헤드를 줄일 수 있다. 시뮬레이션은 NS2 [12]를 이용하여, 시뮬레이션 시간동안 노드가 잔여 전력에 따라 클러스터 멤버의 수와 Hello Packet 의 주기를 변화 시킴으로써 노드의 생존성을 보장하고, 최적을 클러스터 구성할 수 있는 노드 수를 측정하였다.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.135-144
• /
• 2012

All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.337-339
• /
• 2006

센서 네트워크는 다양한 응용에 적용될 수 있는 장점을 가지는 반면 기본적인 제약으로 인해 기존의 라우팅 메커니즘을 그대로 적용할 수 없어 센서 네트워크에 적합한 새로운 라우팅 프로토콜들이 많이 제안 되었다. 그러나 대부분의 경우 안전성을 고려하지 못하였다는 문제점을 갖는다. 본 연구에서는 센서 네트워크를 육각형의 클러스터 기반의 구조로 정의하고 각 클러스터에 3차원 좌표를 할당하여 클러스터헤드가 이 좌표값을 이용하여 목적지로의 라우팅 경로를 동적으로 찾는다. 또한 보안을 제공하기 위한 방안으로 중간에 적절한 포스트를 두어 이 지점에서 데이터의 진위를 파악하여 잘못된 정보를 걸러줌으로써 잘못된 정보가 네트워크 상에서 계속 트래픽을 증가시키는 것을 방지한다. 제안 메커니즘은 효율적인 라우팅을 제공함과 동시에 보안 기능을 수행함으로써 보안성을 강화하였다.