arXiv subjects

Chau Yuen

Publications and source records attributed to Chau Yuen.

At least 541 records · Page 30Linked to original sources

arXiv2013

Adaptive Mode Selection in Multiuser MISO Cognitive Networks with Limited Cooperation and Feedback

In this paper, we consider a multiuser MISO downlink cognitive network coexisting with a primary network. With the purpose of exploiting the spatial degree of freedom to counteract the inter-network interference and intra-network (inter-user) interference simultaneously, we propose to perform zero-forcing beamforming (ZFBF) at the multi-antenna cognitive base station (BS) based on the instantaneous channel state information (CSI). The challenge of designing ZFBF in cognitive networks lies in how to obtain the interference CSI. To solve it, we introduce a limited inter-network cooperation protocol, namely the quantized CSI conveyance from the primary receiver to the cognitive BS via purchase. Clearly, the more the feedback amount, the better the performance, but the higher the feedback cost. In order to achieve a balance between the performance and feedback cost, we take the maximization of feedback utility function, defined as the difference of average sum rate and feedback cost while satisfying the interference constraint, as the optimization objective, and derive the transmission mode and feedback amount joint optimization scheme. Moreover, we quantitatively investigate the impact of CSI feedback delay and obtain the corresponding optimization scheme. Furthermore, through asymptotic analysis, we present some simple schemes. Finally, numerical results confirm the effectiveness of our theoretical claims.

cs.IT↗

arXiv2013

Non-homogeneous Two-Rack Model for Distributed Storage Systems

In the traditional two-rack distributed storage system (DSS) model, due to the assumption that the storage capacity of each node is the same, the minimum bandwidth regenerating (MBR) point becomes infeasible. In this paper, we design a new non-homogeneous two-rack model by proposing a generalization of the threshold function used to compute the tradeoff curve. We prove that by having the nodes in the rack with higher regenerating bandwidth stores more information, all the points on the tradeoff curve, including the MBR point, become feasible. Finally, we show how the non-homogeneous two-rack model outperforms the traditional model in the tradeoff curve between the storage per node and the repair bandwidth.

cs.IT↗

arXiv2013

Wireless Energy and Information Transfer Tradeoff for Limited Feedback Multi-Antenna Systems with Energy Beamforming

In this paper, we consider a multi-antenna system where the receiver should harvest energy from the transmitter by wireless energy transfer to support its wireless information transmission. In order to maximize the harvesting energy, we propose to perform adaptive energy beamforming according to the instantaneous channel state information (CSI). To help the transmitter to obtain the CSI for energy beamforming, we further propose a win-win CSI quantization feedback strategy, so as to improve the efficiencies of both power and information transmission. The focus of this paper is on the tradeoff of wireless energy and information transfer by adjusting the transfer duration with a total duration constraint. Through revealing the relationship between transmit power, transfer duration and feedback amount, we derive two wireless energy and information transfer tradeoff schemes by maximizing an upper bound and an approximate lower bound of the average information transmission rate, respectively. Moreover, the impact of imperfect CSI at the receiver is investigated and the corresponding wireless energy and information transfer tradeoff scheme is also given. Finally, numerical results validate the effectiveness of the proposed schemes.

cs.IT↗

arXiv2013

Optimal Locally Repairable Linear Codes

Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, δ})-locality, denoted as (r, δ)a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, δ)a codes are limited to only the special case of δ = 2, and to only two small regions within this special case, namely, m = 0 or m >= (v+δ-1) > (δ-1), where m = n mod (r+δ-1) and v = k mod r. This paper investigates the existence conditions and presents deterministic constructive algorithms for optimal (r, δ)a codes with general r and δ. First, a structure theorem is derived for general optimal (r, δ)a codes which helps illuminate some of their structure properties. Next, the entire problem space with arbitrary n, k, r and δ is divided into eight different cases (regions) with regard to the specific relations of these parameters. For two cases, it is rigorously proved that no optimal (r, δ)a could exist. For four other cases the optimal (r, δ)a codes are shown to exist, deterministic constructions are proposed and the lower bound on the required field size for these algorithms to work is provided. Our new constructive algorithms not only cover more cases, but for the same cases where previous algorithms exist, the new constructions require a considerably smaller field, which translates to potentially lower computational complexity. Our findings substantially enriches the knowledge on (r, δ)a codes, leaving only two cases in which the existence of optimal codes are yet to be determined.

cs.IT↗

arXiv2013

Recursive-Cube-of-Rings (RCR) Revisited: Properties and Enhancement

We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating examples, we have corrected previous misunderstandings on the topological properties of these graphs, including node degree, symmetry, diameter and bisection width. To fully harness the potential of structural regularity through RCR construction, new edge connecting rules are proposed. The modified graphs, referred to as {\it Class-II RCR}, are shown to possess uniform node degrees, better connectivity and better network symmetry, and hence will find better application in parallel computing.

math.GT↗

arXiv2013

An Efficient MAC Protocol with Selective Grouping and Cooperative Sensing in Cognitive Radio Networks

