CN110086573A - It is a kind of based on network code and the peering data transmission method of user - Google Patents
It is a kind of based on network code and the peering data transmission method of user Download PDFInfo
- Publication number
- CN110086573A CN110086573A CN201910309211.6A CN201910309211A CN110086573A CN 110086573 A CN110086573 A CN 110086573A CN 201910309211 A CN201910309211 A CN 201910309211A CN 110086573 A CN110086573 A CN 110086573A
- Authority
- CN
- China
- Prior art keywords
- user
- peering
- base station
- data
- 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
Links
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 present invention provides a kind of data pack transmission methods peering based on network code and user, it include: N number of equipped with user, N number of user prepares to receive a common file from base station, this document includes K data packet, with A={ 1, ..., N } set that indicates all users, remember that the packet loss of the wireless channel between i-th of user and base station is pi,The packet loss for remembering the channel between user i and user j is pij,Assuming that channel has symmetry, i.e. p between userij=pji,For arbitrary i, j ∈ A, the peering condition of user i and user j is defined are as follows: pij<piAnd pij<pj, user i and user j can carry out peering；It is peering to user's progress, user is carried out data transmission after peering.The user for meeting peering condition is carried out peering and is considered as a grouping by the present invention, after thering is a user to complete to receive number in being grouped, the user for completing data receiver can utilize the channel advantage between group member, data packet is transferred to the user of unfinished data receiver instead of base station, is finally reached the efficiency of transmission for improving whole network.
Description
Technical field
The invention belongs to wireless network communication technique field more particularly to a kind of numbers peering based on network code and user
According to transmission method.
Background technique
Network code is one of the key technology in wireless communication.Using network code, the node in network can be to data
Packet carries out efficient coding, and the data packet after coding is then carried out unloading and transmission again.For recipient, as long as receiving
Data packet after sufficient amount of coding can decode all initial data.The advantages of network code, has: theoretically may be used
Reach minimal cut max-flow (min-cut max-flow) maximum size in network；Save the broadband resource consumption of network；It mentions
The robustness etc. of high network.
In the single-hop wireless broadcast network of reality, what the geographical location of base station was usually fixed, and user often exists
Random distribution in the transmission range of base station.For some users because geographical location is closer, the channel situation between user is preferable, loses
Packet rate is low.Based on this feature, we can be combined these users in peering mode, form a grouping.Every
In a grouping, user can be transmitted " mutual assistance ": for example, the user for completing data receiver can be using the channel between group member
Data packet is transferred to the user of unfinished data receiver instead of base station by advantage, is finally reached the transmission effect for improving whole network
Rate.
The present invention proposes a kind of based on network code and use for the multi-user data transmission problem in single-hop wireless networks
The peering efficient data transfer method in family: firstly, based on the channel parameter in network, qualified user progress is peering,
Finally constitute multiple groupings.After grouping is completed, raw data packets are first carried out random linear network encoding by base station, will be encoded
Data packet broadcast afterwards is to user.Data packet after at least one user receives sufficient amount of coding in each grouping
After being successfully decoded, base station is gone off the air.Finally, completing the user of data receiver, the original number that will be decoded in grouping
Random linear network encoding is carried out according to packet, the data packet after coding is sent in the form of unicast then and does not complete received use
Family.When all users complete to decode, entire transmission process terminates.
Summary of the invention
The present invention provides a kind of based on network code and user's knot for multi-user's file transmission problem in wireless network
Pair data pack transmission method.
The purpose of the present invention is what is be achieved through the following technical solutions.
A kind of data pack transmission method peering based on network code and user, comprising:
N number of equipped with user, N number of user prepares to receive a common file from base station, and this document includes K data
Packet indicates the set of all users with A={ 1 ..., N }, remembers that the packet loss of the wireless channel between i-th of user and base station isThe packet loss of channel between note user i and user j isAssuming that channel has symmetrically between user
Property, i.e.,For arbitrary i, j ∈ A, the peering condition of user i and user j is defined are as follows:
pij<piAnd pij<pj,
That is user i to base station channel packet loss and user j to the channel packet loss of base station, both greater than user i and use
When channel packet loss between the j of family, then user i and user j can be carried out peering；To user carry out it is peering, it is peering after to user into
The transmission of row data.
Further, the user it is peering the following steps are included:
(1) user is peering, indicates that peering user, which is completed, to be gathered with J,
(1.1) it setsI=1, i are i-th of user；
(1.2) user j=i+1 is set；
(1.3) judge whether j belongs to J, J indicates that peering user's set is completed, if so, entering step (1.4)；It is no
Then, (1.6) are entered step；
(1.4) j+1 is assigned to j by j ← j+1；
(1.5) judge whether j is greater than N, N indicates N number of user, if so, entering step (1.9)；Otherwise, return step
(1.3)；
(1.6) judge pijWhether p is less thaniAnd pj, if so, entering step (1.7)；Otherwise, return step (1.4)；
(1.7) user i and user j is carried out peering；
(1.8) i and j are put into set J, i.e. J ← J ∪ { i, j }；
(1.9) i+1 is assigned to i by i ← i+1；
(1.10) judge whether i belongs to J, if so, return step (1.9)；Otherwise, (1.11) are entered step；
(1.11) judge whether i is less than N, if so, return step (1.2)；Otherwise, (1.12) are entered step；
(1.12) the peering end of user.
Further, data transmission the following steps are included:
In each time slot, base station and each user carry out the transmission and reception of data packet in accordance with the following steps:
(2.1) base station encodes raw data packets using random linear network encoding, the number after generating a coding
According to packet, and it is broadcast to all users；
(2.2) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, entering step
Suddenly (2.3)；Otherwise, return step (2.1)；
(2.3) base station judges whether that at least a user has been successfully decoded in each user group, if so, entering step
Suddenly (2.4)；Otherwise, return step (2.1)；
(2.4) base station is gone off the air；
(2.5) in each group, the decoded user that succeeded using random linear network encoding to raw data packets into
Row coding, the packet of the data packet after generating a coding, and unicast is to user not decoded in group；
(2.6) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, entering step
Suddenly (2.7)；Otherwise, return step (2.5)；
(2.7) base station judges whether that all users have been successfully decoded, if so, entering step (2.8)；Otherwise, step is returned
Suddenly (2.5)；
(2.8) the data transfer ends.
Due to using technical solution of the present invention, the present invention is had the following advantages that, 1. in view of often existing in reality scene
Geographical location is closer between several users, the preferable situation of channel.Therefore, present invention utilizes the features, will meet peering
The user of condition carries out peering and is considered as a grouping.After thering is a user to complete to receive number in being grouped, data receiver is completed
User data packet can be transferred to the use of unfinished data receiver instead of base station using the channel advantage between group member
Family is finally reached the efficiency of transmission for improving whole network.2. existing in the transmission method encoded due to traditional uses no network
One data packet needs is transmitted multiple drawback repeatedly, and present invention utilizes the advantages of network code, improves data transmission
Efficiency.
Detailed description of the invention
Fig. 1 is a kind of data transmission method network diagram peering based on network code and user provided by the invention.
Fig. 2 is a kind of stream that the data transmission method user peering based on network code and user is peering provided by the invention
Cheng Tu；
Fig. 3 is a kind of stream of data transmission method data transmission peering based on network code and user provided by the invention
Cheng Tu.
Specific embodiment
An implementation example is given below in implementation method in order to further illustrate the present invention.This preferred embodiment only table
Show and the principle of the present invention is illustrated, does not represent any restrictions of the invention.
As shown, a kind of data pack transmission method peering based on network code and user, comprising:
N number of equipped with user, N number of user prepares to receive a common file from base station, and this document includes K data
Packet indicates the set of all users with A={ 1 ..., N }, remembers that the packet loss of the wireless channel between i-th of user and base station isThe packet loss of channel between note user i and user j isAssuming that channel has symmetrically between user
Property, i.e.,For arbitrary i, j ∈ A, the peering condition of user i and user j is defined are as follows:
pij<piAnd pij<pj,
That is user i to base station channel packet loss and user j to the channel packet loss of base station, both greater than user i and use
When channel packet loss between the j of family, then user i and user j can be carried out peering；To user carry out it is peering, it is peering after to user into
The transmission of row data.
The user it is peering the following steps are included:
(2) user is peering, indicates that peering user, which is completed, to be gathered with J,
(1.13) it setsI=1, i are i-th of user；
(1.14) user j=i+1 is set；
(1.15) judge whether j belongs to J, J indicates that peering user's set is completed, if so, entering step (1.4)；It is no
Then, (1.6) are entered step；
(1.16) j+1 is assigned to j by j ← j+1
(1.17) judge whether j is greater than N, N indicates N number of user, if so, entering step (1.9)；Otherwise, return step
(1.3)；
(1.18) judge pijWhether p is less thaniAnd pj, if so, entering step (1.7)；Otherwise, return step (1.4)；
(1.19) user i and user j is carried out peering；
(1.20) i and j are put into set J, i.e. J ← J ∪ { i, j }；
(1.21) i+1 is assigned to i by i ← i+1；
(1.22) judge whether i belongs to J, if so, return step (1.9)；Otherwise, (1.11) are entered step；
(1.23) judge whether i is less than N, if so, return step (1.2)；Otherwise, (1.12) are entered step；
(1.24) the peering end of user.
Data transmission the following steps are included:
In each time slot, base station and each user carry out the transmission and reception of data packet in accordance with the following steps:
(2.9) base station encodes raw data packets using random linear network encoding, the number after generating a coding
According to packet, and it is broadcast to all users；
(2.10) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, into
Step (2.3)；Otherwise, return step (2.1)；
(2.11) base station judges whether that at least a user has been successfully decoded in each user group, if so, into
Step (2.4)；Otherwise, return step (2.1)；
(2.12) base station is gone off the air；
(2.13) in each group, the decoded user that succeeded using random linear network encoding to raw data packets into
Row coding, the packet of the data packet after generating a coding, and unicast is to user not decoded in group；
(2.14) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, into
Step (2.7)；Otherwise, return step (2.5)；
(2.15) base station judges whether that all users have been successfully decoded, if so, entering step (2.8)；Otherwise, step is returned
Suddenly (2.5)；
(2.16) the data transfer ends.
Embodiment is assumed to prepare to download an identical file from base station there are three user, i.e. N=3, A={ 1,2,3 }.
This file is by 100 data packet groups at i.e. K=100.Assuming that the channel packet loss between user and base station is respectively p1=
0.4,p2=0.6, p3Channel packet loss between=0.5,3 users is respectively p12=0.8, p23=0.3, p13=0.9.
User is peering:
When beginning, haveSelect user i=1 and user j=i+1=2.Judge whether user 2 belongs to set J: by
InSo user 2 is not belonging to J.Next, it is determined that p12Whether p is less than1And p2.Due to p12=0.8 is greater than p2=0.6, p1
=0.4, do not meet the peering condition of user, therefore user 1 and user 2 be not peering.
Update j ← j+1=3.Since j=3 is not more than N, continue to judge p13Whether p is less than1And p3.Due to p13=0.9 is big
In p3=0.5, p1=0.4, do not meet the peering condition of user, therefore user 1 and user 3 be not peering.
Update j ← j+1=4.Since j=4 is greater than N, i ← i+1=2 is updated, i.e., user 2 is as to peering user.Due to i
=2 are not belonging to J and are less than N, select user j=i+1=3 to wait for peering.Since user j=3 is less than N, continue to judge p23It is whether small
In p2And p3.Due to p23=0.3 is less than p2=0.6, p3=0.5, meet the peering condition of user, user 2 and user 3 are peering, update
Set J={ 2,3 }.
So far, the peering stage terminates.3 users are divided into two groups, and user 1 is individually for one group, user 2 and 3 knot of user
To as one group.
Data transmission:
In first time slot, 100 data packets are first carried out random linear network encoding by base station, after generating a coding
Data packet, and be broadcast to three users.Since the encoded data packet that user needs to receive 100 Line independents could solve
Code, therefore, no user can complete decoding in first time slot.
Time slot and first time slot later is similarly.
Assuming that user 1 just has received 100 encoded data packets, therefore has decoded institute in the 167th time slot
There are raw data packets；And user 2 and 3 does not receive 100 encoded data packets also at this time.User 1 issues feedback letter to base station
Breath, informs that oneself has been successfully decoded.Due to not having user to be successfully decoded in the group where user 2 and user 3, base station exists
Continue to keep broadcast in next time slot.
Assuming that user 3 just has received 100 encoded data packets in the 200th time slot, therefore decode all
Raw data packets.User 3 issues feedback information to base station, informs that oneself has been successfully decoded.Due to base station from Liang Ge group all
Feedback information is had received, base station will go off the air from next time slot.
Since the 201st time slot, the raw data packets decoded are carried out random linear network encoding by user 3, are generated
Data packet after one coding, and unicast is to the peering user 2 in group.
Assuming that all raw data packets are also successfully decoded out in user 2, and have issued instead to base station in the 250th time slot
Feedforward information.Base station has received the feedback information of all three users at this time, and transmission process terminates.
The present invention is based on the peering data transmission methods of network code and user, belong to wireless communication field.Pass through
It carries out peering to the user for meeting peering condition and combines network coding technique, improve the efficiency of transmission of whole network.
The preferred embodiment of the present invention and principle are described in detail above, to those skilled in the art
Speech, the thought provided according to the present invention will change in specific embodiment, and these changes also should be regarded as the present invention
Protection scope.
Claims (3)
1. a kind of data pack transmission method peering based on network code and user characterized by comprising
N number of equipped with user, N number of user prepares to receive a common file from base station, and this document includes K data packet, uses A
={ 1 ..., N } indicates the set of all users, remembers that the packet loss of the wireless channel between i-th of user and base station isThe packet loss of channel between note user i and user j isAssuming that channel has symmetrically between user
Property, i.e.,For arbitrary i, j ∈ A, the peering condition of user i and user j is defined are as follows:
pij<piAnd pij<pj,
That is user i to base station channel packet loss and user j to the channel packet loss of base station, both greater than user i and user j it
Between channel packet loss when, then user i and user j can be carried out peering；It is peering to user's progress, data are carried out to user after peering
Transmission.
2. a kind of data pack transmission method peering based on network code and user as described in claim 1, which is characterized in that
The user it is peering the following steps are included:
(1) user is peering, indicates that peering user, which is completed, to be gathered with J,
(1.1) it setsI=1, i are i-th of user；
(1.2) user j is set；
(1.3) judge whether j belongs to J, J indicates that peering user's set is completed, if so, entering step (1.4)；Otherwise, into
Enter step (1.6)；
(1.4) j+1 is assigned to j by j ← j+1；
(1.5) judge whether j is greater than N, N indicates N number of user, if so, entering step (1.9)；Otherwise, return step (1.3)；
(1.6) judge pijWhether p is less thaniAnd pj, if so, entering step (1.7)；Otherwise, return step (1.4)；
(1.7) user i and user j is carried out peering；
(1.8) i and j are put into set J, i.e. J ← J ∪ { i, j }；
(1.9) i+1 is assigned to i by i ← i+1；
(1.10) judge whether i belongs to J, if so, return step (1.9)；Otherwise, (1.11) are entered step；
(1.11) judge whether i is less than N, if so, return step (1.2)；Otherwise, (1.12) are entered step；
(1.12) the peering end of user.
3. a kind of data pack transmission method peering based on network code and user as described in claim 1, which is characterized in that
Data transmission the following steps are included:
In each time slot, base station and each user carry out the transmission and reception of data packet in accordance with the following steps:
(2.1) base station encodes raw data packets using random linear network encoding, the data packet after generating a coding,
And it is broadcast to all users；
(2.2) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, entering step
(2.3)；Otherwise, return step (2.1)；
(2.3) base station judges whether that at least a user has been successfully decoded in each user group, if so, entering step
(2.4)；Otherwise, return step (2.1)；
(2.4) base station is gone off the air；
(2.5) in each group, the decoded user that succeeded compiles raw data packets using random linear network encoding
Code, the packet of the data packet after generating a coding, and unicast is to user not decoded in group；
(2.6) one or more users whether are successfully decoded and issue feedback information in current time slots, if so, entering step
(2.7)；Otherwise, return step (2.5)；
(2.7) base station judges whether that all users have been successfully decoded, if so, entering step (2.8)；Otherwise, return step
(2.5)；
(2.8) the data transfer ends.
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 true CN110086573A (en) | 2019-08-02 |
| CN110086573B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111585696A (en) * | 2020-04-02 | 2020-08-25 | 浙江工商大学 | Method and system for enhancing downlink throughput of bidirectional transmission network based on XOR operation |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102202413A (en) * | 2011-06-13 | 2011-09-28 | 北京邮电大学 | Method for dispatching resources by combining network coding and user pairing |
| 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 |
-
2019
- 2019-04-17 CN CN201910309211.6A patent/CN110086573B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102202413A (en) * | 2011-06-13 | 2011-09-28 | 北京邮电大学 | Method for dispatching resources by combining network coding and user pairing |
| 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 (2)
| Title |
|---|
| 王鹏飞 等: "联合蜂窝与D2D链路的网络编码广播重传方案", 《信号处理》 * |
| 雷许斌: "基于网络编码的用户分组传输策略研究", 《自动化与仪器仪表》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111585696A (en) * | 2020-04-02 | 2020-08-25 | 浙江工商大学 | Method and system for enhancing downlink throughput of bidirectional transmission network based on XOR operation |
| CN111585696B (en) * | 2020-04-02 | 2022-07-12 | 浙江工商大学 | Method and system for enhancing downlink throughput of bidirectional transmission network based on XOR operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086573B (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105337649B (en) | The method, apparatus and computer-readable medium that the efficient group of ID for WLAN (WLAN) is managed | |
| CN101529737B (en) | Method and system for data transmission in a multiple input multiple output (MIMO) system | |
| CN101394255B (en) | Two-user collaboration communication method in multi-user wireless network | |
| CN101848060B (en) | Self-adaptive cooperation relay method through network coding | |
| CN103095423A (en) | Multi-user cooperative transmission method based on dimension to dimension (D2D) inter-group communication | |
| CN101895376A (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| CN101820586B (en) | Method for reliable broadcasting in wireless local area network | |
| CN102545992A (en) | Optimal relay selection and power distribution method of DF (decode-forward) relay system | |
| CN101826935A (en) | Low-density parity check code-based relay cooperative transmission method | |
| CN102075311A (en) | Network coding-based wireless cooperative broadcasting/multicasting method | |
| CN106998308A (en) | A kind of frame hopping transmission method in Sparse Code multiple access access based on time-varying code book | |
| CN101394327B (en) | Method for applying combination of network encoding and constellation overlapped encoding in collaboration relay system | |
| Zhang et al. | Network coding for efficient multicast routing in wireless ad-hoc networks | |
| Marcano et al. | On the throughput and energy benefits of network coded cooperation | |
| CN110086573A (en) | It is a kind of based on network code and the peering data transmission method of user | |
| CN106131968B (en) | A kind of relay base station multicast scheduling method based on fountain codes | |
| Steinberg | Channels with cooperation links that may be absent | |
| CN102355330A (en) | Distributed cascade-based channel coding system and method thereof | |
| CN110049452A (en) | Novel two stages based on NOMA cooperate Multicast Scheme | |
| Xu et al. | Cache-aided interference management in partially connected linear networks | |
| CN103354651A (en) | Polling grouping scheduling method in multi-source multi-relay cooperation network | |
| Li et al. | Random network coding based on adaptive sliding window in wireless multicast networks | |
| Marcano et al. | On the overhead of telescopic codes in network coded cooperation | |
| Cheng et al. | Generalized signal-space alignment based physical-layer network coding for distributed MIMO systems | |
| Xu et al. | Video distortion reduction with network coding and device-to-device communications |
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 |