Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00046
Naychi Nway Nway, Julia Myint, Ei Chaw Htoon
MapReduce is the efficient framework for parallel processing of distributed big data in cluster environment. In such a cluster, task failures can impact on performance of applications. Although MapReduce automatically reschedules the failed tasks, it takes long completion time because it starts from scratch. The checkpointing mechanism is the valuable technique to avoid re-execution of finished tasks in MapReduce. However, defining incorrect checkpoint interval can still decrease the performance of MapReduce applications and job completion time. So, in this paper, checkpoint interval is proposed to avoid re-execution of whole tasks in case of task failures and save job completion time. The proposed checkpoint interval is based on five parameters: expected job completion time without checkpointing, checkpoint overhead time, rework time, down time and restart time. The experiments show that the proposed checkpoint interval takes the advantage of less checkpoints overhead and reduce completion time at failure time.
{"title":"Evaluating Checkpoint Interval for Fault-Tolerance in MapReduce","authors":"Naychi Nway Nway, Julia Myint, Ei Chaw Htoon","doi":"10.1109/CYBERC.2018.00046","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00046","url":null,"abstract":"MapReduce is the efficient framework for parallel processing of distributed big data in cluster environment. In such a cluster, task failures can impact on performance of applications. Although MapReduce automatically reschedules the failed tasks, it takes long completion time because it starts from scratch. The checkpointing mechanism is the valuable technique to avoid re-execution of finished tasks in MapReduce. However, defining incorrect checkpoint interval can still decrease the performance of MapReduce applications and job completion time. So, in this paper, checkpoint interval is proposed to avoid re-execution of whole tasks in case of task failures and save job completion time. The proposed checkpoint interval is based on five parameters: expected job completion time without checkpointing, checkpoint overhead time, rework time, down time and restart time. The experiments show that the proposed checkpoint interval takes the advantage of less checkpoints overhead and reduce completion time at failure time.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144279","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00067
Yuanyuan Ren, Yanhui Lu, Shou-yi Yang
In this paper, we study a joint spatial division multiplexing (JSDM) beamforming scheme based on the weighted minimum mean square error (WMMSE), aiming to optimize the sum rate of FDD massive MIMO system with low complexity and reduced-dimensional channel state information at the transmitter (CSIT). The proposed algorithm concatenates a prebeamforming matrix, which depends on the channel second-order statistics and is achieved by block diagonalization (BD), with a multi-user precoder to maximize the sum rate of the system by the low complexity WMMSE algorithm. The simulation results show that the WMMSE-based algorithm effectively increases the sum rate of the system comparing to the conventional JSDM which designs the two-stage beamformer with BD and zero forcing method. At the same time, the effect of effective rank in BD on the performance of the algorithm is analyzed.
{"title":"A Reduced Overhead Low Complexity Sum Rate Optimization Algorithm for Massive MIMO System","authors":"Yuanyuan Ren, Yanhui Lu, Shou-yi Yang","doi":"10.1109/CYBERC.2018.00067","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00067","url":null,"abstract":"In this paper, we study a joint spatial division multiplexing (JSDM) beamforming scheme based on the weighted minimum mean square error (WMMSE), aiming to optimize the sum rate of FDD massive MIMO system with low complexity and reduced-dimensional channel state information at the transmitter (CSIT). The proposed algorithm concatenates a prebeamforming matrix, which depends on the channel second-order statistics and is achieved by block diagonalization (BD), with a multi-user precoder to maximize the sum rate of the system by the low complexity WMMSE algorithm. The simulation results show that the WMMSE-based algorithm effectively increases the sum rate of the system comparing to the conventional JSDM which designs the two-stage beamformer with BD and zero forcing method. At the same time, the effect of effective rank in BD on the performance of the algorithm is analyzed.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710144","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}
Automatic text classification plays an important role in text mining natural language processing and machine learning. It provides a lot of convenience for information retrieval and text management. In recent years, with the development of Internet technology, text data is rapidly expanding every day, such as microblog dynamic information sent by users, news content of major news portals, e-mail messages from users, posts from forums, blogs, etc. Most of the texts belong to short texts. The short texts have the characteristics of short length, sparse features, and strong context-dependence. Traditional methods have limited accuracy in direct classification. In order to solve this problem, this paper compares the characteristics of various models such as fastText, TextCNN, TextRNN, and RCNN, and the classification effect, trying to find the model with the highest comprehensive ability. Through the use of the Haikou City 12345 hotline complaint text data set for recognition accuracy estimation, the experimental results show that TextCNN has the best classification effect, while fastText has the shortest training time, and TextRNN is not satisfactory in terms of training time or classification effect.
{"title":"Research on Civic Hotline Complaint Text Classification Model Based on word2vec","authors":"JingYu Luo, Zhao Qiu, GengQuan Xie, Jun Feng, JianZheng Hu, XiaWen Zhang","doi":"10.1109/CYBERC.2018.00044","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00044","url":null,"abstract":"Automatic text classification plays an important role in text mining natural language processing and machine learning. It provides a lot of convenience for information retrieval and text management. In recent years, with the development of Internet technology, text data is rapidly expanding every day, such as microblog dynamic information sent by users, news content of major news portals, e-mail messages from users, posts from forums, blogs, etc. Most of the texts belong to short texts. The short texts have the characteristics of short length, sparse features, and strong context-dependence. Traditional methods have limited accuracy in direct classification. In order to solve this problem, this paper compares the characteristics of various models such as fastText, TextCNN, TextRNN, and RCNN, and the classification effect, trying to find the model with the highest comprehensive ability. Through the use of the Haikou City 12345 hotline complaint text data set for recognition accuracy estimation, the experimental results show that TextCNN has the best classification effect, while fastText has the shortest training time, and TextRNN is not satisfactory in terms of training time or classification effect.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116501568","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00026
Haodong Bian, Xiangyu Bai, Hua Zhang, Maoli Ran
The widespread application of mobile communication technologies based on cellular networks has provided campus students with convenient content distribution services, but the high traffic costs can hardly meet the needs of students for downloading large files. Most campuses do not implement Wi-Fi-wide school coverage. Wi-Fi access is only available in certain fixed locations. Bluetooth in mobile phones is not usually networking and routing, so that students can not accurately get the resources they need in the nearby population. It can be seen that the common content acquisition methods on campus are difficult to meet the students' needs for resource content in a timely manner. It is possible to expand the coverage of the network with the help of widely used mobile intelligent terminal devices on campus. At the same time, mobile intelligent terminals can be used to enhance the sharing of campus network resources. Students can obtain the required resources at a lower cost without access to Wi-Fi. This paper combines mobile communication technology and Bluetooth communication technology. The use of mobile communication networks and portable smart terminals hybrid communication. A content distribution framework for campus networks was proposed. This new content distribution solution is suitable for the actual needs and application characteristics of student users on campus. It provides content distribution services on the campus in a low-cost and high-coverage manner. It promoted the construction of campus information. The OPNET simulation platform is used to model and simulate the proposed scheme. The network performance and content distribution efficiency are analyzed under different scenarios in this scenario. It tries to provide a theoretical basis for the specific implementation of the plan, which helps to improve the content distribution efficiency of the campus network environment.
{"title":"Research on Auxiliary Content Distribution Based on OPNET on Campus","authors":"Haodong Bian, Xiangyu Bai, Hua Zhang, Maoli Ran","doi":"10.1109/CYBERC.2018.00026","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00026","url":null,"abstract":"The widespread application of mobile communication technologies based on cellular networks has provided campus students with convenient content distribution services, but the high traffic costs can hardly meet the needs of students for downloading large files. Most campuses do not implement Wi-Fi-wide school coverage. Wi-Fi access is only available in certain fixed locations. Bluetooth in mobile phones is not usually networking and routing, so that students can not accurately get the resources they need in the nearby population. It can be seen that the common content acquisition methods on campus are difficult to meet the students' needs for resource content in a timely manner. It is possible to expand the coverage of the network with the help of widely used mobile intelligent terminal devices on campus. At the same time, mobile intelligent terminals can be used to enhance the sharing of campus network resources. Students can obtain the required resources at a lower cost without access to Wi-Fi. This paper combines mobile communication technology and Bluetooth communication technology. The use of mobile communication networks and portable smart terminals hybrid communication. A content distribution framework for campus networks was proposed. This new content distribution solution is suitable for the actual needs and application characteristics of student users on campus. It provides content distribution services on the campus in a low-cost and high-coverage manner. It promoted the construction of campus information. The OPNET simulation platform is used to model and simulate the proposed scheme. The network performance and content distribution efficiency are analyzed under different scenarios in this scenario. It tries to provide a theoretical basis for the specific implementation of the plan, which helps to improve the content distribution efficiency of the campus network environment.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"416 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124175119","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00091
Yuanshuang Wang, Junjun Liu, Guowang Miao
In this paper, we develop a joint physical and medium access control (MAC) layer optimization (JPMO) scheme based on game theory for energy-efficient resource allocation and interference management in heterogeneous networks (HetNets). In HetNets, cross-tier interference and co-tier interference significantly limit the network performance. Moreover, when each user only has its own channel state information and chooses its transmission policy independently without any coordination mechanism, it will result in the network collapse or waste of channel resources. To maximize the network efficiency, we develop the JPMO scheme through pricing mechanism from the perspective of game theory. Then we transform this scheme into a two-stage Stackelberg game, in which macrocell determines the transmission policy in MAC layer first, and then SCs perform EE power allocation in physical layer. Simulation results validate the effectiveness of the proposed scheme.
{"title":"Decentralized Cross-Layer Optimization for Energy-Efficient Resource Allocation in HetNets","authors":"Yuanshuang Wang, Junjun Liu, Guowang Miao","doi":"10.1109/CYBERC.2018.00091","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00091","url":null,"abstract":"In this paper, we develop a joint physical and medium access control (MAC) layer optimization (JPMO) scheme based on game theory for energy-efficient resource allocation and interference management in heterogeneous networks (HetNets). In HetNets, cross-tier interference and co-tier interference significantly limit the network performance. Moreover, when each user only has its own channel state information and chooses its transmission policy independently without any coordination mechanism, it will result in the network collapse or waste of channel resources. To maximize the network efficiency, we develop the JPMO scheme through pricing mechanism from the perspective of game theory. Then we transform this scheme into a two-stage Stackelberg game, in which macrocell determines the transmission policy in MAC layer first, and then SCs perform EE power allocation in physical layer. Simulation results validate the effectiveness of the proposed scheme.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116019039","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}
In the context of Internet of Things (IoT) environments, obtaining the target's location information by analyzing a large number of video data captured by widely distributed camera nodes shows a good development prospect. As far as video analytics is concerned, for the purpose of reducing high processing costs and transmission time of video data, it is an effective solution to offload computing from the cloud to edge devices. In this paper, we design a four-layer video analytics architecture with the concept of edge computing and adopt the lightweight virtualization provided by the container technology to modularize the video analytics process. Based on the proposed architecture, an video analytics-based intelligent indoor positioning system is implemented. The proposed system can provide centimeter-level positioning accuracy and, at the same time, has a lower response delay than traditional cloud computing model. The experimental results show that, high-precision location information could be obtained with the help of billions of camera nodes, while for the large-scale video analytics, the usage of edge computing has great potentials.
{"title":"A Video Analytics-Based Intelligent Indoor Positioning System Using Edge Computing For IoT","authors":"Yinghao Xie, Yihong Hu, Yuejun Chen, Yaqiong Liu, Guochu Shou","doi":"10.1109/CYBERC.2018.00033","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00033","url":null,"abstract":"In the context of Internet of Things (IoT) environments, obtaining the target's location information by analyzing a large number of video data captured by widely distributed camera nodes shows a good development prospect. As far as video analytics is concerned, for the purpose of reducing high processing costs and transmission time of video data, it is an effective solution to offload computing from the cloud to edge devices. In this paper, we design a four-layer video analytics architecture with the concept of edge computing and adopt the lightweight virtualization provided by the container technology to modularize the video analytics process. Based on the proposed architecture, an video analytics-based intelligent indoor positioning system is implemented. The proposed system can provide centimeter-level positioning accuracy and, at the same time, has a lower response delay than traditional cloud computing model. The experimental results show that, high-precision location information could be obtained with the help of billions of camera nodes, while for the large-scale video analytics, the usage of edge computing has great potentials.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129488597","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00077
Yongsheng Rao, Pu Wu, Z. Shao, Ramy S. Shaheen, S. M. Sheikholeslami, Lanxiang Chen
For a graph G, a function h from V (G) to 2^{1,2} is a 2-rainbow-DF of G if for any vertex v with h(v) = ϕ we have U_uεN(v)^h(u) = {1, 2}, where N(v) is the set of neighbors of v. A 2-rainbow-DF is said to be a 2-rainbow restrained-DF (2RRDF) if the induced subgraph of G by the vertices with label ϕ contains no isolated vertex. The weight of a 2RRDF h is defined to be ΣvεV(G)^|h(v)|. The minimum weight of a 2RRDF of G is said to be the 2-rainbow restrained domination number (2RRDN) γrr(G) of G. In this paper we show the complexity result of the 2RRDF problem for planar graphs. Moreover, we determine the 2RRDN of some 2D torus networks.
{"title":"The Rainbow Restrained Domination in Torus Network","authors":"Yongsheng Rao, Pu Wu, Z. Shao, Ramy S. Shaheen, S. M. Sheikholeslami, Lanxiang Chen","doi":"10.1109/CYBERC.2018.00077","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00077","url":null,"abstract":"For a graph G, a function h from V (G) to 2^{1,2} is a 2-rainbow-DF of G if for any vertex v with h(v) = ϕ we have U_uεN(v)^h(u) = {1, 2}, where N(v) is the set of neighbors of v. A 2-rainbow-DF is said to be a 2-rainbow restrained-DF (2RRDF) if the induced subgraph of G by the vertices with label ϕ contains no isolated vertex. The weight of a 2RRDF h is defined to be ΣvεV(G)^|h(v)|. The minimum weight of a 2RRDF of G is said to be the 2-rainbow restrained domination number (2RRDN) γrr(G) of G. In this paper we show the complexity result of the 2RRDF problem for planar graphs. Moreover, we determine the 2RRDN of some 2D torus networks.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129661781","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00037
Jian Ling, Lei Wang, Hong Ji, Hu Xie, Junfeng Ding, Qiejun Dai
In engineering applications, related application of personnel location has become more and more popular. The global positioning system (GPS) is a classic system to locate people, vehicles and other objects. However the GPS signal cannot be received in closed space, so the localization can only be conducted through indoor positioning technologies. In this paper, we focus on the continuous positioning of people and vehicles in the tunnels. The ultra-wide-band (UWB) positioning technology is adopted, and we proposed a methods to remove the outliers to reduce the impact of NLOS transmissions. Moreover, we designed a continuous positioning algorithm based on prediction to increase the accuracy of positioning during the movement. Finally, an experimental platform was built, and the proposed scheme was evaluated. The experimental results show that the optimized algorithm can provide higher positioning accuracy and frequency than the traditional method.
{"title":"UWB-Based Real-Time Continuous Positioning System in NLOS Tunnel Environment","authors":"Jian Ling, Lei Wang, Hong Ji, Hu Xie, Junfeng Ding, Qiejun Dai","doi":"10.1109/CYBERC.2018.00037","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00037","url":null,"abstract":"In engineering applications, related application of personnel location has become more and more popular. The global positioning system (GPS) is a classic system to locate people, vehicles and other objects. However the GPS signal cannot be received in closed space, so the localization can only be conducted through indoor positioning technologies. In this paper, we focus on the continuous positioning of people and vehicles in the tunnels. The ultra-wide-band (UWB) positioning technology is adopted, and we proposed a methods to remove the outliers to reduce the impact of NLOS transmissions. Moreover, we designed a continuous positioning algorithm based on prediction to increase the accuracy of positioning during the movement. Finally, an experimental platform was built, and the proposed scheme was evaluated. The experimental results show that the optimized algorithm can provide higher positioning accuracy and frequency than the traditional method.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130813721","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 : 2018-10-01DOI: 10.1109/cyberc.2018.00101
{"title":"Publisher's Information","authors":"","doi":"10.1109/cyberc.2018.00101","DOIUrl":"https://doi.org/10.1109/cyberc.2018.00101","url":null,"abstract":"","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130290464","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00082
Qianyu Chen, Clive Roberts
In this paper a novel photodiode (PD) for optical wireless communication (OWC) is introduced. The proposed receiver is single-photon avalanche diode (SPAD), which becomes popular recently due to its higher power efficiency and better timing resolution. The introduction of SPAD array further enhances the counting capacity. Firstly, detection statistics of single SPAD receiver is introduced briefly. More focus has then been put on SPAD array receivers, including detection statistics analysis and error performance evaluations among on-off keying (OOK), pulse-position modulation (PPM) and channel coded PPM systems. It is found that the maximum achievable data rate is observed by M-ary PPM systems with higher M value, at the cost of degraded spectral efficiency. The PPM system with higher M also shows better error performance for fixed incident source power. The main contributions of this work are the mathematical derivations and performance analysis of error probability in PPM systems and channel coded PPM systems, as well as maximum achievable data rate evaluations. It is proved that channel coded systems could improve the error performance to a large extent.
{"title":"Maximum Data Rate and Error Performance Comparisons of SPAD Array Optical Receivers","authors":"Qianyu Chen, Clive Roberts","doi":"10.1109/CYBERC.2018.00082","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00082","url":null,"abstract":"In this paper a novel photodiode (PD) for optical wireless communication (OWC) is introduced. The proposed receiver is single-photon avalanche diode (SPAD), which becomes popular recently due to its higher power efficiency and better timing resolution. The introduction of SPAD array further enhances the counting capacity. Firstly, detection statistics of single SPAD receiver is introduced briefly. More focus has then been put on SPAD array receivers, including detection statistics analysis and error performance evaluations among on-off keying (OOK), pulse-position modulation (PPM) and channel coded PPM systems. It is found that the maximum achievable data rate is observed by M-ary PPM systems with higher M value, at the cost of degraded spectral efficiency. The PPM system with higher M also shows better error performance for fixed incident source power. The main contributions of this work are the mathematical derivations and performance analysis of error probability in PPM systems and channel coded PPM systems, as well as maximum achievable data rate evaluations. It is proved that channel coded systems could improve the error performance to a large extent.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467061","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
扫码关注我们
求助内容：
应助结果提醒方式：