CN111556222A - Fountain code-based image data variable-rate safe transmission method - Google Patents

Fountain code-based image data variable-rate safe transmission method Download PDF

Info

Publication number
CN111556222A
CN111556222A CN202010323473.0A CN202010323473A CN111556222A CN 111556222 A CN111556222 A CN 111556222A CN 202010323473 A CN202010323473 A CN 202010323473A CN 111556222 A CN111556222 A CN 111556222A
Authority
CN
China
Prior art keywords
source
packets
packet
legal
channel
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
Application number
CN202010323473.0A
Other languages
Chinese (zh)
Other versions
CN111556222B (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.)
Xian Jiaotong University
Zhejiang Lab
Original Assignee
Xian Jiaotong University
Zhejiang Lab
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 Xian Jiaotong University, Zhejiang Lab filed Critical Xian Jiaotong University
Priority to CN202010323473.0A priority Critical patent/CN111556222B/en
Publication of CN111556222A publication Critical patent/CN111556222A/en
Application granted granted Critical
Publication of CN111556222B publication Critical patent/CN111556222B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/333—Mode signalling or mode changing; Handshaking therefor
    • H04N1/33307—Mode signalling or mode changing; Handshaking therefor prior to start of transmission, input or output of the picture signal only
    • H04N1/33323—Mode signalling or mode changing; Handshaking therefor prior to start of transmission, input or output of the picture signal only transmission mode only, e.g. speed
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/333—Mode signalling or mode changing; Handshaking therefor
    • H04N1/3333—Mode signalling or mode changing; Handshaking therefor during transmission, input or output of the picture signal; within a single document or page
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/333—Mode signalling or mode changing; Handshaking therefor
    • H04N1/33361—Mode signalling or mode changing; Handshaking therefor according to characteristics or the state of the communication line
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/44—Secrecy systems

Abstract

The invention provides a fountain code-based image data variable-rate safe transmission method, which adjusts the number of code packets sent by each time slot according to the channel condition of a legal link so as to fully utilize channel resources and reduce decoding delay. And simultaneously, the channel quality advantage of a legal link is expanded, the safe transmission of information is ensured, and source data packets participating in the encoding process are selected according to the importance of the source data packets, the time delay constraint of a system and the channel quality. The method of the invention can enable a legal receiver to accumulate important data as soon as possible, simultaneously prevent an eavesdropper from intercepting the data, ensure the communication safety of the legal user and simultaneously give consideration to the requirements of the user on time delay and service quality.

Description

