2017
DOI: 10.1109/cc.2017.8246338
|View full text |Cite
|
Sign up to set email alerts
|

Energy efficient constrained shortest path first-based joint resource allocation and route selection for multi-hop CRNs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…In order to obtain the maximum value of P i , s , the fractional programming problem P2 can be equivalent to Dinkelbach’s method [ 26 ]: where η is a non-negative parameter. When f ( η * ) = 0, the energy efficiency function reaches its maximum value.…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…In order to obtain the maximum value of P i , s , the fractional programming problem P2 can be equivalent to Dinkelbach’s method [ 26 ]: where η is a non-negative parameter. When f ( η * ) = 0, the energy efficiency function reaches its maximum value.…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…At present, some related studies have implemented a route policy in multi-hop CRNs [5]- [9]. Khalife et al [7] proposed three separate routing scheme categories.…”
Section: A Related Workmentioning
confidence: 99%