• Title/Summary/Keyword: Distributed Clustering

Search Result 222, Processing Time 0.029 seconds

Energy Efficient Distributed Intrusion Detection Architecture using mHEED on Sensor Networks (센서 네트워크에서 mHEED를 이용한 에너지 효율적인 분산 침입탐지 구조)

  • Kim, Mi-Hui;Kim, Ji-Sun;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.151-164
    • /
    • 2009
  • The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

Intelligent Intrusion Detection and Prevention System using Smart Multi-instance Multi-label Learning Protocol for Tactical Mobile Adhoc Networks

  • Roopa, M.;Raja, S. Selvakumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2895-2921
    • /
    • 2018
  • Security has become one of the major concerns in mobile adhoc networks (MANETs). Data and voice communication amongst roaming battlefield entities (such as platoon of soldiers, inter-battlefield tanks and military aircrafts) served by MANETs throw several challenges. It requires complex securing strategy to address threats such as unauthorized network access, man in the middle attacks, denial of service etc., to provide highly reliable communication amongst the nodes. Intrusion Detection and Prevention System (IDPS) undoubtedly is a crucial ingredient to address these threats. IDPS in MANET is managed by Command Control Communication and Intelligence (C3I) system. It consists of networked computers in the tactical battle area that facilitates comprehensive situation awareness by the commanders for timely and optimum decision-making. Key issue in such IDPS mechanism is lack of Smart Learning Engine. We propose a novel behavioral based "Smart Multi-Instance Multi-Label Intrusion Detection and Prevention System (MIML-IDPS)" that follows a distributed and centralized architecture to support a Robust C3I System. This protocol is deployed in a virtually clustered non-uniform network topology with dynamic election of several virtual head nodes acting as a client Intrusion Detection agent connected to a centralized server IDPS located at Command and Control Center. Distributed virtual client nodes serve as the intelligent decision processing unit and centralized IDPS server act as a Smart MIML decision making unit. Simulation and experimental analysis shows the proposed protocol exhibits computational intelligence with counter attacks, efficient memory utilization, classification accuracy and decision convergence in securing C3I System in a Tactical Battlefield environment.

Analysis of Energy Consumption and Processing Delay of Wireless Sensor Networks according to the Characteristic of Applications (응용프로그램의 특성에 따른 무선센서 네트워크의 에너지 소모와 처리 지연 분석)

  • Park, Chong Myung;Han, Young Tak;Jeon, Soobin;Jung, Inbum
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.399-407
    • /
    • 2015
  • Wireless sensor networks are used for data collection and processing from the surrounding environment for various applications. Since wireless sensor nodes operate on low computing power, restrictive battery capacity, and low network bandwidth, their architecture model has greatly affected the performance of applications. If applications have high computation complexity or require the real-time processing, the centralized architecture in wireless sensor networks have a delay in data processing. Otherwise, if applications only performed simple data collection for long period, the distributed architecture wasted battery energy in wireless sensors. In this paper, the energy consumption and processing delay were analyzed in centralized and distributed sensor networks. In addition, we proposed a new hybrid architecture for wireless sensor networks. According to the characteristic of applications, the proposed method had the optimal number of wireless sensors in wireless sensor networks.

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.

Modified TDS (Task Duplicated based Scheduling) Scheme Optimizing Task Execution Time (태스크 실행 시간을 최적화한 개선된 태스크 중복 스케줄 기법)

  • Jang, Sei-Ie;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.6
    • /
    • pp.549-557
    • /
    • 2000
  • Distributed Memory Machine(DMM) is necessary for the effective computation of the data which is complicated and very large. Task scheduling is a method that reduces the communication time among tasks to reduce the total execution time of application program and is very important for the improvement of DMM. Task Duplicated based Scheduling(TDS) method improves execution time by reducing communication time of tasks. It uses clustering method which schedules tasks of the large communication time on the same processor. But there is a problem that cannot optimize communication time between task sending data and task receiving data. Hence, this paper proposes a new method which solves the above problem in TDS. Modified Task Duplicated based Scheduling(MTDS) method which can approximately optimize the communication time between task sending data and task receiving data by checking the optimal condition, resulted in the minimization of task execution time by reducing the communication time among tasks. Also system modeling shows that task execution time of MTDS is about 70% faster than that of TDS in the best case and the same as the result of TDS in the worst case. It proves that MTDS method is better than TDS method.

  • PDF

