Sciweavers

577 search results - page 4 / 116
» Throughput Scaling of Wireless Networks With Random Connecti...
Sort
View
INFOCOM
2008
IEEE
14 years 20 days ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
CN
2008
100views more  CN 2008»
13 years 6 months ago
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
Arzad Alam Kherani, Ralph El Khoury, Rachid El Azo...
INFOCOM
2010
IEEE
13 years 4 months ago
Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
Yan Gao, Zheng Zeng, P. R. Kumar
TMC
2012
11 years 8 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le
LCN
2006
IEEE
14 years 8 days ago
Clustered Mobility Model for Scale-Free Wireless Networks
— Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free power-law connectivity distribution and a few densely...
Sunho Lim, Chansu Yu, Chita R. Das