Adaptive Retransmission Design for Wireless Federated Edge Learning

As a popular distributed machine learning framework,wireless federated edge learning(FEEL)can keep original data local,while uploading model training updates to protect privacy and prevent data silos.However,since wireless channels are usually unreliable,there is no guarantee that the model updates uploaded by local devices are correct,thus greatly degrading the performance of the wireless FEEL.Conventional retransmission schemes designed for wireless systems generally aim to maximize the system throughput or minimize the packet error rate,which is not suitable for the FEEL system.A novel retransmission scheme is proposed for the FEEL system to make a tradeoff between model training accuracy and retransmission latency.In the proposed scheme,a retransmission device selection criterion is first designed based on the channel condition,the number of local data,and the importance of model updates.In addition,we design the air interface signaling under this retransmission scheme to facilitate the implementation of the proposed scheme in practical scenarios.Finally,the effectiveness of the proposed retransmission scheme is validated through simulation experiments.

Mechanism of Fast Data Retransmission in CU-DU Split Architecture of 5G NRG

The 5G radio access network （RAN） architectm＇e is supposed to be split into the central unit （CU） and the distributed unit （DU） in order to support more flexible transport networks and provide enhanced user experience. However, such functional split may also introduce some new technical issues. In this pa- per, we study the data fast retransmission issue introduced by this functional split in different scenarios and solutions are provided to handle this issue. With the fast data retransmis- sion mechanism proposed in this paper, the retransmitted da- ta packets could be identified and handled with high priority. In this way, the data delivery between the CU and DU in 5G RAN is assured.

Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet

In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).

A New HARQ Scheme for 5G Systems via Interleaved Superposition Retransmission

Within the framework of the 5G new radio(NR),we propose a new hybrid automatic repeat request(HARQ)scheme to improve the throughput performance.The difference between the proposed scheme and the conventional one lies in the first retransmission,where the erroneous coded block group is interleaved and superimposed(XORed)onto a fresh coded block group.At the receiver,an iterative message-passing decoding algorithm can be employed to recover the target erroneous code block group(CBG).Only when the superposed retransmission fails,the conventional incremental redundancy(IR)or repetition redundancy(RR)retransmission is initiated.In any case,since the first retransmission is along with but has negligible effect on the fresh CBG,it costs neither transmitted power nor bandwidth.Monte-Carlo simulation results reveal that the presented HARQ schemes can achieve throughput improvements up to 10%over block fading channels and up to 50%over fast fading channels in comparison with the original 5G CBG-level HARQ scheme but without excessively increasing the implementation complexity.

Enhanced cooperative packet retransmission employing joint cooperative diversity and symbol mapping diversity

A joint cooperation diversity and symbol mapping diversity (SMD) strategy is proposed for cooperative packet retransmission system with high-order modulation such as 16QAM. Substantial SER/BER (symbol error rate/bit error rate) gains result from multiple packet transmissions over independent paths and distinct bit-to-symbol mappings for each packet transmis-sion. The SER/BER performance of relay assisted retransmission system is analyzed. Simulation results show that the joint-diversity strategy can provide more BER gains than other relaying strategies (i.e., decode-and-forward and constellation rearrangement relaying strategies) when no relay makes a decision error; but if some relays make decision errors, the joint-di-versity strategy outperforms other relaying strategies only when the relays are closer to the source than to the destination.

Optimizing Utility of Cognitive Radio Ad Hoc Networks under the Energy and Retransmission Constraint

In Cognitive radio ad hoc networks （CRAHNs）, the secondary users （SUs） or cognitive radio nodes （CRs） are always equipped with limited energy and have a high error probability of data transmission. To address this issue, we first describe the network utility under energy constraint as a max-min model, where the re-transmission strategy with network coding is employed. Additionally, the expression of retransmission probability is presented in terms of power and bit error rate （BER）. Moreover, since the max-min model is non-convex in both objective and constraints, we use a normal- form game to find a near-optimal solution. The simulation results show that the proposed approach could achieve a higher network utility than the compared approaches.

