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.

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.

With the development of automated driving vehicles, more and more vehicles will be fitted with more than one automotive radars, and the radar mutual interference will become very significant. Vehicle to everything (V2X) communication is a potential way for coordinating automotive radars and reduce the mutual interference. In this paper, we analyze the positional relation of the two radars that interfere with each other, and evaluate the mutual interference for different types of automotive radars based on Poisson point process (PPP). We also propose a centralized framework and the corresponding algorithm, which relies on V2X communication systems to allocate the spectrum resources for automotive radars to minimize the interference. The minimum spectrum resources required for zero-interference are analyzed for different cases. Simulation results validate the analysis and show that the proposed framework can achieve near-zero-interference with the minimum spectrum resources.

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.

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.

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.

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 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.

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.

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.

The Service-based Architecture (SBA) is one of the key innovations of 5G architecture that leverage modularized, self-contained and independent services to provide flexible and cloud-native 5G network. In this paper, SBA for Space-Air-Ground Integrated Network (SAGIN) is investigated to enable the 5G integration deployment. This paper proposes a novel Holistic Service-based Architecture (H-SBA) for SAGIN of 5G-Advanced and beyond, i.e., 6G. The H-SBA introduces the concept of end-to-end service-based architecture design. The “Network Function Service”, introduced in 5G SBA, is extended from Control Plane to User Plane, from core network to access network. Based on H-SBA, the new generation of protocol design is proposed, which proposes to use IETF QUIC and SRv6 to substitute 5G HTTP/2.0 and GTP-U. Testing results show that new protocols can achieve low latency and high throughput, making them promising candidate for H-SBA.

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.

Network virtualization is an enabling technology of running multiple virtual networks on a shared substrate network. It aims to deal with the ossification of current network architecture. As a crucial component of network virtualization, virtual network embedding (VNE) can efficiently and effectively allocates the substrate resource to proposed virtual network requests. According to the optimization strategy, VNE approaches can be classified into three categories: exact, heuristic and meta-heuristic solution. The VNE exact solution is the foundation of its corresponding heuristic and meta-heuristic solutions. This paper presents a survey of existing typical VNE exact solutions, and open problems for the future research of VNE exact solutions are proposed.

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.

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.

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.

Emerging wireless community cloud enables usergenerated video content to be shared and consumed in a social context. However, the nature of shared wireless medium and timevarying channels seriously limits the quality of service (QoS), partially owing to the lack of mechanisms for effectively utilizing multi-rate channel resources. In this paper, the joint optimization of admission control and rate adaptation is proposed, resulting in a bandwidth-aware rate-adaptive admission control (BRAC) scheme to provide bandwidth guarantee for sharing social multimedia contents. The analytical approach leads to the following major contributions: (1) a bandwidth-aware rate selection (BRS) algorithm to optimally meet the bandwidth requirement of the data session and channel conditions at the physical layer; (2) a routing-coupled rate adaption and admission control algorithm to admit data sessions with bandwidth guarantee. Moreover, extensive numerical simulations suggest that BRAC is efficient and effective in meeting the bandwidth requirements for sharing social multimedia contents. These insights will shed light on communication system implementation for multimedia content sharing over multirate wireless community cloud.

Although small cell offloading technology can alleviate the congestion in macrocell, aggressively offloading data traffic from macrocell to small cell can also degrade the performance of small cell due to the heavy load. Because of collision and backoff, the degradation is significant especially in network with contention-based channel access, and finally decreases throughput of the whole network. To find an optimal fraction of traffic to be offloaded in heterogeneous network, we combine Markov chain with the Poisson point process model to analyze contention-based throughput in irregularly deployment networks. Then we derive the close-form solution of the throughput and find that it is a function of the transmit power and density of base stations. Based on this, we propose the load-aware offloading strategies via power control and base station density adjustment. The numerical results verify our analysis and show a great performance gain compared with non-load-aware offloading.

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.

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.

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.

