Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952692
Avishek Patra, Janne Riihijärvi, J. Nasreddine, P. Mähönen
Femtocells are a promising approach to provide high data rates through autonomous configuration in indoor environments. However, due to the random and uncontrolled deployment of femtocells within users premises, interference between femtocells themselves and with macrocell base stations is a major issue. In this work, we look into the interference management problem and work towards the development of an interference mitigation algorithm based on the localization of randomly positioned femtocells using radio environmental information. In particular, we show that based on building floorplans and basic information on the urban landscape, femtocells can accurately localize themselves using macrocellular base stations as anchor nodes. Based on the localized femtocell positions, various channel allocation schemes are employed to mitigate interference.
{"title":"Environment-aware localization of femtocells for interference management","authors":"Avishek Patra, Janne Riihijärvi, J. Nasreddine, P. Mähönen","doi":"10.1109/WCNC.2014.6952692","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952692","url":null,"abstract":"Femtocells are a promising approach to provide high data rates through autonomous configuration in indoor environments. However, due to the random and uncontrolled deployment of femtocells within users premises, interference between femtocells themselves and with macrocell base stations is a major issue. In this work, we look into the interference management problem and work towards the development of an interference mitigation algorithm based on the localization of randomly positioned femtocells using radio environmental information. In particular, we show that based on building floorplans and basic information on the urban landscape, femtocells can accurately localize themselves using macrocellular base stations as anchor nodes. Based on the localized femtocell positions, various channel allocation schemes are employed to mitigate interference.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125867850","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-04-06DOI: 10.1109/WCNC.2014.6953086
Yi Sun, Yubin Zhao, J. Schiller
Nowadays positioning and navigation technologies based on smartphone are sprouting up for numerous application scenarios. In this paper a more self-contained approach is introduced by which merely inertial units within the smartphone are utilized. By the Pedestrian Dead Reckoning technique, all kinds of indoor location information are provided at users' disposal. With the gyroscope, the attitude of smartphone is measured. So the real time accelerations in standard coordinate system without gravity component can be calculated. Here only vertical acceleration signals are made use of to extract the features for steps counting as well as step lengths estimation. A series of algorithms are employed to eliminate the noise and deviation, such as Zero Velocity Compensation, Moving Average Filter, Kalman Filter, and Successive Peaks Merging. Particularly the whole walking process is divided into small segments in each of which only straight walking, no stop, no turn is contained. So, different segments are processed respectively with distinctive parameters. The breakpoints are determined by moving variance analysis for accelerations and rotation angles, after which the heading and length of every step are acquired so that the mileage and position can be updated, closely followed by moving trajectory. In experiments, the average deviation of our approach is 0.48 m.
{"title":"An autonomic indoor positioning application based on smartphone","authors":"Yi Sun, Yubin Zhao, J. Schiller","doi":"10.1109/WCNC.2014.6953086","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953086","url":null,"abstract":"Nowadays positioning and navigation technologies based on smartphone are sprouting up for numerous application scenarios. In this paper a more self-contained approach is introduced by which merely inertial units within the smartphone are utilized. By the Pedestrian Dead Reckoning technique, all kinds of indoor location information are provided at users' disposal. With the gyroscope, the attitude of smartphone is measured. So the real time accelerations in standard coordinate system without gravity component can be calculated. Here only vertical acceleration signals are made use of to extract the features for steps counting as well as step lengths estimation. A series of algorithms are employed to eliminate the noise and deviation, such as Zero Velocity Compensation, Moving Average Filter, Kalman Filter, and Successive Peaks Merging. Particularly the whole walking process is divided into small segments in each of which only straight walking, no stop, no turn is contained. So, different segments are processed respectively with distinctive parameters. The breakpoints are determined by moving variance analysis for accelerations and rotation angles, after which the heading and length of every step are acquired so that the mileage and position can be updated, closely followed by moving trajectory. In experiments, the average deviation of our approach is 0.48 m.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129530329","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-04-06DOI: 10.1109/WCNC.2014.6952597
Alireza Eshraghi, B. Maham, Zhu Han, Morteza Banagar
One major issue in the design of active Radio Frequency IDentification (RFID) systems is the need for increasing the coverage, since it is essential for many applications to have a large communication range. In this paper, we propose an active RFID system based on ISO/IEC 18000-7, an energy efficient RFID standard, in which a two-hop relay system is utilized. It is shown that our proposed two-hop relay system can increase the coverage of the reader. In order to increase the efficiency of the two-hop system, we propose a Participation ID (PID) two-hop system. In our modified method, active tags do not participate more than once in a collection round. Hence, the power consumption of active tags is decreased and the throughput of the system is increased. We also evaluate the performance improvement of our modified method in comparison to the existing two-hop relay systems through simulation.
{"title":"Efficiency and coverage improvement of active RFID two-hop relay systems","authors":"Alireza Eshraghi, B. Maham, Zhu Han, Morteza Banagar","doi":"10.1109/WCNC.2014.6952597","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952597","url":null,"abstract":"One major issue in the design of active Radio Frequency IDentification (RFID) systems is the need for increasing the coverage, since it is essential for many applications to have a large communication range. In this paper, we propose an active RFID system based on ISO/IEC 18000-7, an energy efficient RFID standard, in which a two-hop relay system is utilized. It is shown that our proposed two-hop relay system can increase the coverage of the reader. In order to increase the efficiency of the two-hop system, we propose a Participation ID (PID) two-hop system. In our modified method, active tags do not participate more than once in a collection round. Hence, the power consumption of active tags is decreased and the throughput of the system is increased. We also evaluate the performance improvement of our modified method in comparison to the existing two-hop relay systems through simulation.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129890479","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-04-06DOI: 10.1109/WCNC.2014.6952051
T. Kohda, Y. Jitsumatsu, K. Aihara
The Separable Property (SP) condition for time and frequency synchronization compels us to determine phase correction terms in the Gabor Division/Spread Spectrum System (GD/S3). The phase correction technique has led us to design a GD/S3 receiver equipped with phase-tuned layers for Mary phase shift keying (MPSK). The resulting signal points of the time domain (TD) and frequency domain (FD) correlator outputs of each layer for M = 16 consist of only three lines, called a main-lobe with a layer-dependent phase angle and sidelobes with phase angle ±2π/16. The two sidelobes suggesting bit errors are removed by using code division multiple target (CDMT), inspired by code division multiple-access (CDMA) philosophy. The simulation result for 16PSK is confirmed.
{"title":"Phase-tuned layers with multiple 2D SS codes realize 16PSK communication","authors":"T. Kohda, Y. Jitsumatsu, K. Aihara","doi":"10.1109/WCNC.2014.6952051","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952051","url":null,"abstract":"The Separable Property (SP) condition for time and frequency synchronization compels us to determine phase correction terms in the Gabor Division/Spread Spectrum System (GD/S3). The phase correction technique has led us to design a GD/S3 receiver equipped with phase-tuned layers for Mary phase shift keying (MPSK). The resulting signal points of the time domain (TD) and frequency domain (FD) correlator outputs of each layer for M = 16 consist of only three lines, called a main-lobe with a layer-dependent phase angle and sidelobes with phase angle ±2π/16. The two sidelobes suggesting bit errors are removed by using code division multiple target (CDMT), inspired by code division multiple-access (CDMA) philosophy. The simulation result for 16PSK is confirmed.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750843","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-04-06DOI: 10.1109/WCNC.2014.6953119
Yufang Tang, Xueming Li, Yang Liu, Jizhe Wang, Yan Xu
In this paper, we propose a novel approach SDR-CS (Sparse Dimensionality Reduction based on CS) based on compressed sensing to reduce dimensionality. With certain constraint of objective function, our semi-supervised learning method utilizes instance to construct the optimally sparse dictionary in the training dataset, employs K-SVD and OMP algorithms to improve the convergence rate of learning, and then reduces the dimensionality of sparse representation of original data by Gaussian random matrix as measurement matrix, to achieve the purpose of dimensionality reduction. Experimental results demonstrate that our overcomplete sparse dictionary can enhance the major underlying structure characteristics of sparse representation, which are mapped into the regions with continuous dimensionality, not the same dimensionality, and improve the discrimination among data which belong to different classes. Only with the constraint of l2-norm, the proposed SDR-CS method has better performance of dimensionality reduction in the MNIST dataset, and it is superior to other existing methods with constraints of l2/l1-norm, achieving the classification error rate of 0.03.
本文提出了一种基于压缩感知的稀疏降维方法SDR-CS (Sparse Dimensionality Reduction based on CS)。我们的半监督学习方法在一定的目标函数约束下，利用实例在训练数据集中构造最优稀疏字典，采用K-SVD和OMP算法提高学习的收敛速度，然后用高斯随机矩阵作为度量矩阵对原始数据的稀疏表示进行降维，达到降维的目的。实验结果表明，我们的过完备稀疏字典可以增强稀疏表示的主要底层结构特征，将其映射到具有连续维数的区域，而不是相同维数的区域，并提高了不同类别数据之间的区分能力。仅在l2-范数约束下，本文提出的drs - cs方法在MNIST数据集上具有更好的降维性能，优于现有的l2/l1-范数约束下的其他方法，分类错误率为0.03。
{"title":"Sparse dimensionality reduction based on compressed sensing","authors":"Yufang Tang, Xueming Li, Yang Liu, Jizhe Wang, Yan Xu","doi":"10.1109/WCNC.2014.6953119","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953119","url":null,"abstract":"In this paper, we propose a novel approach SDR-CS (Sparse Dimensionality Reduction based on CS) based on compressed sensing to reduce dimensionality. With certain constraint of objective function, our semi-supervised learning method utilizes instance to construct the optimally sparse dictionary in the training dataset, employs K-SVD and OMP algorithms to improve the convergence rate of learning, and then reduces the dimensionality of sparse representation of original data by Gaussian random matrix as measurement matrix, to achieve the purpose of dimensionality reduction. Experimental results demonstrate that our overcomplete sparse dictionary can enhance the major underlying structure characteristics of sparse representation, which are mapped into the regions with continuous dimensionality, not the same dimensionality, and improve the discrimination among data which belong to different classes. Only with the constraint of l2-norm, the proposed SDR-CS method has better performance of dimensionality reduction in the MNIST dataset, and it is superior to other existing methods with constraints of l2/l1-norm, achieving the classification error rate of 0.03.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128616801","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-04-06DOI: 10.1109/WCNC.2014.6951951
Shengchu Wang, Yunzhou Li, Jing Wang
In this paper, an iterative multiuser detector is proposed for uplink large-scale Multiple Input Multiple Output (MIMO). It is developed based on the Generalized Approximate Message Passing (GAMP) algorithm, and its convergence properties are analyzed by a one-dimensional iteration termed as State Evolution (SE). The SE analysis proves that the complexity of the GAMP detector (GAMPd) is one order of magnitude smaller than that of the Minimum Mean Square Error (MMSE) detector. Simulation results show the GAMPd performs similarly to MMSE at least, and even outperforms the latter when the number of BS antennas is not much larger than the number of users. In addition, the GAMPd with matrix-vector multiplications is suitable for hardware implementation.
{"title":"Low-complexity multiuser detection for uplink large-scale MIMO","authors":"Shengchu Wang, Yunzhou Li, Jing Wang","doi":"10.1109/WCNC.2014.6951951","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951951","url":null,"abstract":"In this paper, an iterative multiuser detector is proposed for uplink large-scale Multiple Input Multiple Output (MIMO). It is developed based on the Generalized Approximate Message Passing (GAMP) algorithm, and its convergence properties are analyzed by a one-dimensional iteration termed as State Evolution (SE). The SE analysis proves that the complexity of the GAMP detector (GAMPd) is one order of magnitude smaller than that of the Minimum Mean Square Error (MMSE) detector. Simulation results show the GAMPd performs similarly to MMSE at least, and even outperforms the latter when the number of BS antennas is not much larger than the number of users. In addition, the GAMPd with matrix-vector multiplications is suitable for hardware implementation.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610439","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-04-06DOI: 10.1109/WCNC.2014.6952822
W. Z. Khan, M. Aalsalem, Mohamad Naufal Mohamad Saad, Yang Xiang, T. Luan
Wireless Sensor Networks are vulnerable to node replication attacks due to deployment in unattended environments and the lack of physical tamper-resistance. An adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of replicas into the network to mount a wide variety of internal attacks. In this paper we propose a novel distributed solution (RAND) for the detection of node replication attack in static WSNs which combines random walks with network division and works in two phases. In the first phase called network configuration phase, the entire network is divided into different areas. In the second phase called replica detection phase, the clone is detected by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Simulation results show that our scheme outperforms the existing witness node based strategies with moderate communication and memory overhead.
{"title":"Detecting replicated nodes in Wireless Sensor Networks using random walks and network division","authors":"W. Z. Khan, M. Aalsalem, Mohamad Naufal Mohamad Saad, Yang Xiang, T. Luan","doi":"10.1109/WCNC.2014.6952822","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952822","url":null,"abstract":"Wireless Sensor Networks are vulnerable to node replication attacks due to deployment in unattended environments and the lack of physical tamper-resistance. An adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of replicas into the network to mount a wide variety of internal attacks. In this paper we propose a novel distributed solution (RAND) for the detection of node replication attack in static WSNs which combines random walks with network division and works in two phases. In the first phase called network configuration phase, the entire network is divided into different areas. In the second phase called replica detection phase, the clone is detected by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Simulation results show that our scheme outperforms the existing witness node based strategies with moderate communication and memory overhead.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127234496","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-04-06DOI: 10.1109/WCNC.2014.6952917
M. Gokturk, Gulden Ferazoglu
A channel selection mechanism, interference aware channel selection (IACS) that chooses the channel with the maximum achievable data rate is proposed. Achievable rate is calculated by considering information on signal strength of clients, airtime and effective noise floor (NF). While measuring the effective NF of a channel, adjacent channel rejection (ACR) capability of access point (AP) is taken into account. We fully characterized the ACR performance of an AP via conducted tests carried out in laboratory environment. This ACR information is then used to compute the effective NF of channels that encounter adjacent channel interference (ACI). The proposed IACS algorithm is implemented and its performance is demonstrated in an example scenario. It is shown that with the use of IACS, network sustains high throughput values even in the presence of powerful interference sources in the vicinity, whereas schemes that do not consider ACI fail even to provide communication.
{"title":"Adjacent channel interference aware channel selection for wireless local area networks","authors":"M. Gokturk, Gulden Ferazoglu","doi":"10.1109/WCNC.2014.6952917","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952917","url":null,"abstract":"A channel selection mechanism, interference aware channel selection (IACS) that chooses the channel with the maximum achievable data rate is proposed. Achievable rate is calculated by considering information on signal strength of clients, airtime and effective noise floor (NF). While measuring the effective NF of a channel, adjacent channel rejection (ACR) capability of access point (AP) is taken into account. We fully characterized the ACR performance of an AP via conducted tests carried out in laboratory environment. This ACR information is then used to compute the effective NF of channels that encounter adjacent channel interference (ACI). The proposed IACS algorithm is implemented and its performance is demonstrated in an example scenario. It is shown that with the use of IACS, network sustains high throughput values even in the presence of powerful interference sources in the vicinity, whereas schemes that do not consider ACI fail even to provide communication.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129058969","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-04-06DOI: 10.1109/WCNC.2014.6952715
Say Sotheara, Kento Aso, Naoto Aomi, S. Shimamoto
This paper proposes the effective data gathering and energy efficient communication scheme for Wireless Sensor Networks employing Unmanned Aerial Vehicle. In this scheme, we minimize the number of redundant sensors communicating with UAV by assigning the sensors inside the coverage area of UAV's beacon signal into different priority groups. Once the priority segments, Circularly Optimized Frame Selection (COFS), are defined, data communication is handled from higher to lower transmission priority frame sequentially. The work presented in the paper is based on multi-hop approach. Therefore, the plausible algorithms employing the scheme COFS are proposed to engage in effective data collection. As a result, both the proposed scheme and algorithms are significant to obtain low energy consumption as well as increase the lifetime of sensors inside the network. The energy consumption model is also presented. This study is confirmed by simulating the WSN-UAV system employing our proposed model.
{"title":"Effective data gathering and energy efficient communication protocol in Wireless Sensor Networks employing UAV","authors":"Say Sotheara, Kento Aso, Naoto Aomi, S. Shimamoto","doi":"10.1109/WCNC.2014.6952715","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952715","url":null,"abstract":"This paper proposes the effective data gathering and energy efficient communication scheme for Wireless Sensor Networks employing Unmanned Aerial Vehicle. In this scheme, we minimize the number of redundant sensors communicating with UAV by assigning the sensors inside the coverage area of UAV's beacon signal into different priority groups. Once the priority segments, Circularly Optimized Frame Selection (COFS), are defined, data communication is handled from higher to lower transmission priority frame sequentially. The work presented in the paper is based on multi-hop approach. Therefore, the plausible algorithms employing the scheme COFS are proposed to engage in effective data collection. As a result, both the proposed scheme and algorithms are significant to obtain low energy consumption as well as increase the lifetime of sensors inside the network. The energy consumption model is also presented. This study is confirmed by simulating the WSN-UAV system employing our proposed model.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129140552","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-04-06DOI: 10.1109/WCNC.2014.6951979
H. AlQuwaiee, I. S. Ansari, Mohamed-Slim Alouini
In this work, we derive the statistical characteristics of the maximum and the minimum of two modified1 Gamma-Gamma variates in closed-form in terms of Meijer's G-function and the extended generalized bivariate Meijer's G-function. Then, we rely on these new results to present the performance analysis of (i) a dual-branch free-space optical selection combining diversity undergoing independent but not necessarily identically distributed Gamma-Gamma fading under the impact of pointing errors and of (ii) a dual-hop free-space optical relay transmission system. Computer-based Monte-Carlo simulations verify our new analytical results.
本文用mejer 's g -函数和扩展的广义二元mejer 's g -函数导出了闭型两个修正1 γ - γ变量的极大值和极小值的统计特征。然后，我们根据这些新结果对(i)在指向误差的影响下，具有独立但不一定相同分布的Gamma-Gamma衰落的双支路结合分集的自由空间光选择和(ii)双跳自由空间光中继传输系统的性能进行了分析。基于计算机的蒙特卡罗模拟验证了我们的新分析结果。
{"title":"On the maximum and minimum of two modified Gamma-Gamma variates with applications","authors":"H. AlQuwaiee, I. S. Ansari, Mohamed-Slim Alouini","doi":"10.1109/WCNC.2014.6951979","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951979","url":null,"abstract":"In this work, we derive the statistical characteristics of the maximum and the minimum of two modified1 Gamma-Gamma variates in closed-form in terms of Meijer's G-function and the extended generalized bivariate Meijer's G-function. Then, we rely on these new results to present the performance analysis of (i) a dual-branch free-space optical selection combining diversity undergoing independent but not necessarily identically distributed Gamma-Gamma fading under the impact of pointing errors and of (ii) a dual-hop free-space optical relay transmission system. Computer-based Monte-Carlo simulations verify our new analytical results.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130275240","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
扫码关注我们
求助内容：
应助结果提醒方式：