• Title/Summary/Keyword: 다중홉 클러스터링

Search Result 18, Processing Time 0.031 seconds

Dynamic-size Multi-hop Clustering Mechanism based on the Distance in Sensor Networks (센서 네트워크에서의 거리에 따른 동적 크기 다중홉 클러스터링 방법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.6
    • /
    • pp.519-524
    • /
    • 2007
  • One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks (센서 네트워크에서의 동적 크기 다중홉 클러스터링 방법)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.875-880
    • /
    • 2005
  • One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechanism to achieve a long-lived network is the clustering mechanism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster head(CH) is balanced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop or fixed-size multi-hop clustering mechanisms by carrying out simulations.

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop (무선 에드혹 망 다중홉 트래픽제어를 위한 Clustering 알고리즘에 관한 연구)

  • 이동철;김기문;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1161-1167
    • /
    • 2003
  • The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.

An Energy Consumption Model using Hierarchical Unequal Clustering Method (계층적 불균형 클러스터링 기법을 이용한 에너지 소비 모델)

  • Kim, Jin-Su;Shin, Seung-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.6
    • /
    • pp.2815-2822
    • /
    • 2011
  • Clustering method in wireless sensor networks is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. In this paper, I propose the hierarchical unequal clustering method using cluster group model. This divides the entire network into two layers. The data aggregated from layer 2 consisted of cluster group is sent to layer 1, after re-aggregation the total data is sent to base station. This method decreases whole energy consumption by using cluster group model with multi-hop communication architecture. Hot spot problem can be solved by establishing unequal cluster. I also show that proposed hierarchical unequal clustering method is better than previous clustering method at the point of network energy efficiency.

A Design of TNA(Traceback against Network Attacks) Based on Multihop Clustering using the depth of Tree structure on Ad-hoc Networks (애드혹 네트워크 상에 트리구조 깊이를 이용한 다중홉 클러스터링 기반 TNA(Traceback against Network Attacks) 설계)

  • Kim, Ju-Yung;Lee, Byung-Kwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.9
    • /
    • pp.772-779
    • /
    • 2012
  • In the current MANET, DOS or DDOS attacks are increasing, but as MANET has limited bandwidth, computational resources and battery power, the existing traceback mechanisms can not be applied to it. Therefore, in case of traceback techniques being applied to MANET, the resource of each node must be used efficiently. However, in the traceback techniques applied to an existing ad hoc network, as a cluster head which represents all nodes in the cluster area manages the traceback, the overhead of the cluster head shortens each node's life. In addition, in case of multi-hop clustering, as one Cluster head manages more node than one, its problem is getting even worse. This paper proposes TNA(Traceback against Network Attacks) based on multihop clustering using the depth of tree structure in order to reduce the overhead of distributed information management.

The Clustering Scheme for Load-Balancing in Mobile Ad-hoc Network (이동 애드혹 네트워크에서 로드 밸런싱을 위한 클러스터링 기법)

  • Lim, Won-Taek;Kim, Gu-Su;Kim, Moon-Jeong;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.757-766
    • /
    • 2006
  • Mobile Ad-hoc Network(MANET) is an autonomous network consisted of mobile hosts. A considerable number of studies have been conducted on the MANET with studies of ubiquitous computing. Several studies have been made on the clustering schemes which manage network hierarchically to Improve flat architecture of MANET. But the conventional schemes have the lack of multi-hop clustering and load balancing. This paper proposes a clustering scheme to support multi-hop clustering and to consider load balancing between cluster heads. We define the split of clusters and states of cluster, and propose join, merge, divide, and election of cluster head schemes for load balancing of between cluster heads

A Cluster Group Head Selection using Trajectory Clustering Technique (궤적 클러스터링 기법을 이용한 클러스터 그룹 헤드 선정)

  • Kim, Jin-Su;Shin, Seung-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.12
    • /
    • pp.5865-5872
    • /
    • 2011
  • Multi-hop communication in clustering system is the technique that forms the cluster to aggregate the sensing data and transmit them to base station through midway cluster head. Cluster head around base station send more packet than that of far from base station. Because of this hot spot problem occurs and cluster head around base station increases energy consumption. In this paper, I propose a cluster group head selection using trajectory clustering technique(CHST). CHST select cluster head and group head using trajectory clustering technique and fitness function and it increases the energy efficiency. Hot spot problem can be solved by selection of cluster group with multi layer and balanced energy consumption using it's fitness function. I also show that proposed CHST is better than previous clustering method at the point of network energy efficiency.

A Study on the Effective Routing Algorithm for Mobile Ad-hoc Wireless Network (이동 Ad-hoc 무선망에서 효율적인 라우팅 알고리즘에 관한 연구)

  • Lee, Dong-Chul;Kim, Ki-Moon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.58-64
    • /
    • 2005
  • The nodes of Ad-hoc network are made up of location registration for sending information and a great number of packet transmissions to maintain routing route among the nodes. under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extend of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

Clustering Technique of Intelligent Distance Estimation for Mobile Ad-hoc Network (이동 Ad-hoc 통신을 위한 지능형 거리추정 클러스터방식)

  • Park, Ki-Hong;Shin, Seong-Yoon;Rhee, Yang-Won;Lee, Jong-Chan;Lee, Jin-Kwan;Jang, Hye-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.105-111
    • /
    • 2009
  • The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

Power Efficient Multi-hop Routing Protocol in Cluster for Wireless Sensor Networks (무선 센서네트워크 환경에서의 효율적인 전력소비를 위한 라우팅 프로토콜)

  • Bae, Dae-Jin;Kim, Jong-Tae
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.22 no.2
    • /
    • pp.142-147
    • /
    • 2008
  • In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.