In this paper, we propose a novel speed and service-sensitive handoff algorithm and analytical model for hierarchical cellular networks. First, we use the Gauss-Markov mobility model to predict the speeds of mobile stations, and divide mobile stations into three classes based on the predicted speeds: fast, medium-speed, and slow. Then, according to the mobility classification, network conditions, and service types, mobile stations will be handoff to the proper target networks prior to the deterioration of the currently operating channel. We further develop an analytical model to evaluate the performance of such a hierarchical system with different speed classes and service types. Simulations and analytical results show that the proposed handoff algorithm can significantly improve the network performance in terms of the handoff failure probability, unnecessary handoff probability, and network throughput, comparing with the traditional algorithms.

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.

The varying trajectory of Doppler frequency under changing speed motion conditionsare investigated in HighSpeed Railway (HSR) scenarios. Based on the geometrical physical parameters, instantaneous Doppler trajectories and expression forms of the change rate arededuced, including acceleration and deceleration cases.These modified models provide more accurate and realisticapproximations in modeling rapidly fading channels.

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.

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.

Top-k ranking of websites according to traffic volume is important for Internet Service Providers (ISPs) to understand network status and optimize network resources. However, the ranking result always has a big deviation with actual rank for the existence of unknown web traffic, which cannot be identified accurately under current techniques. In this paper, we introduce a novel method to approximate the actual rank. This method associates unknown web traffic with websites according to statistical probabilities. Then, we construct a probabilistic top-k query model to rank websites. We conduct several experiments by using real HTTP traffic traces collected from a commercial ISP covering an entire city in northern China. Experimental results show that the proposed techniques can reduce the deviation existing between the ground truth and the ranking results vastly. In addition, we find that the websites providing video service have higher ratio of unknown IP as well as higher ratio of unknown traffic than the websites providing text web page service. Specifically, we find that the top-3 video websites have more than 90% of unknown web traffic. All these findings are helpful for ISPs understanding network status and deploying Content Distributed Network (CDN).

In this paper, we propose a Packet Cache-Forward (PCF) method based on improved Bayesian outlier detection to eliminate out-of-order packets caused by transmission path drastically degradation during handover events in the moving satellite networks, for improving the performance of TCP. The proposed method uses an access node satellite to cache all received packets in a short time when handover occurs and forward them out in order. To calculate the cache time accurately, this paper establishes the Bayesian based mixture model for detecting delay outliers of the entire handover scheme. In view of the outliers’ misjudgment, an updated classification threshold and the sliding window has been suggested to correct category collections and model parameters for the purpose of quickly identifying exact compensation delay in the varied network load statuses. Simulation shows that, comparing to average processing delay detection method, the average accuracy rate was scaled up by about 4.0%, and there is about 5.5% cut in error rate in the meantime. It also behaves well even though testing with big dataset. Benefiting from the advantage of the proposed scheme in terms of performance, comparing to conventional independent handover and network controlled synchronized handover in simulated LEO satellite networks, the proposed independent handover with PCF eliminates packet out-of-order issue to get better improvement on congestion window. Eventually the average delay decreases more than 70% and TCP performance has improved more than 300%.

With the successful demonstration of terahertz (THz) high-speed wireless data transmission, the THz frequencies are now becoming a worth candidate for post-5G wireless communications. On the other hand, to bring THz communications a step closer to real scenario application, solving high data rate real-time transmission is also an important issue. This paper describes a 220-GHz solid-state dual-carrier wireless link whose maximum transmission real-time data rates are 20.8 Gbps (10.4 Gbps per channel). By aggregating two carrier signals in the THz band, the contradiction between high real-time data rate communication and low sampling rate analog-to-digital (ADC) and digital-to-analog converter (DAC) is alleviated. The transmitting and receiving front-ends consist of 220-GHz diplexers, 220-GHz sub-harmonic mixers based on anti-parallel Schottky barrier diodes, G-band low-noise amplifiers (LNA), WR-4.3 band high-gain Cassegrain antennas, high data rates dual-DAC and -ADC baseband platform and other components. The low-density parity-check (LDPC) encoding is also realized to improve the bit error rate (BER) of the received signal. Modulated signals are centered at 214.4 GHz and 220.6 GHz with -11.9 dBm and -13.4 dBm output power for channel 1 and 2, respectively. This link is demonstrated to achieve 20.8-Gbps real-time data transmission using 16-QAM modulation over a distance of 1030 m. The measured signal to noise ratio (SNR) is 17.3 dB and 16.5 dB, the corresponding BER is 8.6e-7 and 3.8e-7, respectively. Furthermore, 4K video transmission is also carried out which is clear and free of stutter. The successful transmission of aggregated channels in this wireless link shows the great potential of THz communication for future wireless high-rate real-time data transmission applications.

