Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217739
Kihong Park, Mohamed-Slim Alouini, Seong-Ho Park, Young-Chai Ko
In this paper, we consider a two-hop relaying network where one source, one destination, and multiple amplify-and-forward (AF) relays equipped with M antennas operate in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor of 1/2 due to half-duplex relaying, we propose a new transmission protocol which combines alternate relaying and inter-relay interference alignment. We prove that the proposed scheme can (i) exploits M degrees of freedom (DOFs) and (ii) perfectly recover the pre-log factor loss if the number of relays is at least six. From our selected numerical results, we show that our proposed scheme gives significant improvement over conventional AF relaying which offers only M/2 DOFs.
{"title":"On the achievable degrees of freedom of alternate MIMO relaying with multiple AF relays","authors":"Kihong Park, Mohamed-Slim Alouini, Seong-Ho Park, Young-Chai Ko","doi":"10.1109/ComNet.2012.6217739","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217739","url":null,"abstract":"In this paper, we consider a two-hop relaying network where one source, one destination, and multiple amplify-and-forward (AF) relays equipped with M antennas operate in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor of 1/2 due to half-duplex relaying, we propose a new transmission protocol which combines alternate relaying and inter-relay interference alignment. We prove that the proposed scheme can (i) exploits M degrees of freedom (DOFs) and (ii) perfectly recover the pre-log factor loss if the number of relays is at least six. From our selected numerical results, we show that our proposed scheme gives significant improvement over conventional AF relaying which offers only M/2 DOFs.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127062303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217745
Abdelkader Lahmadi, Laurent Ciarletta, Alexandre Boeglin, O. Festor
In this work, we present a novel approach to assign monitoring roles in constrained, low power and lossy networks using available local information provided by the routing layer. The resulting monitoring architecture is adaptive taking benefit from the reactivity of the routing protocol when dynamic changes occur due to connectivity or nodes movement. The simulation results reveal that our assignment approach is more efficient, less aggressive and less resources consuming than its competitors.
{"title":"Routing based roles assignment for monitoring 6LowPAN networks","authors":"Abdelkader Lahmadi, Laurent Ciarletta, Alexandre Boeglin, O. Festor","doi":"10.1109/ComNet.2012.6217745","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217745","url":null,"abstract":"In this work, we present a novel approach to assign monitoring roles in constrained, low power and lossy networks using available local information provided by the routing layer. The resulting monitoring architecture is adaptive taking benefit from the reactivity of the routing protocol when dynamic changes occur due to connectivity or nodes movement. The simulation results reveal that our assignment approach is more efficient, less aggressive and less resources consuming than its competitors.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134314443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217740
Yao Song, Mohamed-Slim Alouini
In underlay cognitive radio systems, secondary users (SUs) can share the spectrum with primary users (PUs) as long as the interference caused by SUs to PUs is below a certain threshold. When multiple SUs want to access the channel, multiuser diversity scheme can be applied to maximize the utilization rate of the channel. In this paper, the performance of selective multi user diversity scheme in underlay cognitive radio system is analyzed. We first start with the case in which all SUs have the same average signal-to-noise ratio (SNR). We then treat the more realistic case involving SUs with different average SNRs. Both power control and no power control scenarios are considered for the SUs. Furthermore, we take scheduling fairness into considerations and study a normalized SNR selection scheme in the case that SUs have different average SNRs.
{"title":"On the secondary users opportunistic scheduling with reduced feedback","authors":"Yao Song, Mohamed-Slim Alouini","doi":"10.1109/ComNet.2012.6217740","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217740","url":null,"abstract":"In underlay cognitive radio systems, secondary users (SUs) can share the spectrum with primary users (PUs) as long as the interference caused by SUs to PUs is below a certain threshold. When multiple SUs want to access the channel, multiuser diversity scheme can be applied to maximize the utilization rate of the channel. In this paper, the performance of selective multi user diversity scheme in underlay cognitive radio system is analyzed. We first start with the case in which all SUs have the same average signal-to-noise ratio (SNR). We then treat the more realistic case involving SUs with different average SNRs. Both power control and no power control scenarios are considered for the SUs. Furthermore, we take scheduling fairness into considerations and study a normalized SNR selection scheme in the case that SUs have different average SNRs.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217728
Aymen Boudguiga, M. Laurent-Maknavicius
Nowadays authentication in Wireless Mesh Networks (WMN) refers to the 802.1X authentication methods or a Preshared key authentication, and makes use of certifcates or shared secrets. In wireless environments, the management of certifcates is a cumbersome task as certifcates require deploying a Public Key Infrastructure (PKI) and Certifcation Authorities (CA). They also require defning a certifcate management policy to control the generation, transmission and revocation of certifcates. During the last decade, ID-Based Cryptography (IBC) appeared as a good alternative to PKI. IBC proposes to derive the public key from the node's identity directly thanks to the use of a Private Key Generator (PKG). In this article, we present an authentication method relying on an ID-Based signature and encryption schemes that use the Sakai-Kasahara key construction. The resulted authentication scheme is suitable to IEEE 802.11s mesh networks and resistant to the key escrow attack.
{"title":"An authentication scheme for IEEE 802.11s mesh networks relying on Sakai-Kasahara ID-Based Cryptographic algorithms","authors":"Aymen Boudguiga, M. Laurent-Maknavicius","doi":"10.1109/ComNet.2012.6217728","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217728","url":null,"abstract":"Nowadays authentication in Wireless Mesh Networks (WMN) refers to the 802.1X authentication methods or a Preshared key authentication, and makes use of certifcates or shared secrets. In wireless environments, the management of certifcates is a cumbersome task as certifcates require deploying a Public Key Infrastructure (PKI) and Certifcation Authorities (CA). They also require defning a certifcate management policy to control the generation, transmission and revocation of certifcates. During the last decade, ID-Based Cryptography (IBC) appeared as a good alternative to PKI. IBC proposes to derive the public key from the node's identity directly thanks to the use of a Private Key Generator (PKG). In this article, we present an authentication method relying on an ID-Based signature and encryption schemes that use the Sakai-Kasahara key construction. The resulted authentication scheme is suitable to IEEE 802.11s mesh networks and resistant to the key escrow attack.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121899418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：