Sciweavers

165 search results - page 8 / 33
» Capacity of Asynchronous Random-Access Scheduling in Wireles...
Sort
View
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
14 years 2 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
PIMRC
2008
IEEE
14 years 2 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
IPSN
2007
Springer
14 years 1 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
VTC
2007
IEEE
192views Communications» more  VTC 2007»
14 years 1 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...