Fountain code-based image data variable-rate safe transmission method
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a fountain code-based image data variable-rate safe transmission method.
Background
In fountain code based transmission, a source file is divided into N equal length packets of source data. The sending end carries out bitwise XOR operation on different source data packets to construct an unlimited number of fountain packets, and then the fountain packets are transmitted to the receiving end until the receiving end successfully accumulates N mutually independent coding packets to recover the whole file. This feature of fountain codes means that legitimate users will not leak information as long as enough encoded packets are accumulated before an eavesdropper. The fountain code based anti-eavesdropping technique can significantly improve the transmission rate between legitimate transceivers compared to traditional physical layer security strategies designed primarily to maximize the privacy rate or minimize the privacy disruption probability, since the rate is limited only by shannon capacity.
Most of today's efforts to enhance transmission security by fountain coding deliver coded packets at a constant rate, i.e. the transmitter sends only one coded packet per time slot, regardless of how the fountain packet is constructed. However, due to the randomness of the wireless channel, when the channel condition is good, only one code packet is transmitted, which easily causes waste of resources. In addition, most existing fountain code based transmission schemes mainly focus on the interception probability of the system, that is, they only concern the transmission security of the bit stream. However, these methods are not applicable to image services that require adequate consideration of the mutual coupling and constraint relationship between security constraints and diversified quality of service requirements.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a fountain code-based image data variable-rate safe transmission method, which can fully consider the mutual coupling and restriction relation between security restriction and diversified service quality requirements, simultaneously considers the multidimensional requirements of reliability, safety, time delay and the like, and provides comprehensive service quality guarantee for users.
The purpose of the invention is realized by the following technical scheme:
a fountain code-based image data variable-rate safe transmission method comprises the following steps:
(1) the legitimate sender first sends the source file before the transmission takes placeDividing the data into N source data packets, each source data packet comprises K bits, and performing importance sorting on each source data packet to obtain a sorted data packet set pi ═ pi1,π2,…,πNA source packet with a smaller index sequence number is more important;
(2) in the transmission process, at the end of each time slot, the legal transmitter obtains the index of the source data packet recovered by the legal receiver through a feedback channel; then, the constructed decoded set D is updatedπAnd un-decoded set UπWherein D isπContains all source packets Bob has recovered, and UπContaining all Bob unrecovered source packets; in the updated UπIn the method, source packets are reordered according to the importance of each source packet, and the indexes of the packets start from 1, and the updated U is sentπIs marked as Uπ＝{π1,π2,…}；
(3) At the beginning of the next time slot, the legal transmitter first obtains the channel quality gamma of the legal link according to the channel feedbackABThen with an interrupt threshold gammavBy comparison, the process of the first and second steps,
when gamma isAB<γvThen, no coded packet is transmitted in the current time slot, where γvIs the transmission interruption threshold;
when gamma isAB≥γvIn time, the number of the code packets which can be correctly received by Bob at most under the current legal link channel condition is calculated
Figure BDA0002462312570000021
Then entering the next step;
(4) alice will have last since DπSource data packet pi recovered from middlerecAnd the slave UπThe selected L source packets { piind,…,πind+L-1Fountain coding is carried out to obtain L coding packets { t }1,…,tLThe construction method of the coding packet is as follows:
Figure BDA0002462312570000022
wherein ind is from UπAn index of a source packet;
(5) and (4) feeding the decoded source data packet index back to Alice by Bob, and repeating the steps (2) to (4) until the whole source file is solved by Bob or the delay requirement limit is reached.
Further, assuming that B and T are the system bandwidth and the duration of the transmission slot, i and j represent two nodes in the system, respectively, the channel coefficient of link i → j is modeled as a mean value of zero and a variance of zero
Figure BDA0002462312570000023
The circularly symmetric complex Gaussian random variable is recorded as
Figure BDA0002462312570000024
Wherein
Figure BDA0002462312570000025
α and dijRespectively representing the path loss exponent and the distance between nodes i and j, and the SNR is the average transmit power of the transmitter
Figure BDA0002462312570000026
And receiving end noise variance N0The interruption threshold γ is the value of the ratio between the number of packets to be intercepted by Eve and the number of packets to be intercepted by Eve, in the case of a condition that the probability of a packet to be intercepted by Eve must be less than ηvThe determination method of (2) is as follows:
Figure BDA0002462312570000027
wherein the content of the first and second substances,
Figure BDA0002462312570000028
and
Figure BDA0002462312570000029
representing the channel coefficient variances of links a → E and a → B, respectively.
Further, the ind is determined by the following formula:
Figure BDA00024623125700000210
wherein M represents U up to the current time slot numberπNumber of source packets, TreqAnd TcomsRespectively representing the delay limit required for transmitting a complete file and the transmission time that has been consumed up to the current time slot, both times being measured in units of the number of time slots, TexpIndicating the number of slots required on average to transfer a complete file.
The invention has the following beneficial effects:
(1) the transmission method provided by the invention can adaptively adjust the number of the coding packets transmitted each time by fully utilizing channel resources, and reduce the decoding time delay of legal users. The requirement of high-speed transmission of image service and strict time delay limitation are met.
(2) The fountain packet construction method utilized by the transmission method provided by the invention can effectively enlarge the channel advantages of the legal link, and still has certain anti-eavesdropping performance when the average channel quality of the legal link is inferior to that of the eavesdropping link.
(3) The transmission method provided by the invention can select the source data packet participating in the encoding process each time according to the importance of the source data packet, the time delay constraint of the system and the channel quality. By using the proposed fountain packet construction method, a legitimate receiver can accumulate important data as soon as possible within a limited time delay, while also preventing eavesdroppers from intercepting the important data.
Drawings
FIG. 1 is a graph of decoding delay required by a legitimate receiver Bob to recover a source file as a function of SNR;
FIG. 2 is a graph of the percentage of source packets recovered by a legitimate receiver Bob and an eavesdropper Eve as a function of a delay threshold;
fig. 3 is an image restored at Bob and Eve by three different fountain packet constructing methods, wherein fig. 3a is an image restored at Bob according to the fountain packet constructing method proposed by the present invention, fig. 3b is an image restored at Eve according to the fountain packet constructing method proposed by the present invention, fig. 3c is an image restored at Bob by randomly selecting a source packet constructing fountain packet, fig. 3d is an image restored at Eve by randomly selecting a source packet constructing fountain packet, fig. 3e is an image restored at Bob by preferentially selecting the most important packet to construct a fountain packet, and fig. 3f is an image restored at Eve by preferentially selecting the most important packet to construct a fountain packet.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and preferred embodiments, and the objects and effects of the invention will become more apparent. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Assuming that the system bandwidth is B, the system comprises three nodes Alice, Bob and Eve, which respectively represent a legal transmitter, a legal receiver and an eavesdropper. The wireless channel is assumed to be a block fading channel model, and the channel coefficient hijIs a circularly symmetric complex Gaussian random variable with a mean of zero and a variance of
Figure BDA0002462312570000031
Namely, it is
Figure BDA0002462312570000032
α and d thereinijRepresenting the path loss exponent and the distance between nodes i and j, respectively. Average transmission power of transmitter
Figure BDA0002462312570000033
The variance of the noise at the receiving end is N0Is defined as SNR of
Figure BDA0002462312570000041
The invention relates to a fountain code-based image data variable-speed safe transmission method, which comprises the following steps:
(1) before transmission occurs, legal transmitter divides source file into N source packets, each source packet contains K bits, and sends each source packetAnd (4) sorting the importance to obtain a sorted data packet set pi ═ pi1,π2,…,πN}; the source packets ordered top have higher priority, that is, the source packets with smaller index sequence number are more important to the legal receiver.
(2) In the transmission process, at the end of each time slot, the legal transmitter obtains the index of the source data packet recovered by the legal receiver through a feedback channel; then, the constructed decoded set D is updatedπAnd un-decoded set UπWherein D isπContains all source packets Bob has recovered, and UπContaining all Bob unrecovered source packets; in the updated UπIn the method, source packets are reordered according to the importance of each source packet, and the indexes of the packets start from 1, and the updated U is sentπIs marked as Uπ＝{π1,π2,…}；
(3) At the beginning of the next time slot, the legal transmitter first obtains the channel quality gamma of the legal link according to the channel feedbackABThen with an interrupt threshold gammavBy comparison, the process of the first and second steps,
when gamma isAB<γvThen, no coded packet is transmitted in the current time slot, where γvIs the transmission interruption threshold;
when gamma isAB≥γvIn time, the number of the code packets which can be correctly received by Bob at most under the current legal link channel condition is calculated
Figure BDA0002462312570000042
Under the current legal link channel condition, Bob can receive the maximum number of code packets correctly, so that the channel resources of the legal link can be fully utilized, the receiving rate of Bob is improved, and the decoding delay is reduced.
In this step, under the constraint condition that the probability that the coded packet is intercepted by Eve is less than η, the maximum number of coded packets that can be received by each time slot by a legal user is the maximum optimization target, and the interruption threshold gamma is obtainedvThe solution of (a) is as follows:
Figure BDA0002462312570000043
wherein the content of the first and second substances,
Figure BDA0002462312570000044
and
Figure BDA0002462312570000045
representing the channel coefficient variances of links a → E and a → B, respectively.
(4) Alice will have last since DπSource data packet pi recovered from middlerecAnd the slave UπSelected L source packets { πind,…,πind+L-1Fountain coding is carried out to obtain L coding packets { t }1,…,tLThe construction method of the coding packet is as follows:
Figure BDA0002462312570000051
wherein ind is from UπThe index of a source packet.
The coding structure is designed to ensure that each source packet decoded by Bob can only participate in the coding process of two fountain packets at most. This has two benefits, first, assuming Bob receives an encoded packet and decodes it to get the source packet π during time slot tjHowever, because the condition of eavesdropping the link channel in the time slot is poor, Eve cannot recover the source data packet, and then Eve cannot recover any new undecoded source data packet in all subsequent transmissions, so that the channel advantage of a legal link is expanded; second, as long as Alice delivers a coded packet, Bob can be provided with a new undecoded source packet, so that each transmission slot is not wasted, which further reduces decoding delay.
In the above construction process of the encoded packet, ind may be determined by the following formula:
Figure BDA0002462312570000052
wherein M represents U up to the current time slot numberπNumber of source packets, TreqAnd TcomsRespectively representing the delay limit required for transmitting a complete file and the transmission time that has been consumed up to the current time slot, both times being measured in units of the number of time slots, TexpIndicating the number of slots required on average to transfer a complete file.
Suppose that the probability that n coded packets can be transmitted per slot is PnCan deduce
Figure BDA0002462312570000053
Wherein the content of the first and second substances,
Figure BDA0002462312570000054
and
Figure BDA0002462312570000055
thus, the average number of code packets that can be transmitted per slot is represented as follows:
Figure BDA0002462312570000056
as can be seen from the coding scheme design of the present invention, Alice can provide Bob with a new undecoded source packet every time Alice transmits one coded packet, so Bob can decode the source packet in the average number of coded packets per time slot equal to the number of coded packets per time slot transmitted by Alice
Figure BDA0002462312570000057
So TexpCan be prepared from
Figure BDA0002462312570000058
And (4) approximately determining.
In determining the function of the ind,
Figure BDA0002462312570000061
indicating a lawMapping of the difference between the instantaneous channel quality of the link and the average channel quality of the eavesdropped link to the source packet index number, γABCompared with the average channel quality of the eavesdropping link, the higher the average channel quality of the eavesdropping link is, the smaller the value is, the smaller the source data packet index sequence number should be selected, which indicates that the source data packet with a higher contribution degree to the image quality tends to be sent when the channel quality of the Alice-Bob link is better than the average channel quality of the eavesdropping link, which is more beneficial for a legal receiving end to obtain important data as soon as possible, and therefore, the function of the channel quality and the image content on the fountain code structure is embodied.
Figure BDA0002462312570000062
And min (1, T)req/Texp) Are two important adjustment factors, which represent the role of delay constraints in the construction of fountain codes. In particular, TcomsThe larger the size, the more limited the transmission time remaining available until the current time, and thus important data packets should be transmitted preferentially, so that the time is the longer the transmission time is
Figure BDA0002462312570000063
The value of (2) is small, and the index sequence number of the selected source data packet needs to be in
Figure BDA0002462312570000064
On the basis of the adjustment value, multiplying the adjustment value by the adjustment value; due to TexpIndicating the number of slots required to transfer the entire file on average, so Treq/TexpThe smaller the data packet size is, the smaller the probability of transmitting a complete file within the limited time delay constraint is, the more important source data packets should be transmitted preferentially at the moment, so that a legal user can obtain enough important information under the limited time delay condition, and the experience quality of the legal user is improved. Thus taking Treq/TexpThe minimum value of and 1 is used as the adjustment factor and
Figure BDA0002462312570000065
the multiplication is to further reduce the value of ind to choose more important one in case of tighter delay constraints (full file transmission cannot be completed under limited delay constraints)The source packets participate in the encoding. In conclusion, the fountain code construction method jointly considers multiple factors such as the priority of the source data packet, the channel quality, the time delay constraint and the like, can ensure that a legal receiver accumulates more important information as soon as possible, and simultaneously prevents an eavesdropper from intercepting the data.
After the coding is finished, let pirecIs equal to piind+L-1For the next encoding.
(5) And (4) feeding back the decoded source data packet index to Alice by Bob, and repeating the steps (2) to (4) until the whole source file is solved by Bob or the delay requirement limit is reached.
The simulation effect of the present invention will be briefly described below.
The invention adjusts the number of the coding packets transmitted each time through the channel quality of the legal link, thereby fully utilizing the channel resources and greatly reducing the decoding time delay of Bob. Meanwhile, through the structural design of the fountain packets, each coding packet is independent, and Alice can provide a new undecoded source data packet for Bob every time Alice sends one coding packet, so that the decoding delay is further reduced. The present invention has great advantages in decoding delay, as shown in fig. 1, where T isreq＝N×(1+Δ)。
The invention can provide better guarantee for information safety while reducing decoding time delay. As can be seen from fig. 2, under a tighter delay constraint, Bob can still recover more information, while the source packet percentage recovered by Eve is kept at a lower level.
Fig. 3 illustrates the present invention applied to a specific image transmission service, comparing images restored by Bob and Eve under a source packet method using three different options to participate in the encoding process. For the sake of comparison, the delay constraint is given more tightly. It can be seen that the construction method provided by the invention not only can enable a legal receiver to accumulate more important data (face area) as soon as possible within limited time delay constraint, but also can prevent an eavesdropper from intercepting the data.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and although the invention has been described in detail with reference to the foregoing examples, it will be apparent to those skilled in the art that various changes in the form and details of the embodiments may be made and equivalents may be substituted for elements thereof. All modifications, equivalents and the like which come within the spirit and principle of the invention are intended to be included within the scope of the invention.

