arXiv subjects

Zhu Han

Publications and source records attributed to Zhu Han.

At least 487 records · Page 27Linked to original sources

arXiv2015

Overlapping Coalition Formation Games for Emerging Communication Networks

Modern cellular networks are witnessing an unprecedented evolution from classical, centralized and homogenous architectures into a mix of various technologies, in which the network devices are densely and randomly deployed in a decentralized and heterogenous architecture. This shift in network architecture requires network devices to become more autonomous and, potentially, cooperate with one another. Such cooperation can, for example, take place between interfering small access points that seek to coordinate their radio resource allocation, nearby single-antenna users that can cooperatively perform virtual MIMO communications, or even unlicensed users that wish to cooperatively sense the spectrum of the licensed users. Such cooperative mechanisms involve the simultaneous sharing and distribution of resources among a number of overlapping cooperative groups or coalitions. In this paper, a novel mathematical framework from cooperative games, dubbed \emph{overlapping coalition formation games} (OCF games), is introduced to model and solve such cooperative scenarios. First, the concepts of OCF games are presented, and then, several algorithmic aspects are studied for two main classes of OCF games. Subsequently, two example applications, namely, interference management and cooperative spectrum sensing, are discussed in detail to show how the proposed models and algorithms can be used in the future scenarios of wireless systems. Finally, we conclude by providing an overview on future directions and applications of OCF games.

cs.GT↗

arXiv2015

Perfect Output Feedback in the Two-User Decentralized Interference Channel

In this paper, the $η$-Nash equilibrium ($η$-NE) region of the two-user Gaussian interference channel (IC) with perfect output feedback is approximated to within $1$ bit/s/Hz and $η$ arbitrarily close to $1$ bit/s/Hz. The relevance of the $η$-NE region is that it provides the set of rate-pairs that are achievable and stable in the IC when both transmitter-receiver pairs autonomously tune their own transmit-receive configurations seeking an $η$-optimal individual transmission rate. Therefore, any rate tuple outside the $η$-NE region is not stable as there always exists one link able to increase by at least $η$ bits/s/Hz its own transmission rate by updating its own transmit-receive configuration. The main insights that arise from this work are: $(i)$ The $η$-NE region achieved with feedback is larger than or equal to the $η$-NE region without feedback. More importantly, for each rate pair achievable at an $η$-NE without feedback, there exists at least one rate pair achievable at an $η$-NE with feedback that is weakly Pareto superior. $(ii)$ There always exists an $η$-NE transmit-receive configuration that achieves a rate pair that is at most $1$ bit/s/Hz per user away from the outer bound of the capacity region.

cs.IT↗

arXiv2015

Social Data Offloading in D2D-Enhanced Cellular Networks by Network Formation Games

Recently, cellular networks are severely overloaded by social-based services, such as YouTube, Facebook and Twitter, in which thousands of clients subscribe a common content provider (e.g., a popular singer) and download his/her content updates all the time. Offloading such traffic through complementary networks, such as a delay tolerant network formed by device-to-device (D2D) communications between mobile subscribers, is a promising solution to reduce the cellular burdens. In the existing solutions, mobile users are assumed to be volunteers who selfishlessly deliver the content to every other user in proximity while moving. However, practical users are selfish and they will evaluate their individual payoffs in the D2D sharing process, which may highly influence the network performance compared to the case of selfishless users. In this paper, we take user selfishness into consideration and propose a network formation game to capture the dynamic characteristics of selfish behaviors. In the proposed game, we provide the utility function of each user and specify the conditions under which the subscribers are guaranteed to converge to a stable network. Then, we propose a practical network formation algorithm in which the users can decide their D2D sharing strategies based on their historical records. Simulation results show that user selfishness can highly degrade the efficiency of data offloading, compared with ideal volunteer users. Also, the decrease caused by user selfishness can be highly affected by the cost ratio between the cellular transmission and D2D transmission, the access delays, and mobility patterns.

