Search

Recent advances in Internet of Things (IoT) technologies and the reduction in the cost of sensors have encouraged the development of smart environments, such as smart homes. Smart homes can offer home assistance services to improve the quality of life, autonomy, and health of their residents, especially for the elderly and dependent. To provide such services, a smart home must be able to understand the daily activities of its residents. Techniques for recognizing human activity in smart homes are advancing daily. However, new challenges are emerging every day. In this paper, we present recent algorithms, works, challenges, and taxonomy of the field of human activity recognition in a smart home through ambient sensors. Moreover, since activity recognition in smart homes is a young field, we raise specific problems, as well as missing and needed contributions. However, we also propose directions, research opportunities, and solutions to accelerate advances in this field. [ABSTRACT FROM AUTHOR]

Several emerging areas like the Internet of Things, sensor networks, healthcare and distributed networks feature resource-constrained devices that share secure and privacy-preserving data to accomplish some goal. The majority of standard cryptographic algorithms do not fit with these constrained devices due to heavy cryptographic components. In this paper, a new block cipher, BRISK, is proposed with a block size of 32-bit. The cipher design is straightforward due to simple round operations, and these operations can be efficiently run in hardware and suitable for software. Another major concept used with this cipher is dynamism during encryption for each session; that is, instead of using the same encryption algorithm, participants use different ciphers for each session. Professor Lars R. Knudsen initially proposed dynamic encryption in 2015, where the sender picks a cipher from a large pool of ciphers to encrypt the data and send it along with the encrypted message. The receiver does not know about the encryption technique used before receiving the cipher along with the message. However, in the proposed algorithm, instead of choosing a new cipher, the process uses the same cipher for each session, but varies the cipher specifications from a given small pool, e.g., the number of rounds, cipher components, etc. Therefore, the dynamism concept is used here in a different way. [ABSTRACT FROM AUTHOR]

State-of-the-art scenarios, such as Internet of Things (IoT) and Smart Cities, have recently arisen. They involve the processing of huge data sets under strict time requirements, rendering the use of cloud resources unfeasible. For this reason, Fog computing has been proposed as a solution; however, there remains a need for intelligent allocation decisions, in order to make it a fully usable solution in such contexts. In this paper, a network-aware scheduling algorithm is presented, which aims to select the fog node most suitable for the execution of an application within a given deadline. This decision is made taking the status of the network into account. This scheduling algorithm was implemented as an extension to the Kubernetes default scheduler, and compared with existing proposals in the literature. The comparison shows that our proposal is the only one that can execute all the submitted jobs within their deadlines (i.e., no job is rejected or executed exceeding its deadline) with certain configurations in some of the scenarios tested, thus obtaining an optimal solution in such scenarios. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) in the role of flying anchor nodes have been proposed to assist the localisation of terrestrial Internet of Things (IoT) sensors and provide relay services in the context of the upcoming 6G networks. This paper considered the objective of tracing a mobile IoT device of unknown location, using a group of UAVs that were equipped with received signal strength indicator (RSSI) sensors. The UAVs employed measurements of the target's radio frequency (RF) signal power to approach the target as quickly as possible. A deep learning model performed clustering in the UAV network at regular intervals, based on a graph convolutional network (GCN) architecture, which utilised information about the RSSI and the UAV positions. The number of clusters was determined dynamically at each instant using a heuristic method, and the partitions were determined by optimising an RSSI loss function. The proposed algorithm retained the clusters that approached the RF source more effectively, removing the rest of the UAVs, which returned to the base. Simulation experiments demonstrated the improvement of this method compared to a previous deterministic approach, in terms of the time required to reach the target and the total distance covered by the UAVs. [ABSTRACT FROM AUTHOR]

Ambient energy-powered sensors are becoming increasingly crucial for the sustainability of the Internet-of-Things (IoT). In particular, batteryless sensors are a cost-effective solution that require no battery maintenance, last longer and have greater weatherproofing properties due to the lack of a battery access panel. In this work, we study adaptive transmission algorithms to improve the performance of batteryless IoT sensors based on the LoRa protocol. First, we characterize the device power consumption during sensor measurement and/or transmission events. Then, we consider different scenarios and dynamically tune the most critical network parameters, such as inter-packet transmission time, data redundancy and packet size, to optimize the operation of the device. We design appropriate capacity-based storage, considering a renewable energy source (e.g., photovoltaic panel), and we analyze the probability of energy failures by exploiting both theoretical models and real energy traces. The results can be used as feedback to re-design the device to have an appropriate amount energy storage and meet certain reliability constraints. Finally, a cost analysis is also provided for the energy characteristics of our system, taking into account the dimensioning of both the capacitor and solar panel. [ABSTRACT FROM AUTHOR]

Localization is one of the essential problems in internet of things (IoT) and wireless sensor network (WSN) applications. However, most traditional range-free localization algorithms cannot fulfill the practical demand for high localization accuracy. Therefore, a localization algorithm based on an enhanced flower pollination algorithm (FPA) with Gaussian perturbation (EFPA-G) and the DV-Hop method is proposed.FPA is widely applied, but premature convergence still cannot be avoided. How to balance its global exploration and local exploitation capabilities still remains an outstanding problem. Therefore, the following improvement schemes are introduced. A search strategy based on Gaussian perturbation is proposed to solve the imbalance between the global exploration and local exploitation search capabilities. Meanwhile, to fully exploit the variability of population information, an enhanced strategy is proposed based on optimal individual and Lévy flight. Finally, in the experiments with 26 benchmark functions and WSN simulations, the former verifies that the proposed algorithm outperforms other state-of-the-art algorithms in terms of convergence and search capability. In the simulation experiment, the best value for the normalized mean squared error obtained by the most advanced algorithm, RACS, is 20.2650%, and the best value for the mean distance error is 5.07E+00. However, EFPA-G reached 19.5182% and 4.88E+00, respectively. It is superior to existing algorithms in terms of positioning, accuracy, and robustness. [ABSTRACT FROM AUTHOR]

