Many websites use verification codes to prevent users from using the machine automatically to register, login, malicious vote or irrigate but it brought great burden to the enterprises involved in internet marketing as entering the verification code manually. Improving the verification code security system needs the identification method as the corresponding testing system. We propose an anisotropic heat kernel equation group which can generate a heat source scale space during the kernel evolution based on infinite heat source axiom, design a multi-step anisotropic verification code identification algorithm which includes core procedure ofbuilding anisotropic heat kernel, settingwave energy information parameters, combing outverification codecharacters and corresponding peripheral procedure of gray scaling, binarizing, denoising, normalizing, segmenting and identifying, give out the detail criterion and parameter set. Actual test show the anisotropic heat kernel identification algorithm can be used on many kinds of verification code including text characters, mathematical, chinese, voice, 3D, programming, video, advertising, it has a higher rate of 25% and 50% than neural network and context matching algorithm separately for Yahoo site, 49% and 60% for Captcha site, 20% and 52% for Baidu site, 60% and 65% for 3DTakers site, 40% and 51% for MDP site.

With rapid advances of solar blind ultraviolet LED and ultraviolet detecting technology in recent years, ultraviolet communication gradually becomes a research hotspot due to its inherent advantages: low solar background noise, non-line-of-sight(NLOS) and good secrecy. The strong scattering characteristics in atmospheric render ultraviolet waveband the ideal choice for achieving NLOS optical communication. This paper reviews the research history and status of ultraviolet communication both in China and abroad, and especially introduces three main issues of ultraviolet communication: channel model, system analysis and design, light sources and detectors. For each aspect, current open issues and prospective research directions are analyzed.

The paper proposes a low power non-volatile baseband processor with wake-up identification (WUI) receiver for LR-WPAN transceiver. It consists of WUI receiver, main receiver, transmitter, non-volatile memory (NVM) and power management module. The main receiver adopts a unified simplified synchronization method and channel codec with proactive Reed-Solomon Bypass technique, which increases the robustness and energy efficiency of receiver. The WUI receiver specifies the communication node and wakes up the transceiver to reduce average power consumption of the transceiver. The embedded NVM can backup/restore the states information of processor that avoids the loss of the state information caused by power failure and reduces the unnecessary power of repetitive computation when the processor is waked up from power down mode. The baseband processor is designed and verified on a FPGA board. The simulated power consumption of processor is 5.1μW for transmitting and 28.2μW for receiving. The WUI receiver technique reduces the average power consumption of transceiver remarkably. If the transceiver operates 30 seconds in every 15 minutes, the average power consumption of the transceiver can be reduced by two orders of magnitude. The NVM avoids the loss of the state information caused by power failure and energy waste caused by repetitive computation.

A brain-computer interface (BCI) system based on steady-state visual evoked potentials (SSVEP) was developed by four-class phase-coded stimuli. SSVEPs elicited by flickers at 60Hz, which is higher than the critical fusion frequency (CFF), were compared with those at 15Hz and 30Hz. SSVEP components in electroencephalogram (EEG) were detected using task related component analysis (TRCA) method. Offline analysis with 17 subjects indicated that the highest information transfer rate (ITR) was 29.80±4.65bpm with 0.5s data length for 60Hz and the classification accuracy was 70.07±4.15%. The online BCI system reached an averaged classification accuracy of 87.75±3.50% at 60Hz with 4s, resulting in an ITR of 16.73±1.63bpm. In particular, the maximum ITR for a subject was 80bpm with 0.5s at 60Hz. Although the BCI performance of 60Hz was lower than that of 15Hz and 30Hz, the results of the behavioral test indicated that, with no perception of flicker, the BCI system with 60Hz was more comfortable to use than 15Hz and 30Hz. Correlation analysis revealed that SSVEP with higher signal-to-noise ratio (SNR) corresponded to better classification performance and the improvement in comfortableness was accompanied by a decrease in performance. This study demonstrates the feasibility and potential of a user-friendly SSVEP-based BCI using imperceptible flickers.