Adaptive packet scheduling can efficiently enhance the performance of multipath Data Transmission. However, realizing precise packet scheduling is challenging due to the nature of high dynamics and unpredictability of network link states. To this end, this paper proposes a distributed asynchronous deep reinforcement learning framework to intensify the dynamics and prediction of adaptive packet scheduling. Our framework contains two parts: local asynchronous packet scheduling and distributed cooperative control center. In local asynchronous packet scheduling, an asynchronous prioritized replay double deep Q-learning packets scheduling algorithm is proposed for dynamic adaptive packet scheduling learning, which makes a combination of prioritized replay double deep Q-learning network (P-DDQN) to make the fitting analysis. In distributed cooperative control center, a distributed scheduling learning and neural fitting acceleration algorithm to adaptively update neural network parameters of P-DDQN for more precise packet scheduling. Experimental results show that our solution has a better performance than Random weight algorithm and Round--Robin algorithm in throughput and loss ratio. Further, our solution has 1.32 times and 1.54 times better than Random weight algorithm and Round--Robin algorithm on the stability of multipath data transmission, respectively.

Beam hopping technology provides a foundation for the flexible allocation and efficient utilization of satellite resources, which is considered as a key technology for the next generation of high throughput satellite systems. To alleviate the contradiction between resource utilization and co-frequency interference in beam hopping technology, this paper firstly studies dynamic clustering to balance traffic between clusters and proposes cluster hopping pool optimization method to avoid inter-cluster interference. Then based on the optimization results, a novel joint beam hopping and precoding algorithm is provided to combine resource allocation and intra-cluster interference suppression, which can make efficient utilization of system resources and achieve reliable and near-optimal transmission capacity. The simulation results show that, compared with traditional methods, the proposed algorithms can dynamically adjust to balance demand traffic between clusters and meet the service requirements of each beam, also eliminate the co-channel interference to improve the performance of satellite network.

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.

In this paper, we propose a new method to derive a family of regular rate-compatible low-density parity-check (RC-LDPC) convolutional codes from RC-LDPC block codes. In the RC-LDPC convolutional family, each extended sub-matrix of each extended code is obtained by choosing specified elements from two fixed matrices H_E1^k and H_E2^k, which are derived by modifying the extended matrices H_E1 and H_E2 of a systematic RC-LDPC block code. The proposed method which is based on graph extension simplifies the design, and prevent the defects caused by the puncturing method. It can be used to generate both regular and irregular RC-LDPC convolutional codes. All resulted codes in the family are systematic which simplify the encoder structure and have maximum encoding memories which ensure the property. Simulation results show the family collectively offer a steady improvement in performance with code compatibility over binary-input additive white Gaussian noise channel (BI-AWGNC).

The Internet of Moving Things (IoMT) takes a step further with respect to traditional static IoT deployments. In this line, the integration of new eco-friendly mobility devices such as scooters or bicycles within the Cooperative-Intelligent Transportation Systems (C-ITS) and smart city ecosystems is crucial to provide novel services. To this end, a range of communication technologies is available, such as cellular, vehicular WiFi or Low-Power Wide-Area Network (LPWAN); however, none of them can fully cover energy consumption and Quality of Service (QoS) requirements. Thus, we propose a Decision Support System (DSS), based on supervised Machine Learning (ML) classification, for selecting the most adequate transmission interface to send a certain message in a multi-Radio Access Technology (RAT) set up. Different ML algorithms have been explored taking into account computing and energy constraints of IoMT end-devices and traffic type. Besides, a real implementation of a decision tree-based DSS for micro-controller units is presented and evaluated. The attained results demonstrate the validity of the proposal, saving energy in communication tasks as well as satisfying QoS requirements of certain urgent messages. The footprint of the real implementation on an Arduino Uno is 444 bytes and it can be executed in around 50 μs.

