• Title/Summary/Keyword: Cluster-Head

Search Result 426, Processing Time 0.034 seconds

Improving Hot Spot Problem in Layer of DL-LEACH

  • LEE, WooSuk;Jin, Seung Yeon;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.64-69
    • /
    • 2017
  • The abstract should summarize the contents of the paper and written below the author information. Use th In Wide-area Wireless Sensor Networks, network lifetime is short due to energy consumption due to transmission distance. To improve this, we divide the sensor field into layers and reduce transmission distance through multi-hop transmission. However, there is a problem in that the transmission rate drops because there is no Cluster Head in the layer, or the transmission distance increases due to the layer, and energy is wasted. There are DL-LEACH and EDL-LEACH as Protocols to improve this. DL-LEACH uses either single-hop transmission or multi-hop transmission depending on the situation. As a result, the transmission distance is optimized, thereby reducing energy consumption. In case of EDL-LEACH, it is proposed to improve the data rate in DL-LEACH. It is the same as DL-LEACH, but the Cluster Head is mandatory for all layers to improve the transmission rate. Although there is no Cluster Head for each layer, the transmission rate is improved, but the network life is shortened. In this paper, we try to improve the network lifetime while maintaining the EDL-LEACH transmission rate. The shortened network lifetime is due to Cluster Head overload near the base station. To improve this, the Cluster Head distribution method is improved and the network lifetime is improved.

A Multi-hash Chain Scheme for Ensure Data Integirty Nodes in Wireless Sensor Network (무선 센서 네트워크에서 데이터 무결성을 보장하기 위한 다중 해쉬 체인 기법)

  • Park, Gil-Cheol;Jeong, Yoon-Su;Kim, Yong-Tae;Lee, Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.10
    • /
    • pp.2358-2364
    • /
    • 2010
  • Recently, In the wireless sensor network, a study which guarantees integrity of not only data gathered from sensor node but also energy consumption of it is now going on. However, the existing study cannot guarantee data integrity and overhead of cluster head which merges data from sensor node. This paper proposes multi-path hash chain technique which guarantees integrity of merged data and reduces overhead of cluster head when cluster head merges with data transmitted from sensor node. The proposed technique forms multi-hash chain dividing main-path and assistance-path to guarantee data integrity of cluster head, when merges data. The assistance-path, which is used when main-path is not, supports integrity of sensor node while minimizing overhead of cluster head when sensor node is authenticate.

A Study of Load Tolerance Node using Load-balance in Mobile Ad hoc Networks (모바일 애드 혹 네트워크에서 로드 밸런스를 이용한 분산 노드 설정에 관한 연구)

  • Oh, Dong-Keun;Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.1001-1008
    • /
    • 2015
  • Mobile Ad hoc Network(MANET) consists of a node that has mobility. In MANET, the node has routing, the node builds a network of their own, no dependent infrastructure. Topology are exchanged due to node mobility in MANET. For reducing the change of topology, hierarchical network algorithm has been investigated. In hierarchical network, cluster member node communicates through cluster head node. When the load-balancing of cluster head node is exceed, assigned cluster member node can't communicate with base station. To solve this problem, we proposed Load Tolerance algorithm. The proposed algorithm, when cluster member node can't send a message by cluster head node that exceed load-balancing, then the cluster member node sends a message by selected load tolerance node. Through a simulation, the proposed algorithm improves packet delivery ratio in cluster routing.

A Dynamic Clustering Mechanism Considering Energy Efficiency in the Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율성을 고려한 동적 클러스터링 기법)

  • Kim, Hwan;Ahn, Sanghyun
    • 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.

