• 제목/요약/키워드: Optimization-Based Clustering

검색결과 178건 처리시간 0.029초

A many-objective optimization WSN energy balance model

  • Wu, Di;Geng, Shaojin;Cai, Xingjuan;Zhang, Guoyou;Xue, Fei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권2호
    • /
    • pp.514-537
    • /
    • 2020
  • Wireless sensor network (WSN) is a distributed network composed of many sensory nodes. It is precisely due to the clustering unevenness and cluster head election randomness that the energy consumption of WSN is excessive. Therefore, a many-objective optimization WSN energy balance model is proposed for the first time in the clustering stage of LEACH protocol. The four objective is considered that the cluster distance, the sink node distance, the overall energy consumption of the network and the network energy consumption balance to select the cluster head, which to better balance the energy consumption of the WSN network and extend the network lifetime. A many-objective optimization algorithm to optimize the model (LEACH-ABF) is designed, which combines adaptive balanced function strategy with penalty-based boundary selection intersection strategy to optimize the clustering method of LEACH. The experimental results show that LEACH-ABF can balance network energy consumption effectively and extend the network lifetime when compared with other algorithms.

Optimization Driven MapReduce Framework for Indexing and Retrieval of Big Data

  • Abdalla, Hemn Barzan;Ahmed, Awder Mohammed;Al Sibahee, Mustafa A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.1886-1908
    • /
    • 2020
  • With the technical advances, the amount of big data is increasing day-by-day such that the traditional software tools face a burden in handling them. Additionally, the presence of the imbalance data in big data is a massive concern to the research industry. In order to assure the effective management of big data and to deal with the imbalanced data, this paper proposes a new indexing algorithm for retrieving big data in the MapReduce framework. In mappers, the data clustering is done based on the Sparse Fuzzy-c-means (Sparse FCM) algorithm. The reducer combines the clusters generated by the mapper and again performs data clustering with the Sparse FCM algorithm. The two-level query matching is performed for determining the requested data. The first level query matching is performed for determining the cluster, and the second level query matching is done for accessing the requested data. The ranking of data is performed using the proposed Monarch chaotic whale optimization algorithm (M-CWOA), which is designed by combining Monarch butterfly optimization (MBO) [22] and chaotic whale optimization algorithm (CWOA) [21]. Here, the Parametric Enabled-Similarity Measure (PESM) is adapted for matching the similarities between two datasets. The proposed M-CWOA outperformed other methods with maximal precision of 0.9237, recall of 0.9371, F1-score of 0.9223, respectively.

Semidefinite Programming을 통한 그래프의 동시 분할법 (K-Way Graph Partitioning: A Semidefinite Programming Approach)

  • Jaehwan, Kim;Seungjin, Choi;Sung-Yang, Bang
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (1)
    • /
    • pp.697-699
    • /
    • 2004
  • Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

  • PDF

MCRO-ECP: Mutation Chemical Reaction Optimization based Energy Efficient Clustering Protocol for Wireless Sensor Networks

  • Daniel, Ravuri;Rao, Kuda Nageswara
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권7호
    • /
    • pp.3494-3510
    • /
    • 2019
  • Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.

Design of improved Mulit-FNN for Nonlinear Process modeling

  • Park, Hosung;Sungkwun Oh
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.102.2-102
    • /
    • 2002
  • In this paper, the improved Multi-FNN (Fuzzy-Neural Networks) model is identified and optimized using HCM (Hard C-Means) clustering method and optimization algorithms. The proposed Multi-FNN is based on FNN and use simplified and linear inference as fuzzy inference method and error back propagation algorithm as learning rules. We use a HCM clustering and genetic algorithms (GAs) to identify both the structure and the parameters of a Multi-FNN model. Here, HCM clustering method, which is carried out for the process data preprocessing of system modeling, is utilized to determine the structure of Multi-FNN according to the divisions of input-output space using I/O process data. Also, the parame...

  • PDF

