Search

The Internet of Things (IoT) is the underlying technology that has enabled connecting daily apparatus to the Internet and enjoying the facilities of smart services. IoT marketing is experiencing an impressive 16.7% growth rate and is a nearly USD 300.3 billion market. These eye-catching figures have made it an attractive playground for cybercriminals. IoT devices are built using resource-constrained architecture to offer compact sizes and competitive prices. As a result, integrating sophisticated cybersecurity features is beyond the scope of the computational capabilities of IoT. All of these have contributed to a surge in IoT intrusion. This paper presents an LSTM-based Intrusion Detection System (IDS) with a Dynamic Access Control (DAC) algorithm that not only detects but also defends against intrusion. This novel approach has achieved an impressive 97.16% validation accuracy. Unlike most of the IDSs, the model of the proposed IDS has been selected and optimized through mathematical analysis. Additionally, it boasts the ability to identify a wider range of threats (14 to be exact) compared to other IDS solutions, translating to enhanced security. Furthermore, it has been fine-tuned to strike a balance between accurately flagging threats and minimizing false alarms. Its impressive performance metrics (precision, recall, and F1 score all hovering around 97%) showcase the potential of this innovative IDS to elevate IoT security. The proposed IDS boasts an impressive detection rate, exceeding 98%. This high accuracy instills confidence in its reliability. Furthermore, its lightning-fast response time, averaging under 1.2 s, positions it among the fastest intrusion detection systems available. [ABSTRACT FROM AUTHOR]

The diverse application vertices of internet-of-things (IoT) including internet of vehicles (IoV), industrial IoT (IIoT) and internet of drones things (IoDT) involve intelligent communication between the massive number of objects around us. This digital transformation strives for seamless data flow, uninterrupted communication capabilities, low latency and ultra-high reliability. The limited capabilities of fifth generation (5G) technology have given way to sixth generation (6G) wireless technology. This paper presents a dynamic cell-free framework for a 6G-enabled IoT network. A number of access points (APs) are distributed over a given geographical area to serve a large number of user nodes. A pilot-based AP selection (PBAS) algorithm is proposed, which offers robust resource control through AP selection based on pilots. Selecting a subset of APs against all APs for each user node results in improved performance. In this paper, the performance of the proposed transmission model is evaluated for the achieved data rate and spectral efficiency using the proposed algorithm. It is shown that the proposed PBAS algorithm improves the spectral efficiency by 22 % at the cell-edge and 1.5 % at the cell-center. A comparison of the different combining techniques used at different user locations is also provided, along with the mathematical formulations. Finally, the proposed model is compared with two other transmission models for performance evaluation. It is observed that the spectral efficiency achieved by an edge node with the proposed scheme is 5.3676 bits/s/Hz, compared to 0.756 bits/s/Hz and 1.0501 bits/s/Hz, attained with transmission schemes 1 and 2, respectively. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) and network-enabled smart devices are crucial to the digitally interconnected society of the present day. However, the increased reliance on IoT devices increases their susceptibility to malicious activities within network traffic, posing significant challenges to cybersecurity. As a result, both system administrators and end users are negatively affected by these malevolent behaviours. Intrusion-detection systems (IDSs) are commonly deployed as a cyber attack defence mechanism to mitigate such risks. IDS plays a crucial role in identifying and preventing cyber hazards within IoT networks. However, the development of an efficient and rapid IDS system for the detection of cyber attacks remains a challenging area of research. Moreover, IDS datasets contain multiple features, so the implementation of feature selection (FS) is required to design an effective and timely IDS. The FS procedure seeks to eliminate irrelevant and redundant features from large IDS datasets, thereby improving the intrusion-detection system's overall performance. In this paper, we propose a hybrid wrapper-based feature-selection algorithm that is based on the concepts of the Cellular Automata (CA) engine and Tabu Search (TS)-based aspiration criteria. We used a Random Forest (RF) ensemble learning classifier to evaluate the fitness of the selected features. The proposed algorithm, CAT-S, was tested on the TON_IoT dataset. The simulation results demonstrate that the proposed algorithm, CAT-S, enhances classification accuracy while simultaneously reducing the number of features and the false positive rate. [ABSTRACT FROM AUTHOR]