AN ADAPTIVE OPPORTUNISTIC RETRANSMISSION CONTROL SCHEME ENVIRONMENT-AWARE-BASED FOR WIRELESS MULTIMEDIA MESH NETWORKS

In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh networks. The proposed scheme provides maximum retransmis-sion count optimization based on environment-aware to improve packet relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore, the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme significantly reduces packet collision probability and packet loss rate, and thus improves network throughput.

The Overload Reduction in SIP Servers through Exact Regulation of the Retransmission Timer of the Invite Message

To initiate voice, image, instant messaging and general multimedia communication, the Session communication must initiate between two participants. SIP (Session initiation protocol) is an application layer control, which task is creating management, and terminating this kind of Sessions. With regard to the independence of SIP from the Transport layer protocols, the SIP messages can be transferred on a variety of Transport layer protocols such as TCP or UDP. The mechanism of Retransmission, which has been embedded in SIP, is able to compensate the missing Packet loss, if needed. The application of this mechanism is when SIP messages are transmitted on an unreliable transmission layer protocol such as UDP. This mechanism, while facing with SIP proxy with overload, causes excessive filling of proxy queue, delays the increase of other contacts and adds the amount of the proxy overload. We in this article, while using UDP, as the Transport layer protocol, by regulating the Invite Retransmission Timer appropriately (T1), have improved the SIP functionality. Therefore, by proposing an Adaptive Timer of Invite message retransmission, we have tried to improve the time of Session initiation and as a result, improving the performance. The performance of the proposed SIP, by the SIPP software in a real network environment has been implemented and evaluated and its accuracy and performance has been demonstrated.

Fault-Tolerant Design for Data Efficient Retransmission in WiNoC

There is a sharp decline in the network performance when the wireless link fails as a data path in the Wireless Network-on-Chip(WiNoC).To counteract this problem,we propose a fault-tolerance mechanism for the efficient retransmission of data in the WiNoC.When an error is detected in the data transmission process,this mechanism works to feed back the fault information to the source node in real time via fault signal lines.In the source node,the highest transmission priority is assigned to the backup retransmitted data,and the corresponding direct link is positioned to enable the data packet for its efficient retransmission to the destination node,thereby ensuring efficiency in fault tolerance.Additionally,we have improved the receiving port of the wireless router,added the corresponding redundant buffers and mux,and dynamically selected the retransmitted non-faulty data packets to be written to the local router in order to avoid the disorderly retransmission of the data packets.The evaluation results of this paper demonstrate that compared with the methods which are under different fault conditions,this fault-tolerant method drastically improves the data throughput rate,reduces the delay,effectively guarantees the reliability of the network,and improves the system performance.

Efficient wireless multicast retransmission using network coding

In wireless multicast, network coding has recently attracted attentions as a substantial improvement to packet retransmission schemes. However, the problem of finding the optimal network code which minimizes the retransmissions is hard to solve or approximate. This paper presents two schemes to reduce the number of retransmissions for reliable multicast efficiently. One is retransmission using network coding based on improved Vandermonde matrix （VRNC）, the other is retransmission using network coding based on adaptive improved Vandermonde matrix （AVRNC）. Using VRNC scheme the sender selects the packets all receivers have lost and encodes them with improved Vandermonde matrix; when receivers receive enough encoded retransmission packets, all the lost packets can be recovered. With AVRNC scheme, the sender can obtain the recovery information from all the receivers after sending out per retransmission packet, and then the improved Vandermonde matrix can be updated, thus reducing the complexity of encoding and decoding. Our proposed schemes can achieve the theoretical lower bound assuming retransmission packets lossless, and approach the theoretical lower bound considering retransmission packets loss. Simulation results show that the proposed algorithms can efficiently reduce the number ofretransmissions, thus improving transmission efficiency.

Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission

Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on oppornistic network coding （ONC） face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission （OONCR） is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm eomplexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%-40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes.

Retransmission in the network-coding-based packet network