Subtractive Clustering 알고리즘을 이용한 퍼지 RBF 뉴럴네트워크의 동정 (Genetically Optimization of Fuzzy C-Means Clustering based Fuzzy Neural Networks)

  • 최정내;오성권;김현기
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.239-240
    • /
    • 2008
  • 본 논문에서는 Subtractive clustering 알고리즘을 이용한 Fuzzy Radial Basis Function Neural Network (FRBFNN)의 규칙 수를 자동적으로 생성하는 방법을 제시한다. FRBFNN은 멤버쉽 함수로써 기존 RBFNN에서 가우시안이나 타원형 형태의 특정 RBF를 사용하는 구조와 달리 Fuzzy C-Means clustering 알고리즘에서 사용하는 거리에 기한 멤버쉽 함수를 사용하여 전반부의 공간 분할 및 활성화 레벨을 결정하는 구조이다. 본 논문에서는 데이터의 밀집도에 기반을 두어 클러스터링을 하는 Subtractive clustering 알고리즘을 사용하여 퍼지 규칙의 수와 같은 의미를 갖는 분할할 입력공간의 수와 분할된 입력공간의 중심값을 동정하며, Least Square Estimator (LSE) 알고리즘을 사용하여 후반부 다항식의 계수를 추정 한다.

  • PDF

An Improved Coyote Optimization Algorithm-Based Clustering for Extending Network Lifetime in Wireless Sensor Networks

  • Venkatesh Sivaprakasam;Vartika Kulshrestha;Godlin Atlas Lawrence Livingston;Senthilnathan Arumugam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권7호
    • /
    • pp.1873-1893
    • /
    • 2023
  • The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

Interference-free Clustering Protocol for Large-Scale and Dense Wireless Sensor Networks

  • Chen, Zhihong;Lin, Hai;Wang, Lusheng;Zhao, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1238-1259
    • /
    • 2019
  • Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

Rule-Based Fuzzy-Neural Networks Using the Identification Algorithm of the GA Hybrid Scheme

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권1호
    • /
    • pp.101-110
    • /
    • 2003
  • This paper introduces an identification method for nonlinear models in the form of rule-based Fuzzy-Neural Networks (FNN). In this study, the development of the rule-based fuzzy neural networks focuses on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The FNN modeling and identification environment realizes parameter identification through synergistic usage of clustering techniques, genetic optimization and a complex search method. We use a HCM (Hard C-Means) clustering algorithm to determine initial apexes of the membership functions of the information granules used in this fuzzy model. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are then adjusted using the identification algorithm of a GA hybrid scheme. The proposed GA hybrid scheme effectively combines the GA with the improved com-plex method to guarantee both global optimization and local convergence. An aggregate objective function (performance index) with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. According to the selection and adjustment of the weighting factor of this objective function, we reveal how to design a model having sound approximation and generalization abilities. The proposed model is experimented with using several time series data (gas furnace, sewage treatment process, and NOx emission process data from gas turbine power plants).

동적 클러스터링 기반 모바일 클라우드 컴퓨팅의 최적화 기법 및 품질 평가 모델 (Dynamic Clustering based Optimization Technique and Quality Assessment Model of Mobile Cloud Computing)

  • 김대영;라현정;김수동
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제2권6호
    • /
    • pp.383-394
    • /
    • 2013
  • CPU, 메모리 등 모바일 디바이스의 제한된 자원문제를 해결하기 위한 방법으로, 모바일 디바이스의 자원이 아닌 클라우드 서비스 또는 PC등 외부 자원을 사용하는 모바일 클라우드 컴퓨팅(Mobile Cloud Computing, MCC)이 부각되고 있다. 전형적인 MCC 환경(MCC Environment, MCE)은 다른 운영체제 및 플랫폼을 가지는 여러 개의 노드, 모바일 애플리케이션과 서비스들로 구성되어 있고, 중앙관리자는 MCE 전체 품질이 일정 수준 이상을 유지하도록 관리 태스크를 수행한다. 그러나, 노드 수, 모바일 애플리케이션 수, 서비스의 수가 많아지고 서비스 실행빈도가 높아질 경우, 중앙 관리자의 관리 태스크 과중으로 병목현상과 성능저하 문제가 제기될 수 있다. 본 논문에서는 이러한 대규모 MCE의 병목과 성능저하 문제를 해결하고, 전체 품질을 안정화시키기 위한 클러스터링(Clustering) 기반의 최적화 기법을 제안한다. 본 기법을 적용하면 MCE의 전체 품질을 안정화시키기 위한 부하를 최소화하면서, 능동적이며 자율적인 방식으로 품질을 보장할 수 있다.