This research paper introduces a novel paradigm that synergizes innovative algorithms, namely efficient data encryption, the Quondam Signature Algorithm (QSA), and federated learning, to effectively counteract random attacks targeting Internet of Things (IoT) systems. The incorporation of federated learning not only fosters continuous learning but also upholds data privacy, bolsters security measures, and provides a robust defence mechanism against evolving threats. The Quondam Signature Algorithm (QSA) emerges as a formidable solution, adept at mitigating vulnerabilities linked to man-in-the-middle attacks. Remarkably, the QSA algorithm achieves noteworthy cost savings in IoT communication by optimizing communication bit requirements. By seamlessly integrating federated learning, IoT systems attain the ability to harmoniously aggregate and analyse data from an array of devices while zealously guarding data privacy. The decentralized approach of federated learning orchestrates local machine-learning model training on individual devices, subsequently amalgamating these models into a global one. Such a mechanism not only nurtures data privacy but also empowers the system to harness diverse data sources, enhancing its analytical capabilities. A thorough comparative analysis scrutinizes varied cost-in-communication schemes, meticulously weighing both encryption and federated learning facets. The proposed approach shines by virtue of its optimization of time complexity through the synergy of offline phase computations and online phase signature generation, hinged on an elliptic curve digital signature algorithm-based online/offline scheme. In contrast, the Slow Block Move (SBM) scheme lags behind, necessitating over 25 rounds, 1500 signature generations, and an equal number of verifications. The proposed scheme, fortified by its marriage of federated learning and efficient encryption techniques, emerges as an embodiment of improved efficiency and reduced communication costs. The culmination of this research underscores the intrinsic benefits of the proposed approach: marked reduction in communication costs, elevated analytical prowess, and heightened resilience against the spectrum of attacks that IoT systems confront. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has been an area of growing research interest for decades. Task allocation is an important problem for the optimized operation of Internet-of-Things networks. This paper provides an overview of recent research in the field of Internet-of-Things task allocation optimization. First, the task allocation problem for the IoT itself is analyzed and divided into distinct sub-problem categories, such as deployment optimization, static or dynamic optimization as well as single- or multi-objective optimization. Following that, the commonly used optimization objectives are explained. Various recent works in the field of task allocation optimization are then summarized and catalogued according to the problem categories. Finally, the paper concludes with a qualitative analysis of the categorized approaches and a description of open problems and highlights promising directions for future research. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT), the frequency of attackers using botnets to control IoT devices in order to perform distributed denial-of-service attacks (DDoS) and other cyber attacks on the internet has significantly increased. In the actual attack process, the small percentage of attack packets in IoT leads to low accuracy of intrusion detection. Based on this problem, the paper proposes an oversampling algorithm, KG-SMOTE, based on Gaussian distribution and K-means clustering, which inserts synthetic samples through Gaussian probability distribution, extends the clustering nodes in minority class samples in the same proportion, increases the density of minority class samples, and improves the amount of minority class sample data in order to provide data support for IoT-based DDoS attack detection. Experiments show that the balanced dataset generated by this method effectively improves the intrusion detection accuracy in each category and effectively solves the data imbalance problem. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has transformed our interaction with technology and introduced security challenges. The growing number of IoT attacks poses a significant threat to organizations and individuals. This paper proposes an approach for detecting attacks on IoT networks using ensemble feature selection and deep learning models. Ensemble feature selection combines filter techniques such as variance threshold, mutual information, Chi-square, ANOVA, and L1-based methods. By leveraging the strengths of each technique, the ensemble is formed by the union of selected features. However, this union operation may overlook redundancy and irrelevance, potentially leading to a larger feature set. To address this, a wrapper algorithm called Recursive Feature Elimination (RFE) is applied to refine the feature selection. The impact of the selected feature set on the performance of Deep Learning (DL) models (CNN, RNN, GRU, and LSTM) is evaluated using the IoT-Botnet 2020 dataset, considering detection accuracy, precision, recall, F1-measure, and False Positive Rate (FPR). All DL models achieved the highest detection accuracy, precision, recall, and F1 measure values, ranging from 97.05% to 97.87%, 96.99% to 97.95%, 99.80% to 99.95%, and 98.45% to 98.87%, respectively. [ABSTRACT FROM AUTHOR]

Proof-of-Work (PoW) was the first blockchain consensus protocol discovered, followed by Proof-of-Stake and others. The disadvantage of the PoW is that it requires high energy consumption compared to other consensus protocols. Based on this weakness, some researchers proposed a lightweight blockchain technology, a modified blockchain that has a simplified algorithm but does not reduce the security factor. This lightweight blockchain is suitable for applications requiring data reliability but with limited computing resources, such as Internet of Things devices. This paper discussed and modified the SimBlock simulator as one of the existing blockchain simulators. It has a visualization tool to look further into the propagation transition of the block. Unfortunately, the existing PoW consensus on the SimBlock simulator is unable to pinpoint the actual hash computation method. Therefore, the hashing process in the SimBlock simulator was modified by including the difficulty level for finding the hash target. The purpose of including the difficulty level was to determine how long it takes to create a block. By knowing the time needed, a recommendation could be obtained for the most suitable difficulty level for a lightweight blockchain and its implementation with IoT devices. There are two options of approaches to the difficulty level referred to in this paper; finding the number of zeros that appear sequentially and are in front of a hash value (leading zero) and finding the number of zeros that appear arbitrarily (count zero). For example, the first difficulty level on a leading-zero quest has the same meaning as searching for a leading zero, the second level of difficulty is the search for the two leading zeros, etc. The block generation time on a blockchain network using the PoW consensus highly depends on the difficulty level. Block generation time and resource utility have been analyzed and compared with other blockchain simulators and existing networks, such as Ethereum and Bitcoin. The modified SimBlock simulator was tested in this experiment using 100–600 nodes, with the expected result of creating 100–1000 blocks. Based on the experiments, creating a block using leading zeros as the hash target for the first to fourth difficulty levels took less than 1 s, whereas when using count zeros (zero-count) as the target hash, it took less than 1 s for the first to fifteenth difficulty levels. Using leading zeros took approximately 237.4 s at difficulty level 7, while count-zero took approximately 633.8 s at difficulty level 19. The experiment was not continued at the next difficulty level because it required a longer compilation time. With the modifications made, the creation of a block on a blockchain network using the PoW consensus can be clearly seen. The difficulty level added to the simulator can also provide information for determining the difficulty level to be implemented on the lightweight blockchain. [ABSTRACT FROM AUTHOR]

