• Title/Summary/Keyword: low energy adaptive clustering hierarchy (LEACH)

Search Result 56, Processing Time 0.022 seconds

CREEC: Chain Routing with Even Energy Consumption

  • Shin, Ji-Soo;Suh, Chang-Jin
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.17-25
    • /
    • 2011
  • A convergecast is a popular routing scheme in wireless sensor networks (WSNs) in which every sensor node periodically forwards measured data along configured routing paths to a base station (BS). Prolonging lifetimes in energy-limited WSNs is an important issue because the lifetime of a WSN influences on its quality and price. Low-energy adaptive clustering hierarchy (LEACH) was the first attempt at solving this lifetime problem in convergecast WSNs, and it was followed by other solutions including power efficient gathering in sensor information systems (PEGASIS) and power efficient data gathering and aggregation protocol (PEDAP). Our solution-chain routing with even energy consumption (CREEC)-solves this problem by achieving longer average lifetimes using two strategies: i) Maximizing the fairness of energy distribution at every sensor node and ii) running a feedback mechanism that utilizes a preliminary simulation of energy consumption to save energy for depleted Sensor nodes. Simulation results confirm that CREEC outperforms all previous solutions such as LEACH, PEGASIS, PEDAP, and PEDAP-power aware (PA) with respect to the first node death and the average lifetime. CREEC performs very well at all WSN sizes, BS distances and battery capacities with an increased convergecast delay.

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.

Data transfer Rate of the Wireless Node Moving in the Static Wireless Network Space (고정 무선네트워크 공간 내에서의 무선노드 이동시 데이터 전송률)

  • Lee, Cheol;Lee, Jung-Suk
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.10
    • /
    • pp.941-948
    • /
    • 2016
  • In this paper, we efficiently simulated for collecting the data from the fixed sensor and mobile sensor of patients using the LEACH-Mobile method. The LEACH-Mobile method is the protocol to increase the mobility by adding the mobile node to the existed LEACH(:Low Energy Adaptive Clustering Hierarchy) protocol. It improves the mobility of The LEACH-Mobile in the LEACH, however it consumes more energy than the existed LEACH. There is reason why we use the LEACH-Mobile that the monitoring system is generally done by the CCTV and an periodic checkup by nurses. However the number of nurse is a few in the most of hospital. It can happen the accidents of the patients in out of the CCTV when the nurse can not see the monitoring system in the hospital. Therefore it is simulated to continuously gather the data of the position and sensors in the five situation of moving the patients in the hospital, it gets the result that the management of the mobile patients is more efficient.

Energy Efficient Routing Protocols based on LEACH in WSN Environment (WSN 환경에서 LEACH 기반 에너지 효율적인 라우팅 프로토콜)

  • Dae-Kyun Cho;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.609-616
    • /
    • 2023
  • In a wireless network environment, since sensors are not always connected to power, the life of a battery, which is an energy source supplied to sensors, is limited. Therefore, various studies have been conducted to extend the network life, and a layer-based routing protocol, LEACH(: Low-energy Adaptive Clustering Hierarchy), has emerged for efficient energy use. However, the LEACH protocol, which transmits fused data directly to the sink node, has a limitation in that it consumes as much energy as the square of the transmission distance when transmitting data. To improve these limitations, this paper proposes an algorithm that can minimize the transmission distance with multi-hop transmission where cluster heads are chained between cluster heads through relative distance calculation from sink nodes in every round.

i-LEACH : Head-node Constrained Clustering Algorithm for Randomly-Deployed WSN (i-LEACH : 랜덤배치 고정형 WSN에서 헤더수 고정 클러스터링 알고리즘)

  • Kim, Chang-Joon;Lee, Doo-Wan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.1
    • /
    • pp.198-204
    • /
    • 2012
  • Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