Spectrum sharing for efficient reuse of licensed spectrum is an important concept for cognitive radio technologies. In a spectrum-sharing system (SSS), deploying the antennas in a distributed manner can offer a new spatial dimension for the efficient reuse of licensed frequency bands. To improve the whole performance of multiple secondary users (SUs), this paper addresses the problem of coordinated multi-SU spectrum sharing in a distributed antenna-based SSS. By adopting the Hungarian method, the primal decomposition method and pricing policy, we propose a coordinated multi-user transmission scheme, so as to maximize the sum-rate of SUs. Simulation results show that the proposed method can significantly enhance the system performance, and the computational complexity is low.

Security and privacy issues are magnified by velocity, volume, and variety of big data. User’s privacy is an even more sensitive topic attracting most people’s attention. While XcodeGhost, a malware of iOS emerging in late 2015, leads to the privacy-leakage of a large number of users, only a few studies have examined XcodeGhost based on its source code. In this paper we describe observations by monitoring the network activities for more than 2.59 million iPhone users in a provincial area across 232 days. Our analysis reveals a number of interesting points. For example, we propose a decay model for the prevalence rate of XcodeGhost and we find that the ratio of the infected devices is more than 60%; that a lot of popular applications, such as Wechat, railway 12306, didi taxi, Youku video are also infected; and that the duration as well as the traffic volume of most XcodeGhost-related HTTP-requests is similar with usual HTTP-request which makes it difficult to be found. Besides, we propose a heuristic model based on fingerprint and its web-knowledge to identify the infected applications. The identifying result shows the efficiency of this model.

An Efficient and flexible implementation of block ciphers is critical to achieve information security processing. Existing implementation methods such as GPP, FPGA and cryptographic application-specific ASIC provide the broad range of support. However, these methods could not achieve a good tradeoff between high-speed processing and flexibility. In this paper, we present a reconfigurable VLIW processor architecture targeted at block cipher processing, analyze basic operations and storage characteristics, and propose the multi-cluster register-file structure for block ciphers. As for the same operation element of block ciphers, we adopt reconfigurable technology for multiple cryptographic processing units and interconnection scheme. The proposed processor not only flexibly accomplishes the combination of multiple basic cryptographic operations, but also realizes dynamic configuration for cryptographic processing units. It has been implemented with 0.18µmCMOS technology, the test results show that the frequency can reach 350MHz, and power consumption is 420mw. Ten kinds of block and hash ciphers were realized in the processor. The encryption throughput of AES, DES, IDEA, and SHA-1 algorithm is 1554Mbps, 448Mbps, 785Mbps, and 424Mbps respectively, the test result shows that our processor’s encryption performance is significantly higher than other designs.

Ensuring end-to-end quality of service (QoS) for high-value services in satellite networks is challenging due to dynamic network topologies, varying QoS requirements, and the complex resource allocation across satellite beams and inter-satellite links. To this end, we propose a satellite traffic engineering framework with deterministic QoS (SatTED) by jointly optimizing resource allocation across access and bearer subnets.To tackle the complexity of joint scheduling, SatTED adopts a hierarchical logic-based benders decomposition (LBBD) architecture that coordinates access and bearer subnet resources. The master problem optimizes service admission and satellite selection via binary integer programming, while the subproblem handles routing and bandwidth allocation through linear programming relaxation. Key innovat-ions include scenario-cognizant Benders feasibility cuts to accelerate convergence and a critical constraint link preprocessing (CCLP) mechanism that reduces subproblem complexity by 5.15× in large-scale networks. In simulations on a 220-satellite network with 1 000 flows, SatTED improves total service payoff by 32% and increases high-value flow completion rates by 22%.

To deal with the dynamic and imbalanced traffic requirements in Low Earth Orbit satellite networks, several distributed load balancing routing schemes have been proposed. However, because of the lack of global view, these schemes may lead to cascading congestion in regions with high volume of traffic. To solve this problem, a Hybrid-Traffic-Detour based Load Balancing Routing (HLBR) scheme is proposed, where a Long-Distance Traffic Detour (LTD) method is devised and coordinates with distributed traffic detour method to perform self-adaptive load balancing. The forwarding path of LTD is acquired by the Circuitous Multipath Calculation (CMC) based on prior geographical information, and activated by the LTD- Shift-Trigger (LST) through real-time congestion perception. Simulation results show that the HLBR can mitigate cascading congestion and achieve efficient traffic distribution.

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature. VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth. Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources. The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