The IoT networks for implementing mission-critical applications need a layer to effect remote communication between the cluster heads and the microcontrollers. Remote communication is affected through base stations using cellular technologies. Using a single base station in this layer is risky as the fault tolerance level of the network will be zero when the base stations break down. Generally, the cluster heads are within the base station spectrum, making seamless integration possible. Implementing a dual base station to cater for a breakdown of the first base station creates huge remoteness as the cluster heads are not within the spectrum of the second base station. Furthermore, using the remote base station involves huge latency affecting the performance of the IoT network. In this paper, a relay-based network is presented with intelligence to fetch the shortest path for communicating to reduce latency and sustain the fault tolerance capability of the IoT network. The results demonstrate that the technique improved the fault tolerance of the IoT network by 14.23%. [ABSTRACT FROM AUTHOR]

The Internet-of-Things (IoT) massive access is a significant scenario for sixth-generation (6G) communications. However, low-power IoT devices easily suffer from remote interference caused by the atmospheric duct under the 6G time-division duplex (TDD) mode. It causes distant downlink wireless signals to propagate beyond the designed protection distance and interfere with local uplink signals, leading to a large outage probability. In this paper, a remote interference discrimination testbed is originally proposed to detect interference, which supports the comparison of different types of algorithms on the testbed. Specifically, 5,520,000 TDD network-side data collected by real sensors are used to validate the interference discrimination capabilities of nine promising AI algorithms. Moreover, a consistent comparison of the testbed shows that the ensemble algorithm achieves an average accuracy of 12% higher than the single model algorithm. [ABSTRACT FROM AUTHOR]

A novel approach for multichannel epilepsy seizure classification which will help to automatically locate seizure activity present in the focal brain region was proposed. This paper suggested an Internet of Things (IoT) framework based on a smart phone by utilizing a novel feature termed multiresolution critical spectral verge (MCSV), based on frequency-derived information for epileptic seizure classification which was optimized using a flower pollination algorithm (FPA). A wireless sensor technology (WSN) was utilized to record the electroencephalography (EEG) signal of epileptic patients. Next, the EEG signal was pre-processed utilizing a multiresolution-based adaptive filtering (MRAF) method. Then, the maximal frequency point at which the power spectral density (PSD) of each EEG segment was greater than the average spectral power of the corresponding frequency band was computed. This point was further optimized to extract a point termed as critical spectral verge (CSV) to extract the exact high frequency oscillations representing the actual seizure activity present in the EEG signal. Next, a support vector machine (SVM) classifier was used for channel-wise classification of the seizure and non-seizure regions using CSV as a feature. This process of classification using the CSV feature extracted from the MRAF output is referred to as the MCSV approach. As a final step, cloud-based services were employed to analyze the EEG information from the subject's smart phone. An exhaustive analysis was undertaken to assess the performance of the MCSV approach for two datasets. The presented approach showed an improved performance with a 93.83% average sensitivity, a 97.94% average specificity, a 97.38% average accuracy with the SVM classifier, and a 95.89% average detection rate as compared with other state-of-the-art studies such as deep learning. The methods presented in the literature were unable to precisely localize the origination of the seizure activity in the brain region and reported a low seizure detection rate. This work introduced an optimized CSV feature which was effectively used for multichannel seizure classification and localization of seizure origination. The proposed MCSV approach will help diagnose epileptic behavior from multichannel EEG signals which will be extremely useful for neuro-experts to analyze seizure details from different regions of the brain. [ABSTRACT FROM AUTHOR]

The basic properties of blockchain, such as decentralization, security, and immutability, show promising potential for IoT applications. The main feature—decentralization of blockchain technology—depends on the consensus. However, consensus algorithms are mostly designed to work in extensive computational and communication environments for network security and immutability, which is not desirable for resource-restricted IoT applications. Many solutions are proposed to address this issue with modified consensus algorithms based on the legacy consensus, such as the PoW, PoS, and BFT, and new non-linear data structures, such as DAG. A systematic classification and analysis of various techniques in the field will be beneficial for both researchers and industrial practitioners. Most existing relevant surveys provide classifications intuitively based on the domain knowledge, which are infeasible to reveal the intrinsic and complicated relationships among the relevant basic concepts and techniques. In this paper, a powerful tool of systematic knowledge classification and explanation is introduced to structure the survey on blockchain consensus algorithms for resource-constrained IoT systems. More specifically, an ontology was developed for a consensus algorithm apropos of IoT adaptability. The developed ontology is subdivided into two parts—CONB and CONIoT—representing the classification of generic consensus algorithms and the ones that are particularly proposed for IoT, respectively. Guided by this ontology, an in depth discussion and analysis are provided on the major consensus algorithms and their IoT compliance based on design and implementation targets. Open research challenges and future research directions are provided. [ABSTRACT FROM AUTHOR]

