528 research outputs found
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
Recommended from our members
Topics in Routing and Network Coding for Wireless Networks
This dissertation presents topics in routing and network coding for wireless networks. We present a multipurpose multipath routing mechanism. We propose an efficient packet encoding algorithm that can easily integrate a routing scheme with network coding. We also discuss max-min fair rate allocation and scheduling algorithms for the flows in a wireless network that utilizes coding. We propose Polar Coordinate Routing (PCR) to create multiple paths between a source and a destination in wireless networks. Our scheme creates paths that are circular segments of different radii connecting source-destination pairs. We propose a non-euclidean distance metric that allows messages to travel along these paths. Using PCR it is possible to maintain a known separation among the paths, which reduces the interference between the nodes belonging to two separate routes. Our extensive simulations show that while PCR achieves a known separation between the routes, it does so with a small increase in overall hop count. Moreover, we demonstrate that the variances of average separation and hop count are lower for the paths created using PCR compared to the existing schemes, indicating a more reliable system. Existing multipath routing schemes in wireless networks do not perform well in the areas with obstacles or low node density. To overcome adverse areas in a network, we integrate PCR with simple robotic routing, which lets a message circumnavigate an obstacle and follow the multipath trajectory to the destination as soon as the obstacle is passed. Next we propose an efficient packet encoding algorithm to integrate a routing scheme with network coding. Note that this packet encoding algorithm is not dependent on PCR. In fact it can be coupled with any routing scheme in order to leverage the benefits offered by both an advanced routing scheme and an enhanced packet encoding algorithm. Our algorithm, based on bipartite graphs, lets a node exhaustively search its queue to identify the maximum set of packets that can be combined in a single transmission. We extend this algorithm to consider multiple next hop neighbors for a packet while searching for an optimal packet combination, which improves the likelihood of combining more packets in a single transmission. Finally, we propose an algorithm to assign max-min fair rates to the flows in a wireless network that utilizes coding. We demonstrate that when a network uses coding, a direct application of conventional progressive filling algorithm to achieve max-min fairness may yield incorrect or suboptimal results. To emulate progressive filling correctly for a wireless networks with coding, we couple a conflict graph based framework with a linear program. Our model helps us directly select a bottleneck flow at each iteration of the algorithm, eliminating the need of gradually increasing the rates of the flows until a bottleneck is found. We demonstrate the caveats in selecting the bottleneck flows and setting up transmission scheduling constraints in order to avoid suboptimal results. We first propose a centralized fair rate allocation algorithm assuming the global knowledge of the network. We also present a novel yet simple distributed algorithm that achieves the same results as the centralized algorithm. We also present centralized as well as distributed scheduling algorithms that help flows achieve their fair rates. We run our rate allocation algorithm on various topologies. We use various fairness metrics to show that our rate allocation algorithm outperforms existing algorithms (based on network utility maximization) in terms of fairness
Network coding for wireless communication networks
This special issue includes a collection of 19 outstanding research papers which cover a diversity of topics on the application of network coding in wireless communication networks.published_or_final_versio
Joint Congestion Control and Scheduling in Wireless Networks with Network Coding
published_or_final_versio
Decoding Delay Minimization in Inter-Session Network Coding
Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients over a wireline overlay network. We propose a novel framework for efficient rate allocation in networks where intermediate network nodes have the opportunity to combine packets from different sources using randomized network coding. We formulate the problem as the minimization of the average decoding delay in the client population and solve it with a gradient-based stochastic algorithm. Our optimized inter-session network coding solution is evaluated in different network topologies and is compared with basic intra-session network coding solutions. Our results show the benefits of proper coding decisions and effective rate allocation for lowering the decoding delay when the network is used by concurrent multicast sessions
Content Distribution by Multiple Multicast Trees and Intersession Cooperation: Optimal Algorithms and Approximations
In traditional massive content distribution with multiple sessions, the
sessions form separate overlay networks and operate independently, where some
sessions may suffer from insufficient resources even though other sessions have
excessive resources. To cope with this problem, we consider the universal
swarming approach, which allows multiple sessions to cooperate with each other.
We formulate the problem of finding the optimal resource allocation to maximize
the sum of the session utilities and present a subgradient algorithm which
converges to the optimal solution in the time-average sense. The solution
involves an NP-hard subproblem of finding a minimum-cost Steiner tree. We cope
with this difficulty by using a column generation method, which reduces the
number of Steiner-tree computations. Furthermore, we allow the use of
approximate solutions to the Steiner-tree subproblem. We show that the
approximation ratio to the overall problem turns out to be no less than the
reciprocal of the approximation ratio to the Steiner-tree subproblem.
Simulation results demonstrate that universal swarming improves the performance
of resource-poor sessions with negligible impact to resource-rich sessions. The
proposed approach and algorithm are expected to be useful for
infrastructure-based content distribution networks with long-lasting sessions
and relatively stable network environment
- …