Search

Vehicular computation offloading is a well-received strategy to execute delay-sensitive and/or compute-intensive tasks of legacy vehicles. The response time of vehicular computation offloading can be shortened by using mobile edge computing that offers strong computing power, driving these computation tasks closer to end users. However, the quality of communication is hard to guarantee due to the obstruction of dense buildings or lack of infrastructure in some zones. Unmanned Aerial Vehicles (UAVs), therefore, have become one of the means to establish communication links for the two ends owing to its characteristics of ignoring terrain and flexible deployment. To make a sensible decision of computation offloading, nevertheless vehicles need to gather offloading-related global information, in which Software-Defined Networking (SDN) has shown its advances in data collection and centralized management. In this paper, thus, we propose an SDN-enabled UAV-assisted vehicular computation offloading optimization framework to minimize the system cost of vehicle computing tasks. In our framework, the UAV and the Mobile Edge Computing (MEC) server can work on behalf of the vehicle users to execute the delay-sensitive and compute-intensive tasks. The UAV, in a meanwhile, can also be deployed as a relay node to assist in forwarding computation tasks to the MEC server. We formulate the offloading decision-making problem as a multi-players computation offloading sequential game, and design the UAV-assisted Vehicular Computation Cost Optimization (UVCO) algorithm to solve this problem. Simulation results demonstrate that our proposed algorithm can make the offloading decision to minimize the Average System Cost (ASC).

As the internet continues to be populated with new devices and emerging technologies, the attack surface grows exponentially. Technology is shifting towards a profit-driven Internet of Things market where security is an afterthought. Traditional defending approaches are no longer sufficient to detect both known and unknown attacks to high accuracy. Machine learning intrusion detection systems have proven their success in identifying unknown attacks with high precision. Nevertheless, machine learning models are also vulnerable to attacks. Adversarial examples can be used to evaluate the robustness of a designed model before it is deployed. Further, using adversarial examples is critical to creating a robust model designed for an adversarial environment. Our work evaluates both traditional machine learning and deep learning models' robustness using the Bot-IoT dataset. Our methodology included two main approaches. First, label poisoning, used to cause incorrect classification by the model. Second, the fast gradient sign method, used to evade detection measures. The experiments demonstrated that an attacker could manipulate or circumvent detection with significant probability., Comment: MDPI Mach. Learn. Knowl. Extr. 2021, 3(2), 333-356; https://www.mdpi.com/2624-800X/1/2/14

Utilising the mobilisation of a sink node in a wireless sensor network to combat the energy hole, or hotspot issue, is well referenced. However, another issue, that of energy spikes may remain. With the mobile sink node potentially communicating with some nodes more than others. In this study we propose the Mobility Aware Duty Cycling and Dynamic Preambling Algorithm (MADCaDPAL). This algorithm utilises an existing solution where a communication threshold is built between a mobile sink node using predictable mobility and static nodes on its path. MADCaDPAL bases decisions relating to node sleep function, moving to clear channel assessment and the subsequent sending of preambles on the relation between the threshold built by the static node and the position of the mobile sink node. MADCaDPAL achieves a reduction in average energy consumption of up to 80%, this when used in conjunction with a lightweight carrier-sense multiple access based MAC implementation. Maximum energy consumption amongst individual nodes is also brought closer to the average, reducing energy spikes and subsequently improving network lifetime. Additionally, frame delivery to the sink is improved overall.

Software-defined vehicular networks (SDVN) is a promising technology to overcome the limitations of current vehicular networking. However, existing vehicular routing schemes are not equipped to handle communication in SDVNs. In addition, routing schemes in SDVNs, in general, has been lightly addressed in the literature to well compute the flow tables. To fill this gap, this article explores the potential of SDVNs from the aspect of routing and studies the design principles of routing schemes in SDVNs and classifies the current routing solutions based on different criteria. SDVN routing schemes are then compared through comprehensive analysis, and key open issues and opportunities for future research directions are discussed.

Traditional firewalls employ listed rules in both configuration and process phases to regulate network traffic. However, configuring a firewall with listed rules may create rule conflicts, and slows down the firewall. To overcome this problem, we have proposed a Tree-rule firewall in our previous study. Although the Tree-rule firewall guarantees no conflicts within its rule set and operates faster than traditional firewalls, keeping track of the state of network connections using hashing functions incurs extra computational overhead. In order to reduce this overhead, we propose a hybrid Tree-rule firewall in this paper. This hybrid scheme takes advantages of both Tree-rule firewalls and traditional listed-rule firewalls. The GUIs of our Tree-rule firewalls are utilized to provide a means for users to create conflict-free firewall rules, which are organized in a tree structure and called 'tree rules'. These tree rules are later converted into listed rules that share the merit of being conflict-free. Finally, in decision making, the listed rules are used to verify against packet header information. The rules which have matched with most packets are moved up to the top positions by the core firewall. The mechanism applied in this hybrid scheme can significantly improve the functional speed of a firewall.

An essential element in the smart city vision is providing safe and secure journeys via intelligent vehicles and smart roads. Vehicular ad hoc networks (VANETs) have played a significant role in enhancing road safety where vehicles can share road information conditions. However, VANETs share the same security concerns of legacy ad hoc networks. Unlike exiting works, we consider, in this paper, detection a common attack where nodes modify safety message or drop them. Unfortunately, detecting such a type of intrusion is a challenging problem since some packets may be lost or dropped in normal VANET due to congestion without malicious action. To mitigate these concerns, this paper presents a novel scheme for minimizing the invalidity ratio of VANET packets transmissions. In order to detect unusual traffic, the proposed scheme combines evidences from current as well as past behaviour to evaluate the trustworthiness of both data and nodes. A new intrusion detection scheme is accomplished through a four phases, namely, rule-based security filter, Dempster–Shafer adder, node’s history database, and Bayesian learner. The suspicion level of each incoming data is determined based on the extent of its deviation from data reported from trustworthy nodes. Dempster–Shafer’s theory is used to combine multiple evidences and Bayesian learner is adopted to classify each event in VANET into well-behaved or misbehaving event. The proposed solution is validated through extensive simulations. The results confirm that the fusion of different evidences has a significant positive impact on the performance of the security scheme compared to other counterparts.

