Proceedings Article10.1109/CDC.2007.4434958
Distributed optimization in wireless networks using broadcast advantage
Tao Cui,Lijun Chen,Tracey Ho +2 more
- 09 Mar 2007
- pp 5839-5844
32
TL;DR: This paper considers cross layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links, and proposes locally greedy and randomized approximation algorithms, shown to have bounded worst-case performance.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
TL;DR: In this article, a new algorithm for maximum weighted matching in general edge-weighted graphs is presented, which calculates a matching with an edge weight of at least one-half of the edge weight for a maximum weighted match.
197
Dynamic Algorithms for Multicast With Intra-Session Network Coding
Tracey Ho,Harish Viswanathan +1 more
TL;DR: In this paper, the authors considered the problem of multiple multicast sessions with intra-session network coding in time-varying networks and proposed dynamic algorithms for multicast routing, network coding, power allocation, session scheduling, and rate allocation across correlated sources.
Scheduling for network-coded multicast
TL;DR: The optimal algorithm improves performance by up to a factor of two over widely used techniques such as orthogonal or two-hop-constrained scheduling, and the decentralized algorithm is shown to buy its distributed operation with some throughput losses.
50
Lifetime maximization routing with network coding in wireless multihop networks
TL;DR: The results show that the lifetime can be improved significantly by using network coding, and the performance gain of network coding decreases with the increase of flow asymmetry and the power control ability.
21
Universal opportunistic routing scheme using network coding
Abdallah Khreishah,Issa Khalil,Jie Wu +2 more
- 18 Jun 2012
TL;DR: This paper proposes the idea of performing network coding on the feedback messages and shows that if the intermediate node waits until receiving only one feedback message from each next-hop node, the optimal level of network coding redundancy can be computed in a distributed manner.
19
References
On achieving maximum multicast throughput in undirected networks
TL;DR: The theoretical and simulation results conclude that, network coding may not be instrumental to achieve better maximum multicast rates in most cases; rather, it facilitates the design of significantly more efficient algorithms to achieve such optimality.
137
Distributed utility maximization for network coding based multicasting: a shortest path approach
Yunnan Wu,Sun-Yuan Kung +1 more
TL;DR: This paper gives a novel reformulation of the optimization problem, which has a separable structure, and proposes the proximal method, which solves a sequence of well-conditioned problems obtained from the original problem by adding quadratic regularization terms.
Crosslayer design for distributed MAC and network coding in wireless ad hoc networks
Yalin E. Sagduyu,Anthony Ephremides +1 more
- 31 Oct 2005
TL;DR: This paper addresses the joint design and distributed implementation of medium access control (MAC) and network coding in wireless ad hoc networks and follows an alternative approach of joint wireless network coding and link scheduling with a distributed implementation.
49
Rate Control for Multicast with Network Coding
Lijun Chen,Tracey Ho,Steven H. Low,Mung Chiang,John Doyle +4 more
- 22 Sep 2006
TL;DR: This paper develops two adaptive rate control algorithms for the networks with given coding subgraphs and without given codingSubgraphs, respectively, and proves that the proposed algorithms converge to the globally optimal solutions.
•Book
Randomized Algorithms
Rajeev Motwani,Prabhakar Raghavan +1 more
- 01 Jan 1995
TL;DR: This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.