Joint Source and Relay Precoding/Beamforming Algorithm for OFDM Multi-user Cooperative Relay Systems

In order to reduce the feedback load of multi-user orthogonal frequency division multiplexing （ OFDM ） -based wireless systems, a practiral limited bits feedback precoding algorithm is proposed with direct source-destination link based on amplify-and- forward cooperative relay network under frequency selective fading channels. Using joint minimum mean square error（MMSE） filter, the receiving decoding matrix is designed for each user in the paper. Source precoding （beamforming） matrix is optimized with convex function of weight mean square error （MSE）. Relay precoding matrix is obtained under MSE decomposition and convex optimization. The precoding matrix index is fed back for clustered subcarrier of OFDM with limited feedback. Then using interpolation algorithm, all precoding matrices are achieved at base station （BS） and relay nodes. Simulations indicate the effectiveness of the proposed limited feedback joint precoding and beam_formlng design. The proposed method can improve bit error rate （BER） performance and obtain better sum-rate performance in contrast to existing algorithms. It displays the BER performance is close to that of the unquantified precoding feedback method.

A Multi-User Cooperative Diversity for Wireless Local Area Networks

In this paper, an idea of using space-time block coding (STBC) in multi-user cooperative diversity has been exploited to improve the performance of the transmission in wireless local area networks. The theoretical and simulation results show that, using STBC approaches can always achieve the better performance than existing techniques without introducing the space-time coding. By analyzing the throughput and frame error ratio (FER) of the two different STBC cooperative schemes, we find the trade-off between throughput and reliability. The location of the relay is crucial to the performance, which supposes a rule for future cross-layer design.

Multi-user Symmetric Cooperation Based on Nash Bargaining Solution in Cooperative Relay Networks

This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.

Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.

Complex field network-coded cooperation based on multi-user detection in wireless networks

Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.

Cooperative Anti-Jamming and Interference Mitigation for UAV Networks: A Local Altruistic Game Approach

To improve the anti-jamming and interference mitigation ability of the UAV-aided communication systems, this paper investigates the channel selection optimization problem in face of both internal mutual interference and external malicious jamming. A cooperative anti-jamming and interference mitigation method based on local altruistic is proposed to optimize UAVs’ channel selection. Specifically, a Stackelberg game is modeled to formulate the confrontation relationship between UAVs and the jammer. A local altruistic game is modeled with each UAV considering the utilities of both itself and other UAVs. A distributed cooperative anti-jamming and interference mitigation algorithm is proposed to obtain the Stackelberg equilibrium. Finally, the convergence of the proposed algorithm and the impact of the transmission power on the system loss value are analyzed, and the anti-jamming performance of the proposed algorithm can be improved by around 64% compared with the existing algorithms.

Resource Allocation in Multi-User Cellular Networks:A Transformer-Based Deep Reinforcement Learning Approach

To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.

Hybrid Block Diagonalization Precoding for Multi-User Weighted Sum-Rate Maximization

This paper studies large-scale multi-input multi-output(MIMO)orthogonal frequency division multiplexing(OFDM)communications in a broadband frequency-selective channel,where a massive MIMO base station(BS)communicates with multiple users equipped with multi-antenna.We develop a hybrid precoding design to maximize the weighted sum-rate(WSR)of the users by optimizing the digital and the analog precoders alternately.For the digital part,we employ block-diagonalization to eliminate inter-user interference and apply water-filling power allocation to maximize the WSR.For the analog part,the optimization of the PSN is formulated as an unconstrained problem,which can be efficiently solved by a gradient descent method.Numerical results show that the proposed block-diagonal hybrid precoding algorithm can outperform the existing works.

Multi-UAV cooperative maneuver decision-making for pursuitevasion using improved MADRL

Aiming at the problem of multi-UAV pursuit-evasion confrontation, a UAV cooperative maneuver method based on an improved multi-agent deep reinforcement learning(MADRL) is proposed. In this method, an improved Comm Net network based on a communication mechanism is introduced into a deep reinforcement learning algorithm to solve the multi-agent problem. A layer of gated recurrent unit(GRU) is added to the actor-network structure to remember historical environmental states. Subsequently,another GRU is designed as a communication channel in the Comm Net core network layer to refine communication information between UAVs. Finally, the simulation results of the algorithm in two sets of scenarios are given, and the results show that the method has good effectiveness and applicability.

Optimization of Cooperative RelayingMolecular Communications for Nanomedical Applications

