• Title/Summary/Keyword: LEACH Protocol

Search Result 145, Processing Time 0.022 seconds

A Secure, Hierarchical and Clustered Multipath Routing Protocol for Homogenous Wireless Sensor Networks: Based on the Numerical Taxonomy Technique

  • Hossein Jadidoleslamy
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.121-136
    • /
    • 2023
  • Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

An Analysis of Threshold-sensitive Variable Area Clustering protocol in Wireless Sensor Networks (무선 센서 네트워크 환경의 Threshold-sensitive 가변 영역 클러스터링 프로토콜에 관한 분석)

  • Choi, Dang-Min;Moh, Sang-Man;Chung, Il-Yang
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1609-1622
    • /
    • 2009
  • In wireless sensor networks, a clustering protocol is an efficient method to prolong network lifetime. In general, it results in more energy consumption at the cluster-head node. Hence, such a protocol must changes the cluster formation and cluster-head node in each round to prolong the network lifetime. But, this method also causes large amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new clustering algorithm. In this algorithm, we exclude duplicated data of adjacent nodes and transmits the threshold value. We define a group as the sensor nodes within close proximity of each other. In a group, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, group is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(group). In the group with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of group size. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

  • PDF

Energy Efficient Improved Routing Protocol based on Cluster for Wireless Sensor Networks (센서 네트워크에서 클러스터 기반 에너지 효율성을 고려한 개선된 라우팅 프로토콜)

  • Park, Yong-Min;Kim, Kyoung-Mok;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.1-7
    • /
    • 2008
  • The efficient node energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. Energy efficiency is an important factor of researches that efficient routing algorithm is needed in wireless sensor network. In this research, I consider some methods to utilize more efficiently the limited power resource of wireless sensor networks. The proposed algorithm is the sink first divides the network into several areas with hop counts and data transmission based on cluster ID. The performance of the proposed algorithm has been examined and evaluated with NS-2 simulator in terms of lifetime, amount of data and overhead.

ESBL: An Energy-Efficient Scheme by Balancing Load in Group Based WSNs

  • Mehmood, Amjad;Nouman, Muhammad;Umar, Muhammad Muneer;Song, Houbing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4883-4901
    • /
    • 2016
  • Energy efficiency in Wireless Sensor Networks (WSNs) is very appealing research area due to serious constrains on resources like storage, processing, and communication power of the sensor nodes. Due to limited capabilities of sensing nodes, such networks are composed of a large number of nodes. The higher number of nodes increases the overall performance in data collection from environment and transmission of packets among nodes. In such networks the nodes sense data and ultimately forward the information to a Base Station (BS). The main issues in WSNs revolve around energy consumption and delay in relaying of data. A lot of research work has been published in this area of achieving energy efficiency in the network. Various techniques have been proposed to divide such networks; like grid division of network, group based division, clustering, making logical layers of network, variable size clusters or groups and so on. In this paper a new technique of group based WSNs is proposed by using some features from recent published protocols i.e. "Energy-Efficient Multi-level and Distance Aware Clustering (EEMDC)" and "Energy-Efficient Multi-level and Distance Aware Clustering (EEUC)". The proposed work is not only energy-efficient but also minimizes the delay in relaying of data from the sensor nodes to BS. Simulation results show, that it outperforms LEACH protocol by 38%, EEMDC by 10% and EEUC by 13%.

A Study on the Efficient TICC(Time Interval Clustering Control) Algorithm using Attribute of Node (노드의 속성을 고려한 효율적인 TICC(Time Interval Clustering Control) 알고리즘에 관한 연구)

  • Kim, Young-Sam;Doo, Kyoung-Min;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1696-1702
    • /
    • 2008
  • A MANET(Mobile Ad-hoc Network) is a multi-hop routing protocol formed by a collection without the intervention of infrastructure. So the MANET also depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. Generally the various clustering technique and routing algorithm would have proposed for improving the energy efficiency. One of the popular approach methods is a cluster-based routing algorithm using in MANET. In this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC could be able to manage the clustering, re-configuration, maintenance and detection of Node in MANET. Furthermore, the results of modeling shown that Node's energy efficiency and lifetime are improved in MANET.