A Method on the Realization of QoS Guarantee in the Grid Network (그리드 네트워크에서의 QoS 보장방법 구현)

  • Kim, Jung-Yun;Na, Won-Shin;Ryoo, In-Tae
    • Journal of Digital Contents Society
    • /
    • v.10 no.1
    • /
    • pp.169-175
    • /
    • 2009
  • Grid computing is an application to obtain the most efficient performance from computing resources in terms of cost and convenience. It is also considered as a good method to solve a problem that cannot be settled by conventional computing technologies such as clustering or is requiring supercomputing capability due to its complex and long-running task. In order to run grid computing effectively, it needs to connect high-performance computing resources in real-time which are distributed geographically. Answering to the needs of this grid application, researchers in several universities with Argonne National Laboratory in the USA (ANL) as the main axis have developed Globus. It is noticed, however, that the quality of service (QoS) is not guaranteed when certain jobs are exchanged through networks in the context of Globus. To tackle with this problem, the ANL has invented Globus Architecture for Reservation and Allocation (GARA). The researchers of this paper constructed a testbed for evaluating the ability to reserve resource in the GARA system and implemented the GARA code for it. We analyzed the applied results and discussed future research plans.

  • PDF

Merge Algorithm of Maximum weighted Independent Vertex Pair at Maximal Weighted Independent Set Problem (최대 가중치 독립집합 문제의 최대 가중치 독립정점 쌍 병합 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.4
    • /
    • pp.171-176
    • /
    • 2020
  • This paper proposes polynomial-time algorithm for maximum weighted independent set(MWIS) problem that is well known as NP-hard. The known algorithms for MWIS problem are polynomial-time to specialized in particular graph type, distributed, or clustering method. But there is no unified algorithm is suitable to all kinds of graph types. Therefore, this paper suggests unique polynomial-time algorithm that is suitable to all kinds of graph types. The proposed algorithm merges the maximum weighted vertex vi and maximum weighted vertex vj that is not adjacent to vi. As a result of apply to undirected graphs and trees, this algorithm can be get the optimal solution. This algorithm improves previously known solution to new optimal solution.

Design of Distributed Hadoop Full Stack Platform for Big Data Collection and Processing (빅데이터 수집 처리를 위한 분산 하둡 풀스택 플랫폼의 설계)

  • Lee, Myeong-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.7
    • /
    • pp.45-51
    • /
    • 2021
  • In accordance with the rapid non-face-to-face environment and mobile first strategy, the explosive increase and creation of many structured/unstructured data every year demands new decision making and services using big data in all fields. However, there have been few reference cases of using the Hadoop Ecosystem, which uses the rapidly increasing big data every year to collect and load big data into a standard platform that can be applied in a practical environment, and then store and process well-established big data in a relational database. Therefore, in this study, after collecting unstructured data searched by keywords from social network services based on Hadoop 2.0 through three virtual machine servers in the Spring Framework environment, the collected unstructured data is loaded into Hadoop Distributed File System and HBase based on the loaded unstructured data, it was designed and implemented to store standardized big data in a relational database using a morpheme analyzer. In the future, research on clustering and classification and analysis using machine learning using Hive or Mahout for deep data analysis should be continued.

The Proposal Method of ARINC-429 Linkage for Efficient Operation of Tactical Stations in P-3C Maritime Patrol Aircraft (P-3C 해상초계기용 전술컴퓨터의 효율적 운영을 위한 ARINC-429 연동 방법)

  • Byoung-Kug Kim;Yong-Hoon Cha
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.2
    • /
    • pp.167-172
    • /
    • 2023
  • The P-3C maritime patrol aircraft operated by the Republic of Korea Navy is equipped with various sensor devices (LRUs, line replace units) for tactical data collection. Depending on the characteristics of the sensor device, it operates with various communication protocols such as IEEE 802.3, MIL-STD-1553A/B, and ARINC-429. In addition, the collected tactical data is processed in the tactical station for mission operators, and this tactical station constitutes a clustering network on Gigabit Ethernet and operates in a distributed processing method. For communication with the sensor device, a specific tactical station mounts a peripheral device (eg. ARINC-429 interface card). The problem is that the performance of the entire distributed processing according to the peripheral device control and communication relay of this specific device is degraded, and even the operation stop of the tactical station has a problem of disconnecting the communication with the related sensor device. In this paper, we propose a method to mount a separate gateway to solve this problem, and the validity of the proposed application is demonstrated through the operation result of this gateway.

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.