Some research work has showed that public mood and stock market price have some relations in some degree. Although it is difficult to clear the relation, the research about the relation between stock market price and public mood is interested by some scientists. This paper tries to find the relationship between Chinese stock market and Chinese local Microblog. First, C-POMS (Chinese Profile of Mood States) was proposed to analyze sentiment of Microblog feeds. Then Granger causality test confirmed the relation between C-POMS analysis and price series. SVM and Probabilistic Neural Network were used to make prediction, and experiments show that SVM is better to predict stock market movements than Probabilistic Neural Network. Experiments also indicate that adding certain dimension of C-POMS as the input data will improve the prediction accuracy to 66.667%. Two dimensions to input data leads to the highest accuracy of 71.429%, which is about 20% higher than using only history stock data as the input data. This paper also compared the proposed method with the ROSTEA scores, and concluded that only the proposed method brings more accurate predicts.

Smart containers have been extensively applied in the maritime industry by embracing the Internet of Things to realize container status monitoring and data offloading without human intervention. However, the offloading rate and delay in the offshore region are limited by the coverage of the onshore base station (BS). In this paper, we investigate the unmanned aerial vehicle (UAV)-assisted data offloading for smart containers in offshore maritime communications where the UAV is as a relay node between smart containers and onshore BS. We first consider the mobility of container vessel in the offshore region and establish a UAV-assisted data offloading model. Based on this model, a data offloading algorithm is proposed to reduce the average offloading delay under data-size requirements and available energy constraints of smart containers. Specifically, the convex-concave procedure is used to update time-slot assignment, offloading approach selection, and power allocation in an iterative manner. Simulation results show that the proposed algorithm can efficiently reduce average offloading delay and increase offloading success ratio. Moreover, it is shown that the UAV relay cannot always bring the performance gain on offloading delay especially in the close-to-shore area, which could give an insight on the deployment of UAV relay in offshore communications.

Unmanned aerial vehicles (UAVs) are increasingly considered in safe autonomous navigation systems to explore unknown environments where UAVs are equipped with multiple sensors to perceive the surroundings. However, how to achieve UAV-enabled data dissemination and also ensure safe navigation synchronously is a new challenge. In this paper, our goal is minimizing the whole weighted sum of the UAV's task completion time while satisfying the data transmission task requirement and the UAV's feasible flight region constraints. However, it is unable to be solved via standard optimization methods mainly on account of lacking a tractable and accurate system model in practice. To overcome this tough issue, we propose a new solution approach by utilizing the most advanced dueling double deep Q network (dueling DDQN) with multi-step learning. Specifically, to improve the algorithm, the extra labels are added to the primitive states. Simulation results indicate the validity and performance superiority of the proposed algorithm under different data thresholds compared with two other benchmarks.

In cellular network, users with same demand and in proximity to each other form the mobile cloud, in which the short-range D2D technology is employed by users to improve the data dissemination efficiency. In view of the fact that the D2D links with the poor channel conditions are likely to be the bottleneck of resource utilization improvement, aiming at the differentiation of link quality, this paper proposes a intra-cloud D2D multicast retransmission algorithm based on SINR constraint to meet the minimum requirement of D2D retransmission for QoS. In the proposed algorithm, the model of system link cost is built, the number of multicast retransmission times is restricted and each link quality matrix is traversed to reasonably select the multicast transmitter as well as its routing, which further reduces the link cost consumption, and in turn improves the bandwidth efficiency. Simulation results show that the proposed algorithm is more efficient to improve the bandwidth utilization when the ratio between normal user and non-normal user is small in mobile cloud.

Mobile edge computing (MEC) is an emerging technolohgy that extends cloud computing to the edge of a network. MEC has been applied to a variety of services. Specially, MEC can help to reduce network delay and improve the service quality of recommendation systems. In a MEC-based recommendation system, users' rating data are collected and analyzed by the edge servers. If the servers behave dishonestly or break down, users' privacy may be disclosed. To solve this issue, we design a recommendation framework that applies local differential privacy (LDP) to collaborative filtering. In the proposed framework, users' rating data are perturbed to satisfy LDP and then released to the edge servers. The edge servers perform partial computing task by using the perturbed data. The cloud computing center computes the similarity between items by using the computing results generated by edge servers. We propose a data perturbation method to protect user's original rating values, where the Harmony mechanism is modified so as to preserve the accuracy of similarity computation. And to enhance the protection of privacy, we propose two methods to protect both users' rating values and rating behaviors. Experimental results on real-world data demonstrate that the proposed methods perform better than existing differentially private recommendation methods.

