Searcharxiv⌕ Search

arXiv subjects

Hui Gao

Publications and source records attributed to Hui Gao.

At least 91 records · Page 5Linked to original sources
arXiv2017

Comprehensive routing strategy on multilayer networks

Designing an efficient routing strategy is of great importance to alleviate traffic congestion in multilayer networks. In this work, we design an effective routing strategy for multilayer networks by comprehensively considering the roles of nodes' local structures in micro-level, as well as the macro-level differences in transmission speeds between different layers. Both numerical and analytical results indicate that our proposed routing strategy can reasonably redistribute the traffic load of the low speed layer to the high speed layer, and thus the traffic capacity of multilayer networks are significantly enhanced compared with the monolayer low speed networks. There is an optimal combination of macro- and micro-level control parameters at which can remarkably alleviate the congestion and thus maximize the traffic capacity for a given multilayer network. Moreover, we find that increasing the size and the average degree of the high speed layer can enhance the traffic capacity of multilayer networks more effectively. We finally verify that real-world network topology does not invalidate the results. The theoretical predictions agree well with the numerical simulations.

physics.soc-ph↗
arXiv2016

A Belief Propagation Based Framework for Soft Multiple-Symbol Differential Detection

Soft noncoherent detection, which relies on calculating the \textit{a posteriori} probabilities (APPs) of the bits transmitted with no channel estimation, is imperative for achieving excellent detection performance in high-dimensional wireless communications. In this paper, a high-performance belief propagation (BP)-based soft multiple-symbol differential detection (MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application in differential space-time block-code (DSTBC)-aided ultra-wideband impulse radio (UWB-IR) systems. Firstly, we revisit the signal sampling with the aid of a trellis structure and decompose the trellis into multiple subtrellises. Furthermore, we derive an APP calculation algorithm, in which the forward-and-backward message passing mechanism of BP operates on the subtrellises. The proposed BP-MSDD is capable of significantly outperforming the conventional hard-decision MSDDs. However, the computational complexity of the BP-MSDD increases exponentially with the number of MSDD trellis states. To circumvent this excessive complexity for practical implementations, we reformulate the BP-MSDD, and additionally propose a Viterbi algorithm (VA)-based hard-decision MSDD (VA-HMSDD) and a VA-based soft-decision MSDD (VA-SMSDD). Moreover, both the proposed BP-MSDD and VA-SMSDD can be exploited in conjunction with soft channel decoding to obtain powerful iterative detection and decoding based receivers. Simulation results demonstrate the effectiveness of the proposed algorithms in DSTBC-aided UWB-IR systems.

cs.IT↗
arXiv2016

Detecting Byzantine Attacks Without Clean Reference

We consider an amplify-and-forward relay network composed of a source, two relays, and a destination. In this network, the two relays are untrusted in the sense that they may perform Byzantine attacks by forwarding altered symbols to the destination. Note that every symbol received by the destination may be altered, and hence no clean reference observation is available to the destination. For this network, we identify a large family of Byzantine attacks that can be detected in the physical layer. We further investigate how the channel conditions impact the detection against this family of attacks. In particular, we prove that all Byzantine attacks in this family can be detected with asymptotically small miss detection and false alarm probabilities by using a sufficiently large number of channel observations \emph{if and only if} the network satisfies a non-manipulability condition. No pre-shared secret or secret transmission is needed for the detection of these attacks, demonstrating the value of this physical-layer security technique for counteracting Byzantine attacks.

cs.IT↗
arXiv2016

Phase-Rotation-Aided Relay Selection in Two-Way Decode-and-Forward Relay Networks

This paper proposes a relay selection scheme that aims to improve the end-to-end symbol error rate (SER) performance of a two-way relay network (TWRN). The TWRN consists of two single-antenna sources and multiple relays employing decode-and-forward (DF) protocol. It is shown that the SER performance is determined by the minimum decision distance (DD) observed in the TWRN. However, the minimum DD is likely to be made arbitrarily small by channel fading. To tackle this problem, a phase rotation (PR) aided relay selection (RS) scheme is proposed to enlarge the minium DD, which in turn improves the SER performance. The proposed PR based scheme rotates the phases of the transmitted symbols of one source and of the selected relay according to the channel state information, aiming for increasing all DDs to be above a desired bound. The lower bound is further optimized by using a MaxMin-RS criterion associated with the channel gains. It is demonstrated that the PR aided MaxMin-RS approach achieves full diversity gain and an improved array gain. Furthermore, compared with the existing DF based schemes, the proposed scheme allows more flexible relay antenna configurations.

cs.IT↗
arXiv2016

Atomically-thin Ohmic Edge Contacts Between Two-dimensional Materials

With the decrease of the dimensions of electronic devices, the role played by electrical contacts is ever increasing, eventually coming to dominate the overall device volume and total resistance. This is especially problematic for monolayers of semiconducting transition metal dichalcogenides (TMDs), which are promising candidates for atomically thin electronics. Ideal electrical contacts to them would require the use of similarly thin electrode materials while maintaining low contact resistances. Here we report a scalable method to fabricate ohmic graphene edge contacts to two representative monolayer TMDs - MoS2 and WS2. The graphene and TMD layer are laterally connected with wafer-scale homogeneity, no observable overlap or gap, and a low average contact resistance of 30 k$Ω$ $μ$m. The resulting graphene edge contacts show linear current-voltage (IV) characteristics at room temperature, with ohmic behavior maintained down to liquid helium temperatures.

cond-mat.mes-hall↗
arXiv2016

Adapted bases of Kisin modules and Serre weights

Let $p>2$ be a prime. Let $K$ be a tamely ramified finite extension over $\mathbb Q_p$ with ramification index $e$, and let $G_K$ be the Galois group. We study Kisin modules attached to crystalline representations of $G_K$ whose labeled Hodge-Tate weights are relatively small (a sort of "$er\le p$" condition where $r$ is the maximal Hodge-Tate weight). In particular, we show that these Kisin modules admit "adapted bases". We then apply these results in the special case $e=2$ to study reductions and liftings of certain crystalline representations. As a consequence, we establish some new cases of weight part of Serre's conjectures (when $e=2$).

math.NT↗
arXiv2015

Predicting the epidemic threshold of the susceptible-infected-recovered model

Researchers have developed several theoretical methods for predicting epidemic thresholds, including the mean-field like (MFL) method, the quenched mean-field (QMF) method, and the dynamical message passing (DMP) method. When these methods are applied to predict epidemic threshold they often produce differing results and their relative levels of accuracy are still unknown. We systematically analyze these two issues---relationships among differing results and levels of accuracy---by studying the susceptible-infected-recovered (SIR) model on uncorrelated configuration networks and a group of 56 real-world networks. In uncorrelated configuration networks the MFL and DMP methods yield identical predictions that are larger and more accurate than the prediction generated by the QMF method. When compared to the 56 real-world networks, the epidemic threshold obtained by the DMP method is closer to the actual epidemic threshold because it incorporates full network topology information and some dynamical correlations. We find that in some scenarios---such as networks with positive degree-degree correlations, with an eigenvector localized on the high $k$-core nodes, or with a high level of clustering---the epidemic threshold predicted by the MFL method, which uses the degree distribution as the only input parameter, performs better than the other two methods. We also find that the performances of the three predictions are irregular versus modularity.

physics.soc-ph↗
arXiv2015

Time-resolved shadowgraphs of transient plasma induced by spatiotemporally focused femtosecond laser pulses in fused silica glass

We report on experimental observations of formation and evolution of transient plasma produced in fused silica glass with spatiotemporally focused (STF) femtosecond laser pulses using a pump-probe shadow imaging technique. Surprisingly, the observation shows that the track of the plasma is significantly curved, which is attributed to an asymmetric density distribution of the transient plasma produced in the focal volume caused by the pulse front tilt of the STF laser field.

physics.optics↗
arXiv2015

Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks

It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.

cs.IT↗
arXiv2015

An approximation algorithm for shortest path based on the hierarchy networks

It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a novel algorithm that is applicable for large networks with high efficiency and accuracy. The basic idea of our algorithm is to iteratively construct higher level hierarchy networks by condensing the central nodes and their neighbors into super nodes until the scale of the top level network is very small. Then the algorithm approximates the distances of the shortest paths in the original network with the help of super nodes in the higher level hierarchy networks. The experiment results show that our algorithm achieves both good efficiency and high accuracy compared with other algorithms.

cs.SI↗
arXiv2015

Distributed User Scheduling for MIMO-Y Channel

In this paper, distributed user scheduling schemes are proposed for the multi-user MIMO-Y channel, where three $N_{T}$-antenna users ($N_{T}=2N,\,3N$) are selected from three clusters to exchange information via an $N_{R}$-antenna amplify-and-forward (AF) relay ($N_{R}=3N$), and $N\geq1$ represents the number of data stream(s) of each unicast transmission within the MIMO-Y channel. The proposed schemes effectively harvest multi-user diversity (MuD) without the need of global channel state information (CSI) or centralized computations. In particular, a novel reference signal space (RSS) is proposed to enable the distributed scheduling for both cluster-wise (CS) and group-wise (GS) patterns. The minimum user-antenna (Min-UA) transmission with $N_{T}=2N$ is first considered. Next, we consider an equal number of relay and user antenna (ER-UA) transmission with ${N_{T}=3N}$, with the aim of reducing CSI overhead as compared to Min-UA. For ER-UA transmission, the achievable MuD orders of the proposed distributed scheduling schemes are analytically derived, which proves the superiority and optimality of the proposed RSS-based distributed scheduling. These results reveal some fundamental behaviors of MuD and the performance-complexity tradeoff of user scheduling schemes in the MIMO-Y channel.

cs.IT↗
arXiv2015

Joint Multiple Symbol Differential Detection and Channel Decoding for Noncoherent UWB Impulse Radio by Belief Propagation

This paper proposes a belief propagation (BP) message passing algorithm based joint multiple symbol differential detection (MSDD) and channel decoding scheme for noncoherent differential ultra-wideband impulse radio (UWB-IR) systems. MSDD is an effective means to improve the performance of noncoherent differential UWB-IR systems. To optimize the overall detection and decoding performance, in this paper, we propose a novel soft-in soft-out (SISO) MSDD scheme and its integration with SISO channel decoding for noncoherent differential UWB-IR. we first propose a new auto-correlation receiver (AcR) architecture to sample the received UWB-IR signal. The proposed AcR can exploit the dependencies (imposed by the differential modulation) among data symbols throughout the whole packet. The signal probabilistic model has a hidden Markov chain structure. We use a factor graph to represent this hidden Markov chain. Then, we apply BP message passing algorithm on the factor graph to develop a SISO MSDD scheme, which has better performance than the previous MSDD scheme and is easy to be integrated with SISO channel decoding to form a joint MSDD and channel decoding scheme. Simulation results indicate the performance advantages of our MSDD scheme and joint MSDD and channel decoding scheme.

cs.IT↗
arXiv2015

Low-Complexity Downlink User Selection for Massive MIMO Systems

In this paper we propose a pair of low-complexity user selection schemes with zero-forcing precoding for multiuser massive MIMO downlink systems, in which the base station is equipped with a large-scale antenna array. First, we derive approximations of the ergodic sum rates of the systems invoking the conventional random user selection (RUS) and the location-dependant user selection (LUS). Then, the optimal number of simultaneously served user equipments (UEs), $K^*$, is investigated to maximize the sum rate approximations. Upon exploiting $K^*$, we develop two user selection schemes, namely $K^*$-RUS and $K^*$-LUS, where $K^*$ UEs are selected either randomly or based on their locations. Both of the proposed schemes are independent of the instantaneous channel state information of small-scale fading, therefore enjoying the same extremely-low computational complexity as that of the conventional RUS scheme. Moreover, both of our proposed schemes achieve significant sum rate improvement over the conventional RUS. In addition, it is worth noting that like the conventional RUS, the $K^*$-RUS achieves good fairness among UEs.

cs.IT↗
arXiv2015

Secrecy Transmit Beamforming for Heterogeneous Networks

In this paper, we pioneer the study of physical-layer security in heterogeneous networks (HetNets). We investigate secure communications in a two-tier downlink HetNet, which comprises one macrocell and several femtocells. Each cell has multiple users and an eavesdropper attempts to wiretap the intended macrocell user. Firstly, we consider an orthogonal spectrum allocation strategy to eliminate co-channel interference, and propose the secrecy transmit beamforming only operating in the macrocell (STB-OM) as a partial solution for secure communication in HetNet. Next, we consider a secrecy-oriented non-orthogonal spectrum allocation strategy and propose two cooperative STBs which rely on the collaboration amongst the macrocell base station (MBS) and the adjacent femtocell base stations (FBSs). Our first cooperative STB is the STB sequentially operating in the macrocell and femtocells (STB-SMF), where the cooperative FBSs individually design their STB matrices and then feed their performance metrics to the MBS for guiding the STB in the macrocell. Aiming to improve the performance of STB-SMF, we further propose the STB jointly designed in the macrocell and femtocells (STB-JMF), where all cooperative FBSs feed channel state information to the MBS for designing the joint STB. Unlike conventional STBs conceived for broadcasting or interference channels, the three proposed STB schemes all entail relatively sophisticated optimizations due to QoS constraints of the legitimate users. In order to efficiently use these STB schemes, the original optimization problems are reformulated and convex optimization techniques, such as second-order cone programming and semidefinite programming, are invoked to obtain the optimal solutions. Numerical results demonstrate that the proposed STB schemes are highly effective in improving the secrecy rate performance of HetNet.

cs.IT↗
arXiv2014

Galois Lattices and Strongly Divisible Lattices in the Unipotent Case

Let p be a prime. We prove that there is an anti-equivalence between the category of unipotent strongly divisible lattices of weight p-1 and the category of Galois stable Z_p lattices in unipotent semi-stable representations with Hodge-Tate weights in {0, ..., p-1}. This completes the last remaining piece of Breuil's Conjecture(Conjecture 2.2.6 in [Bre02]).

math.NT↗
arXiv2014

Epidemic spreading on complex networks with general degree and weight distributions

The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In this study, a novel edge-weight based compartmental approach is developed to estimate the epidemic threshold and epidemic size (final infected density) on networks with general degree and weight distributions, and a remarkable agreement with numerics is obtained. Even in complex network with the strong heterogeneous degree and weight distributions, this approach is worked. We then propose an edge-weight based removal strategy with different biases, and find that such a strategy can effectively control the spread of epidemic when the highly weighted edges are preferentially removed, especially when the weight distribution of a network is extremely heterogenous. The theoretical results from the suggested method can accurately predict the above removal effectiveness.

physics.soc-ph↗
arXiv2014

An ESPRIT-Based Approach for 2-D Localization of Incoherently Distributed Sources in Massive MIMO Systems

In this paper, an approach of estimating signal parameters via rotational invariance technique (ESPRIT) is proposed for two-dimensional (2-D) localization of incoherently distributed (ID) sources in large-scale/massive multiple-input multiple-output (MIMO) systems. The traditional ESPRIT-based methods are valid only for one-dimensional (1-D) localization of the ID sources. By contrast, in the proposed approach the signal subspace is constructed for estimating the nominal azimuth and elevation direction-of-arrivals and the angular spreads. The proposed estimator enjoys closed-form expressions and hence it bypasses the searching over the entire feasible field. Therefore, it imposes significantly lower computational complexity than the conventional 2-D estimation approaches. Our analysis shows that the estimation performance of the proposed approach improves when the large-scale/massive MIMO systems are employed. The approximate Cramér-Rao bound of the proposed estimator for the 2-D localization is also derived. Numerical results demonstrate that albeit the proposed estimation method is comparable with the traditional 2-D estimators in terms of performance, it benefits from a remarkably lower computational complexity.

cs.IT↗