Bluetooth Low Energy (BLE) is a popular wireless communication protocol heavily used in Internet of Things applications. Nowadays, robustness is considered a key requirement in wireless communication. However, radio interference from various sources may affect the performance of BLE devices, leading to channel congestion. Therefore, there is a broadly recognized need of methodologies capable of sensing and avoiding interference. In this paper, two improvements at the data link layer for interference detection and channel selection are proposed to enhance the BLE connection robustness. This paper also presents a wide range of experimental evaluations aiming at validating the improvements and providing insights on both these improvements. Particularly, the communication performance of the BLE link layer is assessed in terms of channel usage distribution, supervision timeout ratio (STR) and packet loss rate (PLR) under different interference environments. Results from these experiments (reliability over 97% and 99% under two different harsh environments) highlight the effects of both improvements on the BLE robustness. Meanwhile, the authority of scheduling the whole mechanism is given to the link layer and even the higher application layer. This paper provides a set of solutions for BLE confronting interference in link layer. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) devices rely upon remote firmware updates to fix bugs, update embedded algorithms, and make security enhancements. Remote firmware updates are a significant burden to wireless IoT devices that operate using low-power wide-area network (LPWAN) technologies due to slow data rates. One LPWAN technology, Long Range (LoRa), has the ability to increase the data rate at the expense of range and noise immunity. The optimization of communications for maximum speed is known as adaptive data rate (ADR) techniques, which can be applied to accelerate the firmware update process for any LoRa-enabled IoT device. In this paper, we investigate ADR techniques in an application that provides remote monitoring of cattle using small, battery-powered devices that transmit data on cattle location and health using LoRa. In addition to issues related to firmware update speed, there are significant concerns regarding reliability and security when updating firmware on mobile, energy-constrained devices. A malicious actor could attempt to steal the firmware to gain access to embedded algorithms or enable faulty behavior by injecting their own code into the device. A firmware update could be subverted due to cattle moving out of the LPWAN range or the device battery not being sufficiently charged to complete the update process. To address these concerns, we propose a secure and reliable firmware update process using ADR techniques that is applicable to any mobile or energy-constrained LoRa device. The proposed system is simulated and then implemented to evaluate its performance and security properties. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient way to find a gateway deployment for a given sensor network topology. We assume that the expired sensors and gateways can be replaced and the locations of the gateways are chosen among the given sensor nodes. The objective is to find a gateway deployment that minimizes the cost per unit time, which consists of the maintenance and installation costs. The proposed algorithm creates a cost reference and uses it to find the optimal deployment via a divide and conquer algorithm. Comparing all cases is the most reliable way to find the optimal gateway deployment, but this is practically impossible to calculate, since its computation time increases exponentially as the number of nodes increases. The method we propose increases linearly, and so is suitable for large scale networks. Additionally, compared to stochastic algorithms such as the genetic algorithm, this methodology has advantages in computational speed and accuracy for a large number of nodes. We also verify our methodology through several numerical experiments. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

As a key technology of the Internet of Things, wireless sensor network (WSN) has been used widely in indoor localization systems. However, when the sensor is transmitting signals, it is affected by the non-line-of-sight (NLOS) transmission, and the accuracy of the positioning result is decreased. Therefore, solving the problem of NLOS positioning has become a major focus for indoor positioning. This paper focuses on solving the problem of NLOS transmission that reduces positioning accuracy in indoor positioning. We divided the anchor nodes into several groups and obtained the position information of the target node for each group through the maximum likelihood estimation (MLE). By identifying the NLOS method, a part of the position estimates polluted by NLOS transmission was discarded. For the position estimates that passed the hypothesis testing, a corresponding poly-probability matrix was established, and the probability of each position estimate from line-of-sight (LOS) and NLOS was calculated. The position of the target was obtained by combining the probability with the position estimate. In addition, we also considered the case where there was no continuous position estimation through hypothesis testing and through the NLOS tracking method to avoid positioning errors. Simulation and experimental results show that the algorithm proposed has higher positioning accuracy and higher robustness than other algorithms. [ABSTRACT FROM AUTHOR]

A progressive paradigm shift from centralized to distributed network architectures has been consolidated since the 4G communication standard, calling for novel decision-making mechanisms with distributed control to operate at the network edge. This situation implies that each base station (BS) must manage resources independently to meet the quality of service (QoS) of existing human-type communication devices (HTC), as well as the emerging machine type communication (MTC) devices from the internet of things (IoT). In this paper, we address the BS assignment problem, whose aim is to determine the most appropriate serving BS to each mobile device. This problem is formulated as an optimization problem for maximizing the system throughput and imposing constraints on the air interface and backhaul resources. The assignment problem is challenging to solve, so we present a simple yet valid reformulation of the original problem while using dual decomposition theory. Subsequently, we propose a distributed price-based BS assignment algorithm that performs at each BS the assignment process, where a novel pricing update scheme is presented. The simulation results show that our proposed solution outperforms traditional maximum signal to interference plus noise ratio (Max-SINR) and minimum path-loss (Min-PL) approaches in terms of system throughput. [ABSTRACT FROM AUTHOR]

To provide high-precision positioning for Internet of Things (IoT) scenarios, we optimize the indoor positioning technique based on Ultra-Wideband (UWB) Time Difference of Arrival (TDOA) equipment. This paper analyzes sources of positioning error and improves the time synchronization algorithm based on the synchronization packet. Then we use the labels of the known position to further optimize the time synchronization performance, and hence improve TDOA measurements. After time synchronization optimization, a Weighted Least Square (WLS) and Taylor coordination algorithm is derived. Experiments show that our optimization reduces the average positioning error from 54.8 cm to 12.6 cm. [ABSTRACT FROM AUTHOR]

In this paper, a novel beamforming technique is proposed as the over-the-air computation (AirComp) framework in a multiple-input multiple-output (MIMO) Internet-of-things (IoT) network consisting of multiple IoT sensors (STAs) and a single access point (AP). We assume that each IoT device has the channel state information (CSI) from itself to the AP and the AP has the global CSI of all IoT devices. We consider the mean squared error (MSE), which represents the reliability of function computation, as a performance metric. In short, each IoT device exploits maximum-ratio transmission (MRT) as a transmit beamforming technique to improve MSE performance by taking full advantage of multiple transmit antennae. Moreover, for the receive beamforming, we first consider a receive antenna selection (RAS) technique as the simplest beamforming method at the AP. Then, a semi-definite relaxation (SDR) method and a successive convex approximation (SCA) algorithm are considered and compared with each other in terms of MSE. Finally, we propose a novel two-step beamforming algorithm to further improve the MSE performance of the aforementioned techniques. We have numerically verified through computer simulations that the proposed framework has an improved MSE performance of about 6dB compared to the conventional single-input multiple-output (SIMO) AirComp, even with only two transmit antennae, and the modified MRT outperforms the other transmit beamforming techniques. Furthermore, the proposed receive beamforming technique, a two-step algorithm, shows the best performance in terms of MSE compared to prior studies. [ABSTRACT FROM AUTHOR]