Cloud-based satellite and terrestrial spectrum shared networks (CB-STSSN) combines the triple advantages of efficient and flexible network management of heterogeneous cloud access (H-CRAN), vast coverage of satellite networks, and good communication quality of terrestrial networks. Thanks to the complementary coverage characteristics, anytime and anywhere high-speed communications can be achieved to meet the various needs of users. The scarcity of spectrum resources is a common problem in both satellite and terrestrial networks. In order to improve resource utilization, the spectrum is shared not only within each component but also between satellite beams and terrestrial cells, which introduces inter-component interferences. To this end, this paper first proposes an analytical framework which considers the inter-component interferences induced by spectrum sharing (SS). An intelligent SS scheme based on radio map (RM) consisting of LSTM-based beam prediction (BP), transfer learning-based spectrum prediction (SP) and joint non-preemptive priority and preemptive priority (J-NPAP)-based proportional fair spectrum allocation is than proposed. The simulation result shows that the spectrum utilization rate of CB-STSSN is improved and user blocking rate and waiting probability are decreased by the proposed scheme.

Cognitive Internet of Vehicles (CIoV) can improve spectrum utilization by accessing the spectrum licensed to primary user (PU) under the premise of not disturbing the PU's transmissions. However, the traditional static spectrum access makes the CIoV unable to adapt to the various spectrum environments. In this paper, a reinforcement learning based dynamic spectrum access scheme is proposed to improve the transmission performance of the CIoV in the licensed spectrum, and avoid causing harmful interference to the PU. The frame structure of the CIoV is separated into sensing period and access period, whereby the CIoV can optimize the transmission parameters in the access period according to the spectrum decisions in the sensing period. Considering both detection probability and false alarm probability, a Q-learning based spectrum access algorithm is proposed for the CIoV to intelligently select the optimal channel, bandwidth and transmit power under the dynamic spectrum states and various spectrum sensing performance. The simulations have shown that compared with the traditional non-learning spectrum access algorithm, the proposed Q-learning algorithm can effectively improve the spectral efficiency and throughput of the CIoV as well as decrease the interference power to the PU.

Due to limited volume, weight and power consumption, micro-satellite has to reduce data transmission and storage capacity by image compression when performs earth observation missions. However, the quality of images may be unsatisfied. This paper considers the problem of recovering sparse signals by exploiting their unknown sparsity pattern. To model structured sparsity, the prior correlation of the support is encoded by imposing a transformed Gaussian process on the spike and slab probabilities. Then, an efficient approximate message-passing algorithm with structured spike and slab prior is derived for posterior inference, which, combined with a fast direct method, reduces the computational complexity significantly. Further, a unified scheme is developed to learn the hyperparameters using expectation maximization (EM) and Bethe free energy optimization. Simulation results on both synthetic and real data demonstrate the superiority of the proposed algorithm.

Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al. proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan’s scheme. In addition, we discuss possible lines of future work.

Flying Ad hoc Network (FANET) has drawn significant consideration due to its rapid advancements and extensive use in civil applications. However, the characteristics of FANET including high mobility, limited resources, and distributed nature, have posed a new challenge to develop a secure and efficient routing scheme for FANET. To overcome these challenges, this paper proposes a novel cluster based secure routing scheme, which aims to solve the routing and data security problem of FANET. In this scheme, the optimal cluster head selection is based on residual energy, online time, reputation, blockchain transactions, mobility, and connectivity by using Improved Artificial Bee Colony Optimization (IABC). The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities. Further, a lightweight blockchain consensus algorithm, AI-Proof of Witness Consensus Algorithm (AI-PoWCA) is proposed, which utilizes the optimal cluster head for mining. In AI-PoWCA, the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51% attack. Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90% packet delivery ratio, lowest end-to-end delay, highest throughput, resilience against security attacks, and superior in block processing time.

