WO2017161158A1 - Procédé d'exploitation de diversité avec codage de réseau - Google Patents

Procédé d'exploitation de diversité avec codage de réseau Download PDF

Info

Publication number
WO2017161158A1
WO2017161158A1 PCT/US2017/022772 US2017022772W WO2017161158A1 WO 2017161158 A1 WO2017161158 A1 WO 2017161158A1 US 2017022772 W US2017022772 W US 2017022772W WO 2017161158 A1 WO2017161158 A1 WO 2017161158A1
Authority
WO
WIPO (PCT)
Prior art keywords
batch
packets
relay node
node
operating
Prior art date
Application number
PCT/US2017/022772
Other languages
English (en)
Inventor
Dapeng Oliver Wu
Jiade LI
Qiuyuan Huang
Yun Zhu
Original Assignee
University Of Florida Research Foundation, Incorporated
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University Of Florida Research Foundation, Incorporated filed Critical University Of Florida Research Foundation, Incorporated
Publication of WO2017161158A1 publication Critical patent/WO2017161158A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • H04L12/4625—Single bridge functionality, e.g. connection of two networks over a single bridge
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/042—Public Land Mobile systems, e.g. cellular systems
    • H04W84/047—Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations

Definitions

  • the network code encodes K native packets to produce N encoded packets, where N is greater than K such that the encoded packets comprise redundant information.
  • receiving an indication of the size of the first portion comprises receiving a header associated with the second batch comprising the indication.
  • the second relay node comprises a cell of a 5G network.
  • a method of operating a sink node in a communication system comprises a source node, the sink node, a first relay node and a second relay node in which the source node transmits a first batch of encoded packets encoding a plurality of native packets.
  • the method comprises, at the sink node, receiving a first plurality of encoded packets from the first relay node, receiving a second plurality of encoded packets from the second relay node and decoding the first plurality of packets and second plurality of packets as a batch encoded with a network code to recover a third plurality of native packets.
  • the first plurality of encoded packets and the second plurality of encoded packets are encoded with a network code.
  • the network code is such that information representing the third plurality of native packets is distributed across the first plurality of encoded packets and the second plurality of native packets.
  • the second plurality of encoded packets has fewer packets then the first plurality of encoded packets.
  • the first plurality of encoded packets and the second plurality of encoded packets are received in the same frame of a network protocol used by the communication system.
  • the sink node comprises a handset.
  • FIG. 2 is a a graph of the logical flow of Helper /;
  • FIGs. 3a and 3b are graphs showing comparisons of transfer matrices
  • FIG. 4 is a graph of the header structure of a Miss and Forward (MF) packet
  • FIG. 5 is a graph of the selection process for Helper B
  • FIG. 9 is a graph of the throughput of MF and Batched Sparse codes (BATS) versus number of hops under different loss rates;
  • FIG. l ib is a graph of throughput for different coding schemes versus SNR, under fading channel;
  • FIG. 12 is a graph of throughput for different coding schemes versus loss probability;
  • FIG. 14a is a graph of throughputs for different coding scheme versus number of hops, under a channel loss rate of 0.1;
  • FIG. 14b is a graph of throughputs for different coding scheme versus number of hops, under a channel loss rate of 0.3.
  • a relay node may retransmit a second batch of encoded packets conveying that information to a sink node, as in a conventional communication system using network coding.
  • the relay may nonetheless pass on a second batch of encoded packets.
  • the second batch may have fewer packets than the first batch, reflecting the fact that the relay has less information to retransmit.
  • a second relay node may serve as a "helper" for a first relay node.
  • the helper node may provide a third batch of encoded packets to the sink node. This third batch of packets may contain enough encoded packets that the combination of the second batch and the third batch supplies enough information to recreate the full set of native packets represented by the first batch of encoded packets.
  • the second and third batches are formed by randomly mixing portions of the first batch, such that, if the sink nodes receives a sufficient number of packets from the second and third batches combined, it will have enough information to recreate the native packets represented by the first batch - regardless of which relay node retransmitted the packets received at the sink.
  • the first relay node may be aware of the second relay node such that the relays may coordinate their actions.
  • nodes in a network may, from time to time, communicate with nearby nodes using a handshaking protocol that allows a relay node to identify a nearby node that will serve as a helper.
  • the helper node may identify the relay node for which it is a helper as a result of that handshaking.
  • the relay may communicate to the helper the number of encoded packets in a first batch it correctly received.
  • the helper may use that information to determine the number of encoded packets to transmit in the third batch.
  • the helper may also determine times at which to transmit based on action of an associated relay node.
  • the network protocol may divide time into time slots and frames, with a full rank batch, of the size that would be transmitted by the source node, being transmitted in one frame.
  • the first and second relay nodes may coordinate transmission such that the second and third batches are transmitted in a frame.
  • next-generation wireless networks [REFs. 21, 22]
  • the aforementioned "help” is readily available and can be exploited.
  • another relay node such as relay node HI
  • the packets received from relay node HI provide remedy to the ones received from relay node Rl. Rather than having Rl transmit all N recoded packets, the more efficient way is to let HI help share Rl's task by recoding and forwarding the missed packets.
  • Miss-and-F orward MF
  • MF is based on a new logical topology as shown in FIG. la, in which an unexploited relay H in the vicinity of a relay R, herein referred to as "helper", is chosen to be coupled with the relay R.
  • the batched sparse codes generated from the source node, are recoded by the relay and its corresponding helper in a cooperative fashion where the helper node captures missed information and provides remedy.
  • an exemplary systematic design for MF is provided along with discussions of some practical issues including packets structure, helper selection, and runtime rank estimation.
  • the disclosed design may be simulated along with several reference designs such as BATS codes, fountain codes and RLNC, in a TDMA multi-hop network.
  • the disclosed design may achieve significant gain over fountain codes and existing network coding schemes. More importantly, the achieved throughput is only 5% lower than the theoretical upper bounds calculated under the optimal operating condition according to some embodiments.
  • MF may be derived from BATS codes [REF. 21].
  • BATS codes achieve both low decoding complexity and high resistance to the channel loss.
  • MF extends the original BATS codes to better exploit the massive relays in ultra dense networks.
  • MF relies on a pair of relay and helper nodes to perform cooperative recoding.
  • a source node may want to transmit a file consisting of K native packets to a destination sink node (Node L + 1) over L hops.
  • Each packet denoted by a column vector in IF ⁇ , has T symbols in a finite field IF ⁇ , where q is the field size.
  • the set of K native packets is denoted by the following matrix:
  • precoding may be performed, similar to RaptorQ (RQ) code [REF. 4] .
  • RQ RaptorQ
  • the precoding may be achieved by a traditional erasure code such as LDPC and Reed-Solomon code.
  • the output packets are further encoded by the outer encoder of MF.
  • the outer code of MF may be the same as the outer code of a BATS codes.
  • a source node encodes the K native packets into a number of batches, each containing M coded packets.
  • the number of batches may be any number.
  • the t-th batch Xi is generated from a subset B t c B (B G Wq XK ) by the following operation:
  • G t G ⁇ ⁇ is herein called the generator matrix of the t-th batch; B t G IFq Xdt ; Xi G IFq XM .
  • Matrix G t may be randomly generated, with all entries independently and identically chosen from Wq according to a uniform distribution.
  • Y ⁇ i +1 represents the set of packets in the t-th batch that is correctly received by Relay I + 1 from Relay I
  • Y i t is the set of packets totally received at Relay I.
  • the recoding behavior of the Relay I may be summarized as the following formula:
  • Helper I may overhear packets sent from both Relay I— 1 and Relay I and deal with different situations accordingly.
  • the Helper stores all the correctly received packets in a batch from Relay I— 1 in its local buffer as described in Eqn. 4, expecting them missed at Relay I .
  • Helper I overhears those packets and regards them as a command to start to recode and send its own.
  • the number of recoded packets sent by Relay I may be contained in the field "Sent Num" in the packet header, so Helper I knows how to recode according to Eqn. 5 and Eqn. 7.
  • Helper I may also keep a local variable N current to denote the ID of its currently processing batch. If the overheard packet does not belong to the batch it holds, Helper / will ignore this packet.
  • N packet is the batch ID of the incoming packet.
  • decoding is performed at the sink Node L + 1 to reconstruct the K native packets.
  • BP belief propagation
  • n number of received batches required for decoding
  • M is the rank distribution of transfer matrix
  • ⁇ is the degree distribution to be optimized
  • ⁇ ( ⁇ , h, ⁇ ) is defined in Eqn. (19) of REF. 9, the entirety of which is incorported herein by reference, and is a linear function of both h and ⁇ .
  • ⁇ may be set to be the precoding rate according to an embodiment.
  • n * may be calculated from the optimal degree distribution ⁇ * according to the sufficient conditions for successful decoding [REF. 9],
  • n' number of batches required for decoding
  • d max max ⁇ d ⁇ d > 0 ⁇ is the
  • n * may be calculated from ⁇ * ,
  • n * min ⁇ n': f(n', a, ⁇ , K, h, ⁇ * ) > 0, Va E [0,1] ⁇ , (Eqn. 12)
  • E 1 and E 2 are the loss matrices for BATS codes, and H 2 G ⁇ ⁇ .
  • H 2 G W q Xm the number of packets the relay send, one may have H 2 G W q Xm , H 2 G ⁇ ⁇ ( ⁇ m
  • H 2 may be split into H 2 and H 2 , which have the same dimension as H 2 and H 2 respectively.
  • H 2 and H 2 are still random matrices, and Eqn. 20 can be rewritten as follows:
  • the form of two matrix multiple in Eqn. 21 illustrates that the effects of the transfer matrix can be divided into two parts.
  • the first part are the matrices [E[H 2 ,EiH 2 ] and [ ⁇ , ⁇ ] on the left side. They summarize the overall impacts that a batch of packets are subject to during the first hop including loss from channel and recoding from relay.
  • the second part are the erasure matrices on the right side, which represent the effect of channel loss only, since the second hop does not involve recoding.
  • H MF and H BATS Specifically, it should be the larger one between the two.
  • the final rank loss for BATS codes is two, while that for MF is one.
  • the gain of MF over BATS codes all comes from the first hop where diversity exists.
  • Eqn. 21 also reveals that under the scenario where helper nodes exist, MF will downgrade into BATS codes if the channel loss and E are identical. Although there is still a chance for this to happen, this probability is low. On average, the MF scheme disclosed in the current invention may achieve a higher rank distribution by exploiting the diversity.
  • FIG. 4 An example header structure according to some embodiments for MF is shown in FIG. 4. Apart from the basic fields used for coding, there may be two special fields named NC Switch and Sent Num.
  • the NC switch may consist of two bits to indicate one of the following four schemes is used: 1) MF, 2) BATS, 3) RLNC, 4) Fountain code.
  • the NC switch if the NC switch equals 00, MF is enabled.
  • the Sent Num may be an 8-bit integer which plays a role only when MF is enabled and a helper is pre-assigned. The function of the Sent Num according to an embodiment was described in section 2.3.4 above.
  • H may be chosen as Helper B.
  • the relays along the routed path broadcast beacons sequentially so that the candidates nearby can hear.
  • This beacon message may bring three kinds of information about the relay itself: 1) the IP address, 2) the location, and 3) the IP address of the next hop.
  • next hop IP is available for every relay.
  • a candidate hears multiple beacons from different relays and may conduct a self-checking process to verify the candidate' s qualification as a helper.
  • the self-checking process for the candidate involves 1) determining the relay node it tries to help and 2) checking if it is in selective region of this relay. Task 1) may be achieved by exploiting location information in the beacons.
  • task 2) one candidate may turn to the IP and next IP information from all received beacons to see whether it is possible to construct the IP chain as shown in FIG.7. Note that according to an aspect of some embodiments, the prerequisite for constructing this IP chain is it stands in the right selective region 510 in FIG.5. If passes the self-checking, the candidate may compute sum distance based on Eqn. 22 and send a response back to inform Relay B of the the sum distance value.
  • Relay B may simply choose the helper according to Eqn. 23 and broadcast the confirming message to inform all the candidates of the result. The ones who are not chosen will not be involved in the data transmission phase.
  • MF doesn't require every relay has its helper. If no one is within the selective region, the relay will recode in the same way as BATS codes.
  • the source node may transmit certain number of full-rank batches as "pilot batches".
  • the pilot batches can be generated from arbitrary degree distribution as long as they satisfy the full-rank property.
  • the actual rank K will be known at the destination by the decoding process.
  • the destination sink node can generate a histogram from the rank of them, which approximates the actual rank distribution of the end-to-end transfer matrix.
  • the estimated rank distribution is then returned to the source node using a single M-sized feedback.
  • end-to-end acknowledgment (e.g., in TCP) may be used.
  • Eqn. 9 may be used to compute the theoretical throughput for both BATS 910, 930, 950 and MF 920, 940, 960.
  • the results are plotted in FIG.9.
  • all throughputs are normalized to the capacity of a single hop network without any packet loss.
  • the results show that MF can achieve higher throughput than BATS under different loss rate and number of hops in the example.
  • the throughput of both MF and BATS decreases, but MF has lower slope compared with BATS. This is because more number of hops will lead to more use of diversity.
  • the throughput gain is higher under a worse channel. MF is more resistant to the higher loss rate compared with BATS codes. For example, when the channel loss is 0.3, the throughput gain may be around 30%.
  • the performance of MF may be examined in a TDMA two-hop network.
  • TDMA is used because retransmission can be naturally turned off, and there are less out-of-control factors from the MAC layer.
  • the time slots assigned to neighboring nodes are non-overlapping so that inter-user interference is negligible.
  • the transmit buffer has enough capacity for the relay node.
  • packet losses are mainly caused by channel error and blocking effect.
  • the service rate of each node can be controlled by the number of time slots assigned to it.
  • the network protocol may divide time into time slots and frames, with a full rank batch, of the size that would be transmitted by the source node, being transmitted in one frame.
  • the relay and helper nodes may coordinate transmission such that their batches of packets are transmitted in a frame.
  • the throughput performances of MF according to the example analysis are compared with BATS codes, fountain codes and RLNC.
  • RLNC the original file is divided into many subsets, each subset containing 64 packets. The next subset is sent after receiving ACK of a previous one from the destination node. While for BATS codes and proposed MF, the original file will constantly generates batches of packets.
  • UDP is used for transportation layer protocol and static routing in the network layer.
  • two end nodes simultaneously start to transmit a 16 MByte file (16000 native packets) to each other.
  • the file throughput (in Gbps) is calculated by dividing the file size by the transmission time. The transmission time is measured from the start of file transmission until all native packets are correctly recovered and reconstructed. Since inter-session network coding is not addressed in this embodiment, the performance metric is one way throughput. In each example, twenty files are transmitted and the average value recorded.
  • the data rate Rs is chosen to be 1G bits/s.
  • the actual tested throughput is divided by Rs for normalization before used as metric.
  • Table 1 experimental parameters used according to an example analysis
  • MF may achieve better performance than BATS codes. Averagely, MF can have 0.05 more absolute normalized throughput. Depending on the SNR, the relative gain can be larger as the SNR goes down. But if SNR is too small, the performance of two scheme may be equal. [00151] Compared with AWGN channel, fading channel should have larger SNR value to achieve the same throughput under both BATS codes and MF.
  • the real channel condition may change with time, and it is hard to predict the channel condition with 100% accuracy.
  • BATS codes if the channel loss rate increases for some reason, the throughput will degrade a lot.
  • a solution for this problem is to over estimate the channel loss rate. With this safety margin, the performance may degrade less.
  • FIG.12 shows results according to three exemplary schemes: 1) MF scheme with the same distribution with BATS codes, 2) BATS codes with 30% over estimation of channel loss rate, and 3) the original BATS codes.
  • the estimated loss rate is 0.1 in this non-limiting example.
  • the blockage rate is changed under different channel loss rates, and the corresponding throughput is measured.
  • the results 1310, 1320, 1330, 1340, 1350, 1360, 1370 are plotted in FIG.13, which show that in this non- limiting example:
  • the MF experiment may be extended to multihop communications.
  • the set up of the experimental analysis may be the same as described in the sections above.
  • MF is the best among all schemes in terms of throughput.
  • the gain grows with the 1) number of hops and 2) the loss rate of channel.
  • the reason for the gain growth can be explained as follows. First, as the number of hops increases, diversity can be exploited more times and the gain can be accumulated. Besides, regarding the diversity within one hop, when the channel's loss rate is higher, the helper tends to capture more missed information and thus gives more help. These results may verify the effectiveness of the MF method under a range of channel conditions and hops.
  • MF has advantage when it comes to the throughput degradation per hop.
  • the slope of MF is only one-fifth of that of BATS codes, which makes MF especially favorable under massive relays.
  • a smart phone or other portable electronic device may include a camera, capable of capturing still or video images.
  • a computing device may include sensors such as a global positioning system (GPS) to sense location and inertial sensors such as a compass, an inclinometer and/o ran accelerometer.
  • GPS global positioning system
  • the operating system may include utilities to control these devices to capture data from them and make it available to applications executing on the computing device.
  • Such a computer readable storage medium or media can be transportable, such that the program or programs stored thereon can be loaded onto one or more different computers or other processors to implement various aspects of the present invention as discussed above.
  • the term "computer-readable storage medium” encompasses only a computer-readable medium that can be considered to be a manufacture (i.e., article of manufacture) or a machine.
  • the invention may be embodied as a computer readable medium other than a computer-readable storage medium, such as a propagating signal.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un nouveau procédé Miss-and-Forward (MF), pour un étalement d'informations tolérant aux pertes, dans lequel un relais spécial appelé "auxiliaire" est attribué pour exploiter la diversité riche. Selon certains modes de réalisation de l'invention, un schéma basé sur un codage de réseau a la capacité de restaurer les informations "manquées" sans rien perdre des avantages d'un codage épars par lots de l'état de la technique. Une conception systématique permet de résoudre des problèmes pratiques tels qu'une sélection d'auxiliaire et une estimation de distribution de rang. Des résultats tant numériques que de simulation montrent que le procédé MF surpasse des codes fontaine et des schémas de codage de réseau existants, fournissant ainsi une technique d'étalement d'informations particulièrement adaptée à une utilisation avec des réseaux ultra-denses en tirant profit des relais déployés de manière dense dans de nouvelles configurations de réseau, tels que dans des réseaux 5G.
