• Title/Summary/Keyword: Cluster Protocol

Search Result 360, Processing Time 0.023 seconds

Energy Efficient Cluster Routing Method Using Machine Learning in WSN (무선 센서 네트워크에서의 머신러닝을 활용한 에너지 효율적인 클러스터 라우팅 방안 연구)

  • Mi-Young, Kang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.124-130
    • /
    • 2023
  • In this paper, we intend to improve the network lifetime by improving the energy efficiency of sensor nodes in a wireless sensor network by utilizing machine learning using K-means clustering algorithm. A wireless sensor network is a wireless network composed of physical devices including batteries as physical sensors. Due to the characteristics of sensor nodes, all resources must be efficiently used to minimize energy consumption to maximize network lifetime. A cluster based approach is used to manage groups of relatively large numbers of nodes. In the proposed protocol, by improving the existing LEACH algorithm, we propose a clustering algorithm that selects a cluster head using a cluster based approach and a location based approach. The performance results to be improved were measured using Matlab simulation. Through the experimental results, K-means clustering was applied to the energy efficiency part. By utilizing K-means, it is confirmed that energy efficiency is improved and the lifetime of the entire network is extended.

Improved Ad Hoc On-demand Distance Vector Routing(AODV) Protocol Based on Blockchain Node Detection in Ad Hoc Networks

  • Yan, Shuailing;Chung, Yeongjee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.46-55
    • /
    • 2020
  • Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

Design Self-Organization Routing Protocol for supporting Data Security in Healthcare Sensor Network (헬스케어 센서 네트워크에서 데이터 보안을 지원한 자기구성 라우팅 프로토콜 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.517-520
    • /
    • 2008
  • Wireless sensor network supporting healthcare environment should provide customized service in accordance with context information such as continuous location change and status information for people or movable object. In addition, we should consider data transmission guarantees a person's bio information and privacy security provided through sensor network. In this paper analyzes LEACH protocol which guarantees the dynamic self-configuration, energy efficiency through configuration of inter-node hierarchical cluster between nodes and key distribution protocol used for security for data transmission between nodes. Based on this analysis result, we suggested self-configuration routing protocol supporting node mobility which is weakness of the existing LEACH protocol and data transmission method by applying key-pool pre-distribution method whose memory consumption is low, cluster unit public key method to sensor node.

  • PDF

Context-Aware Mobile Gateway Relocation Scheme for Clustered Wireless Sensor Networks

  • Encarnacion, Nico N.;Yang, Hyunho
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.365-371
    • /
    • 2012
  • In recent years, researchers have been attracted to clustering methods to improve communication and data transmission in a network. Compared with traditional wireless networks, wireless sensor networks are energy constrained and have lower data rates. The concept of implementing a clustering algorithm in an existing project on gateway relocation is being explored here. Low energy adaptive clustering hierarchy (LEACH) is applied to an existing study on relocating a gateway. The study is further improved by moving the gateway to a specific cluster based on the number or significance of the events detected. The protocol is improved so that each cluster head can communicate with a mobile gateway. The cluster heads are the only nodes that can communicate with the mobile gateway when it (the mobile gateway) is out of the cluster nodes' transmission range. Once the gateway is in range, the nodes will begin their transmission of real-time data. This alleviates the load of the nodes that would be located closest to the gateway if it were static.

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.

CHS : Cluster Head Self-election algorithm in WSNs (센서 네트워크에서 클러스터 헤드 자가 선출 알고리즘)

  • Choi, Koung-Jin;Jung, Suk-Moon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.534-537
    • /
    • 2009
  • Clustering protocol of Wireless sensor networks(WSNs) can not only reduce the volume of inter-node communication by the nodes's data aggregation but also extend the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend the network lifetime of WSNs, we propose CHS 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.

  • PDF

Dual Super Cluster Head Underwater Sensor Network Routing Protocol (듀얼 슈퍼 클러스터 헤드 해양 센서 네트워크 라우팅 프로토콜)

  • Chang, Young-Il;Shin, Soo-Young;Prak, Hyun-Mun;Park, Soo-Huyn
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.87-96
    • /
    • 2006
  • Wireless Sensor Network (WSN) is researched in various filed. Underwater Sensor Network (UWSN) is used various purpose such as underwater environment monitoring. But, WSN is researched in the terrestrial that uses mainly radio frequency, The existing terrestrial research is incongruent to apply to underwater. Therefore, we propose UWSN architecture that considers underwater environment. In this paper, UWSN applied cluster technique and functional node constructs. Each cluster collects and sends cluster data. Dual super cluster head receives cluster data and transmits each in the base-station. We implement WSN routing algorithm, and construct test-bed and analyze cluster data receive rate.

  • PDF

Secure Key Predistribution Scheme using Authentication in Cluster-based Routing Method (클러스터 기반에서의 인증을 통한 안전한 키 관리 기법)

  • Kim, Jin-Su;Choi, Seong-Yong;Jung, Kyung-Yong;Ryu, Joong-Kyung;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.9
    • /
    • pp.105-113
    • /
    • 2009
  • The previous key management methods are not appropriate for secure data communication in cluster-based routing scheme. Because cluster heads are elected in every round and communicate with the member nodes for authentication and share-key establishment phase in the cluster. In addition, there are not considered to mobility of nodes in previous key management mechanisms. In this paper, we propose the secure and effective key management mechanisim in the cluster-based routing scheme that if there are no share keys between cluster head and its nodes, we create the cluster key using authentication with base station or trust autentication and exchange the their information for a round.

A many-objective optimization WSN energy balance model

  • Wu, Di;Geng, Shaojin;Cai, Xingjuan;Zhang, Guoyou;Xue, Fei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.514-537
    • /
    • 2020
  • Wireless sensor network (WSN) is a distributed network composed of many sensory nodes. It is precisely due to the clustering unevenness and cluster head election randomness that the energy consumption of WSN is excessive. Therefore, a many-objective optimization WSN energy balance model is proposed for the first time in the clustering stage of LEACH protocol. The four objective is considered that the cluster distance, the sink node distance, the overall energy consumption of the network and the network energy consumption balance to select the cluster head, which to better balance the energy consumption of the WSN network and extend the network lifetime. A many-objective optimization algorithm to optimize the model (LEACH-ABF) is designed, which combines adaptive balanced function strategy with penalty-based boundary selection intersection strategy to optimize the clustering method of LEACH. The experimental results show that LEACH-ABF can balance network energy consumption effectively and extend the network lifetime when compared with other algorithms.

Maximizing Information Transmission for Energy Harvesting Sensor Networks by an Uneven Clustering Protocol and Energy Management

  • Ge, Yujia;Nan, Yurong;Chen, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1419-1436
    • /
    • 2020
  • For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.