A Study on Cluster Head Selection and a Cluster Formation Plan to Prolong the Lifetime of a Wireless Sensor Network

  • Ko, Sung-Won;Cho, Jeong-Hwan
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.7
    • /
    • pp.62-70
    • /
    • 2015
  • The energy of a sensor in a Wireless Sensor Network (WSN) puts a limit on the lifetime of the network. To prolong the lifetime, a clustering plan is used. Clustering technology gets its energy efficiency through reducing the number of communication occurrences between the sensors and the base station (BS). In the distributed clustering protocol, LEACH-like (Low Energy Adaptive Clustering Hierarchy - like), the number of sensor's cluster head (CH) roles is different depending on the sensor's residual energy, which prolongs the time at which half of nodes die (HNA) and network lifetime. The position of the CH in each cluster tends to be at the center of the side close to BS, which forces cluster members to consume more energy to send data to the CH. In this paper, a protocol, pseudo-LEACH, is proposed, in which a cluster with a CH placed at the center of the cluster is formed. The scheme used allows the network to consume less energy. As a result, the timing of the HNA is extended and the stable network period increases at about 10% as shown by the simulation using MATLAB.

DL-LEACH: Hierarchical Dual-Hop Routing Protocol for Wireless Sensor Network (DL-LEACH : 무선 센서 네트워크를 위한 계층형 멀티 홉 라우팅 프로토콜)

  • Lee, Chang-Hee;Lee, Jong-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.139-145
    • /
    • 2015
  • This paper proposes to increase the node energy effienciecy, which rapidly drops during the transmission of LEACH (Low Energy Adaptive Clustering Hierachy), using the method of DL-LEACH (Dual-hop Layered LEACH). By introducing dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission was introduce. By introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was introduces. In the proposed DL-LEACH, the energy consumption of cluster head for remote transmission reduces and increases the energy efficiency of sensor node by reducing the transmission distance and simplifying the transmission routine for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

Effects of directional transmission on clustering WSN (클러스터링 센서네트워크의 방향성 전송 효과)

  • Kim, Jeong-Mi;Zhang, Zhe-Hao;Kim, Chong-Gun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.258-268
    • /
    • 2012
  • Wireless Sensor Network(WSN) is constituted by low-cost and low-energy, So the most important issue is that the task of the sensor performs successfully by using less energy. In previous WSN, determination of the header and gathering sensor data solution by header give great affection to the performance of network. In this paper, we propose a Hybrid transmission method which considers the direction of data collections. In the proposed hybrid routing method, all of the sensors determine that transmission the data to the sink node directly or indirectly using the head node depend on the location of the head node in the cluster. The performance is compared with the LEACH(Low Energy Adaptive Clustering Hierarchy) by experimental analysis. The results show that the preposed method can reduce the communication distance and energy consumption by avoiding the detour direction of transmission of the data.

Data Direction Aware Clustering Method in Sensor Networks (데이터 전송방향을 고려한 센서네트워크 클러스터링 방법)

  • Jo, O-Hyoung;Kwon, Tae-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.721-727
    • /
    • 2009
  • Wireless Sensor Networks(WSN) make use of low cost and energy constrained sensor nodes. Thus, reaching the successful execution of its tasks with low energy consumption is one of the most important issues. The limitation of existing hierarchical algorithms is that many times the data are transmitted to the opposite direction to the sink. In this paper, DDACM (Data Direction Aware Clustering Method) is proposed. In this method, the nearest node to the sink is elected as cluster head, and when its energy level reaches a threshold value, the cluster head is reelected. We also make a comparison with LEACH showing how this method can reduce the energy consumption minimizing the reverse direction data transmission.

A Lightweight Detection Mechanism against Sybil Attack in Wireless Sensor Network

  • Shi, Wei;Liu, Sanyang;Zhang, Zhaohui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3738-3750
    • /
    • 2015
  • Sybil attack is a special kind of attack which is difficult to be detected in Wireless Sensor Network (WSN). So a lightweight detection mechanism based on LEACH-RSSI-ID (LRD) is proposed in this paper. Due to the characteristic of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, none of nodes can be the cluster head forever.