A Novel System Model based on Cost-prediction for Spectrum Leasing in Cognitive Radio

In current researches on spectrum leasing, Common model and Property-right model are two main approaches to dynamic spectrum sharing. However, Common model does not consider the obligation of Primary System (PS) and is unfair to Secondary System (SS), while the cooperation based on Property-rights model has problems on its feasibility. This paper proposes a novel system model, in which a Cost-Prediction scheme for Spectrum Leasing (CPSL scheme) is designed to forecast the cost that PS would pay for leasing spectrum. Cost Function is introduced as a criterion to evaluate the potential cost of spectrum leasing for PS. The simulation results show that compared with Common model based scheme, CPSL scheme substantially improves the QoS of the delay-sensitive traffic in SS at the cost of a small degradation of PS performance.

Dynamic load sharing behavior of transverse-torsional coupled planetary gear train with multiple clearances

A new nonlinear transverse-torsional coupled model with backlash and bearing clearance was proposed for planetary gear set. Meanwhile, sun gear and planet's eccentricity errors, static transmission error, and time-varying meshing stiffness were taken into consideration. The differential governing equations of motion were solved by employing variable step-size Rung-Kutta numerical integration method. The behavior of dynamic load sharing characteristics affected by the system parameters including input rate, sun gear's supporting stiffness and eccentricity error, planet's eccentricity error, sun gear's bearing clearance, backlashes of sun-planet and planet-ring meshes were investigated qualitatively and systematically. Some theoretical results are summarized at last which extend the current understanding of the dynamic load sharing behavior of planet gear train, enrich the related literature and provide references for the design of planetary gear train.

Proactive Spectrum Monitoring for Suspicious Wireless Powered Communications in Dynamic Spectrum Sharing Networks

This paper studies the proactive spec-trum monitoring with one half-duplex spectrum moni-tor(SM)to cope with the potential suspicious wireless powered communications(SWPC)in dynamic spec-trum sharing networks.The jamming-assisted spec-trum monitoring scheme via spectrum monitoring data(SMD)transmission is proposed to maximize the sum ergodic monitoring rate at SM.In SWPC,the suspi-cious communications of each data block occupy mul-tiple independent blocks,with a block dedicated to the wireless energy transfer by the energy-constrained suspicious nodes with locations in a same cluster(symmetric scene)or randomly distributed(asymmet-ric scene)and the remaining blocks used for the in-formation transmission from suspicious transmitters(STs)to suspicious destination(SD).For the sym-metric scene,with a given number of blocks for SMD transmission,namely the jamming operation,we first reveal that SM should transmit SMD signal(jam the SD)with tolerable maximum power in the given blocks.The perceived suspicious signal power at SM could be maximized,and thus so does the correspond-ing sum ergodic monitoring rate.Then,we further reveal one fundamental trade-off in deciding the op-timal number of given blocks for SMD transmission.For the asymmetric scene,a low-complexity greedy block selection scheme is proposed to guarantee the optimal performance.Simulation results show that the jamming-assisted spectrum monitoring schemes via SMD transmission achieve much better perfor-mance than conventional passive spectrum monitor-ing,since the proposed schemes can obtain more accu-rate and effective spectrum characteristic parameters,which provide basic support for fine-grained spectrum management and a solution for spectrum security in dynamic spectrum sharing network.

Dynamic Vector Space Secret Sharing Based on Certificates

A vector space secret sharing scheme based on certificates is proposed in this paper. The difficulties of solving discrete logarithm assure confidential information＇s security, and the use of each participant＇s certificate makes the dealer have no need to transfer secret information to the participants. The proposed scheme is dynamic. It can effectively check cheaters and does not have secure channel requirements.

A P2P Reference Model

P2P is a complex system.Many researches on P2P architecture have been done.These researches have provided valuable references for the standardization of P2P technology.However,the standardization can not be achieved because there are still some problems in existing studies.This paper proposes a 5-layer reference model which clearly defines the functionalities of each layer,and distinctly describes the interface and the relationship between layers.This model is able to clearly show the internal structure of P2P system and the working process of data flow in P2P system.Validation shows that this model is general and rational.

