• Title/Summary/Keyword: Cluster Header

Search Result 73, Processing Time 0.029 seconds

Uniform Sensor-node Request Scheme for the Recovery of Sensing Holes on IoT Network (IoT 네트워크의 센싱홀 복구를 위한 센서 이동 균등 요청 방법)

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.16 no.4
    • /
    • pp.9-17
    • /
    • 2020
  • When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.

An Efficient Cluster Header Election Technique in Zigbee Environments (Zigbee환경에서 효율적인 Cluster Header 선출 기법)

  • Lee, Joo-Hyun;Lee, Kyung-Hwa;Lee, Jun-Bok;Shin, Yong-Tae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.346-350
    • /
    • 2010
  • Since sensor nodes have restriction of using resources in Zigbee network, number of study on improving efficiency is currently ongoing[1]. Clustering mechanism based on hierarchy structure provides a prevention of duplicated information and a facility of a network expansion[2]. however overheads can occurs when the cluster header is elected and the election of a incorrect cluster header causes to use resources inefficiently. In this paper, we propose that the cluster header election mechanism using distances between nodes and density of nodes in accordance with the operation of the central processing system in which the sync nodes are having information of location and energy with respect to general nodes based on hierachy clustering mechanism.

A Cluster-Header Selecting Method for more Secure and Energy-Efficient in Wireless Sensor Network (무선 센서 네트워크에서 안전하고 에너지 효율적인 클러스터 헤더 선출 기법)

  • Kim, Jin-Mook;Lee, Pung-Ho;Ryou, Hwang-Bin
    • Convergence Security Journal
    • /
    • v.7 no.2
    • /
    • pp.107-118
    • /
    • 2007
  • Distributed wireless sensor network in various environment have characteristic that is surveillance of environment-element and offering usefully military information but there is shortcoming that have some secure risks. Therefore secure service must be required for this sensor network safety. More safe and effective techniques of node administration are required for safe communication between each node. This paper proposes effective cluster-header and clustering techniques in suitable administration techniques of group-key on sensor network. In this paper, first each node transmit residual electric power and authentication message to BS (Base-Station). BS reflects "Validity Authentication Rate" and residual electric power. And it selects node that is more than these regularity values by cluster header. After BS broadcasts information about cluster header in safety and it transmits making a list of information about cluster member node to cluster header. Also, Every rounds it reflects and accumulates "Validity Authentication Rate" of former round. Finally, BS can select more secure cluster header.

  • PDF

STO-based Cluster Header Election Algorithm (STO 기반 클러스터 헤더 선출 알고리즘)

  • Yoon, Jeong-Hyeon;Lee, Heon-Guk;Kim, Seung-Ku
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.587-590
    • /
    • 2019
  • This paper is about to improve the network life's reduction due to the deviation of sensor node and frequently change of network, the main problem of sensor network. The existing Scalable Topology Organization(STO)-based ZigBee Tree Topology Control Algorithm did not consider ways to consume power so the network lifetime is too short. Accordingly, per each round, electing a new parent node and consisting of the new network topology technique, The Cluster Header Selection, extending the network's overall lifetime. The OMNet++ Simulator yielded results from the existing STO Algorithm and the proposed Cluster Header Selection Technique in the same experimental environment, which resulted in an increase in overall network life by about 40% and an improvement of about 10% in performance in the remaining portion of the battery.

  • PDF

Efficient Energy management through Relay-Transsmission and Cluster Division in Wireless Sensor Network (무선 센서네트워크에서 중계전송과 클러스터 분할법을 사용한 효율적인 에너지 관리)

  • Kim, Jae-Sueng;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.401-405
    • /
    • 2007
  • In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

  • PDF

Relay Cooperative Transmission Scheme for Distributed MAC Protocol-Based Logistic Applications (분산적인 매체접근제어(MAC) 프로토콜 기반 물류 시스템을 위한 릴레이 협력통신 방안)

  • Joo, Yang-Ick;Hur, Kyeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.3
    • /
    • pp.423-432
    • /
    • 2011
  • In a warehouse, because there exist frequent changes of stock status and the quality of some contents are influenced by the environment such as temperature, fast and accurate management of the warehouse's environment is very important for Warehouse Management Systems (WMS). However, due to the absence of a unified standard for the communication protocol between RFID nodes, the connection between RFID nodes can be broken in case of movement of a RFID reader to a region with a different protocol. Moreover, centralized MAC schemes for RFID communications in previous studies have severe problems. For an example, if a cluster header disappears from the cluster due to the cluster header's movement or bad channel conditions, the RFID member nodes of the cluster waste lots of time and energy to re-elect a new cluster header. Therefore, in this paper, we propose a WiMedia Distributed MAC (D-MAC) scheme for RFID communications and its cooperative relay transmission scheme for WMS applications Simulation results show performance improvement at the RFID node by using the proposed cooperative relay transmission scheme.

An Improvement of Fault Tolerant for Routing using Secondary Header in CBRP (CBRP에서 보조헤더를 이용한 라우팅 고장 극복 개선)

  • 허태성;이균하
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.7
    • /
    • pp.983-996
    • /
    • 2001
  • Mobile Ad Hoc Network (MANET) is a network architecture which has no backborn network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the Secondary Header approach to the cluster based routing protocol (CBRP). In case, the main header becomes abnormal status so that the main header can not participate the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. The performances of proposed algorithm CBRP-SH(Cluster Based Routing Protocol using Secondary Header) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

  • PDF

Strong Connection Clustering Scheme for Shortest Distance Multi-hop Transmission in Mobile Sensor Networks (모바일 센서 네트워크에서 최단거리 멀티홉 전송을 위한 강한연결 클러스터 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.6
    • /
    • pp.667-677
    • /
    • 2018
  • Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

Cluster-Based Node Management Algorithm for Energy Consumption Monitoring in Wireless Mobile Ad Hoc Networks (무선 모바일 애드혹 네트워크상에서 에너지 소모 감시를 위한 클러스터 기반의 노드 관리 알고리즘)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.14 no.9
    • /
    • pp.309-315
    • /
    • 2016
  • The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

Clustering Technique of Intelligent Distance Estimation for Mobile Ad-hoc Network (이동 Ad-hoc 통신을 위한 지능형 거리추정 클러스터방식)

  • Park, Ki-Hong;Shin, Seong-Yoon;Rhee, Yang-Won;Lee, Jong-Chan;Lee, Jin-Kwan;Jang, Hye-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.105-111
    • /
    • 2009
  • The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.