tions. Bootstrap has found many applications in engineering field, including artificial neural networks, biomedical engineering, environmental engineering, image processing, and radar and sonar signal processing. Basic concepts of the bootstrap are summarized in each section as a step-by-step algorithm for ease of implementation. Most of the applications are taken from the signal processing literature. The principles of the bootstrap are introduced in Chapter 2. Both the nonparametric and parametric bootstrap procedures are explained. Babu and Singh (1984) have demonstrated that in general, these two procedures behave similarly for pivotal (Studentized) statistics. The fact that the bootstrap is not the solution for all of the problems has been known to statistics community for a long time; however, this fact is rarely touched on in the manuscripts meant for practitioners. It was first observed by Babu (1984) that the bootstrap does not work in the infinite variance case. Bootstrap Techniques for Signal Processing explains the limitations of bootstrap method with an example. I especially liked the presentation style. The basic results are stated without proofs; however, the application of each result is presented as a simple step-by-step process, easy for nonstatisticians to follow. The bootstrap procedures, such as moving block bootstrap for dependent data, along with applications to autoregressive models and for estimation of power spectral density, are also presented in Chapter 2. Signal detection in the presence of noise is generally formulated as a testing of hypothesis problem. Chapter 3 introduces principles of bootstrap hypothesis testing. The topics are introduced with interesting real life examples. Flow charts, typical in engineering literature, are used to aid explanations of the bootstrap hypothesis testing procedures. The bootstrap leads to second-order correction due to pivoting; this improvement in the results due to pivoting is also explained. In the second part of Chapter 3, signal processing is treated as a regression problem. The performance of the bootstrap for matched filters as well as constant false-alarm rate matched filters is also illustrated. Chapters 2 and 3 focus on estimation problems. Chapter 4 introduces bootstrap methods used in model selection. Due to the inherent structure of the subject matter, this chapter may be difficult for nonstatisticians to follow. Chapter 5 is the most impressive chapter in the book, especially from the standpoint of statisticians. It provides real data bootstrap applications to illustrate the theory covered in the earlier chapters. These include applications to optimal sensor placement for knock detection and land-mine detection. The authors also provide a MATLAB toolbox comprising frequently used routines. Overall, this is a very useful handbook for engineers, especially those working in signal processing.

Probability and Random Processes

This chapter is devoted to a more detailed examination of game theory. Game theory is an important tool for analyzing strategic behavior, is concerned with how individuals make decisions when they recognize that their actions affect, and are affected by, the actions of other individuals or groups. Strategic behavior recognizes that the decision-making process is frequently mutually interdependent. Game theory is the study of the strategic behavior involving the interaction of two or more individuals, teams, or firms, usually referred to as players. Two game theoretic scenarios were examined in this chapter: Simultaneous-move and multi-stage games. In simultaneous-move games the players effectively move at the same time. A normal-form game summarizes the players, possible strategies and payoffs from alternative strategies in a simultaneous-move game. Simultaneous-move games may be either noncooperative or cooperative. In contrast to noncooperative games, players of cooperative games engage in collusive behavior. A Nash equilibrium, which is a solution to a problem in game theory, occurs when the players’ payoffs cannot be improved by changing strategies. Simultaneous-move games may be either one-shot or repeated games. One-shot games are played only once. Repeated games are games that are played more than once. Infinitely-repeated games are played over and over again without end. Finitely-repeated games are played a limited number of times. Finitely-repeated games have certain or uncertain ends.

An Introduction to Game Theory

Providing ubiquitous connectivity to diverse device types is the key challenge for 5G and beyond 5G (B5G). Unmanned aerial vehicles (UAVs) are expected to be an important component of the upcoming wireless networks that can potentially facilitate wireless broadcast and support high rate transmissions. Compared to the communications with fixed infrastructure, UAV has salient attributes, such as flexible deployment, strong line-of-sight (LoS) connection links, and additional design degrees of freedom with the controlled mobility. In this paper, a comprehensive survey on UAV communication towards 5G/B5G wireless networks is presented. We first briefly introduce essential background and the space-air-ground integrated networks, as well as discuss related research challenges faced by the emerging integrated network architecture. We then provide an exhaustive review of various 5G techniques based on UAV platforms, which we categorize by different domains including physical layer, network layer, and joint communication, computing and caching. In addition, a great number of open research problems are outlined and identified as possible future research directions.

UAV Communications for 5G and Beyond: Recent Advances and Future Trends

Trust is an important aspect of mobile adhoc networks (MANETs). It enables entities to cope with uncertainty and uncontrollability caused by the free will of others. Trust computations and management are highly challenging issues in MANETs due to computational complexity constraints, and the independent movement of component nodes. This prevents the direct application of techniques suited for other networks. In MANETs, an untrustworthy node can wreak considerable damage and adversely affect the quality and reliability of data. Therefore, analyzing the trust level of a node has a positive influence on the confidence with which an entity conducts transactions with that node. In this work we present a detailed survey on various trust computing approaches that are geared towards MANETs. We highlight the summary and comparisons of these approaches. In addition, we analyze various works on trust dynamics including trust propagation, prediction and aggregation algorithms, the influence of network dynamics on trust dynamics and the impact of trust on security services.

Trust Computations and Trust Dynamics in Mobile Adhoc Networks: A Survey