Recent advancements in cloud computing, artificial intelligence, and the internet of things (IoT) create new opportunities for autonomous industrial environments monitoring. Nevertheless, detecting anomalies in harsh industrial settings remains challenging. This paper proposes an edge-fog-cloud architecture with mobile IoT edge nodes carried on autonomous robots for thermal anomalies detection in aluminum factories. We use companion drones as fog nodes to deliver first response services and a cloud back-end for thermal anomalies analysis. We also propose a self-driving deep learning architecture and a thermal anomalies detection and visualization algorithm. Our results show our robot surveyors are low-cost, deliver reduced response time, and more accurately detect anomalies compared to human surveyors or fixed IoT nodes monitoring the same industrial area. Our self-driving architecture has a root mean square error of 0.19 comparable to VGG-19 with a significantly reduced complexity and three times the frame rate at 60 frames per second. Our thermal to visual registration algorithm maximizes mutual information in the image-gradient domain while adapting to different resolutions and camera frame rates. [ABSTRACT FROM AUTHOR]

Although the number of Internet of Things devices increases every year, efforts to decrease hardware energy demands and to improve efficiencies of the energy-harvesting stages have reached an ultra-low power level. However, no current standard of wireless communication protocol (WCP) can fully address those scenarios. Our focus in this paper is to introduce treNch, a novel WCP implementing the cross-layer principle to use the power input for adapting its operation in a dynamic manner that goes from pure best-effort to nearly real time. Together with the energy-management algorithm, it operates with asynchronous transmissions, synchronous and optional receptions, short frame sizes and a light architecture that gives control to the nodes. These features make treNch an optimal option for wireless sensor networks with ultra-low power demands and severe energy fluctuations. We demonstrate through a comparison with different modes of Bluetooth Low Energy (BLE) a decrease of the power consumption in 1 to 2 orders of magnitude for different scenarios at equal quality of service. Moreover, we propose some security optimizations, such as shorter over-the-air counters, to reduce the packet overhead without decreasing the security level. Finally, we discuss other features aside of the energy needs, such as latency, reliability or topology, brought again against BLE. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has evolved significantly with advances in gathering data that can be extracted to provide knowledge and facilitate decision-making processes. Currently, IoT data analytics encountered challenges such as growing data volumes collected by IoT devices and fast response requirements for time-sensitive applications in which traditional Cloud-based solution is unable to meet due to bandwidth and high latency limitations. In this paper, we develop a distributed analytics framework for fog-enabled IoT systems aiming to avoid raw data movement and reduce latency. The distributed framework leverages the computational capacities of all the participants such as edge devices and fog nodes and allows them to obtain the global optimal solution locally. To further enhance the privacy of data holders in the system, a privacy-preserving protocol is proposed using cryptographic schemes. Security analysis was conducted and it verified that exact private information about any edge device's raw data would not be inferred by an honest-but-curious neighbor in the proposed secure protocol. In addition, the accuracy of solution is unaffected in the secure protocol comparing to the proposed distributed algorithm without encryption. We further conducted experiments on three case studies: seismic imaging, diabetes progression prediction, and Enron email classification. On seismic imaging problem, the proposed algorithm can be up to one order of magnitude faster than the benchmarks in reaching the optimal solution. The evaluation results validate the effectiveness of the proposed methodology and demonstrate its potential to be a promising solution for data analytics in fog-enabled IoT systems. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) for smart industry requires the surveillance and management of people and objects. The ultra-wideband positioning system is an attractive solution for achieving centimeter-level accuracy in target location. While many studies have focused on improving the accuracy of the anchor coverage range, it is important to note that in practical applications, positioning areas are often limited and obstructed by furniture, shelves, pillars, or walls, which can restrict the placement of anchors. Furthermore, some positioning regions are located beyond anchor coverage, and a single group with few anchors may not be able to cover all rooms and aisles on a floor due to non-line-of-sight errors causing severe positioning errors. In this work, we propose a dynamic-reference anchor time difference of arrival (TDOA) compensation algorithm to enhance accuracy beyond anchor coverage by eliminating local minima of the TDOA loss function near anchors. We designed a multidimensional and multigroup TDOA positioning system with the aim of broadening the coverage of indoor positioning and accommodating complex indoor environments. By employing an address-filter technique and group-switching process, tags can seamlessly move between groups with a high positioning rate, low latency, and high accuracy. We deployed the system in a medical center to locate and manage researchers with infectious medical waste, demonstrating its usefulness for practical healthcare institutions. Our proposed positioning system can thus facilitate precise and wide-range indoor and outdoor wireless localization. [ABSTRACT FROM AUTHOR]

Energy-efficient routing protocols in Internet of Things (IoT) applications are always of colossal importance as they improve the network's longevity. The smart grid (SG) application of the IoT uses advanced metring infrastructure (AMI) to read and record power consumption periodically or on demand. The AMI sensor nodes in a smart grid network sense, process, and transmit information, which require energy, which is a limited resource and is an important parameter required to maintain the network for a longer duration. The present work discusses a novel energy-efficient routing criterion in an SG environment realised using LoRa nodes. Firstly, a modified LEACH protocol–cumulative low-energy adaptive clustering hierarchy (Cum_LEACH) is proposed for cluster head selection among the nodes. It uses the cumulative energy distribution of the nodes to select the cluster head. Furthermore, for test packet transmission, multiple optimal paths are created using the quadratic kernelised African-buffalo-optimisation-based LOADng (qAB_LOADng) algorithm. The best optimal path is selected from these multiple paths using a modified version of the MAX algorithm called the SMAx algorithm. This routing criterion showed an improved energy consumption profile of the nodes and the number of active nodes after running for 5000 iterations compared to standard routing protocols such as LEACH, SEP, and DEEC. [ABSTRACT FROM AUTHOR]

In the Internet of Things (IoT), Low-Power Wide-Area Networks (LPWANs) are designed to provide low energy consumption while maintaining a long communications' range for End Devices (EDs). LoRa is a communication protocol that can cover a wide range with low energy consumption. To evaluate the efficiency of the LoRa Wide-Area Network (LoRaWAN), three criteria can be considered, namely, the Packet Delivery Rate (PDR), Energy Consumption (EC), and coverage area. A set of transmission parameters have to be configured to establish a communication link. These parameters can affect the data rate, noise resistance, receiver sensitivity, and EC. The Adaptive Data Rate (ADR) algorithm is a mechanism to configure the transmission parameters of EDs aiming to improve the PDR. Therefore, we introduce a new algorithm using the Multi-Armed Bandit (MAB) technique, to configure the EDs' transmission parameters in a centralized manner on the Network Server (NS) side, while improving the EC, too. The performance of the proposed algorithm, the Low-Power Multi-Armed Bandit (LP-MAB), is evaluated through simulation results and is compared with other approaches in different scenarios. The simulation results indicate that the LP-MAB's EC outperforms other algorithms while maintaining a relatively high PDR in various circumstances. [ABSTRACT FROM AUTHOR]