In cognitive radio networks, spectrum sensing is a crucial technique to discover spectrum opportunities for the Secondary Users (SUs). The quality of spectrum sensing is evaluated by both sensing accuracy and sensing efficiency. Here, sensing accuracy is represented by the false alarm probability and the detection probability while sensing efficiency is represented by the sensing overhead and network throughput. In this paper, we propose a group-based cooperative Medium Access Control (MAC) protocol called GC-MAC, which addresses the tradeoff between sensing accuracy and efficiency. In GC-MAC, the cooperative SUs are grouped into several teams. During a sensing period, each team senses a different channel while SUs in the same team perform the joint detection on the targeted channel. The sensing process will not stop unless an available channel is discovered. To reduce the sensing overhead, an SU-selecting algorithm is presented to selectively choose the cooperative SUs based on the channel dynamics and usage patterns. Then, an analytical model is built to study the sensing accuracy-efficiency tradeoff under two types of channel conditions: time-invariant channel and time-varying channel. An optimization problem that maximizes achievable throughput is formulated to optimize the important design parameters. Both saturation and non-saturation situations are investigated with respect to throughput and sensing overhead. Simulation results indicate that the proposed protocol is able to significantly decrease sensing overhead and increase network throughput with guaranteed sensing accuracy.

cs.ET↗

arXiv2013

Encoding Complexity of Network Coding with Two Simple Multicast Sessions

The encoding complexity of network coding for single multicast networks has been intensively studied from several aspects: e.g., the time complexity, the required number of encoding links, and the required field size for a linear code solution. However, these issues as well as the solvability are less understood for networks with multiple multicast sessions. Recently, Wang and Shroff showed that the solvability of networks with two unit-rate multicast sessions (2-URMS) can be decided in polynomial time. In this paper, we prove that for the 2-URMS networks: $1)$ the solvability can be determined with time $O(|E|)$; $2)$ a solution can be constructed with time $O(|E|)$; $3)$ an optimal solution can be obtained in polynomial time; $4)$ the number of encoding links required to achieve a solution is upper-bounded by $\max\{3,2N-2\}$; and $5)$ the field size required to achieve a linear solution is upper-bounded by $\max\{2,\lfloor\sqrt{2N-7/4}+1/2\rfloor\}$, where $|E|$ is the number of links and $N$ is the number of sinks of the underlying network. Both bounds are shown to be tight.

cs.IT↗

arXiv2013

Bit Level Soft Decision Decoding of Triple Parity Reed Solomon Codes through Automorphism Groups

This paper discusses bit-level soft decoding of triple-parity Reed-Solomon (RS) codes through automorphism permutation. A new method for identifying the automorphism groups of RS binary images is first developed. The new algorithm runs effectively, and can handle more RS codes and capture more automorphism groups than the existing ones. Utilizing the automorphism results, a new bit-level soft-decision decoding algorithm is subsequently developed for general $(n,n-3,4)$ RS codes. Simulation on $(31,28,4)$ RS codes demonstrates an impressive gain of more than 1 dB at the bit error rate of $10^{-5}$ over the existing algorithms.

cs.IT↗

arXiv2013

Multi-Pair Amplify-and-Forward Relaying with Very Large Antenna Arrays

We consider a multi-pair relay channel where multiple sources simultaneously communicate with destinations using a relay. Each source or destination has only a single antenna, while the relay is equipped with a very large antenna array. We investigate the power efficiency of this system when maximum ratio combining/maximal ratio transmission (MRC/MRT) or zero-forcing (ZF) processing is used at the relay. Using a very large array, the transmit power of each source or relay (or both) can be made inversely proportional to the number of relay antennas while maintaining a given quality-of-service. At the same time, the achievable sum rate can be increased by a factor of the number of source-destination pairs. We show that when the number of antennas grows to infinity, the asymptotic achievable rates of MRC/MRT and ZF are the same if we scale the power at the sources. Depending on the large scale fading effect, MRC/MRT can outperform ZF or vice versa if we scale the power at the relay.

cs.IT↗

arXiv2013

Partial Third-Party Information Exchange with Network Coding

In this paper, we consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. We first derive the minimum number of required transmissions for such partial third-party information exchange problem. We then design an optimal transmission scheme by determining the number of packets that each client should send, and designing a deterministic encoding strategy such that the subset of clients can acquire complete channel state information of the network with minimal number of transmissions. Numerical results show that network coding can efficiently reduce the number of transmissions, even with only pairwise encoding.

cs.IT↗

arXiv2013

Delay Minimization in Varying-Bandwidth Direct Multicast with Side Information

We study the delay minimization in a direct multicast communication scheme where a base station wishes to transmit a set of original packets to a group of clients. Each of the clients already has in its cache a subset of the original packets, and requests for all the remaining packets. The base station communicates directly with the clients by broadcasting information to them. Assume that bandwidths vary between the station and different clients. We propose a method to minimize the total delay required for the base station to satisfy requests from all clients.

cs.IT↗

arXiv2013

Balanced Sparsest Generator Matrices for MDS Codes

