English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study the performance of greedy scheduling in multihopwireless networks, where the objective is aggregate utility maximization.Following standard approaches, we consider the dual of the originaloptimization problem. The dual can be solved optimally, only with the knowledgeof the maximal independent sets in the network. But computation of maximalindependent sets is known to be NP-hard. Motivated by this, we propose adistributed greedy heuristic to address the problem of link scheduling. Weevaluate the effect of the distributed greedy heuristic on aggregate utilitymaximization in detail, for the case of an arbitrary graph. We provide someinsights into the factors affecting aggregate utility maximization in anetwork, by providing bounds on the same. We give simulation results for theapproximate aggregate utility maximization achieved under distributedimplementation of the greedy heuristic and find them close to the maximumaggregate utility obtained using optimal scheduling.

Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling