A Review of Computational Intelligence Techniques in Wireless Sensor and Actuator Networks
Bibliographic record
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 highquality 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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.007 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".