In this paper, retransmission strategies of the network-coding-based packet network are investigated. We propose two retransmission strategies, the packet-loss-edge-based retransmission strategy (PLERT) and the minimum retransmission strategy (MRT), which focus on optimizing the retransmission efficiency without the constraint on the encoding field size. We compared the performances of the proposed retransmission strategies with the traditional automatic repeat-request (ARQ) strategy and the random retransmission strategy. Simulation results showed that the PLERT strategy works well when the packet loss rate is small. Among these retransmission strategies, the performance of the MRT strategy is the best at the cost of the high complexity that is still polynomial. Furthermore, neither of the proposed strategies is sensitive to the encoding field size.

Ultra Reliable Load-Aware Connection Management(LACM)Algorithm in WIA-FA Systems

The increasing demand for industrial automation and intelligence has put forward higher requirements for the reliability of industrial wireless communication technology.As an international standard based on 802.11,Wireless networks for Industrial Automation-Factory Automation(WIA-FA)greatly improves the reliability in factory automation scenarios by Time Division Multiple Access(TDMA).However,in ultra-dense WIA-FA networks with mobile users,the basic connection management mechanism is inefficient.Most of the handover and resource management algorithms are all based on frequency division multiplexing,not suitable for the TDMA in the WIA-FA network.Therefore,we propose Load-aware Connection Management(LACM)algorithm to adjust the linkage and balance the load of access devices to avoid blocking and improve the reliability of the system.And then we simulate the algorithm to find the optimal settings of the parameters.After comparing with other existing algorithms,the result of the simulation proves that LACM is more efficient in reliability and maintains high reliability of more than 99.8%even in the ultra-dense moving scenario with 1500 field devices.Besides,this algorithm ensures that only a few signaling exchanges are required to ensure load bal-ancing,which is no more than 5 times,and less than half of the best state-of-the-art algorithm.

EEFA： Energy Efficiency Frame Aggregation Scheduling Algorithm for IEEE 802.11n Wireless Network

Packet size is restricted due to the error-prone wireless channel which drops the network energy utilization. Furthermore, the frequent packet retransmissions also lead to energy waste. In order to improve the energy efficiency of wireless networks and save the energy of wireless devices, EEFA （Energy Efficiency Frame Aggregation）, a frame aggregation based energy-efficient scheduling algorithm for IEEE 802.11n wireless network, is proposed. EEFA changes the size of aggregated frame dynamically according to the frame error rate, so as to ensure the data transmission and retransmissions completed during the TXOP and reduce energy consumption of channel contention. NS2 simulation results show that EEFA algorithm achieves better performance than the original frame-aggregation algorithm.

Streaming and congestion control using scalable video coding based on H.264/AVC

This paper presents a streaming system using scalable video coding based on H.264/AVC. The system provides a congestion control algorithm supported by channel bandwidth estimation of the client. It uses retransmission only for packets of the base layer to disburden the congested network. The bandwidth estimation allows for adjusting the transmission rate quickly to the current available bandwidth of the network. Compared to binomial congestion control, the proposed system allows for shorter start-up times and data rate adaptation. The paper describes the components of this streaming system and the results of experiments showing that the proposed approach works effectively for streaming video.

Design and Implementation of Secure and Reliable Information Interaction Architecture for Digital Twins

In order to improve the comprehensive defense capability of data security in digital twins(DTs),an information security interaction architecture is proposed in this paper to solve the inadequacy of data protection and transmission mechanism at present.Firstly,based on the advanced encryption standard(AES)encryption,we use the keystore to expand the traditional key,and use the digital pointer to avoid the key transmission in a wireless channel.Secondly,the identity authentication technology is adopted to ensure the data integrity,and an automatic retransmission mechanism is added for the endogenous properties of the wireless channel.Finally,the software defined radio(SDR)platform composed of universal software radio peripheral(USRP)and GNU radio is used to simulate the data interaction between the physical entity and the virtual entity.The numerical results show that the DTs architecture can guarantee the encrypted data transmitted completely and decrypted accurately with high efficiency and reliability,thus providing a basis for intelligent and secure information interaction for DTs in the future.

RTP-Packets’ Loss Recovery Scheme Based on Layered Buffer-Routers

