Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
6.8
3.9
Journals
Sensors
Sections
Fog/Edge Computing based Smart Sensing System
sensors-logo
Submit to Topical Collection Review for Sensors

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Fog/Edge Computing based Smart Sensing System (Closed)

A topical collection in Sensors (ISSN 1424-8220). This collection belongs to the section "Sensor Networks".

Viewed by 89859

Editors

Prof. Md Zakirul Alam Bhuiyan

E-Mail Website
Collection Editor
Computer and Information Sciences at Fordham University, NY, USA
Interests: sensor networks; cyber physical system
Prof. Dr. Geyong Min

E-Mail Website
Collection Editor
Department of Mathematics and Computer Science, College of Engineering, Mathematics and Physical Sciences, University of Exeter, Exeter EX4 4SB, UK
Interests: computer networks; wireless communications; parallel and distributed computing; ubiquitous computing; multimedia systems; modeling and performance engineering
Special Issues, Collections and Topics in MDPI journals
Prof. Tian Wang

E-Mail Website
Collection Editor
College of Computer Science and Technology, Huaqiao University, China
Interests: sensor networks; sensor-cloud; fog computing

Topical Collection Information

Dear Colleagues,

The Fourth International Symposium on Sensor-Cloud Systems (SCS 2020, http://www.spaccs.org/SCS2020/) will be held in Nanjing, China, Oct. 23-25, 2020. Moreover, the 18th IEEE International Conference on Embedded and Ubiquitous Computing (IEEE EUC 2020) and the 23rd IEEE International Conference on Computational Science and Engineering (CSE 2020) will be held in Guangzhou, China, November 10-13, 2020.

This Topical Collection is cooperating with SCS 2020, EUC 2020 and CSE 2020. Authors of outstanding papers related to sensors presented at these conferences are invited to submit extended versions of their work to the Topical Collection for publication.

Wireless Sensor Networks (WSNs) and Cloud Computing have received tremendous attentions from both academia and industry, as they are emerging to own numerous exciting applications in Internet of Things and smart cities, which can fundamentally change the way people interacting with the physical world.

However, there are still challenges need to be addressed in order to accelerate the development of these integrated systems. First of all, current techniques of Cloud Computing cannot satisfy the real-time requirement. The cloud cannot respond to sensors’ emergency requests. Second, the communication from sensors to cloud is a big problem, because sensors are with low bandwidth and low energy supplies. Third, as sensors are weak in processing and communication abilities, it is difficult for the cloud to guarantee the stability of the connection or even tolerate errors in that data. Finally, when sensors upload data to cloud for storage, how to ensure the data security and privacy in the cloud environment is a big problem.

Compared with Cloud Computing, Fog/Edge Computing is a promising technique for Sensor-Cloud systems. Fog/Edge Computing is proposed to enable computing directly at the edge of networks, delivering applications and services especially for IoT or smart cities. These fog devices, called fog nodes, have some local computation and storage capacity, wide geo-distribution like sensors and support for mobility. They can be industrial controllers, switches, routers, embedded servers and video surveillance cameras, and can be deployed anywhere with network connections. Serving as a link between sensor networks and the cloud, the fog can process and store data near where they are produced, and then manage and control sensors in a short distance. In this way, Fog/Edge Computing can extend Cloud Computing and cover its shortage in smart sensing system.

Prof. Md Zakirul Alam Bhuiyan
Prof. Dr. Geyong Min
Prof. Tian Wang
Collection 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 collection 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 2600 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

  • Smart Sensing and Ubiquitous Computing in IoT
  • Trustworthy Data Collection in IoT
  • Smart Grids and Energy
  • Smart and Intelligent Transport Systems
  • Smart sensor-cloud system
  • Applications for smart sensing and communication
  • Fog/Edge computing framework for Smart City
  • Fog/Edge computing for real-time computing of Smart City
  • Fog/Edge computing for communications of Smart City
  • Fog/Edge computing for reliabilities of Smart City
  • Fog/Edge computing for data security of Smart City
  • Fog/Edge computing for privacy of Smart City
  • Fog/Edge computing for energy efficiency of Smart City
  • Fog/Edge computing for trust and reputation evaluation of Smart City
  • Fog/Edge computing for data Integrity of Smart City
  • Fog/Edge based applications for Smart City
  • Mobile fog/edge computing for Smart City
  • Mobile fog/edge elements for Smart City
  • AI technologies for Smart City
  • Edge intelligent for Smart City and IoT

Published Papers (30 papers)

Download All Papers

2022

Jump to: 2021, 2020, 2019, 2018

28 pages, 2824 KiB  
Article
An Algorithm with Iteration Uncertainty Eliminate Based on Geomagnetic Fingerprint under Mobile Edge Computing for Indoor Localization
by Jie Li, Liming Sun, Dongpeng Liu, Ruiyun Yu and Xingwei Wang
Sensors 2022, 22(23), 9032; https://0-doi-org.brum.beds.ac.uk/10.3390/s22239032 - 22 Nov 2022
Cited by 1 | Viewed by 1194
Abstract
Indoor localization problems are difficult due to that the information, such as WLAN and GPS, cannot achieve enough precision for indoor issues. This paper presents a novel indoor localization algorithm, GeoLoc, with uncertainty eliminate based on fusion of acceleration, angular rate, and magnetic [...] Read more.
Indoor localization problems are difficult due to that the information, such as WLAN and GPS, cannot achieve enough precision for indoor issues. This paper presents a novel indoor localization algorithm, GeoLoc, with uncertainty eliminate based on fusion of acceleration, angular rate, and magnetic field sensor data. The algorithm can be deployed in edge devices to overcome the problems of insufficient computing resources and long delay caused by high complexity of location calculation. Firstly, the magnetic map is built and magnetic values are matched. Secondly, orientation updating and position selection are iteratively executed using the fusion data, which gradually reduce uncertainty of orientation. Then, we filter the trajectory from a path set. By gradually reducing uncertainty, GeoLoc can bring a high positioning precision and a smooth trajectory. In addition, this method has an advantage in that it does not rely on any infrastructure such as base stations and beacons. It solves the common problems regarding the non-uniqueness of the geomagnetic fingerprint and the deviation of the sensor measurement. The experimental results show that our algorithm achieves an accuracy of less than 2.5 m in indoor environment, and the positioning results are relatively stable. It meets the basic requirements of indoor location-based services (LBSs). Full article
►▼ Show Figures

Figure 1

2021

Jump to: 2022, 2020, 2019, 2018

18 pages, 8199 KiB  
Article
Intelligent Mining of Urban Ventilation Corridors Based on High-Precision Oblique Photographic Images
by Chaoxiang Chen, Shiping Ye, Zhican Bai, Juan Wang, Zongbiao Zhang and Sergey Ablameyko
Sensors 2021, 21(22), 7537; https://0-doi-org.brum.beds.ac.uk/10.3390/s21227537 - 12 Nov 2021
Cited by 3 | Viewed by 1558
Abstract
With the advancement of urbanization and the impact of industrial pollution, the issue of urban ventilation has attracted increasing attention. Research on urban ventilation corridors is a hotspot in the field of urban planning. Traditional studies on ventilation corridors mostly focus on qualitative [...] Read more.
With the advancement of urbanization and the impact of industrial pollution, the issue of urban ventilation has attracted increasing attention. Research on urban ventilation corridors is a hotspot in the field of urban planning. Traditional studies on ventilation corridors mostly focus on qualitative or simulated research on urban climate issues such as the intensified urban heat island effect, serious environmental pollution, and insufficient climate adaptability. Based on the high-precision urban remote sensing image data obtained by aeromagnetic oblique photography, this paper calculates the frontal area density of the city with reference to the urban wind statistics. Based on the existing urban patterns, template matching technology was used to automatically excavate urban ventilation corridors, which provides scientific and reasonable algorithmic support for the rapid construction of potential urban ventilation corridor paths. It also provides technical methods and decision basis for low-carbon urban planning, ecological planning and microclimate optimization design. This method was proved to be effective through experiments in Deqing city, Zhejiang Province, China. Full article
►▼ Show Figures

Figure 1

17 pages, 4760 KiB  
Article
Security-Related Hardware Cost Optimization for CAN FD-Based Automotive Cyber-Physical Systems
by Yong Xie, Yili Guo, Sheng Yang, Jian Zhou and Xiaobai Chen
Sensors 2021, 21(20), 6807; https://0-doi-org.brum.beds.ac.uk/10.3390/s21206807 - 13 Oct 2021
Cited by 6 | Viewed by 1518
Abstract
The introduction of various networks into automotive cyber-physical systems (ACPS) brings great challenges on security protection of ACPS functions, the auto industry recommends to adopt the hardware security module (HSM)-based multicore ECU to secure in-vehicle networks while meeting the delay constraint. However, this [...] Read more.
The introduction of various networks into automotive cyber-physical systems (ACPS) brings great challenges on security protection of ACPS functions, the auto industry recommends to adopt the hardware security module (HSM)-based multicore ECU to secure in-vehicle networks while meeting the delay constraint. However, this approach incurs significant hardware cost. Consequently, this paper aims to reduce security enhancing-related hardware cost by proposing two efficient design space exploration (DSE) algorithms, namely, stepwise decreasing-based heuristic algorithm (SDH) and interference balancing-based heuristic algorithm (IBH), which explore the task assignment, task scheduling, and message scheduling to minimize the number of required HSMs. Experiments on both synthetical and real data sets show that the proposed SDH and IBH are superior than state-of-the-art algorithm, and the advantage of SDH and IBH becomes more obvious as the increase about the percentage of security-critical tasks. For synthetic data sets, the hardware cost can be reduced by 61.4% and 45.6% averagely for IBH and SDH, respectively; for real data sets, the hardware cost can be reduced by 64.3% and 54.4% on average for IBH and SDH, respectively. Furthermore, IBH is better than SDH in most cases, and the runtime of IBH is two or three orders of magnitude smaller than SDH and state-of-the-art algorithm. Full article
►▼ Show Figures

Figure 1

14 pages, 2015 KiB  
Article
A Security Scheme Based on Intranal-Adding Links for Integrated Industrial Cyber-Physical Systems
by Dandan Zhao, Can Liu, Hao Peng, Juan Yu and Jianmin Han
Sensors 2021, 21(8), 2794; https://0-doi-org.brum.beds.ac.uk/10.3390/s21082794 - 15 Apr 2021
Viewed by 1828
Abstract
With the advent of the Internet of Everything era, the Industrial Internet is increasingly showing mutual integration and development. Its core framework, the industrial CPS (Cyber-Physical Systems), has received more and more attention and in-depth research in recent years. These complex industrial CPS [...] Read more.
With the advent of the Internet of Everything era, the Industrial Internet is increasingly showing mutual integration and development. Its core framework, the industrial CPS (Cyber-Physical Systems), has received more and more attention and in-depth research in recent years. These complex industrial CPS systems are usually composed of multiple interdependent sub-networks (such as physical networks and control networks, etc.). Minor faults or failure behaviors between sub-networks may cause serious cascading failure effects of the entire system. In this paper, we will propose a security scheme based on intranal-adding links in the face of the integrated and converged industrial CPS system environment. Firstly, by calculating the size of the largest connected component in the entire system, we can compare and analyze industrial CPS systems’ security performance under random attacks. Secondly, we compare and analyze the risk of cascading failure between integrated industrial CPS systems under different intranal-adding link strategies. Finally, the simulation results verify the system security strategy’s effectiveness under different strategies and show a relatively better exchange strategy to enhance the system’s security. In addition, this paper’s research work can help us design how to further optimize the interdependent industrial CPS system’s topology to cope with the integrated and converged industrial CPS system environment. Full article
►▼ Show Figures

Figure 1

16 pages, 533 KiB  
Article
Smartwatch User Authentication by Sensing Tapping Rhythms and Using One-Class DBSCAN
by Hanqi Zhang, Xi Xiao, Shiguang Ni, Changsheng Dou, Wei Zhou and Shutao Xia
Sensors 2021, 21(7), 2456; https://0-doi-org.brum.beds.ac.uk/10.3390/s21072456 - 02 Apr 2021
Cited by 4 | Viewed by 2443
Abstract
As important sensors in smart sensing systems, smartwatches are becoming more and more popular. Authentication can help protect the security and privacy of users. In addition to the classic authentication methods, behavioral factors can be used as robust measures for this purpose. This [...] Read more.
As important sensors in smart sensing systems, smartwatches are becoming more and more popular. Authentication can help protect the security and privacy of users. In addition to the classic authentication methods, behavioral factors can be used as robust measures for this purpose. This study proposes a lightweight authentication method for smartwatches based on edge computing, which identifies users by their tapping rhythms. Based on the DBSCAN clustering algorithm, a new classification method called One-Class DBSCAN is presented. It first seeks core objects and then leverages them to perform user authentication. We conducted extensive experiments on 6110 real data samples collected from more than 600 users. The results show that our method achieved the lowest Equal Error Rate (EER) of only 0.92%, which was lower than those of other state-of-the-art methods. In addition, a statistical method for detecting the security level of a tapping rhythm is proposed. It can prevent users from setting a simple tapping rhythm password, and thus improve the security of smartwatches. Full article
►▼ Show Figures

Figure 1

22 pages, 1483 KiB  
Article
Three-Dimensional Localization Algorithm Based on Improved A* and DV-Hop Algorithms in Wireless Sensor Network
by Xiaohu Huang, Dezhi Han, Mingming Cui, Guanghan Lin and Xinming Yin
Sensors 2021, 21(2), 448; https://0-doi-org.brum.beds.ac.uk/10.3390/s21020448 - 10 Jan 2021
Cited by 31 | Viewed by 2933
Abstract
In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined [...] Read more.
In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop. Full article
►▼ Show Figures

Figure 1

2020

Jump to: 2022, 2021, 2019, 2018

15 pages, 1110 KiB  
Article
Multi-Modal Explicit Sparse Attention Networks for Visual Question Answering
by Zihan Guo and Dezhi Han
Sensors 2020, 20(23), 6758; https://0-doi-org.brum.beds.ac.uk/10.3390/s20236758 - 26 Nov 2020
Cited by 10 | Viewed by 2564
Abstract
Visual question answering (VQA) is a multi-modal task involving natural language processing (NLP) and computer vision (CV), which requires models to understand of both visual information and textual information simultaneously to predict the correct answer for the input visual image and textual question, [...] Read more.
Visual question answering (VQA) is a multi-modal task involving natural language processing (NLP) and computer vision (CV), which requires models to understand of both visual information and textual information simultaneously to predict the correct answer for the input visual image and textual question, and has been widely used in smart and intelligent transport systems, smart city, and other fields. Today, advanced VQA approaches model dense interactions between image regions and question words by designing co-attention mechanisms to achieve better accuracy. However, modeling interactions between each image region and each question word will force the model to calculate irrelevant information, thus causing the model’s attention to be distracted. In this paper, to solve this problem, we propose a novel model called Multi-modal Explicit Sparse Attention Networks (MESAN), which concentrates the model’s attention by explicitly selecting the parts of the input features that are the most relevant to answering the input question. We consider that this method based on top-k selection can reduce the interference caused by irrelevant information and ultimately help the model to achieve better performance. The experimental results on the benchmark dataset VQA v2 demonstrate the effectiveness of our model. Our best single model delivers 70.71% and 71.08% overall accuracy on the test-dev and test-std sets, respectively. In addition, we also demonstrate that our model can obtain better attended features than other advanced models through attention visualization. Our work proves that the models with sparse attention mechanisms can also achieve competitive results on VQA datasets. We hope that it can promote the development of VQA models and the application of artificial intelligence (AI) technology related to VQA in various aspects. Full article
►▼ Show Figures

Figure 1

15 pages, 2016 KiB  
Article
Security Evaluation under Different Exchange Strategies Based on Heterogeneous CPS Model in Interdependent Sensor Networks
by Hao Peng, Can Liu, Dandan Zhao, Zhaolong Hu and Jianmin Han
Sensors 2020, 20(21), 6123; https://0-doi-org.brum.beds.ac.uk/10.3390/s20216123 - 28 Oct 2020
Cited by 9 | Viewed by 1961
Abstract
In the real Internet of Everything scenario, many large-scale information systems can be converted into interdependent sensor networks, such as smart grids, smart medical systems, and industrial Internet systems. These complex systems usually have multiple interdependent sensor networks. Small faults or failure behaviors [...] Read more.
In the real Internet of Everything scenario, many large-scale information systems can be converted into interdependent sensor networks, such as smart grids, smart medical systems, and industrial Internet systems. These complex systems usually have multiple interdependent sensor networks. Small faults or failure behaviors between networks may cause serious cascading failure effects of the entire system. Therefore, in this paper, we will focus on the security of interdependent sensor networks. Firstly, by calculating the size of the largest functional component in the entire network, the impact of random attacks on the security of interdependent sensor networks is analyzed. Secondly, it compares and analyzes the impact of cascading failures between interdependent sensor networks under different switching edge strategies. Finally, the simulation results verify the effect of the security of the system under different strategies, and give a better exchange strategy to enhance the security of the system. In addition, the research work in this article can help design how to further optimize the topology of interdependent sensor networks by reducing the impact of cascading failures. Full article
►▼ Show Figures

Figure 1

15 pages, 1508 KiB  
Article
An Effective Dense Co-Attention Networks for Visual Question Answering
by Shirong He and Dezhi Han
Sensors 2020, 20(17), 4897; https://0-doi-org.brum.beds.ac.uk/10.3390/s20174897 - 30 Aug 2020
Cited by 12 | Viewed by 3157
Abstract
At present, the state-of-the-art approaches of Visual Question Answering (VQA) mainly use the co-attention model to relate each visual object with text objects, which can achieve the coarse interactions between multimodalities. However, they ignore the dense self-attention within question modality. In order to [...] Read more.
At present, the state-of-the-art approaches of Visual Question Answering (VQA) mainly use the co-attention model to relate each visual object with text objects, which can achieve the coarse interactions between multimodalities. However, they ignore the dense self-attention within question modality. In order to solve this problem and improve the accuracy of VQA tasks, in the present paper, an effective Dense Co-Attention Networks (DCAN) is proposed. First, to better capture the relationship between words that are relatively far apart and make the extracted semantics more robust, the Bidirectional Long Short-Term Memory (Bi-LSTM) neural network is introduced to encode questions and answers; second, to realize the fine-grained interactions between the question words and image regions, a dense multimodal co-attention model is proposed. The model’s basic components include the self-attention unit and the guided-attention unit, which are cascaded in depth to form a hierarchical structure. The experimental results on the VQA-v2 dataset show that DCAN has obvious performance advantages, which makes VQA applicable to a wider range of AI scenarios. Full article
►▼ Show Figures

Figure 1

19 pages, 1137 KiB  
Article
A Blockchain-Based Authentication and Dynamic Group Key Agreement Protocol
by Zisang Xu, Feng Li, Han Deng, Minfu Tan, Jixin Zhang and Jianbo Xu
Sensors 2020, 20(17), 4835; https://0-doi-org.brum.beds.ac.uk/10.3390/s20174835 - 27 Aug 2020
Cited by 10 | Viewed by 3227
Abstract
With the rapid development of mobile networks, there are more and more application scenarios that require group communication. For example, in mobile edge computing, group communication can be used to transmit messages to all group members with minimal resources. The group key directly [...] Read more.
With the rapid development of mobile networks, there are more and more application scenarios that require group communication. For example, in mobile edge computing, group communication can be used to transmit messages to all group members with minimal resources. The group key directly affects the security of the group communication. Most existing group key agreement protocols are often flawed in performance, scalability, forward or backward secrecy, or single node failure. Therefore, this paper proposes a blockchain-based authentication and dynamic group key agreement protocol. With our protocol, each group member only needs to authenticate its left neighbor once to complete the authentication, which improved authentication efficiency. In addition, our protocol guarantees the forward secrecy of group members after joining the group and the backward secrecy of group members after leaving the group. Based on blockchain technology, we solve the problem of single node failure. Furthermore, we use mathematics to prove the correctness and security of our protocol, and the comparison to related protocols shows that our protocol reduces computation and communication costs. Full article
►▼ Show Figures

Figure 1

16 pages, 4056 KiB  
Article
Recognition of Crop Diseases Based on Depthwise Separable Convolution in Edge Computing
by Musong Gu, Kuan-Ching Li, Zhongwen Li, Qiyi Han and Wenjie Fan
Sensors 2020, 20(15), 4091; https://0-doi-org.brum.beds.ac.uk/10.3390/s20154091 - 22 Jul 2020
Cited by 10 | Viewed by 2744
Abstract
The original pattern recognition and classification of crop diseases needs to collect a large amount of data in the field and send them next to a computer server through the network for recognition and classification. This method usually takes a long time, is [...] Read more.
The original pattern recognition and classification of crop diseases needs to collect a large amount of data in the field and send them next to a computer server through the network for recognition and classification. This method usually takes a long time, is expensive, and is difficult to carry out for timely monitoring of crop diseases, causing delays to diagnosis and treatment. With the emergence of edge computing, one can attempt to deploy the pattern recognition algorithm to the farmland environment and monitor the growth of crops promptly. However, due to the limited resources of the edge device, the original deep recognition model is challenging to apply. Due to this, in this article, a recognition model based on a depthwise separable convolutional neural network (DSCNN) is proposed, which operation particularities include a significant reduction in the number of parameters and the amount of computation, making the proposed design well suited for the edge. To show its effectiveness, simulation results are compared with the main convolution neural network (CNN) models LeNet and Visual Geometry Group Network (VGGNet) and show that, based on high recognition accuracy, the recognition time of the proposed model is reduced by 80.9% and 94.4%, respectively. Given its fast recognition speed and high recognition accuracy, the model is suitable for the real-time monitoring and recognition of crop diseases by provisioning remote embedded equipment and deploying the proposed model using edge computing. Full article
►▼ Show Figures

Figure 1

15 pages, 1734 KiB  
Article
IoT-RECSM—Resource-Constrained Smart Service Migration Framework for IoT Edge Computing Environment
by Zhongyi Zhai, Ke Xiang, Lingzhong Zhao, Bo Cheng, Junyan Qian and Jinsong Wu
Sensors 2020, 20(8), 2294; https://0-doi-org.brum.beds.ac.uk/10.3390/s20082294 - 17 Apr 2020
Cited by 9 | Viewed by 2986
Abstract
The edge-based computing paradigm (ECP) becomes one of the most innovative modes of processing distributed Interneit of Things (IoT) sensor data. However, the edge nodes in ECP are usually resource-constrained. When more services are executed on an edge node, the resources required by [...] Read more.
The edge-based computing paradigm (ECP) becomes one of the most innovative modes of processing distributed Interneit of Things (IoT) sensor data. However, the edge nodes in ECP are usually resource-constrained. When more services are executed on an edge node, the resources required by these services may exceed the edge node’s, so as to fail to maintain the normal running of the edge node. In order to solve this problem, this paper proposes a resource-constrained smart service migration framework for edge computing environment in IoT (IoT-RECSM) and a dynamic edge service migration algorithm. Based on this algorithm, the framework can dynamically migrate services of resource-critical edge nodes to resource-rich nodes. In the framework, four abstract models are presented to quantificationally evaluate the resource usage of edge nodes and the resource consumption of edge service in real-time. Finally, an edge smart services migration prototype system is implemented to simulate the edge service migration in IoT environment. Based on the system, an IoT case including 10 edge nodes is simulated to evaluate the proposed approach. According to the experiment results, service migration among edge nodes not only maintains the stability of service execution on edge nodes, but also reduces the sensor data traffic between edge nodes and cloud center. Full article
►▼ Show Figures

Figure 1

17 pages, 999 KiB  
Article
Vehicle Cooperative Network Model Based on Hypergraph in Vehicular Fog Computing
by Maoli Ran and Xiangyu Bai
Sensors 2020, 20(8), 2269; https://0-doi-org.brum.beds.ac.uk/10.3390/s20082269 - 16 Apr 2020
Cited by 9 | Viewed by 3247
Abstract
In this paper, we propose an optimization framework of vehicular fog computing and a cooperation vehicular network model. We aim to improve the performance of vehicular fog computing and solve the problem that the data of the vehicle collaborative network is difficult to [...] Read more.
In this paper, we propose an optimization framework of vehicular fog computing and a cooperation vehicular network model. We aim to improve the performance of vehicular fog computing and solve the problem that the data of the vehicle collaborative network is difficult to obtain. This paper applies the hypergraph theory to study the underlying structure, considering the social characteristics of the vehicles and vehicle communication. Since the vehicles join the network in accordance with the Poisson process law, the model is analyzed by using Poisson stochastic process and mean field theory. This paper uses MATLAB to simulate the evolution process of cooperative networks. The results show that the vehicle’s super-degree in vehicular fog computing has scale-free characteristics. Through this model, the vehicle cooperation situation can be analyzed, and the vehicle dynamics can be accurately predicted to further improve the performance of vehicular fog computing. The model can be transformed into some complex network models by adjusting the parameters. It has strong universality and has certain reference significance for the research on the related characteristics of VANETs and the theoretical research of the cooperative network. Full article
►▼ Show Figures

Figure 1

21 pages, 2094 KiB  
Article
Trustworthiness and a Zero Leakage OTMP-P2L Scheme Based on NP Problems for Edge Security Access
by Daoqi Han, Xiaofeng Du and Yueming Lu
Sensors 2020, 20(8), 2231; https://0-doi-org.brum.beds.ac.uk/10.3390/s20082231 - 15 Apr 2020
Cited by 5 | Viewed by 2736
Abstract
Resource constraints have prevented comprehensive cryptography and multifactor authentication in numerous Internet of Things (IoT) connectivity scenarios. Existing IoT systems generally adopt lightweight security protocols that lead to compromise and privacy leakage. Edge computing enables better access control and privacy protection, furthermore, blockchain [...] Read more.
Resource constraints have prevented comprehensive cryptography and multifactor authentication in numerous Internet of Things (IoT) connectivity scenarios. Existing IoT systems generally adopt lightweight security protocols that lead to compromise and privacy leakage. Edge computing enables better access control and privacy protection, furthermore, blockchain architecture has achieved a trusted store of value by open-source and distributed consensus mechanisms. To embrace these new paradigms, we propose a scheme that employs one-time association multitasking proofs for peer to local authentication (OTMP-P2L). The scheme chooses relevant nondeterministic polynomial (NP) problem tasks, and manages localized trust and anonymity by using smart devices such as phones and pads, thereby enabling IoT devices to autonomously perform consensus validation with an enhanced message authentication code. This nested code is a one-time zero-knowledge proof that comprises multiple logic verification arguments. To increase diversity and reduce the workload of each one, these arguments are chained by a method that establishes some of the inputs of the following task from the output of previous tasks. We implemented a smart lock system and confirmed that the scheme outperforms IoT authentication methods. The result demonstrates superior flexibility through dynamic difficulty strategies and succinct non-interactive peer-to-peer (P2P) verification. Full article
►▼ Show Figures

Figure 1

21 pages, 3010 KiB  
Article
Storage Management Strategy in Mobile Phones for Photo Crowdsensing
by En Wang, Zhengdao Qu, Xinyao Liang, Xiangyu Meng, Yongjian Yang, Dawei Li and Weibin Meng
Sensors 2020, 20(8), 2199; https://0-doi-org.brum.beds.ac.uk/10.3390/s20082199 - 13 Apr 2020
Viewed by 2366
Abstract
In mobile crowdsensing, some users jointly finish a sensing task through the sensors equipped in their intelligent terminals. In particular, the photo crowdsensing based on Mobile Edge Computing (MEC) collects pictures for some specific targets or events and uploads them to nearby edge [...] Read more.
In mobile crowdsensing, some users jointly finish a sensing task through the sensors equipped in their intelligent terminals. In particular, the photo crowdsensing based on Mobile Edge Computing (MEC) collects pictures for some specific targets or events and uploads them to nearby edge servers, which leads to richer data content and more efficient data storage compared with the common mobile crowdsensing; hence, it has attracted an important amount of attention recently. However, the mobile users prefer uploading the photos through Wifi APs (PoIs) rather than cellular networks. Therefore, photos stored in mobile phones are exchanged among users, in order to quickly upload them to the PoIs, which are actually the edge services. In this paper, we propose a utility-based Storage Management strategy in mobile phones for Photo Crowdsensing (SMPC), which makes a sending/deleting decision on a user’s device for either maximizing photo delivery ratio (SMPC-R) or minimizing average delay (SMPC-D). The decision is made according to the photo’s utility, which is calculated by measuring the impact of reproducing or deleting a photo on the above performance goals. We have done simulations based on the random-waypoint model and three real traces: roma/taxi, epfl, and geolife. The results show that, compared with other storage management strategies, SMPC-R gets the highest delivery ratio and SMPC-D achieves the lowest average delay. Full article
►▼ Show Figures

Figure 1

14 pages, 891 KiB  
Article
Secure Key Establishment Mechanism for Smart Sensing System Based Robots Network
by Qi Xiao, Yunchuan Qin, Cheng Xu and Kenli Li
Sensors 2020, 20(7), 1970; https://0-doi-org.brum.beds.ac.uk/10.3390/s20071970 - 01 Apr 2020
Viewed by 2010
Abstract
The smart robot is playing an increasingly important role in the social economy, and multi-robot systems will be an important development in robotics. With smart sensing systems, the communications between sensors, actuators, and edge computing systems and robots are prone to be attacked [...] Read more.
The smart robot is playing an increasingly important role in the social economy, and multi-robot systems will be an important development in robotics. With smart sensing systems, the communications between sensors, actuators, and edge computing systems and robots are prone to be attacked due to the highly dynamic and distributed environment. Since smart robots are often distributed in open environments, as well as due to their limited hardware resources and security protection capabilities, the security requirements of their keys cannot be met with traditional key distribution algorithms. In this paper, we propose a new mechanism of key establishment based on high-order polynomials to ensure the safe key generation and key distribution. Experiments show that the key establishment mechanism proposed in this paper guarantees the security of keys; its storage cost and communication cost are smaller than state-of-the-art mechanisms; and it allows robot components to join and leave the network dynamically, which is more suitable for multi-robot systems. Full article
►▼ Show Figures

Figure 1

15 pages, 2804 KiB  
Article
Support Mobile Fog Computing Test in piFogBedII
by Qiaozhi Xu, Junxing Zhang and Bulganmaa Togookhuu
Sensors 2020, 20(7), 1900; https://0-doi-org.brum.beds.ac.uk/10.3390/s20071900 - 29 Mar 2020
Cited by 10 | Viewed by 3090
Abstract
IoT and 5G technologies are making smart devices, medical devices, cameras and various types of sensors become parts of the Internet, which provides feasibility to the realization of infrastructure and services such as smart homes, smart cities, smart medical technology and smart transportation. [...] Read more.
IoT and 5G technologies are making smart devices, medical devices, cameras and various types of sensors become parts of the Internet, which provides feasibility to the realization of infrastructure and services such as smart homes, smart cities, smart medical technology and smart transportation. Fog computing (edge computing) is a new research field and can accelerate the analysis speed and decision-making for these delay-sensitive applications. It is very important to test functions and performances of various applications and services before they are deployed to the production environment, and current evaluations are more based on various simulation tools; however, the fidelity of the experimental results is a problem for most of network simulation tools. PiFogBed is a fog computing testbed built with real devices, but it does not support the testing of mobile end devices and mobile fog applications. The paper proposes the piFogBedII to support the testing of mobile fog applications by modifying some components in the piFogBed, such as extending the range of end devices, adding the mobile and migration management strategy and inserting a container agent to implement the transparent transmission between end devices and containers. The evaluation results show that it is effective and the delay resulting from the migration strategy and container agent is acceptable. Full article
►▼ Show Figures

Figure 1

12 pages, 7374 KiB  
Article
Smart Privacy Protection for Big Video Data Storage Based on Hierarchical Edge Computing
by Di Xiao, Min Li and Hongying Zheng
Sensors 2020, 20(5), 1517; https://0-doi-org.brum.beds.ac.uk/10.3390/s20051517 - 10 Mar 2020
Cited by 4 | Viewed by 3330
Abstract
Recently, the rapid development of the Internet of Things (IoT) has led to an increasing exponential growth of non-scalar data (e.g., images, videos). Local services are far from satisfying storage requirements, and the cloud computing fails to effectively support heterogeneous distributed IoT environments, [...] Read more.
Recently, the rapid development of the Internet of Things (IoT) has led to an increasing exponential growth of non-scalar data (e.g., images, videos). Local services are far from satisfying storage requirements, and the cloud computing fails to effectively support heterogeneous distributed IoT environments, such as wireless sensor network. To effectively provide smart privacy protection for video data storage, we take full advantage of three patterns (multi-access edge computing, cloudlets and fog computing) of edge computing to design the hierarchical edge computing architecture, and propose a low-complexity and high-secure scheme based on it. The video is divided into three parts and stored in completely different facilities. Specifically, the most significant bits of key frames are directly stored in local sensor devices while the least significant bits of key frames are encrypted and sent to the semi-trusted cloudlets. The non-key frame is compressed with the two-layer parallel compressive sensing and encrypted by the 2D logistic-skew tent map and then transmitted to the cloud. Simulation experiments and theoretical analysis demonstrate that our proposed scheme can not only provide smart privacy protection for big video data storage based on the hierarchical edge computing, but also avoid increasing additional computation burden and storage pressure. Full article
►▼ Show Figures

Figure 1

19 pages, 3047 KiB  
Article
Smartphone Architecture for Edge-Centric IoT Analytics
by Bockarie Daniel Marah, Zilong Jing, Tinghuai Ma, Raeed Alsabri, Raphael Anaadumba, Abdullah Al-Dhelaan and Mohammed Al-Dhelaan
Sensors 2020, 20(3), 892; https://0-doi-org.brum.beds.ac.uk/10.3390/s20030892 - 07 Feb 2020
Cited by 8 | Viewed by 5688
Abstract
The current baseline architectures in the field of the Internet of Things (IoT) strongly recommends the use of edge computing in the design of the solution applications instead of the traditional approach which solely uses the cloud/core for analysis and data storage. This [...] Read more.
The current baseline architectures in the field of the Internet of Things (IoT) strongly recommends the use of edge computing in the design of the solution applications instead of the traditional approach which solely uses the cloud/core for analysis and data storage. This research, therefore, focuses on formulating an edge-centric IoT architecture for smartphones which are very popular electronic devices that are capable of executing complex computational tasks at the network edge. A novel smartphone IoT architecture (SMIoT) is introduced that supports data capture and preprocessing, model (i.e., machine learning models) deployment, model evaluation and model updating tasks. Moreover, a novel model evaluation and updating scheme is provided which ensures model validation in real-time. This ensures a sustainable and reliable model at the network edge that automatically adjusts to changes in the IoT data subspace. Finally, the proposed architecture is tested and evaluated using an IoT use case. Full article
►▼ Show Figures

Figure 1

19 pages, 3844 KiB  
Article
Incentivizing for Truth Discovery in Edge-assisted Large-scale Mobile Crowdsensing
by Jia Xu, Shangshu Yang, Weifeng Lu, Lijie Xu and Dejun Yang
Sensors 2020, 20(3), 805; https://0-doi-org.brum.beds.ac.uk/10.3390/s20030805 - 02 Feb 2020
Cited by 6 | Viewed by 2786
Abstract
The recent development of human-carried mobile devices has promoted the great development of mobile crowdsensing systems. Most existing mobile crowdsensing systems depend on the crowdsensing service of the deep cloud. With the increasing scale and complexity, there is a tendency to enhance mobile [...] Read more.
The recent development of human-carried mobile devices has promoted the great development of mobile crowdsensing systems. Most existing mobile crowdsensing systems depend on the crowdsensing service of the deep cloud. With the increasing scale and complexity, there is a tendency to enhance mobile crowdsensing with the edge computing paradigm to reduce latency and computational complexity, and improve the expandability and security. In this paper, we propose an integrated solution to stimulate the strategic users to contribute more for truth discovery in the edge-assisted mobile crowdsensing. We design an incentive mechanism consisting of truth discovery stage and budget feasible reverse auction stage. In truth discovery stage, we estimate the truth for each task in both deep cloud and edge cloud. In budget feasible reverse auction stage, we design a greedy algorithm to select the winners to maximize the quality function under the budget constraint. Through extensive simulations, we demonstrate that the proposed mechanism is computationally efficient, individually rational, truthful, budget feasible and constant approximate. Moreover, the proposed mechanism shows great superiority in terms of estimation precision and expandability. Full article
►▼ Show Figures

Figure 1

19 pages, 929 KiB  
Article
A Distributed Image Compression Scheme for Energy Harvesting Wireless Multimedia Sensor Networks
by Chong Han, Songtao Zhang, Biao Zhang, Jian Zhou and Lijuan Sun
Sensors 2020, 20(3), 667; https://0-doi-org.brum.beds.ac.uk/10.3390/s20030667 - 25 Jan 2020
Cited by 6 | Viewed by 2409
Abstract
As an emerging technology, edge computing will enable traditional sensor networks to be effective and motivate a series of new applications. Meanwhile, limited battery power directly affects the performance and survival time of sensor networks. As an extension application for traditional sensor networks, [...] Read more.
As an emerging technology, edge computing will enable traditional sensor networks to be effective and motivate a series of new applications. Meanwhile, limited battery power directly affects the performance and survival time of sensor networks. As an extension application for traditional sensor networks, the energy consumption of Wireless Multimedia Sensor Networks (WMSNs) is more prominent. For the image compression and transmission in WMSNs, consider using solar energy as the replenishment of node energy; a distributed image compression scheme based on solar energy harvesting is proposed. Two level clustering management is adopted. The camera node-normal node cluster enables camera nodes to gather and send collected raw images to the corresponding normal nodes for compression, and the normal node cluster enables the normal nodes to send the compressed images to the corresponding cluster head node. The re-clustering and dynamic adjustment methods for normal nodes are proposed to adjust adaptively the operation mode in the working chain. Simulation results show that the proposed distributed image compression scheme can effectively balance the energy consumption of the network. Compared with the existing image transmission schemes, the proposed scheme can transmit more and higher quality images and ensure the survival of the network. Full article
►▼ Show Figures

Figure 1

20 pages, 960 KiB  
Article
Mobility-Aware Service Caching in Mobile Edge Computing for Internet of Things
by Hua Wei, Hong Luo and Yan Sun
Sensors 2020, 20(3), 610; https://0-doi-org.brum.beds.ac.uk/10.3390/s20030610 - 22 Jan 2020
Cited by 30 | Viewed by 4377
Abstract
The mobile edge computing architecture successfully solves the problem of high latency in cloud computing. However, current research focuses on computation offloading and lacks research on service caching issues. To solve the service caching problem, especially for scenarios with high mobility in the [...] Read more.
The mobile edge computing architecture successfully solves the problem of high latency in cloud computing. However, current research focuses on computation offloading and lacks research on service caching issues. To solve the service caching problem, especially for scenarios with high mobility in the Sensor Networks environment, we study the mobility-aware service caching mechanism. Our goal is to maximize the number of users who are served by the local edge-cloud, and we need to make predictions about the user’s target location to avoid invalid service requests. First, we propose an idealized geometric model to predict the target area of a user’s movement. Since it is difficult to obtain all the data needed by the model in practical applications, we use frequent patterns to mine local moving track information. Then, by using the results of the trajectory data mining and the proposed geometric model, we make predictions about the user’s target location. Based on the prediction result and existing service cache, the service request is forwarded to the appropriate base station through the service allocation algorithm. Finally, to be able to train and predict the most popular services online, we propose a service cache selection algorithm based on back-propagation (BP) neural network. The simulation experiments show that our service cache algorithm reduces the service response time by about 13.21% on average compared to other algorithms, and increases the local service proportion by about 15.19% on average compared to the algorithm without mobility prediction. Full article
►▼ Show Figures

Figure 1

2019

Jump to: 2022, 2021, 2020, 2018

21 pages, 5458 KiB  
Article
A Fine-Grained Video Encryption Service Based on the Cloud-Fog-Local Architecture for Public and Private Videos
by Hao Li, Zhaoquan Gu, Lianbing Deng, Yi Han, Cheng Yang and Zhihong Tian
Sensors 2019, 19(24), 5366; https://0-doi-org.brum.beds.ac.uk/10.3390/s19245366 - 05 Dec 2019
Cited by 8 | Viewed by 3484
Abstract
With the advancement of cloud computing and fog computing, more and more services and data are being moved from local servers to the fog and cloud for processing and storage. Videos are an important part of this movement. However, security issues involved in [...] Read more.
With the advancement of cloud computing and fog computing, more and more services and data are being moved from local servers to the fog and cloud for processing and storage. Videos are an important part of this movement. However, security issues involved in video moving have drawn wide attention. Although many video-encryption algorithms have been developed to protect local videos, these algorithms fail to solve the new problems faced on the media cloud, such as how to provide a video encryption service to devices with low computing power, how to meet the different encryption requirements for different type of videos, and how to ensure massive video encryption efficiency. To solve these three problems, we propose a cloud-fog-local video encryption framework which consists of a three-layer service model and corresponding key management strategies, a fine-grain video encryption algorithm based on the network abstract layer unit (NALU), and a massive video encryption framework based on Spark. The experiment proves that our proposed solution can meet the different encryption requirements for public videos and private videos. Moreover, in the experiment environment, our encryption algorithm for public videos reaches a speed of 1708 Mbps, and can provide a real-time encryption service for at least 42 channels of 4K-resolution videos. Full article
►▼ Show Figures

Figure 1

18 pages, 1755 KiB  
Article
Intelligent Sensor-Cloud in Fog Computer: A Novel Hierarchical Data Job Scheduling Strategy
by Zeyu Sun, Chuanfeng Li, Lili Wei, Zhixian Li, Zhiyu Min and Guozeng Zhao
Sensors 2019, 19(23), 5083; https://0-doi-org.brum.beds.ac.uk/10.3390/s19235083 - 21 Nov 2019
Cited by 20 | Viewed by 2502
Abstract
In the Fog Computer (FC), the process of data is prone to problems such as low data similarity and poor data tolerance. This paper proposes a hierarchical data job scheduling strategy Based on Intelligent Sensor-Cloud in Fog Computer (HDJS). HDJS dynamically adjusts the [...] Read more.
In the Fog Computer (FC), the process of data is prone to problems such as low data similarity and poor data tolerance. This paper proposes a hierarchical data job scheduling strategy Based on Intelligent Sensor-Cloud in Fog Computer (HDJS). HDJS dynamically adjusts the priority of the job to avoid job starvation and maximize the use of resources, uses the key frame to the resource occupied information, distributes the frame sequence to the unit, and then combines the intra frame distribution strategy to balance the load between the nodes. The experimental results show our proposed strategy may be possible to avoid the operation of hunger and resource fragmentation problems, make full use of the advantages of multi-core and multi-thread, improve system resource utilization, and shorten the execution time and response time. Full article
►▼ Show Figures

Figure 1

13 pages, 1997 KiB  
Article
Outlier Detection Using Improved Support Vector Data Description in Wireless Sensor Networks
by Pei Shi, Guanghui Li, Yongming Yuan and Liang Kuang
Sensors 2019, 19(21), 4712; https://0-doi-org.brum.beds.ac.uk/10.3390/s19214712 - 30 Oct 2019
Cited by 5 | Viewed by 3044
Abstract
Wireless sensor networks (WSNs) are susceptible to faults in sensor data. Outlier detection is crucial for ensuring the quality of data analysis in WSNs. This paper proposes a novel improved support vector data description method (ID-SVDD) to effectively detect outliers of sensor data. [...] Read more.
Wireless sensor networks (WSNs) are susceptible to faults in sensor data. Outlier detection is crucial for ensuring the quality of data analysis in WSNs. This paper proposes a novel improved support vector data description method (ID-SVDD) to effectively detect outliers of sensor data. ID-SVDD utilizes the density distribution of data to compensate SVDD. The Parzen-window algorithm is applied to calculate the relative density for each data point in a data set. Meanwhile, we use Mahalanobis distance (MD) to improve the Gaussian function in Parzen-window density estimation. Through combining new relative density weight with SVDD, this approach can efficiently map the data points from sparse space to high-density space. In order to assess the outlier detection performance, the ID-SVDD algorithm was implemented on several datasets. The experimental results demonstrated that ID-SVDD achieved high performance, and could be applied in real water quality monitoring. Full article
►▼ Show Figures

Figure 1

38 pages, 2265 KiB  
Article
An Enhanced Virtual Force Algorithm for Diverse k-Coverage Deployment of 3D Underwater Wireless Sensor Networks
by Wenming Wang, Haiping Huang, Fan He, Fu Xiao, Xin Jiang and Chao Sha
Sensors 2019, 19(16), 3496; https://0-doi-org.brum.beds.ac.uk/10.3390/s19163496 - 09 Aug 2019
Cited by 21 | Viewed by 3038
Abstract
The combination of Wireless Sensor Networks (WSNs) and edge computing not only enhances their capabilities, but also motivates a series of new applications. As a typical application, 3D Underwater Wireless Sensor Networks (UWSNs) have become a hot research issue. However, the coverage of [...] Read more.
The combination of Wireless Sensor Networks (WSNs) and edge computing not only enhances their capabilities, but also motivates a series of new applications. As a typical application, 3D Underwater Wireless Sensor Networks (UWSNs) have become a hot research issue. However, the coverage of underwater sensor networks problem must be solved, for it has a great significance for the network’s capacity for information acquisition and environment perception, as well as its survivability. In this paper, we firstly study the minimal number of sensor nodes needed to build a diverse k-coverage sensor network. We then propose a k-Equivalent Radius enhanced Virtual Force Algorithm (called k-ERVFA) to achieve an uneven regional coverage optimization for different k-coverage requirements. Theoretical analysis and simulation experiments are carried out to demonstrate the effectiveness of our proposed algorithm. The detailed performance comparisons show that k-ERVFA acquires a better coverage rate in high k-coverage sub-regions, thus achieving a desirable diverse k-coverage deployment. Finally, we perform sensitivity analysis of the simulation parameters and extend k-ERVFA to special cases such as sensor-sparse regions and time-variant situations. Full article
►▼ Show Figures

Figure 1

17 pages, 1467 KiB  
Article
Real-Time Massive Vector Field Data Processing in Edge Computing
by Kun Zheng, Kang Zheng, Falin Fang, Hong Yao, Yunlei Yi and Deze Zeng
Sensors 2019, 19(11), 2602; https://0-doi-org.brum.beds.ac.uk/10.3390/s19112602 - 07 Jun 2019
Cited by 3 | Viewed by 3158
Abstract
The spread of the sensors and industrial systems has fostered widespread real-time data processing applications. Massive vector field data (MVFD) are generated by vast distributed sensors and are characterized by high distribution, high velocity, and high volume. As a result, computing such kind [...] Read more.
The spread of the sensors and industrial systems has fostered widespread real-time data processing applications. Massive vector field data (MVFD) are generated by vast distributed sensors and are characterized by high distribution, high velocity, and high volume. As a result, computing such kind of data on centralized cloud faces unprecedented challenges, especially on the processing delay due to the distance between the data source and the cloud. Taking advantages of data source proximity and vast distribution, edge computing is ideal for timely computing on MVFD. Therefore, we are motivated to propose an edge computing based MVFD processing framework. In particular, we notice that the high volume feature of MVFD results in high data transmission delay. To solve this problem, we invent Data Fluidization Schedule (DFS) in our framework to reduce the data block volume and the latency on Input/Output (I/O). We evaluated the efficiency of our framework in a practical application on massive wind field data processing for cyclone recognition. The high efficiency our framework was verified by the fact that it significantly outperformed classical big data processing frameworks Spark and MapReduce. Full article
►▼ Show Figures

Figure 1

21 pages, 3942 KiB  
Article
CMTN-SP: A Novel Coverage-Control Algorithm for Moving-Target Nodes Based on Sensing Probability Model in Sensor Networks
by Zeyu Sun, Xiaofei Xing, Ben Yan and Zhiguo Lv
Sensors 2019, 19(2), 257; https://0-doi-org.brum.beds.ac.uk/10.3390/s19020257 - 10 Jan 2019
Cited by 6 | Viewed by 2932
Abstract
The non-consecutive coverage problem for the target nodes in Sensor Networks could lead to the coverage blind area and a large amount of redundant data, which causes the bottleneck phenomenon for the communication link. A novel Coverage Control Algorithm for Moving Target Nodes [...] Read more.
The non-consecutive coverage problem for the target nodes in Sensor Networks could lead to the coverage blind area and a large amount of redundant data, which causes the bottleneck phenomenon for the communication link. A novel Coverage Control Algorithm for Moving Target Nodes Based on Sensing Probability Model (CMTN-SP) is proposed in this work. Firstly, according to the probability theory, we derive the calculation method for the expectation of the coverage quality with multiple joint nodes, which aims to reduce the coverage blind area and improving network coverage rate. Secondly, we employ the dynamic transferring mechanism of the nodes to re-optimize the deployment of the nodes, which alleviates the rapid exhaustion of the proper network energy. Finally, it is verified via the results of the simulation that the network coverage quality could not only be improved by the proposed algorithm, but the proposed algorithm could also effectively curb the rapid exhaustion of the node energy. Full article
►▼ Show Figures

Figure 1

2018

Jump to: 2022, 2021, 2020, 2019

15 pages, 1115 KiB  
Article
Answering the Min-Cost Quality-Aware Query on Multi-Sources in Sensor-Cloud Systems
by Mohan Li, Yanbin Sun, Yu Jiang and Zhihong Tian
Sensors 2018, 18(12), 4486; https://0-doi-org.brum.beds.ac.uk/10.3390/s18124486 - 18 Dec 2018
Cited by 21 | Viewed by 2914
Abstract
In sensor-based systems, the data of an object is often provided by multiple sources. Since the data quality of these sources might be different, when querying the observations, it is necessary to carefully select the sources to make sure that high quality data [...] Read more.
In sensor-based systems, the data of an object is often provided by multiple sources. Since the data quality of these sources might be different, when querying the observations, it is necessary to carefully select the sources to make sure that high quality data is accessed. A solution is to perform a quality evaluation in the cloud and select a set of high-quality, low-cost data sources (i.e., sensors or small sensor networks) that can answer queries. This paper studies the problem of min-cost quality-aware query which aims to find high quality results from multi-sources with the minimized cost. The measurement of the query results is provided, and two methods for answering min-cost quality-aware query are proposed. How to get a reasonable parameter setting is also discussed. Experiments on real-life data verify that the proposed techniques are efficient and effective. Full article
►▼ Show Figures

Figure 1

16 pages, 2534 KiB  
Article
Data Fusion Using Improved Support Degree Function in Aquaculture Wireless Sensor Networks
by Pei Shi, Guanghui Li, Yongming Yuan and Liang Kuang
Sensors 2018, 18(11), 3851; https://0-doi-org.brum.beds.ac.uk/10.3390/s18113851 - 09 Nov 2018
Cited by 15 | Viewed by 3819
Abstract
For monitoring the aquaculture parameters in pond with wireless sensor networks (WSN), high accuracy of fault detection and high precision of error correction are essential. However, collecting accurate data from WSN to server or cloud is a bottleneck because of the data faults [...] Read more.
For monitoring the aquaculture parameters in pond with wireless sensor networks (WSN), high accuracy of fault detection and high precision of error correction are essential. However, collecting accurate data from WSN to server or cloud is a bottleneck because of the data faults of WSN, especially in aquaculture applications, limits their further development. When the data fault occurs, data fusion mechanism can help to obtain corrected data to replace abnormal one. In this paper, we propose a data fusion method using a novel function that is Dynamic Time Warping time series strategy improved support degree (DTWS-ISD) for enhancing data quality, which employs a Dynamic Time Warping (DTW) time series segmentation strategy to the improved support degree (ISD) function. We use the DTW distance to replace Euclidean distance, which can explore the continuity and fuzziness of data streams, and the time series segmentation strategy is adopted to reduce the computation dimension of DTW algorithm. Unlike Gauss support function, ISD function obtains mutual support degree of sensors without the exponent calculation. Several experiments were finished to evaluate the accuracy and efficiency of DTWS-ISD with different performance metrics. The experimental results demonstrated that DTWS-ISD achieved better fusion precision than three existing functions in a real-world WSN water quality monitoring application. Full article
►▼ Show Figures

Figure 1

Back to TopTop