Sciweavers

1017 search results - page 132 / 204
» A Theory of QoS for Wireless
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 6 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
WISEC
2010
ACM
14 years 3 months ago
On the tradeoff between trust and privacy in wireless ad hoc networks
As privacy moves to the center of attention in networked systems, and the need for trust remains a necessity, an important question arises: How do we reconcile the two seemingly c...
Maxim Raya, Reza Shokri, Jean-Pierre Hubaux
VTC
2007
IEEE
192views Communications» more  VTC 2007»
14 years 3 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...
INFOCOM
2010
IEEE
13 years 7 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
INFOCOM
2010
IEEE
13 years 7 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang