Sciweavers

158 search results - page 9 / 32
» Distributed Throughput Maximization in Wireless Networks via...
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
ICC
2007
IEEE
154views Communications» more  ICC 2007»
14 years 2 months ago
Distributed Adaptive Power Allocation for Wireless Relay Networks
— In this paper, we consider a 2-hop wireless diversity relay network. We explore transmit power allocation among the source and relays to maximize the received signal to noise r...
Yonghui Li, Branka Vucetic, Zhendong Zhou, Mischa ...
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
INFOCOM
2006
IEEE
14 years 1 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
INFOCOM
2002
IEEE
14 years 17 days ago
Downlink Power Allocation for Multi-class CDMA Wireless Networks
Abstract—In this paper we consider the downlink power allocation problem for multi-class CDMA wireless networks. We use a utility based power allocation framework to treat multi-...
Jangwon Lee, Ravi Mazumdar, Ness B. Shroff