• 제목/요약/키워드: cluster heads

검색결과 134건 처리시간 0.03초

무선센서네트워크에서의 에너지 효율적인 재클러스터링 알고리즘 (An Energy Efficient Re-clustering Algorithm in Wireless Sensor Networks)

  • 박혜빈;정진우
    • 한국인터넷방송통신학회논문지
    • /
    • 제15권3호
    • /
    • pp.155-161
    • /
    • 2015
  • 무선 센서 네트워크에서 효율적인 에너지 소비는 매우 중요한 이슈이다. 해당 이슈에 대해서 최근 연구들에서는 클러스터 기반 라우팅 프로토콜들을 해법으로 제시하고 있다. 이러한 프로토콜에서는 클러스터 헤드의 에너지 고갈을 방지하기 위해 재클러스터링이 필요한데, 재클러스터링 과정에서 발생하는 오버헤드도 적지 않다. 지나치게 빈번한 재클러스터링으로 인한 오버헤드를 줄이기 위해서 본 연구에서는 클러스터 헤드와 에너지 임계값의 비교를 통해 재클러스터링의 빈도를 조절하는 알고리즘을 제안하였다. 클러스터 헤드가 에너지 임계값보다 높은 에너지 수준을 가지고 있을 경우 클러스터를 유지하여 재클러스터링으로 인한 오버헤드를 줄였고, 낮을 경우 재클러스터링을 하여, 클러스터 헤드의 수명을 최대한 연장하였다. 제안한 알고리즘을 시뮬레이션을 통해 평가하여 기존 알고리즘 대비 우수한 에너지 효율을 가지는 것을 확인하였다.

클러스터 기반의 무선 센서 네트워크에서 에너지 효율을 높이기 위한 전송 알고리즘 (A Transmission Algorithm to Improve Energy Efficiency in Cluster based Wireless Sensor Networks)

  • 이동호;장길웅
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2016년도 춘계학술대회
    • /
    • pp.645-648
    • /
    • 2016
  • 클러스터 기반의 무선 센서 네트워크에서는 클러스터 헤드가 센서 노드로부터 데이터를 수집하고 집약하여 싱크 노드로 전송하는 특징을 가진다. 또한 같은 지역 내에 배치된 서로 이웃한 인접 센서 노드 간에는 유사한 데이터를 센싱하는 특성을 가진다. 이러한 두 가지의 특징을 이용하여 본 논문에서는 클러스터 기반의 무선 센서 네트워크에서 에너지 효율을 높이기 위한 전송 알고리즘을 제안한다. 하나의 인접한 이웃 노드는 쌍을 형성하고 쌍을 형성한 두 노드는 한 라운드 동안 하나씩 교대로 센싱한다. 또한, 하나의 클러스터 내에는 두 개의 클러스터를 설정하고 교대로 노드로부터 데이터를 수집하여 싱크 노드로 데이터를 전송한다. 본 논문에서는 에너지 효율을 높이기 위한 전송 라운딩 방식과 전송 프레임을 기술하고 기존 방식과 비교한다. 제안된 알고리즘의 성능을 평가하기 위해 컴퓨터 시뮬레이션을 수행하고 기존의 클러스터 방식인 LEACH 알고리즘과 비교하여 에너지 효율 관점에서 성능이 우수함을 보인다.

  • PDF

Blockchain-based IoT Authentication techniques for DDoS Attacks

  • Choi, Wonseok;Kim, Sungsoo
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권7호
    • /
    • pp.87-91
    • /
    • 2019
  • In the IoT(Internet of Things) environment, various devices are utilized and applied for different sites. But attackers can access easy to IoT systems, and try to operate DDoS(Distributed Denial-of-Service) attacks. In this paper, Sensor nodes, Cluster heads, and Gateways operates lightweight mutual authentication each others. Since authenticated sensor nodes and cluster heads only send transactions to Gateways, proposed techniques prevent DDoS attacks. In addition, the blockchain system contains secure keys to decrypt data from sensor nodes. Therefore, attackers can not decrypt the data even if the data is eavesdropped.

Dual-hop Routing Protocol for Improvement of Energy Consumption in Layered WSN Sensor Field

  • Song, Young-Il;LEE, WooSuk;Kwon, Oh Seok;Jung, KyeDong;Lee, Jong-Yong
    • International Journal of Advanced Culture Technology
    • /
    • 제4권2호
    • /
    • pp.27-33
    • /
    • 2016
  • This paper proposes to increase the node energy efficiency, which rapidly drops during the transmission of L-TEEN (Layered Threshold sensitive Energy Efficient sensor Network protocol), using the method of DL-TEEN (Dual-hop Layered TEEN). 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-TEEN, 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 L-TEEN, it was adapted to a wider sensor field.

Hierarchical WSN Dual-hop Routing Protocol for Improvement of Energy Consumption

  • Park, SeaYoung;LEE, WooSuk;Kwon, Oh Seok;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • 제5권2호
    • /
    • pp.24-37
    • /
    • 2016
  • This paper proposes to increase the efficiency of energy in nodes, which rapidly drops during the transmission of the Low Energy Adaptive Clustering Hierarchy (LEACH), through the use of dual-hop layered application in the sensor field. Along with introducing the 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 were also introduced. Additionally, 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 used. In the proposed DL-LEACH, the energy consumption of the cluster head for remote transmission reduced, as well as increased the energy efficiency of the sensor node by reducing the transmission distance and simplifying the transmission route for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

무선 센서 네트워크를 위한 에너지 효율적인 계층적 클러스터링 알고리즘 (An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks)

  • 차시호;이종언;최석만
    • 디지털산업정보학회논문지
    • /
    • 제4권2호
    • /
    • pp.29-37
    • /
    • 2008
  • Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes a hierarchical clustering algorithm called EEHC which is more energy efficient than existing algorithms for WSNs, It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, EEHC clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of EEHC, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for organizing and managing WSNs comparing it with existing algorithms.

An Efficient Cluster Based Service Discovery Model for Mobile Ad hoc Network

  • Buvana, M.;Suganthi, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권2호
    • /
    • pp.680-699
    • /
    • 2015
  • The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

Secure Cluster Selection in Autonomous Vehicular Networks

  • Mohammed, Alkhathami
    • International Journal of Computer Science & Network Security
    • /
    • 제23권1호
    • /
    • pp.11-16
    • /
    • 2023
  • Vehicular networks are part of the next generation wireless and smart Intelligent Transportation Systems (ITS). In the future, autonomous vehicles will be an integral part of ITS and will provide safe and reliable traveling features to the users. The reliability and security of data transmission in vehicular networks has been a challenging task. To manage data transmission in vehicular networks, road networks are divided into clusters and a cluster head is selected to handle the data. The selection of cluster heads is a challenge as vehicles are mobile and their connectivity is dynamically changing. In this paper, a novel secure cluster head selection algorithm is proposed for secure and reliable data sharing. The idea is to use the secrecy rate of each vehicle in the cluster and adaptively select the most secure vehicle as the cluster head. Simulation results show that the proposed scheme improves the reliability and security of the transmission significantly.

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

  • Encarnacion, Nico N.;Yang, Hyunho
    • Journal of information and communication convergence engineering
    • /
    • 제10권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.

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
    • /
    • 제21권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.