5,398 research outputs found
Joint Congestion Control and Scheduling in Wireless Networks with Network Coding
published_or_final_versio
On wireless network scheduling with intersession network coding
Abstract—Cross-layer optimization including congestion con-trol, routing, and scheduling has shown dramatic throughput improvement over layered designs for wireless networks. In parallel, the paradigm-shifting network coding has empirically demonstrated substantial throughput improvement when coding operations are permitted at intermediate nodes and packets from different sessions are mixed. Designing network codes and the associated flow in network coding presents new challenges for cross-layer optimization for wireless multi-hop networks. This work shows that with a new flow-based characterization of pairwise intersession network coding, a joint optimal scheduling and rate-control algorithm can be implemented distributively. Optimal scheduling is computationally expensive to achieve even in a purely routing-based (without network coding) paradigm, let alone with network coding. Thus, in this paper, the impact of imperfect scheduling is studied, which shows that pairwise intersession network coding can improve the throughput of routing-based solutions regardless of whether perfect/imperfect scheduling is used. Both the deterministic and stochastic packet arrivals and departures are considered. This work shows for the first time a striking resemblance between pairwise intersession network coding and routing, and thus advocates extensions of routing-based wisdoms to their network coding counterpart. Index Terms—Network coding, pairwise intersession network coding, imperfect scheduling, cross-layer optimization, congestion control. I
Distributed optimization in wireless networks using broadcast advantage
In this paper, we consider cross layer optimization
in wireless networks with wireless broadcast advantage,
focusing on the problem of distributed scheduling of broadcast
links. The wireless broadcast advantage is most useful
in multicast scenarios. For a multicast scenario, we give a
subgradient algorithm for distributed joint congestion control,
network coding and session scheduling, which however requires
centralized link scheduling. Under the primary interference
model, link scheduling problem is equivalent to a maximum
weighted hypergraph matching problem that is NP-complete.
To solve the scheduling problem distributedly, locally greedy
and randomized approximation algorithms are proposed and
shown to have bounded worst-case performance. With random
network coding, we obtain a fully distributed cross-layer design.
Numerical results show promising throughput gain using the
proposed algorithms, and surprisingly, in some cases even
with less complexity than cross-layer design without broadcast
advantage
TCP-Aware Backpressure Routing and Scheduling
In this work, we explore the performance of backpressure routing and
scheduling for TCP flows over wireless networks. TCP and backpressure are not
compatible due to a mismatch between the congestion control mechanism of TCP
and the queue size based routing and scheduling of the backpressure framework.
We propose a TCP-aware backpressure routing and scheduling that takes into
account the behavior of TCP flows. TCP-aware backpressure (i) provides
throughput optimality guarantees in the Lyapunov optimization framework, (ii)
gracefully combines TCP and backpressure without making any changes to the TCP
protocol, (iii) improves the throughput of TCP flows significantly, and (iv)
provides fairness across competing TCP flows
On distributed scheduling in wireless networks exploiting broadcast and network coding
In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links. The wireless broadcast advantage is most useful in multicast scenarios. As such, we include network coding in our design to exploit the throughput gain brought in by network coding for multicasting. We derive a subgradient algorithm for joint rate control, network coding and scheduling, which however requires centralized link scheduling. Under the primary interference model, link scheduling problem is equivalent to a maximum weighted hypergraph matching problem that is NP-complete. To solve the scheduling problem distributedly, locally greedy and randomized approximation algorithms are proposed and shown to have bounded worst-case performance. With random network coding, we obtain a fully distributed cross-layer design. Numerical results show promising throughput gain using the proposed algorithms, and surprisingly, in some cases even with less complexity than cross-layer design without broadcast advantage
Utility Optimal Scheduling and Admission Control for Adaptive Video Streaming in Small Cell Networks
We consider the jointly optimal design of a transmission scheduling and
admission control policy for adaptive video streaming over small cell networks.
We formulate the problem as a dynamic network utility maximization and observe
that it naturally decomposes into two subproblems: admission control and
transmission scheduling. The resulting algorithms are simple and suitable for
distributed implementation. The admission control decisions involve each user
choosing the quality of the video chunk asked for download, based on the
network congestion in its neighborhood. This form of admission control is
compatible with the current video streaming technology based on the DASH
protocol over TCP connections. Through simulations, we evaluate the performance
of the proposed algorithm under realistic assumptions for a small-cell network.Comment: 5 pages, 4 figures. Accepted and will be presented at IEEE
International Symposium on Information Theory (ISIT) 201
Guest Editorial: Nonlinear Optimization of Communication Systems
Linear programming and other classical optimization techniques have found important applications in communication systems for many decades. Recently, there has been a surge in research activities that utilize the latest developments in nonlinear optimization to tackle a much wider scope of work in the analysis and design of communication systems. These activities involve every “layer” of the protocol stack and the principles of layered network architecture itself, and have made intellectual and practical impacts significantly beyond the established frameworks of optimization of communication systems in the early 1990s. These recent results are driven by new demands in the areas of communications and networking, as well as new tools emerging from optimization theory. Such tools include the powerful theories and highly efficient computational algorithms for nonlinear convex optimization, together with global solution methods and relaxation techniques for nonconvex optimization
- …