In this paper, we consider the issue of the secure transmissions for the cognitive radio-based Internet of Medical Things (IoMT) with wireless energy harvesting. In these systems, a primary transmitter (PT) will transmit its sensitive medical information to a primary receiver (PR) by a multi-antenna-based secondary transmitter (ST), where we consider that a potential eavesdropper may listen to the PT’s sensitive information. Meanwhile, the ST also transmits its own information concurrently by utilizing spectrum sharing. We aim to propose a novel scheme for jointly designing the optimal parameters, i.e., energy harvesting (EH) time ratio and secure beamforming vectors, for maximizing the primary secrecy transmission rate while guaranteeing secondary transmission requirement. For solving the nonconvex optimization problem, we transfer the problem into convex optimization form by adopting the semidefinite relaxation (SDR) method and Charnes–Cooper transformation technique. Then, the optimal secure beamforming vectors and energy harvesting duration can be obtained easily by utilizing the CVX tools. According to the simulation results of secrecy transmission rate, i.e., secrecy capacity, we can observe that the proposed protocol for the considered system model can effectively promote the primary secrecy transmission rate when compared with traditional zero-forcing (ZF) scheme, while ensuring the transmission rate of the secondary system.

Wireless sensor networks (WSNs) with a static sink suffer from concentrated data traffic in the vicinity of the sink, which increases the burden on the nodes surrounding the sink, and impels them to deplete their batteries faster than other nodes in the network. Mobile sinks solve this corollary by providing a more balanced traffic dispersion, by shifting the traffic concentration with the mobility of the sink. However, it brings about a new expenditure to the network, where prior to delivering data, nodes are obligated to procure the sink’s current position. This paper proposes Tuft, a novel hierarchical tree structure that is able to avert the overhead cost from delivering the fresh sink’s position while maintaining a uniform dispersion of data traffic concentration. Tuft appropriates the mobility of the sink to its advantage, to increase the uniformity of energy consumption throughout the network. Moreover, we propose Tuft-Cells, a distributed dissemination protocol that models data routing as a Multi-Criteria Decision Making (MCDM) in three steps. To begin with, each criterion constitutes a random variable defined by a mass function. Each of these cirterion serves a proportionately distinguishable alternative, and hence, may conflict. Therefore, the Analytic Hierarchy Process (AHP) quantifies the relationship between criteria. Finally, the final forwarding decision is derived by a weighted aggregation. Tuft is compared with state-of-the-art protocols, and the performance evaluation illustrates that our protocol adheres to the requirements of WSNs, in terms of energy consumption, and success ratio, considering the additional overhead cost brought by the mobility of the sink.

Industrial Control Systems (ICS) are hardware, network, and software, upon which a facility depends to allow daily operations to function. In most cases society takes the operation of such systems, for example public transport, tap water or electricity, for granted. However, the disruption of those systems might have serious consequences across different sectors. In this paper, we propose a supervised energy-based approach for anomaly detection in a clean water supply system using a new dataset which is physically modelled in the Festo MPA workstation rig. The novelty relies on the set of engineered features collected from the testbed, including voltage, current and power from the sensors that compose the ICS. These values are obtained from independent current sensors that we have physically wired to the testbed. Five machine learning algorithms; Support Vector Machine, k-Nearest Neighbours, Multilayer Perceptron, Decision Tree and Random Forest are employed to evaluate the effectiveness of our proposed features. The metrics used to present the performance of the selected machine learning algorithms are F1-Score, G-Mean, False Positive Rate (FPR) and False Negative Rate (FNR). The results show that machine learning algorithms can classify the variations of energy produced by the execution of cyber-attacks as anomalous by achieving 95.5% F1-Score, and 6.8% FNR with the Multilayer Perceptron classifier.

Internet of Things (IoT) has become one of the fastest-growing technologies and has been broadly applied in various fields. IoT networks contain millions of devices with the capability of interacting with each other and providing functionalities that were never available to us before. These IoT networks are designed to provide friendly and intelligent operations through big data analysis of information generated or collected from an abundance of devices in real time. However, the diversity of IoT devices makes the IoT networks’ environments more complex and more vulnerable to various web attacks compared to traditional computer networks. In this article, we propose a novel ensemble deep learning based web attack detection system (EDL-WADS) to alleviate the serious issues that IoT networks faces. Specifically, we have designed three deep learning models to first detect web attacks separately. We then use an ensemble classifier to make the final decision according to the results obtained from the three deep learning models. In order to evaluate the proposed WADS, we have performed experiments on a public dataset as well as a real-word dataset running in a distributed environment. Experimental results show that the proposed system can detect web attacks accurately with low false positive and negative rates.

Port Knocking is a method for authenticating clients through a closed stance firewall, and authorising their requested actions, enabling severs to offer services to authenticated clients, without opening ports on the firewall. Advances in port knocking have resulted in an increase in complexity in design, preventing port knocking solutions from realising their potential. This paper proposes a novel port knocking solution, named Crucible, which is a secure method of authentication, with high usability and features of stealth, allowing servers and services to remain hidden and protected. Crucible is a stateless solution, only requiring the client memorise a command, the server's IP and a chosen password. The solution is forwarded as a method for protecting servers against attacks ranging from port scans, to zero-day exploitation. To act as a random oracle for both client and server, cryptographic hashes were generated through chaotic systems., J. Nonlinear Dyn (2020)

The evolution of wireless and mobile communication from 0G to the upcoming 5G gives rise to data sharing through the Internet. This data transfer via open public networks are susceptible to several types of attacks. Encryption is a method that can protect information from hackers and hence confidential data can be secured through a cryptosystem. Due to the increased number of cyber attacks, encryption has become an important component of modern-day communication. In this article, a new image encryption algorithm is presented using chaos theory and dynamic substitution. The proposed scheme is based on two-dimensional Henon, Ikeda chaotic maps, and substitution box (S-box) transformation. Through Henon, a random S-Box is selected and the image pixel is substituted randomly. To analyze security and robustness of the proposed algorithm, several security tests such as information entropy, histogram investigation, correlation analysis, energy, homogeneity, and mean square error are performed. The entropy values of the test images are greater than 7.99 and the key space of the proposed algorithm is 2798. Furthermore, the correlation values of the encrypted images using the proposed scheme are close to zero when compared with other conventional schemes. The number of pixel change rate (NPCR) and unified average change intensity (UACI) for the proposed scheme are higher than 99.50% and 33, respectively. The simulation results and comparison with the state-of-the-art algorithms prove the efficiency and security of the proposed scheme.

KNN-Based outlier detection over IoT streaming data is a fundamental problem, which has many applications. However, due to its computational complexity, existing efforts cannot efficiently work in the IoT streaming data. In this paper, we propose a novel framework named GAAOD(Grid-based Approximate Average Outlier Detection) to support KNN-Based outlier detection over IoT streaming data. Firstly, GAAOD introduces a grid-based index to manage summary information of streaming data. It can self-adaptively adjust the resolution of cells, and achieve the goal of efficiently filtering objects that almost cannot become outliers. Secondly, GAAOD uses a min-heap-based algorithm to compute the distance upper-/lower-bound between objects and their k-th nearest neighbors respectively. Thirdly, GAAOD utilizes a k-skyband based algorithm to maintain outliers and candidate outliers. Theoretical analysis and experimental results verify the efficiency and accuracy of GAAOD. INDEX TERMS IoT streaming data, KNN-based outliers, indexes, error guarantee.