We show that given $n$ and $k$, for $q$ sufficiently large, there always exists an $[n, k]_q$ MDS code that has a generator matrix $G$ satisfying the following two conditions: (C1) Sparsest: each row of $G$ has Hamming weight $n - k + 1$; (C2) Balanced: Hamming weights of the columns of $G$ differ from each other by at most one.

cs.IT↗

arXiv2013

A Scalable Hybrid MAC Protocol for Massive M2M Networks

In Machine to Machine (M2M) networks, a robust Medium Access Control (MAC) protocol is crucial to enable numerous machine-type devices to concurrently access the channel. Most literatures focus on developing simplex (reservation or contention based)MAC protocols which cannot provide a scalable solution for M2M networks with large number of devices. In this paper, a frame-based Hybrid MAC scheme, which consists of a contention period and a transmission period, is proposed for M2M networks. In the proposed scheme, the devices firstly contend the transmission opportunities during the contention period, only the successful devices will be assigned a time slot for transmission during the transmission period. To balance the tradeoff between the contention and transmission period in each frame, an optimization problem is formulated to maximize the system throughput by finding the optimal contending probability during contention period and optimal number of devices that can transmit during transmission period. A practical hybrid MAC protocol is designed to implement the proposed scheme. The analytical and simulation results demonstrate the effectiveness of the proposed Hybrid MAC protocol.

cs.NI↗

arXiv2012

Electricity Cost Minimization for a Residential Smart Grid with Distributed Generation and Bidirectional Power Transactions

In this paper, we consider the electricity cost minimization problem in a residential network where each community is equipped with a distributed power generation source and every household in the community has a set of essential and shiftable power demands. We allow bi-directional power transactions and assume a two-tier pricing model for the buying and selling of electricity from the grid. In this situation, in order to reduce the cost of electricity we are required to make, 1) Scheduling decisions for the shiftable demands, 2) The decisions on the amount of energy purchased from the gird by the users, 3) The decisions on the amount of energy sold to the grid by the users. We formulate a global centralized optimization problem and obtain the optimal amount of electricity consumed, sold and purchased for each household, respectively by assuming the availability of all current and future values of time-varying parameters. In reality, the lack of perfect information hampers the implementation of such global centralized optimization. Hence, we propose a distributed online algorithm which only requires the current values of the timevarying supply and demand processes. We then compare and determine the tradeoff between both formulations. Simulation results show that the proposed schemes can provide effective management for household electricity usage.

math.OC↗

arXiv2012

Demand Shaping to Achieve Steady Electricity Consumption with Load Balancing in a Smart Grid

The purpose of this paper is to study conflicting objectives between the grid operator and consumers in a future smart grid. Traditionally, customers in electricity grids have different demand profiles and it is generally assumed that the grid has to match and satisfy the demand profiles of all its users. However, for system operators and electricity producers, it is usually most desirable, convenient and cost effective to keep electricity production at a constant rate. The temporal variability of electricity demand forces power generators, especially load following and peaking plants to constantly manipulate electricity production away from a steady operating point.

math.OC↗

arXiv2012

Performance Analysis of Two-Step Bi-Directional Relaying with Multiple Antennas

In this paper we study decode-and-forward multi-antenna relay systems that achieve bi-directional communication in two time slots. We investigate different downlink broadcast schemes which employ binary or analog network coding at the relay. We also analyze and compare their performances in terms of diversity order and symbol error probability. It is shown that if exact downlink channel state information is available at the relay, using analog network coding in the form of multi-antenna maximal-ratio transmit beamforming to precode the information vectors at the relay gives the best performance. Then, we propose a Max-Min antenna selection with binary network coding scheme that can approach this performance with only partial channel state information.

cs.IT↗

arXiv2012

Error Correction for Cooperative Data Exchange

This paper considers the problem of error correction for a cooperative data exchange (CDE) system, where some clients are compromised or failed and send false messages. Assuming each client possesses a subset of the total messages, we analyze the error correction capability when every client is allowed to broadcast only one linearly-coded message. Our error correction capability bound determines the maximum number of clients that can be compromised or failed without jeopardizing the final decoding solution at each client. We show that deterministic, feasible linear codes exist that can achieve the derived bound. We also evaluate random linear codes, where the coding coefficients are drawn randomly, and then develop the probability for a client to withstand a certain number of compromised or failed peers and successfully deduce the complete message for any network size and any initial message distributions.

cs.IT↗

arXiv2012

Non-homogeneous distributed storage systems

This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed storage schemes based on (k+2; k) maximum distance separable (MDS) codes and non-MDS codes to show the efficiency of such non-homogeneous DSS in terms of repair efficiency and data availability. Our schemes achieve optimal bandwidth (k+1/2)(M/k) when repairing 1-node failure, but require only one fourth of the minimum required file size and can operate with a smaller field size leading to significant complexity reduction than traditional homogeneous DSS. Moreover, with non-MDS codes, our scheme can achieve an even smaller repair bandwidth of M/2k . Finally, we show that our schemes can increase the data availability by 10% than the traditional homogeneous DSS scheme.

cs.IT↗