For the sake of meeting the demand of data rates at terabit (Tbit) per second scale in future networks, the terahertz (THz) band is widely accepted as one of the potential key enabling technologies for next generation wireless communication systemsWith the progressive development of THz devices, regrading THz communications at system level is increasing crucial and captured the interest of plenty of researchersWithin this scope, THz channel modeling serves as an indispensable and fundamental elementBy surveying the latest literature findings, this paper reviews the problem of channel modeling in the THz band, with an emphasis on molecular absorption loss, misalignment fading and multipath fading, which are major influence factors in the THz channel modelingThen, we focus on simulators and experiments in the THz band, after which we give a brief introduction on applications of THz channel models with respects to capacity, security, and sensing as examplesFinally, we discuss some key issues in the future THz channel modeling.

The rapid development and continuous updating of the mega satellite constellation (MSC) have brought new visions for the future 6G coverage extension, where the global seamless signal coverage can realize ubiquitous services for user terminals. However, global traffic demands present non-uniform characteristics. Therefore, how to ensure the on-demand service coverage for the specific traffic demand, i.e., the ratio of traffic density to service requirement per unit area, is the core issue of 6G wireless coverage extension exploiting the MSC. To this regard, this paper first discusses the open challenges to reveal the future direction of 6G wireless coverage extension from the perspective of key factors affecting service coverage performance, i.e., the network access capacity, space segment capacity and their matching-relationship. Furthermore, we elaborate on the key factors affecting effective matchings of the aforementioned aspects, thereby improving service coverage capability.

In recent years, with the growth in Unmanned Aerial Vehicles (UAVs), UAV-based systems have become popular in both military and civil applications.In these scenarios, the lack of reliable communication infrastructure has motivated UAVs to establish a network as flying nodes, also known as Flying Ad Hoc Networks (FANETs).However, in FANETs, the high mobility degree of flying and terrestrial users may be responsible for constant changes in the network topology, making end-to-end connections in FANETs challenging.Mobility estimation and prediction of UAVs can address the challenge mentioned above since it can provide better routing planning and improve overall FANET performance in terms of continuous service availability.We thus develop a Software Defined Network (SDN)-based heterogeneous architecture for reliable communication in FANETs.In this architecture, we apply an Extended Kalman Filter (EKF) for accurate mobility estimation and prediction of UAVs.In particular, we formulate the routing problem in SDN-based Heterogeneous FANETs as a graph decision problem.As the problem is NP-hard, we further propose a Directional Particle Swarming Optimization (DPSO) approach to solve it.The extensive simulation results demonstrate that the proposed DPSO routing can exhibit superior performance in improving the goodput, packet delivery ratio, and delay.

As the fifth-generation (5G) mobile communication network may not meet the requirements of emerging technologies and applications, including ubiquitous coverage, industrial internet of things (IIoT), ubiquitous artificial intelligence (AI), digital twins (DT), etc., this paper aims to explore a novel space-air-ground integrated network (SAGIN) architecture to support these new requirements for the sixth-generation (6G) mobile communication network in a flexible, low-latency and efficient manner. Specifically, we first review the evolution of the mobile communication network, followed by the application and technology requirements of 6G. Then the current 5G non-terrestrial network (NTN) architecture in supporting the new requirements is deeply analyzed. After that, we proposes a new flexible, low-latency and flat SAGIN architecture, and presents corresponding use cases. Finally, the future research directions are discussed.

Re-routing system has become an important technology to improve traffic efficiency. The traditional re-routing schemes do not consider the dynamic characteristics of urban traffic, making the planned routes unable to cope with the changing traffic conditions. Based on real-time traffic information, it is challenging to dynamically re-route connected vehicles to alleviate traffic congestion. Moreover, how to obtain global traffic information while reducing communication costs and improving travel efficiency poses a challenge to the re-routing system. To deal with these challenges, this paper proposes CHRT, a clustering-based hybrid re-routing system for traffic congestion avoidance. CHRT develops a multi-layer hybrid architecture. The central server accesses the global view of traffic, and the distributed part is composed of vehicles divided into clusters to reduce latency and communication overhead. Then, a clustering-based priority mechanism is proposed, which sets priorities for clusters based on real-time traffic information to avoid secondary congestion. Furthermore, to plan the optimal routes for vehicles while alleviating global traffic congestion, this paper presents a multi-metric re-routing algorithm. Through extensive simulations based on the SUMO traffic simulator, CHRT reduces vehicle traveling time, fuel consumption, and CO₂ emissions compared to other systems. In addition, CHRT globally alleviates traffic congestion and improves traffic efficiency.