Edge computing is a research hotspot that extends cloud computing to the edge of the network. Due to the recent developments in computation, storage and network technology for end devices, edge networks have become more powerful, making it possible to integrate locator/identity separation protocol (LISP) into these networks. Accordingly, in this paper, we introduce LISP into edge routers at the edge network, focusing primarily on the delay problem of mapping resolution and cache updating in LISP with the help of edge computing. To solve this delay problem, we first analyze the communication process of the locator/identity separation network and consider using the prediction method to underpin this research. In order to achieve a good prediction result, we propose and implement a Fixed Identity Mapping Prediction Algorithm (FIMPA) based on collaborative filtering, and further verify the effectiveness of the proposed algorithm through experiments on real-world data.

© 2013 IEEE. Mobile cloud computing has emerged as a promising paradigm to facilitate computation-intensive and delay-sensitive mobile applications. Computation offloading services at the edge mobile cloud environment are provided by small-scale cloud infrastructures such as cloudlets. While offloading tasks to in-proximity cloudlets enjoys benefits of lower latency and smaller energy consumption, new issues related to the cloudlets are rising. For instance, unbalanced task distribution and huge load gaps among heterogeneous mobile cloudlets are becoming more challenging, concerning the network dynamics and distributed task offloading. In this paper, we propose 'FairEdge', a Fairness-oriented computation offloading scheme to enable balanced task distribution for mobile Edge cloudlet networks. By integrating the balls-and-bins theory with fairness index, our solution promotes effective load balancing with limited information at low computation cost. The evaluation results from extensive simulations and experiments with real-world datasets show that, FairEdge outperforms conventional task offloading methods, and it can achieve a network fairness up to 0.85 and reduce the unbalanced task offload by 50%.

Destination Advertisement Objects (DAOs) are sent upward by RPL nodes toward the DODAG root, to build the downward routing paths carrying traffic from the root to its associated nodes. This routing mechanism can be exploited by a malicious node periodically transmitting a large volume of DAO messages towards its parent, which in turn will forward such messages to its own parent and so on, until they arrive at the Direction-Oriented Directed Acyclic Graph (DODAG) root. This ultimately results in a negative effect on network performance in terms of energy consumption, latency and reliability. The first objective of this paper is to evaluate the effect of such a DAO attack in the context of an RPL IoT network. In particular, identifying the particular performance metrics and network resources affected most greatly. The second objective is the proposal of mitigating security mechanisms in relation to DAO attacks and to evaluate their effectiveness. The simulation results have shown how the attack can damage the network performance by significantly increasing the DAO overhead and power consumption. It also demonstrated that the DAO attack affect the reliability of the downward traffic under specific conditions. The proposed mechanisms showed a good capacity in restoring the optimal performance of the network by up to 205%, 181%, 87% and 6%, in terms of overhead, latency, power consumption and packet delivery ratio respectively.

The Next Generation 5G Networks can greatly benefit from the synergy between virtualization paradigms, such as the Network Function Virtualization (NFV), and service provisioning platforms such as the IP Multimedia Subsystem (IMS). The NFV concept is evolving towards a lightweight solution based on containers that, by contrast to classic virtual machines, do not carry a whole operating system and result in more efficient and scalable deployments. On the other hand, IMS has become an integral part of the 5G core network, for instance, to provide advanced services like Voice over LTE (VoLTE). In this paper we combine these virtualization and service provisioning concepts, deriving a containerized IMS infrastructure, dubbed cIMS, providing its assessment through statistical characterization and experimental measurements. Specifically, we: $\textit {i)}$ model cIMS through the queueing networks methodology to characterize the utilization of virtual resources under constrained conditions; $\textit {ii)}$ draw an extended version of the Pollaczek-Khinchin formula, which is useful to deal with bulk arrivals; $\textit {iii)}$ afford an optimization problem focused at maximizing the whole cIMS performance in the presence of capacity constraints, thus providing new means for the service provider to manage service level agreements (SLAs); $\textit {iv)}$ evaluate a range of cIMS scenarios, considering different queuing disciplines including also multiple job classes. An experimental testbed based on the open source platform Clearwater has been deployed to derive some realistic values of key parameters (e.g., arrival and service times).

Internet of Things (IoT) are increasingly common in our society, and can be found in civilian settings as well as sensitive applications, such as battlefields and national security. Given the potential of these devices to be targeted by attackers, they are a valuable source in digital forensic investigations. In addition, incriminating evidence may be stored on an IoT device (e.g., Amazon Echo in a home environment and Fitbit worn by the victim or an accused person). In comparison to IoT security and privacy literature, IoT forensics is relatively under-studied. IoT forensics is also challenging in practice, particularly due to the complexity, diversity, and heterogeneity of IoT devices and ecosystems. In this paper, we present an IoT-based forensic model that supports the identification, acquisition, analysis, and presentation of potential artifacts of forensic interest from IoT devices and the underpinning infrastructure. Specifically, we use the popular Amazon Echo as a use case to demonstrate how our proposed model can be used to guide forensics analysis of IoT devices.

The Internet of Things (IoT) has the potential to transform communities around the globe into smart cities. The massive deployment of sensor-embedded devices in the smart cities generates voluminous amounts of data that need to be stored and processed in an efficient manner. Long-haul data transmission to the remote cloud data centers leads to higher delay and bandwidth consumption. In smart cities, the delay-sensitive applications have stringent requirements in term of response time. To reduce latency and bandwidth consumption, edge computing plays a pivotal role. The resource-constrained smart devices at the network core need to offload computationally complex tasks to the edge devices located in their vicinity and have relatively higher resources. In this paper, we propose an end-to-end encryption framework, SmartEdge, for a smart city application by executing computationally complex tasks at the network edge and cloud data centers. Using a lightweight symmetric encryption technique, we establish a secure connection among the smart core devices for multimedia streaming towards the registered and verified edge devices. Upon receiving the data, the edge devices encrypts the multimedia streams, encodes them, and broadcast to the cloud data centers. Prior to the broadcasting, each edge device establishes a secured connection with a data center that relies on the combination of symmetric and asymmetric encryption techniques. In SmartEdge, the execution of a lightweight encryption technique at the resource-constrained smart devices, and relatively complex encryption techniques at the network edge and cloud data centers reduce the resource utilization of the entire network. The proposed framework reduces the response time, security overhead, computational and communication costs, and has a lower end-to-end encryption delay for participating entities. Moreover, the proposed scheme is highly resilient against various adversarial attacks.

