• Title/Summary/Keyword: LEACH Protocol

Search Result 146, Processing Time 0.022 seconds

The Energy Efficient for Wireless Sensor Network Using The Base Station Location

  • Baral, Shiv Raj;Song, Young-Il;Jung, Kyedong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.1
    • /
    • pp.23-29
    • /
    • 2015
  • Energy constraints of wireless sensor networks are an important challenge. Data Transmission requires energy. Distance between origin and destination has an important role in energy consumption. In addition, the location of base station has a large impact on energy consumption and a specific method not proposed for it. In addition, a obtain model for location of base station proposed. Also a model for distributed clustering is presented by cluster heads. Eventually, a combination of discussed ideas is proposed to improve the energy consumption. The proposed ideas have been implemented over the LEACH-C protocol. Evaluation results show that the proposed methods have a better performance in energy consumption and lifetime of the network in comparison with similar methods.

An energy efficient clustering scheme by adjusting group size in zigbee environment (Zigbee 환경에서 그룹 크기 조정에 의한 에너지 효율적인 클러스터링 기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.342-348
    • /
    • 2010
  • The wireless sensor networks have been extensively researched. One of the issues in wireless sensor networks is a developing energy-efficient clustering protocol. Clustering algorithm provides an effective way to extend the lifetime of a wireless sensor networks. In this paper, we proposed an energy efficient clustering scheme by adjusting group size. In sensor network, the power consumption in data transmission between sensor nodes is strongly influenced by the distance of two nodes. And cluster size, that is the number of cluster member nodes, is also effected on energy consumption. Therefore we proposed the clustering scheme for high energy efficiency of entire sensor network by controlling cluster size according to the distance between cluster header and sink.

A Comparative Analysis on Performance of Wireless Sensor Networks Routing Protocols

  • KRISHNA, KONDA. HARI;NAGPAL, TAPSI;BABU, Y. SURESH
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.240-244
    • /
    • 2022
  • The common goals of designing a routing algorithm are not only to reduce control packet overhead, maximize throughput and minimize the end-to-end delay, but also take into consideration the energy consumption. Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSN's). Three metrics (power consumption, time of transmission and packet loss rate) are used in order to compare three routing protocols which are AODV, DSDV and LEACH.

Genetic Algorithm Based Routing Method for Efficient Data Transmission for Reliable Data Transmission in Sensor Networks (센서 네트워크에서 데이터 전송 보장을 위한 유전자 알고리즘 기반의 라우팅 방법)

  • Kim, Jin-Myoung;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.3
    • /
    • pp.49-56
    • /
    • 2007
  • There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

  • PDF

Modeling and Simulation of LEACH Protocol to Analyze DEVS Kernel-models in Sensor Networks

  • Nam, Su Man;Kim, Hwa Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.97-103
    • /
    • 2020
  • Wireless sensor networks collect and analyze sensing data in a variety of environments without human intervention. The sensor network changes its lifetime depending on routing protocols initially installed. In addition, it is difficult to modify the routing path during operating the network because sensors must consume a lot of energy resource. It is important to measure the network performance through simulation before building the sensor network into the real field. This paper proposes a WSN model for a low-energy adaptive clustering hierarchy protocol using DEVS kernel models. The proposed model is implemented with the sub models (i.e. broadcast model and controlled model) of the kernel model. Experimental results indicate that the broadcast model based WSN model showed lower CPU resource usage and higher message delivery than the broadcast model.

Research on An Energy Efficient Triangular Shape Routing Protocol based on Clusters (클러스터에 기반한 에너지 효율적 삼각모양 라우팅 프로토콜에 관한 연구)

  • Nurhayati, Nurhayati;Lee, Kyung-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.115-122
    • /
    • 2011
  • In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

An Energy Harvesting Aware Routing Algorithm for Hierarchical Clustering Wireless Sensor Networks

  • Tang, Chaowei;Tan, Qian;Han, Yanni;An, Wei;Li, Haibo;Tang, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.504-521
    • /
    • 2016
  • Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

A design on Light-Weight Key Exchange and Mutual Authentication Routing Protocol in Sensor Network Environments (센서네트워크 환경에서 경량화된 키 교환 및 상호인증 라우팅 프로토콜)

  • Lee, Kwang-Hyoung;Lee, Jae-Seung;Min, So-Yeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.11
    • /
    • pp.7541-7548
    • /
    • 2015
  • Wireless Sensor Networks is the technology which is used in explore role for military purposes, as well as various fields such as industrial equipment management, process management, and leverage available technologies by distributing node into various areas. but there are some limitations about energy, processing power, and memory storage capacity in wireless sensor networks environment, because of tiny hardware, so various routing protocols are proposed to overcome it. however existing routing protocols are very vulnerable in the intercommunication, because they focus on energy efficiency, and they can't use existing encryption for it, Because of sensor's limitations such like processing power and memory. Therefore, this paper propose mutual authentication scheme that prevent various security threats by using mutual authentication techniques and, Key generation and updating system as taking into account energy efficiency.

EL-SEP: Improved L-SEP by adding Single-hop layer

  • LEE, WooSuk;Jung, Kye-Dong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.6 no.1
    • /
    • pp.50-56
    • /
    • 2017
  • Wireless sensor nodes have limited energy, so it is important to optimize energy consumption to preserve network lifetime. Various protocols have been proposed for this purpose. LEACH protocol and SEP are the representative protocols. These protocols become less effective as the Sensor Field becomes wider. To improve this, MR-SEP and L-SEP were proposed. These protocols increase the energy efficiency by dividing the Sensor Field into layers and reducing the transmission distance. However, when dividing a layer, there are cases where it is divided inefficiently, and a node within a certain range from a Base Station has a better transmission efficiency than a direct transmission method using a cluster method. In this paper, we propose a Single-hop layer for L-SEP to improve inefficient layer division and near node transmission efficiency. When the larger the Sensor Field, the better the performance of the proposed method by up to 87%. The larger the sensor field, the more efficient the proposed method is over the conventional method. That is, the proposed method is suitable for the wide Sensor Field.

A Study on the Efficient ATICC(Adaptive Time Interval Clustering Control) Algorithm for MANET (MANET에서 효율적인 ATICC(Adaptive Time Interval Clustering Control) 알고리즘에 대한 연구)

  • Kim, Young-sam;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.306-309
    • /
    • 2009
  • MANET(Mobile Ad-hoc Network)은 기간망에 의존하지 않는 이동 노드들로 구성된 자율망 또는 추론망 토폴로지에 의한 멀티홉 무선 네트워크이다. MANET을 구성하는 각 노드의 이동성, 속도 그리고 에너지와 같은 다양한 속성정보는 망의 특징과 운영을 결정하는 요인이다. 특히 망의 운영상, 전송 대역폭과 에너지 사용에 따른 제약을 가지며 이러한 특징을 고려한 라우팅 프로토콜의 설계 및 하드웨어 개발이 중요하게 요구된다. 본 논문에서는 계층적 클러스터 구조의 MANET 환경에서 노드의 에너지 속성과 네트워크의 트래픽 상태를 고려한 적응적 시간차 노드관리 기법인 ATICC(Adaptive Time Interval Clustering Control)을 제안한다. 제안된 ATICC은 시간차 노드 관리기법인 TICC(Time Interval Clustering Control)[1]에 기반하며 노드에 최적화된 Active/Sleep, Idle Listening 상태를 적응적으로 설정한 후 패킷을 전송함으로서 계층적 클러스터 내의 각 노드의 균형적인 에너지 소모를 이루는 에너지 효율적인 방식이다. 제안한 노드관리 방법은 기존의 LEACH, TICC과 비교 실험하고 그 성능을 검증하였다. 실험 결과, 제안한 노드관리 방법이 노드별 에너지 소모량을 줄였으며 전체 네트워크의 생존시간을 연장함으로서 기존의 방법 보다 우수함을 확인하였다.

  • PDF