Sahasrabudhe, Nachiket and Kuri, Joy (2008) Greedy Scheduling in Multihop Wireless Networks. In: 2nd International Symposium on Advanced Networks and Telecommunication Systems, DEC 15-17, 2008, Mumbai, pp. 73-75.
yu.pdf - Published Version
Restricted to Registered users only
Download (151Kb) | Request a copy
We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology)|
|Date Deposited:||15 Jan 2010 07:24|
|Last Modified:||19 Sep 2010 05:53|
Actions (login required)