Algorithms for Wireless Sensor Networks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 October 2014) | Viewed by 19759

Special Issue Editors


E-Mail Website
Guest Editor
Lab-STICC, University of South Brittany, F56321 Lorient, France
Interests: design of heuristics and metaheuristics; mathematical programming; matheuristics; routing problems; optimization in electronic design; wireless sensor networks; scheduling
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Senior Researcher, Smart Internet of Things Research Group @ CREATE-NET (Center for REsearch And Telecommunication Experimentation for NETworked communities), Italy
Interests: wireless sensor networks design and applications; internet of things devices and services; bio-inspired modelling and optimization.

E-Mail Website1 Website2
Guest Editor
Lab-STICC UMR CNRS, University of Western Brittany UBO, 6285 Brest, France
Interests: wireless sensor networks; smart cities; internet of things; modelling and simulating radio propagation and radio interferences in WSNs; distributed algorithms; development of CAT (computer-aided test) tools for analog; mixed-signal and RF circuits; statistical modeling of analog
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

With rapid advances in Future Internet technologies, such as the Internet of Things, the sensor cloud and the mobile Internet, the physical world is, on a daily basis, getting more connected and is moving faster towards the always-connected paradigm. Under this paradigm, cheap, wireless-connected and easily configurable sensors can sense and collect environmental data anytime and anywhere. Unfortunately, the high availability and cheapness of sensing technology can only soften the barriers for actually supporting the levels of scalability, reliability and resilience required for this paradigm to be global. Moreover, the dearth of accurate simulation models and efficient software methods specifically designed for Wireless Sensor Networks (WSNs) leads to a lack of reliable algorithms, whose availability is essential to set up the future deployments in the best conditions. This includes, for instance, systematic considerations on the impact of channel interferences, nodes mobility and network dynamicity in general, which are crucial points not adequately addressed yet, hence weakening or preventing the proper operation of the resulting networks. Thus, to smash such barriers we still need efficient, fast and accurate algorithms, especially to manage communications and judiciously handle the tiny computational, memory and battery resources of the sensor nodes comprising the networks.

This Special Issue will provide a forum advancing the state-of-the-art concerning such algorithms for WSNs; discussions will concern the theoretical concepts, practical designs, and implementations used for running experiments, services and/or applications. Potential topics include (but are not limited to) algorithms for:

  • wireless sensor nodes (re-)deployment
  • area coverage in WSNs
  • object detection/tracking in WSNs
  • data collection/aggregation/dissemination in WSNs
  • data compression and signal processing in WSNs
  • efficient routing/medium access control protocols in WSNs
  • real-world experiments/services/applications of WSNs
  • reliable and accurate simulation models for WSNs
  • accelerating simulations (distributed, parallelized, etc.)

Prof. Dr. Marc Sevaux
Dr. Massimo Vecchio
Dr. Ahcène Bounceur
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com 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.

Keywords

  • wireless sensor networks
  • algorithms
  • signal processing
  • network protocols
  • communication
  • mobility
  • simulation
  • real-world applications and services

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (3 papers)

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

Research

762 KiB  
Article
Fusion of Multiple Pyroelectric Characteristics for Human Body Identification
by Wanchun Zhou, Ji Xiong, Fangmin Li, Na Jiang and Ning Zhao
Algorithms 2014, 7(4), 685-702; https://doi.org/10.3390/a7040685 - 18 Dec 2014
Cited by 5 | Viewed by 6805
Abstract
Due to instability and poor identification ability of single pyroelectric infrared (PIR) detector for human target identification, this paper proposes a new approach to fuse the information collected from multiple PIR sensors for human identification. Firstly, Fast Fourier Transform (FFT), Short Time Fourier [...] Read more.
Due to instability and poor identification ability of single pyroelectric infrared (PIR) detector for human target identification, this paper proposes a new approach to fuse the information collected from multiple PIR sensors for human identification. Firstly, Fast Fourier Transform (FFT), Short Time Fourier Transform (STFT), Wavelet Transform (WT) and Wavelet Packet Transform (WPT) are adopted to extract features of the human body, which can be achieved by single PIR sensor. Then, we apply Principal Component Analysis (PCA) and Support Vector Machine (SVM) to reduce the characteristic dimensions and to classify the human targets, respectively. Finally, Fuzzy Comprehensive Evaluation (FCE) is utilized to fuse recognition results from multiple PIR sensors to finalize human identification. The pyroelectric characteristics under scenarios with different people and/or different paths are analyzed by various experiments, and the recognition results with/without fusion procedure are also shown and compared. The experimental results demonstrate our scheme has improved efficiency for human identification. Full article
(This article belongs to the Special Issue Algorithms for Wireless Sensor Networks)
Show Figures

Figure 1

1413 KiB  
Article
A CR Spectrum Allocation Algorithm in Smart Grid Wireless Sensor Network
by Wei He, Ke Li, Qiang Zhou and Songnong Li
Algorithms 2014, 7(4), 510-522; https://doi.org/10.3390/a7040510 - 13 Oct 2014
Cited by 8 | Viewed by 6370
Abstract
Cognitive radio (CR) method was introduced in smart grid communication systems to resolve potential maladies such as the coexistence of heterogeneous networks, overloaded data flow, diversity in data structures, and unstable quality of service (QOS). In this paper, a cognitive spectrum allocation algorithm [...] Read more.
Cognitive radio (CR) method was introduced in smart grid communication systems to resolve potential maladies such as the coexistence of heterogeneous networks, overloaded data flow, diversity in data structures, and unstable quality of service (QOS). In this paper, a cognitive spectrum allocation algorithm based on non-cooperative game theory is proposed. The CR spectrum allocation model was developed by modifying the traditional game model via the insertion of a time variable and a critical function. The computing simulation result shows that the improved spectrum allocation algorithm can achieve stable spectrum allocation strategies and avoid the appearance of multi-Nash equilibrium at the expense of certain sacrifices in the system utility. It is suitable for application in distributed cognitive networks in power grids, thus contributing to the improvement of the isomerism and data capacity of power communication systems. Full article
(This article belongs to the Special Issue Algorithms for Wireless Sensor Networks)
Show Figures

Figure 1

271 KiB  
Article
Algorithm Based on Heuristic Strategy to Infer Lossy Links in Wireless Sensor Networks
by Wen-Qing Ma and Jing Zhang
Algorithms 2014, 7(3), 397-404; https://doi.org/10.3390/a7030397 - 29 Jul 2014
Cited by 2 | Viewed by 5447
Abstract
With the maturing of the actual application of wireless sensor networks, network fault management is eagerly demanded. Severe link packet loss affects the performance of wireless sensor networks, so it must be found and repaired. Subject to the constraints on limited resources, lossy [...] Read more.
With the maturing of the actual application of wireless sensor networks, network fault management is eagerly demanded. Severe link packet loss affects the performance of wireless sensor networks, so it must be found and repaired. Subject to the constraints on limited resources, lossy link is inferred using end to end measurement and network tomography. The algorithm based on heuristic strategy is proposed. This maps the problem of lossy links inferences to minimal set-cover problems. The performance of inference algorithms is evaluated by simulation, and the simulation results indicate feasibility and efficiency of the method. Full article
(This article belongs to the Special Issue Algorithms for Wireless Sensor Networks)
Show Figures

Figure 1

Back to TopTop