CN107249203B - fountain code-based Internet of vehicles remote data communication relay agent method - Google Patents

fountain code-based Internet of vehicles remote data communication relay agent method Download PDF

Info

Publication number
CN107249203B
CN107249203B CN201710364598.6A CN201710364598A CN107249203B CN 107249203 B CN107249203 B CN 107249203B CN 201710364598 A CN201710364598 A CN 201710364598A CN 107249203 B CN107249203 B CN 107249203B
Authority
CN
China
Prior art keywords
node
fountain
fountain code
vehicle
sending
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201710364598.6A
Other languages
Chinese (zh)
Other versions
CN107249203A (en
Inventor
唐余亮
曾文婷
徐伟鸿
林艺明
庄卫华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen University
Original Assignee
Xiamen University
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 Xiamen University filed Critical Xiamen University
Priority to CN201710364598.6A priority Critical patent/CN107249203B/en
Publication of CN107249203A publication Critical patent/CN107249203A/en
Application granted granted Critical
Publication of CN107249203B publication Critical patent/CN107249203B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a fountain code-based Internet of vehicles remote data communication relay agent method which comprises the steps of S1, coding data to be sent by a vehicle node at a sending end by using a fountain code, S2, forwarding a fountain code message by a relay node, decoding the fountain by using a roadside unit RSU as an agent, S3, re-coding the message after decoding is successful by the agent node, and S4, receiving end vehicle nodes receive the fountain code message and decode the fountain.

Description

fountain code-based Internet of vehicles remote data communication relay agent method
Technical Field
The invention relates to the field of wireless communication, in particular to an fountain code-based Internet of vehicles remote data communication relay agent method.
Background
In the vehicle networking, the vehicle ad-hoc networks (VANETs) are kinds of ad-hoc wireless communication networks formed by taking vehicles and roadside facilities as nodes, mainly comprise vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication, and are important components of an intelligent transportation system.
Fountain codes are coding methods for data recovery under a deleted channel, the sending mode of the fountain codes is similar to a fountain, original service data can be coded into infinite coding messages to be sent, a receiver can decode and restore the original data only by receiving enough coding messages, and the receiving method is irrelevant to specific received coding messages.
LT Codes (Luby Transform Codes) are typical fountain Codes, and although it can achieve higher decoding efficiency by using a reasonable degree distribution function, its decoding complexity increases nonlinearly.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides fountain code-based remote data relay communication proxy methods for the internet of vehicles.
In order to achieve the purpose, the invention adopts the following technical scheme:
fountain code-based Internet of vehicles remote data communication relay agent method, comprising the following steps:
s1, the vehicle node at the sending end encodes the data to be sent by fountain codes;
s2, the relay node forwards the fountain code message, and the roadside unit RSU is used as an agent to perform fountain decoding;
s3, the proxy node performs fountain coding again on the successfully decoded message;
and S4, the receiving end vehicle node receives the fountain coding message and performs fountain decoding.
, the step S1 is specifically that the sending-end vehicle node equally divides the original data to be sent into m groups, each group includes K minimum data units, and the K data in each group are subjected to Raptor fountain coding in sequence to generate fountain coding messages.
And , the fountain codes adopt Raptor codes.
, the step S2 includes the following steps:
s21, the vehicle node at the sending end carries out path planning according to a routing algorithm based on the geographic position, and the relay node forwards the fountain code packet to the vehicle at the receiving end;
s22, selecting the RSU closest to the transmitting end as the relay entry, and recording the RSU as the RSUinAnd the RSU closest to the receiving end vehicle is taken as a relay exit and is recorded as the RSUoutIn the RSU communication range, the vehicle nodes carry out V2I communication with the RSU, and the vehicle relay nodes carry out V2V communication;
s23, selecting RSUoutThe method comprises the steps that a relay agent is formed, the fountain code message is cached while the fountain code message is forwarded, when a proxy node receives a message slightly larger than K fountain codes, fountain decoding is tried, and if the relay node only comprises RSUs, the RSUs are selected as the proxy;
s24, when the agent node decodes successfully, sending a confirmation signal of successful decoding to the sending end vehicle node, indicating that the group of data has been decoded successfully, and after receiving the signal, the sending end vehicle node stops sending the group of fountain code messages and starts sending the next groups of messages;
and S25, when the proxy node still receives the coded messages of the group of data after sending the confirmation signal to the sending terminal, sending confirmation signals to the sending terminal every time redundant messages are received until the coded messages of the group of data are not received any more.
, the path planning in step S21 preferentially selects RSUs as relay nodes for forwarding, and a path includes at least RSUs.
, the step S3 is that the proxy node re-performs fountain coding according to sets of original data obtained by fountain decoding, and sends the data to the neighboring vehicle nodes according to the path planned by the routing algorithm.
, the step S4 specifically includes the following steps:
s41, the relay node continuously forwards the fountain code messages, and when the receiving end vehicle node collects a number of fountain code messages slightly larger than K, fountain decoding is carried out to recover original data;
s42, when the decoding of the receiving end node is successful, sending a confirmation signal of successful decoding to the proxy node, and the proxy node stops sending the group of fountain code messages; if not successful, continuing to receive the fountain code packet and trying to decode;
s43, if the receiving end still receives the group of coded messages after sending the confirmation signal, then confirmation signals are sent to the agent node every time redundant messages are received until the group of coded messages from the agent node is not received any more;
s44, when the receiving end vehicle node successfully decodes the m groups of fountain code messages to obtain all the original data, the vehicle self-organizing network successfully completes times of complete transmission of the long-distance data of the Internet of vehicles.
After adopting the technical scheme, compared with the background technology, the invention has the following advantages:
1. simplifying the encoding process and improving the decoding success rate. The invention applies Raptor fountain coding to the coding process of data sent by the Internet of vehicles, the coding and decoding complexity is lower than that of a transmission scheme based on LT codes, the requirement on the quantity of transmission coding messages is lower, and the decoding success rate is higher.
2. Improving the expected number of retransmissions of the data transmission. The invention overcomes the unreliable connection problem among all nodes in the Internet of vehicles by selecting the RSU as the relay agent node, reduces the expected forwarding times of the data message and saves the communication resource overhead.
3. The data transmission efficiency is improved. The relay agent can be transferred according to the real-time condition, adapts to the rapid movement of vehicle nodes and the change of network topology, meets the requirement of each node in the Internet of vehicles for long-distance and efficient reliable data transmission, and improves key performance indexes such as time delay and throughput of data transmission in the Internet of vehicles, thereby improving the data transmission efficiency.
Drawings
FIG. 1 is a flow chart of the implementation of the present invention
FIG. 2 illustrates an application scenario of data transmission in the internet of vehicles according to an embodiment
FIG. 3 is a scenario of a data routing change caused by movement of a destination node of a vehicle according to an embodiment
Detailed Description
For purposes of making the objects, aspects and advantages of the present invention more apparent, the present invention will be described in detail below with reference to the accompanying drawings and examples.
Examples
In the embodiment, fountain code Raptor q coding (latest version of Raptor coding) is adopted to transmit data in the vehicle ad hoc network, and reasonable RSU relay nodes are selected from multiple pieces of transmission to serve as proxies, so that -step data transmission efficiency is improved, and expected forwarding times of data transmission are improved.
fountain code-based Internet of vehicles remote data communication relay agent method, comprising the following steps:
s1, the vehicle node at the sending end encodes the data to be sent by fountain codes;
the method comprises the steps that a vehicle node at a sending end equally divides original data to be sent into m groups, each group comprises K minimum data units, and Raptor fountain coding is sequentially carried out on the K data of each group to generate fountain coding messages.
S2, the relay node forwards the fountain code message, and the roadside unit RSU is used as an agent to perform fountain decoding;
s21, the vehicle node at the sending end carries out path planning according to a routing algorithm based on the geographic position, and the relay node forwards the fountain code packet to the vehicle at the receiving end;
s22, selecting the RSU closest to the transmitting end as the RSU relay entrance, and recording the RSU relay entrance as the RSUinAnd the RSU closest to the receiving end vehicle is taken as the RSU relay exit and is recorded as the RSUoutWithin the communication range of the two RSUs, other relay vehicle nodes are in vehicle-to-network communication with the RSUs;
s23, selecting RSUoutThe method comprises the steps that a relay agent is formed, the fountain code message is cached while the fountain code message is forwarded, when a proxy node receives a message slightly larger than K fountain codes, fountain decoding is tried, and if the relay node only comprises RSUs, the RSUs are selected as the proxy;
s24, when the agent node decodes successfully, sending a confirmation signal of successful decoding to the sending end vehicle node, indicating that the group of data has been decoded successfully, and after receiving the signal, the sending end vehicle node stops sending the group of fountain code messages and starts sending the next groups of messages;
s25, when the proxy node still receives the encoded messages of the group of data after sending the acknowledgement signal to the sender, acknowledgement signals are sent to the sender every time redundant messages are received until the encoded messages of the group of data are no longer received.
In step S21, the path planning preferentially selects RSUs as relay nodes for forwarding, where a path includes at least RSUs.
S3, the proxy node performs fountain coding again on the successfully decoded message;
and the proxy node performs fountain coding again according to sets of original data obtained by fountain decoding and sends the data to the neighbor vehicle nodes according to the path planned by the routing algorithm.
S4, receiving the fountain coding message and performing fountain decoding by the vehicle node at the receiving end;
s41, the relay node continuously forwards the fountain code messages, and when the receiving end vehicle node collects a number of fountain code messages slightly larger than K, fountain decoding is carried out to recover original data;
s42, when the decoding of the receiving end node is successful, sending a confirmation signal of successful decoding to the proxy node, and the proxy node stops sending the group of fountain code messages; if not successful, continuing to receive the fountain code packet and trying to decode;
s43, if the receiving end still receives the group of coded messages after sending the confirmation signal, then confirmation signals are sent to the agent node every time redundant messages are received until the group of coded messages from the agent node is not received any more;
s44, when the receiving end vehicle node successfully decodes the m groups of fountain code messages to obtain all the original data, the vehicle self-organizing network successfully completes times of complete transmission of the long-distance data of the Internet of vehicles.
Fig. 1 shows a flow chart of an implementation of the present invention, which includes a specific encoding process that a data content to be transmitted is firstly divided into m Source blocks (Source blocks), different Source Block codes are independent from each other, and each Source Block is further divided into K minimum data unit symbols .
The coded symbols for transmission are obtained after all the symbols of the same Source Block are sent to a fountain code encoder, in the coded message, the header field is added with Source Block Number (SBN) to distinguish the symbols from different Source blocks, meanwhile, in order to avoid receiving the same coded symbols, different coded symbols are also distinguished by different coded message numbers (Encoding Symbol IDs).
The K original symbols are then precoded first using a RaptorQ code. Assuming a channel erasure rate of
Figure BDA0001301258160000061
The pre-coding process converts the original input symbols into K original symbols through LDPC (low density parity check) code
Figure BDA0001301258160000062
An intermediate code check unit to check
Figure BDA0001301258160000063
The middle code check unit is input to the weakened LT encoder for fountain code encoding.
After receiving the coded message, the receiving end firstly uses LT code technology to decode, recovers the middle coding check unit with fixed proportion, and then recovers all the original input symbols by using the decoding property of LDPC error correcting code. Precoding reduces the decoding complexity of RaptorQ codes to O (K), and receivingThe probability of decoding failure of the terminal after receiving K +2 coded messages is lower than 10-6。
Fig. 2 shows an application scenario of the internet of vehicles data transmission in the present embodiment. The vehicle network is composed of roadside units (RSU)1、RSU2And RSU3) Data sending end vehicle source node S, data receiving end vehicle destination node D, and 7 relay vehicle nodes (V)1，V2，...，V7) And (4) forming.
The source node S plans a path to the destination node D according to a routing protocol based on the geographical position information:
S，V1，V2，RSU1，RSU2，V6，V7，D
firstly, considering data transmission conditions of source blocks, namely, fountain coding is carried out on K original symbols required to be transmitted by an S node, and a header field of a RaptorQ coding message formed by the S node comprises the following information, namely a source node ID, a destination node ID, a source block number, a coding symbol number and a proxy node address (specifically, see the following table 1).
Table 1 header field description of RaptorQ encoded messages
Figure BDA0001301258160000064
When the RaptorQ coded message reaches a roadside unit RSU1Time, RSU1Forwards it to RSU through wired network2At this time, RSU2Becoming a proxy node. RSU2Firstly, buffers are established according to the header fields (source node ID, destination node ID, source block number, coding symbol number, proxy node address) of the message, reliable transmissions are determined by the quintuple unique 2On receiving fountainAnd after the message is coded, forwarding the message to a neighbor relay vehicle node according to a path planned by a routing protocol, and simultaneously storing the message into a corresponding cache.
denier RSU2After receiving the K +2 RaptorQ encoded message, fountain decoding is started, after decoding is successful, it sends signals to the source node S to stop sending the source block message, this time by the RSU2And newly generating a new fountain coding message for the source block, and forwarding the message to the destination node D according to the path planned by the routing algorithm, wherein the source node S starts to code and send the messages of the next source blocks.
When the D node receives K +2 RaptorQ coded messages, fountain decoding is tried, sides continue to receive fountain coded messages until decoding is successful, and the fountain coded messages are transmitted to the agent node RSU2The transmission of source blocks from node S to node D is completed, then node D begins to receive the encoded message of the next source blocks.
The route from the destination node D to the source node S may change during data transmissions due to the nodes in the Internet of vehicles usually being in constant motion2Become RSU3As shown in fig. 3. At this time, under the condition that the current source block is not decoded successfully, the proxy node address in the raptorQ coding message sent by the S node still keeps the original RSU2The address is unchanged. When the coded message is forwarded to the RSU according to the routing path3Time, RSU3Firstly, fountain coding messages are forwarded to neighbor relay nodes according to paths planned by a routing algorithm, and coding messages are copied and forwarded to a proxy node RSU designated by a header field2The reason is to ensure that agent nodes RSU can receive enough encoded messages for successful decoding, and avoid the situation that the encoded messages are dispersed on two different RSUs and can not be successfully decoded, thereby ensuring the agent success rate and the overall transmission efficiency2The source block data is transmitted to the wired transmission line after the decoding is successfulRSU3. Receiving at the source node S from the RSU3After the acknowledgement signal of successful decoding of the current source block, the address of the proxy node is replaced by the RSU3And the next source block messages are sent.
once the proxy node receives enough fountain-encoded messages and decodes them successfully, the proxy node will send a successfully decoded acknowledgement signal to node S, and let node S stop sending messages until it no longer receives messages from node S.
And when the source node or the agent node receives the decoding success confirmation signals of the m source blocks, stopping sending all messages, and finishing the long-distance data communication in the vehicle self-organizing network.
The fountain code coding mode in the implementation process is realized by RaptorQ codes, and a node Routing algorithm in the vehicle ad hoc network can use a vehicle networking Routing protocol based on geographical location information, such as Greeny Perimeter Stateless Routing (GPSR).
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (5)

