Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440634
M. Bahrami, M. Singhal
Cloud computing paradigm offers an opportunity to in-house IT departments to establish their services on the cloud with minimum investment, and lower maintenance cost. This opportunity includes database services that allow a massive amount of data to be stored on the cloud. However, outsourcing data to the cloud may expose users' data to the cloud vendor, or the vendors' partners. Although encryption schemes, such as AES can be used against an untrusted cloud vendor, or an adversary, those schemes add additional computation overheads. In this paper, we proposed a light-weight data privacy schema for cloud based databases (CloudPDB) that scrambles data on each selected bucket (multiple records, or fields) of a database. The proposed schema uses a pre-defined database of a chaos system to store data on the cloud that protect data against an adversary inside or outside of an untrusted cloud vendor. We implemented the proposed schema on a well-known standard database benchmark, TPC-H with different query sizes. We ran several queries to assess the performance of the proposed schema. The evaluation shows that the proposed schema provides a better performance over other well-known encryption methods. In addition, we assess the security level of the proposed schema.
{"title":"CloudPDB: A light-weight data privacy schema for cloud-based databases","authors":"M. Bahrami, M. Singhal","doi":"10.1109/ICCNC.2016.7440634","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440634","url":null,"abstract":"Cloud computing paradigm offers an opportunity to in-house IT departments to establish their services on the cloud with minimum investment, and lower maintenance cost. This opportunity includes database services that allow a massive amount of data to be stored on the cloud. However, outsourcing data to the cloud may expose users' data to the cloud vendor, or the vendors' partners. Although encryption schemes, such as AES can be used against an untrusted cloud vendor, or an adversary, those schemes add additional computation overheads. In this paper, we proposed a light-weight data privacy schema for cloud based databases (CloudPDB) that scrambles data on each selected bucket (multiple records, or fields) of a database. The proposed schema uses a pre-defined database of a chaos system to store data on the cloud that protect data against an adversary inside or outside of an untrusted cloud vendor. We implemented the proposed schema on a well-known standard database benchmark, TPC-H with different query sizes. We ran several queries to assess the performance of the proposed schema. The evaluation shows that the proposed schema provides a better performance over other well-known encryption methods. In addition, we assess the security level of the proposed schema.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124055753","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440617
Chien-Hao Huang, C. Yu, Chung-An Shen
It has been shown that the Configurable Joint Detection-Decoding (CJDD) algorithms in MIMO systems can effectively reduce the complexity and improve the signal quality. Since the CJDD approach is based on the tree search algorithms and there exists various kinds of such methods with different characteristics, it is of great importance to explore the trade-offs between each algorithm and their impacts on different aspects of system performances. In this paper, we study the CJDD algorithm based on three types of tree search approaches: breadth-first search, depth-first search, and the Fano algorithm. We explicitly elucidate the advantages and disadvantages of each algorithm on the basis of timing complexity, area complexity, and run-time variability. Our goal is to shed more lights on the design and application of tree search type approaches on the MIMO wireless communication systems for different system design considerations.
{"title":"Tree search based configurable joint detection and decoding algorithms for MIMO systems","authors":"Chien-Hao Huang, C. Yu, Chung-An Shen","doi":"10.1109/ICCNC.2016.7440617","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440617","url":null,"abstract":"It has been shown that the Configurable Joint Detection-Decoding (CJDD) algorithms in MIMO systems can effectively reduce the complexity and improve the signal quality. Since the CJDD approach is based on the tree search algorithms and there exists various kinds of such methods with different characteristics, it is of great importance to explore the trade-offs between each algorithm and their impacts on different aspects of system performances. In this paper, we study the CJDD algorithm based on three types of tree search approaches: breadth-first search, depth-first search, and the Fano algorithm. We explicitly elucidate the advantages and disadvantages of each algorithm on the basis of timing complexity, area complexity, and run-time variability. Our goal is to shed more lights on the design and application of tree search type approaches on the MIMO wireless communication systems for different system design considerations.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128008122","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440631
L. Yao, Ping Dong, T. Zheng, Hongke Zhang, Xiaojiang Du, M. Guizani
Due to the widespread research on Software Defined Networks (SDNs), its security has received much attention recently. But most of those attempts consider SDN security from the OpenFlow perspective. To the best of our knowledge, none so far has paid attention to the security analysis and modeling of Forwarding and Control planes Separation Network Structure (FCSNS) in SDN. Therefore, this paper provides a different approach to network security based on Petri net and Attack tree models. Our objective is to analyze the FCSNS security via the combination of model and state. This method represents the network structure and state transferring by way of Petri net. In addition, it introduces the security analysis method of STRIDE to build up the Attack tree model. Finally, we analyze FCSNS via the combination of Petri net and Attack tree model and present the results. Our results are very promising in using such models to achieve such security objectives.
{"title":"Network security analyzing and modeling based on Petri net and Attack tree for SDN","authors":"L. Yao, Ping Dong, T. Zheng, Hongke Zhang, Xiaojiang Du, M. Guizani","doi":"10.1109/ICCNC.2016.7440631","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440631","url":null,"abstract":"Due to the widespread research on Software Defined Networks (SDNs), its security has received much attention recently. But most of those attempts consider SDN security from the OpenFlow perspective. To the best of our knowledge, none so far has paid attention to the security analysis and modeling of Forwarding and Control planes Separation Network Structure (FCSNS) in SDN. Therefore, this paper provides a different approach to network security based on Petri net and Attack tree models. Our objective is to analyze the FCSNS security via the combination of model and state. This method represents the network structure and state transferring by way of Petri net. In addition, it introduces the security analysis method of STRIDE to build up the Attack tree model. Finally, we analyze FCSNS via the combination of Petri net and Attack tree model and present the results. Our results are very promising in using such models to achieve such security objectives.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134366094","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440689
U. Moravapalle, Raghupathy Sivakumar
A mobile-to-mobile remote computing protocol for smartphones presents a user with the ability to run an application remotely and to interact with it in a responsive way, where I/O updates can be performed midstream and the results can be viewed in real time. Even though several protocols exist for desktop remote computing, we argue that these cannot be applied as-is for mobile-to-mobile remote computing. In this context, we introduce Peek, a remote computing protocol with i) multi-touch support, ii) context association, and iii) multi-modal frame compression. Through implementation on real devices, we show that Peek reduces the time taken to perform actions on a server by 62% on average, compared to Virtual Network Computing (VNC). We also test Peek's multi-modal frame compression, against VNC, on datasets and show that it has the potential to reduce 30% of the bytes sent on the network.
{"title":"Peek: A mobile-to-mobile remote computing protocol for smartphones and tablets","authors":"U. Moravapalle, Raghupathy Sivakumar","doi":"10.1109/ICCNC.2016.7440689","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440689","url":null,"abstract":"A mobile-to-mobile remote computing protocol for smartphones presents a user with the ability to run an application remotely and to interact with it in a responsive way, where I/O updates can be performed midstream and the results can be viewed in real time. Even though several protocols exist for desktop remote computing, we argue that these cannot be applied as-is for mobile-to-mobile remote computing. In this context, we introduce Peek, a remote computing protocol with i) multi-touch support, ii) context association, and iii) multi-modal frame compression. Through implementation on real devices, we show that Peek reduces the time taken to perform actions on a server by 62% on average, compared to Virtual Network Computing (VNC). We also test Peek's multi-modal frame compression, against VNC, on datasets and show that it has the potential to reduce 30% of the bytes sent on the network.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132955947","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440656
Fan Yang, Julian Cheng
The performance of free-space optical (FSO) communication systems is often compromised by atmospheric attenuation and fading effects. One effective counter fading technique is the spatial diversity. In this paper, an FSO system with spatial diversity is analyzed over correlated lognormal fading channels that may have nonidentical variance. We use a novel lognormal-Nakagami composite channel model to reveal the asymptotic behaviors of the correlated lognormal fading channels. We discover that the correlation among the lognormal channels can impose large signal-to-noise ratio (SNR) penalty when compared to the same system with independent lognormal channels. This property is not shared with the other commonly used fading channels. In addition, we also derive a compact expression for the asymptotic relative diversity order (ARDO) between an L branch maximal ratio combing system over correlated lognormal channels and a single branch system. It is found that the ARDO is related to the number of diversity branches as well as entry-wise norm of the covariance matrix of the logarithm of the lognormal channel states.
{"title":"Recent results on correlated lognormal atmospheric turbulence channels","authors":"Fan Yang, Julian Cheng","doi":"10.1109/ICCNC.2016.7440656","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440656","url":null,"abstract":"The performance of free-space optical (FSO) communication systems is often compromised by atmospheric attenuation and fading effects. One effective counter fading technique is the spatial diversity. In this paper, an FSO system with spatial diversity is analyzed over correlated lognormal fading channels that may have nonidentical variance. We use a novel lognormal-Nakagami composite channel model to reveal the asymptotic behaviors of the correlated lognormal fading channels. We discover that the correlation among the lognormal channels can impose large signal-to-noise ratio (SNR) penalty when compared to the same system with independent lognormal channels. This property is not shared with the other commonly used fading channels. In addition, we also derive a compact expression for the asymptotic relative diversity order (ARDO) between an L branch maximal ratio combing system over correlated lognormal channels and a single branch system. It is found that the ARDO is related to the number of diversity branches as well as entry-wise norm of the covariance matrix of the logarithm of the lognormal channel states.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129373501","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440653
B. Liu, Lei He
In cognitive radio (CR) networks, secondary users (SUs) may have various applications such as video streaming and file transfer, resulting in different bandwidth requirements. In this paper, we propose a Quality of Experience (QoE) based resource allocation scheme for mixed services over spectrum underlay cognitive radio networks. The proposed scheme jointly optimize the transmission rate and transmission power at each secondary session to maximize the network resource usage and all users' average QoE. The mean opinion score (MOS), which is an effective measurement of QoE, is used as the unifying metric over different service classes. The optimization is solved efficiently using geometric programming techniques. The simulation results demonstrate that the proposed QoE-based resource allocation scheme outperforms the conventional rate-based scheme in terms of user perceived quality.
{"title":"QoE-based resource allocation for mixed services over cognitive radio networks","authors":"B. Liu, Lei He","doi":"10.1109/ICCNC.2016.7440653","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440653","url":null,"abstract":"In cognitive radio (CR) networks, secondary users (SUs) may have various applications such as video streaming and file transfer, resulting in different bandwidth requirements. In this paper, we propose a Quality of Experience (QoE) based resource allocation scheme for mixed services over spectrum underlay cognitive radio networks. The proposed scheme jointly optimize the transmission rate and transmission power at each secondary session to maximize the network resource usage and all users' average QoE. The mean opinion score (MOS), which is an effective measurement of QoE, is used as the unifying metric over different service classes. The optimization is solved efficiently using geometric programming techniques. The simulation results demonstrate that the proposed QoE-based resource allocation scheme outperforms the conventional rate-based scheme in terms of user perceived quality.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127823118","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440633
Y. Reddy
Most of the fingerprint matching systems use the minutiae-based algorithms with matching of ridge patterns. These systems consider ridge activity in the vicinity of minutiae points, which has poorly recorded/captured exemplar prints (information). In this research, we recommend the MapReduce technique to identify a required fingerprint from the reference fingerprint database. In the proposed MapReduce process, minutiae of the latent fingerprint used as keys. The latent fingerprints are analyzed using Bezier ridge descriptors to enhance the matching of partial latent against reference prints. Since the retrieval of reference print is same as retrieval of the required document, we suggested the MapReduce model for detection of required fingerprint.
{"title":"Latent fingerprint matching in large databases using high performance computing","authors":"Y. Reddy","doi":"10.1109/ICCNC.2016.7440633","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440633","url":null,"abstract":"Most of the fingerprint matching systems use the minutiae-based algorithms with matching of ridge patterns. These systems consider ridge activity in the vicinity of minutiae points, which has poorly recorded/captured exemplar prints (information). In this research, we recommend the MapReduce technique to identify a required fingerprint from the reference fingerprint database. In the proposed MapReduce process, minutiae of the latent fingerprint used as keys. The latent fingerprints are analyzed using Bezier ridge descriptors to enhance the matching of partial latent against reference prints. Since the retrieval of reference print is same as retrieval of the required document, we suggested the MapReduce model for detection of required fingerprint.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124555398","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}
This paper addresses the issue of effective classification of video traffic with the view of QoS guarantee, and presents a modified K-Singular Value Decomposition (K-SVD) classification framework based on the concept of QFAg (QoS based Flow Aggregation). By statistical analysis of video flows on large-scale real networks, we define 5 Quality of Service (QoS) categories with the features of downstream/upstream rates. To investigate the sparsity property of multimedia QoS feature, this paper utilizes modified K-SVD to train dictionary extracted from training samples. By learning feature-set to obtain sparse representation for video traffic, we propose a feature-based method to classify video traffic. Experimental results reveal that the proposed method can improve the classification performance significantly compared to previous methods.
{"title":"Internet video traffic classification using QoS features","authors":"Zaijian Wang, Yu-ning Dong, Hai-xian Shi, Lingyun Yang, Pingping Tang","doi":"10.1109/ICCNC.2016.7440599","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440599","url":null,"abstract":"This paper addresses the issue of effective classification of video traffic with the view of QoS guarantee, and presents a modified K-Singular Value Decomposition (K-SVD) classification framework based on the concept of QFAg (QoS based Flow Aggregation). By statistical analysis of video flows on large-scale real networks, we define 5 Quality of Service (QoS) categories with the features of downstream/upstream rates. To investigate the sparsity property of multimedia QoS feature, this paper utilizes modified K-SVD to train dictionary extracted from training samples. By learning feature-set to obtain sparse representation for video traffic, we propose a feature-based method to classify video traffic. Experimental results reveal that the proposed method can improve the classification performance significantly compared to previous methods.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114508778","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440551
R. Bolla, F. Davoli, C. Lombardo, Laura Masullo, R. Bruschi
Overcoming the typical ossification of the traditional TCP/IP-based Internet infrastructure will allow opening the way for more flexible and energy efficient paradigms, able to provide a sustainable support to the constantly increasing number of devices and services. To this goal, the INPUT Project will overcome current limitations by introducing computing and storage capabilities to edge network devices in order to allow users/telecom operators to create/manage private clouds "in the network". In addition, these new capabilities will allow replacing smart devices, such as network-attached storage servers, set-top-boxes, video sensors etc. with their virtual images. Although this virtualization process can clearly bring to a reduction of the emissions, along with the lowering of capital (CAPEX) and operational (OPEX) expenditures, on the other hand it requires more computational capacity at server level, which may erase the savings produced by virtualization in the absence of a thorough management and planning. In this respect, this paper presents a mathematical model that analyzes the impact of different levels of virtualization on the overall energy efficiency by thoroughly outlining how the carbon footprint varies depending on the virtualization level of a device.
{"title":"The expected impact of smart devices visualization","authors":"R. Bolla, F. Davoli, C. Lombardo, Laura Masullo, R. Bruschi","doi":"10.1109/ICCNC.2016.7440551","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440551","url":null,"abstract":"Overcoming the typical ossification of the traditional TCP/IP-based Internet infrastructure will allow opening the way for more flexible and energy efficient paradigms, able to provide a sustainable support to the constantly increasing number of devices and services. To this goal, the INPUT Project will overcome current limitations by introducing computing and storage capabilities to edge network devices in order to allow users/telecom operators to create/manage private clouds \"in the network\". In addition, these new capabilities will allow replacing smart devices, such as network-attached storage servers, set-top-boxes, video sensors etc. with their virtual images. Although this virtualization process can clearly bring to a reduction of the emissions, along with the lowering of capital (CAPEX) and operational (OPEX) expenditures, on the other hand it requires more computational capacity at server level, which may erase the savings produced by virtualization in the absence of a thorough management and planning. In this respect, this paper presents a mathematical model that analyzes the impact of different levels of virtualization on the overall energy efficiency by thoroughly outlining how the carbon footprint varies depending on the virtualization level of a device.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963298","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440691
Osamah. S. Badarneh, I. Atawi, M. Aloqlah
This paper derives novel, unified, and exact closed-form analytical expressions for the moment generating function (MGF), the generalized moments, and the average symbol error probability (SEP) of wireless communication systems that operate over the α - η - β fading channels. The derived expressions are then used to analyze the influence of the fading parameters on the system performance. However, to validate the accuracy of the derived expressions, we present a comparison between numerical results and Monte-Carlo simulations. Both results are in excellent agreement over a wide range of signal-to-noise ratio (SNR) and for different values of the fading parameters.
本文导出了运行在α - η - β衰落信道上的无线通信系统的矩产生函数(MGF)、广义矩和平均符号误差概率(SEP)的新颖、统一和精确的封闭解析表达式。然后利用导出的表达式分析了衰落参数对系统性能的影响。然而，为了验证导出表达式的准确性，我们将数值结果与蒙特卡罗模拟进行了比较。这两个结果在很宽的信噪比(SNR)范围内和不同的衰落参数值上都非常一致。
{"title":"An exact performance analysis for mobile communications over generalized fading channels","authors":"Osamah. S. Badarneh, I. Atawi, M. Aloqlah","doi":"10.1109/ICCNC.2016.7440691","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440691","url":null,"abstract":"This paper derives novel, unified, and exact closed-form analytical expressions for the moment generating function (MGF), the generalized moments, and the average symbol error probability (SEP) of wireless communication systems that operate over the α - η - β fading channels. The derived expressions are then used to analyze the influence of the fading parameters on the system performance. However, to validate the accuracy of the derived expressions, we present a comparison between numerical results and Monte-Carlo simulations. Both results are in excellent agreement over a wide range of signal-to-noise ratio (SNR) and for different values of the fading parameters.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128587970","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
扫码关注我们
求助内容：
应助结果提醒方式：