E-Mail Alert

Add your e-mail address to receive forthcoming issues of this journal:

Journal Browser

Journal Browser

Special Issue "Algorithm and Distributed Computing for the Internet of Things"

A special issue of Sensors (ISSN 1424-8220). This special issue belongs to the section "Sensor Networks".

Deadline for manuscript submissions: 30 April 2019

Special Issue Editors

Guest Editor
Prof. Dr. Juan A. Gómez-Pulido

Escuela Politécnica, Universidad de Extremadura, Cáceres, Spain
Website | E-Mail
Fax: (+34)927257187
Interests: optimization and computational intelligence; machine learning; reconfigurable computing and FPGAs; wireless communications; bioinformatics
Guest Editor
Prof. Jorge Sá Silva

Department of Informatics Engineering, University of Coimbra, 3030-290 Coimbra, Portugal
Website | E-Mail
Phone: +351 239 790 000
Interests: Internet of Things; wireless sensor networks; human in the loop cyberphysical systems
Guest Editor
Prof. Takahiro Hara

Department of Multimedia Engineering, Osaka University, Osaka 565-0871, Japan
Website | E-Mail
Interests: database systems; mobile computing; social computing; web mining; location privacy; time-series analysis

Special Issue Information

Dear Colleagues,

There is a growing interest in applying technologies, such as the Internet of Things (IoT), derived from the intense deployment of Wireless Sensor Networks (WSNs) during the last few decades, in relevant fields such as Industry 4.0, smart cities, and connected infrastructures. The use of IoT in these areas can lead to significant benefits, but it also generates a huge amount of data, which should be processed by a system to, in many cases, detect patterns or optimize certain processes of interest. To this end, big data, machine learning, and deep learning approaches are usually considered, leading to more complex and powerful systems than those of previous WSN applications, which also means new challenges to address. Moreover, for critical areas such as connected infrastructures, dependability, sustainability, and security issues should be addressed to ensure specific application requirements.

In this Special Issue, we seek original, unpublished high-quality articles, not currently under review by another conference or journal, clearly focused on theoretical and implementation solutions for IoT, including intelligent approaches (machine learning, big data, and deep learning), network levels (edge, fog, and cloud), embedded systems, sensing devices, nonfunctional requirements (dependability, security, and sustainability), deployment strategies, and management platforms.

Topics of Interest
Potential topics include, but are not limited to:

  • Smart manufacturing and Industry 4.0
  • Connected vehicles
  • Smart cities
  • Cognitive computing and deep learning
  • Big data Processing
  • Edge computing and network intelligence, bringing the computation closer to the data
  • Dependability (real-time, reliability, availability, safety)
  • Sustainability (low-power operation, energy management, energy harvesting)
  • Security
  • Distributed and embedded computing for networked systems
  • Applications, deployment, and management
  • Human behavior and context-aware aspects
  • Prediction models
  • Optimization and metaheuristics

Prof. Juan A. Gomez-Pulido
Prof. Jorge Sá Silva
Prof. Takahiro Hara
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 papers will be 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. Sensors is an international peer-reviewed open access semimonthly 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 1800 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.

Published Papers (7 papers)

View options order results:
result details:
Displaying articles 1-7
Export citation of selected articles as:

Research

Jump to: Other

