@article{rahmati_hosseinalipour_yapici_he_guvenc_dai_bhuyan_2022, title={Dynamic Interference Management for UAV-Assisted Wireless Networks}, volume={21}, ISSN={["1558-2248"]}, url={https://doi.org/10.1109/TWC.2021.3114234}, DOI={10.1109/TWC.2021.3114234}, abstractNote={We investigate a transmission mechanism aiming to improve the data rate between a base station (BS) and a user equipment (UE) through deploying multiple relaying UAVs. We consider the effect of interference incurred by another established communication network, which makes our problem challenging and different from the state of the art. We aim to design the 3D trajectories and power allocation for the UAVs to maximize the data flow of the network while keeping the interference on the existing communication network below a threshold. We utilize the mobility feature of the UAVs to evade the (un)-intended interference caused by (un)-intentional interferers. To this end, we propose an alternating-maximization approach to jointly obtain the 3D trajectories and the UAVs transmission powers. We handle the 3D trajectory design by resorting to spectral graph theory and subsequently address the power allocation through convex optimization techniques. We also approach the problem from the intentional interferer’s perspective where smart jammers chase the UAVs to effectively degrade the data flow of the network. We also extend our work to the case for multiple UEs. Finally, we demonstrate the efficacy of our proposed method through extensive simulations.}, number={4}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Rahmati, Ali and Hosseinalipour, Seyyedali and Yapici, Yavuz and He, Xiaofan and Guvenc, Ismail and Dai, Huaiyu and Bhuyan, Arupjyoti}, year={2022}, month={Apr}, pages={2637–2653} }
 @article{he_jin_dai_2022, title={Multi-Hop Task Offloading With On-the-Fly Computation for Multi-UAV Remote Edge Computing}, volume={70}, ISSN={["1558-0857"]}, DOI={10.1109/TCOMM.2021.3129902}, abstractNote={The dramatic growth in computing capability and the inherent mobility of the unmanned aerial vehicles (UAVs) foster the recent surge of interests in incorporating UAVs into edge computing systems to facilitate on-demand deployment and extended coverage. Nonetheless, due to the limited communication capability of the UAVs, single-UAV edge computing systems may still be incompetent when serving remote users. Although the traditional multi-UAV relay network can be a viable solution, it fails to exploit the computing capability of the UAVs. With this consideration, a multi-hop task offloading with on-the-fly computation scheme is proposed in this work to enable a more powerful multi-UAV remote edge computing network. To solve the corresponding joint resource allocation and deployment problem, two efficient algorithms are proposed. One of them can find the global optimal strategy in a special case, while the other can obtain a good local optimal strategy in the general cases. Both algorithms have a complexity only linear in the number of UAVs and admit distributed implementation. In addition to analysis, numerical results are provided to corroborate the effectiveness of the proposed scheme.}, number={2}, journal={IEEE TRANSACTIONS ON COMMUNICATIONS}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2022}, month={Feb}, pages={1332–1344} }
 @article{jin_he_dai_2021, title={Minimizing the Age of Information in the Presence of Location Privacy-Aware Mobile Agents}, volume={69}, ISSN={["1558-0857"]}, DOI={10.1109/TCOMM.2020.3035394}, abstractNote={The recent advances in wireless sensor networks and sensing techniques enable various time-sensitive applications that require timely exchange of updates between a Base Station (BS) and ground terminals. In practice, the ground terminals may not be able to communicate with the BS directly due to constraints in transmit power and communication capability, and mobile agents are commonly employed to help collect and deliver the updates. In particular, the emerging mobile crowd sensing (MCS) provides an appealing cost-effective paradigm for such employment. However, in this case, the mobile agents are required to share their locations with the ground terminals and the BS, which incurs location privacy concerns and may deter them from participating in the information delivery process. With this consideration, a location privacy-aware payment mechanism, which can stimulate the mobile agents to report their locations with differential privacy levels desired by the BS, is proposed. Furthermore, considering that the BS usually has a limited budget, it is essential to properly select the set of mobile agents to perform the information collection tasks. Therefore, a cost-efficient mobile agent selection algorithm is proposed. Finally, simulation results are presented to demonstrate the effectiveness of the proposed method.}, number={2}, journal={IEEE TRANSACTIONS ON COMMUNICATIONS}, author={Jin, Richeng and He, Xiaofan and Dai, Huaiyu}, year={2021}, month={Feb}, pages={1053–1067} }
 @article{he_jin_dai_2020, title={Joint Power and Deployment Optimization for Multi-UAV Remote Edge Computing}, ISSN={["2576-6813"]}, DOI={10.1109/GLOBECOM42002.2020.9348243}, abstractNote={Driven by the dramatic growth in computing capability and the inherent mobility of the unmanned aerial vehicles (UAVs), the recently advocated UAV edge computing paradigm is expected to enhance the coverage and the on-demand deployment capability of existing terrestrial edge computing systems. Nonetheless, due to the limited onboard resource of the UAV, single- UAV edge computing systems may still be incompetent when serving remote users. Although using multiple UAVs to form a traditional relay network is a viable solution to remote edge computing, it fails to exploit the computing capability of the UAVs. This entails a pressing need to develop multi-UAV remote edge computing mechanisms that allow the UAVs to handle part of the computation tasks using their local processors while conducting multi-hop computation task offloading. To achieve the best performance in such cases, the UAVs have to properly split their power budget for communication and computation and also move to suitable service locations. Nonetheless, finding the optimal UAV power allocation and deployment turns out to be an intractable high-dimensional monotonic optimization problem, even for a mild number of UAVs. To overcome this challenge, a more efficient algorithm that has a complexity only linear in the number of UAVs is developed by exploiting the special structure of this problem. In addition to analysis, numerical results are provided to validate the effectiveness of the proposed scheme.}, journal={2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2020} }
 @article{he_jin_dai_2020, title={Peace: Privacy-Preserving and Cost-Efficient Task Offloading for Mobile-Edge Computing}, volume={19}, ISSN={["1558-2248"]}, DOI={10.1109/TWC.2019.2958091}, abstractNote={The limited information processing capability and battery life of mobile devices is becoming a bottleneck in delivering more advanced and high-quality services to the customers. To address this problem, the recently advocated mobile-edge computing (MEC) architecture is promising, where the essential idea is to bring the computation resource to the network edge and allow users to wirelessly offload resource demanding computation tasks to the nearby MEC servers for potentially faster execution and lower battery consumption. Nonetheless, the existing understanding of the privacy aspect of MEC is still far from complete. In this work, a user presence inference attack that invades user privacy by exploiting the feature tasks offloaded from users is identified for MEC. Existing privacy-preserving techniques developed for other applications cannot be applied to defeat this attack in MEC, as they may disrupt the optimal task offloading scheduling and cause severe degradation in user experience. With this consideration, a novel privacy-preserving and cost-efficient (PEACE) task offloading scheme that can preserve user privacy while still ensure the best possible user experience is developed in this work based on the generic Lyapunov optimization framework. The effectiveness of the proposed scheme is validated through both analysis and simulations.}, number={3}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2020}, month={Mar}, pages={1814–1824} }
 @article{he_jin_dai_2020, title={Physical-Layer Assisted Secure Offloading in Mobile-Edge Computing}, volume={19}, ISSN={["1558-2248"]}, DOI={10.1109/TWC.2020.2979456}, abstractNote={The wireless offloading feature of the recently advocated mobile-edge computing (MEC) imposes a risk of disclosing private user data to eavesdroppers. Physical-layer security approaches that are built on information theoretic methods can be applied to defend eavesdropping in MEC. Nonetheless, directly incorporating existing physical-layer security technique may introduce extra energy and delay costs to the resource-limited mobile device and thus substantially disrupt the users’ offloading decisions. To fulfill effective secure offloading in MEC, there is a compelling need to properly optimize existing physical-layer security techniques and develop new offloading schemes accordingly. With this consideration, a novel physical-layer assisted secure offloading scheme is proposed in this work, in which the edge server proactively broadcasts jamming signals to impede eavesdropping and leverages full-duplex communication technique to effectively suppress the self-interference. Finding the optimal jamming signal and the corresponding optimal offloading ratio turns out to be a challenging bilevel optimization problem. The special structure of the secure offloading problem is exploited to develop efficient offloading algorithms. Numerical results are presented to validate the effectiveness of the proposed scheme.}, number={6}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2020}, month={Jun}, pages={4054–4066} }
 @article{he_jin_dai_2019, title={Camouflaging Mobile Primary Users in Database-Driven Cognitive Radio Networks}, volume={8}, ISSN={["2162-2345"]}, DOI={10.1109/LWC.2018.2846621}, abstractNote={The ever-increasing wireless demand has led to the opening of the 3.5 GHz spectrum band to commercial applications and the enforcement of database-driven cognitive radio networks. Along with its advantages, this technological amendment raises new privacy concerns, especially on the primary users (PUs) that are sensitive federal and military devices. Existing studies mainly focus on static PUs while the privacy issue of mobile PUs still remains unresolved. In this letter, a novel scheme that can camouflage mobile PUs through generating low-cost fake trajectories in the database is developed, and its effectiveness is validated by numerical results.}, number={1}, journal={IEEE WIRELESS COMMUNICATIONS LETTERS}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2019}, month={Feb}, pages={21–24} }
 @article{he_jin_dai_2019, title={Deep PDS-Learning for Privacy-Aware Offloading in MEC-Enabled IoT}, volume={6}, ISSN={["2327-4662"]}, DOI={10.1109/JIOT.2018.2878718}, abstractNote={The rapid uptake of Internet-of-Things (IoT) devices imposes an unprecedented pressure for data communication and processing on the backbone network and the central cloud infrastructure. To overcome this issue, the recently advocated mobile-edge computing (MEC)-enabled IoT is promising. Meanwhile, driven by the growing social awareness of privacy, significant research efforts have been devoted to relevant issues in IoT; however, most of them mainly focus on the conventional cloud-based IoT. In this paper, a new privacy vulnerability caused by the wireless offloading feature of MEC-enabled IoT is identified. To address this vulnerability, an effective privacy-aware offloading scheme is developed based on a newly proposed deep post-decision state (PDS)-learning algorithm. By exploiting extra prior information, the proposed deep PDS-learning algorithm allows the IoT devices to learn a good privacy-aware offloading strategy much faster than the conventional deep ${Q}$ -network. Theoretic analysis and numerical results are provided to corroborate the correctness and the effectiveness of the proposed algorithm.}, number={3}, journal={IEEE INTERNET OF THINGS JOURNAL}, author={He, Xiaofan and Jin, Richeng and Dai, Huaiyu}, year={2019}, month={Jun}, pages={4547–4555} }
 @article{jin_he_dai_2019, title={On the Security-Privacy Tradeoff in Collaborative Security: A Quantitative Information Flow Game Perspective}, volume={14}, ISSN={["1556-6021"]}, DOI={10.1109/TIFS.2019.2914358}, abstractNote={To contest the rapidly developing cyber-attacks, numerous collaborative security schemes, in which multiple security entities can exchange their observations and other relevant data to achieve more effective security decisions, are proposed and developed in the literature. However, the security-related information shared among the security entities may contain some sensitive information and such information exchange can raise privacy concerns, especially when these entities belong to different organizations. With such consideration, the interplay between the attacker and the collaborative entities is formulated as Quantitative Information Flow (QIF) games, in which the QIF theory is adapted to measure the collaboration gain and the privacy loss of the entities in the information sharing process. In particular, three games are considered, each corresponding to one possible scenario of interest in practice. Based on the game-theoretic analysis, the expected behaviors of both the attacker and the security entities are obtained. In addition, the simulation results are presented to validate the analysis.}, number={12}, journal={IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY}, author={Jin, Richeng and He, Xiaofan and Dai, Huaiyu}, year={2019}, month={Dec}, pages={3273–3286} }
 @book{advances in mechanics of microstructured media and structures_2018, volume={87}, ISBN={["978-3-319-73693-8"]}, ISSN={["1869-8433"]}, DOI={10.1007/978-3-319-73694-5}, abstractNote={The book offers contributions on micropolar, micromorphic and strain gradient media, media with internal variables, metamaterials, and beam lattices.}, journal={ADVANCES IN MECHANICS OF MICROSTRUCTURED MEDIA AND STRUCTURES}, year={2018}, pages={1–369} }
 @book{he_dai_he_dai_2018, title={Adversary Detection For Cognitive Radio Networks}, ISBN={9783319758671 9783319758688}, ISSN={2191-8112 2191-8120}, url={http://dx.doi.org/10.1007/978-3-319-75868-8}, DOI={10.1007/978-3-319-75868-8}, abstractNote={This brief provides a comprehensive study of the security threats to cognitive radio networks and the corresponding adversary detection problems.}, journal={SpringerBriefs in Electrical and Computer Engineering}, publisher={Springer International Publishing}, author={He, X. and Dai, H. and He, X and Dai, H}, year={2018} }
 @article{he_dai_he_dai_2018, title={Adversary Detection For Cognitive Radio Networks Conclusion and FutureWork}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_7}, abstractNote={After reviewing relevant background and preliminaries in Chaps. 1 and 2 , our discussion sets off from an overview of the state-of-the-art of adversary detection techniques against the PUE attack and the Byzantine attack in Chap. 3 . In the subsequent chapters, more detailed case studies of several adversary detection schemes are conducted. Specifically, a link signature assisted PUE attack detection scheme is discussed in Chap. 4 . In Chap. 5 , an HMM-based Byzantine detection scheme is introduced. In this approach, the adversary is detected by inspecting the parameter difference in the corresponding HMM models for the honest SUs and the adversary. In Chap. 6 , a CFC based Byzantine attack detection algorithm was presented. In this approach, two CFC statistics are extracted from the SUs spectrum sensing behaviors and then compared with those of a trusted SU for adversary detection. Lastly, concluding remarks and outlooks for future works are provided in this chapter.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={73–74} }
 @article{he_dai_he_dai_2018, title={Adversary Detection For Cognitive Radio Networks Introduction}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_1}, abstractNote={The ubiquitous and ever-expanding wireless applications in our modern life quickly eat up the limited spectrum resource and thus impose a strong driving force to the research and development of high spectrum-efficiency wireless technologies. Cognitive radio (CR) is one of such desired technologies. However, due to its fundamental characteristics of open medium, CR networks suffer from many security threats. Without properly address these security issues, the deployment of CR technology in practice may be severely hampered. In this chapter, a brief review of the CR technology is presented, along with an overview of the potential security vulnerabilities in CR networks. The two unique security issues in CR networks, namely, the PUE attack and the Byzantine attack, are discussed in more details.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={1–6} }
 @article{he_dai_he_dai_2018, title={Case Study I: Link Signature Assisted PUE Attack Detection}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_4}, abstractNote={This chapter aims to present a detailed case study of a link signature assisted PUE attack detection scheme. As discussed in the previous chapter, one of the main hurdles making the design of a PUE attack detection scheme nontrivial is the FCC’s requirement that no change should be made to the PU. Due to this requirement, most of the existing detection methods are designed solely for the SU side. Nonetheless, if one can deploy a nearby helper node that holds similar behavioral and physical properties as the PU and allow it to cooperate with the SU, the PUE detection performance may be further improved without disobeying the FCC’s requirement. To convey this idea, in this chapter, some background on link signature will be introduced first, followed by an illustration of how the helper node can exploit its physical closeness to the PU to accurately authenticate the PU signal. Then, the overall link signature based PUE attack detection algorithm is illustrated.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={45–50} }
 @article{he_dai_he_dai_2018, title={Case Study II: HMM-Based Byzantine Attack Detection}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_5}, abstractNote={Most of the existing defense schemes against the Byzantine attack discussed in Chap. 3 either assume that the underlying spectrum states at different timeslots are independent or they only focus on the measurements collected in a single timeslot. Nonetheless, for many practical scenarios, the activities of the PUs and the induced spectrum states often follow a Markov process, and hence the spectrum sensing behaviors of the SUs may be better characterized by the HMM. Under this modeling, a novel HMM-based Byzantine attack detection technique can be developed to enforce the robustness of collaborative spectrum sensing. To illustrate this, the HMM-based spectrum sensing behavioral model is presented first, and based on which, the sought-after multi-HMM inference algorithm is introduced. Then, the overall HMM-based Byzantine attack detection scheme is demonstrated along with some numerical results to corroborate its effectiveness.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={51–62} }
 @article{he_dai_he_dai_2018, title={Case Study III: CFC-Based Byzantine Attack Detection}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_6}, abstractNote={The multi-HMM inference algorithm presented in the previous chapter can effectively assist the Byzantine attack detection when either the percentage of the malicious SUs or their flipping probability is not too high. To further enhance the detection performance, a tailor-designed Byzantine attack detection scheme, termed CFC, will be presented in this chapter. In this method, two natural yet effective CFC statistics that can capture the second-order properties of the underlying spectrum dynamics and the SUs spectrum sensing behaviors are constructed for Byzantine attacker identification. More specifically, we will first briefly clarify the underlying system model and then presents the CFC based Byzantine attack detection algorithm. In addition, performance analysis of this method will also be presented.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={63–72} }
 @article{jin_he_dai_2018, title={Collaborative IDS Configuration: A Two-Layer Game-Theoretic Approach}, volume={4}, ISSN={["2332-7731"]}, DOI={10.1109/TCCN.2018.2856207}, abstractNote={To cope with the increasingly sophisticated intrusions, collaborative intrusion detection systems (CIDSs) are proposed in the literature. In particular, intrusion detection systems (IDSs) in collaboration can dynamically share available computational resources among themselves to enhance the overall detection performance. However, due to resource limitation, it is infeasible for the IDSs to respond to all the intrusion detection requests from their collaborative peers. In the meantime, obtaining the optimal IDS configuration in CIDSs is far from trivial. With such consideration, the collaborative IDS configuration problem is formulated as a two-layer stochastic game (SG). To solve this two-layer SG, a centralized Vickrey–Clarke–Groves auction based collaboration scheme and a distributed game-theoretic incentive mechanism are proposed in this paper. The effectiveness of the proposed schemes is validated through both analysis and numerical experiments. The proposed approach can be applied to more general collaborative settings.}, number={4}, journal={IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING}, author={Jin, Richeng and He, Xiaofan and Dai, Huaiyu}, year={2018}, month={Dec}, pages={803–815} }
 @book{he_dai_2018, title={Dynamic Games for Network Security}, ISBN={9783319758701 9783319758718}, ISSN={2191-8112 2191-8120}, url={http://dx.doi.org/10.1007/978-3-319-75871-8}, DOI={10.1007/978-3-319-75871-8}, abstractNote={This brief collects and systematically presents advanced stochastic game theory research and the underlying game-theoretic and learning tools}, journal={SpringerBriefs in Electrical and Computer Engineering}, publisher={Springer International Publishing}, author={He, Xiaofan and Dai, Huaiyu}, year={2018}, pages={1–74} }
 @article{he_dai_he_dai_2018, title={Dynamic Games for Network Security Conclusion and Future Work}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_6}, abstractNote={In this book, we have studied the applications of SG theory in addressing various dynamic network security games, with a particular focus on the techniques of handling scenarios with information asymmetry. In Chap. 1, preliminaries of game theory, MDP, and SG have been reviewed. With these necessary backgrounds, a brief review of existing security applications of the SG framework is provided in Chap. 2. We have further examined several novel techniques for SG with information asymmetry and their security applications. Particularly, the discussions in Chap. 3 focus on dynamic security games with extra information, and the complementary situations where the defender only has incomplete information are examined in Chap. 4 through the lens of Bayesian SG. In Chap. 5, we have studied how the defender can proactively create information asymmetry to enhance security performance. Lastly, in this chapter, summary and perspective for future works will be provided.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={73–74} }
 @article{he_dai_he_dai_2018, title={Dynamic Security Games with Deception}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_5}, abstractNote={In the previous two chapters, we have investigated dynamics security games with asymmetric information, in which the extra or the missing information is inherent to the underlying security problems. In this chapter, we switch the gear and further consider the possibility of proactively creating information asymmetry in security games for the defender’s benefit. Particularly, deception will be investigated as a concrete tool to achieve this objective. However, most existing deception techniques are designed for static scenarios. The objective of this chapter is to illustrate a foresighted deception framework that allows the defender to better align its deception strategy with its conventional defense strategy and the dynamics in the environment. In addition, a network protection game is taken as a concrete example to illustrate the advantage of the foresighted deception achieved by the SDG framework over the conventional myopic deception.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={61–71} }
 @article{he_dai_he_dai_2018, title={Dynamic Security Games with Extra Information}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_3}, abstractNote={In the previous chapter, we have reviewed existing applications of SG in addressing different dynamic security problems. Nonetheless, most existing works assume equal knowledgeable defender and attacker, whereas, in practice, the defender and the attacker are likely to hold different information about the ongoing security rivalries. Conventional SG based methods developed in existing literature do not fit well to such dynamic security games with information asymmetry. To achieve the best possible defense in such scenarios, new techniques that can adequately manage the information asymmetry are needed. In this chapter, we will focus on scenarios where the defender has extra information and present two novel algorithms, termed minimax-PDS and WoLF-PDS, to solve the corresponding dynamic security games with extra information. After establishing the theoretical basis, we will provide two exemplary applications to illustrate how these two new algorithms can be leveraged to handle dynamic security games with extra information. The first application is concerned with anti-jamming and the second application is concerned with a cloud-based security game.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={25–42} }
 @article{he_dai_he_dai_2018, title={Dynamic Security Games with Incomplete Information}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_4}, abstractNote={In this chapter, we continue our exploration of dynamic security games with information asymmetry. As compared to the previous chapter, the discussions in this chapter focus on the complementary scenarios where the defender lacks information about the ongoing security competitions. Such scenarios exist in many practical security problems. The framework of Bayesian SG will be employed in this chapter to model and analyze such incomplete information dynamic security problems. Accordingly, a new algorithm, termed Bayesian Nash-Q, that allows the defender to infer the missing information based on repeated interactions with the attacker and the dynamic environment will be presented. This algorithm is a natural combination of the conventional repeated Bayesian games and the Nash-Q algorithm. For this reason, our discussion starts from reviewing some elementary concepts of Bayesian games, and then the Bayesian SG model and the Bayesian Nash-Q algorithm will be discussed in details.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={43–60} }
 @article{he_dai_he_dai_2018, title={Overview of Adversary Detection in CR Networks}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_3}, abstractNote={As discussed in Chap. 1, the PUE attack and the Byzantine attack are two severe security threats unique to the CR networks, and if not properly addressed, the functionality of the entire CR network will be demolished. With this consideration, advocators of the CR technology have devoted substantial research efforts to address these two security problems in the past decade. Most of them focus on how to detect and identify the adversaries; after all, detection and identification is usually the very first step to remove a security threat. The objective of this chapter is to provide an overview of the recent advancements in detecting these two disrupting attacks. Particularly, in the first part of this chapter, we intend to provide a systematic review of the existing PUE attack detection methods, and in the second part of this chapter, we will switch gear towards the Byzantine attack detection schemes.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={19–44} }
 @article{he_dai_he_dai_2018, title={Overview of Dynamic Network Security Games}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_2}, abstractNote={Due to environmental variations and system fluctuations, the defender often faces a dynamic security competition against the attacker in practice, and two common challenges exist in addressing these dynamic security games: (1) how to deal with the intelligent attacker that may change its strategy based on the deployed defense, and (2) how to properly align the defense strategy with the environmental or system dynamics to achieve the most efficient and effective defense. In literature, the SG framework reviewed in the previous chapter has been considered as a promising mathematical tool to jointly overcome these two challenges and guide the defender towards the best possible defense. In this chapter, a brief survey of the recent efforts in this direction is provided. Specifically, the applications of the SG in addressing security issues in cyber networks, wireless communication networks, and cyber-physical networks are presented, respectively.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={17–23} }
 @article{he_dai_he_dai_2018, title={Preliminaries}, ISBN={["978-3-319-75870-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75871-8_1}, abstractNote={To start our journey in this book, relevant backgrounds on game theory, Markov decision process (MDP), and stochastic game (SG) will be introduced first in this chapter to pave the way for our later exposition. In essence, many security issues can be treated as a game between the defender and the attacker who are intelligent entities that can smartly plan their actions in the security rivalries. For this reason, our discussion in this chapter begins with the presentation of some rudimentary concepts of the classic game theory—a fascinating theory that concerns the modeling and prediction of the behaviors of intelligent entities in strategical interactions. In addition to the interactions with the opponent, practical security problems often involve with different environmental, system, or network dynamics. As a fundamental tool for optimal planning in dynamic environments, the MDP is also reviewed in this chapter. Moreover, as a key framework for addressing various dynamic security games, the SG will be reviewed in this chapter as well.}, journal={DYNAMIC GAMES FOR NETWORK SECURITY}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={1–16} }
 @article{he_dai_he_dai_2018, title={Preliminaries of Analytical Tools}, ISBN={["978-3-319-75867-1"]}, ISSN={["2191-8120"]}, DOI={10.1007/978-3-319-75868-8_2}, abstractNote={This chapter mainly focuses on reviewing some of the important analytic tools used in existing literature for adversary detection in CR networks. Particularly, in the first part of the chapter, two widely employed statistical inference tools, sequential hypothesis testing, and belief propagation are reviewed. In the second part of this chapter, some important machine learning methods are reviewed, including non-parametric Bayesian classification, artificial neural network, and affinity propagation. Throughout the discussions of this chapter, we will focus on introducing the relevant concepts and models, algorithmic procedure as well as important properties of these analytic tools, whereas their applications in adversary detection will be postponed to the next chapter.}, journal={ADVERSARY DETECTION FOR COGNITIVE RADIO NETWORKS}, author={He, Xiaofan and Dai, Huaiyu and He, X and Dai, H}, year={2018}, pages={7–17} }
 @article{he_dai_ning_dutta_2017, title={A Leader-Follower Controlled Markov Stopping Game for Delay Tolerant and Opportunistic Resource Sharing Networks}, volume={35}, ISSN={["1558-0008"]}, DOI={10.1109/jsac.2017.2659581}, abstractNote={In various resource sharing networks, opportunistic resources with dynamic quality are often present for the users to exploit. As many user tasks are delay-tolerant, this favorably allows the network users to wait for and access the opportunistic resource at the time of its best quality. For such delay-tolerant and opportunistic resource sharing networks, the resource accessing strategies developed in the literature suffer from three limitations. First, they mainly focused on single-user scenarios, whereas the competition from other users is ignored. Second, the influence from the resource seller who may take actions to manipulate the resource sharing procedure is not considered. Third, the impact of the actions from both the network users and the resource seller on the resource quality dynamics is not considered either. To overcome these limitations, a leader–follower controlled Markov stopping game (LF-C-MSG) is developed in this paper. The derived Stackelberg equilibrium strategy of the LF-C-MSG can be used to guide the behaviors of both the network users and the resource seller for better performance and resource utilization efficiency. Two exemplary applications of the proposed LF-C-MSG are presented, along with corresponding numerical results to verify the effectiveness of the proposed framework.}, number={3}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng and Dutta, Rudra}, year={2017}, month={Mar}, pages={615–627} }
 @inproceedings{he_dai_ning_dutta_2016, title={A A multi-player Markov stopping game for delay-tolerant and opportunistic resource sharing networks}, DOI={10.1109/infocom.2016.7524350}, abstractNote={Opportunistic resources are often present in various resource sharing networks for the users to exploit, but their qualities often change over time. Fortunately, many user tasks are delay-tolerant, which offers the network users a favorable degree of freedom in waiting for and accessing the opportunistic resource at the time of its best quality. For such delay-tolerant and opportunistic resource sharing networks (DT-ORS-Net), the corresponding optimal accessing strategies developed in existing literature mainly focus on the single-user scenarios, while the potential competition from other peer users in practical multi-user DT-ORS-Net is often ignored. Considering this, a multi-player Markov stopping game (M-MSG) is developed in this work, and the derived Nash equilibrium (NE) strategy of this M-MSG can guide network users to properly handle the potential competition from other peers and thus exploit the time diversity of the opportunistic resource more effectively, which in turn further improves the resource utilization efficiency. Applications in the cloud-computing and the mobile crowdsourcing networks are demonstrated to verify the effectiveness of the proposed method, and simulation results show that using the NE strategy of the proposed M-MSG can provide substantial performance gain as compared to using the conventional single-user optimal one.}, booktitle={IEEE INFOCOM 2016 - the 35th annual IEEE international Conference on Computer Communications}, author={He, X. F. and Dai, Huaiyu and Ning, P. and Dutta, Rudra}, year={2016} }
 @inproceedings{jin_he_dai_2016, title={Collaborative IDS configuration: A two-layer game-theoretical approach}, DOI={10.1109/glocom.2016.7841671}, abstractNote={As information systems become ubiquitous, Intrusion Detection Systems (IDSs) have assumed increasing importance. As a result, substantial amount of research efforts have been devoted to developing various intrusion detection algorithms. However, there is still no single detection algorithm that can catch all possible attacks. On the other hand, it is infeasible for practical IDSs to run all the detection algorithms simultaneously due to resource limitation, leaving potential opportunities for the adversaries to explore. This resource scarcity problem becomes more severe when the system is in an ill state (e.g., partially compromised). Enabling collaboration among multiple IDSs may be a viable way to mitigate this problem. Particularly, IDSs in the healthy state can share some of their idle computational resources to those in ill states, so as to improve the overall intrusion detection performance. Considering this, the collaborative IDS configuration problem is formulated as a two-layer stochastic game (SG) in this work and a new algorithm is proposed to solve this two-layer SG. Simulation results show that the proposed algorithm can provide an effective collaborative configuration scheme, leading to significant detection performance gain. Some performance analysis has also been given, and the conditions under which there is a guaranteed improvement in expected system performance have been derived.}, booktitle={2016 ieee global communications conference (globecom)}, author={Jin, R. C. and He, X. F. and Dai, H. Y.}, year={2016} }
 @article{he_dai_ning_2016, title={Faster Learning and Adaptation in Security Games by Exploiting Information Asymmetry}, volume={64}, ISSN={["1941-0476"]}, DOI={10.1109/tsp.2016.2548987}, abstractNote={With the advancement of modern technologies, the security battle between a legitimate system (LS) and an adversary is becoming increasingly sophisticated, involving complex interactions in unknown dynamic environments. Stochastic game (SG), together with multi-agent reinforcement learning (MARL), offers a systematic framework for the study of information warfare in current and emerging cyber-physical systems. In practical security games, each player usually has only incomplete information about the opponent, which induces information asymmetry. This paper exploits information asymmetry from a new angle, considering how to exploit information unknown to the opponent to the player's advantage. Two new MARL algorithms, termed minimax post-decision state (minimax-PDS) and Win-or-Learn Fast post-decision state (WoLF-PDS), are proposed, which enable the LS to learn and adapt faster in dynamic environments by exploiting its information advantage. The proposed algorithms are provably convergent and rational, respectively. Also, numerical results are presented to show their effectiveness through three important applications.}, number={13}, journal={IEEE TRANSACTIONS ON SIGNAL PROCESSING}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng}, year={2016}, month={Jul}, pages={3429–3443} }
 @article{he_dai_shen_ning_dutta_2016, title={Toward Proper Guard Zones for Link Signature}, volume={15}, ISSN={["1558-2248"]}, DOI={10.1109/twc.2015.2498621}, abstractNote={Motivated by information-theoretic security, link signature (LS)-based security mechanisms exploit the ample channel characteristics between wireless devices for security establishment. Nevertheless, LS is originated from wireless environments and hence may exhibit potential vulnerabilities that can be exploited by adversary in the vicinity. As to this, it is widely believed in existing literature on LS that, a half-wavelength guard zone is sufficient to decorrelate the adversary channel from the legitimate one and thereby secures the legitimate LS. However, such an assumption may not hold universally - in some environments, high channel correlations have been observed for much larger spatial separations. Considering this, a comprehensive understanding of channel correlation in different wireless environments is needed for more confident deployment of LS-based security mechanisms. To this end, various well-established channel correlation models are investigated in this work. A set of important physical factors that have significant influence on LS security are identified, and with the obtained insights, extensive simulations are conducted to explore suitable guard zone sizes for LS in several typical indoor and outdoor environments. Experimental results based on universal software radio peripheral (USRP) platforms and GNURadio are also presented to further support the analysis.}, number={3}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Shen, Wenbo and Ning, Peng and Dutta, Rudra}, year={2016}, month={Mar}, pages={2104–2117} }
 @inproceedings{he_dai_ning_dutta_2015, title={A A stochastic multi-channel spectrum access game with incomplete information}, DOI={10.1109/icc.2015.7249082}, abstractNote={To ensure continuous functioning and satisfactory performance, a wireless communication system has to not only learn and adapt to the unknown and ever-changing wireless environment, but also strategically deal with the usually unfamiliar peers. Incomplete information stochastic game (SG) is a promising model for the corresponding analysis and strategy design. In this work, an exemplary multi-channel spectrum access game (SAG) with unknown environment dynamics and limited information of the other player is considered to illustrate the proposed solution for the corresponding incomplete information SG. To find the best communication strategy in the face of uncertainty, a joint reinforcement learning and type identification algorithm is developed, which is provably convergent under certain technical conditions. Numerical results show that using the proposed algorithm, a wireless user can gradually achieve the same performance as that in the corresponding complete information game.}, booktitle={2015 ieee international conference on communications (icc)}, author={He, X. F. and Dai, Huaiyu and Ning, P. and Dutta, Rudra}, year={2015}, pages={4799–4804} }
 @article{he_dai_ning_dutta_2015, title={Dynamic IDS Configuration in the Presence of Intruder Type Uncertainty}, ISSN={["2334-0983"]}, DOI={10.1109/glocom.2015.7417158}, abstractNote={Intrusion detection systems (IDSs) assume increasingly importance in past decades as information systems become ubiquitous. Despite the abundance of intrusion detection algorithms developed so far, there is still no single detection algorithm or procedure that can catch all possible intrusions; also, simultaneously running all these algorithms may not be feasible for practical IDSs due to resource limitation. For these reasons, effective IDS configuration becomes crucial for real-time intrusion detection. However, the uncertainty in the intruder's type and the (often unknown) dynamics involved with the target system pose challenges to IDS configuration. Considering these challenges, the IDS configuration problem is formulated as an incomplete information stochastic game in this work, and a new algorithm, Bayesian Nash-Q learning, that combines conventional reinforcement learning with a Bayesian type identification procedure is proposed. Numerical results show that the proposed algorithm can identify the intruder's type with high fidelity and provide effective configuration.}, journal={2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng and Dutta, Rudra}, year={2015} }
 @inproceedings{he_dai_ning_2015, title={Improving learning and adaptation in security games by exploiting information asymmetry}, DOI={10.1109/infocom.2015.7218560}, abstractNote={With the advancement of modern technologies, the security battle between a legitimate system (LS) and an adversary is becoming increasingly sophisticated, involving complex interactions in unknown dynamic environments. Stochastic game (SG), together with multi-agent reinforcement learning (MARL), offers a systematic framework for the study of information warfare in current and emerging cyber-physical systems. In practical security games, each player usually has only incomplete information about the opponent, which induces information asymmetry. This work exploits information asymmetry from a new angle, considering how to exploit local information unknown to the opponent to the player's advantage. Two new MARL algorithms, termed minimax-PDS and WoLF-PDS, are proposed, which enable the LS to learn and adapt faster in dynamic environments by exploiting its private local information. The proposed algorithms are provably convergent and rational, respectively. Also, numerical results are presented to show their effectiveness through two concrete anti-jamming examples.}, booktitle={2015 ieee conference on computer communications (infocom)}, author={He, X. F. and Dai, H. Y. and Ning, P.}, year={2015} }
 @inproceedings{shen_liu_he_dai_ning_2015, title={No time to demodulate - fast physical layer verification of friendly jamming}, DOI={10.1109/milcom.2015.7357518}, abstractNote={Jamming attacks are well-known threats to wireless communications, but on the other hand they provide insights for researchers to design novel approaches to protect wireless communications. In recent years, friendly jamming is used by a number of research works to achieve the wireless medium access control. However, in these works, the friendly jammer relies on bit-level information to distinguish the allies' wireless transmissions from the enemies', which requires the received signals to be processed through demodulation steps and thus introduces a non-trivial reaction time delay for the friendly jammer. This reaction delay is undesirable as the transmissions need to be jammed while they are still on the air. To address this problem, we propose fast friendly jamming, which eliminates the need for demodulation and enables the friendly jammer to verify the received signals directly on the physical layer. We have implemented a prototype of the proposed techniques based on GNURadio and USRP, and performed real-world experiments to validate the proposed techniques. The experiment results show that the proposed techniques reduce the normal reaction delay of the friendly jammer by 81.9%-85.7%, and achieve the accurate distinction between allies' and enemies' transmissions.}, booktitle={2015 ieee military communications conference (milcom 2015)}, author={Shen, W. B. and Liu, Y. and He, X. F. and Dai, H. Y. and Ning, P.}, year={2015}, pages={653–658} }
 @article{he_dai_ning_2014, title={Dynamic Adaptive Anti-Jamming via Controlled Mobility}, volume={13}, ISSN={["1558-2248"]}, DOI={10.1109/twc.2014.2320973}, abstractNote={In this paper, the mobility of network nodes is explored as a new promising approach for jamming defense. To fulfill it, properly designed node motion that can intelligently adapt to the jammer's action is crucial. In our study, anti-jamming mobility control is investigated in the context of the single and multiple commodity flow problems, in the presence of intelligent mobile jammers which can respond to the evasion of legitimate nodes as well. Based on spectral graph theory, two new spectral quantities, single- and multi-weighted Cheeger constants and corresponding eigenvalue variants, are constructed to direct motions of the defender and the attacker in this dynamic adaptive competition. Both analytical and simulation results are presented to justify the effectiveness of the proposed approach. Furthermore, the proposed scheme can also be applied in cognitive radio networks to reconfigure the secondary users in the presence of mobile primary users.}, number={8}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng}, year={2014}, month={Aug}, pages={4374–4388} }
 @article{he_dai_ning_2013, title={A Byzantine Attack Defender in Cognitive Radio Networks: The Conditional Frequency Check}, volume={12}, ISSN={["1558-2248"]}, DOI={10.1109/twc.2013.031313.121551}, abstractNote={Security concerns are raised for collaborative spectrum sensing due to its vulnerabilities to the potential attacks from malicious secondary users. Most existing malicious user detection methods are reputation-based, which become incapable when the malicious users dominate the network. On the other hand, although Markovian models characterize the spectrum state behavior more precisely, there is a scarcity of malicious user detection methods which fully explore this feature. In this paper, a new malicious user detection method using two proposed conditional frequency check (CFC) statistics is developed under the Markovian model for the spectrum state. With the assistance of one trusted user, the proposed method can achieve high malicious user detection accuracy (≥ 95%) for arbitrary percentage of malicious users that may even be equipped with more advanced sensing devices, and can thus improve the collaborative spectrum sensing performance significantly. Simulation results are provided to verify the theoretical analysis and effectiveness of the proposed method.}, number={5}, journal={IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS}, author={He, Xiaofan and Dai, Huaiyu and Ning, Peng}, year={2013}, month={May}, pages={2512–2523} }
 @article{shen_ning_he_dai_2013, title={Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own Wireless Connectivity at the Same Time}, ISBN={["978-1-4673-6166-8"]}, ISSN={["1081-6011"]}, DOI={10.1109/sp.2013.22}, abstractNote={This paper presents a novel mechanism, called Ally Friendly Jamming, which aims at providing an intelligent jamming capability that can disable unauthorized (enemy) wireless communication but at the same time still allow authorized wireless devices to communicate, even if all these devices operate at the same frequency. The basic idea is to jam the wireless channel continuously but properly control the jamming signals with secret keys, so that the jamming signals are unpredictable interference to unauthorized devices, but are recoverable by authorized ones equipped with the secret keys. To achieve the ally friendly jamming capability, we develop new techniques to generate ally jamming signals, to identify and synchronize with multiple ally jammers. This paper also reports the analysis, implementation, and experimental evaluation of ally friendly jamming on a software defined radio platform. Both the analytical and experimental results indicate that the proposed techniques can effectively disable enemy wireless communication and at the same time maintain wireless communication between authorized devices.}, journal={2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP)}, author={Shen, Wenbo and Ning, Peng and He, Xiaofan and Dai, Huaiyu}, year={2013}, pages={174–188} }
 @inproceedings{he_dai_ning_2013, title={Dynamic adaptive anti-jamming via controlled mobility}, DOI={10.1109/cns.2013.6682686}, abstractNote={In this paper, the mobility of network nodes is explored as a new promising approach for jamming defense. To fulfill it, properly designed node motion that can intelligently adapt to the jammer's action is crucial. In our study, anti-jamming mobility control is investigated in the context of the single and multiple commodity flow problems, in the presence of intelligent mobile jammers which can respond to the evasion of legitimate nodes as well. Based on spectral graph theory, two new spectral quantities, single- and multi-weighted Cheeger constants and corresponding eigenvalue variants, are constructed to direct motions of the defender and the attacker in this dynamic adaptive competition. Both analytical and simulation results are presented to justify the effectiveness of the proposed approach. Furthermore, the proposed scheme can also be applied in cognitive radio networks to reconfigure the secondary users in the presence of mobile primary users.}, booktitle={2013 IEEE Conference on Communications and Network Security (CNS)}, author={He, X. F. and Dai, H. Y. and Ning, P.}, year={2013}, pages={1–9} }
 @inproceedings{he_dai_shen_ning_2013, title={Is link signature dependable for wireless security?}, DOI={10.1109/infcom.2013.6566763}, abstractNote={A fundamental assumption of link signature based security mechanisms is that the wireless signals received at two locations separated by more than half a wavelength are essentially uncorrelated. However, it has been observed that in certain circumstances (e.g., with poor scattering and/or a strong line-of-sight (LOS) component), this assumption is invalid. In this paper, a Correlation ATtack (CAT) is proposed to demonstrate the potential vulnerability of the link signature based security mechanisms in such circumstances. Based on statistical inference, CAT explicitly exploits the spatial correlations to reconstruct the legitimate link signature from the observations of multiple adversary receivers deployed in vicinity. Our findings are verified through theoretical analysis, well-known channel correlation models, and experiments on USRP platforms and GNURadio.}, booktitle={2013 proceedings ieee infocom}, author={He, X. F. and Dai, H. Y. and Shen, W. B. and Ning, P.}, year={2013}, pages={200–204} }
 @inproceedings{he_dai_ning_2012, title={A Byzantine attack defender: The Conditional Frequency Check}, DOI={10.1109/isit.2012.6284709}, abstractNote={Collaborative spectrum sensing is vulnerable to the Byzantine attack. Existing reputation based countermeasures will become incapable when malicious users dominate the network. Also, there is a scarcity of methods that fully explore the Markov property of the spectrum states to restrain sensors' statistical misbehaviors. In this paper, a new malicious user detection method based on two proposed Conditional Frequency Check (CFC) statistics is developed with a Markovian spectrum model. With the assistance of one trusted sensor, the proposed method can achieve high malicious user detection accuracy in the presence of arbitrary percentage of malicious users, and thus significantly improves collaborative spectrum sensing performance.}, booktitle={2012 ieee international symposium on information theory proceedings (isit)}, author={He, X. F. and Dai, H. Y. and Ning, P.}, year={2012} }