QQ客服 官方微博 反馈留言

	Distributed Coalition Formation of Relay and Friendly Jammers for Secure Cooperative Networks
	Zhang, Rongqing ; Song, Lingyang ; Han, Zhu ; Jiao, Bingli
	2011
关键词	WIRE-TAP CHANNEL SELECTION
英文摘要	In this paper, we investigate cooperation of conventional relays and friendly jammers subject to secrecy constraints for cooperative networks consisting of one source, one corresponding destination, one malicious eavesdropper, and several intermediate nodes. In order to obtain a higher secrecy rate, the source selects one conventional relay and several friendly jammers from the intermediate nodes to assist data transmission, and in return, it needs to make a payment. Each intermediate node here has two possible identities to choose, i.e., to be a conventional relay or a friendly jammer, which results in a direct impact on the final utility of the intermediate node. After the intermediate nodes determine their identities, they seek to find optimal partners forming coalitions, which improves their chances to be selected by the source and thus to obtain the payoffs in the end. We formulate this cooperation as a coalitional game with transferable utility and study its properties. Furthermore, we define a Max-Pareto order for comparison of the coalition value, based on which we employ the merge-and-split rules. We also construct a distributed merge-and-split coalition formation algorithm for the defined coalition formation game. The simulation results verify the efficiency of the proposed coalition formation algorithm.; Engineering, Electrical & Electronic; Telecommunications; EI; CPCI-S(ISTP); 0
语种	英语
DOI标识	10.1109/icc.2011.5962513
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/293093]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhang, Rongqing,Song, Lingyang,Han, Zhu,et al. Distributed Coalition Formation of Relay and Friendly Jammers for Secure Cooperative Networks. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。