This paper investigates a critical access control issue in the Internet of Things (IoT). In particular, we propose a smart contract-based framework, which consists of multiple access control contracts (ACCs), one judge contract (JC) and one register contract (RC), to achieve distributed and trustworthy access control for IoT systems. Each ACC provides one access control method for a subject-object pair, and implements both static access right validation based on predefined policies and dynamic access right validation by checking the behavior of the subject. The JC implements a misbehavior-judging method to facilitate the dynamic validation of the ACCs by receiving misbehavior reports from the ACCs, judging the misbehavior and returning the corresponding penalty. The RC registers the information of the access control and misbehavior-judging methods as well as their smart contracts, and also provides functions (e.g., register, update and delete) to manage these methods. To demonstrate the application of the framework, we provide a case study in an IoT system with one desktop computer, one laptop and two Raspberry Pi single-board computers, where the ACCs, JC and RC are implemented based on the Ethereum smart contract platform to achieve the access control.

The available two-hop relay protocols with out-of-order or strictly in-order reception cannot provide a flexible control for the packet delivery delay, which may significantly limit their applications to the future mobile ad hoc networks (MANETs) with different delay requirements. This paper extends the conventional two-hop relay and proposes a general group-based two-hop relay algorithm with packet redundancy. In such an algorithm with packet redundancy limit $f$ and group size $g$ (2HR-$(f,g)$ for short), each packet is delivered to at most $f$ distinct relay nodes and can be accepted by its destination if it is a fresh packet to the destination and also it is among $g$ packets of the group the destination is currently requesting. The 2HR- $(f,g)$ covers the available two-hop relay protocols as special cases, like the in-order reception ones $(f\geq 1,g=1)$, the out-of-order reception ones with redundancy $(f>1,g=\infty)$ , or without redundancy $(f=1,g=\infty)$ . A Markov chain-based theoretical framework is further developed to analyze how the mean value and variance of packet delivery delay vary with the parameters $f$ and $g$ , where the important medium contention, interference, and traffic contention issues are carefully incorporated into the analysis. Extensive simulation and theoretical results are provided to illustrate the performance of the 2HR-$(f,g)$ algorithm and the corresponding theoretical framework, which indicate that the theoretical framework is efficient in delay analysis and the new 2HR-$(f,g)$ algorithm actually enables both the mean value and variance of packet delivery delay to be flexibly controlled in a large region.

Wireless communication is one of the key technologies that actualize the Internet of Things (IoT) concept into the real world. Understanding the security performance of wireless communications lays the foundation for the security management of IoT. Eavesdropper collusion represents a significant threat to wireless communication security, while physical-layer security serves as a promising approach to providing a strong form of security guarantee. This paper studies the important secrecy outage performance of wireless communications under eavesdropper collusion, where the physical layer security is adopted to counteract such attack. Based on the classical Probability Theory, we first conduct analysis on the secrecy outage of the simple noncolluding case in which eavesdroppers do not collude and operate independently. For the secrecy outage analysis of the more hazardous M-colluding scenario, where any M eavesdroppers can combine their observations to decode the message, the techniques of Laplace transform, keyhole contour integral, and Cauchy Integral Theorem are jointly adopted to work around the highly cumbersome multifold convolution problem involved in such analysis, such that the related signal-to-interference ratio modeling for all colluding eavesdroppers can be conducted and thus the corresponding secrecy outage probability can be analytically determined. Finally, simulation and numerical results are provided to illustrate our theoretical achievements. An interesting observation suggests that the SOP increases first superlinearly and then sublinearly with M.

In this paper, we propose a physical layer authentication scheme in heterogeneous coexist multiple-input-multiple-output (MIMO) systems. This scheme utilizes two physical layer features in terms of location-specific channel gains and transmitter-specific phase noise caused by imperfect oscillators to identify transmitters. Three properties of the proposed scheme: covertness, robustness, and security, are analyzed in detail. By using a maximum-likelihood estimator (MLE) and extended Kalman filter (EKF), we estimate channel gains and phase noise, and formulate variances of estimation errors. We also quantize the temporal variations of channel gains and phase noise through the developed quantizers. Based on quantization results and theories of hypothesis testing and stochastic process, we then derive the closed-form expressions for false alarm and detection probabilities with the consideration of quantization errors. Simulations are carried out to validate the theoretical results of the two probabilities. Based on theoretical models, we further demonstrate that the proposed scheme makes it possible for us to flexibly control authentication performance by adjusting thresholds (for channel gain, phase noise, and decision, respectively) to achieve a required authentication performance in specific MIMO applications.

Internet of Things (IoT) systems are of paramount importance to provide ubiquitous wireless connectivity for smart cities. However, such systems are facing security challenges due to the broadcast and openness nature of wireless channels. This article studies the performance of covert communication under a scenario consisted of a source-destination pair, a passive warden, and multiple relays. We first propose two relay selection schemes, one is random selection and another is superior-link selection. Based on these two schemes, we then examine the transmission strategy design for the source and thus define the necessary condition that the source can transmit covert messages. We further derive the detection error probability of warden and covert capacity based on two relay selection schemes and also explore the covert capacity maximization through efficient numerical searches. Finally, numerical results are provided to illustrate our theoretical findings and the performance of covert communication in such systems. Remarkably, the superior-link selection scheme has 108% improved to the random selection scheme for the maximum covert capacity performance under the same transmission power at the source.

This paper investigates the fundamental covert rate performance in a wireless relaying system consisting of a source-destination pair, a full-duplex (FD) relay and a warden, where the relay can work at either the FD mode or the half-duplex (HD) mode. We first provide theoretical modeling for the instantaneous/average covert rate when the system works solely under the FD mode or HD mode, and then explore the corresponding optimal transmit power control of relay for the covert rate maximization. For an improvement of covert rate, we further propose a joint FD/HD mode that flexibly switches between the FD and HD modes depending on channel state of the relay self-interference channel. Under the joint FD/HD mode, we also examine the related problems of theoretical modeling for covert rate and optimal transmit power control of relay for covert rate maximization. Finally, extensive numerical results are provided to illustrate the covert rate performances of the relaying system under the FD, HD and joint FD/HD modes.