With the surge of Internet of Things (IoT) applications using unmanned aerial vehicles (UAVs), there is a huge demand for an excellent complexity/power efficiency trade-off and channel fading resistance at the physical layer. In this paper, we consider the blind equalization of short-continuous-phase-modulated (CPM) burst for UAV-aided IoT. To solve the problems of the high complexity and poor convergence of short-burst CPM blind equalization, a novel turbo blind equalization algorithm is proposed based on establishing a new expectation–maximization Viterbi (EMV) algorithm and turbo scheme. Firstly, a low complexity blind equalization algorithm is obtained by applying the soft-output Lazy Viterbi algorithm within the EM algorithm iteration. Furthermore, a set of initializers that achieves a high global convergence probability is designed by the blind channel-acquisition (BCA) method. Meanwhile, a soft information iterative process is used to improve the system performance. Finally, the convergence, bit error rate, and real-time performance of iterative detection can be further improved effectively by using improved exchange methods of extrinsic information and the stopping criterion. The analysis and simulation results show that the proposed algorithm achieves a good blind equalization performance and low complexity. [ABSTRACT FROM AUTHOR]

We present a solution for improving the robustness of GNSS positioning with Android devices. The proposed method combines an acquisition phase performed in a dedicated Android app (thus working on the edge) and a processing phase, based on a modified version of the open source library RTKLIB, performed on a dedicated server. The processing phase applies an improved version of the RTK library based on an adaptive algorithm for mitigating the multipath effect on satellite radio signals received by smartphone's antennas. The algorithm is built on top of an extended version of the sigma-epsilon model in which weights associated to observables potentially affected by multipath errors are computed using logged data. In the paper, we will focus our attention on the architecture of the proposed solution and discuss preliminary experimental results obtained with the resulting system. [ABSTRACT FROM AUTHOR]

One of the latest protocols developed for the Internet of Things networks is IEEE 802.11ah, proposed by the WiFi Alliance. The new channel access mechanism in IEEE 802.11ah, which is called Restricted Access Window, aims at reducing the contention between the stations by allowing only selected stations to transmit data at certain time slots. Stations may exhibit selfish behavior to maximize their own throughput. This will come at the cost of the overall network quality of service. In this paper, we first analyze the default behavior of the IEEE 802.11ah protocol in terms of fairness. We then introduce various percentages of selfish stations and observe how the network's quality of service in terms of fairness, throughput and packet-loss are affected. After establishing the inherent fairness of IEEE 802.11ah, we analyze applicability of two existing selfish behavior detection algorithms designed for IEEE 802.11 to the IEEE 802.11ah protocol. Due to their poor performance, we propose a new definition of 'selfish behavior' specifically for IEEE 802.11ah, based on which we present a new algorithm for detecting selfish behavior. To combat selfish behavior and to create a better fairness, throughput and lower packet loss, we consequently present a novel mitigation algorithm called Selfish Stations Quarantine Punishment Algorithm (SSQPA). The proposed algorithm takes advantage of the RAW grouping to isolate selfish stations from the honest stations, thus mitigating the effect of the selfish behavior. SSQPA comes in two variants: honest stations-centric and network-centric. Our experimental results show that both variants can successfully mitigate selfish behavior effects in IEEE 802.11ah networks and either one can be used depending on the goal of the network. [ABSTRACT FROM AUTHOR]

A backscatter network, as a key enabling technology for interconnecting plentiful IoT sensing devices, can be applicable to a variety of interesting applications, e.g., wireless sensing and motion tracking. In these scenarios, the vital information-carrying effective nodes always suffer from an extremely low individual reading rate, which results from both unpredictable channel conditions and intense competition from other nodes. In this paper, we propose a rate-adaptation algorithm for effective nodes (RAEN), to improve the throughput of effective nodes, by allowing them to transmit exclusively and work in an appropriate data rate. RAEN works in two stages: (1) RAEN exclusively extracts effective nodes with an identification module and selection module; (2) then, RAEN leverages a trigger mechanism, combined with a random forest-based classifier, to predict the overall optimal rate. As RAEN is fully compatible with the EPC C1G2 standard, we implement the experiment through a commercial reader and multiple RFID tags. Comprehensive experiments show that RAEN improves the throughput of effective nodes by 3×, when 1/6 of the nodes are effective, compared with normal reading. What is more, the throughput of RAEN is better than traditional rate-adaptation methods. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most O (n 2) step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after O (n) moves in O (n) step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions. [ABSTRACT FROM AUTHOR]

This paper discusses the possibility of recognizing and predicting user activities in the IoT (Internet of Things) based smart environment. The activity recognition is usually done through two steps: activity pattern clustering and activity type decision. Although many related works have been suggested, they had some limited performance because they focused only on one part between the two steps. This paper tries to find the best combination of a pattern clustering method and an activity decision algorithm among various existing works. For the first step, in order to classify so varied and complex user activities, we use a relevant and efficient unsupervised learning method called the K-pattern clustering algorithm. In the second step, the training of smart environment for recognizing and predicting user activities inside his/her personal space is done by utilizing the artificial neural network based on the Allen's temporal relations. The experimental results show that our combined method provides the higher recognition accuracy for various activities, as compared with other data mining classification algorithms. Furthermore, it is more appropriate for a dynamic environment like an IoT based smart home. [ABSTRACT FROM AUTHOR]

