• Title/Summary/Keyword: Cluster based network

Search Result 846, Processing Time 0.028 seconds

An Efficient Routing Protocol for Mobile Sinks in Sensor Networks (센서 네트워크에서 모바일 싱크를 위한 효율적인 라우팅 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.4
    • /
    • pp.640-648
    • /
    • 2017
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.

Hybrid Neural Networks for Intrusion Detection System

  • Jirapummin, Chaivat;Kanthamanon, Prasert
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.928-931
    • /
    • 2002
  • Network based intrusion detection system is a computer network security tool. In this paper, we present an intrusion detection system based on Self-Organizing Maps (SOM) and Resilient Propagation Neural Network (RPROP) for visualizing and classifying intrusion and normal patterns. We introduce a cluster matching equation for finding principal associated components in component planes. We apply data from The Third International Knowledge Discovery and Data Mining Tools Competition (KDD cup'99) for training and testing our prototype. From our experimental results with different network data, our scheme archives more than 90 percent detection rate, and less than 5 percent false alarm rate in one SYN flooding and two port scanning attack types.

  • PDF

Technology Convergence Analysis by IPC Code-Based Social Network Analysis of Healthcare Patents (헬스케어 특허의 IPC 코드 기반 사회 연결망 분석(SNA)을 이용한 기술 융복합 분석)

  • Shim, Jaeruen
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.5
    • /
    • pp.308-314
    • /
    • 2022
  • This study deals with the technology Convergence Analysis by IPC Code-Based Social Network Analysis of Healthcare Patents filed in Korea. The relationship between core technologies is visualized using Social Network Analysis. At the subclass level of healthcare patents, 1,155 cases (49.4%) of patents with complex IPC codes were investigated, and as a result of Social Network Analysis on them, the IPC codes with the highest Degree Centrality were A61B, G16H, and G06Q, in that order. The IPC codes with the highest Betweenness Centrality are in the order of A61B, G16H, and G06Q. In addition, it was confirmed that healthcare patents consist of two large technology clusters. Cluster-1 corresponds to related business models centered on A61B, G16H and G06Q, and Cluster-2 is consisting of H04L, H04W and H04B. The technology convergence core pairs of the healthcare patent is [G16H-A61B] and [G16H-G06Q] in Cluster-1, and [H04L-H04W] in Cluster-2. The results of this study can contribute to the development of core technologies for healthcare patents.

Tree-Based Clustering Protocol for Energy Efficient Wireless Sensor Networks (에너지 효율적 무선 센서 네트워크를 위한 트리 기반 클러스터링 프로토콜)

  • Kim, Kyung-Tae;Youn, Hee-Yong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.69-80
    • /
    • 2010
  • Wireless sensor networks (WSN) consisting of a large number of sensors aim to gather data in a variety of environments and are being used and applied to many different fields. The sensor nodes composing a sensor network operate on battery of limited power and as a result, high energy efficiency and long network lifetime are major goals of research in the WSN. In this paper we propose a novel tree-based clustering approach for energy efficient wireless sensor networks. The proposed scheme forms the cluster and the nodes in a cluster construct a tree with the root of the cluster-head., The height of the tree is the distance of the member nodes to the cluster-head. Computer simulation shows that the proposed scheme enhances energy efficiency and balances the energy consumption among the nodes, and thus significantly extends the network lifetime compared to the existing schemes such as LEACH, PEGASIS, and TREEPSI.

Energy-Efficient Routing Protocol for Wireless Sensor Networks Based on Improved Grey Wolf Optimizer

  • Zhao, Xiaoqiang;Zhu, Hui;Aleksic, Slavisa;Gao, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2644-2657
    • /
    • 2018
  • To utilize the energy of sensor nodes efficiently and extend the network lifetime maximally is one of the primary goals in wireless sensor networks (WSNs). Thus, designing an energy-efficient protocol to optimize the determination of cluster heads (CHs) in WSNs has become increasingly important. In this paper, we propose a novel energy-efficient protocol based on an improved Grey Wolf Optimizer (GWO), which we refer to as Fitness value based Improved GWO (FIGWO). It considers a fitness value to improve the finding of the optimal solution in GWO, which ensures a better distribution of CHs and a more balanced cluster structure. According to the distance to the CHs and the BS, sensor nodes' transmission distance are recalculated to reduce the energy consumption. Simulation results demonstrate that the proposed approach can prolong the stability period of the network in comparison to other algorithms, namely by 31.5% in comparison to SEP, and even by 57.8% when compared with LEACH protocol. The results also show that the proposed protocol performs well over the above comparative protocols in terms of energy consumption and network throughput.

Traceback Technique using Table-based Route Management under Mobile Ad Hoc Network Environment (Mobile Ad Hoc Network에서 테이블 기반 경로 관리를 이용한 역추적 기법)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.13 no.1
    • /
    • pp.19-24
    • /
    • 2013
  • MANET has a highly dynamic topology because it consists of only mobile nodes. Various attacks using these characteristics exist. Among them, damage of the attacks based flooding such as DoS or DDos is large and traceback of the attack node is not easy. It is because route information by moving of intermediate nodes which pass the data changes frequently. In this paper, we propose table-based traceback technique to perform efficient traceback although route information by moving of nodes changes frequently. Cluster head manages route management table in order to form cluster status table and network topology snapshot for storing the location information of mobile nodes when cluster member nodes change. Also, bloom filter is used to reduce the amount of storing route information. The performance of the proposed technique is confirmed through experiment.

Design and Implementation of High-Availability Cluster Manager for Cluster-based DBMS (클러스터 기반 DBMS를 위한 고가용성 클러스터 관리기의 설계 및 구현)

  • Kim Young-Chang;Chang Jae-Woo;Kim Hong-Yeon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.1
    • /
    • pp.21-30
    • /
    • 2006
  • As the amount of information to be processed by computers has recently been increased, there has been cluster computing systems developed by connecting PCs and workstations using high-speed networks. hs a result, the studies on a cluster-based DBMS have been done with a wide range and it is necessary to develop a cluster manager for monitoring and managing cluster-based DBMSs. But, a cluster manager for efficiently managing cluster-based DBMSs has been studied in a first step. In this paper, we design and implement a high-availability cluster manager for a cluster-based DBMS. It monitors the status of nodes in cluster systems as well as the status of DBMS instances in a node, by using a graphic user interface (GUI). Our cluster manager supports the high-availability for a cluster-based DBMS by perceiving errors and recovering them, based on the monitored information on the status of a server.

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.

A Design of KDPC(Key Distributed Protocol based on Cluster) using ECDH Algorithm on USN Environment (USN 환경에서 ECDH 알고리즘을 이용한 KDPC(Key Distribution Protocol based on Cluster) 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.856-858
    • /
    • 2013
  • The data which is sensed on USN(Ubiquitous Sensor Network) environment is concerned with personal privacy and the secret information of business, but it has more vulnerable characteristics, in contrast to common networks. In other words, USN has the vulnerabilities which is easily exposed to the attacks such as the eavesdropping of sensor information, the distribution of abnormal packets, the reuse of message, an forgery attack, and denial of service attacks. Therefore, the key is necessarily required for secure communication between sensor nodes. This paper proposes a KDPC(Key Distribution Protocol based on Cluster) using ECDH algorithm by considering the characteristics of sensor network. As a result, the KDPC can provide the safe USN environment by detecting the forgery data and preventing the exposure of sensing data.

  • PDF

An Improved Coverage Efficient Clustering Method based on Time Delay for Wireless Sensor Networks (무선 센서 네트워크에서 시간지연 기반 향상된 커버리지 효율적인 클러스터링 방안)

  • Gong, Ji;Kim, Kwang-Ho;Go, Kwang-Sub;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.1-10
    • /
    • 2009
  • Energy efficient operations are essential to increase the life time of wireless sensor network. A cluster-based protocol is the most common approach to preserve energy during a data aggregation. This paper deals with an energy awareness and autonomous clustering method based on time delay. This method consists of three stages. In the first phase, Candidate Cluster Headers(CCHs) are selected based on a time delay which reflects the remaining energy of a node, with considering coverage efficiency of a cluster. Then, time delay is again applied to declare Cluster Headers(CHs) out of the CCHs. In the last phase, the issue on an orphan node which is not included into a cluster is resolved. The simulation results show that the proposed method increases the life time of the network around triple times longer than LEACH(Low Energy Adaptive Cluster Hierarchy). Moreover, the cluster header frequency is less diverse, and the energy on cluster heads is less spent.