Intellectualization has become a new trend for telecom industry, driven by intelligent technology including cloud computing, big data, and Internet of things. In order to satisfy the service demand of intelligent logistics, this paper designed an intelligent logistics platform containing the main applications such as e-commerce, self-service transceiver, big data analysis, path location and distribution optimization. The intelligent logistics service platform has been built based on cloud computing to collect, store and handling multi-source heterogeneous mass data from sensors, RFID electronic tag, vehicle terminals and APP, so that the open-access cloud services including distribution, positioning, navigation, scheduling and other data services can be provided for the logistics distribution applications. And then the architecture of intelligent logistics cloud platform containing software layer (SaaS), platform layer (PaaS) and infrastructure (IaaS) has been constructed accordance with the core technology relative high concurrent processing technique, heterogeneous terminal data access, encapsulation and data mining. Therefore, intelligent logistics cloud platform can be carried out by the service mode for implementation to accelerate the construction of the symbiotic win-win logistics ecological system and the benign development of the ICT industry in the trend of intellectualization in China.

As the development of 6G accelerates, non-terrestrial networks (NTN) are emerging as a critical component to ensure seamless global coverage communication. This paper systematically reviews the evolution of the third-generation partnership project (3GPP) NTN standardization, from initial discussions in Release 15 to the in-depth optimizations in Release 19 and beyond. Through a detailed gap analysis, we identify key technical and industrial challenges across the wireless, network, and terminal domains that hinder the realization of a fully integrated space-terrestrial network. To address these challenges, we propose a 6G-oriented holistic architecture composed of three segments and three functional layers. We further outline essential enabling technologies, including networking technologies and intelligent resource management technologies. To validate the feasibility and effectiveness of the proposed architecture, we present a case study on integrated sensing and communication in high-speed mobility scenarios. Simulation results demonstrate significant performance gains in robustness, sensing accuracy, and adaptability compared to conventional approaches. Our findings establish a solid foundation for future research and standardization of 6G integrated networks, aiming to achieve intelligent, ubiquitous, and resilient communication infrastructures across space, air, and ground domains.

This paper analyzes the threat of TCG Software Stack (TSS)/TCM Service Module (TSM) deadlock in multi-user environment such as cloud and discusses its causes and mechanism. In addition, this paper puts forward a dynamic priority task scheduling strategy based on value evaluation to handle this threat. The strategy is based on the implementation features of trusted hardware and establishes a multi-level ready queue. In this strategy, an algorithm for real-time value computing is also designed, and it can adjust the production curves of the real time value by setting parameters in different environment, thus enhancing its adaptability, which is followed by scheduling and algorithm description. This paper also implements the algorithm and carries out its performance optimization. Due to the experiment result from Intel NUC, it is shown that TSS based on advanced DPTSV is able to solve the problem of deadlock with no negative influence on performance and security in multi-user environment.

In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node’s average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.

Terahertz (THz) communication has been envisioned as a key enabling technology for sixth-generation (6G). In this paper, we present an extensive THz channel measurement campaign for 6G wireless communications from 220 GHz to 330 GHz. Furthermore, the path loss is analyzed and modeled by using two single-frequency path loss models and a multiple-frequencies path loss model. It is found that at most frequency points, the measured path loss is larger than that in the free space. But at around 310 GHz, the propagation attenuation is relatively weaker compared to that in the free space. Also, the frequency dependence of path loss is observed and the frequency exponent of the multiple-frequencies path loss model is 2.1. Moreover, the cellular performance of THz communication systems is investigated by using the obtained path loss model. Simulation results indicate that the current inter-site distance (ISD) for the indoor scenario is too small for THz communications. Furthermore, the tremendous capacity gain can be obtained by using THz bands compared to using microwave bands and millimeter wave bands. Generally, this work can give an insight into the design and optimization of THz communication systems for 6G.