Long-Range Wide Area Network (LoRaWAN) is an open-source protocol for the standard Internet of Things (IoT) Low Power Wide Area Network (LPWAN). This work's focal point is the LoRa Multi-Armed Bandit decentralized decision-making solution. The contribution of this paper is to study the effect of the re-learning EXP3 Multi-Armed Bandit (MAB) algorithm with previous experts' advice on the LoRaWAN network performance. LoRa smart node has a self-managed EXP3 algorithm for choosing and updating the transmission parameters based on its observation. The best parameter choice needs previously associated distribution advice (expert) before updating different choices for confidence. The paper proposes a new approach to study the effects of combined expert distribution for each transmission parameter on the LoRaWAN network performance. The successful transmission of the packet with optimized power consumption is the pivot of this paper. The validation of the simulation result has proven that combined expert distribution improves LoRaWAN network's performance in terms of data throughput and power consumption. [ABSTRACT FROM AUTHOR]

This paper examines potential performances of the Spread Spectrum-based random access technique and proposes an Improved Spread Spectrum Aloha (ISSA) protocol for the return channel in satellite Internet of Things (IoT) based on the beam-hopping technique. The key design driver and detailed solution of ISSA protocol are presented in this work and it is shown that the proposed protocol achieves high throughput and low collision probability. To match user/traffic distribution, delay requirement and channel condition with beam allocation better, a low-complexity heuristic beam scheduling algorithm and a more effective Maximum-Weighted Clique (MWC) algorithm have been proposed. The heuristic algorithm considers the user/traffic distribution, inter-beam interference, and fairness primarily. However, the MWC algorithm gives considerations not only on above factors, but also on delay requirement and channel condition (path loss and rain attenuation) to maximize system capacity. The beam angle and interference avoidance threshold are proposed to measure the inter-beam interference, and the link propagation loss and rain attenuation are considered meanwhile in the channel condition. In the MWC algorithm, we construct an auxiliary graph to find the maximum-weighted clique and derive the weighting approach to be applied in different application scenarios. The performance evaluation of our ISSA protocol compared with the SSA protocol is presented, which achieves a gain of 16.7 % . The simulation of the ISSA protocol combined with round robin, heuristic, and MWC beam scheduling for the return link in beam-hopping satellite IoTs is also provided. The results indicate that the throughput in nonuniform user distribution is much lower than in the uniform case without the beam scheduling algorithm. Through the application of the scheduling algorithm, the throughput performance can approach the uniform distribution. Finally, the degree of user satisfaction with different scheduling approaches is presented, which validates the effectiveness of heuristic and MWC algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an internet of things (IoTs) enabled smart meter with energy-efficient simultaneous wireless information and power transfer (SWIPT) for the wireless powered smart grid communication network. The SWIPT technique with energy harvesting (EH) is an attractive solution for prolonging the battery life of ultra-low power devices. The motivation for energy efficiency (EE) maximization is to increase the efficient use of energy and improve the battery life of the IoT devices embedded in smart meter. In the system model, the smart meter is equipped with an IoT device, which implements the SWIPT technique in power splitting (PS) mode. This paper aims at the EE maximization and considers the orthogonal frequency division multiplexing distributed antenna system (OFDM-DAS) for the smart meters in the downlink with IoT enabled PS-SWIPT system. The EE maximization is a nonlinear and non-convex optimization problem. We propose an optimal power allocation algorithm for the non-convex EE maximization problem by the Lagrange method and proportional fairness to optimal power allocation among smart meters. The proposed algorithm shows a clear advantage, where total power consumption is considered in the EE maximization with energy constraints. Furthermore, EE vs. spectral efficiency (SE) tradeoff is investigated. The results of our algorithm reveal that EE improves with EH requirements. [ABSTRACT FROM AUTHOR]

Currently, the use of unmanned vehicles, such as drones, boats and ships, in monitoring tasks where human presence is difficult or even impossible raises several issues. Continuous efforts to improve the autonomy of such vehicles have not solved all aspects of this issue. In an Internet of Unmanned Vehicles (IoUV) environment, the idea of replacing the static wireless infrastructure and reusing the mobile monitoring nodes in different conditions would converge to a dynamic solution to assure data collection in areas where there is no infrastructure that ensures Internet access. The current paper fills a significant gap, proposing an algorithm that optimises the positions of unmanned vehicles such that an ad hoc network is deployed to serve specific wireless sensor networks that have no other Internet connectivity (hilly/mountainous areas, Danube Delta) and must be connected to an Internet of Things (IoT) ecosystem. The algorithm determines the optimum positions of UV nodes that decrease the path losses below the link budget threshold with minimum UV node displacement compared to their initial coordinates. The algorithm was tested in a rural scenario and 3rd Generation Partnership Project (3GPP), free space and two-ray propagation models. The paper proposes another type of network, a Flying and Surface Ad Hoc Network (FSANET), a concept which implies collaboration and coexistence between unmanned aerial vehicles (UAVs) and unmanned surface vehicles (USVs) and several use cases that motivate the need for such a network. [ABSTRACT FROM AUTHOR]

This paper develops a new hybrid, open-source, cross-platform 3D smart home simulator, OpenSHS, for dataset generation. OpenSHS offers an opportunity for researchers in the field of the Internet of Things (IoT) and machine learning to test and evaluate their models. Following a hybrid approach, OpenSHS combines advantages from both interactive and model-based approaches. This approach reduces the time and efforts required to generate simulated smart home datasets. We have designed a replication algorithm for extending and expanding a dataset. A small sample dataset produced, by OpenSHS, can be extended without affecting the logical order of the events. The replication provides a solution for generating large representative smart home datasets. We have built an extensible library of smart devices that facilitates the simulation of current and future smart home environments. Our tool divides the dataset generation process into three distinct phases: first design: the researcher designs the initial virtual environment by building the home, importing smart devices and creating contexts; second, simulation: the participant simulates his/her context-specific events; and third, aggregation: the researcher applies the replication algorithm to generate the final dataset. We conducted a study to assess the ease of use of our tool on the System Usability Scale (SUS). [ABSTRACT FROM AUTHOR]