Computing has undergone a significant transformation over the past two decades, shifting from a machine-based approach to a human-centric, virtually invisible service known as ubiquitous or pervasive computing. This change has been achieved by incorporating small embedded devices into a larger computational system, connected through networking and referred to as edge devices. When these devices are also connected to the Internet, they are generally named Internet-of-Thing (IoT) devices. Developing Machine Learning (ML) algorithms on these types of devices allows them to provide Artificial Intelligence (AI) inference functions such as computer vision, pattern recognition, etc. However, this capability is severely limited by the device's resource scarcity. Embedded devices have limited computational and power resources available while they must maintain a high degree of autonomy. While there are several published studies that address the computational weakness of these small systems-mostly through optimization and compression of neural networks- they often neglect the power consumption and efficiency implications of these techniques. This study presents power efficiency experimental results from the application of well-known and proven optimization methods using a set of well-known ML models. The results are presented in a meaningful manner considering the "real world" functionality of devices and the provided results are compared with the basic "idle" power consumption of each of the selected systems. Two different systems with completely different architectures and capabilities were used providing us with results that led to interesting conclusions related to the power efficiency of each architecture. [ABSTRACT FROM AUTHOR]

Network security is a crucial challenge facing Internet-of-Things (IoT) systems worldwide, which leads to serious safety alarms and great economic loss. This paper studies the problem of malicious interdicting network exploitation of IoT systems that are modeled as a bi-layer logical–physical network. In this problem, a virtual attack takes place at the logical layer (the layer of Things), while the physical layer (the layer of Internet) provides concrete support for the attack. In the interdiction problem, the attacker attempts to access a target node on the logical layer with minimal communication cost, but the defender can strategically interdict some key edges on the physical layer given a certain budget of interdiction resources. This setting generalizes the classic single-layer shortest-path network interdiction problem, but brings in nonlinear objective functions, which are notoriously challenging to optimize. We reformulate the model and apply Benders decomposition process to solve this problem. A layer-mapping module is introduced to improve the decomposition algorithm and a random-search process is proposed to accelerate the convergence. Extensive numerical experiments demonstrate the computational efficiency of our methods. [ABSTRACT FROM AUTHOR]

As medical technologies are continuously evolving, consumer involvement in health is also increasing significantly. The integration of the Internet of Things (IoT) concept in the health domain may improve the quality of healthcare through the use of wearable sensors and the acquisition of vital and environmental parameters. Currently, there is significant progress in developing new approaches to provide medical care and maintain the safety of the life of the population remotely and around the clock. Despite the standards for emissions of harmful substances into the atmosphere established by the legislation of different countries, the level of pollutants in the air often exceeds the permissible limits, which is a danger not only for the population but also for the environment as a whole. To control the situation an Air Quality Index (AQI) was introduced. For today, many works discuss AQI, however, most of them are aimed rather at studying the methodologies for calculating the index and comparing air quality in certain regions of different countries, rather than creating a system that will not only calculate the index in real-time but also make it publicly available and understandable to the population. Therefore we would like to present a decision support algorithm for a solution called "Environmental Sensing to Act for a Better Quality of Life: Smart Health" with the primary goal of ensuring the transformation of raw environmental data collected by special sensors (data which typically require scientific interpretation) into a form that can be easily understood by the average user; this is achieved through the proposed algorithm. The obtained result is a system that increases the self-awareness and self-adaptability of people in environmental monitoring by offering easy to read and understand suggestions. The algorithm considers three types of parameters (concentration of PM10 (particulate matter), PM2.5, and NO2) and four risk levels for each of them. The technical implementation is presented in a step-like procedure and includes all the details (such as calculating the Air Quality Index—AQI, for each parameter). The results are presented in a front-end where the average user can observe the results of the measurements and the suggestions for decision support. This paper presents a supporting decision algorithm, highlights the basic concept that was used in the development process, and discusses the result of the implementation of the proposed solution. [ABSTRACT FROM AUTHOR]

The publish/subscribe model has gained prominence in the Internet of things (IoT) network, and both Message Queue Telemetry Transport (MQTT) and Constrained Application Protocol (CoAP) support it. However, existing coverage-based fuzzers may miss some paths when fuzzing such publish/subscribe protocols, because they implicitly assume that there are only two parties in a protocol, which is not true now since there are three parties, i.e., the publisher, the subscriber and the broker. In this paper, we propose MultiFuzz, a new coverage-based multiparty-protocol fuzzer. First, it embeds multiple-connection information in a single input. Second, it uses a message mutation algorithm to stimulate protocol state transitions, without the need of protocol specifications. Third, it uses a new desockmulti module to feed the network messages into the program under test. desockmulti is similar to desock (Preeny), a tool widely used by the community, but it is specially designed for fuzzing and is 10x faster. We implement MultiFuzz based on AFL, and use it to fuzz two popular projects Eclipse Mosquitto and libCoAP. We reported discovered problems to the projects. In addition, we compare MultiFuzz with AFL and two state-of-the-art fuzzers, MOPT and AFLNET, and find it discovering more paths and crashes. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) has become the driving force in modern day technology with an increasing and rapid urge to create an intelligent, efficient, and connected world. IoT is used in manufacturing, agriculture, transportation, education, healthcare and many other business environments as well as home automation. Authentication for IoT devices is essential because many of these devices establish communication with servers through public networks. A rigorous lightweight device authentication scheme is needed to secure its physical hardware from cloning or side-channel attacks and accommodate the limited storage and computational power of IoT devices in an efficient manner. In this paper, we introduce a lightweight mutual two-factor authentication mechanism where an IoT device and the server authenticate each other. The proposed mechanism exploits Physical Unclonable Functions (PUFs) and a hashing algorithm with the purpose of achieving a secure authentication and session key agreement between the IoT device and the server. We conduct a type of formal analysis to validate the protocol's security. We also validate that the proposed authentication mechanism is secure against different types of attack scenarios and highly efficient in terms of memory storage, server capacity, and energy consumption with its low complexity cost and low communication overhead. In this sense, the proposed authentication mechanism is very appealing and suitable for resource-constrained and security-critical environments. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) environment consists of numerous devices. In general, IoT devices communicate with each other to exchange data, or connect to the Internet through a gateway to provide IoT services. Most IoT devices participating in the IoT service are lightweight devices, in which the existing cryptographic algorithm cannot be applied to provide security, so a more lightweight security algorithm must be applied. Cryptographic technologies to lighten and provide efficiency for IoT environments are currently being studied a lot. In particular, it is necessary to provide efficiency for computation at a gateway, a point where many devices are connected. Additionally, as many devices are connected, data authentication and integrity should be fully considered at the same time, and thus digital signature schemes have been proposed. Among the recently studied signature algorithms, the certificateless signature (CLS) based on certificateless public key cryptography (CL-PKC) provides efficiency compared to existing public key-based signatures. However, in CLS, security threats, such as public key replacement attacks and signature forgery by the malicious key generation center (KGC), may occur. In this paper, we propose a new signature scheme using CL-PKC in generating and verifying the signature of a message in an IoT environment. The proposed scheme is a certificateless aggregate arbitrated signature, and the gateway aggregates the signatures of messages generated by the device group to reduce the size of the entire signature. In addition, it is designed to be safe from security threats by solving the problems caused by public key replacement attacks and malicious KGC, and adding arbitrated signatures of the gateway to strengthen non-repudiation. [ABSTRACT FROM AUTHOR]