1, fountain code-based Internet of vehicles remote data communication relay agent method, which is characterized in that the method comprises the following steps:
s1, the vehicle node at the sending end encodes the original data to be sent by fountain codes;
wherein, step S1 includes:
the method comprises the steps that a vehicle node at a sending end equally divides original data to be sent into m groups, each group of original data comprises K data units, fountain coding is sequentially carried out on the K data units in each group, and a fountain code message is generated;
s2, the relay node forwards the fountain code message, and the roadside unit RSU is used as an agent to perform fountain decoding;
wherein, the step S2 includes the following specific steps:
s21, the vehicle node at the sending end carries out path planning according to a routing algorithm based on the geographic position, and the relay node forwards the fountain code packet to the vehicle node at the receiving end;
s22, selecting the RSU closest to the transmitting end as the relay entry, and recording the RSU as the RSUinAnd the RSU closest to the receiving end vehicle node is taken as a relay outlet and is recorded as the RSUoutWithin the RSU communication range, the vehicle node communicates with it V2I (vehicle to infrastructure), and the vehicle relay node communicates with it V2V (vehicle to vehicle);
s23, selecting RSUoutThe method comprises the steps that a relay agent is formed, the fountain code message is cached while the fountain code message is forwarded, after a proxy node receives fountain code messages larger than K, fountain decoding is tried, and if the relay node only comprises RSUs, the RSUs are selected as the proxy;
s24, when the agent node decodes successfully, sending a confirmation signal of successful decoding to the sending end vehicle node, indicating that the original data group has been decoded successfully, and after receiving the signal, the sending end vehicle node stops sending the fountain code message of the original data group and starts sending the next groups of messages;
s25, when the proxy node still receives the fountain code message of the original data after sending the confirmation signal to the sending terminal, confirmation signals are sent to the sending terminal every time redundant fountain code messages are received until the fountain code message from the original data is not received any more;
s3, the proxy node performs fountain coding again on the successfully decoded message;
and S4, the receiving end vehicle node receives the fountain code message and performs fountain decoding.
2. The fountain code-based Internet of vehicles remote data communication relay agent method as claimed in claim 1, wherein said fountain code is Raptor code.
3. The fountain code-based Internet of vehicles remote data communication relay agent method of claim 1, wherein the step S21 is performed to prioritize RSUs as relay nodes for forwarding, and the path contains at least RSUs.
4. The fountain code-based Internet of vehicles remote data communication relay agent method of claim 1, wherein the step S3 is that the agent node re-performs fountain coding based on sets of original data obtained by fountain decoding, and sends the original data to neighboring vehicle nodes according to the route planned by the routing algorithm.
5. The fountain code-based Internet of vehicles remote data communication relay agent method of claim 1, wherein the step S4 specifically comprises the steps of:
s41, the relay node continuously forwards the fountain code messages, and when the receiving end vehicle node collects more than K fountain code messages, fountain decoding is carried out to recover the original data;
s42, when the decoding of the receiving end node is successful, sending a confirmation signal of successful decoding to the proxy node, and the proxy node stops sending the fountain code message of the original data; if not successful, continuing to receive the fountain code packet and trying to decode;
s43, if the receiving end still receives the fountain code message of the original data after sending the confirmation signal, then confirmation signals are sent to the proxy node every time redundant fountain code messages are received until the fountain code message of the original data from the proxy node is not received any more;
s44, when the receiving end vehicle node successfully decodes the fountain code message of m groups of original data to obtain all the original data, the vehicle self-organizing network successfully completes times of complete transmission of the long-distance data of the vehicle networking.
CN201710364598.6A 2017-05-22 2017-05-22 fountain code-based Internet of vehicles remote data communication relay agent method Active CN107249203B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710364598.6A CN107249203B (en) 2017-05-22 2017-05-22 fountain code-based Internet of vehicles remote data communication relay agent method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710364598.6A CN107249203B (en) 2017-05-22 2017-05-22 fountain code-based Internet of vehicles remote data communication relay agent method

