• Title/Summary/Keyword: 센서네트워크 클러스터링

Search Result 270, Processing Time 0.022 seconds

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

Efficient Distributed Broadcast Schemes using Sensor Networks in Road Network Environments (도로 네트워크 환경에서 센서 네트워크를 이용한 효율적인 분산 브로드캐스트 기법)

  • Jang, Yong-Jin;Lee, Jin-Ju;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.1
    • /
    • pp.26-33
    • /
    • 2011
  • In ubiquitous environments that numerous mobile objects exist, the location-based services have risen as an important application field. For efficient location-based services, various techniques with broadcast schemes have been studied. However, they were mainly concerned with the implementation of a broadcast index and did not consider techniques for reducing the size of the entire broadcast data. Therefore, this paper proposes a data distribution broadcast scheme based on sensor networks that considers the mobile patterns of an object in road network environments. In this paper we also propose a road network based sensor clustering technique for the efficiency of the proposed distributed broadcast scheme. In order to show the superiority of the proposed scheme, we compare it with the existing broadcast scheme in various environments.

A WSN(Wiress Sensor Network) Building Scheme using Clustering and Location information (클러스터링 및 위치 정보를 활용한 WSN(Wireless Sensor Network) 구성 방안)

  • Kim, Jinsoo;Kwon, Hyukjin;Shin, Dongkyoo;Hong, Sunghoon
    • Convergence Security Journal
    • /
    • v.20 no.3
    • /
    • pp.13-20
    • /
    • 2020
  • Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services that require continuous monitoring or services to specific areas where accesses are limited, has gradually increased due to their expansion of application areas and the improvement of the efficiency. Especially, in the defense field, researches on the latest IT technologies including sensor network areas are actively conducted as an alternative to avoid the risk factors that can be occurred when personnel are put in, such as boundary and surveillance reconnaissance and to utilize personnel efficiently. In this paper, we analyze the conditions for increasing the life span of sensing nodes that make up sensor network by applying clustering and location-based techniques and derived the factors for extending the life span of them. The derived factors include CH(Cluster Head) election scheme and optimal path selection from CH to BS(Base Station). We proposed final scheme using derived factors and verified it through simulation experiments.

A Statistical Detection Method to Detect Abnormal Cluster Head Election Attacks in Clustered Wireless Sensor Networks (클러스터 기반 WSN에서 비정상적인 클러스터 헤드 선출 공격에 대한 통계적 탐지 기법)

  • Kim, Sumin;Cho, Youngho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.6
    • /
    • pp.1165-1170
    • /
    • 2022
  • In WSNs, a clustering algorithm groups sensor nodes on a unit called cluster and periodically selects a cluster head (CH) that acts as a communication relay on behalf of nodes in each cluster for the purpose of energy conservation and relay efficiency. Meanwhile, attack techniques also have emerged to intervene in the CH election process through compromised nodes (inside attackers) and have a fatal impact on network operation. However, existing countermeasures such as encryption key-based methods against outside attackers have a limitation to defend against such inside attackers. Therefore, we propose a statistical detection method that detects abnormal CH election behaviors occurs in a WSN cluster. We design two attack methods (Selfish and Greedy attacks) and our proposed defense method in WSNs with two clustering algorithms and conduct experiments to validate our proposed defense method works well against those attacks.

Energy Efficient Two-Tier Routing Protocol for Wireless Sensor Networks (센서 네트워크에서 에너지 효율성을 고려한 two-tier 라우팅 프로토콜)

  • Ahn Eun-Chul;Lee Sung-Hyup;Cho You-Ze
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.103-112
    • /
    • 2006
  • Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.

A Clustering Scheme Considering the Structural Similarity of Metadata in Smartphone Sensing System (스마트폰 센싱에서 메타데이터의 구조적 유사도를 고려한 클러스터링 기법)

  • Min, Hong;Heo, Junyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.229-234
    • /
    • 2014
  • As association between sensor networks that collect environmental information by using numberous sensor nodes and smartphones that are equipped with various sensors, many applications understanding users' context have been developed to interact users and their environments. Collected data should be stored with XML formatted metadata containing semantic information to share the collected data. In case of distance based clustering schemes, the efficiency of data collection decreases because metadata files are extended and changed as the purpose of each system developer. In this paper, we proposed a clustering scheme considering the structural similarity of metadata to reduce clustering construction time and improve the similarity of metadata among member nodes in a cluster.

Energy/Distance Estimation-based and Distributed Selection/Migration of Cluster Heads in Wireless Sensor Networks (센서 네트워크의 에너지 및 거리 추정 기반 분산 클러스터 헤드 선정과 이주 방법)

  • Kim, Dong-Woo;Park, Jong-Ho;Lee, Tae-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.3 s.357
    • /
    • pp.18-25
    • /
    • 2007
  • In sensor networks, sensor nodes have limited computational capacity, power and memory. Thus energy efficiency is one of the most important requirements. How to extend the lifetime of wireless sensor networks has been widely discussed in recent years. However, one of the most effective approaches to cope with power conservation, network scalability, and load balancing is clustering technique. The function of a cluster head is to collect and route messages of all the nodes within its cluster. Cluster heads must be changed periodically for low energy consumption and load distribution. In this paper, we propose an energy-aware cluster head selection algorithm and Distance Estimation-based distributed Clustering Algorithm (DECA) in wireless sensor networks, which exchanges cluster heads for less energy consumption by distance estimation. Our simulation result shows that DECA can improve the system lifetime of sensor networks up to three times compared to the conventional scheme.

Design and Implementation of a Management Framework for Ubiquitous Sensor Networks Based on Clustering (클러스터링 기반 유비쿼터스 센서 네트워크 관리 프레임워크의 설계 및 구현)

  • Lee, Jong-Eon;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.174-183
    • /
    • 2008
  • In this paper we design and implement a sensor network management framework(SNMF) for ubiquitous sensor networks(USNs). The SNMF employs the policy-based management approach for the autonomous and energy-efficient management of USNs. Moreover, a new light-weight policy distribution protocol called TinyCOPS-PR is designed and USN PIB for low-level policy is also defined. This allows the high-level policies defined by an administrator to translate into the specific low-level policies. The low-level policies are executed on sensor nodes so it can fulfill the proper management actions. The sensor nodes that receive some policies from an administrator perform local management actions according to those policies. SNMF can therefore realize small energy consumption and bring long network lifetime. It can also manage USNs automatically with a minimum of human interference.

A Cluster-Based Top-k Query Processing Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 기반의 Top-k 질의 처리)

  • Yeo, Myung-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.306-313
    • /
    • 2009
  • Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

Data Direction Aware Clustering Method in Sensor Networks (데이터 전송방향을 고려한 센서네트워크 클러스터링 방법)

  • Jo, O-Hyoung;Kwon, Tae-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.721-727
    • /
    • 2009
  • Wireless Sensor Networks(WSN) make use of low cost and energy constrained sensor nodes. Thus, reaching the successful execution of its tasks with low energy consumption is one of the most important issues. The limitation of existing hierarchical algorithms is that many times the data are transmitted to the opposite direction to the sink. In this paper, DDACM (Data Direction Aware Clustering Method) is proposed. In this method, the nearest node to the sink is elected as cluster head, and when its energy level reaches a threshold value, the cluster head is reelected. We also make a comparison with LEACH showing how this method can reduce the energy consumption minimizing the reverse direction data transmission.