The continuous change of communication frequency brings difficulties to the reconnaissance and prediction of non-cooperative communication networks. Since the frequency-hopping (FH) sequence is usually generated by a certain model with certain regularity, the FH frequency is thus predictable. In this paper, we investigate the FH frequency reconnaissance and prediction of a non-cooperative communication network by effective FH signal detection, time-frequency (TF) analysis, wavelet detection and frequency estimation. With the intercepted massive FH signal data, long short-term memory (LSTM) neural network model is constructed for FH frequency prediction. Simulation results show that our parameter estimation methods could estimate frequency accurately in the presence of certain noise. Moreover, the LSTM-based scheme can effectively predict FH frequency and frequency interval.

Micro-UAV swarms usually generate massive data when performing tasks. These data can be harnessed with various machine learning (ML) algorithms to improve the swarm's intelligence. To achieve this goal while protecting swarm data privacy, federated learning (FL) has been proposed as a promising enabling technology. During the model training process of FL, the UAV may face an energy scarcity issue due to the limited battery capacity. Fortunately, this issue is potential to be tackled via simultaneous wireless information and power transfer (SWIPT). However, the integration of SWIPT and FL brings new challenges to the system design that have yet to be addressed, which motivates our work. Specifically, in this paper, we consider a micro-UAV swarm network consisting of one base station (BS) and multiple UAVs, where the BS uses FL to train an ML model over the data collected by the swarm. During training, the BS broadcasts the model and energy simultaneously to the UAVs via SWIPT, and each UAV relies on its harvested and battery-stored energy to train the received model and then upload it to the BS for model aggregation.To improve the learning performance, we formulate a problem of maximizing the percentage of scheduled UAVs by jointly optimizing UAV scheduling and wireless resource allocation.The problem is a challenging mixed integer nonlinear programming problem and is NP-hard in general. By exploiting its special structure property, we develop two algorithms to achieve the optimal and suboptimal solutions, respectively. Numerical results show that the suboptimal algorithm achieves a near-optimal performance under various network setups, and significantly outperforms the existing representative baselines.considered.

Decoding by alternating direction method of multipliers (ADMM) is a promising linear programming decoder for low-density parity-check (LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder. For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.

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.

Human body posture recognition has attracted considerable attention in recent years in wireless body area networks (WBAN). In order to precisely recognize human body posture, many recognition algorithms have been proposed. However, the recognition rate is relatively low. In this paper, we apply back propagation (BP) neural network as a classifier to recognizing human body posture, where signals are collected from VG350 acceleration sensor and a posture signal collection system based on WBAN is designed. Human body signal vector magnitude (SVM) and tri-axial acceleration sensor data are used to describe the human body postures. We are able to recognize 4 postures: Walk, Run, Squat and Sit. Our posture recognition rate is up to 91.67%. Furthermore, we find an implied relationship between hidden layer neurons and the posture recognition rate. The proposed human body posture recognition algorithm lays the foundation for the subsequent applications.

Due to the rapid development of mobile Internet services, such as Skype and WeChat, traditional telecom services have suffered a large decline in the business volumes in recent years. Thus, telecom operators pay much attention to analyzing the changes of the enterprise performance, in order to adjust market strategies in time. In this paper, we propose a new methodology to analyze the operation data of telecom operators dynamically, which can characterize the changing process of the operating states and predict the developing trends. In particular, the proposed methodology contains two steps: migration pattern analysis and trajectory pattern analysis. Firstly, migration analysis is based on the changing of operating states between two points-in-time, which is referred to as the migration paths. Applying the clustering analysis to the migration paths can obtain the migration patterns, which characterize the changing feature of telecom operators during a short period, e.g. one month. Secondly, we combine a sequence of consecutive migration paths to obtain the migration trajectory. Through analyzing different trajectories based on the hierarchical cluster method and the Markov chain model, we obtain the trajectory patterns, which describe the changing progress during a relatively long period, e.g. one year. Based on the trajectory patterns, we can predict the possible performance changes. Finally, we apply the proposed method to a Chinese telecom operator for an empirical research, and has obtained a lot of development rules which provides insights into current telecom.