• Title/Summary/Keyword: cluster heads

Search Result 135, Processing Time 0.027 seconds

An Energy Efficient Election Method of Backup Cluster Heads Using Fuzzy Logic in Wireless Sensor Networks (WSN에서 퍼지이론기반 에너지 효율적인 백업 클러스터 헤드 선출방법)

  • Kim, Taewan;Jeon, Seongmin;Lee, Seong Ho;Park, Huiman;Lee, Yeonwoo;Jung, Min-a;Lee, Seong Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.1030-1032
    • /
    • 2012
  • 클러스터 기반 라우팅 방법에서 클러스터 헤드에 고장이 발생하면, 전달되지 못하는 센서 데이터가 존재한다. 이를 해결하기 위해 각 클러스터마다 백업 클러스터 헤드를 지정함으로써 원래의 클러스터 헤드에 고장이 발생했을 때 백업 클러스터 헤드가 그 역할을 대신하도록 하는 방법이 연구되고 있다. 백업 클러스터 헤드를 이용한 방법에서는 어떤 노드를 백업 클러스터 헤드로 선출하느냐에 따라 무선센서네트워크의 성능이 좌우된다. 따라서, 본 논문에서는 무선센서네트워크의 에너지 효율성을 높이기 위해 퍼지를 이용하여 각 클러스터의 백업 클러스터 헤드를 선출하는 방법을 제안한다.

Design of the Fuzzy-based Mobile Model for Energy Efficiency within a Wireless Sensor Network

  • Yun, Dai Yeol;Lee, Daesung
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.3
    • /
    • pp.136-141
    • /
    • 2021
  • Research on wireless sensor networks has focused on the monitoring and characterization of large-scale physical environments and the tracking of various environmental or physical conditions, such as temperature, pressure, and wind speed. We propose a stochastic mobility model that can be applied to a MANET (Mobile Ad-hoc NETwork). environment, and apply this mobility model to a newly proposed clustering-based routing protocol. To verify its stability and durability, we compared the proposed stochastic mobility model with a random model in terms of energy efficiency. The FND (First Node Dead) was measured and compared to verify the performance of the newly designed protocol. In this paper, we describe the proposed mobility model, quantify the changes to the mobile environment, and detail the selection of cluster heads and clusters formed using a fuzzy inference system. After the clusters are configured, the collected data are sent to a base station. Studies on clustering-based routing protocols and stochastic mobility models for MANET applications have shown that these strategies improve the energy efficiency of a network.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

An Energy-Efficient Topology Control Scheme based on Application Layer Data in Wireless Sensor Networks (응용 계층 정보 기반의 에너지 효율적인 센서 네트워크 토폴로지 제어 기법)

  • Kim, Seung-Mok;Kim, Seung-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1297-1308
    • /
    • 2009
  • The life time of a wireless sensor network composed of numerous sensor nodes depend on ones of its sensor nodes. The energy efficiency operation of nodes, therefore, is one of the crucial factors to design the network. Researches based on the hierarchical network topology have been proposed and evolved in terms of energy efficiency. However, in existing researches, application layer data obtained from sensor nodes are not considered properly to compose cluster, including issue that nodes communicate with their cluster heads in TDMA scheduling. In this paper, we suggest an energy-efficient topology control scheme based on application layer data in wireless sensor networks. By using application layer data, sensor nodes form a section which is defined as the area of adjacent nodes that retain similar characteristics of application environments. These sections are further organized into clusters. We suggest an algorithm for selecting a cluster head as well as a way of scheduling to reduce the number of unnecessary transmissions from each node to its cluster head, which based on the degree and the duration of similarity between the node's data and its head's data in each cluster without seriously damaging the integrity of application data. The results show that the suggested scheme can save the energy of nodes and increase the life time of the entire network.

  • PDF

A New Routing Algorithm for Performance improvement of Wireless Sensor Networks (무선 센서 네트워크의 성능 향상을 위한 새로운 라우팅 알고리즘)

  • Yang, Hyun-Suk;Kim, Do-Hyung;Park, Joon-Yeol;Lee, Tae-Bong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.1
    • /
    • pp.39-45
    • /
    • 2012
  • In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.