Publications (2)

Publication Number Publication Date
CN107249203A CN107249203A (en) 2017-10-13
CN107249203B true CN107249203B (en) 2020-01-31

Family

ID=60017441

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710364598.6A Active CN107249203B (en) 2017-05-22 2017-05-22 fountain code-based Internet of vehicles remote data communication relay agent method

Country Status (1)

Country Link
CN (1) CN107249203B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110290558B (en) * 2019-06-24 2021-01-19 西安交通大学 Safe transmission method based on time delay in cache-assisted multi-relay transmission system
CN116097587A (en) * 2020-07-14 2023-05-09 高通股份有限公司 Internet of vehicles communication using relay-assisted network decoding
CN112887056B (en) * 2021-01-12 2021-11-23 西安电子科技大学 Fountain code transmission method based on probability feedback and stage in self-organizing network
CN113905059B (en) * 2021-06-03 2022-07-01 电子科技大学 Block storage method and model of lightweight block chain of Internet of vehicles
CN115333673A (en) * 2022-07-29 2022-11-11 南京信息工程大学 Block coding transmission method based on ILT in block chain network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101567755A (en) * 2009-05-25 2009-10-28 北京理工大学 Network coding method based on fountain codes
CN102123471A (en) * 2010-12-15 2011-07-13 北京理工大学 Stub network of Internet of things and seepage data transmission method thereof
CN103227978A (en) * 2013-04-27 2013-07-31 陈彬 Broadcasting method and broadcasting system of in-vehicle network
CN105847349A (en) * 2016-03-22 2016-08-10 中国石油大学(华东) Distributed fountain code-based Internet of Vehicles-assisted download method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9277533B2 (en) * 2012-05-17 2016-03-01 Vid Scale, Inc. Scalable video coding over simultaneous unicast/multicast LTE DL shared channel

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101567755A (en) * 2009-05-25 2009-10-28 北京理工大学 Network coding method based on fountain codes
CN102123471A (en) * 2010-12-15 2011-07-13 北京理工大学 Stub network of Internet of things and seepage data transmission method thereof
CN103227978A (en) * 2013-04-27 2013-07-31 陈彬 Broadcasting method and broadcasting system of in-vehicle network
CN105847349A (en) * 2016-03-22 2016-08-10 中国石油大学(华东) Distributed fountain code-based Internet of Vehicles-assisted download method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"喷泉码在无线中继网络中的应用";袁磊等;《信息通信技术》;20091215;61-65 *

