2015
DOI: 10.1155/2015/686189
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Resource allocation is expected to be a most important factor especially for heterogeneous applications in wireless ad hoc networks. In this paper, a novel heterogeneous resource allocation algorithm (HRA) is presented for ad hoc networks, supporting both elastic and inelastic traffic. First, by combining the first order Lagrangian method with pseudo utility, the original nonconvex problem is converted into a new convex one. Then, we successfully solve the heterogeneous problem with the dual-based decompositio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 35 publications
(60 reference statements)
0
2
0
Order By: Relevance
“…When the algorithm reaches a stable state, denoted as (17) At the stable state, the associated utility U s of source s is equal to…”
Section: Lemma 1 [28] Considering a Mapping U Defined Bymentioning
confidence: 99%
See 1 more Smart Citation
“…When the algorithm reaches a stable state, denoted as (17) At the stable state, the associated utility U s of source s is equal to…”
Section: Lemma 1 [28] Considering a Mapping U Defined Bymentioning
confidence: 99%
“…Their max-min fair flow control algorithms are hence impractical from an engineering point of view. Furthermore, in order to cope with different users with different QoS requirements, a new criterion named utility max-min fairness is initially proposed in [15] and later on comes various bandwidth allocation algorithms [16,17]. Particularly in [15], the links require the information of utility functions from all the traversed sources, which makes network implementation difficult.…”
Section: Introductionmentioning
confidence: 99%