Open AccessArticle Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line
Sensors 2019, 19(2), 273; https://doi.org/10.3390/s19020273
Received: 13 December 2018 / Revised: 6 January 2019 / Accepted: 8 January 2019 / Published: 11 January 2019
PDF Full-text (383 KB) | HTML Full-text | XML Full-text
Abstract
Given a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment, a primary task of the mobile wireless sensor network is to schedule covering the POIs by the sensors, such that each POI [...] Read more.
Given a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment, a primary task of the mobile wireless sensor network is to schedule covering the POIs by the sensors, such that each POI is monitored by at least one sensor. For balancing the energy consumption, we study the min-max line barrier target coverage (LBTC) problem which aims to minimize the maximum movement of the sensors from their original positions to their final positions at which the coverage is composed. We first proved that when the radius of the sensors are non-uniform integers, even 1-dimensional LBTC (1D-LBTC), a special case of LBTC in which the sensors are distributed on the line segment instead of the plane, is NP -hard. The hardness result is interesting, since the continuous version of LBTC to cover a given line segment instead of the POIs is known polynomial solvable. Then we present an exact algorithm for LBTC with uniform radius and sensors distributed on the plane, via solving the decision version of LBTC. We argue that our algorithm runs in time O ( n 2 log n ) and produces an optimal solution to LBTC. The time complexity compares favorably to the state-of-art runtime O ( n 3 log n ) of the continuous version which aims to cover a line barrier instead of the targets. Last but not the least, we carry out numerical experiments to evaluate the practical performance of the algorithms, which demonstrates a practical runtime gain comparing with an optimal algorithm based on integer linear programming. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Open AccessArticle An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)
Sensors 2019, 19(2), 243; https://doi.org/10.3390/s19020243
Received: 30 November 2018 / Revised: 2 January 2019 / Accepted: 4 January 2019 / Published: 10 January 2019
PDF Full-text (1642 KB) | HTML Full-text | XML Full-text
Abstract
Many applications of Internet of Things (IoT) have been implemented based on unreliable wireless or mobile networks like the delay tolerant network (DTN). Therefore, it is an important issue for IoT applications to achieve efficient data transmission in DTN. In order to improve [...] Read more.
Many applications of Internet of Things (IoT) have been implemented based on unreliable wireless or mobile networks like the delay tolerant network (DTN). Therefore, it is an important issue for IoT applications to achieve efficient data transmission in DTN. In order to improve delivery rate and optimize delivery delay with low overhead in DTN for IoT applications, we propose a new routing protocol, called Scheduling-Probabilistic Routing Protocol using History of Encounters and Transitivity (PROPHET). In this protocol, we calculate the delivery predictability according to the encountering frequency among nodes. Two scheduling mechanisms are proposed to extend the traditional PROPHET protocol and improve performance in both storage and transmission in DTN. In order to evaluate the proposed routing protocol, we perform simulations and compare it with other routing protocols in an Opportunistic Network Environment (ONE) simulator. The results demonstrate that the proposed Scheduling-PROPHET can achieve better performances in several key aspects compared with the existing protocols. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Open AccessArticle Wireless Charging Deployment in Sensor Networks
Sensors 2019, 19(1), 201; https://doi.org/10.3390/s19010201
Received: 11 December 2018 / Revised: 31 December 2018 / Accepted: 2 January 2019 / Published: 8 January 2019
PDF Full-text (4976 KB) | HTML Full-text | XML Full-text
Abstract
Charging schemes utilizing mobile wireless chargers can be applied to prolong the lifespan of a wireless sensor network. In considering charging schemes with mobile chargers, most current studies focus on charging each sensor from a single position, then optimizing the moving paths of [...] Read more.
Charging schemes utilizing mobile wireless chargers can be applied to prolong the lifespan of a wireless sensor network. In considering charging schemes with mobile chargers, most current studies focus on charging each sensor from a single position, then optimizing the moving paths of the chargers. However, in reality, a wireless charger may charge the same sensor from several positions in its path. In this paper we consider this fact and seek to minimize both the number of charging locations and the total required charging time. Two charging plans are developed. The first plan considers the charging time required by each sensor and greedily selects the charging service positions. The second one is a two-phase plan, where the number of charging positions is first minimized, then minimum charging times are assigned to every position according to the charging requirements of the nearby sensors. This paper also corrects a problem neglected by some studies in minimizing the number of charging service positions and further provides a corresponding solution. Empirical studies show that compared with other minimal clique partition (MCP)-based methods, the proposed charging plan may save up to 60% in terms of both the number of charging positions and the total required charging time. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Open AccessArticle Design and Analysis of a General Relay-Node Selection Mechanism on Intersection in Vehicular Networks
Sensors 2018, 18(12), 4251; https://doi.org/10.3390/s18124251
Received: 31 October 2018 / Revised: 27 November 2018 / Accepted: 28 November 2018 / Published: 3 December 2018
Cited by 1 | PDF Full-text (735 KB) | HTML Full-text | XML Full-text
Abstract
Employment of a relay node can extend the coverage of a message in vehicular networks (VNET). In addition, the prior information regarding the road structure, which determines the structure of VNET, can benefit relay-node selection. However, the non-line-of-sight (NLOS) communication in the intersection [...] Read more.
Employment of a relay node can extend the coverage of a message in vehicular networks (VNET). In addition, the prior information regarding the road structure, which determines the structure of VNET, can benefit relay-node selection. However, the non-line-of-sight (NLOS) communication in the intersection scenarios and diverse shapes for the intersection hamper the design of a general relay-node selection on intersection. To resolve this problem, in this paper, we build a model to describe the general intersection, and propose a general relay-node selection method on intersection. Additionally, based on our mathematical description of the general intersection, the performance models for the general relay-node selection on the intersection are first explored in terms of message dissemination speed and Packet Delivery Ratio (PDR). The simulation results validate these models and indicate the improvement of our proposal, especially in heavy traffic. The improvement includes, at the high density of 3.0025 vehicles/m, the huge gain of up to 23.35% in terms of message dissemination speed than that of other compared methods and PDR of over 90%. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Open AccessArticle A oneM2M-Based Query Engine for Internet of Things (IoT) Data Streams
Sensors 2018, 18(10), 3253; https://doi.org/10.3390/s18103253
Received: 15 August 2018 / Revised: 21 September 2018 / Accepted: 25 September 2018 / Published: 27 September 2018
PDF Full-text (1677 KB) | HTML Full-text | XML Full-text
Abstract
The new standard oneM2M (one machine-to-machine) aims to standardize the architecture and protocols of Internet of Things (IoT) middleware for better interoperability. Although the standard seems promising, it lacks several features for efficiently searching and retrieving IoT data which satisfy users’ intentions. In [...] Read more.
The new standard oneM2M (one machine-to-machine) aims to standardize the architecture and protocols of Internet of Things (IoT) middleware for better interoperability. Although the standard seems promising, it lacks several features for efficiently searching and retrieving IoT data which satisfy users’ intentions. In this paper, we design and develop a oneM2M-based query engine, called OMQ, that provides a real-time processing over IoT data streams. For this purpose, we define a query language which enables users to retrieve IoT data from data sources using JavaScript Object Notation (JSON). We also propose efficient query processing algorithms which utilizes the oneM2M architecture consisting of two nodes: (1) the IoT node and (2) the infrastructure node. IoT nodes of OMQ are mainly sensor devices execute user queries the aggregate, transform and filter operators, whereas the infrastructure node handles the join operator of user queries. Since the query processing algorithms are implemented as the hybrid infrastructure-edge processing, user queries can be executed efficiently in each IoT node rather than only in the infrastructure node. Thus, our OMQ system reduces the query processing time and the network bandwidth. We conducted a comprehensive evaluation of OMQ using a real and a synthetic data set. Experimental results demonstrate the feasibility and efficiency of OMQ system for executing queries and transferring data from each IoT node. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Open AccessArticle Distributed Egocentric Betweenness Measure as a Vehicle Selection Mechanism in VANETs: A Performance Evaluation Study
Sensors 2018, 18(8), 2731; https://doi.org/10.3390/s18082731
Received: 24 July 2018 / Revised: 15 August 2018 / Accepted: 16 August 2018 / Published: 20 August 2018
Cited by 2 | PDF Full-text (3220 KB) | HTML Full-text | XML Full-text
Abstract
In the traditional approach for centrality measures, also known as sociocentric, a network node usually requires global knowledge of the network topology in order to evaluate its importance. Therefore, it becomes difficult to deploy such an approach in large-scale or highly dynamic networks. [...] Read more.
In the traditional approach for centrality measures, also known as sociocentric, a network node usually requires global knowledge of the network topology in order to evaluate its importance. Therefore, it becomes difficult to deploy such an approach in large-scale or highly dynamic networks. For this reason, another concept known as egocentric has been introduced, which analyses the social environment surrounding individuals (through the ego-network). In other words, this type of network has the benefit of using only locally available knowledge of the topology to evaluate the importance of a node. It is worth emphasizing that in this approach, each network node will have a sub-optimal accuracy. However, such accuracy may be enough for a given purpose, for instance, the vehicle selection mechanism (VSM) that is applied to find, in a distributed fashion, the best-ranked vehicles in the network after each topology change. In order to confirm that egocentric measures can be a viable alternative for implementing a VSM, in particular, a case study was carried out to validate the effectiveness and viability of that mechanism for a distributed information management system. To this end, we used the egocentric betweenness measure as a selection mechanism of the most appropriate vehicle to carry out the tasks of information aggregation and knowledge generation. Based on the analysis of the performance results, it was confirmed that a VSM is extremely useful for VANET applications, and two major contributions of this mechanism can be highlighted: (i) reduction of bandwidth consumption; and (ii) overcoming the issue of highly dynamic topologies. Another contribution of this work is a thorough study by implementing and evaluating how well egocentric betweenness performs in comparison to the sociocentric measure in VANETs. Evaluation results show that the use of the egocentric betweenness measure in highly dynamic topologies has demonstrated a high degree of similarity compared to the sociocentric approach. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Other

