2012
DOI: 10.1007/s11276-012-0421-8
|View full text |Cite
|
Sign up to set email alerts
|

Optimal reliable relay selection in multiuser cooperative relaying networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…Also, ARSL-V can prevent malicious vehicles from getting specific weights distribution through trial-and-error. Different from the schemes [14,15,31,32], ARSL-V can also effectively mitigate on-off attacks and collusion attacks caused by potentially malicious vehicles bypassing the assessment mechanism by acquiring the reputation variability and historical behaviors of different vehicles. And, we also set a sliding time window to prevent malicious vehicles from manipulating reputation at low cost through intelligent and dishonest behaviors.…”
Section: Theoretical Analysismentioning
confidence: 99%
See 3 more Smart Citations
“…Also, ARSL-V can prevent malicious vehicles from getting specific weights distribution through trial-and-error. Different from the schemes [14,15,31,32], ARSL-V can also effectively mitigate on-off attacks and collusion attacks caused by potentially malicious vehicles bypassing the assessment mechanism by acquiring the reputation variability and historical behaviors of different vehicles. And, we also set a sliding time window to prevent malicious vehicles from manipulating reputation at low cost through intelligent and dishonest behaviors.…”
Section: Theoretical Analysismentioning
confidence: 99%
“…Furthermore, to improve the overall cooperative transmission success rate and throughput of the system, ARSL-V designs a relay selection method based on the improved K-M algorithm. Compared with other schemes [13,32], ARSL-V can model and optimize the matching based on the constructed weighted bipartite graph, and increase the total number of feasible edges by adding the top label of nodes. This ensures that our scheme can select the appropriate relays when the relay vehicles (R) are greater than, equal to, or less than the target vehicles (T ).…”
Section: Theoretical Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…The stability problems in wireless queueing systems have been studied in m any papers [1,[3][4][5][6][7][8][9][10][11][12][13]16,17,[19][20][21][23][24][25][26][27][29][30][31][32][33][35][36][37][38][39][44][45][46][47][48][49][50][51][52][53][54][55][56][57][58][59][60][61]. However, in m ost of th e research conducted in this area, the goal was to determ ine the optimal resource al...…”
Section: Research M Otivation and T Hesis C Ontributionsmentioning
confidence: 99%