Also Published As

Publication number Publication date
CN107249203A (en) 2017-10-13

Similar Documents

Publication Publication Date Title
CN107249203B (en) fountain code-based Internet of vehicles remote data communication relay agent method
JP4705978B2 (en) Communication relay device
US7710908B2 (en) Method and arrangement for coding and scheduling in a retransmission communication system
CN101938334B (en) Adaptive error control method combining random network coding and automatic repeat request
CN102694636B (en) Adopt sending, receiving method and the system of the HARQ technology of fountain codes
CN109714130B (en) Fountain code-based file transmission method
CN113055285B (en) Self-adaptive data transmission method based on MPTCP and network coding
Zhou et al. Fountain code based adaptive multi-hop reliable data transfer for underwater acoustic networks
JP6487562B2 (en) Method and system for on-demand file repair
WO2009127144A1 (en) Data transmission method
CN102740355A (en) Method of reducing retransmission of data frame and receiving node therefor
JP5220340B2 (en) COMMUNICATION DEVICE, COMMUNICATION SYSTEM, COMMUNICATION CONTROL METHOD, AND COMMUNICATION CONTROL PROGRAM
CN102142934A (en) Method for realizing distributed Luby transform (LT) codes on the basis of layering network topology
WO2009127141A1 (en) Data transmission method
CN109982405B (en) Opportunistic routing mode of inter-session network coding based on multiple data streams
JP2006238144A (en) Fwa device, method for transmitting information, program for fwa device, and recording medium with the program recorded thereon
Abdullah et al. Review of Rateless‐Network‐Coding‐Based Packet Protection in Wireless Sensor Networks
JP2010068191A (en) Dtn data transfer method using network coding, fixed station performing the method, and system including fixed station and mobile terminal
CN104158628B (en) Relay transfer method based on unique decodable code
Rivera et al. Performance dynamic coding RLNC LoRa on smart cities
Kumar et al. Hybrid loss recovery technique for multipath load balancing in MANETs
Langari et al. File transfer in Vehicular Delay Tolerant Networks using fountain coding
Matthew et al. The use and performance of LT codes for multicast with relaying
Wu et al. A loss-tolerant scheme for unicast routing in VANETs using network coding
JP2004248181A (en) Communication network system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant