Computer Science – Networking and Internet Architecture
Scientific paper
2011-11-29
Computer Science
Networking and Internet Architecture
Because this paper has been submitted at a journal
Scientific paper
In this paper, 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. The dual can be solved optimally, only with the knowledge of the maximal independent sets in the network. But computation of maximal independent sets is known to be NP-hard. Motivated by this, we propose a distributed greedy heuristic to address the problem of link scheduling. We evaluate the effect of the distributed greedy heuristic on aggregate utility maximization in detail, for the case of an arbitrary graph. We provide some insights into the factors affecting aggregate utility maximization in a network, by providing bounds on the same. We give simulation results for the approximate aggregate utility maximization achieved under distributed implementation of the greedy heuristic and find them close to the maximum aggregate utility obtained using optimal scheduling.
Kuri Joy
Sahasrabudhe Nachiket
Sunny Albert
No associations
LandOfFree
Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14800