• Title/Summary/Keyword: cluster heads

Search Result 136, Processing Time 0.019 seconds

A Study on Improved Intrusion Detection Technique Using Distributed Monitoring in Mobile Ad Hoc Network (Mobile Ad Hoc Network에서 분산 모니터링을 이용한 향상된 침입탐지 기법 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.1
    • /
    • pp.35-43
    • /
    • 2018
  • MANET composed of only wireless nodes is increasingly utilized in various fields. However, it is exposed to many security vulnerabilities because it doesn't have any infrastructure and transmits data by using multi-hop method. Therefore, MANET should be applied the intrusion detection technique that can detect efficiently malicious nodes and decrease impacts of various attacks. In this paper, we propose a distributed intrusion detection technique that can detect the various attacks while improving the efficiency of attack detection and reducing the false positive rate. The proposed technique uses the cluster structure to manage the information in the center and monitor the traffic of their neighbor nodes directly in all nodes. We use three parameters for attack detection. We also applied an efficient authentication technique using only key exchange without the help of CA in order to provide integrity when exchanging information between cluster heads. This makes it possible to free the forgery of information about trust information of the nodes and attack nodes. The superiority of the proposed technique can be confirmed through comparative experiments with existing intrusion detection techniques.

An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks (무선 센서 네트워크에서 중첩 방지를 고려한 효율적인 클러스터링 기법)

  • Choi, Hoon;Jung, Yeon-Su;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.253-259
    • /
    • 2008
  • Because a sensor node in wireless sensor networks is battery operated and energy constrained, reducing energy consumption of each node is one of important issues. The clustering technique can make network topology be hierarchical and reduce energy consumption of each sensor node. In this paper, we propose an efficient clustering mechanism considering overlap avoidance in wireless sensor networks. The proposed method consists of three parts. The first is to elect cluster heads considering each node's energy. Then clusters are formed by using signal strength in the second phase. Finally we can reduce the cluster overlap problem derived from two or more clusters. In addition, this paper includes performance evaluation of our algorithm. Simulation results show that network lifetime was extended up to 75 percents than LEACH and overlapped clusters are decreased down to nearly zero percents.

Bayesian Rules Based Optimal Defense Strategies for Clustered WSNs

  • Zhou, Weiwei;Yu, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5819-5840
    • /
    • 2018
  • Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

Dynamism Competent LEACH Replication Deliberate for Wireless Sensor Network

  • KONDA HARI KRISHNA;TAPSI NAGPAL;Y. SURESH BABU
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.5
    • /
    • pp.7-12
    • /
    • 2023
  • Remote sensor systems are utilized in a few applications, including military, restorative, ecological and family unit. In every one of these applications, vitality use is the deciding component in the execution of wireless sensor systems. Thusly, strategies for information steering and exchanging to the base station are critical in light of the fact that the sensor hubs keep running on battery control and the vitality accessible for sensors is constrained. There are two explanations for the various leveled directing Low Energy Adaptive Clustering Hierarchy convention be in investigated. One, the sensor systems are thick and a considerable measure of excess is engaged with correspondence. Second, with a specific end goal to build the versatility of the sensor arrange remembering the security parts of correspondence. In this exploration paper usage of LEACH steering convention utilizing NS2 test system lastly upgraded vitality productive EE-LEACH directing convention guarantees that the chose cluster heads will be consistently conveyed over the system with a specific end goal to enhance the execution of the LEACH convention. EE-LEACH enhances vitality utilization by around 43%.

A Study on Reliable Multicast Transmission using Recovery Cluster (복구 클러스터를 이용한 신뢰성 있는 멀티캐스트 전송에 관한 연구)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.11
    • /
    • pp.1-6
    • /
    • 2019
  • Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

An Energy Aware Network Construction and Routing Method for Wireless Sensor Network (무선센서네트워크를 위한 에너지 인지형 네트워크 구성 및 라우팅 기법)

  • Hosen, A.S.M. Sanwar;Lee, Hyeak-Ro;Cho, Gi-Hawn
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.225-234
    • /
    • 2012
  • In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

Location Based Load Balancing Method for Cluster Routing in Wireless Sensor Networks (무선 센서 네트워크의 클러스터 라우팅에서 위치기반 부하 균등화 기법)

  • Yoo, Woo Sung;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.942-949
    • /
    • 2016
  • Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

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

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.185-190
    • /
    • 2007
  • The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.

Security Scheme for Prevent malicious Nodes in WiMAX Environment (노드간 에너지 소비를 효율적으로 분산시킨 PRML 메커니즘)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Nam-Kyu;Park, Gil-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.774-784
    • /
    • 2009
  • A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. To improve the sensitivity of wireless sensor networks, an efficient scheduling algorithm and energy management technology for minimizing the energy consumption at each node is desired. ill this paper, we propose energy-aware routing mechanism for maximum lifetime and to optimize the solution quality for sensor network maintenance and to relay node from its adjacent cluster heads according to the node"s residual energy and its distance to the base station. Proposed protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of where the sink is located outside or inside the cluster. Simulation results of proposed scheme show that our mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. To verify propriety using NS-2, proposed scheme constructs sensor networks adapt to current model and evaluate consumption of total energy, energy consumption of cluster head, average energy dissipation over varying network areas with HEED and LEACH-C.

An Energy-Efficient Clustering Protocol Based on The Cross-Layer Design in Wireless Sensor Networks (무선 센서 네트워크에서 크로스 레이어 기반의 에너지 효율적인 클러스터링 프로토콜)

  • Kim, Tae-Kon;Lee, Hyung-Keun
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.165-170
    • /
    • 2007
  • The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

  • PDF