scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A Review of Computational Intelligence Techniques in Wireless Sensor and Actuator Networks

26 Jun 2018-IEEE Communications Surveys and Tutorials (IEEE)-Vol. 20, Iss: 4, pp 2822-2854
TL;DR: This paper reviews the application of several methodologies under the CI umbrella to the WSAN field and describes and categorizes existing works leaning on fuzzy systems, neural networks, evolutionary computation, swarm intelligence, learning systems, and their hybridizations to well-known or emerging WSAN problems along five major axes.
Abstract: Wireless sensor and actuator networks (WSANs) are heterogeneous networks composed of many different nodes that can cooperatively sense the environment, determine an appropriate action to take, then change the environment’s state after acting on it. As a natural extension of wireless sensor networks (WSNs), WSANs inherit from them a variety of research challenges and bring forth many new ones. These challenges are related to dealing with imprecise and vague information, solving complicated optimization problems or collecting and processing data from multiple sources. Computational intelligence (CI) is an overarching term denoting a conglomerate of biologically and linguistically inspired techniques that provide robust solutions to NP-hard problems, reason in imprecise terms and yield high-quality yet computationally tractable approximate solutions to real-world problems. Many researchers have consequently turned to CI in hope of finding answers to a plethora of WSAN-related challenges. This paper reviews the application of several methodologies under the CI umbrella to the WSAN field. We describe and categorize existing works leaning on fuzzy systems , neural networks , evolutionary computation , swarm intelligence , learning systems , and their hybridizations to well-known or emerging WSAN problems along five major axes: 1) actuation; 2) communication; 3) sink mobility; 4) topology control; and 5) localization. The survey offers informative discussions to help reason through all the studies under consideration. Finally, we point to future research avenues by: 1) suggesting suitable CI techniques to specific problems; 2) borrowing concepts from WSNs that have yet to be applied to WSANs; or 3) describing the shortcomings of current methods in order to spark interest on the development of more refined models.
Citations
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors provide an overview of research problems in cloud computing and edge computing and recent progresses in addressing them with the help of Computational Intelligence (CI) techniques, with the aim of offering insights to the readers and motivating new research directions.
Abstract: Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users' requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This paper provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions.

40 citations

Journal ArticleDOI
25 May 2020
TL;DR: An overview of the CI techniques that are established in addressing relevant and timely open problems of AC management for residential buildings is provided and key issues related to the coordination of a large number of AC systems, modeling accuracy, and computational tractability are highlighted.
Abstract: Effective design of air-conditioner (AC) management system has the potential to reduce the cost of electricity consumption and help users to participate in demand response (DR) program as interruptible loads. However, optimizing the operation of AC is complex and, as a potential solution, computational intelligence (CI) techniques based model predictive algorithms are being explored in the literature. This article aims to provide an overview of the CI techniques that are established in addressing relevant and timely open problems of AC management for residential buildings. To do so, first, we provide a brief background on different DR mechanisms and AC management systems. Second, a review of recent advances in CI-based model prediction and optimal control techniques of AC systems for DR management is presented. The discussion reveals that the interest in CI techniques with adaptive learning algorithms is increasing due to their ability to adjust in varying conditions. Then, we provide a brief description of a testbed, which is used for testing various newly developed CI-based AC management techniques in a residential setting. Finally, key issues related to the coordination of a large number of AC systems, modeling accuracy, and computational tractability are highlighted along with their challenges and future research directions.

34 citations

Journal ArticleDOI
TL;DR: A novel hyperheuristic framework is proposed, which can automatically construct high-level heuristics to schedule the sink movements and prolong the network lifetime competitively with other methods, with small time consumption.
Abstract: Maximizing the lifetime of wireless sensor networks ( WSNs ) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor network is one of the most effective approaches to prolong the lifetime of wireless sensor networks. However, the existing mobile sink scheduling methods either require a great amount of computational time or lack effectiveness in finding high-quality scheduling solutions. To address the above issues, this paper proposes a novel hyperheuristic framework, which can automatically construct high-level heuristics to schedule the sink movements and prolong the network lifetime. In the proposed framework, a set of low-level heuristics are defined as building blocks to construct high-level heuristics and a set of random networks with different features are designed for training. Further, a genetic programming algorithm is adopted to automatically evolve promising high-level heuristics based on the building blocks and the training networks. By using the genetic programming to evolve more effective heuristics and applying these heuristics in a greedy scheme, our proposed hyper-heuristic framework can prolong the network lifetime competitively with other methods, with small time consumption. A series of comprehensive experiments, including both static and dynamic networks, are designed. The simulation results have demonstrated that the proposed method can offer a very promising performance in terms of network lifetime and response time.

32 citations

Journal ArticleDOI
TL;DR: Wearable sensing data optimization (WSDO) is introduced, which is a novel algorithm for the accurate and reliable handling of cardiomyopathy sensing data and results indicate that WSDO can efficiently refine the sensing data with high accuracy rates and low time cost.
Abstract: Cardiomyopathy is a disease category that describes the diseases of the heart muscle. It can infect all ages with different serious complications, such as heart failure and sudden cardiac arrest. Usually, signs and symptoms of cardiomyopathy include abnormal heart rhythms, dizziness, lightheadedness, and fainting. Smart devices have blown up a nonclinical revolution to heart patients’ monitoring. In particular, motion sensors can concurrently monitor patients’ abnormal movements. Smart wearables can efficiently track abnormal heart rhythms. These intelligent wearables emitted data must be adequately processed to make the right decisions for heart patients. In this article, a comprehensive, optimized model is introduced for smart monitoring of cardiomyopathy patients via sensors and wearable devices. The proposed model includes two new proposed algorithms. First, a fuzzy Harris hawks optimizer (FHHO) is introduced to increase the coverage of monitored patients by redistributing sensors in the observed area via the hybridization of artificial intelligence (AI) and fuzzy logic (FL). Second, we introduced wearable sensing data optimization (WSDO), which is a novel algorithm for the accurate and reliable handling of cardiomyopathy sensing data. After testing and verification, FHHO proves to enhance patient coverage and reduce the number of needed sensors. Meanwhile, WSDO is employed for the detection of heart rate and failure in large simulations. These experimental results indicate that WSDO can efficiently refine the sensing data with high accuracy rates and low time cost.

29 citations

References
More filters
Journal ArticleDOI
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Abstract: Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is the population size); (2) their non-elitism approach; and (3) the need to specify a sharing parameter. In this paper, we suggest a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties. Specifically, a fast non-dominated sorting approach with O(MN/sup 2/) computational complexity is presented. Also, a selection operator is presented that creates a mating pool by combining the parent and offspring populations and selecting the best N solutions (with respect to fitness and spread). Simulation results on difficult test problems show that NSGA-II is able, for most problems, to find a much better spread of solutions and better convergence near the true Pareto-optimal front compared to the Pareto-archived evolution strategy and the strength-Pareto evolutionary algorithm - two other elitist MOEAs that pay special attention to creating a diverse Pareto-optimal front. Moreover, we modify the definition of dominance in order to solve constrained multi-objective problems efficiently. Simulation results of the constrained NSGA-II on a number of test problems, including a five-objective, seven-constraint nonlinear problem, are compared with another constrained multi-objective optimizer, and the much better performance of NSGA-II is observed.

37,111 citations


