Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883696
Dongsheng Wei, Konglin Zhu, Xin Wang
Data access is an important and challenging issue in Mobile Social Networks (MSNs), and cooperative caching is an effective technique to improve the access performance. Most of current research efforts in data access of MSNs focus on improving the access performance while neglecting the fair treatment of users. Because fairness is considered as a major incentive for peer-to-peer service especially in infrastructure-less wireless networks, in this paper we propose a novel approach to support fairness aware cooperative caching scheme in MSNs. Through capturing close friend set of each node, we cache data prior at nodes which are overlapped by most nodes' close friend sets. Then we derive the optimal cooperative scheme by using the minimum dominating set, which is an NP-Complete problem, and we design a heuristic algorithm to handle it. Experimental results show that our scheme can effectively improve data access fairness as well as maintain nearly the same access performance compared to existing cooperative caching schemes.
{"title":"Fairness-aware cooperative caching scheme for Mobile Social Networks","authors":"Dongsheng Wei, Konglin Zhu, Xin Wang","doi":"10.1109/ICC.2014.6883696","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883696","url":null,"abstract":"Data access is an important and challenging issue in Mobile Social Networks (MSNs), and cooperative caching is an effective technique to improve the access performance. Most of current research efforts in data access of MSNs focus on improving the access performance while neglecting the fair treatment of users. Because fairness is considered as a major incentive for peer-to-peer service especially in infrastructure-less wireless networks, in this paper we propose a novel approach to support fairness aware cooperative caching scheme in MSNs. Through capturing close friend set of each node, we cache data prior at nodes which are overlapped by most nodes' close friend sets. Then we derive the optimal cooperative scheme by using the minimum dominating set, which is an NP-Complete problem, and we design a heuristic algorithm to handle it. Experimental results show that our scheme can effectively improve data access fairness as well as maintain nearly the same access performance compared to existing cooperative caching schemes.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"48 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114120728","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883912
Chen-Feng Liu, Chia-han Lee
Mobile devices or sensor nodes are usually energy-constrained, and in some scenarios it is inconvenient or impractical to charge or replace batteries. To tackle this problem, the idea of transferring power to mobile devices wirelessly via radio frequency signals has recently gained much attention. In this paper, we consider a point-to-point communication system in which the transferred power is used for the receiver to feedback the quantized channel state information (CSI) to the transmitter, and then the transmitter utilizes the CSI to beamform the signals. Two power and information transfer architectures are considered: time-switching and power splitting. We derive bounds of the average achievable rates under the fading channel.
{"title":"MISO information and power transfer with finite-rate feedback under fading channel","authors":"Chen-Feng Liu, Chia-han Lee","doi":"10.1109/ICC.2014.6883912","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883912","url":null,"abstract":"Mobile devices or sensor nodes are usually energy-constrained, and in some scenarios it is inconvenient or impractical to charge or replace batteries. To tackle this problem, the idea of transferring power to mobile devices wirelessly via radio frequency signals has recently gained much attention. In this paper, we consider a point-to-point communication system in which the transferred power is used for the receiver to feedback the quantized channel state information (CSI) to the transmitter, and then the transmitter utilizes the CSI to beamform the signals. Two power and information transfer architectures are considered: time-switching and power splitting. We derive bounds of the average achievable rates under the fading channel.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114338746","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883813
Jia Chen, Huachun Zhou, Hongke Zhang
Content Centric Networking (CCN) is one of the representative Information Centric Networking (ICN) architectures. In CCN, data objects are accessed instead of end hosts, and each router maintains a large size of routing table consisting of all name prefixes announced by content servers. To improve the scalability of CCN, an alternative name space relating to Router IDentifier (RID) has been proposed for forwarding the interest instead of using the name prefix of data object, and a name mapping system is applied for mapping data objects related names to RID related names. In this paper we propose dynamic interest transmission scheme in CCN with name mapping (DIT-NM), in which interest can be forwarded towards dynamically chosen RID through dynamically chosen interface associated with the RID according to real-time monitoring network status and traffic load information. The performance of the proposed scheme is evaluated using realistic network topologies with respect to latency and network link utilization. We also compare with the basic CCN model and multi-repository single path (MRSP) to highlight the advantages of our scheme. Achieved results demonstrate the effectiveness of the proposed scheme in reducing latency, improving robustness and balancing overall traffic distribution in name-mapping CCN environment.
{"title":"DITNM: Dynamic interest transmission scheme in Content Centric Networking with name mapping","authors":"Jia Chen, Huachun Zhou, Hongke Zhang","doi":"10.1109/ICC.2014.6883813","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883813","url":null,"abstract":"Content Centric Networking (CCN) is one of the representative Information Centric Networking (ICN) architectures. In CCN, data objects are accessed instead of end hosts, and each router maintains a large size of routing table consisting of all name prefixes announced by content servers. To improve the scalability of CCN, an alternative name space relating to Router IDentifier (RID) has been proposed for forwarding the interest instead of using the name prefix of data object, and a name mapping system is applied for mapping data objects related names to RID related names. In this paper we propose dynamic interest transmission scheme in CCN with name mapping (DIT-NM), in which interest can be forwarded towards dynamically chosen RID through dynamically chosen interface associated with the RID according to real-time monitoring network status and traffic load information. The performance of the proposed scheme is evaluated using realistic network topologies with respect to latency and network link utilization. We also compare with the basic CCN model and multi-repository single path (MRSP) to highlight the advantages of our scheme. Achieved results demonstrate the effectiveness of the proposed scheme in reducing latency, improving robustness and balancing overall traffic distribution in name-mapping CCN environment.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251150","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884223
Keerthi Kumar Nagalapur, F. Brannstrom, E. Ström
Vehicular wireless channels are highly time-varying and the pilot pattern in the 802.11p orthogonal frequency-division multiplexing frame has been shown to be ill suited for long data packets. The high frame error rate in off-the-shelf chipsets with noniterative receiver configurations is mostly due to the use of outdated channel estimates for equalization. This paper deals with improving the channel estimation in 802.11p systems using a cross layered approach, where known data bits are inserted in the higher layers and a modified receiver makes use of these bits as training data for improved channel estimation. We also describe a noniterative receiver configuration for utilizing the additional training bits and show through simulations that frame error rates close to the case with perfect channel knowledge can be achieved.
{"title":"On channel estimation for 802.11p in highly time-varying vehicular channels","authors":"Keerthi Kumar Nagalapur, F. Brannstrom, E. Ström","doi":"10.1109/ICC.2014.6884223","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884223","url":null,"abstract":"Vehicular wireless channels are highly time-varying and the pilot pattern in the 802.11p orthogonal frequency-division multiplexing frame has been shown to be ill suited for long data packets. The high frame error rate in off-the-shelf chipsets with noniterative receiver configurations is mostly due to the use of outdated channel estimates for equalization. This paper deals with improving the channel estimation in 802.11p systems using a cross layered approach, where known data bits are inserted in the higher layers and a modified receiver makes use of these bits as training data for improved channel estimation. We also describe a noniterative receiver configuration for utilizing the additional training bits and show through simulations that frame error rates close to the case with perfect channel knowledge can be achieved.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"28 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116459980","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884024
Min Lin, J. Ouyang, Wei-Ping Zhu, Yongming Huang
This paper addresses robust beamforming (BF) design for the uplink transmission of wireless networks, where the base station (BS) equipped with a very large number of antennas communicates with multiple users on the same frequency band simultaneously. Based on the assumption that the wireless channels undergo correlated Rayleigh fading, we first formulate an optimization problem to maximize the output signal-to-interference-plus-noise ratio (SINR) of the intended users. Then, by using the fact that channel uncertainty is norm-bounded and imperfect channel state information (CSI) is available at the BS, we transform the optimization problem to a support vector machine (SVM) regression one, and obtain the robust solution for the BF weight vectors by means of quadratic programming (QP) technique or iterative reweighted least squares (IRWLS) procedure. The computational cost of the proposed robust BF scheme depends on the number of channel vector samples rather than that of the antennas, thus it is suitable for the wireless systems with large-scale antennas. Finally, the efficiency and superiority of the proposed new scheme are confirmed through computer simulation.
{"title":"Robust BF in large-scale antenna systems with imperfect channel state information","authors":"Min Lin, J. Ouyang, Wei-Ping Zhu, Yongming Huang","doi":"10.1109/ICC.2014.6884024","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884024","url":null,"abstract":"This paper addresses robust beamforming (BF) design for the uplink transmission of wireless networks, where the base station (BS) equipped with a very large number of antennas communicates with multiple users on the same frequency band simultaneously. Based on the assumption that the wireless channels undergo correlated Rayleigh fading, we first formulate an optimization problem to maximize the output signal-to-interference-plus-noise ratio (SINR) of the intended users. Then, by using the fact that channel uncertainty is norm-bounded and imperfect channel state information (CSI) is available at the BS, we transform the optimization problem to a support vector machine (SVM) regression one, and obtain the robust solution for the BF weight vectors by means of quadratic programming (QP) technique or iterative reweighted least squares (IRWLS) procedure. The computational cost of the proposed robust BF scheme depends on the number of channel vector samples rather than that of the antennas, thus it is suitable for the wireless systems with large-scale antennas. Finally, the efficiency and superiority of the proposed new scheme are confirmed through computer simulation.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116471244","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883832
K. Walkowiak, A. Kasprzak, M. Klinkowski
In this paper, we focus on issues related to dynamic routing of anycast and unicast traffic demands in Elastic Optical Networks (EONs). The growing interest in cloud computing and content-oriented services triggers the need to examine anycast traffic in the context of the EON concept, which is perceived as a promising approach for future optical transport networks. Anycasting - defined as one-to-one of many transmission - ideally corresponds to concepts of cloud computing and content-oriented services, where the same service/content is available in many, geographically spread data centers. In the paper, we propose two types of algorithms for dynamic routing of anycast and unicast requests. The former algorithm is based on the shortest path first (SPF) method, while the latter algorithm is based on the selection of a routing path from a set of candidate paths (CP). To examine performance of the algorithms, we run simulations using a real pan-European topology and traffic patterns created according to Cisco predictions. The results show a tradeoff between SPF and CP methods in terms of the blocking probability and execution time. Moreover, we observe that the blocking probability depends on the number of data centers placed in the network.
{"title":"Dynamic routing of anycast and unicast traffic in Elastic Optical Networks","authors":"K. Walkowiak, A. Kasprzak, M. Klinkowski","doi":"10.1109/ICC.2014.6883832","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883832","url":null,"abstract":"In this paper, we focus on issues related to dynamic routing of anycast and unicast traffic demands in Elastic Optical Networks (EONs). The growing interest in cloud computing and content-oriented services triggers the need to examine anycast traffic in the context of the EON concept, which is perceived as a promising approach for future optical transport networks. Anycasting - defined as one-to-one of many transmission - ideally corresponds to concepts of cloud computing and content-oriented services, where the same service/content is available in many, geographically spread data centers. In the paper, we propose two types of algorithms for dynamic routing of anycast and unicast requests. The former algorithm is based on the shortest path first (SPF) method, while the latter algorithm is based on the selection of a routing path from a set of candidate paths (CP). To examine performance of the algorithms, we run simulations using a real pan-European topology and traffic patterns created according to Cisco predictions. The results show a tradeoff between SPF and CP methods in terms of the blocking probability and execution time. Moreover, we observe that the blocking probability depends on the number of data centers placed in the network.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"407 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114007998","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884189
Peng Wang, Yonghui Li, Xiaojun Yuan, Lingyang Song, B. Vucetic
In this paper, we study the point-to-point E-band millimeter wave wireless channel with uniform linear antenna arrays (ULAs) deployed at both link ends and present an analytical approach to characterize the channel behavior. We first derive explicit expressions for some channel eigenvalues at certain discrete system settings. The asymptotic behavior and the effective multiplexing distance (EMD) of the E-band channel are then investigated, where the latter is defined as the end-to-end distance at which the channel can support a certain number of spatially independent streams at finite signal-to-noise ratios (SNRs). We analytically show that the EMD for a given number of parallel signal transmissions is mainly determined by the product of the aperture sizes of the transmit and receive ULAs. This finding provides useful insights into the design of practical multi-gigabits wireless communication systems over E-band.
{"title":"Millimeter wave wireless transmissions at E-band channels with uniform linear antenna arrays: Beyond the Rayleigh distance","authors":"Peng Wang, Yonghui Li, Xiaojun Yuan, Lingyang Song, B. Vucetic","doi":"10.1109/ICC.2014.6884189","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884189","url":null,"abstract":"In this paper, we study the point-to-point E-band millimeter wave wireless channel with uniform linear antenna arrays (ULAs) deployed at both link ends and present an analytical approach to characterize the channel behavior. We first derive explicit expressions for some channel eigenvalues at certain discrete system settings. The asymptotic behavior and the effective multiplexing distance (EMD) of the E-band channel are then investigated, where the latter is defined as the end-to-end distance at which the channel can support a certain number of spatially independent streams at finite signal-to-noise ratios (SNRs). We analytically show that the EMD for a given number of parallel signal transmissions is mainly determined by the product of the aperture sizes of the transmit and receive ULAs. This finding provides useful insights into the design of practical multi-gigabits wireless communication systems over E-band.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114818276","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883484
W. Ellens, M. Mandjes, D. Worm, H. V. D. Berg
For effective capacity management in access networks, it is essential to have a good insight in the service quality perceived by the users. As users share the service capacity available, one would want to know how the achieved per-user throughput fluctuates over time. In this paper we present a novel method that assesses the per-user throughput performance on the basis of throughput measurements at equidistant points in time. Our method relies on a queueing-theoretic framework, and allows us to explicitly quantify various statistics concerning the minimum per-user throughput obtained in a sample period, given the measured per-user throughput at the end points of that sample period, as well as the measured utilization during the interval. In an extensive numerical study we show the impact of important system parameters on these statistics. In addition, using illustrative examples, we demonstrate how the developed method can be used in practice for capacity management, with a specific focus on applications in cable access networks, an application for which our approach is particularly suitable.
{"title":"The effectiveness of throughput sampling for capacity management: A queueing approach","authors":"W. Ellens, M. Mandjes, D. Worm, H. V. D. Berg","doi":"10.1109/ICC.2014.6883484","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883484","url":null,"abstract":"For effective capacity management in access networks, it is essential to have a good insight in the service quality perceived by the users. As users share the service capacity available, one would want to know how the achieved per-user throughput fluctuates over time. In this paper we present a novel method that assesses the per-user throughput performance on the basis of throughput measurements at equidistant points in time. Our method relies on a queueing-theoretic framework, and allows us to explicitly quantify various statistics concerning the minimum per-user throughput obtained in a sample period, given the measured per-user throughput at the end points of that sample period, as well as the measured utilization during the interval. In an extensive numerical study we show the impact of important system parameters on these statistics. In addition, using illustrative examples, we demonstrate how the developed method can be used in practice for capacity management, with a specific focus on applications in cable access networks, an application for which our approach is particularly suitable.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114836770","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883733
S. Samarakoon, M. Bennis, W. Saad, M. Latva-aho
The design of energy-efficient mechanisms is one of the key challenges in emerging wireless small cell networks. In this paper, a novel approach for opportunistically switching ON/OFF base stations to improve the energy efficiency in wireless small cell networks is proposed. The proposed approach enables the small cell base stations to optimize their downlink performance while balancing the load among each another, while satisfying their users' quality-of-service requirements. The problem is formulated as a noncooperative game among the base stations that seek to minimize a cost function which captures the tradeoff between energy expenditure and load. To solve this game, a distributed learning algorithm is proposed using which the base stations autonomously choose their optimal transmission strategies. Simulation results show that the proposed approach yields significant performance gains in terms of reduced energy expenditures up to 23% and reduced load up to 40% compared to conventional approaches.
{"title":"Opportunistic sleep mode strategies in wireless small cell networks","authors":"S. Samarakoon, M. Bennis, W. Saad, M. Latva-aho","doi":"10.1109/ICC.2014.6883733","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883733","url":null,"abstract":"The design of energy-efficient mechanisms is one of the key challenges in emerging wireless small cell networks. In this paper, a novel approach for opportunistically switching ON/OFF base stations to improve the energy efficiency in wireless small cell networks is proposed. The proposed approach enables the small cell base stations to optimize their downlink performance while balancing the load among each another, while satisfying their users' quality-of-service requirements. The problem is formulated as a noncooperative game among the base stations that seek to minimize a cost function which captures the tradeoff between energy expenditure and load. To solve this game, a distributed learning algorithm is proposed using which the base stations autonomously choose their optimal transmission strategies. Simulation results show that the proposed approach yields significant performance gains in terms of reduced energy expenditures up to 23% and reduced load up to 40% compared to conventional approaches.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127586364","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 : 2014-06-10DOI: 10.1109/ICC.2014.6884088
Yan Yan, G. Xie, Hao Huang, M. Lavery, N. Ahmed, C. Bao, Yongxiong Ren, A. Molisch, M. Tur, M. Padgett, A. Willner
This paper reports an experimental demonstration of modal multiplexing using orbital angular momenta (OAM) in the millimeter-wave regime (28 GHz). Using 1 GBaud/s signals with 16-QAM modulation, a data rate of 32 Gbit/s is obtained by employing 4 different OAM modes (l= -3,-1,+1 and +3) on two orthogonal linear polarization states. Without any digital post-processing, the receiver can separate the different data streams since crosstalk among the OAM channels is low: measured to be better than -23dB with a 28 GHz narrowband carrier on a single polarization, and better than -16dB on both polarization states. The bit-error rate (BER) of 8 channels is measured, and found the raw BER is below 3.8×10-3, thus allowing efficient use of forward error correction (FEC) codes.
{"title":"Demonstration of 8-mode 32-Gbit/s millimeter-wave free-space communication link using 4 orbital-angular-momentum modes on 2 polarizations","authors":"Yan Yan, G. Xie, Hao Huang, M. Lavery, N. Ahmed, C. Bao, Yongxiong Ren, A. Molisch, M. Tur, M. Padgett, A. Willner","doi":"10.1109/ICC.2014.6884088","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884088","url":null,"abstract":"This paper reports an experimental demonstration of modal multiplexing using orbital angular momenta (OAM) in the millimeter-wave regime (28 GHz). Using 1 GBaud/s signals with 16-QAM modulation, a data rate of 32 Gbit/s is obtained by employing 4 different OAM modes (l= -3,-1,+1 and +3) on two orthogonal linear polarization states. Without any digital post-processing, the receiver can separate the different data streams since crosstalk among the OAM channels is low: measured to be better than -23dB with a 28 GHz narrowband carrier on a single polarization, and better than -16dB on both polarization states. The bit-error rate (BER) of 8 channels is measured, and found the raw BER is below 3.8×10-3, thus allowing efficient use of forward error correction (FEC) codes.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708398","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
扫码关注我们
求助内容：
应助结果提醒方式：