Pub Date : 2014-12-08DOI: 10.1109/GLOCOMW.2014.7063379
Luca Valtulina, M. Karimzadeh, G. Karagiannis, G. Heijenk, A. Pras
Currently most of the mobility management solutions rely on a centralized mobility anchor entity, which is in charge of both mobility-related control plane and user data forwarding. This makes mobility management prone to several performance limitations such as suboptimal routing, low scalability, potential single point of failure and the lack of granularity for the mobility management service. Distributed Mobility Management (DMM) is a mobility management solution that can be applied to overcome these limitations. In this paper we introduce a novel Software Defined Networking (SDN)/OpenFlow based DMM approach that can be applied in virtualized LTE systems. Using NS-3 simulation experiments we show that the introduced approach meets the performance related mobility management requirements.
{"title":"Performance evaluation of a SDN/OpenFlow-based Distributed Mobility Management (DMM) approach in virtualized LTE systems","authors":"Luca Valtulina, M. Karimzadeh, G. Karagiannis, G. Heijenk, A. Pras","doi":"10.1109/GLOCOMW.2014.7063379","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063379","url":null,"abstract":"Currently most of the mobility management solutions rely on a centralized mobility anchor entity, which is in charge of both mobility-related control plane and user data forwarding. This makes mobility management prone to several performance limitations such as suboptimal routing, low scalability, potential single point of failure and the lack of granularity for the mobility management service. Distributed Mobility Management (DMM) is a mobility management solution that can be applied to overcome these limitations. In this paper we introduce a novel Software Defined Networking (SDN)/OpenFlow based DMM approach that can be applied in virtualized LTE systems. Using NS-3 simulation experiments we show that the introduced approach meets the performance related mobility management requirements.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116433721","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-12-08DOI: 10.1109/GLOCOMW.2014.7063613
Junqing Zhang, A. Marshall, Roger Francis Woods, T. Duong
The ability to exchange keys between users is vital in any wireless based security system. A key generation technique which exploits the randomness of the wireless channel is a promising alternative to existing key distribution techniques, e.g., public key cryptography. In this paper, a secure key generation scheme based on the subcarriers' channel responses in orthogonal frequency-division multiplexing (OFDM) systems is proposed. We first implement a time-variant multipath channel with its channel impulse response modelled as a wide sense stationary (WSS) uncorrelated scattering random process and demonstrate that each subcarrier's channel response is also a WSS random process. We then define the X% coherence time as the time required to produce an X% correlation coefficient in the autocorrelation function (ACF) of each channel tap, and find that when all the channel taps have the same Doppler power spectrum, all subcarriers' channel responses has the same ACF as the channel taps. The subcarrier's channel response is then sampled every X% coherence time and quantized into key bits. All the key sequences' randomness is tested using National Institute of Standards and Technology (NIST) statistical test suite and the results indicate that the commonly used sampling interval as 50% coherence time cannot guarantee the randomness of the key sequence.
{"title":"Secure key generation from OFDM subcarriers' channel responses","authors":"Junqing Zhang, A. Marshall, Roger Francis Woods, T. Duong","doi":"10.1109/GLOCOMW.2014.7063613","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063613","url":null,"abstract":"The ability to exchange keys between users is vital in any wireless based security system. A key generation technique which exploits the randomness of the wireless channel is a promising alternative to existing key distribution techniques, e.g., public key cryptography. In this paper, a secure key generation scheme based on the subcarriers' channel responses in orthogonal frequency-division multiplexing (OFDM) systems is proposed. We first implement a time-variant multipath channel with its channel impulse response modelled as a wide sense stationary (WSS) uncorrelated scattering random process and demonstrate that each subcarrier's channel response is also a WSS random process. We then define the X% coherence time as the time required to produce an X% correlation coefficient in the autocorrelation function (ACF) of each channel tap, and find that when all the channel taps have the same Doppler power spectrum, all subcarriers' channel responses has the same ACF as the channel taps. The subcarrier's channel response is then sampled every X% coherence time and quantized into key bits. All the key sequences' randomness is tested using National Institute of Standards and Technology (NIST) statistical test suite and the results indicate that the commonly used sampling interval as 50% coherence time cannot guarantee the randomness of the key sequence.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129635089","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-12-08DOI: 10.1109/GLOCOMW.2014.7063472
Asanka Nuwanpriya, Siu-Wai Ho, Chung Shue Chen
In indoor visible light communication systems, transmitters are usually within the line of sight of the receiver. In order to enjoy the benefits of using multiple-input-multiple-output (MIMO) system, the technique for reducing channel correlation is important. This paper proposes a MIMO system using an angle diversity receiver (ADR) to achieve high spatial multiplexing gain. In our proposed system, receiver consists of multiple photodetectors (PDs) whose normals are pointing toward different directions. As a result, the incident angles from the same light emitting diode (LED) are different for different PDs and hence, channel correlation can be reduced. The spatial separation among PDs is small and no imaging lens is required. The proposed receiver is suitable for mounting on small devices like smartphones. Performance comparisons, in terms of analytical, simulated and experimental bit error rates (BER), are carried out for a MIMO system with 4 LED transmitters and 5 PD receivers. Results show that the proposed receiver performs better than other existing non-imaging receiver designs. Our proposed MIMO system is a practically feasible solution to enjoy low channel correlation and support mobility at receiver.
{"title":"Angle diversity receiver for indoor MIMO visible light communications","authors":"Asanka Nuwanpriya, Siu-Wai Ho, Chung Shue Chen","doi":"10.1109/GLOCOMW.2014.7063472","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063472","url":null,"abstract":"In indoor visible light communication systems, transmitters are usually within the line of sight of the receiver. In order to enjoy the benefits of using multiple-input-multiple-output (MIMO) system, the technique for reducing channel correlation is important. This paper proposes a MIMO system using an angle diversity receiver (ADR) to achieve high spatial multiplexing gain. In our proposed system, receiver consists of multiple photodetectors (PDs) whose normals are pointing toward different directions. As a result, the incident angles from the same light emitting diode (LED) are different for different PDs and hence, channel correlation can be reduced. The spatial separation among PDs is small and no imaging lens is required. The proposed receiver is suitable for mounting on small devices like smartphones. Performance comparisons, in terms of analytical, simulated and experimental bit error rates (BER), are carried out for a MIMO system with 4 LED transmitters and 5 PD receivers. Results show that the proposed receiver performs better than other existing non-imaging receiver designs. Our proposed MIMO system is a practically feasible solution to enjoy low channel correlation and support mobility at receiver.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123550577","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-12-01DOI: 10.1109/GLOCOMW.2014.7063412
I. Vaishnavi, Riccardo Guerzoni, S. Beker
In recent years there has been a considerable research surrounding multi-provider cloud platforms. Various architectures for realizing such systems have been proposed. However, most of this research has overlooked (or mentioned in passing) a vital aspect for the multi-provider deployment of platforms: the design of a monitoring systems to co-ordinate the monitoring systems in those platforms. This paper presents an architecture for a centralized monitoring system that coordinates the operation of individual domain-dependent monitoring systems. Our architecture enables the possibility for a global administrator to centrally define resource specific monitoring policies which can then be cascaded to the respective monitoring sub-systems. Owners of those sub-systems can also define their own policies based on the cascaded policies and their own requirements and preferences. We demonstrate with an example how this can be achieved within our innovative architecture.
{"title":"An architecture for co-ordinated monitoring for multi-provider cloud platforms","authors":"I. Vaishnavi, Riccardo Guerzoni, S. Beker","doi":"10.1109/GLOCOMW.2014.7063412","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063412","url":null,"abstract":"In recent years there has been a considerable research surrounding multi-provider cloud platforms. Various architectures for realizing such systems have been proposed. However, most of this research has overlooked (or mentioned in passing) a vital aspect for the multi-provider deployment of platforms: the design of a monitoring systems to co-ordinate the monitoring systems in those platforms. This paper presents an architecture for a centralized monitoring system that coordinates the operation of individual domain-dependent monitoring systems. Our architecture enables the possibility for a global administrator to centrally define resource specific monitoring policies which can then be cascaded to the respective monitoring sub-systems. Owners of those sub-systems can also define their own policies based on the cascaded policies and their own requirements and preferences. We demonstrate with an example how this can be achieved within our innovative architecture.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124373024","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-12-01DOI: 10.1109/GLOCOMW.2014.7063502
Asma Elmangoush, A. Al-Hezmi, T. Magedanz
Currently, a lot of research efforts are ongoing in the Machine-to-Machine (M2M) communication area, with the object of creating an ubiquitous sensing framework to connect real and virtual things. In the same context, various standards developing organizations (SDO) have recently promoted standardization activities in the M2M domain. In this paper, we investigate the standardization efforts toward a common M2M service layer that provides end-to-end service delivery and integrates heterogeneous devices and technologies. In addition, we present an ETSI-compliant implementation of M2M service layer that include advanced features for M2M solutions and able to extend to oneM2M standards to be released end of this year.
{"title":"The development of M2M standards for ubiquitous sensing service layer","authors":"Asma Elmangoush, A. Al-Hezmi, T. Magedanz","doi":"10.1109/GLOCOMW.2014.7063502","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063502","url":null,"abstract":"Currently, a lot of research efforts are ongoing in the Machine-to-Machine (M2M) communication area, with the object of creating an ubiquitous sensing framework to connect real and virtual things. In the same context, various standards developing organizations (SDO) have recently promoted standardization activities in the M2M domain. In this paper, we investigate the standardization efforts toward a common M2M service layer that provides end-to-end service delivery and integrates heterogeneous devices and technologies. In addition, we present an ETSI-compliant implementation of M2M service layer that include advanced features for M2M solutions and able to extend to oneM2M standards to be released end of this year.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"25 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116690744","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-12-01DOI: 10.1109/GLOCOMW.2014.7063592
Qi Dong, Yu Chen, Shahrzad Towfighian
Smart infrastructure is attractive for many desirable features. Embedded sensors that collect information are critical for decision making. However, the lifetime of electronic sensors is a constraint to infrastructure lifetime if sensors are physically embedded in the infrastructure at construction time. In this paper, we studied a self-powered wireless sensor network that harvests energy from mechanical vibration in the environment. A dynamic, hierarchical algorithm called MEGA is proposed that constructs clusters and elects the cluster head based on residue energy and energy harvest rate. Taking a smart bridge as an application example, the simulation study has verified the effectiveness of the proposed protocol.
{"title":"MEGA: An energy aware algorithm for self-powered wireless sensor networks in sustainable smart infrastructure","authors":"Qi Dong, Yu Chen, Shahrzad Towfighian","doi":"10.1109/GLOCOMW.2014.7063592","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063592","url":null,"abstract":"Smart infrastructure is attractive for many desirable features. Embedded sensors that collect information are critical for decision making. However, the lifetime of electronic sensors is a constraint to infrastructure lifetime if sensors are physically embedded in the infrastructure at construction time. In this paper, we studied a self-powered wireless sensor network that harvests energy from mechanical vibration in the environment. A dynamic, hierarchical algorithm called MEGA is proposed that constructs clusters and elects the cluster head based on residue energy and energy harvest rate. Taking a smart bridge as an application example, the simulation study has verified the effectiveness of the proposed protocol.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117052512","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-12-01DOI: 10.1109/GLOCOMW.2014.7063624
S. Gopinath, René Guillaume, P. Duplys, A. Czylwik
Providing secure communication links between devices of low computational power has been increasingly investigated during recent years. The need for fast and easy-to-implement security for computationally weak wireless devices has lead to the development of physical layer based key generation approaches. The generation of symmetric cryptographic keys out of wireless channel properties turned out to be a promising approach comprising advantages of symmetric as well as asymmetric cryptography. Numerous quantization schemes have been proposed in previous works to increase the Key Generation Rate (KGR). Also by increasing the sampling rate, the input data can be generated faster. However, due to fast sampling rates, redundancy of subsequent bits will increase. This lowers the quality, that is, the randomness of the generated secret key and makes the system more vulnerable to brute-force attacks. We present and analyze different techniques for transforming a temporally correlated sequence into a compressed sequence of decorrelated bits and, therefore, assure non-redundant key sequences.
{"title":"Reciprocity enhancement and decorrelation schemes for PHY-based key generation","authors":"S. Gopinath, René Guillaume, P. Duplys, A. Czylwik","doi":"10.1109/GLOCOMW.2014.7063624","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063624","url":null,"abstract":"Providing secure communication links between devices of low computational power has been increasingly investigated during recent years. The need for fast and easy-to-implement security for computationally weak wireless devices has lead to the development of physical layer based key generation approaches. The generation of symmetric cryptographic keys out of wireless channel properties turned out to be a promising approach comprising advantages of symmetric as well as asymmetric cryptography. Numerous quantization schemes have been proposed in previous works to increase the Key Generation Rate (KGR). Also by increasing the sampling rate, the input data can be generated faster. However, due to fast sampling rates, redundancy of subsequent bits will increase. This lowers the quality, that is, the randomness of the generated secret key and makes the system more vulnerable to brute-force attacks. We present and analyze different techniques for transforming a temporally correlated sequence into a compressed sequence of decorrelated bits and, therefore, assure non-redundant key sequences.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207504","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-12-01DOI: 10.1109/GLOCOMW.2014.7063382
D. Liao, Gang Sun, V. Anand, Kexiang Xiao
Recent research on virtualization has focused on developing various solutions for the problem of mapping a virtual network (VN) onto the substrate network. However, these solutions and associated algorithms are only efficient for constructing unicast service-oriented virtual networks, and generally not applicable to the cases of multicast service-oriented virtual networks (MVNs). Furthermore, there has been very limited work on the survivable MVN mapping (SMVNM) problem, which is important while considering multicast traffic. In this research, we discuss SMVNM problem while considering regional failures of the substrate network and propose an efficient algorithm for solving this problem. We validate and evaluate our framework and algorithms by conducting extensive simulations on realistic network under various scenarios, and by comparing with existing approaches. The simulation results show that our approach outperforms existing solutions.
{"title":"Survivable mapping for multicast virtual network under single regional failure","authors":"D. Liao, Gang Sun, V. Anand, Kexiang Xiao","doi":"10.1109/GLOCOMW.2014.7063382","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063382","url":null,"abstract":"Recent research on virtualization has focused on developing various solutions for the problem of mapping a virtual network (VN) onto the substrate network. However, these solutions and associated algorithms are only efficient for constructing unicast service-oriented virtual networks, and generally not applicable to the cases of multicast service-oriented virtual networks (MVNs). Furthermore, there has been very limited work on the survivable MVN mapping (SMVNM) problem, which is important while considering multicast traffic. In this research, we discuss SMVNM problem while considering regional failures of the substrate network and propose an efficient algorithm for solving this problem. We validate and evaluate our framework and algorithms by conducting extensive simulations on realistic network under various scenarios, and by comparing with existing approaches. The simulation results show that our approach outperforms existing solutions.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127304498","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-12-01DOI: 10.1109/GLOCOMW.2014.7063545
A. Maaref, Jianglei Ma, M. Salem, H. Baligh, Keyvan Zarin
In this paper, we introduce a virtualized device-centric radio access architecture for future fifth-generation (5G) mobile networks. Radio access networks (RAN)s have traditionally relied on Voronoi tessellations of cells, created by a careful deployment of access nodes, to enable spatial frequency reuse over those cells. With the trend firmly set to decouple the control- and user-planes for next-generation 5G mobile networks, we foresee radio access technology breaking away from the concept of cells and embracing a virtualized device-centric architecture. The aim for this paradigm shift is to meet the stringent quality of service (QoS) requirements of densely populated networks irrespective of users' physical proximity to the access nodes. Focusing on downlink user-plane (U-plane) virtualization, this paper proposes a device-centric hyper-transceiver (HT) design that capitalizes on group-to-group (G2G) communications between virtual multipoint transmission and reception nodes and proactively optimizes both sets of virtual nodes via dynamic point selection (DPS) enabled by cloud-RAN (CRAN) architecture and semi-static network-assisted receiver cooperation enabled by device-to-device (D2D) short-range communications, respectively. Using a full-fledged event-based system level simulator compliant with the 3rd generation partnership project (3GPP) long-term evolution advanced (LTE-Adv) specifications, our results show that the proposed virtualized U-plane architecture provides more than 50% average throughput and 200% coverage gains over LTE-A Release 11 baseline under some typical simulation scenarios.
{"title":"Device-centric radio access virtualization for 5G networks","authors":"A. Maaref, Jianglei Ma, M. Salem, H. Baligh, Keyvan Zarin","doi":"10.1109/GLOCOMW.2014.7063545","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063545","url":null,"abstract":"In this paper, we introduce a virtualized device-centric radio access architecture for future fifth-generation (5G) mobile networks. Radio access networks (RAN)s have traditionally relied on Voronoi tessellations of cells, created by a careful deployment of access nodes, to enable spatial frequency reuse over those cells. With the trend firmly set to decouple the control- and user-planes for next-generation 5G mobile networks, we foresee radio access technology breaking away from the concept of cells and embracing a virtualized device-centric architecture. The aim for this paradigm shift is to meet the stringent quality of service (QoS) requirements of densely populated networks irrespective of users' physical proximity to the access nodes. Focusing on downlink user-plane (U-plane) virtualization, this paper proposes a device-centric hyper-transceiver (HT) design that capitalizes on group-to-group (G2G) communications between virtual multipoint transmission and reception nodes and proactively optimizes both sets of virtual nodes via dynamic point selection (DPS) enabled by cloud-RAN (CRAN) architecture and semi-static network-assisted receiver cooperation enabled by device-to-device (D2D) short-range communications, respectively. Using a full-fledged event-based system level simulator compliant with the 3rd generation partnership project (3GPP) long-term evolution advanced (LTE-Adv) specifications, our results show that the proposed virtualized U-plane architecture provides more than 50% average throughput and 200% coverage gains over LTE-A Release 11 baseline under some typical simulation scenarios.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114962296","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-12-01DOI: 10.1109/GLOCOMW.2014.7063471
Chen Gong, Zhengyuan Xu
We propose linear minimum mean square error (LMMSE) receivers for optical wireless scattering communications with single transmitter and multiple receivers, namely the single-input multiple-output (SIMO) system, where the received signals exhibit the characteristics of discrete photons. We first propose an LMMSE receiver scheme based on photon counting detection, and then generalize to other type of receivers with amplification gains such as photomultiplier tube (PMT) and avalanche photodetector (APD). The proposed LMMSE receiver is designed for both on-off key (OOK) modulation and pulse-position modulation (PPM). Simulation results are provided to show the the bit estimation performance of the proposed LMMSE receivers. It is concluded that OOK incurs a larger estimation error at smaller required bandwidth, while M-PPM with M > 4 leads to a smaller estimation error with more bandwidth requirements.
{"title":"Linear receivers for optical wireless scattering communication with multiple photon detectors","authors":"Chen Gong, Zhengyuan Xu","doi":"10.1109/GLOCOMW.2014.7063471","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063471","url":null,"abstract":"We propose linear minimum mean square error (LMMSE) receivers for optical wireless scattering communications with single transmitter and multiple receivers, namely the single-input multiple-output (SIMO) system, where the received signals exhibit the characteristics of discrete photons. We first propose an LMMSE receiver scheme based on photon counting detection, and then generalize to other type of receivers with amplification gains such as photomultiplier tube (PMT) and avalanche photodetector (APD). The proposed LMMSE receiver is designed for both on-off key (OOK) modulation and pulse-position modulation (PPM). Simulation results are provided to show the the bit estimation performance of the proposed LMMSE receivers. It is concluded that OOK incurs a larger estimation error at smaller required bandwidth, while M-PPM with M > 4 leads to a smaller estimation error with more bandwidth requirements.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117013549","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
扫码关注我们
求助内容：
应助结果提醒方式：