Sciweavers

2149 search results - page 232 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
134
Voted
WIOPT
2006
IEEE
15 years 7 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
IWCMC
2006
ACM
15 years 7 months ago
DSMA: an access method for MIMO ad hoc networks based on distributed scheduling
In this work, we analyze the effects of a distributed transmission coordination scheme that is particularly suited for ad hoc networks with the ability to exploit spatially–mult...
Paolo Casari, Marco Levorato, Michele Zorzi
ICASSP
2010
IEEE
15 years 1 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
SIGCOMM
2012
ACM
13 years 4 months ago
Mirror mirror on the ceiling: flexible wireless links for data centers
Modern data centers are massive, and support a range of distributed applications across potentially hundreds of server racks. As their utilization and bandwidth needs continue to ...
Xia Zhou, Zengbin Zhang, Yibo Zhu, Yubo Li, Saipri...
INFOCOM
2007
IEEE
15 years 8 months ago
Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks
— The popularity of IEEE 802.11 WLANs has led to dense deployments in urban areas. High density leads to suboptimal performance unless the interfering networks learn how to optim...
Bruno Kauffmann, François Baccelli, Augusti...