18 search results - page 1 / 4 » A local greedy scheduling scheme with provable performance g... |
MOBIHOC
2008
ACM
14 years 10 months ago
2008
ACM
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
WIOPT
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...