cs.GT↗

arXiv2015

Queueing Game For Spectrum Access in Cognitive Radio Networks

In this paper, we investigate the problem of spectrum access decision-making for the Secondary Users (SUs) in the cognitive radio networks. When the Primary Users (PUs) are absent on certain frequency bandwidth, SUs can formulate a queue and wait for the Base Station (BS) to serve. The queue of the SUs will be dismissed if the PU is emerging in the system. Leveraging the queueing game approaches, the decision-making process of the SUs that whether to queue or not is studied. Both individual equilibrium and social optimization strategies are derived analytically. Moreover, the optimal pricing strategy of the service provider is investigated as well. Our proposed algorithms and corresponding analysis are validated through simulation studies.

cs.NI↗

arXiv2015

Resource Allocation in Full-Duplex Communications for Future Wireless Networks

The recent significant progress in realizing full-duplex~(FD) systems has opened up a promising avenue for improving quality of service (QoS) and quality of experience (QoE) in future wireless networks. There is an urgent need to address the diverse set of challenges regarding different aspects of FD network design, theory, and development. In addition to the self-interference cancelation signal processing algorithms, network protocols such as resource management are also essential in the practical design and implementation of FD wireless networks. This article aims to present the latest development and future directions of resource allocation in different full duplex systems by exploring the network resources in different domains, including power, space, frequency, and device dimensions. Four representative application scenarios are considered: FD MIMO networks, FD cooperative networks, FD OFDMA cellular networks, and FD heterogeneous networks. Resource management problems and novel algorithms in these systems are presented, and key open research directions are discussed.

cs.IT↗

arXiv2015

Full-duplex MAC Protocol Design and Analysis

The idea of in-band full-duplex (FD) communications revives in recent years owing to the significant progress in the self-interference cancellation and hardware design techniques, offering the potential to double spectral efficiency. The adaptations in upper layers are highly demanded in the design of FD communication systems. In this letter, we propose a novel medium access control (MAC) using FD techniques that allows transmitters to monitor the channel usage while transmitting, and backoff as soon as collision happens. Analytical saturation throughput of the FD-MAC protocol is derived with the consideration of imperfect sensing brought by residual self- interference (RSI) in the PHY layer. Both analytical and simulation results indicate that the normalized saturation throughput of the proposed FD-MAC can significantly outperforms conventional CSMA/CA under various network conditions.

cs.NI↗

arXiv2015

Multi-Block ADMM for Big Data Optimization in Modern Communication Networks

In this paper, we review the parallel and distributed optimization algorithms based on the alternating direction method of multipliers (ADMM) for solving "big data" optimization problems in modern communication networks. We first introduce the canonical formulation of the large-scale optimization problem. Next, we describe the general form of ADMM and then focus on several direct extensions and sophisticated modifications of ADMM from $2$-block to $N$-block settings to deal with the optimization problem. The iterative schemes and convergence properties of each extension/modification are given, and the implementation on large-scale computing facilities is also illustrated. Finally, we numerate several applications in communication networks, such as the security constrained optimal power flow problem in smart grid networks and mobile data offloading problem in software defined networks (SDNs).

math.NA↗

arXiv2015

Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

The Byzantine attack in cooperative spectrum sensing (CSS), also known as the spectrum sensing data falsification (SSDF) attack in the literature, is one of the key adversaries to the success of cognitive radio networks (CRNs). In the past couple of years, the research on the Byzantine attack and defense strategies has gained worldwide increasing attention. In this paper, we provide a comprehensive survey and tutorial on the recent advances in the Byzantine attack and defense for CSS in CRNs. Specifically, we first briefly present the preliminaries of CSS for general readers, including signal detection techniques, hypothesis testing, and data fusion. Second, we analyze the spear and shield relation between Byzantine attack and defense from three aspects: the vulnerability of CSS to attack, the obstacles in CSS to defense, and the games between attack and defense. Then, we propose a taxonomy of the existing Byzantine attack behaviors and elaborate on the corresponding attack parameters, which determine where, who, how, and when to launch attacks. Next, from the perspectives of homogeneous or heterogeneous scenarios, we classify the existing defense algorithms, and provide an in-depth tutorial on the state-of-the-art Byzantine defense schemes, commonly known as robust or secure CSS in the literature. Furthermore, we highlight the unsolved research challenges and depict the future research directions.