Jump to: Research

Open AccessConcept Paper Natural Computing Applied to the Underground System: A Synergistic Approach for Smart Cities
Sensors 2018, 18(12), 4094; https://doi.org/10.3390/s18124094
Received: 16 October 2018 / Revised: 15 November 2018 / Accepted: 19 November 2018 / Published: 22 November 2018
Cited by 2 | PDF Full-text (7556 KB) | HTML Full-text | XML Full-text
Abstract
The management and proper use of the Urban Public Transport Systems (UPTS) constitutes a critical field that has not been investigated in accordance to its relevance and urgent idiosyncrasy within the Smart Cities realm. Swarm Intelligence is a very promising paradigm to deal [...] Read more.
The management and proper use of the Urban Public Transport Systems (UPTS) constitutes a critical field that has not been investigated in accordance to its relevance and urgent idiosyncrasy within the Smart Cities realm. Swarm Intelligence is a very promising paradigm to deal with such complex and dynamic systems. It presents robust, scalable, and self-organized behavior to deal with dynamic and fast changing systems. The intelligence of cities can be modelled as a swarm of digital telecommunication networks (the nerves), ubiquitously embedded intelligence, sensors and tags, and software. In this paper, a new approach based on the use of the Natural Computing paradigm and Collective Computation is shown, more concretely taking advantage of an Ant Colony Optimization algorithm variation and Fireworks algorithms to build a system that makes the complete control of the UPTS a tangible reality. Full article
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Figures

Figure 1

Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top