CN110086573B - Data transmission method based on network coding and user pairing - Google Patents
Data transmission method based on network coding and user pairing Download PDFInfo
- Publication number
- CN110086573B CN110086573B CN201910309211.6A CN201910309211A CN110086573B CN 110086573 B CN110086573 B CN 110086573B CN 201910309211 A CN201910309211 A CN 201910309211A CN 110086573 B CN110086573 B CN 110086573B
- Authority
- CN
- China
- Prior art keywords
- user
- users
- pairing
- base station
- entering
- 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
Links
Images
Classifications
-
- 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/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
-
- 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/0076—Distributed coding, e.g. network coding, involving channel coding
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a data packet transmission method based on network coding and user pairing, which comprises the following steps: n users are provided, N users are prepared to receive a common file from a base station, the file comprises K data packets, A ═ 1.. multidata, N is used for representing the set of all users, and the packet loss rate of a wireless channel between the ith user and the base station is recorded as pi,
Let the packet loss rate of the channel between user i and user j be pij,
It is assumed that the inter-user channel has symmetry, i.e. pij＝pji,
For any i, j epsilon A, defining the pairing condition of the user i and the user j as follows: p is a radical ofij<piAnd pij<pjUser i and user j can pair; and carrying out pairing on the user, and carrying out data transmission on the user after pairing. The invention carries out the pairing of the users meeting the pairing condition and regards the users as a group, and after one user finishes receiving number in the group, the users finishing data receiving can utilize the channel advantage among the group members to replace the base station to transmit the data packet to the users not finishing data receiving, thereby finally achieving the purpose of improving the transmission efficiency of the whole network.
Description
Technical Field
The invention belongs to the technical field of wireless network communication, and particularly relates to a data transmission method based on network coding and user pairing.
Background
Network coding is one of the key technologies in wireless communication. By using network coding, nodes in the network can effectively code the data packet, and then the coded data packet is transferred and transmitted. For the receiver, all the original data can be decoded as long as a sufficient number of encoded packets are received. The network coding has the advantages that: the upper limit of the capacity of the minimum cut maximum flow (min-cut max-flow) in the network can be reached theoretically; the broadband resource consumption of the network is saved; improve the robustness of the network, etc.
In a real single-hop wireless broadcast network, the geographical location of the base station is usually fixed, and the users are often randomly distributed within the transmission range of the base station. Some users have better channel conditions among the users and low packet loss rate because the geographic positions are closer. Based on this feature, we can combine these users in a paired way to form a group. Within each packet, users can transmit "mutual assistance": for example, the user who completes data reception can utilize the channel advantage among the members in the group to replace the base station to transmit the data packet to the user who does not complete data reception, and finally the transmission efficiency of the whole network is improved.
The invention provides a high-efficiency data transmission method based on network coding and user pairing, aiming at the problem of multi-user data transmission in a single-hop wireless network, which comprises the following steps: first, based on the channel parameters in the network, the users meeting the conditions are paired, and finally a plurality of groups are formed. After grouping is completed, the base station firstly carries out random linear network coding on an original data packet and broadcasts the coded data packet to users. The base station stops broadcasting when at least one user in each packet receives a sufficient number of encoded data packets to successfully decode. And finally, grouping the users who finish data reception, carrying out random linear network coding on the decoded original data packet, and then sending the coded data packet to the users who do not finish the reception in a unicast mode. When all users finish decoding, the whole transmission process is finished.
Disclosure of Invention
The invention provides a data packet transmission method based on network coding and user pairing, aiming at the problem of multi-user file transmission in a wireless network.
The purpose of the invention is realized by the following technical scheme.
A data packet transmission method based on network coding and user pairing comprises the following steps:
n users are provided, N users are prepared to receive a common file from a base station, the file comprises K data packets, A is {1, K, N } represents the set of all users, and the packet loss rate of a wireless channel between the ith user and the base station is recorded as pi,
Let the packet loss rate of the channel between user i and user j be pij,
It is assumed that the inter-user channel has symmetry, i.e. pij＝pji,
For any i, j epsilon A, defining the pairing condition of the user i and the user j as follows:
pij＜piand pij＜pj，
When the channel packet loss rate from the user i to the base station and the channel packet loss rate from the user j to the base station are both greater than the channel packet loss rate between the user i and the user j, the user i and the user j can be paired; and carrying out pairing on the user, and carrying out data transmission on the user after pairing.
Further, the user pairing comprises the following steps:
the user pairs, the user set which completes the pair is represented by J,
(1.1) setting
i is 1, i is the ith user;
(1.2) setting j ═ i +1 for the user;
(1.3) judging whether J belongs to J, wherein J represents a user set which is finished with pairing, and if so, entering the step (1.4); otherwise, entering the step (1.6);
(1.4) j ← j +1, i.e. assigning j +1 to j;
(1.5) judging whether j is larger than N, wherein N represents N users, and if yes, entering the step (1.9); otherwise, returning to the step (1.3);
(1.6) judgment of pijWhether or not less than piAnd pjIf yes, entering the step (1.7); otherwise, returning to the step (1.4);
(1.7) carrying out pair pairing on the user i and the user j;
(1.8) putting i and J into a set J, namely J ← JU { i, J };
(1.9) i ← i +1, i.e. assigning i +1 to i;
(1.10) judging whether i belongs to J, if so, returning to the step (1.9); otherwise, entering the step (1.11);
(1.11) judging whether i is smaller than N, if so, returning to the step (1.2); otherwise, entering the step (1.12);
and (1.12) ending the user pairing.
Further, the data transmission comprises the following steps:
in each time slot, the base station and each user transmit and receive data packets according to the following steps:
(2.1) the base station encodes the original data packet by using random linear network coding to generate a coded data packet and broadcasts the coded data packet to all users;
(2.2) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.3); otherwise, returning to the step (2.1);
(2.3) the base station judges whether at least one user in each user group is successfully decoded, if so, the step (2.4) is carried out; otherwise, returning to the step (2.1);
(2.4) the base station stops broadcasting;
(2.5) in each group, the successfully decoded users use random linear network coding to code the original data packet, a packet of the coded data packet is generated, and unicast is carried out to the un-decoded users in the group;
(2.6) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.7); otherwise, returning to the step (2.5);
(2.7) the base station judges whether all users have successfully decoded, if so, the step (2.8) is carried out; otherwise, returning to the step (2.5);
and (2.8) ending data transmission.
Due to the adoption of the technical scheme, the method has the following advantages that 1, the situation that the geographic positions of a plurality of users are close and the channel is good is often considered in a real scene. Therefore, the invention utilizes the characteristic that the users meeting the pairing conditions are paired and treated as a group. After one user in the group finishes receiving the data, the user finishing data receiving can utilize the channel advantages among the members in the group to replace the base station to transmit the data packet to the user not finishing data receiving, and finally the transmission efficiency of the whole network is improved. 2. Because the traditional transmission method without using network coding has the defect that one data packet needs to be repeatedly transmitted for many times, the invention utilizes the advantages of the network coding and improves the efficiency of data transmission.
Drawings
Fig. 1 is a network schematic diagram of a data transmission method based on network coding and user pairing according to the present invention.
Fig. 2 is a flow chart of user pairing in a data transmission method based on network coding and user pairing according to the present invention;
fig. 3 is a flowchart of data transmission of a data transmission method based on network coding and user pairing according to the present invention.
Detailed Description
To further illustrate the method of practicing the present invention, an exemplary embodiment is given below. This preferred embodiment is merely illustrative of the principles of the present invention and does not represent any limitation of the present invention.
As shown in the figure, a data packet transmission method based on network coding and user pairing includes:
n users are provided, N users are prepared to receive a common file from a base station, the file contains K data packets, and A ═ 1, K, N represents all the data packetsThe packet loss rate of a wireless channel between the ith user and the base station is recorded as pi,
Let the packet loss rate of the channel between user i and user j be pij,
It is assumed that the inter-user channel has symmetry, i.e. pij＝pji,
For any i, j epsilon A, defining the pairing condition of the user i and the user j as follows:
pij＜piand pij＜pj，
When the channel packet loss rate from the user i to the base station and the channel packet loss rate from the user j to the base station are both greater than the channel packet loss rate between the user i and the user j, the user i and the user j can be paired; and carrying out pairing on the user, and carrying out data transmission on the user after pairing.
The user pairing comprises the following steps:
the user pairs, the user set which completes the pair is represented by J,
(1.1) setting
i is 1, i is the ith user;
(1.2) setting j ═ i +1 for the user;
(1.3) judging whether J belongs to J, wherein J represents a user set which is finished with pairing, and if so, entering the step (1.4); otherwise, entering the step (1.6);
(1.4) j ← j +1, i.e. assigning j +1 to j
(1.5) judging whether j is larger than N, wherein N represents N users, and if yes, entering the step (1.9); otherwise, returning to the step (1.3);
(1.6) judgment of pijWhether or not less than piAnd pjIf yes, entering the step (1.7); otherwise, returning to the step (1.4);
(1.7) carrying out pair pairing on the user i and the user j;
(1.8) putting i and J into a set J, namely J ← JU { i, J };
(1.9) i ← i +1, i.e. assigning i +1 to i;
(1.10) judging whether i belongs to J, if so, returning to the step (1.9); otherwise, entering the step (1.11);
(1.11) judging whether i is smaller than N, if so, returning to the step (1.2); otherwise, entering the step (1.12);
and (1.12) ending the user pairing.
The data transmission comprises the following steps:
in each time slot, the base station and each user transmit and receive data packets according to the following steps:
(2.1) the base station encodes the original data packet by using random linear network coding to generate a coded data packet and broadcasts the coded data packet to all users;
(2.2) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.3); otherwise, returning to the step (2.1);
(2.3) the base station judges whether at least one user in each user group is successfully decoded, if so, the step (2.4) is carried out; otherwise, returning to the step (2.1);
(2.4) the base station stops broadcasting;
(2.5) within each subgroup, successfully decoded users encode the original packets using random linear network coding
A code for generating a packet of encoded data packets and unicasting the packet to an undecoded user in the group;
(2.6) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.7); otherwise, returning to the step (2.5);
(2.7) the base station judges whether all users have successfully decoded, if so, the step (2.8) is carried out; otherwise, return to step
Step (2.5);
and (2.8) ending data transmission.
The embodiment assumes that three users, N3 and a 1,2,3, are ready to download one identical file from the base station. This file consists of 100 packets, i.e., K100. Suppose that the packet loss rates of the channels between the users and the base stations are p respectively1＝0.4,p2＝0.6,p3The channel packet loss rate between 3 users is p, 0.512＝0.8,p23＝0.3,p13＝0.9。
And (3) the user makes a pair:
at the beginning, there are
User i-1 and user j-i + 1-2 are selected. Judging whether the user 2 belongs to the set J: due to the fact that
So user 2 does not belong to J. Next, p is judged12Whether or not less than p1And p2. Due to p120.8 is greater than p2＝0.6,p1When the user pairing condition is 0.4, the user 1 and the user 2 are not paired.
Update j ← j +1 ═ 3. Since j is not larger than N, continuing to judge p13Whether or not less than p1And p3. Due to p130.9 > p3＝0.5,p1When the user pairing condition is 0.4, the user 1 and the user 3 do not pair with each other.
Update j ← j +1 ═ 4. Since j is greater than N, i ← i +1 ═ 2 is updated, i.e., user 2 serves as the candidate user. Since i-2 does not belong to J and is smaller than N, the user J-i + 1-3 is selected to be paired. Since the j is less than N, continuing to judge p23Whether or not less than p2And p3. Due to p230.3 < p2＝0.6,p3And (5) meeting the user pairing condition, pairing the user 2 and the user 3, and updating the set J to be {2,3 }.
At this point, the pairing phase ends. The 3 users are divided into two groups, user 1 is a single group, and user 2 is paired with user 3 to form a group.
Data transmission:
in the first time slot, the base station performs random linear network coding on 100 data packets to generate a coded data packet, and broadcasts the coded data packet to three users. Since the user needs to receive 100 linearly independent encoded data packets for decoding, no user can complete decoding in the first slot.
The latter time slot and the first time slot are the same.
Suppose that user 1 received exactly 100 encoded packets in the 167 th slot, and therefore decoded all the original packets; while users 2 and 3 have not received 100 encoded packets at this time. The user 1 sends feedback information to the base station to inform that the user has successfully decoded. Since no user in the group of users 2 and 3 successfully decodes, the base station continues to broadcast in the next time slot.
Suppose that user 3 received exactly 100 encoded packets in the 200 th slot, and therefore decoded all the original packets. The user 3 sends feedback information to the base station to inform that the decoding is successful. Since the base station receives feedback information from both subgroups, the base station will stop broadcasting from the next time slot.
Starting from the 201 th time slot, the user 3 carries out random linear network coding on the decoded original data packet to generate a coded data packet, and unicasts the coded data packet to the paired users 2 in the group.
Suppose that at the 250 th time slot, user 2 also successfully decodes all the original data packets and sends feedback information to the base station. At this time, the base station receives the feedback information of all three users, and the transmission process is finished.
The invention discloses a data transmission method based on network coding and user pairing, and belongs to the field of wireless network communication. The transmission efficiency of the whole network is improved by carrying out pairing on the users meeting the pairing conditions and combining the network coding technology.
While the preferred embodiments and principles of this invention have been described in detail, it will be apparent to those skilled in the art that variations may be made in the embodiments based on the teachings of the invention and such variations are considered to be within the scope of the invention.
Claims (1)
1. A data packet transmission method based on network coding and user pairing is characterized by comprising the following steps:
n users are provided, N users are prepared to receive a common file from a base station, the file comprises K data packets, A is {1, K, N } represents the set of all users, and the packet loss rate of a wireless channel between the ith user and the base station is recorded as
Let the packet loss rate of the channel between user i and user j be
It is assumed that the channels between users have symmetry, i.e.
For any i, j epsilon A, defining the pairing condition of the user i and the user j as follows:
pij＜piand pij＜pj，
When the channel packet loss rate from the user i to the base station and the channel packet loss rate from the user j to the base station are both greater than the channel packet loss rate between the user i and the user j, the user i and the user j can be paired; carrying out pairing on the user, and carrying out data transmission on the user after pairing is finished;
the user pairing comprises the following steps:
the user pairs, the user set which completes the pair is represented by J,
(1.1) setting
i is 1, i is the ith user;
(1.2) setting j ═ i +1 for the user;
(1.3) judging whether J belongs to J, wherein J represents a user set which is finished with pairing, and if so, entering the step (1.4); otherwise, entering the step (1.6);
(1.4) j ← j +1, i.e. assigning j +1 to j;
(1.5) judging whether j is larger than N, wherein N represents N users, and if yes, entering the step (1.9); otherwise, returning to the step (1.3);
(1.6) judgment of pijWhether or not less than piAnd pjIf yes, entering the step (1.7); otherwise, returning to the step (1.4);
(1.7) carrying out pair pairing on the user i and the user j;
(1.8) putting i and J into a set J, namely J ← JU { i, J };
(1.9) i ← i +1, i.e. assigning i +1 to i;
(1.10) judging whether i belongs to J, if so, returning to the step (1.9); otherwise, entering the step (1.11);
(1.11) judging whether i is smaller than N, if so, returning to the step (1.2); otherwise, entering the step (1.12);
(1.12) ending the user pairing;
the data transmission comprises the following steps:
in each time slot, the base station and each user transmit and receive data packets according to the following steps:
(2.1) the base station encodes the original data packet by using random linear network coding to generate a coded data packet and broadcasts the coded data packet to all users;
(2.2) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.3); otherwise, returning to the step (2.1);
(2.3) the base station judges whether at least one user in each user group is successfully decoded, if so, the step (2.4) is carried out; otherwise, returning to the step (2.1);
(2.4) the base station stops broadcasting;
(2.5) in each group, the successfully decoded users use random linear network coding to code the original data packet, a packet of the coded data packet is generated, and unicast is carried out to the un-decoded users in the group;
(2.6) whether one or more users successfully decode in the current time slot and send feedback information, if so, entering the step (2.7); otherwise, returning to the step (2.5);
(2.7) the base station judges whether all users have successfully decoded, if so, the step (2.8) is carried out; otherwise, returning to the step (2.5);
and (2.8) ending data transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910309211.6A CN110086573B (en) | 2019-04-17 | 2019-04-17 | Data transmission method based on network coding and user pairing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910309211.6A CN110086573B (en) | 2019-04-17 | 2019-04-17 | Data transmission method based on network coding and user pairing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110086573A CN110086573A (en) | 2019-08-02 |
| CN110086573B true CN110086573B (en) | 2021-09-21 |
Family
ID=67415316
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910309211.6A Active CN110086573B (en) | 2019-04-17 | 2019-04-17 | Data transmission method based on network coding and user pairing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110086573B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111585696B (en) * | 2020-04-02 | 2022-07-12 | 浙江工商大学 | Method and system for enhancing downlink throughput of bidirectional transmission network based on XOR operation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104852788A (en) * | 2015-05-20 | 2015-08-19 | 中国人民解放军理工大学 | Data broadcast ARQ method based on maximum-minimum network encoding |
| EP3072350A1 (en) * | 2013-11-19 | 2016-09-28 | Telefonaktiebolaget LM Ericsson (publ) | Method and base station for supporting d2d communication |
| CN108495320A (en) * | 2018-04-04 | 2018-09-04 | 刘福珍 | A kind of communication base station based on random linear network encoding |
| CN109257145A (en) * | 2018-10-17 | 2019-01-22 | 南通大学 | D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102202413B (en) * | 2011-06-13 | 2013-06-19 | 北京邮电大学 | Method for dispatching resources by combining network coding and user pairing |
-
2019
- 2019-04-17 CN CN201910309211.6A patent/CN110086573B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3072350A1 (en) * | 2013-11-19 | 2016-09-28 | Telefonaktiebolaget LM Ericsson (publ) | Method and base station for supporting d2d communication |
| CN104852788A (en) * | 2015-05-20 | 2015-08-19 | 中国人民解放军理工大学 | Data broadcast ARQ method based on maximum-minimum network encoding |
| CN108495320A (en) * | 2018-04-04 | 2018-09-04 | 刘福珍 | A kind of communication base station based on random linear network encoding |
| CN109257145A (en) * | 2018-10-17 | 2019-01-22 | 南通大学 | D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary |
Non-Patent Citations (1)
| Title |
|---|
| 联合蜂窝与D2D链路的网络编码广播重传方案;王鹏飞 等;《信号处理》;20180625;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086573A (en) | 2019-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sprintson et al. | A randomized algorithm and performance bounds for coded cooperative data exchange | |
| CN101895376B (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| CN101394255B (en) | Two-user collaboration communication method in multi-user wireless network | |
| CN105636216B (en) | Based on throughput-maximized robust power distribution method | |
| Bidokhti et al. | Erasure broadcast networks with receiver caching | |
| CN103095423A (en) | Multi-user cooperative transmission method based on dimension to dimension (D2D) inter-group communication | |
| CN101448337A (en) | User collaboration method with joint network coding and channel coding | |
| CN102545992A (en) | Optimal relay selection and power distribution method of DF (decode-forward) relay system | |
| Pan et al. | Practical NOMA-based coordinated direct and relay transmission | |
| CN101394327B (en) | Method for applying combination of network encoding and constellation overlapped encoding in collaboration relay system | |
| CN102075311A (en) | Network coding-based wireless cooperative broadcasting/multicasting method | |
| CN101826935A (en) | Low-density parity check code-based relay cooperative transmission method | |
| CN110086573B (en) | Data transmission method based on network coding and user pairing | |
| WO2015096444A1 (en) | Data transmission method and system | |
| Marcano et al. | On the throughput and energy benefits of network coded cooperation | |
| US20170164232A1 (en) | Improving data rates of short message noisy network coding and decode-and forward relaying | |
| CN104994043B (en) | Satellite mobile communication adaptive cooperation transmission method based on node selection | |
| Hernández Marcano et al. | Throughput, energy and overhead of multicast device‐to‐device communications with network‐coded cooperation | |
| Steinberg | Channels with cooperation links that may be absent | |
| CN106131968B (en) | A kind of relay base station multicast scheduling method based on fountain codes | |
| CN111769907B (en) | Data transmission method and device for ad hoc network communication | |
| JP2014187692A (en) | Method of retransmitting mobile broadcast service | |
| Marcano et al. | On the overhead of telescopic codes in network coded cooperation | |
| Steinberg | Instances of the relay-broadcast channel and cooperation strategies | |
| Niu et al. | Buffer-aided and weight-based non-orthogonal network coding for wireless broadcasting |
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 |