With the arrival of the era of Internet of Things (IoT), Wi-Fi Direct is becoming an emerging wireless technology that allows one to communicate through a direct connection between the mobile devices anytime, anywhere. In Wi-Fi Direct-based IoT networks, all devices are categorized by group of owner (GO) and client. Since portability is emphasized in Wi-Fi Direct devices, it is essential to control the energy consumption of a device very efficiently. In order to avoid unnecessary power consumed by GO, Wi-Fi Direct standard defines two power-saving methods: Opportunistic and Notice of Absence (NoA) power-saving methods. In this paper, we suggest an algorithm to enhance the energy efficiency ofWi-Fi Direct power-saving, considering the characteristics of multimedia video traffic. Proposed algorithm utilizes the statistical distribution for the size of video frames and adjusts the lengths of awake intervals in a beacon interval dynamically. In addition, considering the inter-dependency among video frames, the proposed algorithm ensures that a video frame having high priority is transmitted with higher probability than other frames having low priority. Simulation results show that the proposed method outperforms the traditional NoA method in terms of average delay and energy efficiency. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has gained an incredible importance in the communication and networking industry due to its innovative solutions and advantages in diverse domains. The IoT' network is a network of smart physical objects: devices, vehicles, buildings, etc. The IoT has a number of applications ranging from smart home, smart surveillance to smart healthcare systems. Since IoT consists of various heterogeneous devices that exhibit different traffic patterns and expect different quality of service (QoS) in terms of data rate, bit error rate and the stability index of the channel, therefore, in this paper, we formulated an optimization problem to assign channels to heterogeneous IoT devices within a smart building for the provisioning of their desired QoS. To solve this problem, a novel particle swarm optimization-based algorithm is proposed. Then, exhaustive simulations are carried out to evaluate the performance of the proposed algorithm. Simulation results demonstrate the supremacy of our proposed algorithm over the existing ones in terms of throughput, bit error rate and the stability index of the channel. [ABSTRACT FROM AUTHOR]

Networking is crucial for smart city projects nowadays, as it offers an environment where people and things are connected. This paper presents a chronology of factors on the development of smart cities, including IoT technologies as network infrastructure. Increasing IoT nodes leads to increasing data flow, which is a potential source of failure for IoT networks. The biggest challenge of IoT networks is that the IoT may have insufficient memory to handle all transaction data within the IoT network. We aim in this paper to propose a potential compression method for reducing IoT network data traffic. Therefore, we investigate various lossless compression algorithms, such as entropy or dictionary-based algorithms, and general compression methods to determine which algorithm or method adheres to the IoT specifications. Furthermore, this study conducts compression experiments using entropy (Huffman, Adaptive Huffman) and Dictionary (LZ77, LZ78) as well as five different types of datasets of the IoT data traffic. Though the above algorithms can alleviate the IoT data traffic, adaptive Huffman gave the best compression algorithm. Therefore, in this paper, we aim to propose a conceptual compression method for IoT data traffic by improving an adaptive Huffman based on deep learning concepts using weights, pruning, and pooling in the neural network. The proposed algorithm is believed to obtain a better compression ratio. Additionally, in this paper, we also discuss the challenges of applying the proposed algorithm to IoT data compression due to the limitations of IoT memory and IoT processor, which later it can be implemented in IoT networks. [ABSTRACT FROM AUTHOR]

With the development of the Internet of Things (IoT), Low Data Rate-Personal Area Networks (LR-WPAN) have been deployed for different applications. Now comes the need to integrate these networks in search of greater connectivity, performances, and geographic coverage. This integration is facilitated by the recent deployment of low power wide area networks (LPWAN) in the licensed bands, especially narrowband IoT (NB-IoT) and long-term evolution for machine-type communications (LTE-M), which are standardized technologies that will continue evolving as part of the fifth generation (5G) specifications. This paper proposes a design methodology for combined networks using LR-WPAN and LPWAN technologies. These networks are combined at the device level using a cluster-tree topology. An example is shown here, where an existing IEEE 802.15.4 network is combined with NB-IoT. To this end, new dual nodes are incorporated, acting as cluster heads. The paper discusses the different aspects of formation and operation of the combined network. A dynamic link selection (DLS) algorithm is also proposed, based on which cluster headers dynamically determine the preferred link, depending on link quality and type of traffic. Extensive simulations show that the DLS algorithm significantly increases battery life on dual nodes, which are the nodes with the highest power demands. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are created according to the principles of ad hoc mobile networks (MANETs), i.e., spontaneous creation of a wireless network for vehicle-to-vehicle (V2V) communication. Each vehicle in this network is treated as a node that is part of the mobile network. VANET turns all cooperating vehicles into a wireless router or node. This makes it possible to connect all cars within range to a stationary unit and create a wide network with a huge range. VANET is widely used for better traffic management, vehicle-to-vehicle communication, and road information provision. The VANET network is exposed to identity and information attacks, concealing or delaying data transmission, or information theft. Therefore, there are multiple types of attack, such as Sybil or bogus, that might harm the whole network infrastructure. The consequences of the mentioned two attacks could lead not only to the given infrastructure but could cause hammering people's lives. In this paper, we analyze the ongoing methods for preserving Sybil and bogus attacks in a VANET network together with the authors' methods: the Bogus & Sybil Trust Level & Timestamp (B&STL&T) algorithm and the Bogus & Sybil Enhanced Behavior Processing & Footprint (B&SEBP&F) algorithm. The first algorithm, the Bogus & Sybil Trust Level & Timestamp (B&STL&T) algorithm was improved into the Bogus & Sybil Enhanced Behavior Processing & Footprint (B&SEBP&F), presented in the paper. The proposed methods were tested with multiple scenarios using different variations of bogus and Sybil attack and various attacker–victim node number ratios. During analysis, it was observed that detection of all attackers in the network was reduced by approximately 30% in comparison to previous work and that of other cited authors. [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) 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]