cs.NI↗

arXiv2015

Full-Duplex Cognitive Radio: A New Design Paradigm for Enhancing Spectrum Usage

With the rapid growth of demand for ever-increasing data rate, spectrum resources have become more and more scarce. As a promising technique to increase the efficiency of the spectrum utilization, cognitive radio (CR) technique has the great potential to meet such a requirement by allowing un-licensed users to coexist in licensed bands. In conventional CR systems, the spectrum sensing is performed at the beginning of each time slot before the data transmission. This unfortunately results in two major problems: 1) transmission time reduction due to sensing, and 2) sensing accuracy impairment due to data transmission. To tackle these problems, in this paper we present a new design paradigm for future CR by exploring the full-duplex (FD) techniques to achieve the simultaneous spectrum sensing and data transmission. With FD radios equipped at the secondary users (SUs), SUs can simultaneously sense and access the vacant spectrum, and thus, significantly improve sensing performances and meanwhile increase data transmission efficiency. The aim of this article is to transform the promising conceptual framework into the practical wireless network design by addressing a diverse set of challenges such as protocol design and theoretical analysis. Several application scenarios with FD enabled CR are elaborated, and key open research directions and novel algorithms in these systems are discussed.

cs.NI↗

arXiv2015

Matching Theory for Future Wireless Networks: Fundamentals and Applications

The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In this paper, the first comprehensive tutorial on the use of matching theory, a Nobelprize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then, the key solution concepts and algorithmic implementations of this framework are exposed. Then, the developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed.

cs.IT↗

arXiv2015

Multi-Block ADMM for Big Data Optimization in Smart Grid

In this paper, we review the parallel and distributed optimization algorithms based on alternating direction method of multipliers (ADMM) for solving "big data" optimization problem in smart grid communication networks. We first introduce the canonical formulation of the large-scale optimization problem. Next, we describe the general form of ADMM and then focus on several direct extensions and sophisticated modifications of ADMM from $2$-block to $N$-block settings to deal with the optimization problem. The iterative schemes and convergence properties of each extension/modification are given, and the implementation on large-scale computing facilities is also illustrated. Finally, we numerate several applications in power system for distributed robust state estimation, network energy management and security constrained optimal power flow problem.

eess.SY↗

arXiv2015

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.

cs.GT↗

arXiv2015

Device Fingerprinting in Wireless Networks: Challenges and Opportunities

Node forgery or impersonation, in which legitimate cryptographic credentials are captured by an adversary, constitutes one major security threat facing wireless networks. The fact that mobile devices are prone to be compromised and reverse engineered significantly increases the risk of such attacks in which adversaries can obtain secret keys on trusted nodes and impersonate the legitimate node. One promising approach toward thwarting these attacks is through the extraction of unique fingerprints that can provide a reliable and robust means for device identification. These fingerprints can be extracted from transmitted signal by analyzing information across the protocol stack. In this paper, the first unified and comprehensive tutorial in the area of wireless device fingerprinting for security applications is presented. In particular, we aim to provide a detailed treatment on developing novel wireless security solutions using device fingerprinting techniques. The objectives are three-fold: (i) to introduce a comprehensive taxonomy of wireless features that can be used in fingerprinting, (ii) to provide a systematic review on fingerprint algorithms including both white-list based and unsupervised learning approaches, and (iii) to identify key open research problems in the area of device fingerprinting and feature extraction, as applied to wireless security.