"A Review of Computational Intellige..." refers methods in this paper

  • ...NSGA-II was afterwards seeded with the 2- opt heuristic so as to improve its convergence and attain more robust solutions....

    [...]

  • ...One very popular MOEA is the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) [45]....

    [...]

  • ...Digital Object Identifier 10.1109/COMST.2018.2850220 AFSA Artificial Fish School Algorithm AIS Artificial Immune System ANN Artificial Neural Network AOI Area of Interest AOA Angle of Arrival ART Adaptive Resonance Theory BA Bees Algorithm BBA Biogeography-based Optimization Algorithm BFA Bacterial Foraging Algorithm CHNN Competitive Hopfield Neural Network CI Computational Intelligence CRNDP Constrained Relay Node Deployment Problem CS Cuckoo Search DE Differential Evolution DL Deep Learning DSS Decision Support System EA Evolutionary Algorithm FA Firefly Algorithm FIS Fuzzy Inference System FL Fuzzy Logic GA Genetic Algorithm GPS Global Positioning System GSO Glowworm Swarm Optimization HS Hybrid System HaS Harmony Search IEEE Institute of Electrical and Electronic Engineers LS Learning System MDP Markov Decision Process MLE Maximum Likelihood Estimation MOEA Multi-Objective Evolutionary Algorithm MOO Multi-Objective Optimization MOPSO MultiObjective Particle Swarm Optimization MOVNS MultiObjective Variable Neighbourhood Search MRTA Multi-Robot Task Allocation NP Non-Polynomial NSGA-II Non-Dominated Sorting Genetic Algorithm II PC-TSP Prize-Collecting Traveling Salesman Problem PSO Particle Swarm Optimization QoS Quality of Service RL Reinforcement Learning RSN Robotic Sensor Network RSSI Received Signal Strength Indication SCX Sequential Constructive Crossover SI Swarm Intelligence SIA Swarm Intelligence Algorithm SOM Self-Organizing Map 1553-877X c© 2018 IEEE....

    [...]

  • ...Constrained Relay Node Deployment: The Constrained Relay Node Deployment Problem (CRNDP) was solved in [168] via three well-known multiobjective optimizers, viz NSGA-II, AbYSS (based on Scatter Search) and MOPSO....

    [...]

  • ...One very popular MOEA is the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) [45]....

    [...]

Book
25 Oct 1999
TL;DR: This highly anticipated third edition of the most acclaimed work on data mining and machine learning will teach you everything you need to know about preparing inputs, interpreting outputs, evaluating results, and the algorithmic methods at the heart of successful data mining.
Abstract: Data Mining: Practical Machine Learning Tools and Techniques offers a thorough grounding in machine learning concepts as well as practical advice on applying machine learning tools and techniques in real-world data mining situations. This highly anticipated third edition of the most acclaimed work on data mining and machine learning will teach you everything you need to know about preparing inputs, interpreting outputs, evaluating results, and the algorithmic methods at the heart of successful data mining. Thorough updates reflect the technical changes and modernizations that have taken place in the field since the last edition, including new material on Data Transformations, Ensemble Learning, Massive Data Sets, Multi-instance Learning, plus a new version of the popular Weka machine learning software developed by the authors. Witten, Frank, and Hall include both tried-and-true techniques of today as well as methods at the leading edge of contemporary research. *Provides a thorough grounding in machine learning concepts as well as practical advice on applying the tools and techniques to your data mining projects *Offers concrete tips and techniques for performance improvement that work by transforming the input or output in machine learning methods *Includes downloadable Weka software toolkit, a collection of machine learning algorithms for data mining tasks-in an updated, interactive interface. Algorithms in toolkit cover: data pre-processing, classification, regression, clustering, association rules, visualization

20,196 citations

Journal ArticleDOI
01 Jan 1985
TL;DR: A mathematical tool to build a fuzzy model of a system where fuzzy implications and reasoning are used is presented and two applications of the method to industrial processes are discussed: a water cleaning process and a converter in a steel-making process.
Abstract: A mathematical tool to build a fuzzy model of a system where fuzzy implications and reasoning are used is presented. The premise of an implication is the description of fuzzy subspace of inputs and its consequence is a linear input-output relation. The method of identification of a system using its input-output data is then shown. Two applications of the method to industrial processes are also discussed: a water cleaning process and a converter in a steel-making process.

18,803 citations


"A Review of Computational Intellige..." refers background in this paper

  • ...value from a set of inputs, their fuzzy sets and membership functions, and a set of inference rules [52]....

    [...]

Journal ArticleDOI
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.

17,936 citations


"A Review of Computational Intellige..." refers background in this paper

  • ...whole [16]–[18] or to a particular WSN problem [19]–[24]....

    [...]

Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations


"A Review of Computational Intellige..." refers methods in this paper

  • ...The method is validated by comparing it to the well-known LEACH protocol [148]....

    [...]