CN107249203A - A kind of car networking remote data communication relay Proxy Method based on fountain codes - Google Patents
A kind of car networking remote data communication relay Proxy Method based on fountain codes Download PDFInfo
- Publication number
- CN107249203A CN107249203A CN201710364598.6A CN201710364598A CN107249203A CN 107249203 A CN107249203 A CN 107249203A CN 201710364598 A CN201710364598 A CN 201710364598A CN 107249203 A CN107249203 A CN 107249203A
- Authority
- CN
- China
- Prior art keywords
- fountain
- node
- message
- rsu
- fountain codes
- 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.)
- Granted
Links
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 kind of car networking remote data communication relay Proxy Method based on fountain codes, including step：S1, transmitting terminal vehicle node are encoded the data for needing to send with fountain codes；S2, via node forwarding fountain codes message, roadside unit RSU carry out fountain decoding as agency；S3, agent node will be successfully decoded after message re-start fountain coding；S4, receiving terminal vehicle node receive fountain coding message and carry out fountain decoding.Method of the present invention simplifies cataloged procedure and improves decoding success rate, while improving the expectation hop count of data transfer, improves data transmission efficiency.
Description
Technical field
The present invention relates to wireless communication field, and in particular in a kind of car networking remote data communication based on fountain codes
After Proxy Method.
Background technology
Vehicle self-organizing network (Vehicular ad-hoc networks, VANETs) is also referred to as car networking now, is one
Kind using vehicle and road side facility as node formed by self organizing radio network network, mainly include car and car (V2V) and car and
Infrastructure (V2I) communicates, and is the important component of intelligent transportation system.In car networking, the motion of vehicle causes network
Topological is unstable, and connection frequently occurs between communication node and sets up and disconnection so that the network reliability of car networking is poor.At this
In the environment of sample, the existing reliable transport protocol based on HARQ (Automatic Repeat-reQuest, ARQ)
(such as TCP) can constantly trigger re-transmission because of the frequent generation of time-out and packet loss, cause it is expected that hop count is high, produce larger
Time delay and the substantial amounts of communication resource of consumption, cause efficiency of transmission low.
Fountain codes are a kind of coding methods that data recovery is carried out under erasure channel, and the similar fountain of its sending method can
So that original service data encoding to be transmitted into infinite number of coding message, recipient need to only receive enough coding reports
Text is that decodable code restores initial data, and unrelated with specifically receiving which coding message.Only when decode complete when, just to
Transmitting terminal sends a feedback, and in the Long-range Data Transmission of car networking, its reliability and efficiency still have much room for improvement.
LT codes (Luby Transform Codes) are a kind of typical fountain codes, although it is using rational degree distribution letter
Number can reach higher decoding efficiency, but its decoding complexity is into non-linear growth.Obtain last several initial data, it is necessary to
To enter row decoding from the coding message with the high number of degrees, its encoding and decoding complexity is high, the decoding success rate under identical decoding overheads
It is relatively low.
The content of the invention
It is an object of the invention to overcome above-mentioned the deficiencies in the prior art, there is provided a kind of car networking long distance based on fountain codes
From data trunking traffic Proxy Method.
To achieve the above object, the present invention uses following technical scheme：
A kind of car networking remote data communication relay Proxy Method based on fountain codes, comprises the following steps：
S1, transmitting terminal vehicle node are encoded the data for needing to send with fountain codes；
S2, via node forwarding fountain codes message, roadside unit RSU carry out fountain decoding as agency；
S3, agent node will be successfully decoded after message re-start fountain coding；
S4, receiving terminal vehicle node receive fountain coding message and carry out fountain decoding.
Further, the step S1 is specially：The initial data for needing to send is divided into m by transmitting terminal vehicle node
Group, every group includes K minimum data unit, and the K data to every group carry out Raptor fountain codings successively, produce fountain coding
Message.
Further, the fountain codes use Raptor codes.
Further, the step S2 includes step in detail below：
S21, transmitting terminal vehicle node carry out path planning according to the routing algorithm based on geographical position, and via node is to connecing
The forwarding fountain codes packet of receiving end vehicle；
The nearest RSU of S22, selected distance transmitting terminal is designated as RSU as relay portalin, and apart from receiving terminal vehicle most
Near RSU is exported as relaying, is designated as RSUout, in RSU communication ranges, vehicle node is carried out in V2I communications, vehicle with it
After progress V2V communications between node；
S23, selection RSUoutAs relay agent, fountain codes message is cached while forwarding fountain codes message, when agency's section
Point is received after slightly larger than K fountain codes message, attempts fountain decoding, if only comprising a RSU in via node, should
RSU is just selected as agency；
S24, when agent node is successfully decoded, send successfully decoded confirmation signal to transmitting terminal vehicle node, show
This group of data of decoding success, transmitting terminal vehicle node, which is received, to be stopped sending this group of fountain codes message after the signal and starts next
The transmission of group message；If decoding is unsuccessful, coding message and trial and error decoding are continued to；
S25, the coding message for still receiving after agent node sends confirmation signal to transmitting terminal this group of data, then often receive
A confirmation signal just is retransmited to transmitting terminal to a unnecessary message, the coding message until no longer receiving this group of data.
Further, path planning prioritizing selection described in the step S21 is forwarded with RSU as via node, road
Include at least one RSU in footpath.
Further, the step S3 is specially：Agent node decodes the one group of initial data obtained according to fountain, again
Fountain coding is carried out, and the path planned according to routing algorithm is sent to neighbours' vehicle node.
Further, the step S4 specifically includes following steps：
S41, via node continue to forward fountain codes message, when receiving terminal vehicle node is collected into slightly larger than K fountain codes
After message, carry out fountain decoding to recover initial data；
S42, when receiving terminal node is successfully decoded, send successfully decoded confirmation signal, agent node to agent node
Stop sending this group of fountain codes message；Fountain codes packet and trial and error decoding are continued to if unsuccessful；
If S43, receiving terminal still receive the coding message of the group after it have sent confirmation signal, often receive one it is unnecessary
Message just retransmit a confirmation signal to agent node, until no longer receiving this group of coding message from agent node；
S44, after receiving terminal vehicle node decoding success m group fountain codes messages obtain all initial data, the vehicle
Self-organizing network just have successfully completed once the transmission of complete car networking remote data.
After adopting the above technical scheme, the present invention has the following advantages that compared with background technology：
1st, simplify cataloged procedure and improve decoding success rate.The present invention sends Raptor fountain codings applied to car networking
The cataloged procedure of data, encoding and decoding complexity is lower compared with the transmission plan based on LT codes, the quantitative requirement to transmitting coding message
Lower, decoding success rate is higher.
2nd, the expectation hop count of data transfer is improved.The present invention by way of selected RSU is as relay agent's node,
The unreliable connectivity problem between each node in car networking is overcome, the expectation hop count of data message is reduced, saves
Communication resource expense.
3rd, data transmission efficiency is improved.The relay agent of the present invention can be shifted according to real-time condition, adapt to vehicle
The quick movement of node and network topology change, meet the reliable data transmission that each node in car networking carries out high-effect long distance
Requirement, improve the Key Performance Indicator such as time delay and handling capacity of data transfer in car networking, thus improve data biography
Defeated efficiency.
Brief description of the drawings
Fig. 1 is implementation process figure of the invention
Fig. 2 is car networking data transmission applications scene in embodiment
Fig. 3 is moved for vehicle destination node in embodiment causes the scene of data route change
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
Embodiment
The present embodiment encodes (latest edition of Raptor codings) in vehicle self-organizing network using fountain codes RaptorQ
Data are transmitted, agency is used as by choosing rational RSU via nodes in a plurality of transmission, data transfer effect is further improved
Rate, and improve the expectation hop count of data transfer.
A kind of car networking remote data communication relay Proxy Method based on fountain codes, comprises the following steps：
S1, transmitting terminal vehicle node are encoded the data for needing to send with fountain codes；
The initial data for needing to send is divided into m groups by transmitting terminal vehicle node, and every group includes K minimum data unit,
The K data to every group carry out Raptor fountain codings successively, produce fountain coding message.
S2, via node forwarding fountain codes message, roadside unit RSU carry out fountain decoding as agency；
S21, transmitting terminal vehicle node carry out path planning according to the routing algorithm based on geographical position, and via node is to connecing
The forwarding fountain codes packet of receiving end vehicle；
The nearest RSU of S22, selected distance transmitting terminal is designated as RSU as RSU relay portalsin, and apart from receiving terminal car
Nearest RSU is relayed as RSU and exported, and is designated as RSUout, in the two RSU communication ranges, other relay vehicle nodes with
They enter driving and Network Communication；
S23, selection RSUoutAs relay agent, fountain codes message is cached while forwarding fountain codes message, when agency's section
Point is received after slightly larger than K fountain codes message, attempts fountain decoding, if only comprising a RSU in via node, should
RSU is just selected as agency；
S24, when agent node is successfully decoded, send successfully decoded confirmation signal to transmitting terminal vehicle node, show
This group of data of decoding success, transmitting terminal vehicle node, which is received, to be stopped sending this group of fountain codes message after the signal and starts next
The transmission of group message；If decoding is unsuccessful, coding message and trial and error decoding are continued to；
S25, the coding message for still receiving after agent node sends confirmation signal to transmitting terminal this group of data, then often receive
A confirmation signal just is retransmited to transmitting terminal to a unnecessary message, until no longer receiving the coding report from this group of data
Text.
Wherein, path planning prioritizing selection is forwarded with RSU as via node described in step S21, is included in path
There is at least one RSU.
S3, agent node will be successfully decoded after message re-start fountain coding；
Agent node decodes the one group of initial data obtained according to fountain, re-starts fountain coding, and calculate according to route
The path of method planning is sent to neighbours' vehicle node.
S4, receiving terminal vehicle node receive fountain coding message and carry out fountain decoding；
S41, via node continue to forward fountain codes message, when receiving terminal vehicle node is collected into slightly larger than K fountain codes
After message, carry out fountain decoding to recover initial data；
S42, when receiving terminal node is successfully decoded, send successfully decoded confirmation signal, agent node to agent node
Stop sending this group of fountain codes message；Fountain codes packet and trial and error decoding are continued to if unsuccessful；
If S43, receiving terminal still receive the coding message of the group after it have sent confirmation signal, often receive one it is unnecessary
Message just retransmit a confirmation signal to agent node, until no longer receiving this group of coding message from agent node；
S44, after receiving terminal vehicle node decoding success m group fountain codes messages obtain all initial data, the vehicle
Self-organizing network just have successfully completed once the transmission of complete car networking remote data.
Fig. 1 show the implementation process figure of the present invention, and its specific coding and decoding process is as follows：The data that will be sent first
Content etc. is divided into m source area block (Source Block), and different source area block codings is separate；Each source area block enters one again
Step is divided into K minimum data unit symbol.
The coded identification for transmission can be obtained after all symbols feeding fountain code coder of same source area block.Compiling
In code message, header fields addition source region block number (Source Block Number, SBN) difference is from different source area blocks
Symbol.Meanwhile, also numbered to avoid receiving between identical coded identification, different coded identifications with different coding messages
(Encoding Symbol ID) is distinguished by.
Next precoding is first carried out to K original symbol using RaptorQ codes.Assuming that the deletion rate of channel isPrelist
Code process is converted to K original symbol original input symbol by LDPC code (i.e. low density parity check code)
Individual intermediate code verification unit, then willThe LT encoders that individual intermediate code verification unit is input to reduction carry out fountain codes volume
Code.
Receiving terminal is received after coding message, is decoded first with LT code technologies, recovers the intermediate code school of fixed proportion
Verification certificate member, recycles the decoding property of LDPC error correcting codes to recover all original input symbols.Precoding allows the translating of RaptorQ codes
Code complexity is reduced to O (K), and the probability that receiving terminal decodes failure after K+2 coding message is received is less than 10-6。
Fig. 2 represents car networking data transmission applications scene in the present embodiment.Its car networking is by roadside unit (RSU1、RSU2With
RSU3), data sending terminal vehicle source node S, data receiver vehicle destination node D, and 7 relay vehicle node (V1,
V2..., V7) composition.
Source node S is planned to destination node D path according to the Routing Protocol based on geographical location information：
S, V1, V2, RSU1, RSU2, V6, V7, D
We first consider that the data of a source area block send situation, i.e. S nodes and the K original symbol sent will be needed to carry out
Fountain coding, the header fields of its RaptorQ coding message formed include following information：Source node ID, destination node ID, source
Block number, coded identification numbering, agent node address (illustrates and seen such as table 1 below).Thereafter, S nodes are relayed to its neighbour
Vehicle node sends RaptorQ coding messages, and via node receives what is planned after RaptorQ coding messages according to routing algorithm
Path is forwarded.
The header fields explanation of the RaptorQ coding messages of table 1
When RaptorQ coding messages reach roadside unit RSU1When, RSU1RSU is forwarded it to by cable network2, this
When RSU2As agent node.RSU2First according to the header fields of message (source node ID, destination node ID, source region block number,
Coded identification is numbered, agent node address) caching is set up, a transmitting is uniquely determined by the five-tuple.RSU2
Receive after fountain coding message, the path planned according to Routing Protocol forwards it to neighbours' relay vehicle node, while should
Message is preserved into corresponding caching.
Once RSU2After the RaptorQ coding messages for receiving K+2, fountain decoding is begun attempt to.After its is successfully decoded,
It sends a signal for stopping sending the source area block message to source node S.Now by RSU2Again the source area block is generated new
Fountain coding message, and according to routing algorithm plan path be forwarded to destination node D.Source node S then proceeds by next
The message coding of individual source area block and transmission.
Fountain decoding is begun attempt to after K+2 RaptorQ coding message when D nodes are received, while continuing to fountain
Coding message, until successfully decoded, to agent node RSU2Send the message for stopping sending the source area block.Now complete node S
To the transmission of a node D source area block.Then, node D starts to receive the coding message of next source area block.
Because the node in car networking is generally in constantly motion, cause the route from destination node D to source node S
It may be changed in a data transmission procedure.Assuming that because the movement or route fracture of vehicle node cause data to pass
Defeated path is changed, the via node RSU in new path2Become RSU3, as shown in Figure 3.Now, in current source region
In the case that block is completely successfully decoded, the agent node address in the RaptorQ coding messages sent by S nodes still keeps former
First RSU2Address is constant.When coding message foundation routed path is forwarded to RSU3When, RSU3Planned first according to routing algorithm
Path forwards fountain coding message to its neighbours' via node, while replicating a coding message is transmitted to what header fields were specified
Agent node RSU2.Its reason is successfully translated in order to ensure an agent node RSU can be connected to enough coding messages
Code, it is to avoid coding message is dispersed on two different RSU and can not all carry out the situation of decoding success, so as to ensure agency's
Success rate and overall efficiency of transmission.RSU2It is successfully decoded will the source area block Data Over Cable be transferred to RSU3.Received in source node S
To from RSU3The successfully decoded confirmation signal of current source area block after, be just RSU by the address substitution of agent node3, under starting
The transmission of one source area block message.
Once agent node receive enough fountain coding messages and it is successfully decoded after, acting on behalf of section will be to node S
Successfully decoded confirmation signal is sent, allows node S to stop sending message, until no longer receiving the message from node S.Together
When, agent node will regenerate new fountain coding message, the property of agent node be played by its continuation, to destination node D
Send fountain coding message.When destination node D receive enough fountain coding messages and it is successfully decoded after, it will be to agency
Node sends the successfully decoded confirmation signal of source area block, the message for allowing it to stop sending the source area block, until no longer receiving this
The message of source area block.Now complete transmission of the node S to a node D source area block.
After source node or agent node receive the successfully decoded confirmation signal of m source area block, just stop all messages
Send, now complete the vehicle self-organizing network medium and long distance data communication.
Fountain codes coded system in above-mentioned implementation process is using the realization of RaptorQ codes, vehicle self-organizing network interior joint
The cars based on geographical location information such as Greedy Perimeter Stateless Routing (GPSR) can be used in routing algorithm
Networking Routing Protocol.
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited thereto,
Any one skilled in the art the invention discloses technical scope in, the change or replacement that can be readily occurred in,
It should all be included within the scope of the present invention.Therefore, protection scope of the present invention should be with scope of the claims
It is defined.
Claims (7)
1. a kind of car networking remote data communication relay Proxy Method based on fountain codes, it is characterised in that：Including following step
Suddenly：
S1, transmitting terminal vehicle node are encoded the data for needing to send with fountain codes；
S2, via node forwarding fountain codes message, roadside unit RSU carry out fountain decoding as agency；
S3, agent node will be successfully decoded after message re-start fountain coding；
S4, receiving terminal vehicle node receive fountain coding message and carry out fountain decoding.
2. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 1, its
It is characterised by：The step S1 is specially：The initial data for needing to send is divided into m groups, every group of bag by transmitting terminal vehicle node
Containing K minimum data unit, the K data progress Raptor fountain codings to every group, produce fountain coding message successively.
3. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 1, its
It is characterised by：The fountain codes use Raptor codes.
4. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 1, its
It is characterised by：The step S2 includes step in detail below：
S21, transmitting terminal vehicle node carry out path planning according to the routing algorithm based on geographical position, and via node is to receiving terminal
Vehicle forwarding fountain codes packet；
The nearest RSU of S22, selected distance transmitting terminal is designated as RSU as relay portalin, and nearest apart from receiving terminal vehicle
RSU is exported as relaying, is designated as RSUout, in RSU communication ranges, vehicle node carries out V2I (car and infrastructure) with it and led to
V2V (car and car) is carried out between letter, vehicle repeater node to communicate；
S23, selection RSUoutAs relay agent, fountain codes message is cached while forwarding fountain codes message, when agent node connects
Receive after slightly larger than K fountain codes message, attempt fountain decoding, if only comprising a RSU in via node, the RSU is just
It is selected as agency；
S24, when agent node is successfully decoded, send successfully decoded confirmation signal to transmitting terminal vehicle node, show into
Work(decodes this group of data, and transmitting terminal vehicle node, which is received, to be stopped sending this group of fountain codes message after the signal and start next group of report
The transmission of text；If decoding is unsuccessful, coding message and trial and error decoding are continued to；
S25, the coding message for still receiving after agent node sends confirmation signal to transmitting terminal this group of data, then often receive one
Individual unnecessary message just retransmits a confirmation signal to transmitting terminal, until no longer receiving the coding message from this group of data.
5. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 3, its
It is characterised by：Path planning prioritizing selection described in the step S21 is forwarded with RSU as via node, is included in path
There is at least one RSU.
6. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 1, its
It is characterised by：The step S3 is specially：Agent node decodes the one group of initial data obtained according to fountain, re-starts fountain
Coding, and the path planned according to routing algorithm is sent to neighbours' vehicle node.
7. a kind of car networking remote data communication relay Proxy Method based on fountain codes according to claim 1, its
It is characterised by：The step S4 specifically includes following steps：
S41, via node continue to forward fountain codes message, when receiving terminal vehicle node is collected into slightly larger than K fountain codes message
Afterwards, fountain decoding is carried out to recover initial data；
S42, when receiving terminal node is successfully decoded, send successfully decoded confirmation signal to agent node, agent node stops
Send this group of fountain codes message；Fountain codes packet and trial and error decoding are continued to if unsuccessful；
If S43, receiving terminal still receive the coding message of the group after it have sent confirmation signal, a unnecessary report is often received
Text just retransmits a confirmation signal to agent node, until no longer receiving this group of coding message from agent node；
S44, after receiving terminal vehicle node decoding success m group fountain codes messages obtain all initial data, the vehicle is from group
Knitmesh network just have successfully completed once the transmission of complete car networking remote data.
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 true CN107249203A (en) | 2017-10-13 |
| CN107249203B 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) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
| CN112887056A (en) * | 2021-01-12 | 2021-06-01 | 西安电子科技大学 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
| CN113905059A (en) * | 2021-06-03 | 2022-01-07 | 电子科技大学 | Block storage method and model of lightweight block chain of Internet of vehicles |
| WO2022011549A1 (en) * | 2020-07-14 | 2022-01-20 | Qualcomm Incorporated | Vehicle-to-everything communications using network coding assisted by a relay |
| CN115333673A (en) * | 2022-07-29 | 2022-11-11 | 南京信息工程大学 | Block coding transmission method based on ILT in block chain network |
Citations (5)
| 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 |
| US20160183226A1 (en) * | 2012-05-17 | 2016-06-23 | Vid Scale, Inc. | Scalable video coding over simultaneous unicast/multicast lte dl shared channel |
| CN105847349A (en) * | 2016-03-22 | 2016-08-10 | 中国石油大学(华东) | Distributed fountain code-based Internet of Vehicles-assisted download method |
-
2017
- 2017-05-22 CN CN201710364598.6A patent/CN107249203B/en active Active
Patent Citations (5)
| 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 |
| US20160183226A1 (en) * | 2012-05-17 | 2016-06-23 | Vid Scale, Inc. | Scalable video coding over simultaneous unicast/multicast lte dl shared channel |
| 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)
| Title |
|---|
| 袁磊等: ""喷泉码在无线中继网络中的应用"", 《信息通信技术》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
| WO2022011549A1 (en) * | 2020-07-14 | 2022-01-20 | Qualcomm Incorporated | Vehicle-to-everything communications using network coding assisted by a relay |
| CN116097587A (en) * | 2020-07-14 | 2023-05-09 | 高通股份有限公司 | Internet of vehicles communication using relay-assisted network decoding |
| CN112887056A (en) * | 2021-01-12 | 2021-06-01 | 西安电子科技大学 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
| CN112887056B (en) * | 2021-01-12 | 2021-11-23 | 西安电子科技大学 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
| CN113905059A (en) * | 2021-06-03 | 2022-01-07 | 电子科技大学 | Block storage method and model of lightweight block chain of Internet of vehicles |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107249203B (en) | 2020-01-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107249203A (en) | A kind of car networking remote data communication relay Proxy Method based on fountain codes | |
| ES2402301T3 (en) | Method and arrangement for coding and planning in a transmission communication system | |
| KR101374680B1 (en) | Apparatus and method for arq feedback message generating in wireless communication system | |
| KR101446805B1 (en) | Group communication system and method in a mobile ad-hoc network | |
| US8149757B2 (en) | Bandwidth efficient HARQ scheme in relay network | |
| US7975199B2 (en) | Relay-assisted HARQ transmission system | |
| EP1729435B1 (en) | Communication relay apparatus | |
| CN101573907B (en) | Relay-assisted HARQ transmission system | |
| CN101692740B (en) | Wireless network multi-path routing network transmission method | |
| US20130114611A1 (en) | Method and Apparatus for Efficient Transmission of Information to Multiple Nodes | |
| CN109714130B (en) | Fountain code-based file transmission method | |
| CN102740355A (en) | Method of reducing retransmission of data frame and receiving node therefor | |
| CN101562507A (en) | Data transmission method | |
| CN101964703A (en) | Data retransmission method and system | |
| CN101562506B (en) | Data transmission method | |
| JP2014509488A (en) | Data transmission method, wireless communication system, target node and relay node | |
| CN102244561B (en) | Relay transmission method applied to multiple access relay network | |
| CN103391164A (en) | Message sending redundancy dynamic regulation method based on linear network coding | |
| Ar-Reyouchi et al. | NCBP: Network coding based protocol for recovering lost packets in the Internet of Things | |
| CN103580826A (en) | Method, device and system for hybrid automatic retransmission | |
| Langari et al. | File transfer in Vehicular Delay Tolerant Networks using fountain coding | |
| CN101582755A (en) | Method, device and system for feeding back response information | |
| KR100651441B1 (en) | Method for constructing bitmap and method for re-transmitting packet using the bitmap | |
| Yamamoto et al. | Distributed retransmission method using neighbor terminals for ad hoc networks | |
| CN108809523B (en) | Reliable data transmission method and system for underwater acoustic network |
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 |