Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641224
Chong Zhang, Gongpu Wang, R. He, Yulong Zou
The millimeter-wave (mmWave) technology is one possible solution to addressing the explosive requirements for mobile data access on high-speed railways (HSRs). However, utilizing the mmWave technology on HSRs will result in large Doppler shift, which should be estimated and compensated. Traditional Doppler shift estimators including the cyclic prefix (CP) based estimator (CPBE), the two-training-symbol based estimator (TBE) and the best linear unbiased estimator (BLUE) have inferior estimation accuracy especially at low signal-to-noise ratio (SNR). In this paper, we propose the new Doppler shift estimator for mmWave communication systems on HSRs: an equally-divided structure based estimator (ESBE) that divides the effective orthogonal frequency-division multiplexing (OFDM) symbol into multiple equal fragments. Simulation results show that our new estimator outperforms several existing Doppler shift estimators in mmWave communication systems on HSR.
{"title":"A Doppler Shift Estimator for Millimeter-Wave Communication Systems on High-Speed Railways","authors":"Chong Zhang, Gongpu Wang, R. He, Yulong Zou","doi":"10.1109/ICCCHINA.2018.8641224","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641224","url":null,"abstract":"The millimeter-wave (mmWave) technology is one possible solution to addressing the explosive requirements for mobile data access on high-speed railways (HSRs). However, utilizing the mmWave technology on HSRs will result in large Doppler shift, which should be estimated and compensated. Traditional Doppler shift estimators including the cyclic prefix (CP) based estimator (CPBE), the two-training-symbol based estimator (TBE) and the best linear unbiased estimator (BLUE) have inferior estimation accuracy especially at low signal-to-noise ratio (SNR). In this paper, we propose the new Doppler shift estimator for mmWave communication systems on HSRs: an equally-divided structure based estimator (ESBE) that divides the effective orthogonal frequency-division multiplexing (OFDM) symbol into multiple equal fragments. Simulation results show that our new estimator outperforms several existing Doppler shift estimators in mmWave communication systems on HSR.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"102 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":"122448834","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.8641148
Junjie Yang, Chao Wang, Xiaoxiao Wang, Cong Shen
Enterprise small cell networks often need to balance serving the prioritized corporate users and offering open access to guest users. Hybrid access is an efficient means to achieve this goal but how to design a user association policy to optimally achieve this tradeoff is a difficult problem. Furthermore, system dynamics in practical networks are often unknown a priori but must be learned online. To address these challenges, we first model the dynamic user association as a Markovian process, and then train two neural networks to develop a near-optimal algorithm that redistributes controllable corporate users among base stations (the "Policy Network") and learns the behavior of uncontrollable external guest user dynamics (the "Prediction Network"). The resulting system relies on the convergence of both networks and jointly they lead to a near-optimal user allocation policy. System simulations are provided to compare the performance advantages of the proposed algorithm over existing solutions. Specifically, we observe that the proposed policy can be easily applied to different reward functions.
{"title":"A Machine Learning Approach to User Association in Enterprise Small Cell Networks","authors":"Junjie Yang, Chao Wang, Xiaoxiao Wang, Cong Shen","doi":"10.1109/ICCCHINA.2018.8641148","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641148","url":null,"abstract":"Enterprise small cell networks often need to balance serving the prioritized corporate users and offering open access to guest users. Hybrid access is an efficient means to achieve this goal but how to design a user association policy to optimally achieve this tradeoff is a difficult problem. Furthermore, system dynamics in practical networks are often unknown a priori but must be learned online. To address these challenges, we first model the dynamic user association as a Markovian process, and then train two neural networks to develop a near-optimal algorithm that redistributes controllable corporate users among base stations (the \"Policy Network\") and learns the behavior of uncontrollable external guest user dynamics (the \"Prediction Network\"). The resulting system relies on the convergence of both networks and jointly they lead to a near-optimal user allocation policy. System simulations are provided to compare the performance advantages of the proposed algorithm over existing solutions. Specifically, we observe that the proposed policy can be easily applied to different reward functions.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"162 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":"117094267","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.8641219
Chao Lu, Wei Xu, Hong Shen, Hua Zhang, X. You
In this paper, we propose a learning approach for sparse code multiple access (SCMA) signal detection by using a deep neural network via unfolding the procedure of message passing algorithm (MPA). The MPA can be converted to a sparsely connected neural network if we treat the weights as the parameters of a neural network. The neural network can be trained off-line and then deployed for online detection. By further refining the network weights corresponding to the edges of a factor graph, the proposed method achieves a better performance. Moreover, the deep neural network based detection is a computationally efficient since highly paralleled computations in the network are enabled in emerging Artificial Intelligence (AI) chips.
{"title":"An Enhanced SCMA Detector Enabled by Deep Neural Network","authors":"Chao Lu, Wei Xu, Hong Shen, Hua Zhang, X. You","doi":"10.1109/ICCChina.2018.8641219","DOIUrl":"https://doi.org/10.1109/ICCChina.2018.8641219","url":null,"abstract":"In this paper, we propose a learning approach for sparse code multiple access (SCMA) signal detection by using a deep neural network via unfolding the procedure of message passing algorithm (MPA). The MPA can be converted to a sparsely connected neural network if we treat the weights as the parameters of a neural network. The neural network can be trained off-line and then deployed for online detection. By further refining the network weights corresponding to the edges of a factor graph, the proposed method achieves a better performance. Moreover, the deep neural network based detection is a computationally efficient since highly paralleled computations in the network are enabled in emerging Artificial Intelligence (AI) chips.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"149 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":"123427778","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.8641114
Yi Jin, Haiya Lu, Hao Jin, Cheng-lin Zhao, M. Peng
The networking architecture of 5G and various service requirements brings a huge challenge to the existing centralized mobility management due to the deployment of core functional modules in the core network. vMME is proposed as an alternative solution to meet different application demands. Among vMME mapping solutions, 1:N mapping is a prospective way for distributed mobility management. In this paper, the optimization of virtualized mobility management is investigated by using network function virtualization and service function chain for 1:3 mapping of vMME. A general signaling processing flow of vMME based on service function chain is analyzed. The optimization of vMME is formulated as an optimization problem to place chained VNFs of vMME and optimize the performance of vMME, by choosing the total signaling communication overhead cost and migration cost of state data as optimization objectives. Two heuristic algorithms including TSCMA and DMCMA are proposed and evaluated by simulation, and the performance of different VNF composition solutions under various application scenario parameters are presented.
{"title":"Optimization of Virtual Mobility Management based on NFV and SFC","authors":"Yi Jin, Haiya Lu, Hao Jin, Cheng-lin Zhao, M. Peng","doi":"10.1109/ICCCHINA.2018.8641114","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641114","url":null,"abstract":"The networking architecture of 5G and various service requirements brings a huge challenge to the existing centralized mobility management due to the deployment of core functional modules in the core network. vMME is proposed as an alternative solution to meet different application demands. Among vMME mapping solutions, 1:N mapping is a prospective way for distributed mobility management. In this paper, the optimization of virtualized mobility management is investigated by using network function virtualization and service function chain for 1:3 mapping of vMME. A general signaling processing flow of vMME based on service function chain is analyzed. The optimization of vMME is formulated as an optimization problem to place chained VNFs of vMME and optimize the performance of vMME, by choosing the total signaling communication overhead cost and migration cost of state data as optimization objectives. Two heuristic algorithms including TSCMA and DMCMA are proposed and evaluated by simulation, and the performance of different VNF composition solutions under various application scenario parameters are presented.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"49 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":"126648647","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.8641099
Ming Fang, Hui Tian, Gaofeng Nie, Yuwei Yao
Due to the low cost and flexible deployment, wireless self-backhaul can be a promising backhaul solution for ultradense heterogeneous networks (HetNets). In this paper, we investigate the scheduling issues in wireless self-backhaul HetNets. To coordinate the inter-cell interference among small base stations (SBSs), a graph coloring algorithm is used to divide the SBSs into multiple SBS sets. SBSs belonging to the same set can receive or transmit data at the same time. We formulate a slot and sub-channel allocation optimization problem to maximize the downlink (DL) throughput of all SBSs subject to access-backhaul link matching constraints and user data rate requirements. Since the formulated problem is Integer Non Linear Program (INLP) whose solution is intractable, the solution is obtained by dividing the problem into two sub-problems. Firstly, a Linear Problem (LP) is formulated for solving the slot allocation problem, which roughly guarantee user data rate and access-backhaul link matching requirements. Secondly, two low-complexity heuristic algorithms for sub-channel allocation are proposed. Each base station (BS) will use corresponding sub-channel allocation algorithm in a distributed manner at working slot.
{"title":"Joint Slot and Sub-channel Allocation Scheme in Wireless Self-Backhaul HetNets","authors":"Ming Fang, Hui Tian, Gaofeng Nie, Yuwei Yao","doi":"10.1109/ICCCHINA.2018.8641099","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641099","url":null,"abstract":"Due to the low cost and flexible deployment, wireless self-backhaul can be a promising backhaul solution for ultradense heterogeneous networks (HetNets). In this paper, we investigate the scheduling issues in wireless self-backhaul HetNets. To coordinate the inter-cell interference among small base stations (SBSs), a graph coloring algorithm is used to divide the SBSs into multiple SBS sets. SBSs belonging to the same set can receive or transmit data at the same time. We formulate a slot and sub-channel allocation optimization problem to maximize the downlink (DL) throughput of all SBSs subject to access-backhaul link matching constraints and user data rate requirements. Since the formulated problem is Integer Non Linear Program (INLP) whose solution is intractable, the solution is obtained by dividing the problem into two sub-problems. Firstly, a Linear Problem (LP) is formulated for solving the slot allocation problem, which roughly guarantee user data rate and access-backhaul link matching requirements. Secondly, two low-complexity heuristic algorithms for sub-channel allocation are proposed. Each base station (BS) will use corresponding sub-channel allocation algorithm in a distributed manner at working slot.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"56 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":"126603279","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.8641101
Jun Lu, Jialiang Gong, Xiaodong Xu, Yihua Hu
Reliable information transmission in complex electromagnetic interference environments is an essential proposition for wireless communication systems. This paper proposes an iterative structure for single antenna receiver, which combines both blind signal extraction (BSE) and convolutional neural network (CNN) to mitigate potential co-channel interference (CCI) as well as colored noise. Firstly, the single channel received signal is transformed into a multi-channel observations so that the proposed structure can use BSE to extract the target signal. Then, the belief propagation (BP) algorithm is employed to decode low-density parity-check (LDPC) codes. After that, the residual interferences and colored noise are iteratively learned by a one-dimensional CNN model and fed back to be gradually canceled out from the original input. Finally, a valid estimation of the desired sequence is obtained from the output of the BP decoder. The simulation results show that, in contrast, the proposed structure can effectively reduce the bit error rate (BER) of the system, which indicates that it has a strong ability to mitigate the co-channel interference and colored noise simultaneously.
{"title":"Co-Channel Interference and Colored Noise Mitigation: An Iterative Structure with Convolutional Neural Network","authors":"Jun Lu, Jialiang Gong, Xiaodong Xu, Yihua Hu","doi":"10.1109/ICCCHINA.2018.8641101","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641101","url":null,"abstract":"Reliable information transmission in complex electromagnetic interference environments is an essential proposition for wireless communication systems. This paper proposes an iterative structure for single antenna receiver, which combines both blind signal extraction (BSE) and convolutional neural network (CNN) to mitigate potential co-channel interference (CCI) as well as colored noise. Firstly, the single channel received signal is transformed into a multi-channel observations so that the proposed structure can use BSE to extract the target signal. Then, the belief propagation (BP) algorithm is employed to decode low-density parity-check (LDPC) codes. After that, the residual interferences and colored noise are iteratively learned by a one-dimensional CNN model and fed back to be gradually canceled out from the original input. Finally, a valid estimation of the desired sequence is obtained from the output of the BP decoder. The simulation results show that, in contrast, the proposed structure can effectively reduce the bit error rate (BER) of the system, which indicates that it has a strong ability to mitigate the co-channel interference and colored noise simultaneously.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"149 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":"116840173","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.8641162
Hung-Yun Hsieh, Hong-Chen Huang
In many wireless sensor networks, the distribution of sensor nodes involved in data transmission may be clustered as induced by the underlying geographical factor or protocol design. Instead of using the homogeneous Poisson Point Process (PPP), related work has investigated the Poisson Cluster Process (PCP) for modeling the location distribution of sensor nodes and obtaining analytical results such as the aggregate interference and outage probability for such networks. Many research endeavors, however, assume that data collectors are randomly deployed independently of the sensor nodes. While such an assumption lends itself for mathematical tractability, it is not typically how data collectors are deployed to relay data from sensor nodes to the backbone network. To address this pitfall, in this paper we consider the scenario where data collectors are deployed at the centers, or parent points, of the clusters in PCP. Since the locations of data collectors and sensor nodes are correlated, the independence assumption adopted in most related work cannot be applied. We first derive the analytical expression of the Laplace transform of the aggregate interference at each data collector and then obtain the closed-form lower bound of the transmission success probability for each sensor node to transmit data to the nearby data collector. Numerical evaluation shows that the derived lower bound matches the simulation results very well. In addition, we have also shown that placing data collectors at cluster centers, while mathematically involved for analysis, can achieve significant performance gain compared to conventional scenarios where data collectors and sensor nodes are distributed independently without any coordination.
{"title":"Interference and Outage in Clustered Wireless Sensor Networks with Cluster-Centric Data Collectors","authors":"Hung-Yun Hsieh, Hong-Chen Huang","doi":"10.1109/ICCCHINA.2018.8641162","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641162","url":null,"abstract":"In many wireless sensor networks, the distribution of sensor nodes involved in data transmission may be clustered as induced by the underlying geographical factor or protocol design. Instead of using the homogeneous Poisson Point Process (PPP), related work has investigated the Poisson Cluster Process (PCP) for modeling the location distribution of sensor nodes and obtaining analytical results such as the aggregate interference and outage probability for such networks. Many research endeavors, however, assume that data collectors are randomly deployed independently of the sensor nodes. While such an assumption lends itself for mathematical tractability, it is not typically how data collectors are deployed to relay data from sensor nodes to the backbone network. To address this pitfall, in this paper we consider the scenario where data collectors are deployed at the centers, or parent points, of the clusters in PCP. Since the locations of data collectors and sensor nodes are correlated, the independence assumption adopted in most related work cannot be applied. We first derive the analytical expression of the Laplace transform of the aggregate interference at each data collector and then obtain the closed-form lower bound of the transmission success probability for each sensor node to transmit data to the nearby data collector. Numerical evaluation shows that the derived lower bound matches the simulation results very well. In addition, we have also shown that placing data collectors at cluster centers, while mathematically involved for analysis, can achieve significant performance gain compared to conventional scenarios where data collectors and sensor nodes are distributed independently without any coordination.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"37 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":"116860770","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.8641185
Xiao-xiang Li, J. Jiao, Yunyu Sun, Shaohua Wu, Qinyu Zhang
With the development of high throughput satellites and space information networks (SINs), broadband satellite communication networks is viewed as an important component to improve system coverage and throughput in the upcoming fifth generation (5G) networks. In this paper, we propose a network coded (NCed) hybrid automatic repeat request (HARQ) transmission scheme for the backbone high throughput satellites in SINs, in order to satisfy the ever-increasing broadband communication service demands. We first present our NCed-HARQ transmission scheme for multiple unicast flows in a practical SIN downlink scenario. Then the mean number of NCed-HARQ transmission rounds is derived. Moreover, a new representation and calculation method by using the Laplace transform for reliable data delivery in NCed-HARQ is also presented, where the derivation of throughput expressions is in a matrix exponential distribution form. Finally, we compare the throughput performance of our NCed-HARQ with NCed-ARQ scheme and HARQ transmission scheme. Simulation results show that our NCed-HARQ transmission scheme can enhance the throughput, especially in the high signal-to-noise region.
{"title":"Design and Analysis of NCed-HARQ Transmission Scheme for Space Information Networks","authors":"Xiao-xiang Li, J. Jiao, Yunyu Sun, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641185","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641185","url":null,"abstract":"With the development of high throughput satellites and space information networks (SINs), broadband satellite communication networks is viewed as an important component to improve system coverage and throughput in the upcoming fifth generation (5G) networks. In this paper, we propose a network coded (NCed) hybrid automatic repeat request (HARQ) transmission scheme for the backbone high throughput satellites in SINs, in order to satisfy the ever-increasing broadband communication service demands. We first present our NCed-HARQ transmission scheme for multiple unicast flows in a practical SIN downlink scenario. Then the mean number of NCed-HARQ transmission rounds is derived. Moreover, a new representation and calculation method by using the Laplace transform for reliable data delivery in NCed-HARQ is also presented, where the derivation of throughput expressions is in a matrix exponential distribution form. Finally, we compare the throughput performance of our NCed-HARQ with NCed-ARQ scheme and HARQ transmission scheme. Simulation results show that our NCed-HARQ transmission scheme can enhance the throughput, especially in the high signal-to-noise region.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"20 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":"114977010","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.8641104
Suman Zhang, Cai Qin, Chaowei Wang, Weidong Wang, Yinghai Zhang
Multi-tag identification technique has been applied widely in the RFID system to increase flexibility of the system. However, it also brings serious tags collision issues, which demands the efficient anti-collision schemes. In this paper, we propose a Multi-target tags assignment slots algorithm based on Hash function (MTSH) for efficient multi-tag identification. The proposed algorithm can estimate the number of tags and dynamically adjust the frame length. Specifically, according to the number of tags, the proposed algorithm is composed of two cases. when the number of tags is small, a hash function is constructed to map the tags into corresponding slots. When the number of tags is large, the tags are grouped and randomly mapped into slots. During the tag identification, tags will be paired with a certain matching rate and then some tags will exit to improve the efficiency of the system. The simulation results indicate that the proposed algorithm outperforms the traditional anti-collision algorithms in terms of the system throughput, stability and identification efficiency.
{"title":"Slot Assignment Algorithm Based on Hash Function for Multi-target RFID System","authors":"Suman Zhang, Cai Qin, Chaowei Wang, Weidong Wang, Yinghai Zhang","doi":"10.1109/ICCCHINA.2018.8641104","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641104","url":null,"abstract":"Multi-tag identification technique has been applied widely in the RFID system to increase flexibility of the system. However, it also brings serious tags collision issues, which demands the efficient anti-collision schemes. In this paper, we propose a Multi-target tags assignment slots algorithm based on Hash function (MTSH) for efficient multi-tag identification. The proposed algorithm can estimate the number of tags and dynamically adjust the frame length. Specifically, according to the number of tags, the proposed algorithm is composed of two cases. when the number of tags is small, a hash function is constructed to map the tags into corresponding slots. When the number of tags is large, the tags are grouped and randomly mapped into slots. During the tag identification, tags will be paired with a certain matching rate and then some tags will exit to improve the efficiency of the system. The simulation results indicate that the proposed algorithm outperforms the traditional anti-collision algorithms in terms of the system throughput, stability and identification efficiency.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"34 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":"115188464","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.8641211
Zhibin Xu, Lixin Li, Ang Gao, Xu Li
The coexistence of conventional macro cells (MCs) and low power small cells (SCs) forms the heterogeneous networks (HetNets), which can significantly improve the capacity of wireless communication systems. However, the inter-cell interference between MCs and SCs due to sharing the same frequency band is always the key problem needed to be solved. In order to improve the sum rate and reduce backhaul link overhead, in this paper, we establish a mMIMO-HetNets model based on position coordinates and propose a threshold-based base station dynamic clustering method (I-Threshold) which is suitable for multi-users according to the average channel interference strength among SCs. We show that clustering facilitates intra-cluster coordination by enabling data exchange and channel training with reasonable backhaul communication within each SC cluster (SCC). The simulation results show that the proposed method has better performance than the existing methods in system sum rate under almost the same backhaul link overhead.
{"title":"A Clustering Method Based on the Average Interference Threshold for mMIMO-HetNet","authors":"Zhibin Xu, Lixin Li, Ang Gao, Xu Li","doi":"10.1109/ICCCHINA.2018.8641211","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641211","url":null,"abstract":"The coexistence of conventional macro cells (MCs) and low power small cells (SCs) forms the heterogeneous networks (HetNets), which can significantly improve the capacity of wireless communication systems. However, the inter-cell interference between MCs and SCs due to sharing the same frequency band is always the key problem needed to be solved. In order to improve the sum rate and reduce backhaul link overhead, in this paper, we establish a mMIMO-HetNets model based on position coordinates and propose a threshold-based base station dynamic clustering method (I-Threshold) which is suitable for multi-users according to the average channel interference strength among SCs. We show that clustering facilitates intra-cluster coordination by enabling data exchange and channel training with reasonable backhaul communication within each SC cluster (SCC). The simulation results show that the proposed method has better performance than the existing methods in system sum rate under almost the same backhaul link overhead.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"42 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":"123683827","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
扫码关注我们
求助内容：
应助结果提醒方式：