The increasing use of encrypted data within file storage and in network communications leaves investigators with many challenges. One of the most challenging is the Tor protocol, as its main focus is to protect the privacy of the user, in both its local footprint within a host and over a network connection. The Tor browser, though, can leave behind digital artefacts which can be used by an investigator. This paper outlines an experimental methodology and provides results for evidence trails which can be used within real-life investigations.

Highlights• This study presents the complete and slotted interference graph model. • The service uses the complete interference graph to evaluate the network. • Slotted interference graphs are used to reschedule problematic connections. • Real-world experiments confirm the validity of both methods.AbstractWith billions of connected devices in the near future, the major challenge is to develop networks to build an Industrial Internet of Things which is scalable, energy-efficient, reliable and affordable. To this end, low-power wireless personal area networks (LP-WPAN) provide a solution at minimum costs. However, to ensure continuous performance verification, LP-WPAN requires a centrally monitored and controlled service. This work proposes such an edge service, i.e. network monitoring and optimal reconfiguration of scheduled LP-WPANs. The approach is based on a transformation of the schedule into a new model, interference graphs. The interference graphs allow to design evaluation and rescheduling recommender methods to monitor and reconfigure the schedule. An experimental setup was developed to test and validate the approach. The results show that the model and methods provide an accurate representation of the behavior of the network, and that the new rescheduling recommender greatly improves the network's performance, compared to random rescheduling.

The epoch of the Internet of Things (IoT) has come by enabling almost everything to gather and share electronic information. Considering the unreliable factors of public IoT, how to outsource huge amounts of indispensable stream data generated by the nodes to the remote storage efficiently and securely is one of the most challenging issues. In this paper, we propose a secure lightweight stream data outsourcing framework for IoT based on identity and blockchain. Taking advantage of identity-based cryptography and blockchain, for public IoT containing untrusted communication channels, nodes, remote storage, and even verifiers, we introduce a private mobile network and multiple verifiers to ensure that the stream data are stored intact and updated correctly, without the costs and risks brought by the Public Key Infrastructures (PKI). Meanwhile, the framework can also achieve privacy-preserving checking, by revealing no data to the other entities besides the remote storage, even in the blockchains. Our comprehensive analysis and experiments demonstrate that the proposed framework is suitable for lightweight devices and practical for IoT.

In 2019, the majority of companies used at least one cloud computing service and it is expected that by the end of 2021, cloud data centres will process 94% of workloads. The financial and operational advantages of moving IT infrastructure to specialised cloud providers are clearly compelling. However, with such volumes of private and personal data being stored in cloud computing infrastructures, security concerns have risen. Motivated to monitor and analyze adversarial activities, we deploy multiple honeypots on the popular cloud providers, namely Amazon Web Services (AWS), Google Cloud Platform (GCP) and Microsoft Azure, and operate them in multiple regions. Logs were collected over a period of three weeks in May 2020 and then comparatively analysed, evaluated and visualised. Our work revealed heterogeneous attackers’ activity on each cloud provider, both when one considers the volume and origin of attacks, as well as the targeted services and vulnerabilities. Our results highlight the attempt of threat actors to abuse popular services, which were widely used during the COVID-19 pandemic for remote working, such as remote desktop sharing. Furthermore, the attacks seem to exit not only from countries that are commonly found to be the source of attacks, such as China, Russia and the United States, but also from uncommon ones such as Vietnam, India and Venezuela. Our results provide insights on the adversarial activity during our experiments, which can be used to inform the Situational Awareness operations of an organisation.

Segmentation-based methods are widely used for scene text detection due to their superiority in describing arbitrary-shaped text instances. However, two major problems still exist: 1) current label generation techniques are mostly empirical and lack theoretical support, discouraging elaborate label design; 2) as a result, most methods rely heavily on text kernel segmentation which is unstable and requires deliberate tuning. To address these challenges, we propose a human cognition-inspired framework, termed, Conceptual Text Region Network (CTRNet). The framework utilizes Conceptual Text Regions (CTRs), which is a class of cognition-based tools inheriting good mathematical properties, allowing for sophisticated label design. Another component of CTRNet is an inference pipeline that, with the help of CTRs, completely omits the need for text kernel segmentation. Compared with previous segmentation-based methods, our approach is not only more interpretable but also more accurate. Experimental results show that CTRNet achieves state-of-the-art performance on benchmark CTW1500, Total-Text, MSRA-TD500, and ICDAR 2015 datasets, yielding performance gains of up to 2.0%. Notably, to the best of our knowledge, CTRNet is among the first detection models to achieve F-measures higher than 85.0% on all four of the benchmarks, with remarkable consistency and stability., Preprint submitted to Neurocomputing

Device-free localization (DFL) locates targets without equipping with wireless devices or tag under the Internet-of-Things (IoT) architectures. As an emerging technology, DFL has spawned extensive applications in the IoT environment, such as intrusion detection, mobile robot localization, and location-based services. Current DFL-related machine learning (ML) algorithms still suffer from low localization accuracy and weak dependability/robustness because the group structure has not been considered in their location estimation, which leads to an undependable process. To overcome these challenges, we propose in this work a dependable block-sparse scheme by particularly considering the group structure of signals. An accurate and robust ML algorithm named block-sparse coding with the proximal operator (BSCPO) is proposed for DFL. In addition, a severe Gaussian noise is added in the original sensing signals for preserving network-related privacy as well as improving the dependability of the model. The real-world data-driven experimental results show that the proposed BSCPO achieves robust localization and signal-recovery performance even under severely noisy conditions and outperforms state-of-the-art DFL methods. For single-target localization, BSCPO retains high accuracy when the signal-to-noise ratio exceeds −10 dB. BSCPO is also able to localize accurately under most multitarget localization test cases.

In recent years, there has been a massive increase in the amount of Internet of Things (IoT) devices as well as the data generated by such devices. The participating devices in IoT networks can be problematic due to their resource-constrained nature, and integrating security on these devices is often overlooked. This has resulted in attackers having an increased incentive to target IoT devices. As the number of attacks possible on a network increases, it becomes more difficult for traditional intrusion detection systems (IDS) to cope with these attacks efficiently. In this paper, we highlight several machine learning (ML) methods such as k-nearest neighbour (KNN), support vector machine (SVM), decision tree (DT), naive Bayes (NB), random forest (RF), artificial neural network (ANN), and logistic regression (LR) that can be used in IDS. In this work, ML algorithms are compared for both binary and multi-class classification on Bot-IoT dataset. Based on several parameters such as accuracy, precision, recall, F1 score, and log loss, we experimentally compared the aforementioned ML algorithms. In the case of HTTP distributed denial-of-service (DDoS) attack, the accuracy of RF is 99%. Furthermore, other simulation results-based precision, recall, F1 score, and log loss metric reveal that RF outperforms on all types of attacks in binary classification. However, in multi-class classification, KNN outperforms other ML algorithms with an accuracy of 99%, which is 4% higher than RF.

