Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao
{"title":"在无线中继网络中加强真实信息的传递,以确保通信安全","authors":"Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao","doi":"10.1109/INFCOMW.2011.5928786","DOIUrl":null,"url":null,"abstract":"To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Enforce truth-telling in wireless relay networks for secure communication\",\"authors\":\"Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao\",\"doi\":\"10.1109/INFCOMW.2011.5928786\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.\",\"PeriodicalId\":402219,\"journal\":{\"name\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2011.5928786\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2011.5928786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enforce truth-telling in wireless relay networks for secure communication
To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.