By combining fractal theory with D-S evidence theory, an algorithm based on the fusion of multi-fractal features is presented. Fractal features are extracted, and basic probability assignment function is designed. Com...By combining fractal theory with D-S evidence theory, an algorithm based on the fusion of multi-fractal features is presented. Fractal features are extracted, and basic probability assignment function is designed. Comparison and simulation are performed on the new algorithm, the old algorithm based on single feature and the algorithm based on neural network. Results of the comparison and simulation illustrate that the new algorithm is feasible and valid.展开更多
To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SO...To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.展开更多
In this paper, the uniqueness of meromorphic functions with common range sets and deficient values are studied. This result is related to a question of Gross.
The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes i...The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes is time-varied due to primary user/secondary user(PU/SU) activity and mobility, which result in non-determinacy. This paper studies the spectrum allocation for CRNs with non-deterministic bandwidth of spectrum holes. We present a novel probability density function(PDF) through order statistics as well as its simplified form to describe the statistical properties of spectrum holes, with which a statistical spectrum allocation model based on stochastic multiple knapsack problem(MKP) is formulated for spectrum allocation with non-deterministic bandwidth of spectrum holes. To reduce the computational complexity, we transform this stochastic programming problem into a constant MKP through exploiting the properties of cumulative distribution function(CDF), which can be solved via MTHG algorithm by using auxiliary variables. Simulation results illustrate that the proposed statistical spectrum allocation algorithm can achieve better performance compared with the existing algorithms when the bandwidth of spectrum holes is time-varied.展开更多
This paper investigates the achievable uplink spectral efficiency(SE) of a massive multi-input multi-output(MIMO) system with a mixed analog-to-digital converter(ADC) receiver architecture, in which some antennas are ...This paper investigates the achievable uplink spectral efficiency(SE) of a massive multi-input multi-output(MIMO) system with a mixed analog-to-digital converter(ADC) receiver architecture, in which some antennas are equipped with full-resolution ADCs while others are deployed with low-resolution ADCs. We derive the theoretical results and corresponding approximate expressions of the achievable SE in multi-cell systems with maximum ratio combining(MRC) detector and in single-cell systems with zero-forcing(ZF) detector. Based on approximated results, the effects of physical parameters, including the transmit power, the number of antennas, the proportion of full-resolution ADCs and the quantization precision of the low-resolution ADCs on the achievable SE are revealed. Furthermore, we propose the power allocation algorithms based on the lower bound and upper bound of approximate achievable SE. Our results show that the total achievable SE improves by increasing the number of BS antennas, the signal-to-noise ratio(SNR), and the quantization precision. Results showcase that proposed power allocation algorithms remarkably improve the total achievable SE comparing to the equal power allocation algorithm, which verifies the effectiveness of our proposed schemes.展开更多
The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consi...The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are ignored.In this paper,we first propose the resource allocation with the dynamic SN,and denote it as GraphMap-DS.Then,we propose an efficient mapping algorithm for GraphMap-DS.The performance of the proposed algorithm is evaluated by performing simulation experiments.Our results show that the proposed algorithm can effectively solve the GraphMap-DS.展开更多
The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of f...The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of flow table.Based on the analysis of the difference of the definition of network resource between SDN and traditional IP network,the idea of the integrated allocation of link bandwidth and flow table for multiple control applications in SDN is proposed in this paper.Furthermore,a price-based joint allocation model of network resource in SDN is built by introducing the price for each of the resources,which can get the proportional fair allocation of link bandwidth and the minimum global delay at the same time.We have also designed a popular flow scheduling policy based on the proportional fair allocation of link bandwidth in order to achieve the minimum global delay.A flow scheduling module has been implemented and evaluated in Floodlight,named virtual forwarding space(VFS).VFS can not only implement the fair allocation of link bandwidth and minimum delay flow scheduling in data plane but also accelerate packet forwarding by looking up control rules in control plane.展开更多
Since FCC's opening for white space(WS) utilization,database-assisted dynamic spectrum access(DSA) has become the de facto solution for the realization of dynamic spectrum sharing(DSS),due to its simplicity and co...Since FCC's opening for white space(WS) utilization,database-assisted dynamic spectrum access(DSA) has become the de facto solution for the realization of dynamic spectrum sharing(DSS),due to its simplicity and compatibility with commercial off-the-shelf(COTS) devices.It is envisioned that such technology will strongly support the prosperous wireless multimedia networking(WMN) applications with satisfying QoS guarantees in the future.However,how to counter the time-frequency variant property when exploiting the WS spectrum for the provision of these services to secondary users(SUs) still remains a great challenge.In such context,a dynamic secondary access scheme for database-assisted spectrum sharing networks is proposed in this paper.In the beginning,the spectrum requirements of SUs for diverse services are modeled by considering the minimum required service data-rate and spectrum access duration.Afterwards,the spectrum demand evaluation and bidding policy are formulated based on the service classes of SUs.Furthermore,a doublephase(DP) spectrum allocation scheme,which consists of the initial resource allocation phase and resource allocation adjustment phase,is carefully designed for DSA.Finally,extensive simulations are conducted and the results demonstrate that our scheme can increase the spectrum trading revenue and adapt to varying service requirements.展开更多
Dry coal beneficiation using an air dense medium fluidized bed (ADMFB) requires the formation of a sta- ble and uniform bed from the dense medium. Others have shown that the structure and geometric parameters of the a...Dry coal beneficiation using an air dense medium fluidized bed (ADMFB) requires the formation of a sta- ble and uniform bed from the dense medium. Others have shown that the structure and geometric parameters of the air distributor have a significant influence on the experimentally observed fluidization quality. In this study we used a sintered metal distributor (SMD) in the ADMFB separator and study its effect on the fluidization quality. The results show that for the same open area ratio (OAR), a smaller aper- ture in the SMD will provide improved fluidization quality. If aperture size is held constant bigger open area ratios result in improved fluidization quality. And, the fluidization quality also improves when the pressure drop across the SMD increases. A model relating distributor pressure drop and the geometric parameters of the SMD is also proposed.展开更多
In recent years, wireless communication systems have experienced tremendous growth in data traffic. Many capacity-enhancing techniques are applied to elevate the gap between the amount of traffic and network capacity,...In recent years, wireless communication systems have experienced tremendous growth in data traffic. Many capacity-enhancing techniques are applied to elevate the gap between the amount of traffic and network capacity, and more solutions are required to minimize the gap. Traffic allocation among multiple networks is regarded as one of the most effective methods to solve the problem. However, current studies are unable to derive the quantity of traffic that each network should carry. An intelligent traffic allocation algorithm for multiple networks is proposed to obtain the optimal traffic distribution. Multiple factors affecting traffic distribution are considered in the proposed algorithm, such as network coverage, network cost, user habit, service types, network capacity and terminals. Using evaluations, we proved that the proposed algorithm enables a lower network cost than load balancing schemes. A case study of strategy rmldng for a 2G system refarming is presented to further illustrate the applicability of the proposed algorithm. We demonstrated that the new algorithm could be applied in strategy rmldng for telecommunication operators.展开更多
In this paper, we consider the problem of the uniqueness for meromorphic functions whose n-th derivatives share the same 1-points. The results in this paper are different from all of theorems given by H X Yi and C C Y...In this paper, we consider the problem of the uniqueness for meromorphic functions whose n-th derivatives share the same 1-points. The results in this paper are different from all of theorems given by H X Yi and C C Yang and other authors.展开更多
Cloud computing provides the essential infrastructure for multi-tier Ambient Assisted Living(AAL) applications that facilitate people's lives. Resource provisioning is a critically important problem for AAL applic...Cloud computing provides the essential infrastructure for multi-tier Ambient Assisted Living(AAL) applications that facilitate people's lives. Resource provisioning is a critically important problem for AAL applications in cloud data centers(CDCs). This paper focuses on modeling and analysis of multi-tier AAL applications, and aims to optimize resource provisioning while meeting requests' response time constraint. This paper models a multi-tier AAL application as a hybrid multi-tier queueing model consisting of an M/M/c queueing model and multiple M/M/1 queueing models. Then, virtual machine(VM) allocation is formulated as a constrained optimization problem in a CDC, and is further solved with the proposed heuristic VM allocation algorithm(HVMA). The results demonstrate that the proposed model and algorithm can effectively achieve dynamic resource provisioning while meeting the performance constraint.展开更多
In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we pro...In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we propose a novel random access(RA) and resource allocation scheme for the coexistence of NOMA-based and OMAbased machine-to-machine(M2M) communications,which aims at improving the number of successful data packet transmissions and guaranteeing the quality of service(Qo S) (e.g.,the minimum data rate requirement) for M2 M communications.The algorithm of joint user equipment(UE) paring and power allocation is proposed for the coexisting RA(i.e.,the coexistence of NOMA-based RA and OMA-based RA) .The resource allocation for the coexisting RA is investigated,thus improving the number of successful data packet transmissions by more efficiently using the radio resources.Simulation results demonstrate that the proposed RA and resource allocation scheme outperforms the conventional RA in terms of the number of successful data packet transmissions,thus is a promising technology in future M2 M communications.展开更多
In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protoco...In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are （0,1.5%], （1.5,4%], and （4,11%], using the Hamming （31,26）, （15,11）, and （7,4） codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate （BER） with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96×10^-10, and when the confidence is 95% the corresponding BER upper limit is 2.17×10^-9. By comparison, for the single （7,4） Hamming code error reconciliation scheme at a confidence of 95%,the key generation rate is only 6.09%, while the BER expectation is 5.92x 10＂9, with a BER upper limit of 4.34×10^-8. Hence, our improved protocol is much better than the original one.展开更多
This paper is on a distribution question of Ⅰ type in the combinatorics (see: 'Ke Zhao, Wei WanDi, combinatorial theory, science press, 1981. '). Suppose n distrinct balls, m distinct boxes. The capacity set...This paper is on a distribution question of Ⅰ type in the combinatorics (see: 'Ke Zhao, Wei WanDi, combinatorial theory, science press, 1981. '). Suppose n distrinct balls, m distinct boxes. The capacity set of every box is Now,place the n balls into the m boxes. Thenumber of distinct placed ways is expressed by , and simply by And it is called the distribution number.Main result is:Theorem The exponential generating function of sequence isThus .there is the recurrence relationhere (integer set).展开更多
文摘By combining fractal theory with D-S evidence theory, an algorithm based on the fusion of multi-fractal features is presented. Fractal features are extracted, and basic probability assignment function is designed. Comparison and simulation are performed on the new algorithm, the old algorithm based on single feature and the algorithm based on neural network. Results of the comparison and simulation illustrate that the new algorithm is feasible and valid.
基金supported by the 863 Program (2015AA01A705)NSFC (61271187)
文摘To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.
文摘In this paper, the uniqueness of meromorphic functions with common range sets and deficient values are studied. This result is related to a question of Gross.
基金supported by the National Natural Science Foundation of China (No.61501065, 91438104,No.61571069 and No.61601067)the Fundamental Research Funds for the Central Universities (No.106112015CDJXY160002,No.106112016CDJXY160001)the Chongqing Research Program of Basic Research and Frontier Technology (No.CSTC2016JCYJA0021)
文摘The spectrum allocation for cognitive radio networks(CRNs) has received considerable studies under the assumption that the bandwidth of spectrum holes is static. However, in practice, the bandwidth of spectrum holes is time-varied due to primary user/secondary user(PU/SU) activity and mobility, which result in non-determinacy. This paper studies the spectrum allocation for CRNs with non-deterministic bandwidth of spectrum holes. We present a novel probability density function(PDF) through order statistics as well as its simplified form to describe the statistical properties of spectrum holes, with which a statistical spectrum allocation model based on stochastic multiple knapsack problem(MKP) is formulated for spectrum allocation with non-deterministic bandwidth of spectrum holes. To reduce the computational complexity, we transform this stochastic programming problem into a constant MKP through exploiting the properties of cumulative distribution function(CDF), which can be solved via MTHG algorithm by using auxiliary variables. Simulation results illustrate that the proposed statistical spectrum allocation algorithm can achieve better performance compared with the existing algorithms when the bandwidth of spectrum holes is time-varied.
基金supported in part by the National Science Foundation(NSFC)for Distinguished Young Scholars of China with Grant 61625106the National Natural Science Foundation of China under Grant 61531011+1 种基金the Hong Kong,Macao and Taiwan Science and Technology Cooperation Program of China(2016YFE0123100)the Guangzhou University project under Grant 27000503123
文摘This paper investigates the achievable uplink spectral efficiency(SE) of a massive multi-input multi-output(MIMO) system with a mixed analog-to-digital converter(ADC) receiver architecture, in which some antennas are equipped with full-resolution ADCs while others are deployed with low-resolution ADCs. We derive the theoretical results and corresponding approximate expressions of the achievable SE in multi-cell systems with maximum ratio combining(MRC) detector and in single-cell systems with zero-forcing(ZF) detector. Based on approximated results, the effects of physical parameters, including the transmit power, the number of antennas, the proportion of full-resolution ADCs and the quantization precision of the low-resolution ADCs on the achievable SE are revealed. Furthermore, we propose the power allocation algorithms based on the lower bound and upper bound of approximate achievable SE. Our results show that the total achievable SE improves by increasing the number of BS antennas, the signal-to-noise ratio(SNR), and the quantization precision. Results showcase that proposed power allocation algorithms remarkably improve the total achievable SE comparing to the equal power allocation algorithm, which verifies the effectiveness of our proposed schemes.
基金supported by the National Basic Research of China(973 Program)under Grant No.2011CB302601the National Natural Science Foundation of China under Grants No.90818028,No.6903043,No.61202117the National High Technology Research and Development Program of China(863 Program)under Grant No.2012AA011201
文摘The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are ignored.In this paper,we first propose the resource allocation with the dynamic SN,and denote it as GraphMap-DS.Then,we propose an efficient mapping algorithm for GraphMap-DS.The performance of the proposed algorithm is evaluated by performing simulation experiments.Our results show that the proposed algorithm can effectively solve the GraphMap-DS.
基金Supported by the National High-tech R&D Program("863" Program) of China (No.2013AA013505)the National Science Foundation of China(No.61472213)National Research Foundation of Korea(NRF 2014K1A1A2064649)
文摘The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of flow table.Based on the analysis of the difference of the definition of network resource between SDN and traditional IP network,the idea of the integrated allocation of link bandwidth and flow table for multiple control applications in SDN is proposed in this paper.Furthermore,a price-based joint allocation model of network resource in SDN is built by introducing the price for each of the resources,which can get the proportional fair allocation of link bandwidth and the minimum global delay at the same time.We have also designed a popular flow scheduling policy based on the proportional fair allocation of link bandwidth in order to achieve the minimum global delay.A flow scheduling module has been implemented and evaluated in Floodlight,named virtual forwarding space(VFS).VFS can not only implement the fair allocation of link bandwidth and minimum delay flow scheduling in data plane but also accelerate packet forwarding by looking up control rules in control plane.
基金supported in part by Major State Basic Research Development Program of China(973 Program)(No.2009CB320403)National Natural Science Foundation of China(61420106008,61221001, 61201222,61100213)+5 种基金the 111 Project (B07022)China Scholarship CouncilShanghai Key Laboratory of Digital Media Processing and Transmissionsthe funds of MIIT of China(Grant No.2011ZX03001-007-03)Research Grant SRG030-FST13-HF from the University of Macaothe NSERC,Canada
文摘Since FCC's opening for white space(WS) utilization,database-assisted dynamic spectrum access(DSA) has become the de facto solution for the realization of dynamic spectrum sharing(DSS),due to its simplicity and compatibility with commercial off-the-shelf(COTS) devices.It is envisioned that such technology will strongly support the prosperous wireless multimedia networking(WMN) applications with satisfying QoS guarantees in the future.However,how to counter the time-frequency variant property when exploiting the WS spectrum for the provision of these services to secondary users(SUs) still remains a great challenge.In such context,a dynamic secondary access scheme for database-assisted spectrum sharing networks is proposed in this paper.In the beginning,the spectrum requirements of SUs for diverse services are modeled by considering the minimum required service data-rate and spectrum access duration.Afterwards,the spectrum demand evaluation and bidding policy are formulated based on the service classes of SUs.Furthermore,a doublephase(DP) spectrum allocation scheme,which consists of the initial resource allocation phase and resource allocation adjustment phase,is carefully designed for DSA.Finally,extensive simulations are conducted and the results demonstrate that our scheme can increase the spectrum trading revenue and adapt to varying service requirements.
基金The financial support by the Natural Science Foundation of China for Innovative Research Group (No. 50921002) and Key Projects(No. 51134022) in Coal Joint Fund provided by National Natural Science Foundation-Shenhua Group
文摘Dry coal beneficiation using an air dense medium fluidized bed (ADMFB) requires the formation of a sta- ble and uniform bed from the dense medium. Others have shown that the structure and geometric parameters of the air distributor have a significant influence on the experimentally observed fluidization quality. In this study we used a sintered metal distributor (SMD) in the ADMFB separator and study its effect on the fluidization quality. The results show that for the same open area ratio (OAR), a smaller aper- ture in the SMD will provide improved fluidization quality. If aperture size is held constant bigger open area ratios result in improved fluidization quality. And, the fluidization quality also improves when the pressure drop across the SMD increases. A model relating distributor pressure drop and the geometric parameters of the SMD is also proposed.
基金supported partially by the National Science and Technology Major Projects under Grants No. 2012ZX03006003-005,No. 2012ZX03003006-002,and No. 2010ZX03002-008-01
文摘In recent years, wireless communication systems have experienced tremendous growth in data traffic. Many capacity-enhancing techniques are applied to elevate the gap between the amount of traffic and network capacity, and more solutions are required to minimize the gap. Traffic allocation among multiple networks is regarded as one of the most effective methods to solve the problem. However, current studies are unable to derive the quantity of traffic that each network should carry. An intelligent traffic allocation algorithm for multiple networks is proposed to obtain the optimal traffic distribution. Multiple factors affecting traffic distribution are considered in the proposed algorithm, such as network coverage, network cost, user habit, service types, network capacity and terminals. Using evaluations, we proved that the proposed algorithm enables a lower network cost than load balancing schemes. A case study of strategy rmldng for a 2G system refarming is presented to further illustrate the applicability of the proposed algorithm. We demonstrated that the new algorithm could be applied in strategy rmldng for telecommunication operators.
基金Foundation item: Supported by the NSF of China(10471028)Supported by the NSF of Guangdong Province(020586) Supported by the Guangzhou Education Bureau(2006, 2025)Supported by the Grant-in-Aid for Scientific Research 2004(15540151)Supported by the Japan Society for the Promotion of Science
文摘In this paper, we consider the problem of the uniqueness for meromorphic functions whose n-th derivatives share the same 1-points. The results in this paper are different from all of theorems given by H X Yi and C C Yang and other authors.
文摘Cloud computing provides the essential infrastructure for multi-tier Ambient Assisted Living(AAL) applications that facilitate people's lives. Resource provisioning is a critically important problem for AAL applications in cloud data centers(CDCs). This paper focuses on modeling and analysis of multi-tier AAL applications, and aims to optimize resource provisioning while meeting requests' response time constraint. This paper models a multi-tier AAL application as a hybrid multi-tier queueing model consisting of an M/M/c queueing model and multiple M/M/1 queueing models. Then, virtual machine(VM) allocation is formulated as a constrained optimization problem in a CDC, and is further solved with the proposed heuristic VM allocation algorithm(HVMA). The results demonstrate that the proposed model and algorithm can effectively achieve dynamic resource provisioning while meeting the performance constraint.
基金supported by the National Natural Science Foundation of China(61501056)National Science and Technology Major Project of China(No.2016ZX03001012)the Research Fund of ZTE Corporation
文摘In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we propose a novel random access(RA) and resource allocation scheme for the coexistence of NOMA-based and OMAbased machine-to-machine(M2M) communications,which aims at improving the number of successful data packet transmissions and guaranteeing the quality of service(Qo S) (e.g.,the minimum data rate requirement) for M2 M communications.The algorithm of joint user equipment(UE) paring and power allocation is proposed for the coexisting RA(i.e.,the coexistence of NOMA-based RA and OMA-based RA) .The resource allocation for the coexisting RA is investigated,thus improving the number of successful data packet transmissions by more efficiently using the radio resources.Simulation results demonstrate that the proposed RA and resource allocation scheme outperforms the conventional RA in terms of the number of successful data packet transmissions,thus is a promising technology in future M2 M communications.
基金supported in part by the Foundation for Key Program of Chinese Ministry of Education under Grant No.212177Scientific Research Foundation of the Education Department of Shaanxi Province under Grant No.12JK0973
文摘In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are （0,1.5%], （1.5,4%], and （4,11%], using the Hamming （31,26）, （15,11）, and （7,4） codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate （BER） with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96×10^-10, and when the confidence is 95% the corresponding BER upper limit is 2.17×10^-9. By comparison, for the single （7,4） Hamming code error reconciliation scheme at a confidence of 95%,the key generation rate is only 6.09%, while the BER expectation is 5.92x 10＂9, with a BER upper limit of 4.34×10^-8. Hence, our improved protocol is much better than the original one.
文摘This paper is on a distribution question of Ⅰ type in the combinatorics (see: 'Ke Zhao, Wei WanDi, combinatorial theory, science press, 1981. '). Suppose n distrinct balls, m distinct boxes. The capacity set of every box is Now,place the n balls into the m boxes. Thenumber of distinct placed ways is expressed by , and simply by And it is called the distribution number.Main result is:Theorem The exponential generating function of sequence isThus .there is the recurrence relationhere (integer set).
