Local Greedy Approximation for Scheduling in Multihop Wireless Networks
Cited 0 times inCited 7 times in
- Local Greedy Approximation for Scheduling in Multihop Wireless Networks
- Joo, Changhee; Shroff, Ness B.
- Distributed greedy algorithms; Distributed scheduling; Distributed systems; Global ordering; greedy algorithm; Greedy approximation; Low-complexity; Multihop wireless network; Network settings; Practical implementation; Scheduling schemes; Suboptimal scheduling; Wireless scheduling
- Issue Date
- IEEE COMPUTER SOC
- IEEE TRANSACTIONS ON MOBILE COMPUTING, v.11, no.3, pp.414 - 426
- In recent years, there has been a significant amount of work done in developing low-complexity scheduling schemes to achieve high performance in multihop wireless networks. A centralized suboptimal scheduling policy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. However, its distributed realization requires high complexity, which becomes a major obstacle for practical implementation. In this paper, we develop simple distributed greedy algorithms for scheduling in multihop wireless networks. We reduce the complexity by relaxing the global ordering requirement of GMS, up to near zero. Simulation results show that the new algorithms approximate the performance of GMS, and outperform the state-of-the-art distributed scheduling policies.
- ; Go to Link
Appears in Collections:
- ECE_Journal Papers
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.