Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms

Details Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms

2012-01-25

arxiv.org/abs/1201.5173v1

Computer Science

Information Theory

42 pages, submitted to IEEE Trans. on Information Theory

Scientific paper

The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to the phenomenal growth of traffic demand in wireless networks. In this paper we consider the downlink of a wireless network with $N$ Access Points ({\sf AP}'s) and $M$ clients, where each client is connected to several out-of-band {\sf AP}'s, and requests delay-sensitive traffic (e.g., real-time video). We adopt the framework of Hou, Borkar, and Kumar, and study the maximum total timely throughput of the network, denoted by $C_{\text{{\sf T}}^{\text{3}}}$, which is the maximum average number of packets delivered successfully before their deadline. Solving this problem is challenging since even the number of different ways of assigning packets to the {\sf AP}'s is $N^M$. We overcome the challenge by proposing a deterministic relaxation of the problem, which converts the problem to a network with deterministic delays in each link. We show that the additive gap between the capacity of the relaxed problem, denoted by $C_{\text{det}}$, and $C_{\text{{\sf T}}^{\text{3}}}$ is bounded by $2\sqrt{N(C_{\text{det}}+\frac{N}{4})}$, which is asymptotically negligible compared to $C_{\text{det}}$, when the network is operating at high-throughput regime. In addition, our numerical results show that the actual gap between $C_{\text{{\sf T}}^{\text{3}}}$ and $C_{\text{det}}$ is in most cases much less than the worst-case gap proven analytically. Moreover, using LP rounding methods we prove that the relaxed problem can be approximated within additive gap of $N$. We also extend the analytical results to the case of time-varying channel states and weighted total timely throughput.

Affiliated with

Also associated with

No associations

Rating

Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682819