The aim of this paper is to introduce a NUT model (NUT: network-uncertainty-trust) that aids the decrease of the uncertainty of measurements in autonomous hybrid Internet of Things sensor networks. The problem of uncertainty in such networks is a consequence of various operating conditions and varied quality of measurement nodes, making statistical approach less successful. This paper presents a model for decreasing the uncertainty through the use of socially inspired metaphors of reputation, trust, and confidence that are the untapped latent information. The model described in the paper shows how the individual reputation of each node can be assessed on the basis of opinions provided by other nodes of the hybrid measurement network, and that this method allows to assess the extent of uncertainty the node introduces to the network. This, in turn, allows nodes of low uncertainty to have a greater impact on the reconstruction of values. The verification of the model, as well as examples of its applicability to air quality measurements are presented as well. Simulations demonstrate that the use of the model can decrease the uncertainty by up to 55% while using the EWMA (exponentially weighted moving average) algorithm, as compared to the reference one. [ABSTRACT FROM AUTHOR]

Autonomous driving is evolving through the convergence of object recognition using multiple sensors in the fourth industrial revolution. In this paper, we propose a system that utilizes data logging to control the functions of micro e-mobility vehicles (MEVs) and to build a database for autonomous driving with a gesture recognition algorithm for use in an IoT environment. The proposed system uses multiple sensors installed in an MEV to log driving data as the vehicle operates and to recognize objects surrounding the MEV to remove blind spots. In addition, the proposed system is capable of multi-sensor control and data logging for the MEV based on a gesture recognition algorithm, and it can provide safety information to allow the system to address blind spots or unexpected situations by recognizing the appearances or gestures of pedestrians around the MEV. The proposed system can be applied and extended in various fields, such as 5G communication, autonomous driving, and AI, which are the core technologies of the fourth industrial revolution. [ABSTRACT FROM AUTHOR]

The functionality of the Internet is continually changing from the Internet of Computers (IoC) to the "Internet of Things (IoT)". Most connected systems, called Cyber-Physical Systems (CPS), are formed from the integration of numerous features such as humans and the physical environment, smart objects, and embedded devices and infrastructure. There are a few critical problems, such as security risks and ethical issues that could affect the IoT and CPS. When every piece of data and device is connected and obtainable on the network, hackers can obtain it and utilise it for different scams. In medical healthcare IoT-CPS, everyday medical and physical data of a patient may be gathered through wearable sensors. This paper proposes an AI-enabled IoT-CPS which doctors can utilise to discover diseases in patients based on AI. AI was created to find a few disorders such as Diabetes, Heart disease and Gait disturbances. Each disease has various symptoms among patients or elderly. Dataset is retrieved from the Kaggle repository to execute AI-enabled IoT-CPS technology. For the classification, AI-enabled IoT-CPS Algorithm is used to discover diseases. The experimental results demonstrate that compared with existing algorithms, the proposed AI-enabled IoT-CPS algorithm detects patient diseases and fall events in elderly more efficiently in terms of Accuracy, Precision, Recall and F-measure. [ABSTRACT FROM AUTHOR]

Clock synchronization is still a vital and challenging task for underground coal wireless internet of things (IoT) due to the uncertainty of underground environment and unreliability of communication links. Instead of considering on-demand driven clock synchronization, this paper proposes a novel Adaptive Robust Synchronization (ARS) scheme with packets loss for mine wireless environment. A clock synchronization framework that is based on Kalman filtering is first proposed, which can adaptively adjust the sampling period of each clock and reduce the communication overhead in single-hop networks. The proposed scheme also solves the problem of outliers in data packets with time-stamps. In addition, this paper extends the ARS algorithm to multi-hop networks. Additionally, the upper and lower bounds of error covariance expectation are analyzed in the case of incomplete measurement. Extensive simulations are conducted in order to evaluate the performance. In the simulation environment, the clock accuracy of ARS algorithm is improved by 7.85% when compared with previous studies for single-hop networks. For multi-hop networks, the proposed scheme improves the accuracy by 12.56%. The results show that the proposed algorithm has high scalability, robustness, and accuracy, and can quickly adapt to different clock accuracy requirements. [ABSTRACT FROM AUTHOR]