cs.NI↗

arXiv2014

Wireless Charger Networking for Mobile Devices: Fundamentals, Standards, and Applications

Wireless charging is a technique of transmitting power through an air gap to an electrical device for the purpose of energy replenishment. Recently, the wireless charging technology has been significantly advanced in terms of efficiency and functionality. This article first presents an overview and fundamentals of wireless charging. We then provide the review of standards, i.e., Qi and Alliance for Wireless Power (A4WP), and highlight on their communication protocols. Next, we propose a novel concept of wireless charger networking which allows chargers to be connected to facilitate information collection and control. We demonstrate the application of the wireless charger network in user-charger assignment, which clearly shows the benefit in terms of reduced cost for users to identify the best chargers to replenish energy for their mobile devices.

cs.NI↗

arXiv2014

Energy-Efficient Resource Allocation for Device-to-Device Underlay Communication

Device-to-device (D2D) communication underlaying cellular networks is expected to bring significant benefits for utilizing resources, improving user throughput and extending battery life of user equipments. However, the allocation of radio and power resources to D2D communication needs elaborate coordination, as D2D communication can cause interference to cellular communication. In this paper, we study joint channel and power allocation to improve the energy efficiency of user equipments. To solve the problem efficiently, we introduce an iterative combinatorial auction algorithm, where the D2D users are considered as bidders that compete for channel resources, and the cellular network is treated as the auctioneer. We also analyze important properties of D2D underlay communication, and present numerical simulations to verify the proposed algorithm.

cs.NI↗

arXiv2014

A Probabilistic MAC for Cognitive Radio Systems with Energy Harvesting Nodes

In this paper, we consider a cognitive radio (CR) system where the secondary user (SU) harvests energy from both the nature resources and the primary user (PU) radio frequency(RF) signal. We propose an energy-based probabilistic access scheme in which SU probabilistically accesses and senses the primary channel. The decision is based on the available energy and the PU's activity. We investigate the problem of maximizing the SU's success rate provided that the PU average quality of service (QoS) constraint is satisfied. We also assume multi-packet reception (MPR) capability and sensing errors under a Rayleigh fading channel. Numerical results show the effectiveness of the proposed probabilistic access scheme.

cs.NI↗

arXiv2014

Non-parametric Bayesian Learning with Deep Learning Structure and Its Applications in Wireless Networks

In this paper, we present an infinite hierarchical non-parametric Bayesian model to extract the hidden factors over observed data, where the number of hidden factors for each layer is unknown and can be potentially infinite. Moreover, the number of layers can also be infinite. We construct the model structure that allows continuous values for the hidden factors and weights, which makes the model suitable for various applications. We use the Metropolis-Hastings method to infer the model structure. Then the performance of the algorithm is evaluated by the experiments. Simulation results show that the model fits the underlying structure of simulated data.

cs.LG↗

arXiv2014

Power allocation with stackelberg game in femtocell networks: a self-learning approach

This paper investigates the energy-efficient power allocation for a two-tier, underlaid femtocell network. The behaviors of the Macrocell Base Station (MBS) and the Femtocell Users (FUs) are modeled hierarchically as a Stackelberg game. The MBS guarantees its own QoS requirement by charging the FUs individually according to the cross-tier interference, and the FUs responds by controlling the local transmit power non-cooperatively. Due to the limit of information exchange in intra- and inter-tiers, a self-learning based strategy-updating mechanism is proposed for each user to learn the equilibrium strategies. In the same Stackelberg-game framework, two different scenarios based on the continuous and discrete power profiles for the FUs are studied, respectively. The self-learning schemes in the two scenarios are designed based on the local best response. By studying the properties of the proposed game in the two situations, the convergence property of the learning schemes is provided. The simulation results are provided to support the theoretical finding in different situations of the proposed game, and the efficiency of the learning schemes is validated.

cs.NI↗