DSS技术在联通电信5G基站建设规划中的应用及发展

本文通过DSS技术在联通电信建设规划中的地位引入,阐述了DSS技术在运营商建设中的应用原理,分析了DSS技术的发展方向,提出了DSS技术的展望,最后给出了频谱最终部署建议。

Reaching consensus for membership dynamic in secret sharing and its application to cross-chain

The communication efficiency optimization,censorship resilience,and generation of shared randomness are inseparable from the threshold cryptography in the existing Byzantine Fault Tolerant(BFT)consensus.The membership in consensus in a blockchain scenario supports dynamic changes,which effectively prevents the corruption of consensus participants.Especially in cross-chain protocols,the dynamic access to different blockchains will inevitably bring about the demand for member dynamic.Most existing threshold cryptography schemes rely on redefined key shares,leading to a static set of secret sharing participants.In this paper,we propose a general approach to coupling blockchain consensus and dynamic secret sharing.The committee performs consensus confirmation of both dynamic secret sharing and transaction proposals.Our scheme facilitates threshold cryptography membership dynamic,thus underlying support for membership dynamic of threshold cryptographybased BFT consensus schemes.We instantiate a dynamic HotStuff consensus to demonstrate the effectiveness of the scheme.After the correctness and security proof,our scheme achieves the secrecy and integrity of the threshold key shares while ensuring consensus liveness and safety.Experimental results prove that our scheme obtains dynamic membership with negligible overhead.

Interference management in 6G space and terrestrial integrated networks: Challenges and approaches

The Space-Terrestrial Integrated Network(STIN)is considered to be a promising paradigm for realizing worldwide wireless connectivity in sixth-Generation(6G)wireless communication systems.Unfortunately,excessive interference in the STIN degrades the wireless links and leads to poor performance,which is a bottleneck that prevents its commercial deployment.In this article,the crucial features and challenges of STIN-based interference are comprehensively investigated,and some candidate solutions for Interference Management(IM)are summarized.As traditional IM techniques are designed for single-application scenarios or specific types of interference,they cannot meet the requirements of the STIN architecture.To address this issue,we propose a self-adaptation IM method that reaps the potential benefits of STIN and is applicable to both rural and urban areas.A number of open issues and potential challenges for IM are discussed,which provide insights regarding future research directions related to STIN.

Bid Strategies of Primary Users in Double Spectrum Auctions

Extensive research in recent years has shown that dynamic spectrum sharing is a promising ap- proach to＇address the artificial spectrum scarcity problem by improving spectrum utilization. This new communication paradigm, however, requires a well-designed spectrum allocation mechanism. This paper designs a double spectrum auction framework that allows unlicensed secondary users to obtain selected idle spectra assigned to licensed primary users. This is a win-win game because primary users can earn extra revenue and secondary users can obtain spectra they desperately need. The competition among primary users in the auction framework is studied combining game theory with a double spectrum auction in a non-cooperative game with the Nash Equilibrium （NE） as the best solution. Primary users use the prices obtained from the NE as their bid strategies to participate in the auction. In this auction sellers and buyers bid privately and confidentially, which means that the secondary users do not actually know the price and the spectrum size offered by the primary users, then a new net utility function was developed for the primary users with an iterative algorithm to find the Nash equilibrium point. Simulations demonstrate that this design effectively improves spectrum utilization.

Fuzzy Genetic Sharing for Dynamic Optimization

Recently,genetic algorithms(GAs) have been applied to multi-modal dynamic optimization(MDO).In this kind of optimization,an algorithm is required not only to find the multiple optimal solutions but also to locate a dynamically changing optimum.Our fuzzy genetic sharing(FGS) approach is based on a novel genetic algorithm with dynamic niche sharing(GADNS).FGS finds the optimal solutions,while maintaining the diversity of the population.For this,FGS uses several strategies.First,an unsupervised fuzzy clustering method is used to track multiple optima and perform GADNS.Second,a modified tournament selection is used to control selection pressure.Third,a novel mutation with an adaptive mutation rate is used to locate unexplored search areas.The effectiveness of FGS in dynamic environments is demonstrated using the generalized dynamic benchmark generator(GDBG).

Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network

Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.