An improved LEACH-C routing protocol considering the distance between the cluster head and the base station (클러스터 헤드와 기지국간의 거리를 고려한 향상된 LEACH-C 라우팅 프로토콜)

  • Kim, TaeHyeon;Park, Sea Young;Kwon, Oh Seok;Lee, Jong-Yong;Jung, Kye-Dong
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.2
    • /
    • pp.373-377
    • /
    • 2022
  • Wireless sensor networks are being used in various fields. Wireless sensor networks are applied in many areas, such as security, military detection, environmental management, industrial control, and home automation. There is a problem about the limit of energy that the sensor network basically has. In this paper, we propose the LEACH-CCBD (Low Energy Adaptive Clustering hierarchy - Centrailized with Cluster and Basestation Distance) algorithm that uses energy efficiently by improving network transmission based on LEACH-C among the representative routing protocols. The LEACH-CCBD algorithm is a method of assigning a cluster head to a cluster head by comparing the sum of the distance from the member node to the cluster distance and the distance from the cluster node to the base station with respect to the membership of the member nodes in the cluster when configuring the cluster. The proposed LEACH-CCBD used Matlab simulation to confirm the performance results for each protocol. As a result of the experiment, as the lifetime of the network increased, it was shown to be superior to the LEACH and LEACH-C algorithms.

Initial Rendezvous Protocol using Multicarrier Operation for Cognitive Radio Ad-hoc Networks

  • Choi, Ik-Soo;Yoo, Sang-Jo;Seo, Myunghwan;Han, Chul-Hee;Roh, Bongsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2513-2533
    • /
    • 2018
  • In cognitive radio technology, the overall efficiency of communications systems can be improved without allocating additional bands by allowing a secondary system to utilize the licensed band when the primary system, which has the right to use the band, does not use it. In this paper, we propose a fast and reliable common channel initialization protocol without any exchange of initialization messages between the cluster head and the member nodes in cognitive ad-hoc networks. In the proposed method, the cluster and member nodes perform channel-based spectrum sensing. After sensing, the cluster head transmits a system activation signal through its available channels with a predetermined angle difference pattern. To detect the cluster head's transmission channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation for the angle difference sequence of the received signal patterns. This is compared to the predetermined reference angle difference pattern. The join-request and channel-decision procedures are presented in this paper. Performance evaluation of the proposed method is presented in the simulation results.

A New Cluster Head Selection Technique based on Remaining Energy of Each Node for Energy Efficiency in WSN

  • Subedi, Sagun;Lee, Sang-Il;Lee, Jae-Hee
    • International journal of advanced smart convergence
    • /
    • v.9 no.2
    • /
    • pp.185-194
    • /
    • 2020
  • Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

Position-Based Cluster Routing Protocol for Wireless Microsensor Networks

  • Kim Dong-hwan;Lee Ho-seung;Jin Jung-woo;Son Jae-min;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.330-333
    • /
    • 2004
  • Microsensor nodes is energy limited in sensor networks. If nodes had been stop in working, sensor network can't acquire sensing data in that area as well as routing path though the sensor can't be available. So, it's important to maximize the life of network in sensor network. In this paper, we look at communication protocol, which is modified by LEACH(Low-Energy Adaptive Clustering Hierarchy). We extend LEACH's stochastic cluster-head selection algorithm by a Position-based Selection (PB-Leach). This method is that the sink divides the topology into several areas and cluster head is only one in an area. PB-Leach can prevent that the variance of the number of Cluster-Head is large and Cluster-Heads are concentrated in specific area. Simulation results show that PB-Leach performs better than leach by about 100 to $250\%.$

  • PDF

A Layer-based Dynamic Unequal Clustering Method in Large Scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 계층 기반의 동적 불균형 클러스터링 기법)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.12
    • /
    • pp.6081-6088
    • /
    • 2012
  • An unequal clustering method in wireless sensor networks is the technique that forms the cluster of different size. This method decreases whole energy consumption by solving the hot spot problem. In this paper, I propose a layer-based dynamic unequal clustering using the unequal clustering model. This method decreases whole energy consumption and maintain that equally using optimal cluster's number and cluster head position. I also show that proposed method is better than previous clustering method at the point of network lifetime.

Efficient Cluster Radius and Transmission Ranges in Corona-based Wireless Sensor Networks

  • Lai, Wei Kuang;Fan, Chung-Shuo;Shieh, Chin-Shiuh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1237-1255
    • /
    • 2014
  • In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.