Sciweavers

97 search results - page 9 / 20
» On Capacity Scaling in Arbitrary Wireless Networks
Sort
View
TON
2010
279views more  TON 2010»
13 years 6 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh
CORR
2011
Springer
185views Education» more  CORR 2011»
12 years 11 months ago
Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
Chun-Hung Liu, Jeffrey G. Andrews
ICC
2009
IEEE
116views Communications» more  ICC 2009»
13 years 5 months ago
Network Coding Does Not Change the Multicast throughput Order of Wireless Ad Hoc Networks
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpou...
LCN
2006
IEEE
14 years 1 months 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
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...