With the move towards converged all-IP wireless network environments, managing end-user Quality of Experience (QoE) poses a challenging task, aimed at meeting high user expectations and requirements regarding reliable and cost-effective communication, access to any service, anytime and anywhere, and across multiple operator domains. In this paper, we give a survey of state-of-the-art research activities addressing the field of QoE management, focusing in particular on the domain of wireless networks and addressing three management aspects: QoE modeling, monitoring and measurement, and adaptation and optimization. Furthermore, we identify and discuss the key aspects and challenges that need to be considered when conducting research in this area.

/pdf/survey-and-challenges-of-qoe-management-issues-in-wireless-5gfqoab0k4.pdf

Survey and Challenges of QoE Management Issues in Wireless Networks

The development of the Internet of Things (IoT) technology and their integration in smart cities have changed the way we work and live, and enriched our society. However, IoT technologies present several challenges such as increases in energy consumption, and produces toxic pollution as well as E-waste in smart cities. Smart city applications must be environmentally-friendly, hence require a move towards green IoT. Green IoT leads to an eco-friendly environment, which is more sustainable for smart cities. Therefore, it is essential to address the techniques and strategies for reducing pollution hazards, traffic waste, resource usage, energy consumption, providing public safety, life quality, and sustaining the environment and cost management. This survey focuses on providing a comprehensive review of the techniques and strategies for making cities smarter, sustainable, and eco-friendly. Furthermore, the survey focuses on IoT and its capabilities to merge into aspects of potential to address the needs of smart cities. Finally, we discuss challenges and opportunities for future research in smart city applications.

/pdf/green-iot-for-eco-friendly-and-sustainable-smart-cities-2gn566r87v.pdf

Green IoT for Eco-Friendly and Sustainable Smart Cities: Future Directions and Opportunities

In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. We propose to exploit the trust between the owners of neighboring APs for reducing the authentication delay. In the proposed authentication scheme, neighboring APs that trust each other share the security key for the visiting node to avoid lengthy authentication routines each time the visiting node switches APs. The performance of the proposed trust-based authentication scheme is evaluated using a Markov model. Using numerical experiments, we first study a basic scenario where mobile nodes are not aware of the trust networks that exist in a given neighborhood. Subsequently, we consider an advanced scenario where a mobile node functionality is augmented to discover the trust network so as to minimize roaming beyond the trusted APs. We find that, even with the basic implementation, the average number of full authentications needed for a roaming mobile reduces linearly as the likelihood of two neighboring APs trusting each other increases. With the advanced implementation, our experiments show that quadratic reduction is achieved. The Markov model is validated using discrete event simulation.

Trust-Based Fast Authentication for Multiowner Wireless Networks

Expanding ring search (ERS) is a widely used technique to reduce broadcast overhead in multi-hop wireless networks (e.g., ad-hoc and sensor networks). ERS works by searching successively larger areas in the network centred around the source of broadcast. Network-wide broadcast is initiated only if L successive searches fail. This paper explores if there exists an optimal L that would minimise the broadcast cost of ERS. A theoretical model is developed to analyse the expected broadcast cost as a function of L. Using this model, we show that an optimal L exists for any random network topology. The analytical results are validated through extensive numerical experiments that consider a large number of random network topologies of varying sizes and hop lengths. By tuning the parameter L to the optimum value, broadcast cost can be reduced up to 52% depending on the topology.

Optimising expanding ring search for multi-hop wireless networks

In decentralized and unstructured networks, such as peer-to-peer and Ad-hoc wireless networks, broadcasting of queries is frequently used for obtaining required information. However, because of the inherent overhead of broadcasting in terms of bandwidth, energy, and processing power consumption, various techniques are used to minimize those overhead. Expanding Ring Search (ERS) is one such technique. Although ERS helps to reduce the overhead of broadcasting, it does not reduce the expected locating time. In this paper, we analyze the locating time and overhead that are two contradicting metrics of ERS performance.

On the optimization trade-offs of expanding ring search

Unmanned Aerial Vehicles (UAVs) are increasingly being used in a high-computation paradigm enabled with smart applications in the Beyond Fifth Generation (B5G) wireless communication networks. These networks have an avenue for generating a considerable amount of heterogeneous data by the expanding number of Internet of Things (IoT) devices in smart environments. However, storing and processing massive data with limited computational capability and energy availability at local nodes in the IoT network has been a significant difficulty, mainly when deploying Artificial Intelligence (AI) techniques to extract discriminatory information from the massive amount of data for different tasks.Therefore, Mobile Edge Computing (MEC) has evolved as a promising computing paradigm leveraged with efficient technology to improve the quality of services of edge devices and network performance better than cloud computing networks, addressing challenging problems of latency and computation-intensive offloading in a UAV-assisted framework. This paper provides a comprehensive review of intelligent UAV computing technology to enable 6G networks over smart environments. We highlight the utility of UAV computing and the critical role of Federated Learning (FL) in meeting the challenges related to energy, security, task offloading, and latency of IoT data in smart environments. We present the reader with an insight into UAV computing, advantages, applications, and challenges that can provide helpful guidance for future research.

/pdf/computing-in-the-sky-a-survey-on-intelligent-ubiquitous-2q49y31f.pdf

Jahan Hassan

Papers

Green IoT for Eco-Friendly and Sustainable Smart Cities: Future Directions and Opportunities

Trust-Based Fast Authentication for Multiowner Wireless Networks

Optimising expanding ring search for multi-hop wireless networks

On the optimization trade-offs of expanding ring search

Computing in the Sky: A Survey on Intelligent Ubiquitous Computing for UAV-Assisted 6G Networks and Industry 4.0/5.0