期刊文献+

A Safety Relay Selection Method Based on Network Coding

A Safety Relay Selection Method Based on Network Coding
下载PDF
导出
摘要 A method of cooperative relay selection based on network coding security is proposed for relay selection problem of cooperative communication system security in networked multi-relay scenarios, which is different from the existing relay node selection method. The algorithm not only merged with timestamp and homomorphic signature to construct the node degree of safety to find reliable relay, at the same time to considers the received signal to noise ratio at all relay nodes value and the channel gain to the source node. The simulation results show that the proposed method can improve the achievable rate of the destination node and reduce the outage probability on the basis of guaranteeing the safety of the relay node. A method of cooperative relay selection based on network coding security is proposed for relay selection problem of cooperative communication system security in networked multi-relay scenarios, which is different from the existing relay node selection method. The algorithm not only merged with timestamp and homomorphic signature to construct the node degree of safety to find reliable relay, at the same time to considers the received signal to noise ratio at all relay nodes value and the channel gain to the source node. The simulation results show that the proposed method can improve the achievable rate of the destination node and reduce the outage probability on the basis of guaranteeing the safety of the relay node.
作者 Qiang Guo Xin Li
出处 《International Journal of Communications, Network and System Sciences》 2017年第8期167-175,共9页 通讯、网络与系统学国际期刊(英文)
关键词 TIMESTAMP Homomorphic SIGNATURE NODE Degree of Safety Achievable Rate OUTAGE PROBABILITY Timestamp Homomorphic Signature Node Degree of Safety Achievable Rate Outage Probability
  • 相关文献

参考文献3

二级参考文献32

  • 1AHLSWEDE R, CAI N, LI S. Network information flow[J]. IEEE Transactions on Information Flow, 2000, 46(4):1204-1216.
  • 2PERVAIZ M, CARDEI M, WU J. Routing security in ad hoc wireless networks[J]. Network Security, 2010, 117-142.
  • 3HO T, LEONG B, KOETTER R. Byzantine modification detection in multicast networks using randomized network coding[A]. Proceedings of IEEE International Symposium on Information Theory(ISIT)[C]. Massachusetts, USA, 2008. 2798-2803.
  • 4GKANTSIDIS C, RODRIGUEZ E Cooperative security for network coding file distribution[A]. Proceedings of International Conference on Computer 367-380. [M)[C]. Barcelona, Spain, 2006.
  • 5MENEZES A, OKAMOTO T, VANSTONE S. Reducing elliptic curve logorithms to logorithms in a finite field[J]. IEEE Transactions on Information Theory, 1993, 39(5):1639-1646.
  • 6YU Z, WEI Y, RAMKUMAR B. An efficient signature-based scheme for secttdng network coding against pollution attacks[A]. Proceedings of International Conference on Computer Communications (INFOCOM)[C]. Arizona, USA, 2008. 1409-1417.
  • 7GENNARO R, KATZ J, KRAWCZYK H. Secure network coding over the integers[J]. Public Key Cryptography, 2010, 60(56):142-160.
  • 8LIM S H, KIM Y H. Noisy network coding[J]. IEEE Transactions on Information Theory, 2011, 57(5):3132-3152.
  • 9LIM S H, GERLA M, KRAWCZYK H. Performance evaluation of secure network coding using homomorphic signature[A]. Proceedings of International Symposium on Network Coding(NetCod)[C]. Beijing, China, 2011.1-6.
  • 10SUTAR S G, PATIL G A. Privacy management in cloud by making use of homomorphic functions[J]. International Journal of Computer Applications, 2012, 37(2):13-16.

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部