Along with the recent growth of Internet of Things (IoT) security camera market, there have been a number of personal information leakage incidents from security attacks targeting such cameras. Therefore, a permutation-based video encryption algorithm was proposed to secure video streams in low-performance processors such as IoT security cameras. However, existing permutation-based video encryption algorithms are vulnerable to known-plaintext attacks since they use the same permutation list for every frame. Moreover, situation deduction based on the color composition is possible. In this paper, we propose a new permutation-based video encryption algorithm that updates the permutation list for every frame using a crypto secure pseudo-random number generator without significantly increasing memory usage. By doing so, the algorithm becomes robust to known-plaintext attacks, which has been a common problem with existing permutation-based video encryption algorithms. In addition, color channel separation can prevent attackers from deducing situations through color composition. Pre-compression encryption is applied to make the algorithm robust to data loss because of packet loss. We implement the proposed algorithm and conduct an experiment to show its performance in terms of probability of data loss because of packet loss, encryption speed, and memory usage. [ABSTRACT FROM AUTHOR]

Parked vehicle edge computing (PVEC) utilizes both idle resources in parked vehicles (PVs) and roadside units (RSUs) as service providers (SPs) to improve the performance of vehicular internet of things (IoT). However, it is difficult to make optimal service migration decisions in PVEC networks due to the uncertain parking duration and resources heterogeneity of PVs. In this paper, we formulate the service migration of all the vehicles as an optimization problem with the objective of minimizing the average latency. We propose a two-stage service migration algorithm for PVEC networks, which divides the original problem into the service migration between SPs and the serving PV selection in parking lots. The service migration between SPs is transformed to an online problem based on Lyapunov optimization, where the expected parking duration of PVs is utilized. A modified Hungarian algorithm is proposed to select the PVs for migration. A series of simulation experiments based on the real-world vehicle traces are conducted to verify the superior performance of the proposed two-stage service migration (SEA) algorithm as compared with the state-of- art solutions. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is widely applied in modern human life, e.g., smart home and intelligent transportation. However, it is vulnerable to malicious attacks, and the current existing security mechanisms cannot completely protect the IoT. As a security technology, intrusion detection can defend IoT devices from most malicious attacks. However, unfortunately the traditional intrusion detection models have defects in terms of time efficiency and detection efficiency. Therefore, in this paper, we propose an improved linear discriminant analysis (LDA)-based extreme learning machine (ELM) classification for the intrusion detection algorithm (ILECA). First, we improve the linear discriminant analysis (LDA) and then use it to reduce the feature dimensions. Moreover, we use a single hidden layer neural network extreme learning machine (ELM) algorithm to classify the dimensionality-reduced data. Considering the high requirement of IoT devices for detection efficiency, our scheme not only ensures the accuracy of intrusion detection, but also improves the execution efficiency, which can quickly identify the intrusion. Finally, we conduct experiments on the NSL-KDD dataset. The evaluation results show that the proposed ILECA has good generalization and real-time characteristics, and the detection accuracy is up to 92.35%, which is better than other typical algorithms. [ABSTRACT FROM AUTHOR]

In business, managers may use the association information among products to define promotion and competitive strategies. The mining of high-utility association rules (HARs) from high-utility itemsets enables users to select their own weights for rules, based either on the utility or confidence values. This approach also provides more information, which can help managers to make better decisions. Some efficient methods for mining HARs have been developed in recent years. However, in some decision-support systems, users only need to mine a smallest set of HARs for efficient use. Therefore, this paper proposes a method for the efficient mining of non-redundant high-utility association rules (NR-HARs). We first build a semi-lattice of mined high-utility itemsets, and then identify closed and generator itemsets within this. Following this, an efficient algorithm is developed for generating rules from the built lattice. This new approach was verified on different types of datasets to demonstrate that it has a faster runtime and does not require more memory than existing methods. The proposed algorithm can be integrated with a variety of applications and would combine well with external systems, such as the Internet of Things (IoT) and distributed computer systems. Many companies have been applying IoT and such computing systems into their business activities, monitoring data or decision-making. The data can be sent into the system continuously through the IoT or any other information system. Selecting an appropriate and fast approach helps management to visualize customer needs as well as make more timely decisions on business strategy. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC)-enabled satellite–terrestrial networks (STNs) can provide task computing services for Internet of Things (IoT) devices. However, since some applications' tasks require huge amounts of computing resources, sometimes the computing resources of a local satellite's MEC server are insufficient, but the computing resources of neighboring satellites' MEC servers are redundant. Therefore, we investigated inter-satellite cooperation in MEC-enabled STNs. First, we designed a system model of the MEC-enabled STN architecture, where the local satellite and the neighboring satellites assist IoT devices in computing tasks through inter-satellite cooperation. The local satellite migrates some tasks to the neighboring satellites to utilize their idle resources. Next, the task completion delay minimization problem for all IoT devices is formulated and decomposed. Then, we propose an inter-satellite cooperative joint offloading decision and resource allocation optimization scheme, which consists of a task offloading decision algorithm based on the Grey Wolf Optimizer (GWO) algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method. The optimal solution is obtained by continuous iterations. Finally, simulation results demonstrate that the proposed scheme achieves relatively better performance than other baseline schemes. [ABSTRACT FROM AUTHOR]