This paper introduces an RTP-packets' loss recovery scheme in MPEG-4 playback type multicast application model, which is based on retransmission scheme. Through the auxiliary and coordinated buffer playing scheme of layered “buffer-routers”, the RTP-packets' loss recovery in limited time is made possible. We consider in the scheme to handle retransmission request with buffer waiting when network congestion occurs. Thus, neither the degree of congestion will be worsened nor the retransmission request will be lost when sending the request to higher-level buffer router. The RTP-packets' loss recovery scheme suggested by us is not only applied to MPEG-4 multicast application in LAN, but also can be extended to more spacious WAN (wide area network) when user groups comparatively centralize in certain number of local areas. Key words MPEG-4 - retransmission - RTP - loss recovery CLC number TP 393 Foundation item: Supported by the “Tenth Five-year Plan” 211 Engineering Construction ItemBiography: XU Xian-bin(1954-), male, professor Ph. D candidate, research directions: computer network and communication, distributed parallel processing, mass information storage.

Efficient Priority Packet Recovery Based on Network Coding in DVB-IPDC System

In DVB-IPDC system, due to the constraints of handheld devices and the broadcast nature of wireless network, packet loss is inevitable. ECDR-NC proposed is a retransmission encoding packet selection algorithm based on the dynamic information updating, which can find the current most effective complete decoding packet. ECDR-NC can not only avoid the redundant encoding packets due to the overlapping among encoding packets, but also reduce the computational complexity compared with the traditional encoding schemes. Furthermore, the retransmission upper bound of ECDR-NC is fully controlled. In time-sensitive applications, to maximize the aggregate number of recovery packets while minimizing the total number of discarded packets due to the time limit according to the priority preference, the adaptive priority scheme EPNC is formulized, and the weighted relation graph is constructed to find the maximum-weighted encoding packets sequence according to the decoding gains. In the same network environment, the performances comparisons between PNC and EPNC show that EPNC is more efficient and more rational, and the average discarded packets ratios ofEPNC can be reduced about 18%~27%. The main contributions of this paper are an effective retransmission encoding packet selection algorithm ECDR-NC proposed, and a new adaptive priority recovery scheme EPNC introduced into DVB-IPDC system.

HARQ Optimization for PDCP Duplication-Based 5G URLLC Dual Connectivity

Packet duplication(PD)with dual connectivity(DC)was newly introduced in the 5G New Radio(NR)specifications to meet the stringent ultra reliable low latency communication(URLLC)requirements.PD technology uses duplicated packets in the packet data convergence protocol(PDCP)layer that are transmitted via two different access nodes(ANs)to the user equipment(UE)in order to enhance the reliability performance.However,PD can result in unnecessary retransmissions in the lower layers since the hybrid automatic retransmission request(HARQ)operation is unaware of the transmission success achieved through the alternate DC link to the UE.To overcome this issue,in this paper,a novel duplication-aware retransmission optimization(DRO)scheme is proposed to reduce the resource usage induced by unnecessary HARQ retransmissions.The proposed DRO scheme can minimize the average channel use while satisfying the URLLC requirements.The proposed DRO scheme derives the optimal HARQ retransmission attempts for different ANs by solving a nonlinear integer programming(NLIP)problem.The performance of the proposed DRO scheme was evaluated using MATLAB simulation and is compared to the existing 5G HARQ support schemes.The simulations results show that the proposed DRO scheme can provide a 14.71%and 15.11%reduced average channel use gain compared to the selective data duplication upon failure(SDUF)scheme and latency-aware dynamic multi-connectivity algorithm(LADMA)scheme,respectively,which are the existing 5G PD schemes that use HARQ.

Markov Model for Packet Scheduling in the Transmission of Streaming Media

The difficulties in the transmission of streaming media are analyzed, the packet scheduling on the streaming media server is studied. A Markov model is proposed under the effect of the complex dependency among the streaming media packets and the parameters of the transmission channel. On the basis of the Markov model, a policy is made to queue the streaming media packets in the sending buffer by using the iteration method, which can optimize the playback quality under the lack of the channel bandwidth.