• Title/Summary/Keyword: Cluster head

Search Result 430, Processing Time 0.019 seconds

Improvement of cluster head selection method in L-SEP

  • Jin, Seung Yeon;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.51-58
    • /
    • 2017
  • This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

Opportunity Coefficient for Cluster-Head Selection in LEACH Protocol

  • Soh, Ben;AlZain, Mohammed;Lozano-Claros, Diego;Adhikari, Basanta
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.6-11
    • /
    • 2021
  • Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

Avoiding Energy Holes Problem using Load Balancing Approach in Wireless Sensor Network

  • Bhagyalakshmi, Lakshminarayanan;Murugan, Krishanan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1618-1637
    • /
    • 2014
  • Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

A Two level Detection of Routing layer attacks in Hierarchical Wireless Sensor Networks using learning based energy prediction

  • Katiravan, Jeevaa;N, Duraipandian;N, Dharini
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4644-4661
    • /
    • 2015
  • Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

Secure and Energy Efficient Protocol based on Cluster for Wireless Sensor Networks (무선 센서 네트워크에서 안전하고 에너지 효율적인 클러스터 기반 프로토콜)

  • Kim, Jin-Su;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.14-24
    • /
    • 2010
  • Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

Cluster Head Selection Protocol Using Modified Setup Phase (변형된 셋업 단계를 이용한 클러스터 헤드 선출 프로토콜)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.167-176
    • /
    • 2009
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

ECS : Energy efficient Cluster-head Selection algorithm in Wireless Sensor Network (무선 센서 네트워크에서의 에너지 효율적인 클러스터 헤드 선출 알고리즘)

  • Choi, Koung-Jin;Yun, Myung-Jun;Sim, In-Bo;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6B
    • /
    • pp.342-349
    • /
    • 2007
  • Clustering protocol of Wireless sensor networks(WSNs) not only reducing the volume of inter-node communication by the nodes's data aggreation but also extending the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend network lifetime of WSNs, we propose ECS algorithm to select cluster-head using three variables. It consists of initial and current energy of nodes, round information and total numbers which have been selected as cluster head until current round.

Development of Energy-sensitive Cluster Formation and Cluster Head Selection Technique for Large and Randomly Deployed WSNs

  • Sagun Subedi;Sang Il Lee
    • Journal of information and communication convergence engineering
    • /
    • v.22 no.1
    • /
    • pp.1-6
    • /
    • 2024
  • Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

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 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.