PCT/US2017/022772 2016-03-17 2017-03-16 Procédé d'exploitation de diversité avec codage de réseau WO2017161158A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201662309823P 2016-03-17 2016-03-17
US62/309,823 2016-03-17

Publications (1)

Publication Number Publication Date
WO2017161158A1 true WO2017161158A1 (fr) 2017-09-21

Family

ID=59851862

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2017/022772 WO2017161158A1 (fr) 2016-03-17 2017-03-16 Procédé d'exploitation de diversité avec codage de réseau

Country Status (1)

Country Link
WO (1) WO2017161158A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019158010A1 (fr) * 2018-02-13 2019-08-22 华为技术有限公司 Procédé, dispositif, et système de gestion de ressources
CN112436920A (zh) * 2020-11-23 2021-03-02 南通大学 一种适用于多跳中继通信的网络编解码方法

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070177579A1 (en) * 2006-01-27 2007-08-02 Avaya Technology Llc Coding and packet distribution for alternative network paths in telecommunications networks
US20080025323A1 (en) * 2006-07-28 2008-01-31 Samsung Electronics Co., Ltd. Multi-layer multi-hop wireless system
US20080310348A1 (en) * 2005-12-02 2008-12-18 Koninklijke Philips Electronics, N.V. Wireless Systems and Methods Including Cooperative Communication Medium Access Control
WO2011113200A1 (fr) * 2010-03-17 2011-09-22 Nokia Corporation Procédé et appareil de diffusion/multidiffusion de retransmission sur la base d'un codage de réseau
US20120128009A1 (en) * 2010-11-23 2012-05-24 The Chinese University Of Hong Kong Subset coding for communication systems
WO2014074802A1 (fr) * 2012-11-09 2014-05-15 Interdigital Patent Holdings, Inc. Contrôle du trafic dans des réseaux centrés sur l'information
US8750316B2 (en) * 2004-06-18 2014-06-10 Verizon Laboratories Inc. Systems and methods for providing distributed packet loss concealment in packet switching communications networks
US20160021597A1 (en) * 2013-03-14 2016-01-21 Google Inc. Optimizing packet/frame forwarding or routing in a wireless backhaul transport system
WO2016022982A1 (fr) * 2014-08-08 2016-02-11 University Of Florida Research Foundation, Inc. Codage fontaine et codage réseau conjoints pour un étalement d'informations tolérant à l'affaiblissement

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8750316B2 (en) * 2004-06-18 2014-06-10 Verizon Laboratories Inc. Systems and methods for providing distributed packet loss concealment in packet switching communications networks
US20080310348A1 (en) * 2005-12-02 2008-12-18 Koninklijke Philips Electronics, N.V. Wireless Systems and Methods Including Cooperative Communication Medium Access Control
US20070177579A1 (en) * 2006-01-27 2007-08-02 Avaya Technology Llc Coding and packet distribution for alternative network paths in telecommunications networks
US20080025323A1 (en) * 2006-07-28 2008-01-31 Samsung Electronics Co., Ltd. Multi-layer multi-hop wireless system
WO2011113200A1 (fr) * 2010-03-17 2011-09-22 Nokia Corporation Procédé et appareil de diffusion/multidiffusion de retransmission sur la base d'un codage de réseau
US20120128009A1 (en) * 2010-11-23 2012-05-24 The Chinese University Of Hong Kong Subset coding for communication systems
WO2014074802A1 (fr) * 2012-11-09 2014-05-15 Interdigital Patent Holdings, Inc. Contrôle du trafic dans des réseaux centrés sur l'information
US20160021597A1 (en) * 2013-03-14 2016-01-21 Google Inc. Optimizing packet/frame forwarding or routing in a wireless backhaul transport system
WO2016022982A1 (fr) * 2014-08-08 2016-02-11 University Of Florida Research Foundation, Inc. Codage fontaine et codage réseau conjoints pour un étalement d'informations tolérant à l'affaiblissement

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019158010A1 (fr) * 2018-02-13 2019-08-22 华为技术有限公司 Procédé, dispositif, et système de gestion de ressources
CN110166580A (zh) * 2018-02-13 2019-08-23 华为技术有限公司 资源管理的方法、设备及系统
CN110166580B (zh) * 2018-02-13 2021-12-24 华为技术有限公司 资源管理的方法、设备及系统
CN112436920A (zh) * 2020-11-23 2021-03-02 南通大学 一种适用于多跳中继通信的网络编解码方法
CN112436920B (zh) * 2020-11-23 2021-10-26 南通大学 一种适用于多跳中继通信的网络编解码方法