Resource allocation is an important problem influencing the service quality of multi-beam satellite communications. In multi-beam satellite communications, the available frequency bandwidth is limited, users requirements vary rapidly, high service quality and joint allocation of multi-dimensional resources such as time and frequency are required. It is a difficult problem needs to be researched urgently for multi-beam satellite communications, how to obtain a higher comprehensive utilization rate of multi-dimensional resources, maximize the number of users and system throughput, and meet the demand of rapid allocation adapting dynamic changed the number of users under the condition of limited resources, with using an efficient and fast resource allocation algorithm. In order to solve the multi-dimensional resource allocation problem of multi-beam satellite communications, this paper establishes a multi-objective optimization model based on the maximum the number of users and system throughput joint optimization goal, and proposes a multi-objective deep reinforcement learning based time-frequency two-dimensional resource allocation (MODRL-TF) algorithm to adapt dynamic changed the number of users and the timeliness requirements. Simulation results show that the proposed algorithm could provide higher comprehensive utilization rate of multi-dimensional resources, and could achieve multi-objective joint optimization, and could obtain better timeliness than traditional heuristic algorithms, such as genetic algorithm (GA) and ant colony optimization algorithm (ACO).

In order to provide ultra low-latency and high energy-efficient communication for intelligences, the sixth generation (6G) wireless communication networks need to break out of the dilemma of the depleting gain of the separated optimization paradigm. In this context, this paper provides a comprehensive tutorial that overview how joint source-channel coding (JSCC) can be employed for improving overall system performance. For the purpose, we first introduce the communication requirements and performance metrics for 6G. Then, we provide an overview of the source-channel separation theorem and why it may not hold in practical applications. In addition, we focus on two new JSCC schemes called the double low-density parity-check (LDPC) codes and the double polar codes, respectively, giving their detailed coding and decoding processes and corresponding performance simulations. In a nutshell, this paper constitutes a tutorial on the JSCC scheme tailored to the needs of future 6G communications.

In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.

This paper establishes a new layered flying ad hoc networks (FANETs) system of mobile edge computing (MEC) supported by multiple UAVs, where the first layer of user UAVs can perform tasks such as area coverage, and the second layer of MEC UAVs are deployed as flying MEC sever for user UAVs with computing-intensive tasks. In this system, we first divide the user UAVs into multiple clusters, and transmit the tasks of the cluster members (CMs) within a cluster to its cluster head (CH). Then, we need to determine whether each CH' tasks are executed locally or offloaded to one of the MEC UAVs for remote execution (i.e., task scheduling), and how much resources should be allocated to each CH (i.e., resource allocation), as well as the trajectories of all MEC UAVs. We formulate an optimization problem with the aim of minimizing the overall energy consumption of all user UAVs, under the constraints of task completion deadline and computing resource, which is a mixed integer non-convex problem and hard to solve. We propose an iterative algorithm by applying block coordinate descent methods. To be specific, the task scheduling between CH UAVs and MEC UAVs, computing resource allocation, and MEC UAV trajectory are alternately optimized in each iteration. For the joint task scheduling and computing resource allocation subproblem and MEC UAV trajectory subproblem, we employ branch and bound method and continuous convex approximation technique to solve them, respectively. Extensive simulation results validate the superiority of our proposed approach to several benchmarks.

There are a lot of security issues in block cipher algorithm. Security analysis and enhanced design of a dynamic block cipher was proposed. Firstly, the safety of ciphertext was enhanced based on confusion substitution of S-box, thus disordering the internal structure of data blocks by four steps of matrix transformation. Then, the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function. The dynamic key was finally generated by using LFSR, which improved the stochastic characters of secret key in each of round of iteration. The safety performance of proposed algorithm was analyzed by simulation test. The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security. Meanwhile, the proposed algorithm has highly scalability, the dimension of S-box and the number of register can be dynamically extended according to the security requirement.

In this paper, we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations, where an eavesdropper attempts to intercept their transmissions. We propose an optimal transmission scheduling scheme to defend against the eavesdropper, where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner. To be specific, the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect. The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks. For comparison purposes, we also consider the conventional round-robin scheduling as a benchmark, where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations. We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments. Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability. Additionally, upon increasing the number of source-destination pairs, the secrecy outage probability of the round-robin scheme keeps unchanged, whereas the secrecy outage performance of the proposed transmission scheduling significantly improves, showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.

