Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) N A and N C that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in N A , and apply queuing theory analysis to derive a general formula for the capacity evaluation of N A . We also prove that N C actually leads to the same throughput capacity as N A , indicating that the throughput capacity of N C can be evaluated based on the STP of NA as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results.
This paper demonstrates that the fractal dimension of frame preamble serves as a new radiometric feature that can be used together with other known radiometric features to enhance the identification accuracy in wireless device identification. We first propose a fractal dimension estimation scheme for direct-sequence spread spectrum (DSSS) frame preamble, then provide theoretical analysis to reveal how the fractal dimension is primarily determined by the device hardware imperfections, and thus prove that the fractal dimension serves as an intrinsic radiometric feature. We further show simulation results to verify our theoretical modeling of the fractal dimension and also numerically evaluate the effects of device hardware imperfections and wireless channels on the fractal dimension. Finally, by jointly applying the fractal dimension and the five features reported in the literature, we conduct extensive experiments to demonstrate that the fractal dimension can lead to a further improvement of the state-of-the-art result in the radiometric feature-based device identification.
Traffic flows with different requirements of quality of service (QoS requirements) are aggregated into different QoS classes to provide differentiated services (Diffserv) and better quality of experience (QoE) for users. The existing aggregation approaches/QoS mapping methods are based on quantitative QoS requirements and static QoS classes. However, they are typically qualitative and time-varying at the edge of the beyond fifth generation (B5G) networks. Therefore, the artificial intelligence technology of preference logic is applied in this paper to achieve an intelligent method for edge computing, called the preference logic based aggregation model (PLM), which effectively groups flows with qualitative requirements into dynamic classes. First, PLM uses preferences to describe QoS requirements of flows, and thus can deal with both quantitative and qualitative cases. Next, the potential conflicts in these preferences are eliminated. According to the preferences, traffic flows are finally mapped into dynamic QoS classes by logic reasoning. The experimental results show that PLM presents better performance in terms of QoE satisfaction compared with the existing aggregation methods. Utilizing preference logic to group flows, PLM implements a novel way of edge intelligence to deal with dynamic classes and improves the Diffserv for massive B5G traffic with quantitative and qualitative requirements.
A Distributed Denial of Service (DDoS) attack is a prevalent issue in the blockchain network layer, causing significant revenue loss for honest mining pools. This paper introduces a novel method, the Repeated Game-based DDoS attack mitigation (RGD), to address this problem. Unlike traditional methods such as game theory and machine learning-based detection, the RGD method can effectively reflect the changes in mining revenue and strategies under different network-strength environments. In particular, we abstract the problem of DDoS mining pool revenue loss into a game revenue model and propose the subgame perfect equilibrium (SPE) approach to solve the optimal payoffs and pool strategies in various network environments. Furthermore, we address the returns of mining pools in an infinitely repeated game environment using the Two-Stage Repeated Game (TSRG) method, where the strategy varies with different network environments. The Matlab experimental simulation results indicate that as the network environment improves, the optimal mining strategies of mining pools are gradually shifting from honest strategies to launching DDoS attacks against each other. The RGD method can effectively represent the impact of changes in the network environment on the mining pool’s strategy selection and optimal revenue. Consequently, with the changing network environment, the optimal revenue of the mining pool only increases by 10% of the revenue loss during a DDoS attack.