Similar Documents

Publication Publication Date Title
US10530526B2 (en) Joint fountain coding and network coding for loss-tolerant information spreading
Lun et al. Network coding for efficient wireless unicast
US11678247B2 (en) Method and apparatus to enhance routing protocols in wireless mesh networks
US9860022B2 (en) Method, apparatus, and protocol for improving performance in a wireless network
US10880202B2 (en) Joint fountain coding and network coding for loss-tolerant information spreading
James et al. Performance analysis of fountain codes in multihop relay networks
US10623082B2 (en) Joint fountain code and network coding for multiple-source-multiple-destination wireless communication
WO2017161148A1 (fr) Procédé de réduction de l'encombrement à codage de réseau
WO2017161158A1 (fr) Procédé d'exploitation de diversité avec codage de réseau
Gómez et al. Enhanced opportunistic random linear source/network coding with cross-layer techniques over wireless mesh networks
Hansen et al. Bridging inter-flow and intra-flow network coding in wireless mesh networks: From theory to implementation
KR101109658B1 (ko) 무선 이동 멀티홉 네트워크 시스템에서의 네트워크 코딩 기법을 이용한 멀티캐스트 라우팅 방법
Pahlevani et al. Network coding for hop-by-hop communication enhancement in multi-hop networks
Levorato et al. Integrated cooperative opportunistic packet forwarding and distributed error control in MIMO ad hoc networks
Vingelmann et al. All-to-all data dissemination with network coding in dynamic MANETs
Goel et al. On the optimal ARQ distribution for low-latency communication over line-of-sight dominated multi-hop networks
Firoiu et al. CONCERTO: Experiences with a real-world MANET system based on network coding
Zhu et al. Miss and forward: Exploiting diversity with intrasession network coding
Grohmann et al. SourceShift: resilient routing in highly dynamic wireless mesh networks
Wang et al. Deriving pareto-optimal performance bounds for 1 and 2-relay wireless networks
Stann et al. RBP: Reliable broadcast propagation in wireless networks
Pahlevani et al. On the packet loss correlation in wireless mesh networks: channel models and practical schemes
James et al. Spectrally efficient packet recovery in delay constrained rateless coded multihop networks
Darehshoorzadeh et al. Opportunistic routing protocols in wireless networks: A performance comparison
Hiramuki et al. Performance comparison of ARQ schemes for network coding in ad hoc networks

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17767553

Country of ref document: EP

Kind code of ref document: A1