Enforce truth-telling in wireless relay networks for secure communication

Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao
{"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}
引用次数: 4

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在无线中继网络中加强真实信息的传递,以确保通信安全
保证数据传输的安全性是无线中继网络的重要问题之一。本文考虑一个由一个源节点、一个目的节点、一个窃听节点和多个中继节点组成的协作网络。具体来说,信号源选择多个中继节点帮助将信号转发到相应的目的地,以达到最佳的安全性能。然而,中继节点可能有动机不报告其真实的私有信道信息,以获得更多的被选择的机会,并从源获得更多的回报。我们在网络中采用了一种自我执行的真相告知机制来解决这个作弊问题。通过在每个中继节点的总收益中增加一个转移收益,我们证明了每个中继节点只有在向源说出真相时才能获得最大的期望收益。从而达到网络的最优保密能力。仿真结果验证了该机构的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A robust controller of dynamic networks and its verification by the simulation of the heat shock response network with reliable signal transmission An energy-aware distributed approach for content and network management Lightweight privacy-preserving routing and incentive protocol for hybrid ad hoc wireless network Cooperative spectrum sensing in TV White Spaces: When Cognitive Radio meets Cloud A Reservation-based Smart Parking System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1