Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs
Cooperative communication is shown to be a promising technology to significantly increase the capacity of wireless networks. Due to the competition among multiple source-destination pairs for the same relay node set in the relay assignment problem, each pair may cheat others to achieve a more indivi...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi - SAGE Publishing
2012-11-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2012/345316 |
_version_ | 1797721893415944192 |
---|---|
author | Gang Liu Liusheng Huang Yu-e Sun Hongli Xu He Huang Xueyong Xu |
author_facet | Gang Liu Liusheng Huang Yu-e Sun Hongli Xu He Huang Xueyong Xu |
author_sort | Gang Liu |
collection | DOAJ |
description | Cooperative communication is shown to be a promising technology to significantly increase the capacity of wireless networks. Due to the competition among multiple source-destination pairs for the same relay node set in the relay assignment problem, each pair may cheat others to achieve a more individual revenue. However, the cheating behavior may decrease the overall performance of the network greatly. Thus, there is a challenge for designing a truthful protocol that maximizes a pair's payoff only when this pair reveals its true individual information. In this paper, we propose a relay assignment protocol (RA-VCG) for cooperative communication to maximize the total social value (i.e., the total true value of all pairs) while guaranteeing truthfulness in an auction-theoretic sense by charging each pair an extra payment. Specially, RA-VCG implements a variation of the well-known VCG mechanism for the truthful relay assignment problem in the network with selfish source-destination pairs. Then, we prove the validity of this protocol and also show several surprising properties (such as no positive transfer and individual rationality) associated with this protocol. The simulation results show that the total social value achieved when each node takes untruthfully is about 23.3% less than that achieved when nodes behave truthfully. |
first_indexed | 2024-03-12T09:40:40Z |
format | Article |
id | doaj.art-fb6083ae00064d17bef5abe6b926cbd1 |
institution | Directory Open Access Journal |
issn | 1550-1477 |
language | English |
last_indexed | 2024-03-12T09:40:40Z |
publishDate | 2012-11-01 |
publisher | Hindawi - SAGE Publishing |
record_format | Article |
series | International Journal of Distributed Sensor Networks |
spelling | doaj.art-fb6083ae00064d17bef5abe6b926cbd12023-09-02T13:20:35ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772012-11-01810.1155/2012/345316Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination PairsGang Liu0Liusheng Huang1Yu-e Sun2Hongli Xu3He Huang4Xueyong Xu5 Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China School of Urban Rail Transportation, Soochow University, Suzhou 215100, China Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, ChinaCooperative communication is shown to be a promising technology to significantly increase the capacity of wireless networks. Due to the competition among multiple source-destination pairs for the same relay node set in the relay assignment problem, each pair may cheat others to achieve a more individual revenue. However, the cheating behavior may decrease the overall performance of the network greatly. Thus, there is a challenge for designing a truthful protocol that maximizes a pair's payoff only when this pair reveals its true individual information. In this paper, we propose a relay assignment protocol (RA-VCG) for cooperative communication to maximize the total social value (i.e., the total true value of all pairs) while guaranteeing truthfulness in an auction-theoretic sense by charging each pair an extra payment. Specially, RA-VCG implements a variation of the well-known VCG mechanism for the truthful relay assignment problem in the network with selfish source-destination pairs. Then, we prove the validity of this protocol and also show several surprising properties (such as no positive transfer and individual rationality) associated with this protocol. The simulation results show that the total social value achieved when each node takes untruthfully is about 23.3% less than that achieved when nodes behave truthfully.https://doi.org/10.1155/2012/345316 |
spellingShingle | Gang Liu Liusheng Huang Yu-e Sun Hongli Xu He Huang Xueyong Xu Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs International Journal of Distributed Sensor Networks |
title | Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs |
title_full | Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs |
title_fullStr | Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs |
title_full_unstemmed | Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs |
title_short | Truthful Relay Assignment for Cooperative Communication in Wireless Networks with Selfish Source-Destination Pairs |
title_sort | truthful relay assignment for cooperative communication in wireless networks with selfish source destination pairs |
url | https://doi.org/10.1155/2012/345316 |
work_keys_str_mv | AT gangliu truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs AT liushenghuang truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs AT yuesun truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs AT honglixu truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs AT hehuang truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs AT xueyongxu truthfulrelayassignmentforcooperativecommunicationinwirelessnetworkswithselfishsourcedestinationpairs |