We propose a cost-effective multi-carrier generation technique which minimizes the passive optical access network (PON) costs. In this study replacement of laser array with multi-carrier source at optical line terminal (OLT) side in PON is addressed. With 25-GHz frequency spacing, the generated optical multi-carriers exhibit good tone to noise ratio (TNR) i. e. above 20dB, and least amplitude difference i. e. 1.5dB. At the OLT, multi-carriers signal based multiplexed differential phase shift keying (DPSK) data from all the channels each having 10Gbps for downlink is transmitted through 25km single mode fiber. While the transmitted information is retrieved at optical network unit (ONU), part of the downlink signal is re-modulated using intensity modulated (IM) on-off keying(OOK) for upstream transmission at 10-Gbps. Simulation results are in good agreement with the theoretical analysis, showing error free transmission in downlink and uplink with 10Gbps symmetric data rate at each channel. The received power, both for uplink and downlink transmission, is adequate for all channels at BER of 10^-9 with minimum power penalties. Power budget is calculated for different splitting ratios showing excellent system margins for any unseen losses. The proposed setup provides a cost-effective way minimizing transmission losses, and providing greater system’s margin in PON architecture.

Reconfigurable intelligent surface (RIS) can manipulate the wireless propagation environment by smartly adjusting the amplitude/phase in a programmable panel, enjoying the improved performance. The accurate acquisition of the instantaneous channel state information (CSI) in the cascaded RIS chain makes an indispensable contribution to the performance gains. However, it is quite challenging to estimate the CSI in a time-variant scenario due to the limited signal processing capability of the passive elements embedded in a RIS pannel. In this work, a channel estimation scheme for the RIS-assisted wireless communication system is proposed, which is demonstrated to perform well in a time-variant scenario. The cascaded RIS channel is modeled as a state-space model based upon the mobility situations. In addition, to fully exploit the time correlation of channel, Kalman filter is employed by taking the prior information of channels into account. Further, the optimal reflection coefficients are derived according to the minimum mean square error (MMSE) criterion. Numerical results show that the proposed methods exhibit superior performance if compared with a conventional channel estimation scheme.

To accommodate the ever-increasing wireless capacity, the terahertz (THz) orbital angular momentum (OAM) beam that combines THz radiation and OAM technologies has attracted much attention recently, with contributing efforts to explore new dimensions in the THz region. In this paper, we provide an overview of the generation and detection techniques of THz-OAM beams, as well as their applications in communications. The principle and research status of typical generation and detection methods are surveyed, and the advantages and disadvantages of each method are summarized from a viewpoint of wireless communication. It is shown that developing novel THz components in generating, detecting and (de)multiplexing THz-OAM beams has become the key engine to drive this direction forward. Anyway, beneficial from the combination of infinite orthogonal modes and large bandwidth, THz-OAM beams will have great potential in delivering very large capacity in next generation wireless communications.

After abusing drugs for long, drug users will experience deteriorated self-control cognitive ability, and poor emotional regulation. This paper designs a closed-loop virtual-reality (VR), motorimagery (MI) rehabilitation training system based on brain-computer interface (BCI) (MI-BCI+VR), aiming to enhance the self-control, cognition, and emotional regulation of drug addicts via personalized rehabilitation schemes. This paper is composed of two parts. In the first part, data of 45 drug addicts (mild: 15; moderate: 15; and severe: 15) is tested with electroencephalogram (EEG) and near-infrared spectroscopy (NIRS) equipment (EEG-NIRS) under the dual-mode, synchronous signal collection paradigm. Using these data sets, a dual-modal signal convolutional neural network (CNN) algorithm is then designed based on decision fusion to detect and classify the addiction degree. In the second part, the MIBCI+ VR rehabilitation system is designed, optimizing the Filter Bank Common Spatial Pattern (FBCSP) algorithm used in MI, and realizing MI-EEG intention recognition. Eight VR rehabilitation scenes are devised, achieving the communication between MI-BCI and VR scene models. Ten subjects are selected to test the rehabilitation system offline and online, and the test accuracy verifies the feasibility of the system. In future, it is suggested to develop personalized rehabilitation programs and treatment cycles based on the addiction degree.