Quadrotor unmanned aerial vehicles (UAVs) are widely used as flexible and mobile access points and information carriers for the future Internet of Things (IoT). This work studies a quadrotor UAV-assisted IoT network, where the UAV helps to collect sensing data from a group of IoT users. Our goal is to optimize the UAV's overall energy consumption required to complete the sensing task. Firstly, we propose a more accurate and mathematically tractable model to characterize the UAV's real-time energy consumption, which accounts for the UAV's dynamics, brushless direct current (BLDC) motor dynamics and aerodynamics. Then, we can show that the UAV's circular flight based on the proposed energy-consumption model consumes less energy than that of hover flight. Therefore, a fly–circle–communicate (FCC) trajectory design algorithm, adopting Dubins curves for circular flight, is proposed and derived to save energy and increase flight duration. Employing the FCC strategy, the UAV moves to each IoT user and implements a circular flight in the sequence solved by the travelling-salesman-problem (TSP) algorithm. Finally, we evaluate the efficiency of the proposed algorithm in a mobile sensing network by comparing the proposed algorithm with the conventional hover-communicate (HC) algorithm in terms of energy consumption. Numerical results show that the FCC algorithm reduces energy consumption by 1–10% compared to the HC algorithm, and also improves the UAV's flight duration and the sensing network's service range. [ABSTRACT FROM AUTHOR]

We consider real-life smart parking systems where parking lot occupancy data are collected from field sensor devices and sent to backend servers for further processing and usage for applications. Our objective is to make these data useful to end users, such as parking managers, and, ultimately, to citizens. To this end, we concoct and validate an automated classification algorithm having two objectives: (1) outlier detection: to detect sensors with anomalous behavioral patterns, i.e., outliers; and (2) clustering: to group the parking sensors exhibiting similar patterns into distinct clusters. We first analyze the statistics of real parking data, obtaining suitable simulation models for parking traces. We then consider a simple classification algorithm based on the empirical complementary distribution function of occupancy times and show its limitations. Hence, we design a more sophisticated algorithm exploiting unsupervised learning techniques (self-organizing maps). These are tuned following a supervised approach using our trace generator and are compared against other clustering schemes, namely expectation maximization, k-means clustering and DBSCAN, considering six months of data from a real sensor deployment. Our approach is found to be superior in terms of classification accuracy, while also being capable of identifying all of the outliers in the dataset. [ABSTRACT FROM AUTHOR]

In most of the application scenarios of industrial control systems, the switching threshold of a device, such as a street light system, is typically set to a fixed value. To meet the requirements for a smart city, it is necessary to set a threshold that is adaptive to different conditions by fusing the multi-attribute observations of the sensors. This paper proposes a multi-attribute fusion algorithm based on fuzzy clustering and improved evidence theory. All of the observations are clustered by fuzzy clustering, where a proper clustering method is chosen, and the improved evidence theory is used to fuse the observations. In the experiments, two-dimensional observations for the street light illumination and for the ambient illumination are used in a campus-intelligent lighting system based on a narrowband Internet of things, and the results demonstrate the effectiveness of the proposed fusion algorithm. The proposed algorithm can be applied to a variety of multi-attribute fusion scenarios. [ABSTRACT FROM AUTHOR]

As restricted resources have seriously limited the computational performance of massive Internet of things (IoT) devices, better processing capability is urgently required. As an innovative technology, multi-access edge computing can provide cloudlet capabilities by offloading computation-intensive services from devices to a nearby edge server. This paper proposes an intelligent rapid adaptive offloading (IRAO) algorithm for a dynamic IoT system to increase overall computational performance and simultaneously keep the fairness of multiple participants, which can achieve agile centralized control and solve the joint optimization problems related to offloading policy and resource allocation. For reducing algorithm execution time, we apply machine learning methods and construct an adaptive learning-based framework consisting of offloading decision-making, radio resource slicing and algorithm parameters updating. In particular, the offloading policy can be rapidly derived from an estimation algorithm based on a deep neural network, which uses an experience replay training method to improve model accuracy and adopts an asynchronous sampling trick to enhance training convergence performance. Extensive simulations with different parameters are conducted to maintain the trade-off between accuracy and efficiency of the IRAO algorithm. Compared with other candidates, the results illustrate that the IRAO algorithm can achieve superior performance in terms of scalability, effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

Within the context of the Internet of Things (IoT) and the Location of Things (LoT) service, this paper presents an interactive tool to quantitatively analyze the performance of cooperative localization techniques for wireless sensor networks (WSNs). In these types of algorithms, nodes help each other determine their location based on some signal metrics such as time of arrival (TOA), received signal strength (RSS), or a fusion of them. The developed tool is intended to provide researchers and designers a fast way to measure the performance of localization algorithms considering specific network topologies. Using TOA or RSS models, the Crámer-Rao lower bound (CRLB) has been implemented within the tool. This lower bound can be used as a benchmark for testing a particular algorithm for specific channel characteristics and WSN topology, which allows determination if the necessary accuracy for a specific application is possible. Furthermore, the tool allows us to consider independent characteristics for each node in the WSN. This feature allows the avoidance of the typical "disk graph model," which is usually applied to test cooperative localization algorithms. The tool allows us to run Monte-Carlo simulations and generate statistical reports. A set of basic illustrative examples are described comparing the performance of different localization algorithms and showing the capabilities of the presented tool. [ABSTRACT FROM AUTHOR]

To achieve the full analytical potential of the streaming data from the internet of things, the interconnection of various data sources is needed. By definition, those sources are heterogeneous and their integration is not a trivial task. A common approach to exploit streaming sensor data potential is to use machine learning techniques for predictive analytics in a way that is agnostic to the domain knowledge. Such an approach can be easily integrated in various use cases. In this paper, we propose a novel framework for data fusion of a set of heterogeneous data streams. The proposed framework enriches streaming sensor data with the contextual and historical information relevant for describing the underlying processes. The final result of the framework is a feature vector, ready to be used in a machine learning algorithm. The framework has been applied to a cloud and to an edge device. In the latter case, incremental learning capabilities have been demonstrated. The reported results illustrate a significant improvement of data-driven models, applied to sensor streams. Beside higher accuracy of the models the platform offers easy setup and thus fast prototyping capabilities in real-world applications. [ABSTRACT FROM AUTHOR]