A common privacy issue in traditional machine learning is that data needs to be disclosed for the training procedures. In situations with highly sensitive data such as healthcare records, accessing this information is challenging and often prohibited. Luckily, privacy-preserving technologies have been developed to overcome this hurdle by distributing the computation of the training and ensuring the data privacy to their owners. The distribution of the computation to multiple participating entities introduces new privacy complications and risks. In this paper, we present a privacy-preserving decentralised workflow that facilitates trusted federated learning among participants. Our proof-of-concept defines a trust framework instantiated using decentralised identity technologies being developed under Hyperledger projects Aries/Indy/Ursa. Only entities in possession of Verifiable Credentials issued from the appropriate authorities are able to establish secure, authenticated communication channels authorised to participate in a federated learning workflow related to mental health data., Comment: MDPI Mach. Learn. Knowl. Extr. 2021, 3(2), 333-356; https://doi.org/10.3390/make3020017

Cryptographic algorithms and functions should possess some of the important functional requirements such as: non-linearity, resiliency, propagation and immunity. Several previous studies were executed to analyze these characteristics of the cryptographic functions specifically for Boolean and symmetric functions. Randomness is a requirement in present cryptographic algorithms and therefore, Symmetric Random Function Generator (SRFG) has been developed. In this paper, we have analysed SRFG based on propagation feature and immunity. Moreover, NIST recommended statistical suite has been tested on SRFG outputs. The test values show that SRFG possess some of the useful randomness properties for cryptographic applications such as individual frequency in a sequence and block-based frequency, long run of sequences, oscillations from 0 to 1 or vice-versa, patterns of bits, gap bits between two patterns, and overlapping block bits. We also analyze the comparison of SRFG and some existing random number generators. We observe that SRFG is efficient for cryptographic operations in terms of propagation and immunity features.

The threat from ransomware continues to grow both in the number of affected victims as well as the cost incurred by the people and organisations impacted in a successful attack. In the majority of cases, once a victim has been attacked there remain only two courses of action open to them; either pay the ransom or lose their data. One common behaviour shared between all crypto ransomware strains is that at some point during their execution they will attempt to encrypt the users’ files. This paper demonstrates a technique that can identify when these encrypted files are being generated and is independent of the strain of the ransomware. An enhanced mixed file ransomware data set of more than 130,000 files was developed based on the govdocs1(Garfinkel, 2020) corpus. This data set was enriched to contain examples of files that reflect the more modern Microsoft file formats, as well as examples of high entropy file formats such as compressed files and archives. The data set also contained eight different sets of files that were generated as the result of different real-world high profile ransomware attacks such as WannaCry, Ryuk, Phobos, Sodinokibi and NetWalker. Previous research Penrose et al. (2013); Zhao et al. (2011) has highlighted the difficulty in differentiating between compressed and encrypted files using Shannon entropy as both file types exhibit similar values. One of the experiments described in this paper shows a unique characteristic for the Shannon entropy of encrypted file header fragments. This characteristic was used to differentiate between encrypted files and other high entropy files such as archives. This discovery was leveraged in the development of a file classification model that used the differential area between the entropy curve of a file under analysis and one generated from random data. When comparing the entropy plot values of a file under analysis against one generated by a file containing purely random numbers, the greater the correlation of the plots is, the higher the confidence that the file under analysis contains encrypted data. The experiments demonstrate a high degree of confidence in the accuracy of the model achieving a success rate of more than 99.96% when examining only the first 192 bytes of a file, using a mixed data set of more than 80,000 files. This technique successfully addresses the problem of using file entropy to differentiate compressed and archived files from files encrypted by ransomware in a timely manner.

This article extends the promising software-defined networking technology to wireless sensor networks to achieve two goals: 1) reducing the information exchange between the control and data planes, and 2) counterbalancing between the sender’s waiting-time and the duplicate packets. To this end and beyond the state-of-the-art, this work proposes an SDN-based architecture, namely MINI-SDN, that separates the control and data planes. Moreover, based on MINI-SDN, we propose MINI-FLOW, a communication protocol that orchestrates the computation of flows and data routing between the two planes. MINI-FLOW supports uplink, downlink and intra-link flows. Uplink flows are computed based on a heuristic function that combines four values, the hops to the sink, the Received Signal Strength (RSS), the direction towards the sink, and the remaining energy. As for the downlink flows, two heuristic algorithms are proposed, Optimized Reverse Downlink (ORD) and Location-based Downlink(LD). ORD employs the reverse direction of the uplink while LD instantiates the flows based on a heuristic function that combines three values, the distance to the end node, the remaining energy and RSS value. Intra-link flows employ a combination of uplink/downlink flows. The experimental results show that the proposed architectureand communication protocol perform and scale well with both network size and density, considering the joint problem of routing and load balancing.

Electronic health record (EHR) management systems require the adoption of effective technologies when health information is being exchanged. Current management approaches often face risks that may expose medical record storage solutions to common security attack vectors. However, healthcare-oriented blockchain solutions can provide a decentralized, anonymous and secure EHR handling approach. This paper presents PREHEALTH, a privacy-preserving EHR management solution that uses distributed ledger technology and an Identity Mixer (Idemix). The paper describes a proof-of-concept implementation that uses the Hyperledger Fabric&rsquo, s permissioned blockchain framework. The proposed solution is able to store patient records effectively whilst providing anonymity and unlinkability. Experimental performance evaluation results demonstrate the scheme&rsquo, s efficiency and feasibility for real-world scale deployment.

In wireless sensor networks, routing protocols with immutable network policies lacking the flexibility are generally incapable of maintaining desired performance due to the complicated and changeable environment situations and application requirements. The proposed “Flexible Routing Computing Approach (FRCA)” is a novel distributed and probabilistic computing approach capable of modifying or upgrading routing policies on the fly with low cost, which effectively enhances the flexibility of routing protocols. FRCA models the routing metric as a forwarding probability distribution for routing decisions. This model depends on three elements, the physical quantities collected at sensor nodes, the built-in base math functions, and the routing parameters. These elements are all user-oriented and can be specified to implement multifarious complicated network policies meeting different performance requirements. More significantly, through distributing routing parameters from the sink to end nodes, operators are allowed to adjust network policies on the fly without the interruption of network services. Through extensive performance evaluation studies and simulations, the results demonstrated that routing protocols designed based on FRCA could achieve better performance compared to its state-of-the-art counterparts regarding network lifetime, energy consumption, and duplicate packets as well as ensure high flexibility during network policies modification or upgrade.

