In this paper, a new Belief Propagation (BP) decoding algorithm named Piggybacking Belief Propagation (PBP) decoding algorithm is proposed for rateless codes based on repeat-accumulate (RA) structure over AWGN channel. The "piggybacking" characteristic of the proposed algorithm is transmitting the Log-Likelihood Ratio (LLR) results calculated from the previous decode attempt to the new decoding process after receiving more information from the channel. Moreover, the proposed algorithm introduces a new stopping criterion to stop the decoding attempt when it is almost impossible to succeed. The stopping criterion is based on the weight change ratio of syndrome. The simulation results show that, compared with the traditional BP decoding algorithm, the proposed algorithm has lower decoding overhead and the a reduced decoding delay.
{"title":"Piggybacking Belief Propagation Decoding for Rateless Codes Based on RA Structure","authors":"Rong Sun, Meng-Di Zhao, Jingwei Liu, Jingyuan Sun, Hao Guan, Zhuyan Zhao","doi":"10.1109/ICCCHINA.2018.8641154","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641154","url":null,"abstract":"In this paper, a new Belief Propagation (BP) decoding algorithm named Piggybacking Belief Propagation (PBP) decoding algorithm is proposed for rateless codes based on repeat-accumulate (RA) structure over AWGN channel. The \"piggybacking\" characteristic of the proposed algorithm is transmitting the Log-Likelihood Ratio (LLR) results calculated from the previous decode attempt to the new decoding process after receiving more information from the channel. Moreover, the proposed algorithm introduces a new stopping criterion to stop the decoding attempt when it is almost impossible to succeed. The stopping criterion is based on the weight change ratio of syndrome. The simulation results show that, compared with the traditional BP decoding algorithm, the proposed algorithm has lower decoding overhead and the a reduced decoding delay.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126546339","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-08-01DOI: 10.1109/ICCCHINA.2018.8641227
Tian Ma, Lei Tian, Jian-hua Zhang, Zhen Zhang
MIMO OTA testing is a promising solution to evaluate terminal performance. Standards like 3GPP and CTIA are investigating different MIMO OTA testing methods, thus test results from different labs are needed. However, there is no standard for MIMO OTA testing with 3D channel model until now. In this paper, we have verified 2D channel model parameters in MPAC and investigated the spatial correlation of 3D channel model by simulating it on channel emulator. The performance comparison between 2D MPAC setup and 3D MPAC setup is shown.
MIMO OTA测试是评估终端性能的一种很有前途的解决方案。3GPP和CTIA等标准正在研究不同的MIMO OTA测试方法，因此需要来自不同实验室的测试结果。然而，目前还没有3D通道模型的MIMO OTA测试标准。本文在MPAC中对二维通道模型参数进行了验证，并在通道模拟器上对三维通道模型进行了仿真，研究了通道模型的空间相关性。给出了二维MPAC设置和三维MPAC设置的性能比较。
{"title":"MIMO OTA Channel Verification and Performance Testing","authors":"Tian Ma, Lei Tian, Jian-hua Zhang, Zhen Zhang","doi":"10.1109/ICCCHINA.2018.8641227","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641227","url":null,"abstract":"MIMO OTA testing is a promising solution to evaluate terminal performance. Standards like 3GPP and CTIA are investigating different MIMO OTA testing methods, thus test results from different labs are needed. However, there is no standard for MIMO OTA testing with 3D channel model until now. In this paper, we have verified 2D channel model parameters in MPAC and investigated the spatial correlation of 3D channel model by simulating it on channel emulator. The performance comparison between 2D MPAC setup and 3D MPAC setup is shown.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123080311","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-08-01DOI: 10.1109/ICCCHINA.2018.8641139
Jianzhi Li, B. Ai, R. He, Mi Yang, Z. Zhong, Y. Hao
In this paper, a massive MIMO channel measurement campaign is conducted at 11 GHz in an indoor lobby environment. The measurements use two types of 256-element virtual uniform rectangular arrays (URAs), i.e., the 4×64 virtual URA and the 64×4 virtual URA. The channel characterization is presented by investigating the typical channel parameters, including average power delay profile (APDP), K factor, root mean square (RMS) delay spread, and coherence bandwidth. Moreover, the channel characteristics in angular domain are investigated by applying the space-alternating generalized expectation-maximization algorithm (SAGE). The extracted MPCs are preliminarily clustered by visual inspection, and related to the interacting objects (IO) in physical environment. To evaluate the directional dispersion at the base station (BS) side, direction spread of departure is estimated based on the SAGE estimates. The results in this paper can help to reveal the propagation mechanisms in massive MIMO channels, and provide a foundation for the design and application of the practical massive MIMO system.
{"title":"Measurement-Based Massive MIMO Channel Characterization in Lobby Environment at 11 GHz","authors":"Jianzhi Li, B. Ai, R. He, Mi Yang, Z. Zhong, Y. Hao","doi":"10.1109/ICCCHINA.2018.8641139","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641139","url":null,"abstract":"In this paper, a massive MIMO channel measurement campaign is conducted at 11 GHz in an indoor lobby environment. The measurements use two types of 256-element virtual uniform rectangular arrays (URAs), i.e., the 4×64 virtual URA and the 64×4 virtual URA. The channel characterization is presented by investigating the typical channel parameters, including average power delay profile (APDP), K factor, root mean square (RMS) delay spread, and coherence bandwidth. Moreover, the channel characteristics in angular domain are investigated by applying the space-alternating generalized expectation-maximization algorithm (SAGE). The extracted MPCs are preliminarily clustered by visual inspection, and related to the interacting objects (IO) in physical environment. To evaluate the directional dispersion at the base station (BS) side, direction spread of departure is estimated based on the SAGE estimates. The results in this paper can help to reveal the propagation mechanisms in massive MIMO channels, and provide a foundation for the design and application of the practical massive MIMO system.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126326545","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-08-01DOI: 10.1109/ICCCHINA.2018.8641109
Dandi Wang, Siye Wang
This paper focuses on outage performance for full-duplex (FD) decode-and-forward (DF) multi-relay networks with low-resolution analog-to-digital converters (ADCs). FD operation enables the relay to transmit and receive over same frequency band concurrently. Therefore, loop interference (LI) caused by signal leakage from transmitter deteriorates system performance. Based on instantaneous end-to-end capacity, we propose two relay selection strategies, including max signal-to-interference-plus-noise ratio (MS) strategy and hybrid relay (HR) strategy. To facilitate comparison, closed-form outage probability expressions are obtained for them and used to analysis. In addition, impact of resolution of ADC are investigated. Final results prove that HR mode is preferable in terms of outage probability. Both number of quantization bits and location of low-resolution ADC have significant impacts on outage performance.
{"title":"Outage Performance for Full-Duplex Decode-and-Forward Relay Cooperative Networks with Low-Resolution ADCs","authors":"Dandi Wang, Siye Wang","doi":"10.1109/ICCCHINA.2018.8641109","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641109","url":null,"abstract":"This paper focuses on outage performance for full-duplex (FD) decode-and-forward (DF) multi-relay networks with low-resolution analog-to-digital converters (ADCs). FD operation enables the relay to transmit and receive over same frequency band concurrently. Therefore, loop interference (LI) caused by signal leakage from transmitter deteriorates system performance. Based on instantaneous end-to-end capacity, we propose two relay selection strategies, including max signal-to-interference-plus-noise ratio (MS) strategy and hybrid relay (HR) strategy. To facilitate comparison, closed-form outage probability expressions are obtained for them and used to analysis. In addition, impact of resolution of ADC are investigated. Final results prove that HR mode is preferable in terms of outage probability. Both number of quantization bits and location of low-resolution ADC have significant impacts on outage performance.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132639703","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-08-01DOI: 10.1109/ICCCHINA.2018.8641111
Haoran Qi, Xingjian Zhang, Yue Gao
Compressive spectrum sensing (CSS) techniques alleviate the demand of high-speed sampling in wideband spectrum sensing for cognitive radio systems. Known existing literature discusses threshold adaption schemes to achieve optimal performance of channel occupancy detection in conventional non-compressive spectrum sensing scenario. However, in the CSS case, it is found that the channel energy statistics and optimal threshold not only depend on noise energy in channel but also compression ratio, the selection of recovery algorithms, etc. Therefore, we postulate a statistical model of channel energy in CSS and propose a practical threshold adaption scheme aiming to achieve constant target false alarm rate. The validity of the postulated channel energy model is verified by learning the parameters of a Mixture Model and aligning with empirical distributions. Finally, performance of the proposed threshold adaption scheme is presented and discussed.
{"title":"Channel Energy Statistics Modeling and Threshold Adaption in Compressive Spectrum Sensing","authors":"Haoran Qi, Xingjian Zhang, Yue Gao","doi":"10.1109/ICCCHINA.2018.8641111","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641111","url":null,"abstract":"Compressive spectrum sensing (CSS) techniques alleviate the demand of high-speed sampling in wideband spectrum sensing for cognitive radio systems. Known existing literature discusses threshold adaption schemes to achieve optimal performance of channel occupancy detection in conventional non-compressive spectrum sensing scenario. However, in the CSS case, it is found that the channel energy statistics and optimal threshold not only depend on noise energy in channel but also compression ratio, the selection of recovery algorithms, etc. Therefore, we postulate a statistical model of channel energy in CSS and propose a practical threshold adaption scheme aiming to achieve constant target false alarm rate. The validity of the postulated channel energy model is verified by learning the parameters of a Mixture Model and aligning with empirical distributions. Finally, performance of the proposed threshold adaption scheme is presented and discussed.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080649","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-08-01DOI: 10.1109/ICCCHINA.2018.8641202
Jiyang Bai, He Fang, Junghoon Suh, O. Aboul-Magd, E. Au, Xianbin Wang
IEEE 802.11ax, which is the next-generation WLAN standard, aims at providing highly efficient communication in ultra-dense networks. However, due to the high quantity of stations (STAs) in dense deployment scenarios, the potential high collision rate significantly degrades the network efficiency of WLAN. In this paper, we propose an adaptive grouping scheme to overcome this challenge in IEEE 802.11ax using Uplink OFD-MA Random Access (UORA). In order to achieve the optimal utilization efficiency of resource units (RUs), we first analyze the relationship between group size and RU efficiency. Based on this result, an adaptive STA grouping algorithm is proposed to cope with the performance fluctuation of 802.11ax due to remainder stations after grouping. The analysis and simulation results demonstrate that our adaptive grouping algorithm dramatically improves the performance of both the system and each STA in the ultra-dense network.
{"title":"Adaptive Uplink OFDMA Random Access Grouping Scheme for Ultra-Dense Networks in IEEE 802.11ax","authors":"Jiyang Bai, He Fang, Junghoon Suh, O. Aboul-Magd, E. Au, Xianbin Wang","doi":"10.1109/ICCCHINA.2018.8641202","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641202","url":null,"abstract":"IEEE 802.11ax, which is the next-generation WLAN standard, aims at providing highly efficient communication in ultra-dense networks. However, due to the high quantity of stations (STAs) in dense deployment scenarios, the potential high collision rate significantly degrades the network efficiency of WLAN. In this paper, we propose an adaptive grouping scheme to overcome this challenge in IEEE 802.11ax using Uplink OFD-MA Random Access (UORA). In order to achieve the optimal utilization efficiency of resource units (RUs), we first analyze the relationship between group size and RU efficiency. Based on this result, an adaptive STA grouping algorithm is proposed to cope with the performance fluctuation of 802.11ax due to remainder stations after grouping. The analysis and simulation results demonstrate that our adaptive grouping algorithm dramatically improves the performance of both the system and each STA in the ultra-dense network.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115725556","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}
How to solve the collision problem in Aloha is a popular research direction all the time. In order to solve this problem in multi-receiver satellite IoT networks, a novel random access scheme named Cooperative Slotted Aloha with Reservation (R-CSA) is proposed. One characteristic of multi-receiver satellite IoT networks is the different propagation delay among receivers, which can be used in the proposed R-CSA for iterative interference cancellation. The other problem common in Aloha schemes is low critical point (after this point, as the normalized load increases, the throughput decreases). For this problem, reservation is considered in the proposed scheme. The performance of R-CSA is analyzed with mathematical method and simulations. Simulation results show that R-CSA outperforms R-CRDSA in terms of packet loss ratio and throughput. According to the simulation results, the critical point of R-CSA is higher than R-CRDSA. And in the aspect of packet loss ratio(PLR), even if the normalized load is up to 1, the PLR of R-CSA is still lower than 0.1.
{"title":"Cooperative Slotted Aloha with Reservation for Multi-Receiver Satellite IoT Networks","authors":"Rumeng Wang, Pengxu Li, Gaofeng Cui, Weidong Wang, Yinghai Zhang","doi":"10.1109/ICCCHINA.2018.8641112","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641112","url":null,"abstract":"How to solve the collision problem in Aloha is a popular research direction all the time. In order to solve this problem in multi-receiver satellite IoT networks, a novel random access scheme named Cooperative Slotted Aloha with Reservation (R-CSA) is proposed. One characteristic of multi-receiver satellite IoT networks is the different propagation delay among receivers, which can be used in the proposed R-CSA for iterative interference cancellation. The other problem common in Aloha schemes is low critical point (after this point, as the normalized load increases, the throughput decreases). For this problem, reservation is considered in the proposed scheme. The performance of R-CSA is analyzed with mathematical method and simulations. Simulation results show that R-CSA outperforms R-CRDSA in terms of packet loss ratio and throughput. According to the simulation results, the critical point of R-CSA is higher than R-CRDSA. And in the aspect of packet loss ratio(PLR), even if the normalized load is up to 1, the PLR of R-CSA is still lower than 0.1.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701992","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-08-01DOI: 10.1109/ICCCHINA.2018.8641143
Beini Rong, Shiqi Gong, Zesong Fei
We investigate how to design the robust training matrix for spatially correlated multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying channels with imperfect channel covariance matrices, where the unitary-invariant channel covariance error matrices and the colored noise are assumed. Moreover, the superimposed training technology and the total power constraint are both taken into account. In our work, the robust training design for linear minimum mean-squared-error (LMMSE) channel estimation is formulated as a nonconvex problem. In order to effectively solve the considered nonconvex optimization problem, we resort to an upper bound of the performance of the training optimization and then an iterative SDP algorithm is proposed for the training optimization. Finally, numerical simulations demonstrate the excellent advantages of the proposed robust training design for the LMMSE based channel estimation.
{"title":"Robust Superimposed Training Designs for MIMO AF Relaying Channels under Total Power Constraint","authors":"Beini Rong, Shiqi Gong, Zesong Fei","doi":"10.1109/ICCCHINA.2018.8641143","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641143","url":null,"abstract":"We investigate how to design the robust training matrix for spatially correlated multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying channels with imperfect channel covariance matrices, where the unitary-invariant channel covariance error matrices and the colored noise are assumed. Moreover, the superimposed training technology and the total power constraint are both taken into account. In our work, the robust training design for linear minimum mean-squared-error (LMMSE) channel estimation is formulated as a nonconvex problem. In order to effectively solve the considered nonconvex optimization problem, we resort to an upper bound of the performance of the training optimization and then an iterative SDP algorithm is proposed for the training optimization. Finally, numerical simulations demonstrate the excellent advantages of the proposed robust training design for the LMMSE based channel estimation.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123072724","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-08-01DOI: 10.1109/ICCCHINA.2018.8641259
Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang
Recently, deep convolutional neural networks (CNNs) have led to significant improvement over semantic image segmentation and have also been the best choice. In this paper, we propose a deep neural network architecture, Multi-Path Fusion Network (MPFNet), for semantic image segmentation. In MPFNet, we add more convolution paths to every convolution layer. The depth of each convolutional path increases linearly, which provides a superior method for pixel level prediction. Using this method, we integrate contextual information and local information to produce good quality results on the semantic segmentation task. In addition, dense skip connections are added to repeatedly leverage previous features. The proposed approach improves strong baselines built upon VGG16 on two urban scene datasets, CamVid and Cityscapes, which demonstrate its effectiveness in modeling context information.
{"title":"Multi-path Fusion Network For Semantic Image Segmentation","authors":"Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang","doi":"10.1109/ICCCHINA.2018.8641259","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641259","url":null,"abstract":"Recently, deep convolutional neural networks (CNNs) have led to significant improvement over semantic image segmentation and have also been the best choice. In this paper, we propose a deep neural network architecture, Multi-Path Fusion Network (MPFNet), for semantic image segmentation. In MPFNet, we add more convolution paths to every convolution layer. The depth of each convolutional path increases linearly, which provides a superior method for pixel level prediction. Using this method, we integrate contextual information and local information to produce good quality results on the semantic segmentation task. In addition, dense skip connections are added to repeatedly leverage previous features. The proposed approach improves strong baselines built upon VGG16 on two urban scene datasets, CamVid and Cityscapes, which demonstrate its effectiveness in modeling context information.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121598379","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 next generation network, types of services will be more diverse due to the increment of users demand. Traffic Engineering (TE), which solves the problem of performance optimization in network, cannot meet the QoS needs of different services because of the limitations of routing strategies in existing networks. Software-defined network (SDN) is a promising network paradigm that separates control plane and data plane, and enhances network flexibility. SDN brings benefits to TE via collecting and analyzing data dynamically. Existing mobile network solutions mostly focus on single network, such as radio access network or core network. In this paper, edge nodes in software-defined backhaul network are selected as the entrances of network flows from base stations in heterogeneous cellular network. An Access Selection Method (ASM) is proposed to choose access nodes by measuring the similarity between the service characteristics and performance of backhaul edge nodes with weighted Euclidean distance. Network flows traversing the edge nodes split into multiple sub-service flows among backhaul based on types of services. A Service Awareness Routing (SAR) scheme is proposed to minimize overhead from perspective of service combining ASM. The joint design with SAR and ASM solves entrances selection and network flowing routing problems in consideration of network services. Extensive simulations show the effectiveness and reliability of the proposed scheme.
{"title":"Joint Optimization of Heterogeneous Cellular and Backhaul Networks for Services Awareness in SDN","authors":"Wensheng Zhu, X. Liu, Xiaorong Zhu, Ting Jiang, Xuejian Zhao","doi":"10.1109/ICCCHINA.2018.8641115","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641115","url":null,"abstract":"In next generation network, types of services will be more diverse due to the increment of users demand. Traffic Engineering (TE), which solves the problem of performance optimization in network, cannot meet the QoS needs of different services because of the limitations of routing strategies in existing networks. Software-defined network (SDN) is a promising network paradigm that separates control plane and data plane, and enhances network flexibility. SDN brings benefits to TE via collecting and analyzing data dynamically. Existing mobile network solutions mostly focus on single network, such as radio access network or core network. In this paper, edge nodes in software-defined backhaul network are selected as the entrances of network flows from base stations in heterogeneous cellular network. An Access Selection Method (ASM) is proposed to choose access nodes by measuring the similarity between the service characteristics and performance of backhaul edge nodes with weighted Euclidean distance. Network flows traversing the edge nodes split into multiple sub-service flows among backhaul based on types of services. A Service Awareness Routing (SAR) scheme is proposed to minimize overhead from perspective of service combining ASM. The joint design with SAR and ASM solves entrances selection and network flowing routing problems in consideration of network services. Extensive simulations show the effectiveness and reliability of the proposed scheme.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122650648","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
扫码关注我们
求助内容：
应助结果提醒方式：