A Resilient Key Renewal Scheme in Wireless Sensor Networks (센서 네트워크에서 복원력을 지닌 키갱신 방안)

  • Wang, Gi-Cheol;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.103-112
    • /
    • 2010
  • In sensor networks, because sensors are deployed in an unprotected environment, they are prone to be targets of compromise attack, If the number of compromised nodes increases considerably, the key management in the network is paralyzed. In particular, compromise of Cluster Heads (CHs) in clustered sensor networks is much more threatening than that of normalsensors. Recently, rekeying schemes which update the exposed keys using the keys unknown to the compromised nodes are emerging. However, they cause some security and efficiency problems such as single group key employment in a cluster, passive eviction of compromised nodes, and excessive communication and computation overhead. In this paper, we present a proactive rekeying scheme using renewals of duster organization for clustered sensor networks. In the proposed scheme, each sensor establishes individual keys with neighbors at network boot-up time, and these keys are employed for later transmissions between sensors and their CH. By the periodic cluster reorganization, the compromised nodes are expelled from network and the individual keys employed in a cluster are changed continuously. Besides, newly elected CHs securely agree a key with sink by informing their members to sink, without exchangingany keying materials. The simulation results shows that the proposed scheme remarkably improves the confidentiality and integrity of data in spite of the increase of compromised nodes. Also, they show that the proposed scheme exploits the precious energy resource more efficiently than SHELL.

Lifetime-based Clustering Communication Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 잔여 수명 기반 클러스터링 통신 프로토콜)

  • Jang, Beakcheol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2370-2375
    • /
    • 2014
  • Wireless sensor networks (WSNs) have a big potential for distributed sensing for large geographical area. The improvement of the lifetime of WSNs is the important research topic because it is considered to be difficult to change batteries of sensor nodes. Clustering communication protocols are energy-efficient because each sensor node can send its packet to the cluster head near from itself rather than the sink far from itself. In this paper, we present an energy-efficient clustering communication protocol, which chooses cluster heads based on the expected residual lifetime of each sensor node. Simulation results show that our proposed scheme increases average lifetimes of sensor nodes as much as 20% to 30% in terms of the traffic quantity and as much as 30% to 40% in terms of the scalability compared to the existing clustering communication protocol, LEACH.

Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks (주변 노드 발견을 통한 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 및 전력 균형 분산 기법)

  • Choi, Ji-Young;Kang, Chung-Gu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1147-1158
    • /
    • 2006
  • Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.

A Study on Intrusion Detection Method using Collaborative Technique (협업 기법을 이용한 침입탐지 탐지 방법에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.121-127
    • /
    • 2021
  • MANET, which does not have any infrastructure other than wireless nodes, has the advantage of being able to construct a fast network. However, the movement of nodes and wireless media are also the causes of security vulnerabilities of MANET. In particular, the damage caused by the attacking nodes existing on the network is considerably greater than that of other networks. Therefore, it is necessary to detection technique for attacking nodes and techniques to reduce damage caused by attacks. In this paper, we proposed a hierarchical structure technique to increase the efficiency of intrusion detection and collaboration-based intrusion detection technique applying a P2P mesh network configuration technique to reduce damage caused by attacks. There was excluded the network participation of the attacking node in advance through the reliability evaluation of the nodes in the cluster. In addition, when an attack by an attacking node is detected, this paper was applied a method of minimizing the damage of the attacking node by transmitting quickly the attack node information to the global network through the P2P mesh network between cluster heads. The ns-2 simulator was used to evaluate the performance of the proposed technique, and the excellent performance of the proposed technique was confirmed through comparative experiments.

Improving Data Accuracy Using Proactive Correlated Fuzzy System in Wireless Sensor Networks

  • Barakkath Nisha, U;Uma Maheswari, N;Venkatesh, R;Yasir Abdullah, R
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3515-3538
    • /
    • 2015
  • Data accuracy can be increased by detecting and removing the incorrect data generated in wireless sensor networks. By increasing the data accuracy, network lifetime can be increased parallel. Network lifetime or operational time is the time during which WSN is able to fulfill its tasks by using microcontroller with on-chip memory radio transceivers, albeit distributed sensor nodes send summary of their data to their cluster heads, which reduce energy consumption gradually. In this paper a powerful algorithm using proactive fuzzy system is proposed and it is a mixture of fuzzy logic with comparative correlation techniques that ensure high data accuracy by detecting incorrect data in distributed wireless sensor networks. This proposed system is implemented in two phases there, the first phase creates input space partitioning by using robust fuzzy c means clustering and the second phase detects incorrect data and removes it completely. Experimental result makes transparent of combined correlated fuzzy system (CCFS) which detects faulty readings with greater accuracy (99.21%) than the existing one (98.33%) along with low false alarm rate.