Advanced Algorithms for Wireless Sensor Networks

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Algorithms for Multidisciplinary Applications".

Deadline for manuscript submissions: closed (12 December 2021) | Viewed by 3168

Special Issue Editor

E-Mail Website
Guest Editor
Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu City 300, Taiwan
Interests: theoretical and fundamental problems in wireless sensor networks; algorithms in wireless sensor networks; graph algorithms
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Wireless sensor networks (WSNs) raise a number of interesting and undiscovered algorithmic issues, but traditional techniques are not sufficient to solve these problems in the right way. This is specifically due to constrained energy and computation capability, nondeterministic sensor failures, channel impairments, node mobility, hostile and distrusted environments, and even external attackers in WSNs. In all these issues, WSNs exhibit substantial vulnerability when compared to other networks. It is challenging to design robust and long-lived WSNs by devising novel algorithms or developing new theories whilst introducing minimal communication overhead and energy consumption. However, the algorithmic and theoretical issues in WSNs were not fully explored. The main focus of this special issue is devoted to deeper understanding of the algorithms and theories which are developed to build up WSNs.

Prof. Dr. Chang Wu Yu
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.


  • Algorithm Design and Data Structures for WSNs
  • Protocols for WSNs
  • Mathematic Models for WSNs
  • Optimization Issues in WSNs
  • Performance Analysis of WSNs
  • System Design in WSNs
  • Simulations for WSNs

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:


17 pages, 3048 KiB  
Algorithms for Detecting and Refining the Area of Intangible Continuous Objects for Mobile Wireless Sensor Networks
by Shih-Chang Huang and Cong-Han Huang
Algorithms 2022, 15(2), 31; - 18 Jan 2022
Cited by 4 | Viewed by 2294
Detecting the intangible continuous object (ICO) is a significant task, especially when the ICO is harmful as a toxic gas. Many studies used steady sensors to sketch the contour and find the area of the ICO. Applying the mobile sensors can further improve [...] Read more.
Detecting the intangible continuous object (ICO) is a significant task, especially when the ICO is harmful as a toxic gas. Many studies used steady sensors to sketch the contour and find the area of the ICO. Applying the mobile sensors can further improve the precision of the detected ICO by efficiently adjusting the positions of a subset of the deployed sensors. This paper proposed two methods to figure out the area of the ICO, named Delaunay triangulation with moving sensors (MDT) and convex hull with moving sensors (MCH). First, the proposed methods divide the sensors into ICO-covered and ICO-uncovered sensors. Next, the convex hull algorithm and the Delaunay triangulation geometric architecture are applied to figure out the rough boundary of the ICO. Then, the area of the ICO is further refined by the proposed sensor moving algorithm. Simulation results show that the figured out area sizes of MDT and MCH are 135% and 102% of the actual ICO. The results are better than the planarization algorithms Gabriel Graph (GG) and Delaunay triangulation without moving sensors, that amount to 137% and 145% of the actual ICO. The simulation also evaluates the impact of the sensors’ moving step size to find the compromise between the accuracy of the area and the convergence time of area refinement. Full article
(This article belongs to the Special Issue Advanced Algorithms for Wireless Sensor Networks)
Show Figures

Figure 1

Back to TopTop