Claims (3)

1. A fountain code-based image data variable-rate secure transmission method is characterized by comprising the following steps:
(1) before transmission occurs, a legal transmitter firstly divides a source file into N source data packets, each source data packet comprises K bits, and carries out importance ordering on each source data packet to obtain an ordered data packet set pi ═ pi1,π2,…,πNA source packet with a smaller index sequence number is more important;
(2) in the transmission process, at the end of each time slot, the legal transmitter obtains the index of the source data packet recovered by the legal receiver through a feedback channel; then, the constructed decoded set D is updatedπAnd un-decoded set UπWherein D isπContains all source packets Bob has recovered, and UπContaining all Bob unrecovered source packets; in the updated UπIn the method, source packets are reordered according to the importance of each source packet, and the indexes of the packets start from 1, and the updated U is sentπIs marked as Uπ＝{π1,π2,…}；
(3) At the beginning of the next time slot, the legal transmitter first obtains the channel quality gamma of the legal link according to the channel feedbackABThen with an interrupt threshold gammavBy comparison, the process of the first and second steps,
when gamma isAB<γvThen, no coded packet is transmitted in the current time slot, where γvIs the transmission interruption threshold;
when gamma isAB≥γvThen, it is calculated that Bob can maximally under the current legal link channel conditionsNumber of correctly received code packets
Figure FDA0002462312560000011
Then entering the next step;
(4) alice will have last since DπSource data packet pi recovered from middlerecAnd the slave UπSelected L source packets { πind,…,πind+L-1Fountain coding is carried out to obtain L coding packets { t }1,…,tLThe construction method of the coding packet is as follows:
Figure FDA0002462312560000012
wherein ind is from UπAn index of a source packet;
(5) and (4) feeding the decoded source data packet index back to Alice by Bob, and repeating the steps (2) to (4) until the whole source file is solved by Bob or the delay requirement limit is reached.
2. The fountain code-based method for variable-rate secure transmission of image data as defined in claim 1, wherein assuming B and T as the system bandwidth and the duration of the transmission time slot, i and j respectively representing two nodes in the system, the channel coefficients of link i → j are modeled as a mean of zero and a variance of zero
Figure FDA0002462312560000013
The circularly symmetric complex Gaussian random variable is recorded as
Figure FDA0002462312560000021
Wherein
Figure FDA0002462312560000022
α and dijRespectively representing the path loss exponent and the distance between nodes i and j, and the SNR is the average transmit power of the transmitter
Figure FDA0002462312560000023
And receiving end noise variance N0The interruption threshold γ is the value of the ratio between the number of packets to be intercepted by Eve and the number of packets to be intercepted by Eve, in the case of a condition that the probability of a packet to be intercepted by Eve must be less than ηvThe determination method of (2) is as follows:
Figure FDA0002462312560000024
wherein the content of the first and second substances,
Figure FDA0002462312560000025
and
Figure FDA0002462312560000026
representing the channel coefficient variances of links a → E and a → B, respectively.
3. The fountain code based image data variable rate secure transmission method according to claim 1 or 2, wherein the ind is determined by the following formula:
Figure FDA0002462312560000027
wherein M represents U up to the current time slot numberπNumber of source packets, TreqAnd TcomsRespectively representing the delay limit required for transmitting a complete file and the transmission time that has been consumed up to the current time slot, both times being measured in units of the number of time slots, TexpIndicating the number of slots required on average to transfer a complete file.
CN202010323473.0A 2020-04-22 2020-04-22 Fountain code-based image data variable-rate safe transmission method Active CN111556222B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010323473.0A CN111556222B (en) 2020-04-22 2020-04-22 Fountain code-based image data variable-rate safe transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010323473.0A CN111556222B (en) 2020-04-22 2020-04-22 Fountain code-based image data variable-rate safe transmission method

Publications (2)

Publication Number Publication Date
CN111556222A true CN111556222A (en) 2020-08-18
CN111556222B CN111556222B (en) 2022-01-14

Family

ID=72007636

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010323473.0A Active CN111556222B (en) 2020-04-22 2020-04-22 Fountain code-based image data variable-rate safe transmission method

Country Status (1)

Country Link
CN (1) CN111556222B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230055353A1 (en) * 2022-04-26 2023-02-23 Qinghai Normal University Data encoding and decoding method for underwater acoustic networks (uans) based on improved online fountain code

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0581101A1 (en) * 1992-07-29 1994-02-02 International Business Machines Corporation Audio/video communications processor
US20110299450A1 (en) * 2007-01-08 2011-12-08 Interdigital Technology Corporation Method and apparatus for multicasting with feedback information
CN105306168A (en) * 2015-09-18 2016-02-03 西安交通大学 Method for guaranteeing secure transmission of wireless data based on fountain codes
CN108809515A (en) * 2018-04-26 2018-11-13 西安交通大学 Multicast security transmission method based on fountain codes under a kind of wireless buffer network
CN109412750A (en) * 2018-09-19 2019-03-01 西安交通大学 Anti- eavesdropping transmission method based on fountain codes in a kind of multimedia communication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0581101A1 (en) * 1992-07-29 1994-02-02 International Business Machines Corporation Audio/video communications processor
US20110299450A1 (en) * 2007-01-08 2011-12-08 Interdigital Technology Corporation Method and apparatus for multicasting with feedback information
CN105306168A (en) * 2015-09-18 2016-02-03 西安交通大学 Method for guaranteeing secure transmission of wireless data based on fountain codes
CN108809515A (en) * 2018-04-26 2018-11-13 西安交通大学 Multicast security transmission method based on fountain codes under a kind of wireless buffer network
CN109412750A (en) * 2018-09-19 2019-03-01 西安交通大学 Anti- eavesdropping transmission method based on fountain codes in a kind of multimedia communication

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20230055353A1 (en) * 2022-04-26 2023-02-23 Qinghai Normal University Data encoding and decoding method for underwater acoustic networks (uans) based on improved online fountain code
US11722245B2 (en) * 2022-04-26 2023-08-08 Qinghai Normal University Data encoding and decoding method for underwater acoustic networks (UANs) based on improved online fountain code

Also Published As

Publication number Publication date
CN111556222B (en) 2022-01-14

Similar Documents

Publication Publication Date Title
Wu et al. Cross-layer optimization for video summary transmission over wireless networks
Iannucci et al. No symbol left behind: A link-layer protocol for rateless codes
JP5097214B2 (en) Method and apparatus for ad hoc multicasting using coding scheduling in wireless networks
Park et al. Optimal DASH-multicasting over LTE
CN113055285B (en) Self-adaptive data transmission method based on MPTCP and network coding
CN105306168A (en) Method for guaranteeing secure transmission of wireless data based on fountain codes
Choi et al. On the energy efficiency of AMC and HARQ-IR with QoS constraints
CN104219528B (en) A kind of video transmission method for the mimo system for supporting gradable video encoding
CN102208962B (en) Wireless data transmission method
CN106464443A (en) System and method for faster than nyquist transmission
Lu et al. QoE-driven multi-user video transmission over SM-NOMA integrated systems
KR20090061561A (en) Method and apparatus of communication using random linear coding
CN109462456B (en) Streaming media safe transmission method based on error code diffusion and noise aggregation
CN113746766B (en) Channel self-adaptive noise aggregation wireless secure transmission method
CN111556222B (en) Fountain code-based image data variable-rate safe transmission method
Nguyen et al. Hybrid ARQ-random network coding for wireless media streaming
CN108768443B (en) Spectrum spreading parameter agility method based on random signal
Bajic Efficient cross-layer error control for wireless video multicast
CN107222284B (en) The anti-eavesdropping transmission method of fountain coding based on channel feedback in a kind of Internet of Things
Karim et al. Rate-aware network codes for video distortion reduction in point-to-multipoint networks
CN105141412A (en) Fountain-coding-based method for ensuring multicast security transmission of multimedia
Liu et al. Distributed markov decision process in cooperative peer-to-peer repair for WWAN video broadcast
CN109412750B (en) Anti-eavesdrop transmission method based on fountain codes in multimedia communication
CN109005011B (en) Data transmission method and system for underwater acoustic network and readable storage medium
Han et al. Securing image transmissions via fountain coding and adaptive resource allocation

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