A novel secret key generation(SKG)method based on two-way randomness is proposed for TDD-SISO system.The legitimate transceivers mutually transmit their own random signal via reciprocal wireless channel,then the multi...A novel secret key generation(SKG)method based on two-way randomness is proposed for TDD-SISO system.The legitimate transceivers mutually transmit their own random signal via reciprocal wireless channel,then the multiplication of transmitted and received signal is used as common randomness to generate secret keys.In quasi-static channel,the theoretical SKG rates(SKGRs)of the three SKG methods,namely wireless channel based,one-way randomness and two-way randomness,are derived and compared.Further,two practical SKG schemes based on twoway randomness,Scheme-1bit and Scheme-3bit,are completely designed and simulated.Generally,Scheme-1bit applies to low signal to noise ratio(SNR)scenarios and achieves 0.13~0.86bit/T_s SKGR and 10^(-2)~10^(-5) level secret key outage probability(SKOP),while Scheme-3bit fits high SNR situation and obtains 0.93~1.35bit/T_s SKGR and 10^(-3)~10^(-4) level SKOP.At last,the national institute of standards and technology(NIST)test is conducted to evaluate the secret key randomness(SKRD)and the test results show that both of the proposed schemes have passed the test.展开更多
In this paper,the channel capacity of the multiple-input multiple-output(MIMO)visible light communication(VLC)system is investigated under the peak,average optical and electrical power constraints.Finding the channel ...In this paper,the channel capacity of the multiple-input multiple-output(MIMO)visible light communication(VLC)system is investigated under the peak,average optical and electrical power constraints.Finding the channel capacity of MIMO VLC is shown to be a mixed integer programming problem.To address this open problem,we propose an inexact gradient projection method to find the channel capacity-achieving discrete input distribution and the channel capacity of MIMO VLC.Also we derive both upper and lower bounds of the capacity of MIMO VLC with the closed-form expressions.Furthermore,by considering practical discrete constellation inputs,we develop the optimal power allocation scheme to maximize transmission rate of MIMO VLC system.Simulation results show that more discrete points are needed to achieve the channel capacity as SNR increases.Both the upper and lower bounds of channel capacity are tight at low SNR region.In addition,comparing the equal power allocation,the proposed power allocation scheme can significantly increase the rate for the low-order modulation inputs.展开更多
The ever increasing wireless data services, such asimaging, video, audio, multimedia, etc., have de-mands for the very high speed wireless communicationsand network, which are unfortunately a bottleneck whencombining ...The ever increasing wireless data services, such asimaging, video, audio, multimedia, etc., have de-mands for the very high speed wireless communicationsand network, which are unfortunately a bottleneck whencombining with the wireline core network. Users＇ arenow expecting high quality of experience with low-costdevices, ubiquitous connectivity, energy efficiency, highreliability, or even ultra-low latency if a vehicle terminalis applied.展开更多
Despite the critical role that middleboxes play in introducing new network functionality,management and innovation of them are still severe challenges for network operators,since traditional middleboxes based on hardw...Despite the critical role that middleboxes play in introducing new network functionality,management and innovation of them are still severe challenges for network operators,since traditional middleboxes based on hardware lack service flexibility and scalability.Recently,though new networking technologies,such as network function virtualization(NFV) and softwaredefined networking(SDN),are considered as very promising drivers to design cost-efficient middlebox service architectures,how to guarantee transmission efficiency has drawn little attention under the condition of adding virtual service process for traffic.Therefore,we focus on the service deployment problem to reduce the transport delay in the network with a combination of NFV and SDN.First,a framework is designed for service placement decision,and an integer linear programming model is proposed to resolve the service placement and minimize the network transport delay.Then a heuristic solution is designed based on the improved quantum genetic algorithm.Experimental results show that our proposed method can calculate automatically the optimal placement schemes.Our scheme can achieve lower overall transport delay for a network compared with other schemes and reduce 30% of the average traffic transport delay compared with the random placement scheme.展开更多
This paper proposes a novel algorithm for Two-Dimensional(2D) central Directionof-Arrival(DOA) estimation of incoherently distributed sources. In particular, an orthogonal array structure consisting of two Non-uniform...This paper proposes a novel algorithm for Two-Dimensional(2D) central Directionof-Arrival(DOA) estimation of incoherently distributed sources. In particular, an orthogonal array structure consisting of two Non-uniform Linear Arrays(NLAs) is considered. Based on first-order Taylor series approximation, the Generalized Array Manifold(GAM) model can first be established to separate the central DOAs from the original array manifold. Then, the Hadamard rotational invariance relationships inside the GAMs of two NLAs are identified. With the aid of such relationships, the central elevation and azimuth DOAs can be estimated through a search-free polynomial rooting method. Additionally, a simple parameter pairing of the estimated 2D angular parameters is also accomplished via the Hadamard rotational invariance relationship inside the GAM of the whole array. A secondary but important result is a derivation of closed-form expressions of the Cramer-Rao lower bound. The simulation results show that the proposed algorithm can achieve a remarkably higher precision at less complexity increment compared with the existing low-complexity methods, which benefits from the larger array aperture of the NLAs. Moreover, it requires no priori information about the angular distributed function.展开更多
Surface remeshing is widely required in modeling, animation, simulation, and many other computer graphics applications. Improving the elements' quality is a challenging task in surface remeshing. Existing methods ...Surface remeshing is widely required in modeling, animation, simulation, and many other computer graphics applications. Improving the elements' quality is a challenging task in surface remeshing. Existing methods often fail to efficiently remove poor-quality elements especially in regions with sharp features. In this paper, we propose and use a robust segmentation method followed by remeshing the segmented mesh. Mesh segmentation is initiated using an existing Live-wire interaction approach and is further refined using local mesh operations. The refined segmented mesh is finally sent to the remeshing pipeline, in which each mesh segment is remeshed independently. An experimental study compares our mesh segmentation method as well as remeshing results with representative existing methods. We demonstrate that the proposed segmentation method is robust and suitable for remeshing.展开更多
基金supported by National Natural Science Foundation of China(61521003,61501516,61471396,61401510)Postdoctoral Science Foundation of China(2016M592990)
文摘A novel secret key generation(SKG)method based on two-way randomness is proposed for TDD-SISO system.The legitimate transceivers mutually transmit their own random signal via reciprocal wireless channel,then the multiplication of transmitted and received signal is used as common randomness to generate secret keys.In quasi-static channel,the theoretical SKG rates(SKGRs)of the three SKG methods,namely wireless channel based,one-way randomness and two-way randomness,are derived and compared.Further,two practical SKG schemes based on twoway randomness,Scheme-1bit and Scheme-3bit,are completely designed and simulated.Generally,Scheme-1bit applies to low signal to noise ratio(SNR)scenarios and achieves 0.13~0.86bit/T_s SKGR and 10^(-2)~10^(-5) level secret key outage probability(SKOP),while Scheme-3bit fits high SNR situation and obtains 0.93~1.35bit/T_s SKGR and 10^(-3)~10^(-4) level SKOP.At last,the national institute of standards and technology(NIST)test is conducted to evaluate the secret key randomness(SKRD)and the test results show that both of the proposed schemes have passed the test.
基金supported by the Graduate Innovation Program of China University of Mining and Technology (2022WLKXJ016)in part by the Postgraduate Research&Practice Innovation Program of Jiangsu Province (KYCX222549)+3 种基金supported by Shaanxi Provincial Natural Science Foundation of China (2023-JC-YB-510)the Fundamental Research Funds for the Central Universities,CHD (300102322103)supported in part by Natural Science Foundation of Jiangsu Province (BK20200488)supported in part by Challenge Cup National Student Curricular Academic Science and Technology Works Competition (DCXM202212)。
文摘In this paper,the channel capacity of the multiple-input multiple-output(MIMO)visible light communication(VLC)system is investigated under the peak,average optical and electrical power constraints.Finding the channel capacity of MIMO VLC is shown to be a mixed integer programming problem.To address this open problem,we propose an inexact gradient projection method to find the channel capacity-achieving discrete input distribution and the channel capacity of MIMO VLC.Also we derive both upper and lower bounds of the capacity of MIMO VLC with the closed-form expressions.Furthermore,by considering practical discrete constellation inputs,we develop the optimal power allocation scheme to maximize transmission rate of MIMO VLC system.Simulation results show that more discrete points are needed to achieve the channel capacity as SNR increases.Both the upper and lower bounds of channel capacity are tight at low SNR region.In addition,comparing the equal power allocation,the proposed power allocation scheme can significantly increase the rate for the low-order modulation inputs.
文摘The ever increasing wireless data services, such asimaging, video, audio, multimedia, etc., have de-mands for the very high speed wireless communicationsand network, which are unfortunately a bottleneck whencombining with the wireline core network. Users＇ arenow expecting high quality of experience with low-costdevices, ubiquitous connectivity, energy efficiency, highreliability, or even ultra-low latency if a vehicle terminalis applied.
基金supported by the National Basic Research Program(973)of China(Nos.2012CB315901 and 2013CB329104)the National Natural Science Foundation of China(Nos.61309019,61372121,61572519,and 61502530)the National High-Tech R&D Program(863)of China(Nos.2015AA016102 and 2013AA013505)
文摘Despite the critical role that middleboxes play in introducing new network functionality,management and innovation of them are still severe challenges for network operators,since traditional middleboxes based on hardware lack service flexibility and scalability.Recently,though new networking technologies,such as network function virtualization(NFV) and softwaredefined networking(SDN),are considered as very promising drivers to design cost-efficient middlebox service architectures,how to guarantee transmission efficiency has drawn little attention under the condition of adding virtual service process for traffic.Therefore,we focus on the service deployment problem to reduce the transport delay in the network with a combination of NFV and SDN.First,a framework is designed for service placement decision,and an integer linear programming model is proposed to resolve the service placement and minimize the network transport delay.Then a heuristic solution is designed based on the improved quantum genetic algorithm.Experimental results show that our proposed method can calculate automatically the optimal placement schemes.Our scheme can achieve lower overall transport delay for a network compared with other schemes and reduce 30% of the average traffic transport delay compared with the random placement scheme.
基金supported by the National Natural Science Foundation of China(No.61401513)
文摘This paper proposes a novel algorithm for Two-Dimensional(2D) central Directionof-Arrival(DOA) estimation of incoherently distributed sources. In particular, an orthogonal array structure consisting of two Non-uniform Linear Arrays(NLAs) is considered. Based on first-order Taylor series approximation, the Generalized Array Manifold(GAM) model can first be established to separate the central DOAs from the original array manifold. Then, the Hadamard rotational invariance relationships inside the GAMs of two NLAs are identified. With the aid of such relationships, the central elevation and azimuth DOAs can be estimated through a search-free polynomial rooting method. Additionally, a simple parameter pairing of the estimated 2D angular parameters is also accomplished via the Hadamard rotational invariance relationship inside the GAM of the whole array. A secondary but important result is a derivation of closed-form expressions of the Cramer-Rao lower bound. The simulation results show that the proposed algorithm can achieve a remarkably higher precision at less complexity increment compared with the existing low-complexity methods, which benefits from the larger array aperture of the NLAs. Moreover, it requires no priori information about the angular distributed function.
基金the National Natural Science Foundation of China(Nos.61772523,61372168,61620106003,and 61331018)supported by a Chinese Government Scholarship
文摘Surface remeshing is widely required in modeling, animation, simulation, and many other computer graphics applications. Improving the elements' quality is a challenging task in surface remeshing. Existing methods often fail to efficiently remove poor-quality elements especially in regions with sharp features. In this paper, we propose and use a robust segmentation method followed by remeshing the segmented mesh. Mesh segmentation is initiated using an existing Live-wire interaction approach and is further refined using local mesh operations. The refined segmented mesh is finally sent to the remeshing pipeline, in which each mesh segment is remeshed independently. An experimental study compares our mesh segmentation method as well as remeshing results with representative existing methods. We demonstrate that the proposed segmentation method is robust and suitable for remeshing.
