Sciweavers

Share
76 search results - page 1 / 16
» Longest-queue-first scheduling under SINR interference model
Sort
View
MOBIHOC
2009
ACM
10 years 2 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
MOBIHOC
2010
ACM
8 years 11 months ago
Longest-queue-first scheduling under SINR interference model
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...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
SECON
2007
IEEE
9 years 7 months ago
Log-normal shadowing meets SINR: A numerical study of Capacity in Wireless Networks
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
Patrick Stuedi, Gustavo Alonso
TON
2010
127views more  TON 2010»
8 years 8 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
LCN
2008
IEEE
9 years 7 months ago
Modeling of two-flow interactions under SINR model in Multi-hop Wireless Networks
—Carrier Sense Multiple Access (CSMA) protocols in Multi-hop Wireless Networks (MHWN) are known to suffer from different forms of the hidden and exposed terminal problems, leadin...
Saquib Razak, Nael B. Abu-Ghazaleh, Vinay Kolar
books