Intelligent Transportation Systems(ITS)leverage Integrated Sensing and Communications(ISAC)to enhance data exchange between vehicles and infrastructure in the Internet of Vehicles(IoV).This integration inevitably incr...Intelligent Transportation Systems(ITS)leverage Integrated Sensing and Communications(ISAC)to enhance data exchange between vehicles and infrastructure in the Internet of Vehicles(IoV).This integration inevitably increases computing demands,risking real-time system stability.Vehicle Edge Computing(VEC)addresses this by offloading tasks to Road Side Units(RSUs),ensuring timely services.Our previous work,the FLSimCo algorithm,which uses local resources for federated Self-Supervised Learning(SSL),has a limitation:vehicles often can’t complete all iteration tasks.Our improved algorithm offloads partial tasks to RSUs and optimizes energy consumption by adjusting transmission power,CPU frequency,and task assignment ratios,balancing local and RSU-based training.Meanwhile,setting an offloading threshold further prevents inefficiencies.Simulation results show that the enhanced algorithm reduces energy consumption and improves offloading efficiency and accuracy of federated SSL.展开更多
As the current medium access control protocols with Multiple Input Multiple Output （MIMO） links only bear point to point service, broadcast scheduling algorithm in ad hoc networks with MIMO links is proposed. The ke...As the current medium access control protocols with Multiple Input Multiple Output （MIMO） links only bear point to point service, broadcast scheduling algorithm in ad hoc networks with MIMO links is proposed. The key to the proposed broadcast scheduling algorithm is the time slot scheduling algorithm which guarantees collisi~）n-free transmissions for every node and the mini- mum frame length. The proposed algorithm increases the simultaneous transmissions of MIMO links efficiently. Due to the interference null capacity of MIMO links, the interference node set of each node can decrease from two-hop neighbors to one-hop neighbors possibly. Simulation results show that our algorithm can greatly improve network capacity and decrease average packet delay.展开更多
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k sym...The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.展开更多
文摘Intelligent Transportation Systems(ITS)leverage Integrated Sensing and Communications(ISAC)to enhance data exchange between vehicles and infrastructure in the Internet of Vehicles(IoV).This integration inevitably increases computing demands,risking real-time system stability.Vehicle Edge Computing(VEC)addresses this by offloading tasks to Road Side Units(RSUs),ensuring timely services.Our previous work,the FLSimCo algorithm,which uses local resources for federated Self-Supervised Learning(SSL),has a limitation:vehicles often can’t complete all iteration tasks.Our improved algorithm offloads partial tasks to RSUs and optimizes energy consumption by adjusting transmission power,CPU frequency,and task assignment ratios,balancing local and RSU-based training.Meanwhile,setting an offloading threshold further prevents inefficiencies.Simulation results show that the enhanced algorithm reduces energy consumption and improves offloading efficiency and accuracy of federated SSL.
基金supported by the National Natural Science Foundation of China(No.6037 2048)Microsoft Research Asia,TRAP0YT,Natural Science Foundation of China(No.60496 316)+1 种基金China"863"Project on cognitive radio(2005AA123910),M0E(104171)Research Fund for the Doctoral Program of Higher Education(20050701007).
文摘As the current medium access control protocols with Multiple Input Multiple Output （MIMO） links only bear point to point service, broadcast scheduling algorithm in ad hoc networks with MIMO links is proposed. The key to the proposed broadcast scheduling algorithm is the time slot scheduling algorithm which guarantees collisi~）n-free transmissions for every node and the mini- mum frame length. The proposed algorithm increases the simultaneous transmissions of MIMO links efficiently. Due to the interference null capacity of MIMO links, the interference node set of each node can decrease from two-hop neighbors to one-hop neighbors possibly. Simulation results show that our algorithm can greatly improve network capacity and decrease average packet delay.
基金supported by the National Natural Science Foundation of China under Grant No. 61063041the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047the Funds of the Education Department of Gansu Province under Grant No. 1001-09
文摘The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.