A distributed and transparent ledger system is considered for various \textit{e}-commerce products including health medicines, electronics, security appliances, food products and many more to ensure technological and e-commerce sustainability. This solution, named as ‘PRODCHAIN’, is a generic blockchain framework with lattice-based cryptographic processes for reducing the complexity for tracing the e-commerce products. Moreover, we have introduced a rating based consensus process called Proof of Accomplishment (PoA). The solution has been analyzed and experimental studies are performed on Ethereum network. The results are discussed in terms of latency and throughput which prove the efficiency of PRODCHAIN in \textit{e}-commerce products and services.The presented solution is beneficial for improving the traceability of the products ensuring the social and financial sustainability. This work will help the researchers to gain knowledge about the blockchain implications for supply chain possibilities in future developments for society.

Organizations’ own personnel now have a greater ability than ever before to misuse their access to critical organizational assets. Insider threat detection is a key component in identifying rare anomalies in context, which is a growing concern for many organizations. Existing perimeter security mechanisms are proving to be ineffective against insider threats. As a prospective filter for the human analysts, a new deep learning based insider threat detection method that uses the Dempster-Shafer theory is proposed to handle both accidental as well as intentional insider threats via organization’s channels of communication in real time. The long short-term memory (LSTM) architecture together with multi-head attention mechanism is applied in this work to detect anomalous network behavior patterns. Furthermore, belief is updated with Dempster’s conditional rule and utilized to fuse evidence to achieve enhanced prediction. The CERT Insider Threat Dataset v6.2 is used to train the behavior model. Through performance evaluation, our proposed method is proven to be effective as an insider threat detection technique.

Visual selective image encryption can both improve the efficiency of the image encryption algorithm and reduce the frequency and severity of attacks against data. In this article, a new form of encryption is proposed based on keys derived from Deoxyribonucleic Acid (DNA) and plaintext image. The proposed scheme results in chaotic visual selective encryption of image data. In order to make and ensure that this new scheme is robust and secure against various kinds of attacks, the initial conditions of the chaotic maps utilized are generated from a random DNA sequence as well as plaintext image via an SHA-512 hash function. To increase the key space, three different single dimension chaotic maps are used. In the proposed scheme, these maps introduce diffusion in a plain image by selecting a block that have greater correlation and then it is bitwise XORed with the random matrix. The other two chaotic maps break the correlation among adjacent pixels via confusion (row and column shuffling). Once the ciphertext image has been divided into the respective units of Most Significant Bits (MSBs) and Least Significant Bit (LSBs), the host image is passed through lifting wavelet transformation, which replaces the low-frequency blocks of the host image (i.e., HL and HH) with the aforementioned MSBs and LSBs of ciphertext. This produces a final visual selective encrypted image and all security measures proves the robustness of the proposed scheme.

The Parallel Coordinates Plot (PCP) is a popular technique for the exploration of high-dimensional data. In many cases, researchers apply it as an effective method to analyze and mine data. However, when today’s data volume is getting larger, visual clutter and data clarity become two of the main challenges in parallel coordinates plot. Although Arc Coordinates Plot (ACP) is a popular approach to address these challenges, few optimization and improvement have been made on it. In this paper, we do three main contributions on the state-of-the-art PCP methods. One approach is the improvement of visual method itself. The other two approaches are mainly on the improvement of perceptual scalability when the scale or the dimensions of the data turn to be large in some mobile and wireless practical applications. 1) We present an improved visualization method based on ACP, termed as double arc coordinates plot (DACP). It not only reduces the visual clutter in ACP, but use a dimension-based bundling method with further optimization to deals with the issues of the conventional parallel coordinates plot (PCP). 2)To reduce the clutter caused by the order of the axes and reveal patterns that hidden in the data sets, we propose our first dimensional reordering method, a contribution-based method in DACP, which is based on the singular value decomposition (SVD) algorithm. The approach computes the importance score of attributes (dimensions) of the data using SVD and visualize the dimensions from left to right in DACP according the score in SVD. 3) Moreover, a similarity-based method, which is based on the combination of nonlinear correlation coefficient and SVD algorithm, is proposed as well in the paper. To measure the correlation between two dimensions and explains how the two dimensions interact with each other, we propose a reordering method based on non-linear correlation information measurements. We mainly use mutual information to calculate the partial similarity of dimensions in high-dimensional data visualization, and SVD is used to measure global data. Lastly, we use five case scenarios to evaluate the effectiveness of DACP, and the results show that our approaches not only do well in visualizing multivariate dataset, but also effectively alleviate the visual clutter in the conventional PCP, which bring users a better visual experience.

Drones can be used in many assistance roles in complex communication situations and play key roles as aerial wireless relays to help terrestrial network communications. Although a great deal of emphasis has been placed on the drone-assisted networks, the majority of existing works often focus on routing protocols and do not fully exploit the drones’ superiority and flexibility. To fill in this gap, this paper proposes a collaborative communication scheme for multiple drones to assist the urban vehicular ad-hoc networks (VANETs). In this scheme, drones are distributed according to the predicted terrestrial traffic condition in order to efficiently alleviate the inevitable problems of conventional VANETs, such as building obstacle, isolated vehicles, and uneven traffic loading. To effectively coordinate multiple drones simultaneously, this issue is modeled as a multimodal optimization problem to improve the global performance on a certain space. To this end, a succinct swarm-based optimization algorithm, namely Multimodal Nomad Algorithm (MNA) is presented. This algorithm is inspired by the migratory behavior of the nomadic tribes on Mongolia grassland. Based on a real-world floating car data of Chengdu city in China, extensive experiments are carried out to examine the performance of the proposed MNA-optimized drone-assisted VANET considering the processed mobility models. The results demonstrate that our scheme outperforms its counterparts in terms of the average number of hops, improved average packet delivery ratio, and throughput of the global test space.

The present world of vehicle technology is inclined to develop Electric Vehicles (EVs) with various optimized features. These vehicles need frequent charging which takes a longer time to charge up. Therefore, scheduling of vehicles in charging stations is required. Besides, the information of the EVs and its location is also stored by the charging stations and therefore creates a concern of EV privacy. Various researches are going on to solve these problems; however, an efficient privacy-preserving solution is less practiced till date. In this paper, a framework for Electric Vehicle (EV) charging is discussed. The framework uses the concept of Matching Market to identify a charging station and uses the lattice-based cryptography for secure communications. The matching market considers multiple factors to provide the best allocation of charging station and cryptography ensures security and privacy preservation. The use of lattice-based cryptographic hash SWIFFT avoids heavy computation. This usage of matching market and lattice cryptography, more specifically signcryption for EV charging framework are the highlights of the solution and add-ons to the novel features. Overall, the presented framework is efficient in terms of computation and communication cost, satisfaction ratio, slot ratio, charging latency and load balancing index. The performance metrics are compared with recent developments in this field.

