817 search results - page 30 / 164 » Mobility-Driven Scheduling in Wireless Networks |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
VTC
2006
IEEE
14 years 2 months ago
2006
IEEE
— We propose a new multicast scheduling scheme which can achieve the proportional fair (PF) allocation in the wireless cellular systems. In case of multicast, the scheduler in th...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Sensor networks with a large amount of sensor nodes usually have high redundancy in sensing coverage. The network lifetime can be further extended by proper scheduling and putt...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
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...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...