Sahasrabudhe, Nachiket and Kuri, Joy (2009) Distributed Scheduling for Multi-Hop Wireless Networks. In: 1st International Conference on Communication Systems and Networks, Jan 05-10, 2009, Bangalore, India., pp. 278-285.
pdf.pdf - Published Version
Restricted to Registered users only
Download (2222Kb) | 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. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2009 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:||10 Aug 2009 09:48|
|Last Modified:||19 Sep 2010 05:40|
Actions (login required)