相关论文: Capacity of a Class of Linear Binary Field Multi-s…

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

Cooperative relaying improves the performance of wireless networks by forming a network of multiple independent virtual sources transmitting the same information as the source node. However, interference induced in the network reduces the…

The availability of very wide spectrum in millimeter wave bands combined with large antenna arrays and ultra dense networks raises two basic questions: What is the true value of overly abundant degrees of freedom and how can networks be…

We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that…

This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general…

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification,…

We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two…

We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow…

The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate communication link from the relay to the receiver with capacity R_0, is shown to be…

Real-time applications are performance critical applications that require bounded service latency. In multi-hop wireless ad-hoc and sensor networks, communication delays are dominant over processing delays. Therefore, to enable real-time…

We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered…

Network Utility Maximization (NUM) is often applied for the cross-layer design of wireless networks considering known wireless channels. However, realistic wireless channel capacities are stochastic bearing time-varying statistics,…

Wireless fading networks with multiple antennas are typically studied information-theoretically from two different perspectives - the outage characterization and the ergodic capacity characterization. A key parameter in the outage…

Network capacity region is an important character of mobile ad hoc networks. Using cell-partitioned model, an expression of upper bound of delay-tolerant hybrid mobile ad hoc network is deduced regardless of coverage of base stations, types…

We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal…

In a multihop wireless network, wireless interference is crucial to the maximum multiflow (MMF) problem, which studies the maximum throughput between multiple pairs of sources and sinks. In this paper, we observe that network coding could…

The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work,…