2010
DOI: 10.1109/tvt.2009.2038478
|View full text |Cite
|
Sign up to set email alerts
|

Fair Bandwidth Allocation in Wireless Mesh Networks With Cognitive Radios

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 47 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…To maximize throughput, the total bandwidth allocated to non gateway nodes is as large as possible and, to provide fairness, the allocated bandwidth is as even as possible. This solution was later adapted in [19] for CWMNs. Instead of allocating bandwidth to routes, our solution schedules channel access of all MPs, including gateways, to prevent bandwidth wastage and improve throughput.…”
Section: Schedulingmentioning
confidence: 99%
“…To maximize throughput, the total bandwidth allocated to non gateway nodes is as large as possible and, to provide fairness, the allocated bandwidth is as even as possible. This solution was later adapted in [19] for CWMNs. Instead of allocating bandwidth to routes, our solution schedules channel access of all MPs, including gateways, to prevent bandwidth wastage and improve throughput.…”
Section: Schedulingmentioning
confidence: 99%
“…Subcarrier and power allocation optimization is formulated as a multi-dimensional 0-1 knapsack problem (MDKP) and a greedy max-min algorithm is proposed to solve it. In [11], two fair bandwidth-allocation problems based on a simple max-min fairness model and lexicographical max-min (LMM) fairness model are proposed to achieve the tradeoff between fairness and throughput in wireless mesh networks. In [12], two distributed algorithms to optimally allocate subcarriers and power in OFDMA ad hoc cognitive radio network have been proposed to offer either throughput maximization or energy efficiency subject to tolerable interference introduced to the primary network, and a joint subcarrier and power allocation method has been derived by Lagrange dual algorithm to maximize the capacity of the cognitive radio networks.…”
Section: Related Workmentioning
confidence: 99%
“…where 0 N is the one-side PSD of AWGN. To sum up, the total interferences to th m PU on subcarrier k introduced by th n source node can be expressed as (11) where k  is the probability that a subcarrier k is truly occupied. Given that the cognitive network identified subcarrier k is vacant, k  can be expressed as…”
Section: Problem Formulationmentioning
confidence: 99%
“…The literature on cooperative communication mostly emphasizes fair allocation of bandwidth [16,17], optimal allocation of power [6,[18][19][20][21] or energy efficiency of the network [3,22]. However, the physical layer fairness measured by fair dissipation of the battery power of the relays taking part in the cooperation has not been thoroughly addressed [23,24].…”
Section: Introductionmentioning
confidence: 99%