Sciweavers

1687 search results - page 112 / 338
» On the complexity of scheduling in wireless networks
Sort
View
TON
2010
118views more  TON 2010»
15 years 1 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
GLOBECOM
2008
IEEE
16 years 24 days ago
QoS Routing in Wireless Mesh Networks with Cognitive Radios
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
Roberto Hincapie, Jian Tang, Guoliang Xue, Roberto...
AINA
2007
IEEE
16 years 20 days ago
How to Study Wireless Mesh Networks: A hybrid Testbed Approach
— Simulation is the most famous way to study wireless an mobile networks since they offer a convenient combination of flexibility and controllability. However, their largest dis...
Alexander Zimmermann, Mesut Günes, Martin Wen...
ICNP
2000
IEEE
15 years 10 months ago
A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
Haiyun Luo, Songwu Lu
WIOPT
2010
IEEE
15 years 4 months ago
Optimal slotted random access in coded wireless packet networks
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
Maximilian Riemensberger, Michael Heindlmaier, And...