Recently,nano-systems based on molecular communications via diffusion(MCvD)have been implemented in a variety of nanomedical applications,most notably in targeted drug delivery system(TDDS)scenarios.Furthermore,because the MCvD is unreliable and there exists molecular noise and inter symbol interference(ISI),cooperative nano-relays can acquire the reliability for drug delivery to targeted diseased cells,especially if the separation distance between the nano transmitter and nano receiver is increased.In this work,we propose an approach for optimizing the performance of the nano system using cooperative molecular communications with a nano relay scheme,while accounting for blood flow effects in terms of drift velocity.The fractions of the molecular drug that should be allocated to the nano transmitter and nano relay positioning are computed using a collaborative optimization problem solved by theModified Central Force Optimization(MCFO)algorithm.Unlike the previous work,the probability of bit error is expressed in a closed-form expression.It is used as an objective function to determine the optimal velocity of the drug molecules and the detection threshold at the nano receiver.The simulation results show that the probability of bit error can be dramatically reduced by optimizing the drift velocity,detection threshold,location of the nano-relay in the proposed nano system,and molecular drug budget.

User Preference Aware Hierarchical Edge-User Cooperative Caching Strategy

The emergence of various new services has posed a huge challenge to the existing network architecture.To improve the network delay and backhaul pressure,caching popular contents at the edge of network has been considered as a feasible scheme.However,how to efficiently utilize the limited caching resources to cache diverse contents has been confirmed as a tough problem in the past decade.In this paper,considering the time-varying user requests and the heterogeneous content sizes,a user preference aware hierarchical cooperative caching strategy in edge-user caching architecture is proposed.We divide the caching strategy into three phases,that is,the content placement,the content delivery and the content update.In the content placement phase,a cooperative content placement algorithm for local content popularity is designed to cache contents proactively.In the content delivery phase,a cooperative delivery algorithm is proposed to deliver the cached contents.In the content update phase,a content update algorithm is proposed according to the popularity of the contents.Finally,the proposed caching strategy is validated using the MovieLens dataset,and the results reveal that the proposed strategy improves the delay performance by at least 35.3%compared with the other three benchmark strategies.

Cooperative Rate Splitting Transmit Design for Full-Duplex-Enabled Multiple Multicast Communication Systems

This paper examines the performance of Full-Duplex Cooperative Rate Splitting(FD-CRS)with Simultaneous Wireless Information and Power Transfer(SWIPT)support in Multiple Input Single Output(MISO)networks.In a Rate Splitting Multiple Access(RSMA)multicast system with two local users and one remote user,the common data stream contains the needs of all users,and all users can decode the common data stream.Therefore,each user can receive some information that other users need,and local users with better channel conditions can use this information to further enhance the reception reliability and data rate of users with poor channel quality.Even using Cell-Center-Users(CCUs)as a cooperative relay to assist the transmission of common data can improve the average system speed.To maximize the minimum achievable rate,we optimize the beamforming vector of Base Station(BS),the common streamsplitting vector,the cooperative distributed beamvector and the strong user transmission power under the power budget constraints of BS and relay devices and the service quality requirements constraints of users.Since the whole problem is not convex,we cannot solve it directly.Therefore,we propose a low complexity algorithm based on Successive Convex Approximation(SCA)technology to find the optimal solution to the problemunder consideration.The simulation results show that FD C-RSMA has better gain andmore powerful than FD C-NOMA,HD C-RSMA,RSMA and NOMA.

Cooperative guidance law based on super-twisting observer for target maneuvering

To solve the problem that multiple missiles should simultaneously attack unmeasurable maneuvering targets,a guidance law with temporal consistency constraint based on the super-twisting observer is proposed.Firstly,the relative motion equations between multiple missiles and targets are established,and the topological model among multiple agents is considered.Secondly,based on the temporal consistency constraint,a cooperative guidance law for simultaneous arrival with finite-time convergence is derived.Finally,the unknown target maneuver-ing is regarded as bounded interference.Based on the second-order sliding mode theory,a super-twisting sliding mode observer is devised to observe and track the bounded interfer-ence,and the stability of the observer is proved.Compared with the existing research,this approach only needs to obtain the sliding mode variable which simplifies the design process.The simulation results show that the designed cooperative guidance law for maneuvering targets achieves the expected effect.It ensures successful cooperative attacks,even when confronted with strong maneuvering targets.

A Pricing-Based Cooperative Relay Selection Scheme for Reliable Communications

With the rapid development and application of energy harvesting technology,it has become a prominent research area due to its significant benefits in terms of green environmental protection,convenience,and high safety and efficiency.However,the uneven energy collection and consumption among IoT devices at varying distances may lead to resource imbalance within energy harvesting networks,thereby resulting in low energy transmission efficiency.To enhance the energy transmission efficiency of IoT devices in energy harvesting,this paper focuses on the utilization of collaborative communication,along with pricing-based incentive mechanisms and auction strategies.We propose a dynamic relay selection scheme,including a ladder pricing mechanism based on energy level and a Kuhn-Munkre Algorithm based on an auction theory employing a negotiation mechanism,to encourage more IoT devices to participate in the collaboration process.Simulation results demonstrate that the proposed algorithm outperforms traditional algorithms in terms of improving the energy efficiency of the system.

