85 search results - page 3 / 17 » Improved bounds on the throughput efficiency of greedy maxim... |
MOBIHOC
2010
ACM
13 years 2 months ago
2010
ACM
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
INFOCOM
2010
IEEE
13 years 1 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
ICNP
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper describes scheduling algorithms for scheduling traffic in wireless data networks with multiple channels per cell. The paper assumes that a reservation-based MAC protoco...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...