Monitoring traffic states from the road is arousing increasing concern from traffic management authorities. To complete the picture of real-time traffic states, novel data sources have been introduced and studied in the transportation community for decades. This paper explores a supplementary and novel data source, Wi-Fi signal data, to extract traffic information through a well-designed system. An IoT (Internet of Things)-based Wi-Fi signal detector consisting of a solar power module, high capacity module, and IoT functioning module was constructed to collect Wi-Fi signal data. On this basis, a filtration and mining algorithm was developed to extract traffic state information (i.e., travel time, traffic volume, and speed). In addition, to evaluate the performance of the proposed system, a practical field test was conducted through the use of the system to monitor traffic states of a major corridor in China. The comparison results with loop data indicated that traffic speed obtained from the system was consistent with that collected from loop detectors. The mean absolute percentage error reached 3.55% in the best case. Furthermore, the preliminary analysis proved the existence of the highly correlated relationship between volumes obtained from the system and from loop detectors. The evaluation confirmed the feasibility of applying Wi-Fi signal data to acquisition of traffic information, indicating that Wi-Fi signal data could be used as a supplementary data source for monitoring real-time traffic states. [ABSTRACT FROM AUTHOR]

IoT encompasses various objects, technologies, communication standards, sensors, actuators in powered environments, and networked communication. The concept adopted here, IoT off-grid, considers an environment without commercial electricity and commercial internet. Managing various utilities with IoT and collecting the relevant information from this environment is the purpose of this project. It uses machine learning to select relevant data. These data are collected safely using a drone that travels through the off-grid stations. A systematic literature mapping is presented, identifying the state of the art. The result is a software architecture proposal with configurations in the drone and off-grid stations that contemplate data collection from the IoT off-grid environment. The results are also presented with different selection algorithms used in machine learning and final execution in the prototype. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) is driving innovation in an ever-growing set of application domains such as intelligent processing for autonomous robots. For an autonomous robot, one grand challenge is how to sense its surrounding environment effectively. The Simultaneous Localization and Mapping with RGB-D Kinect camera sensor on robot, called RGB-D SLAM, has been developed for this purpose but some technical challenges must be addressed. Firstly, the efficiency of the algorithm cannot satisfy real-time requirements; secondly, the accuracy of the algorithm is unacceptable. In order to address these challenges, this paper proposes a set of novel improvement methods as follows. Firstly, the ORiented Brief (ORB) method is used in feature detection and descriptor extraction. Secondly, a bidirectional Fast Library for Approximate Nearest Neighbors (FLANN) k-Nearest Neighbor (KNN) algorithm is applied to feature match. Then, the improved RANdom SAmple Consensus (RANSAC) estimation method is adopted in the motion transformation. In the meantime, high precision General Iterative Closest Points (GICP) is utilized to register a point cloud in the motion transformation optimization. To improve the accuracy of SLAM, the reduced dynamic covariance scaling (DCS) algorithm is formulated as a global optimization problem under the G2O framework. The effectiveness of the improved algorithm has been verified by testing on standard data and comparing with the ground truth obtained on Freiburg University's datasets. The Dr Robot X80 equipped with a Kinect camera is also applied in a building corridor to verify the correctness of the improved RGB-D SLAM algorithm. With the above experiments, it can be seen that the proposed algorithm achieves higher processing speed and better accuracy. [ABSTRACT FROM AUTHOR]

With the increasing deployment of IoT devices and applications, a large number of devices that can sense and monitor the environment in IoT network are needed. This trend also brings great challenges, such as data explosion and energy insufficiency. This paper proposes a system that integrates mobile edge computing (MEC) technology and simultaneous wireless information and power transfer (SWIPT) technology to improve the service supply capability of WSN-assisted IoT applications. A novel optimization problem is formulated to minimize the total system energy consumption under the constraints of data transmission rate and transmitting power requirements by jointly considering power allocation, CPU frequency, offloading weight factor and energy harvest weight factor. Since the problem is non-convex, we propose a novel alternate group iteration optimization (AGIO) algorithm, which decomposes the original problem into three subproblems, and alternately optimizes each subproblem using the group interior point iterative algorithm. Numerical simulations validate that the energy consumption of our proposed design is much lower than the two benchmark algorithms. The relationship between system variables and energy consumption of the system is also discussed. [ABSTRACT FROM AUTHOR]

Recently, green computing has received significant attention for Internet of Things (IoT) environments due to the growing computing demands under tiny sensor enabled smart services. The related literature on green computing majorly focuses on a cover set approach that works efficiently for target coverage, but it is not applicable in case of area coverage. In this paper, we present a new variant of a cover set approach called a grouping and sponsoring aware IoT framework (GS-IoT) that is suitable for area coverage. We achieve non-overlapping coverage for an entire sensing region employing sectorial sensing. Non-overlapping coverage not only guarantees a sufficiently good coverage in case of large number of sensors deployed randomly, but also maximizes the life span of the whole network with appropriate scheduling of sensors. A deployment model for distribution of sensors is developed to ensure a minimum threshold density of sensors in the sensing region. In particular, a fast converging grouping (FCG) algorithm is developed to group sensors in order to ensure minimal overlapping. A sponsoring aware sectorial coverage (SSC) algorithm is developed to set off redundant sensors and to balance the overall network energy consumption. GS-IoT framework effectively combines both the algorithms for smart services. The simulation experimental results attest to the benefit of the proposed framework as compared to the state-of-the-art techniques in terms of various metrics for smart IoT environments including rate of overlapping, response time, coverage, active sensors, and life span of the overall network. [ABSTRACT FROM AUTHOR]

Frequent location updates of individual Internet of Things (IoT) devices can cause several problems (e.g., signaling overhead in networks and energy depletion of IoT devices) in massive machine type communication (mMTC) systems. To alleviate these problems, we design a distributed group location update algorithm (DGLU) in which geographically proximate IoT devices determine whether to conduct the location update in a distributed manner. To maximize the accuracy of the locations of IoT devices while maintaining a sufficiently small energy outage probability, we formulate a constrained stochastic game model. We then introduce a best response dynamics-based algorithm to obtain a multi-policy constrained Nash equilibrium. From the evaluation results, it is demonstrated that DGLU can achieve an accuracy of location information that is comparable with that of the individual location update scheme, with a sufficiently small energy outage probability. [ABSTRACT FROM AUTHOR]

The ongoing generalization of Internet of Things and its presence and application in multiple fields is generating a large amount of data that can be used to extract knowledge, among other purposes. In this context, algorithmic techniques and efficient computer systems provide an opportunity to successfully address efficient data processing and intelligent data analysis. As a result, multiple services can be improved, resources can be optimized and real-world problems of interest can be solved. This Special Issue on Algorithm and Distributed Computing for the Internet of Things gives the opportunity to know recent advances in the application of modern technologies hardware and software to the Internet of Things. [ABSTRACT FROM AUTHOR]