Joint computation offloading and parallel scheduling to maximize delay-guarantee in cooperative MEC systems

The growing development of the Internet of Things(IoT)is accelerating the emergence and growth of new IoT services and applications,which will result in massive amounts of data being generated,transmitted and pro-cessed in wireless communication networks.Mobile Edge Computing(MEC)is a desired paradigm to timely process the data from IoT for value maximization.In MEC,a number of computing-capable devices are deployed at the network edge near data sources to support edge computing,such that the long network transmission delay in cloud computing paradigm could be avoided.Since an edge device might not always have sufficient resources to process the massive amount of data,computation offloading is significantly important considering the coop-eration among edge devices.However,the dynamic traffic characteristics and heterogeneous computing capa-bilities of edge devices challenge the offloading.In addition,different scheduling schemes might provide different computation delays to the offloaded tasks.Thus,offloading in mobile nodes and scheduling in the MEC server are coupled to determine service delay.This paper seeks to guarantee low delay for computation intensive applica-tions by jointly optimizing the offloading and scheduling in such an MEC system.We propose a Delay-Greedy Computation Offloading(DGCO)algorithm to make offloading decisions for new tasks in distributed computing-enabled mobile devices.A Reinforcement Learning-based Parallel Scheduling(RLPS)algorithm is further designed to schedule offloaded tasks in the multi-core MEC server.With an offloading delay broadcast mechanism,the DGCO and RLPS cooperate to achieve the goal of delay-guarantee-ratio maximization.Finally,the simulation results show that our proposal can bound the end-to-end delay of various tasks.Even under slightly heavy task load,the delay-guarantee-ratio given by DGCO-RLPS can still approximate 95%,while that given by benchmarked algorithms is reduced to intolerable value.The simulation results are demonstrated the effective-ness of DGCO-RLPS for delay guarantee in MEC.

Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks

Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.

Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals

Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.

Resilience-driven cooperative reconfiguration strategy for unmanned weapon system-of-systems

As the unmanned weap system-of systems(UWSoS)becomes complex,the inevitable uncertain interference gradu-ally increases,which leads to a strong emphasis on the resilience of UWSoS.Hence,this paper presents a resilience-driven cooperative reconfiguration strategy to enhance the resilience of UWSoS.First,a unified resilience-driven coopera-tive reconfiguration strategy framework is designed to guide the UWSoS resilience enhancement.Subsequently,a cooperative reconfiguration strategy algorithm is proposed to identify the optimal cooperative reconfiguration sequence,combining the cooperative pair resilience contribution index(CPRCI)and coop-erative pair importance index(CPII).At last,the effectiveness and superiority of the proposed algorithm are demonstrated through various attack scenario simulations that include differ-ent attack modes and intensities.The analysis results can pro-vide a reference for decision-makers to manage UWSoS.

How to promote cooperative innovation in environmentally friendly technology:a case of agricultural biotechnology in China

This study explored the factors influencing cooperative innovation in environmentally friendly agricultural biotechnology in China.First,we constructed an evolutionary game model comprising the factors of net income of cooperative innovation,net income of independent innovation,market constraints,and government subsidies.Using MATLAB simulation,we assigned different values to the aforementioned variables to explore the evolutionary trend of innovators’willingness to cooperate.Results showed that when the values of net income of cooperative innovation,net income of independent innovation,market constraints,and government subsidies exceeded the threshold,innovators’willingness to cooperate was significantly enhanced.Furthermore,the proportion of innovators who cooperated with others gradually increased to 100%;otherwise,it gradually decreased to 0%.Comparing the simulation curve with the real evolution curve of cooperative innovation in agricultural biotechnology in China,we found that the gradual decline in the willingness to cooperate could be due to insufficient subsidies for cooperative innovation,low income from cooperative innovation,weak profitability of innovators,and weak market constraints.

Regional Multi-Agent Cooperative Reinforcement Learning for City-Level Traffic Grid Signal Control

This article studies the effective traffic signal control problem of multiple intersections in a city-level traffic system.A novel regional multi-agent cooperative reinforcement learning algorithm called RegionSTLight is proposed to improve the traffic efficiency.Firstly a regional multi-agent Q-learning framework is proposed,which can equivalently decompose the global Q value of the traffic system into the local values of several regions Based on the framework and the idea of human-machine cooperation,a dynamic zoning method is designed to divide the traffic network into several strong-coupled regions according to realtime traffic flow densities.In order to achieve better cooperation inside each region,a lightweight spatio-temporal fusion feature extraction network is designed.The experiments in synthetic real-world and city-level scenarios show that the proposed RegionS TLight converges more quickly,is more stable,and obtains better asymptotic performance compared to state-of-theart models.