This paper proposes a modified architecture of the Long-Term Evolution (LTE) mobile network to provide services for the Internet of Things (IoT). This is achieved by allocating a narrow bandwidth and transferring the scheduling functions from the eNodeB base station to an NB-IoT controller. A method for allocating uplink and downlink resources of the LTE/NB-IoT hybrid technology is applied to ensure the Quality of Service (QoS) from end-to-end. This method considers scheduling traffic/resources on the NB-IoT controller, which allows eNodeB planning to remain unchanged. This paper also proposes a prioritization approach within the IoT traffic to provide End-to-End (E2E) QoS in the integrated LTE/NB-IoT network. Further, we develop "smart queue" management algorithms for the IoT traffic prioritization. To demonstrate the feasibility of our approach, we performed a number of experiments using simulations. We concluded that our proposed approach ensures high end-to-end QoS of the real-time traffic by reducing the average end-to-end transmission delay. [ABSTRACT FROM AUTHOR]

Before each user equipment (UE) can send data using the narrowband physical uplink shared channel (NPUSCH), each UE should periodically monitor a search space in the narrowband physical downlink control channel (NPDCCH) to decode a downlink control indicator (DCI) over narrowband Internet of Things (NB-IoT). This monitoring period, called the NPDCCH period in NB-IoT, can be flexibly adjusted for UEs with different channel qualities. However, because low-cost NB-IoT UEs operate in the half-duplex mode, they cannot monitor search spaces in NPDCCHs and transmit data in the NPUSCH simultaneously. Thus, as we observed, a percentage of uplink subframes will be wasted when UEs monitor search spaces in NPDCCHs, and the wasted percentage is higher when the monitored period is shorter. In this paper, to address this issue, we formulate the cross-cycled resource allocation problem to reduce the consumed subframes while satisfying the uplink data requirement of each UE. We then propose a cross-cycled uplink resource allocation algorithm to efficiently use the originally unusable NPUSCH subframes to increase resource utilization. Compared with the two resource allocation algorithms, the simulation results verify our motivation of using the cross-cycled radio resources to achieve massive connections over NB-IoT, especially for UEs with high channel qualities. The results also showcase the efficiency of the proposed algorithm, which can be flexibly applied for more different NPDCCH periods. [ABSTRACT FROM AUTHOR]

The Industrial Internet of Things (IIoT) has led to the growth and expansion of various new opportunities in the new Industrial Transformation. There have been notable challenges regarding the security of data and challenges related to privacy when collecting real-time and automatic data while observing applications in the industry. This paper proposes an Federated Transfer Learning for Authentication and Privacy Preservation Using Novel Supportive Twin Delayed DDPG (S-TD3) Algorithm for IIoT. In FT-Block (Federated transfer learning blockchain), several blockchains are applied to preserve privacy and security for all types of industrial applications. Additionally, by introducing the authentication mechanism based on transfer learning, blockchains can enhance the preservation and security standards for industrial applications. Specifically, Novel Supportive Twin Delayed DDPG trains the user model to authenticate specific regions. As it is considered one of the most open and scalable interacting platforms of information, it successfully helps in the positive transfer of different kinds of data between devices in more significant and local operations of the industry. It is mainly due to a single authentication factor, and the poor adaptation to regular increases in the number of users and different requirements that make the current authentication mechanism suffer a lot in IIoT. As a result, it has been very clearly observed that the given solutions are very useful. [ABSTRACT FROM AUTHOR]

The application of the Internet of Things (IoT) in wireless sensor networks (WSNs) poses serious challenges in preserving network longevity since the IoT necessitates a considerable amount of energy usage for sensing, processing, and data communication. As a result, there are several conventional algorithms that aim to enhance the performance of WSN networks by incorporating various optimization strategies. These algorithms primarily focus on the network layer by developing routing protocols to perform reliable communication in an energy-efficient manner, thus leading to an enhanced network life. For increasing the network lifetime in WSNs, clustering has been widely accepted as an important method that groups sensor nodes (SNs) into clusters. Additionally, numerous researchers have been focusing on devising various methods to increase the network lifetime. The prime factor that helps to maximize the network lifetime is the minimization of energy consumption. The authors of this paper propose a multi-objective optimization approach. It selects the optimal route for transmitting packets from source to sink or the base station (BS). The proposed model employs a two-step approach. The first step employs a trust model to select the cluster heads (CHs) that manage the data communication between the BS and nodes in the cluster. Further, a novel hybrid algorithm, combining a particle swarm optimization (PSO) algorithm and a genetic algorithm (GA), is proposed to determine the routes for data transmission. To validate the efficacy of the proposed hybrid algorithm, named PSOGA, simulations were conducted and the results were compared with the existing LEACH method and PSO, with a random route selection for five different cases. The obtained results establish the efficiency of the proposed approach, as it outperforms existing methods with increased energy efficiency, increased network throughput, high packet delivery rate, and high residual energy throughout the entire iterations. [ABSTRACT FROM AUTHOR]

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]

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]

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]

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]

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]

The automation strategy of today's smart cities relies on large IoT (internet of Things) systems that collect big data analytics to gain insights. Although there have been recent reviews in this field, there is a remarkable gap that addresses four sides of the problem. Namely, the application of video surveillance in smart cities, algorithms, datasets, and embedded systems. In this paper, we discuss the latest datasets used, the algorithms used, and the recent advances in embedded systems to form edge vision computing are introduced. Moreover, future trends and challenges are addressed. [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]