A substantial administrative burden is placed on healthcare professionals as they manage and progress through their careers. Identity verification, pre-employment screening and appraisals: the bureaucracy associated with each of these processes takes precious time out of a healthcare professional's day. Time that could have been spent focused on patient care. In the midst of the COVID-19 crisis, it is more important than ever to optimize these professionals' time. This paper presents the synthesis of a design workshop held at the Royal College of Physicians of Edinburgh (RCPE) and subsequent interviews with healthcare professionals. The main research question posed is whether these processes can be re-imagined using digital technologies, specifically Self-Sovereign Identity? A key contribution in the paper is the development of a set of user-led requirements and design principles for identity systems used within healthcare. These are then contrasted with the design principles found in the literature. The results of this study confirm the need and potential of professionalising identity and credential management throughout a healthcare professional's career.

The increasing number of devices in the age of Internet-of-Thing (IoT) has arisen a number of problems related to security. Cryptographic processes, more precisely the signatures and the keys, increase and generate an overhead on the network resources with these huge connections. Therefore, in this paper we present a signcryption framework to address the above problems. The solution highlights the use of aggregate signcryption and certificaless approach based on bilinear pairings. The use of signcryption with aggregation and certificateless authentication reduces the time consumption, overhead and complexity. The solution is also able to solve the key staling problems. Experimental results and comparative analysis based on key parameters, memory utilization and bandwidth utilization have been measured. It confirms that the presented work is efficient for IoT infrastructure.

Putting trust in the world of the Internet of Things, where served and serving entities are often unknown, is very hard especially when personal and business information is often being exchanged for providing and consuming services. Moreover, the issues of interoperability and scalability of billions of heterogeneous things in the IoT systems require more attention. A user-centric model of complex interconnected things must be designed in a way that not only makes things trustworthy for common people but it also provides the solution for interoperability and scalability. ARCA-IoT is such a system which not only identifies the attributes (including quality of service) essential for trust but also presents a user-centric model that is robust enough to tackle the attacks made by dishonest entities to manipulate the trustworthiness. For scalability and interoperability, a cloud-assisted environment is introduced in the ARCA-IoT. An intuitive Naive Bayes approach is used to train the ARCA-IoT in a way that it calculates the probabilities of the trustworthiness of the entities and then identifies various types of attacks with the support of three proposed algorithms. The approach is validated with a specifically designed simulated environment. Based on our simulation results, the ARCA-IoT demonstrates the effectiveness in term of performance metrics such as accuracy, sensitivity, specificity, and precision. Besides this, the system outperforms the existing related approaches in terms of a qualitative analysis based on different parametric metrics such as interoperability, scalability, context-awareness, and a human-like decision.

The ease of deployment of digital technologies and the Internet of Things gives us the opportunity to carry out large-scale social studies and to collect vast amounts of data from our cities. In this paper, we investigate a novel way of analyzing data from social sciences studies by employing machine learning and data science techniques. This enables us to maximize the insight gained from this type of studies by fusing both objective (sensor information) and subjective data (direct input from the users). The pilot study is concerned with better understanding the interactions between citizens and urban green spaces. A field experiment was carried out in Sheffield, U.K., involving 1870 participants for two different time periods (7 and 30 days). With the help of a smartphone app, both objective and subjective data were collected. Location tracking was recorded as people entered any of the publicly accessible green spaces. This was complemented by textual and photographic information that users could insert spontaneously or when prompted (when entering a green space). By employing data science and machine learning techniques, we identify the main features observed by the citizens through both text and images. Furthermore, we analyze the time spent by people in parks as well as the top interaction areas. This paper allows us to gain an overview of certain patterns and the behavior of the citizens within their surroundings and it proves the capabilities of integrating technology into large-scale social studies.

The Rivest Cipher 4 (RC4) has been one of the most popular stream ciphers for providing symmetric key encryption, and is now proposed as an efficient cipher within light-weight cryptography. As an algorithm it has been considered to be one of the fastest stream ciphers and one of the easiest to implement. Unfortunately, despite its simplicity of usage, a number of attacks on it have been found. Therefore, various improvements of this algorithm exist in cryptography, but none of them use proper randomness. This paper outlines modified version of RC4 and which has the desirable features of an efficient stream cipher algorithm, and which integrates the Symmetric Random Function Generator (SRFG) method. Though RC4 uses pseudorandom features with an initialisation vector and a seed value, the use of true randomness in RC4 is novel in this domain. Therefore, this paper proposes a modified RC4 as MRC4, and which then evaluates the statistical features of MRC4 based upon parameters such as non-linearity, resiliency, balancedness, propagation and immunity. Further, we have compared the security features and confusion-diffusion attributes with some recent variants of RC4 and have found that MRC4 is efficient in withstanding against attacks. The experimental results show that MRC4 supports a 60% better confusion property and 50% better diffusion as compared to the original RC4 method.

Edge computing paradigm has attracted many interests in the last few years as a valid alternative to the standard cloud-based approaches to reduce the interaction timing and the huge amount of data coming from Internet of Things (IoT) devices toward the Internet. In the next future, Edge-based approaches will be essential to support time-dependent applications in the Industry 4.0 context; thus, the paper proposes BodyEdge , a novel architecture well suited for human-centric applications, in the context of the emerging healthcare industry. It consists of a tiny mobile client module and a performing edge gateway supporting multiradio and multitechnology communication to collect and locally process data coming from different scenarios; moreover, it also exploits the facilities made available from both private and public cloud platforms to guarantee a high flexibility, robustness, and adaptive service level. The advantages of the designed software platform have been evaluated in terms of reduced transmitted data and processing time through a real implementation on different hardware platforms. The conducted study also highlighted the network conditions (data load and processing delay) in which BodyEdge is a valid and inexpensive solution for healthcare application scenarios.

