Results

**1 - 7**of**7**### A New Paradigm for Multiflow in Wireless Networks: Theory And Applications

"... Abstract—Multiflow problems are one of the most fundamen-tal problems in both wired networks and wireless networks. Due to the cross-layer nature, multiflow problems in wireless networks are significantly harder than their counterparts in wired networks and have received much research interest over ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—Multiflow problems are one of the most fundamen-tal problems in both wired networks and wireless networks. Due to the cross-layer nature, multiflow problems in wireless networks are significantly harder than their counterparts in wired networks and have received much research interest over the past decade. Common to most other early-staged research, the characterization of computational hardness and the “war” on achievable approximation bounds have been the priority to the existing studies of multiflow problems in wireless networks while their practical feasibility in both running time and memory requirement is ignored as long they are polynomial. In fact, almost all of the state-of-the-art approximation algorithms for multiflow problems in wireless networks are all resorted to the traditional linear programming (LP) methods exclusively. However, those traditional LP methods can require an inordinate amount of running time and memory even for a moderate sized input, and consequently they often prove unusable in practice. This paper presents a completely new paradigm for multiflow problems in general wireless networks which is radically different from the prevailing LP-based paradigm, and develops practical algorithmic solutions which are much faster and simpler. I.

### Maximizing Wireless Network Capacity with Linear Power: Breaking The Logarithmic Barrier

"... Abstract—Maximizing the wireless network capacity under physical interference model is notoriously hard due to the non-locality and the additive nature of the wireless interference under the physical interference model. This problem has been extensively studied recently with the achievable approxima ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—Maximizing the wireless network capacity under physical interference model is notoriously hard due to the non-locality and the additive nature of the wireless interference under the physical interference model. This problem has been extensively studied recently with the achievable approximation bounds progressively improved from the linear factor to log-arithmic factor. It has been a major open problem whether there exists a constant-approximation approximation algorithm for maximizing the wireless network capacity under the physical interference model. In this paper, we improve the status quo for the case of linear transmission power assignment, which is widely adopted due to its advantage of energy conservation. By exploring and exploiting the rich nature of the wireless inter-ference with the linear power assignment, we develop constant-approximation algorithms for maximizing the wireless network capacity with linear transmission power assignment under the physical interference model, in both the unidirectional mode and the bidirectional mode. Index Terms—Link scheduling, physical interference, approx-imation algorithms. I.

### 2012 Proceedings IEEE INFOCOM Maximizing Capacity with Power Control under Physical Interference Model in Duplex Mode

"... Abstract—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the duplex (i.e. bidirectional) mode. For the special setting in which all nodes have unlimited maximum ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the duplex (i.e. bidirectional) mode. For the special setting in which all nodes have unlimited maximum transmission power, Halldorsson and Mitra [5] developed an approximation algorithm with a huge constant approximation bound. For the general setting in which all nodes have bounded maximum transmission power, the existence of constant approximation algorithm remains open. In this paper, we resolve this open problem by developing an approximation algorithm which not only works for the general setting of bounded maximum transmission power, but also has a much smaller constant approximation bound. Index Terms—Link scheduling, physical interference, approximation algorithms. I.

### Optimal Data Dissemination in Stochastic and Arbitrary Wireless Networks

, 2012

"... Data dissemination among wireless devices is an essential application in wire-less networks. In contrast to its wired counterparts which have more stable network settings, wireless networks are subject to network dynamics, such as variable network topology, channel availability and capacity, which a ..."

Abstract
- Add to MetaCart

(Show Context)
Data dissemination among wireless devices is an essential application in wire-less networks. In contrast to its wired counterparts which have more stable network settings, wireless networks are subject to network dynamics, such as variable network topology, channel availability and capacity, which are due to user mobility, signal collision, random channel fading and scattering, etc. Network dynamics complicate the protocol design for optimal data dissemi-nations. Although the topic has been intensively discussed for many years, existing solutions are still not completely satisfactory, especially for stochastic or arbitrary networks. In this thesis, we address optimal data dissemination in both stochastic and arbitrary wireless networks, using techniques of Lya-punov optimization, graph theory, network coding, multi-resolution coding and successive interference cancellation. We first discuss the maximization of time-averaged throughput utility over a long run for unicast and multirate multicast, respectively, in stochastic wireless networks without probing into the future. For multi-session unicast communi-

### Link Scheduling for Throughput Maximization in Multihop Wireless Networks Under Physical Interference

"... ar ..."