Nowadays, the current vehicles are incorporating control systems in order to improve their stability and handling. These control systems need to know the vehicle dynamics through the variables (lateral acceleration, roll rate, roll angle, sideslip angle, etc.) that are obtained or estimated from sensors. For this goal, it is necessary to mount on vehicles not only low-cost sensors, but also low-cost embedded systems, which allow acquiring data from sensors and executing the developed algorithms to estimate and to control with novel higher speed computing. All these devices have to be integrated in an adequate architecture with enough performance in terms of accuracy, reliability and processing time. In this article, an architecture to carry out the estimation and control of vehicle dynamics has been developed. This architecture was designed considering the basic principles of IoT and integrates low-cost sensors and embedded hardware for orchestrating the experiments. A comparison of two different low-cost systems in terms of accuracy, acquisition time and reliability has been done. Both devices have been compared with the VBOX device from Racelogic, which has been used as the ground truth. The comparison has been made from tests carried out in a real vehicle. The lateral acceleration and roll rate have been analyzed in order to quantify the error of these devices. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, it is important to use the right number of sensors to optimize the network and consider the key design and cost. Due to the limited power of sensors, important issues include how to control the state of the sensor through an automatic control algorithm and how to power-save and efficiently distribute work. However, sensor nodes are usually deployed in dangerous or inaccessible locations. Therefore, it is difficult and impractical to supply power to sensors through humans. In this study, we propose a high reliability control algorithm with fast convergence and strong self-organization ability called the sensor activity control algorithm (SACA), which can efficiently control the number of sensors in the active state and extend their use time. In the next round, SACA considers the relationship between the total number of active sensors and the target value and determines the state of the sensor. The data transmission technology of random access is used between the sensor and the base station. Therefore, the sensor in the sleep state does not need to receive the feedback packet from the base station. The sensor can achieve true dormancy and power-saving effects. The experimental results show that SACA has fast convergence, strong self-organization capabilities, and power-saving advantages. [ABSTRACT FROM AUTHOR]

Developing cyber security is very necessary and has attracted considerable attention from academy and industry organizations worldwide. It is also very necessary to provide sustainable computing for the the Internet of Things (IoT). Machine learning techniques play a vital role in the cybersecurity of the IoT for intrusion detection and malicious identification. Thus, in this study, we develop new feature extraction and selection methods and for the IDS system using the advantages of the swarm intelligence (SI) algorithms. We design a feature extraction mechanism depending on the conventional neural networks (CNN). After that, we present an alternative feature selection (FS) approach using the recently developed SI algorithm, Aquila optimizer (AQU). Moreover, to assess the quality of the developed IDS approach, four well-known public datasets, CIC2017, NSL-KDD, BoT-IoT, and KDD99, were used. We also considered extensive comparisons to other optimization methods to verify the competitive performance of the developed method. The results show the high performance of the developed approach using different evaluation indicators. [ABSTRACT FROM AUTHOR]

With the rise of online/mobile transactions, the cost of cash-out has decreased and the cost of detection has increased. In the world of online/mobile payment in IoT, merchants and credit cards can be applied and approved online and used in the form of a QR code but not a physical card or Point of Sale equipment, making it easy for these systems to be controlled by a group of fraudsters. In mainland China, where the credit card transaction fee is, on average, lower than a retail loan rate, the credit card cash-out option is attractive for people for an investment or business operation, which, after investigation, can be considered unlawful if over a certain amount is used. Because cash-out will incur fees for the merchants, while bringing money to the credit cards' owners, it is difficult to confirm, as nobody will declare or admit it. Furthermore, it is more difficult to detect cash-out groups than individuals, because cash-out groups are more hidden, which leads to bigger transaction amounts. We propose a new method for the detection of cash-out groups. First, the seed cards are mined and the seed cards' diffusion is then performed through the local graph clustering algorithm (Approximate PageRank, APR). Second, a merchant association network in IoT is constructed based on the suspicious cards, using the graph embedding algorithm (Node2Vec). Third, we use the clustering algorithm (DBSCAN) to cluster the nodes in the Euclidean space, which divides the merchants into groups. Finally, we design a method to classify the severity of the groups to facilitate the following risk investigation. The proposed method covers 145 merchants from 195 known risky merchants in groups that acquire cash-out from four banks, which shows that this method can identify most (74.4%) cash-out groups. In addition, the proposed method identifies a further 178 cash-out merchants in the group within the same four acquirers, resulting in a total of 30,586 merchants. The results and framework are already adopted and absorbed into the design for a cash-out group detection system in IoT by the Chinese payment processor. [ABSTRACT FROM AUTHOR]

Today, vehicles are increasingly being connected to the Internet of Things, which enables them to obtain high-quality services. However, the numerous vehicular applications and time-varying network status make it challenging for onboard terminals to achieve efficient computing. Therefore, based on a three-stage model of local-edge clouds and reinforcement learning, we propose a task offloading algorithm for the Internet of Vehicles (IoV). First, we establish communication methods between vehicles and their cost functions. In addition, according to the real-time state of vehicles, we analyze their computing requirements and the price function. Finally, we propose an experience-driven offloading strategy based on multi-agent reinforcement learning. The simulation results show that the algorithm increases the probability of success for the task and achieves a balance between the task vehicle delay, expenditure, task vehicle utility and service vehicle utility under various constraints. [ABSTRACT FROM AUTHOR]

Recently, many Low Power Wide Area Network (LPWAN) protocols have been proposed for securing resource-constrained Internet of Things (IoT) devices with negligible power consumption. The Long Range Wide Area Network (LoRaWAN) is a low power communication protocol that supports message authentication, integrity, and encryption using two-session preshared secret keys. However, although the LoRaWAN supports some security functions, it suffers from session key generation and key update problems. This motivates us to introduce a new key management protocol that resolves the LoRaWAN problems and supports key updates. The proposed protocol is based on hash chain generation using a one-way hash function. Network entities share a common hash chain of n key elements to allow using a unique signing key per message. We also propose a salt hashing algorithm that encrypts the original keys into a different form to avoid the physical attacks at the end device side. We analyzed the proposed key generation performance in terms of the computation time, the required storage, and the communication overhead. We implemented and tested the proposed key generation protocol using the NS-3 network simulator. The proposed lightweight key generation protocol significantly enhances the security of the original LoRaWAN at a negligible overhead. The proposed protocol reduces the power consumption and transmission time by two times compared with some previous protocols. In addition, the proposed key generation protocol can resist attacks, such as key compromising attacks and replay attacks, and it supports the Perfect Forward Secrecy, which was not supported by LoRaWAN. [ABSTRACT FROM AUTHOR]