• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Trust-based Relay Selection in Relay-based Networks

Vol. 6, No. 10, October 28, 2012
10.3837/tiis.2012.10.008, Download Paper (Free):


It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.


Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article

[IEEE Style]
D. Wu, G. Zhu, L. Zhu and B. Ai, "Trust-based Relay Selection in Relay-based Networks," KSII Transactions on Internet and Information Systems, vol. 6, no. 10, pp. 2587-2600, 2012. DOI: 10.3837/tiis.2012.10.008.

[ACM Style]
Di Wu, Gang Zhu, Li Zhu, and Bo Ai. 2012. Trust-based Relay Selection in Relay-based Networks. KSII Transactions on Internet and Information Systems, 6, 10, (2012), 2587-2600. DOI: 10.3837/tiis.2012.10.008.

[BibTeX Style]
@article{tiis:20194, title="Trust-based Relay Selection in Relay-based Networks", author="Di Wu and Gang Zhu and Li Zhu and Bo Ai and ", journal="KSII Transactions on Internet and Information Systems", DOI={10.3837/tiis.2012.10.008}, volume={6}, number={10}, year="2012", month={October}, pages={2587-2600}}