{"title":"二用户二跳x信道的安全自由度","authors":"Bardiya Barari, Pedram Kheirkhah Sangdeh, Bahareh Akhbari","doi":"10.1109/IRANIANCEE.2017.7985367","DOIUrl":null,"url":null,"abstract":"In this paper, Secure Degrees of Freedom (SDoF) of two-user two-hop X-channel is investigated. We consider a situation in this channel in which the transmitters and one of the relays benefit from alternating Channel State Information (CSI) including perfect, delayed and no CSI. In another regime from CSI viewpoint, we consider blind transmitters alongside a relay having access to alternating CSI, and there exists feedback from one of the receivers to the relay. For this situation, we also study the case in which the receivers are permitted to cooperatively play a part in ensuring secrecy. Corresponding to each case, we drive an upper bound on SDoF and devise a scheme which successfully obtains the upper bound. So, we present the optimal SDoF and achievable schemes for all considered cases.","PeriodicalId":161929,"journal":{"name":"2017 Iranian Conference on Electrical Engineering (ICEE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secure Degrees of Freedom of two-user two-hop X-channel\",\"authors\":\"Bardiya Barari, Pedram Kheirkhah Sangdeh, Bahareh Akhbari\",\"doi\":\"10.1109/IRANIANCEE.2017.7985367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, Secure Degrees of Freedom (SDoF) of two-user two-hop X-channel is investigated. We consider a situation in this channel in which the transmitters and one of the relays benefit from alternating Channel State Information (CSI) including perfect, delayed and no CSI. In another regime from CSI viewpoint, we consider blind transmitters alongside a relay having access to alternating CSI, and there exists feedback from one of the receivers to the relay. For this situation, we also study the case in which the receivers are permitted to cooperatively play a part in ensuring secrecy. Corresponding to each case, we drive an upper bound on SDoF and devise a scheme which successfully obtains the upper bound. So, we present the optimal SDoF and achievable schemes for all considered cases.\",\"PeriodicalId\":161929,\"journal\":{\"name\":\"2017 Iranian Conference on Electrical Engineering (ICEE)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Iranian Conference on Electrical Engineering (ICEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRANIANCEE.2017.7985367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Iranian Conference on Electrical Engineering (ICEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANCEE.2017.7985367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Secure Degrees of Freedom of two-user two-hop X-channel
In this paper, Secure Degrees of Freedom (SDoF) of two-user two-hop X-channel is investigated. We consider a situation in this channel in which the transmitters and one of the relays benefit from alternating Channel State Information (CSI) including perfect, delayed and no CSI. In another regime from CSI viewpoint, we consider blind transmitters alongside a relay having access to alternating CSI, and there exists feedback from one of the receivers to the relay. For this situation, we also study the case in which the receivers are permitted to cooperatively play a part in ensuring secrecy. Corresponding to each case, we drive an upper bound on SDoF and devise a scheme which successfully obtains the upper bound. So, we present the optimal SDoF and achievable schemes for all considered cases.