Nano-scaled structures, wireless sensing, wearable devices, and wireless communications systems are anticipated to support the development of new next-generation technologies in the near future. Exponential rise in future Radio-Frequency (RF) sensing systems have demonstrated its applications in areas such as wearable consumer electronics, remote healthcare monitoring, wireless implants, and smart buildings. In this paper, we propose a novel, non-wearable, device-free, privacy-preserving Wi-Fi imaging-based occupancy detection system for future smart buildings. The proposed system is developed using off-the-shelf non-wearable devices such as Wi-Fi router, network interface card, and an omnidirectional antenna for future body centric communication. The core idea is to detect presence of person along its activities of daily living without deploying a device on person&rsquo, s body. The Wi-Fi signals received using non-wearable devices are converted into time&ndash, frequency scalograms. The occupancy is detected by classifying the scalogram images using an auto-encoder neural network. In addition to occupancy detection, the deep neural network also identifies the activity performed by the occupant. Moreover, a novel encryption algorithm using Chirikov and Intertwining map-based is also proposed to encrypt the scalogram images. This feature enables secure storage of scalogram images in a database for future analysis. The classification accuracy of the proposed scheme is 91.1%.

Purpose The study uses cyberattacks announcements on 96 firms that are listed on S&P 500 over the period from January 03, 2013, to December 29, 2017. Design/methodology/approach The empirical analysis was performed in two ways: cross-section and industry level. The authors use statistical tests that account for the effects of cross-section correlation in returns, returns series correlation, volatility changes and skewness in the returns. Findings These imply that studying the cumulative effects of cyberattacks on prices of listed firms without grouping them into the various sectors may be non-informative; financial sector firms tend to react cumulatively to cyberattacks over a three-day period than other sectors; and technology firms tend to be less reactive to the announcement of a data breach. Such firms may possibly have the necessary tools and techniques to address large-scale cyberattacks. Research limitations/implications For cross-section analysis, the outcome shows that the market does not significantly react to cyberattacks for all the event windows, except [−30, 30], while for the sector-level analysis, the analysis offers two main results. Practical implications First, while there is a firm reaction to cyberattacks for long event window for retail sector, there is no evidence of a cumulative firm reaction to cyberattacks for both short and long event windows for the industrial, information technology and health sectors. Second, the firms in the financial sector, there is a strong evidence of cumulative reaction to cyberattacks for [−1, 1] for the financial industry, and the reactions disappear for relatively longer event windows. Social implications These imply that studying the cumulative effects of cyberattacks on prices of listed firms without grouping them into the various sectors may be non-informative, the financial sector firms tend to react cumulatively to cyberattacks over a three-day period than other sectors, technology firms tend to be less reactive to the announcement of a data breach, possibly such firms may have the necessary tools and techniques to address large-scale cyberattacks. Originality/value The work provides new insights into the effect of cyber security on stock prices.

Simultaneous localization and environment mapping (SLAM) is the core to robotic mapping and navigation as it constructs simultaneously the unknown environment and localizes the agent within. However, in millimeter wave (mmWave) research, SLAM is still at its infancy. This paper consists a first of its kind in mapping an indoor environment based on the RSS, Time-Difference-of-Arrival, and Angle-of-Arrival measurements. We introduce MOSAIC as a new approach for SLAM in indoor environment by exploiting the map-based channel model. More precisely, we perform localization and environment inference through obstacle detection and dimensioning. The concept of virtual anchor nodes (VANs), known in literature as the mirrors of the real anchors with respect to the obstacles in the environment, is explored. Then, based on these VANs, the obstacles positions and dimensions are estimated by detecting the zone of paths obstruction, points of reflection, and obstacle vertices. Then, extended Kalman filter is adapted to the studied environment to improve the estimation of the points of reflection hence the mapping accuracy. Cramer-Rao lower bounds are also derived to find the optimal number of anchor nodes. Simulation results have shown high localization accuracy and obstacle detection using mmWave technology.

Smart societies have an increasing demand for quality-oriented services and infrastructure in an industrial Internet of Things (IIoT) paradigm. Smart urbanization faces numerous challenges. Among them, secured energy demand-side management (DSM) is of particular concern. The IIoT renders the industrial systems to malware, cyberattacks, and other security risks. The IIoT with the amalgamation of big data analytics can provide efficient solutions to such challenges. This paper proposes a secured and trusted multi-layered DSM engine for a smart social society using IIoT-based big data analytics. The major objective is to provide a generic secured solution for smart societies in IIoT environment. The proposed engine uses a centralized approach to achieve optimum DSM over a home area network. To enhance the security of this engine, a payload-based authentication scheme is utilized that relies on a lightweight handshake mechanism. Our proposed method utilizes the lightweight features of the constrained application protocol to facilitate the clients in monitoring various resources residing over the server in an energy-efficient manner. In addition, data streams are processed using big data analytics with MapReduce parallel processing. The proposed authentication approach is evaluated using NetDuino Plus 2 boards that yield a lower connection overhead, memory consumption, response time, and a robust defense against various malicious attacks. On the other hand, our data processing approach is tested on reliable datasets using Apache Hadoop with Apache Spark to verify the proposed DMS engine. The test results reveal that the proposed architecture offers valuable insights into the smart social societies in the context of IIoT.

Wireless Body Area Network (WBAN) has been a key element in e-health to monitor bodies. This technology enables new applications under the umbrella of different domains, including the medical field, the entertainment and ambient intelligence areas. This survey paper places substantial emphasis on the concept and key features of the WBAN technology. First, the WBAN concept is introduced and a review of key applications facilitated by this networking technology is provided. The study then explores a wide variety of communication standards and methods deployed in this technology. Due to the sensitivity and criticality of the data carried and handled by WBAN, fault tolerance is a critical issue and widely discussed in this paper. Hence, this survey investigates thoroughly the reliability and fault tolerance paradigms suggested for WBANs. Open research and challenging issues pertaining to fault tolerance, coexistence and interference management and power consumption are also discussed along with some suggested trends in these aspects.

Intelligence mining is one of the most promising technologies for effectively extracting intelligence (and knowledge) to enhance the quality of decision making. In Taiwan, the government curtails underground economic activities and facilitates tax management via ubiquitous e-invoice information processing and intelligence mining for B2C transactions with management realized via privacy-preserved and robust consumer carriers. In this paper, we study the concept of carriers, a medium that facilitates the transfer of an e-invoice from a business to a consumer in a B2C transaction. Implementations of carriers not only depend on the underlying hardware, software, and network infrastructures that support their services, but also on consumers willingness to use them. In this paper, we review the Taiwan's Second Generation E-invoicing System, which is designed to promote the use of e-invoices in the consumer sector, and identify four problems that require further attention. These problems are: (1) no e-invoice data for immediate review, (2) limited readability of carriers by POS (Point of Sales), (3) lack of seamless integration into purchase behaviors, and (4) carrier traceability. We then discuss possible solutions to overcome these concerns, in hope of offering some insight into future mobile commerce based on e-invoice carriers in the cloud computing era. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.