• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.499-502
• /
• 2008

한정된 용량의 배터리에 의존하는 무선 Ad-hoc 네트워크(MANET)에서는 에너지 효율을 높이기 위한 다양한 클러스터링 기법과 라우팅 알고리즘이 연구되고 있다. 이러한 무선 Ad-hoc 네트워크에서는 에너지 효율이 높은 클러스터 기반의 라우팅 알고리즘이 많이 사용된다. 그러나 일반적인 클러스터 방식에 따른 라우팅 알고리즘에서는 클러스터 헤드 노드에 부하가 집중되어 에너지 소모가 많은 문제점을 가진다. 이 문제를 보완하기 위해서 클러스터 헤드 노드의 재 선출을 통해 에너지 소모를 분산하는 동적 클러스터링 방식이 사용되고 있다. 그러나 동적 클러스터링 방식 또한 높은 빈도의 클러스터 재형성 과정에서 많은 에너지를 소모하는 문제점이 있다. 즉, 지금까지 연구되어온 알고리즘은 클러스터 구성에 대한 효율적인 알고리즘을 제시하고 있지만 불필요한 에너지 소모를 최소화하는 최적의 헤드 노드 선정 방법과 클러스터 관리를 통하여 에너지 효율을 높일 수 있는 해결책을 제시하지 않았다. 따라서 본 논문에서는 위의 클러스터 문제를 해결하기 위해 TICC(Time Interval Clustering Control) 알고리즘 기법을 제안한다. 제안된 TICC은 각 노드의 에너지 속성 값에 따라 에너지 Level을 분류하고 분류된 에너지 Level에 따라 타이밍을 고려한 클러스터링 및 노드 관리방법이다. 이러한 TICC기법을 적용하여 실험을 하였고 결과적으로 클러스터 전체의 에너지 효율을 향상되고 Lifetime이 증가함을 보였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.3
• /
• pp.243-246
• /
• 2009

A cluster-based routing with a hierachical structure for continuous query stream ubiquitous sensor network is proposed in this paper. the proposed method realizes high energy-efficiency by using a head-set instead of head for transmitting node-messages to a base station. By using head-set, the method make network lifetime increased.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.379-384
• /
• 2010

Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.31-39
• /
• 2007

Wireless sensor network can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infra, but, by unrestricted for the participation and breakaway of node, it has the difficulty in routing which is a basic function of network operation. To solve those problems, a suggestion is the location-based routing algorithm using geological or logical location information. The suggested algorithm which is based on cluster for location information of sensor is applicable to wireless sensor network of discrete situation, which guarantees extension and mobility. By efficiency analysis and reactive routing algorithm of current DSR and AODV, packet transmission ratio, routing overheads, and average communication expense is compared as node increases.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.155-162
• /
• 2014

We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.31-34
• /
• 2012

In MANET, frequent movement of nodes causes the dynamic network topology changes. Therefore the routing protocol, which is very stable to effectively respond the changes of the network changes, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. When they route nodes in the paired cluster internally, PCBRP reduces the delay by requesting a route. Therefore PCBRP shows improved total delay of the network and improved performance of packet transmitting rate.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.138-143
• /
• 2005

A hierarchical tree structure of clusters has advantages for the network design due to its scalability and simple routing protocol. In this paper, the cluster tree routing protocol is studied for the wireless sensor network. From the numerical analysis results, the data aggregation in the intermediate nodes reduces the number of communication message and saves the energy of sensor nodes, but it may result in increased data traffic latency. And also the selection of cluster head can increase the relaying hops very high.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.4
• /
• pp.155-161
• /
• 2014

In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.147-149
• /
• 2000

프로세서와 네트워크의 발달로 클러스터 시스템은 웹 기반 응용분야 등에서 수요가 증가하고 있다. 화상회의, VOD, 온라인 게임, 상품 및 주식거래 등과 같은 실시간 서비스를 제공하기 위해 클러스터 시스템에서의 라우팅은 결함이 발생한 경우에도 마감시간 안에 실시간 연결이 이루어져야 한다. 본 논문에서는 여러 개의 노드로 구성되어 있으며, 동일한 작업을 수행하는 노드들이 그룹을 이룬 클러스터 시스템에서 백업 채널과 백업 노드를 예약하는 결함 허용 실시간 연결방법을 제안하고 신뢰도를 분석한다. 또한 일반 네트워크 환경의 라우팅만을 사용한 시스템과 백업 채널을 사용하는 시스템의 QoS를 비교하기 위해 시뮬레이션을 수행한다.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.310-323
• /
• 2006

In this paper, we describe a secure cluster-routing protocol based on a multi-layer scheme in ad hoc networks. We propose efficient protocols, Authentication based on Multi-layer Clustering for Ad hoc Networks (AMCAN), for detailed security threats against ad hoc routing protocols using the selection of the cluster head (CH) and control cluster head (CCH) using a modification of cluster-based routing ARCH and DMAC. This protocol provides scalability of Shadow Key using threshold authentication scheme in ad hoc networks. The proposed protocol comprises an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. This scheme takes advantage of Shadow Key using threshold authentication key configuration in large ad hoc networks. In experiments, we show security threats against multilayer routing scheme, thereby successfully including, establishment of secure channels, the detection of reply attacks, mutual end-to-end authentication, prevention of node identity fabrication, and the secure distribution of provisional session keys using threshold key configuration.