CN109041156A - Wireless route method with hop-by-hop affirmation mechanism - Google Patents
Wireless route method with hop-by-hop affirmation mechanism Download PDFInfo
- Publication number
- CN109041156A CN109041156A CN201810996555.4A CN201810996555A CN109041156A CN 109041156 A CN109041156 A CN 109041156A CN 201810996555 A CN201810996555 A CN 201810996555A CN 109041156 A CN109041156 A CN 109041156A
- Authority
- CN
- China
- Prior art keywords
- packet
- data packet
- hop
- confirmation
- sent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless route methods with hop-by-hop affirmation mechanism, send buffer area by being arranged in each routing node, realize hop-by-hop affirmation mechanism of the data packet in transmission process.In multi-hop link, the transmission again by intermediary routing node to lost data packets not only ensure that reliable data transmission end to end, but also reduce and retransmit data bring time delay so that the data packet lost does not have to retransmit by Transmission Control Protocol from source node.
Description
Technical field
The present invention relates to technical field of wireless self-organizing more particularly to it is a kind of with hop-by-hop affirmation mechanism without route
By method.
Background technique
Increasing rapidly and developing with wireless network scale, existing Wireless Routing Protocol has been unable to meet new application
Demand.In this context, it designs a kind of more structurally sound Wireless Routing Protocol and is not only adapted to new wireless networks
Demand, also can promote industrialized development.
In existing wireless communications technology, wireless Mesh netword is studied and is used by more and more mechanisms.In nothing
In line Mesh network, not all node can be with the arbitrary node direct communication in network, it is therefore necessary to pass through middle node
Point transmits message in a network, and the connectivity of network is maintained by multi-hop communication.One high performance Wireless Mesh network should mention
Guarantee for quality services quality (Quality of Service, QoS).Since node each in network requires a routing
Agreement selects the data packet to be sent to from source node the optimal path of destination node, in order to make handling capacity and time delay all meet QoS
Requirement, the superiority and inferiority of protocol capabilities be people design when overriding concern the problem of.
Wireless Mesh netword has several typical Routing Protocols, such as AODV agreement, OLSR agreement, BATMAN agreement.Its
In, AODV is Reactive routing protocols, and routing table is only established when needed.Due to its reaction equation characteristic, AODV is very
It is suitble to the high speed dynamic network of processing automobile specified；But the reaction equation characteristic of AODV, also cause in extensive mesh network
Data transmission there are a fixed response times, while it is using most short hop count as the characteristic of route metric, so that it is more likely to select
Long range low bandwidth link reduces efficiency of transmission.OLSR is proactive routing protocol, is highly suitable for wireless Mesh netword,
It is usually used in community network；But it needs a large amount of energy and Internet resources to maintain reactiver outing；The agreement is a large amount of because having propagated
Not used wireless routing information, to cause the serious wasting of resources.BATMAN-ADV be it is a kind of novel two layers without route
By agreement, belong to Proactive routing protocols, can generally also be classified as Distance Vector Routing Algorithm；This is used in Mesh net
When a agreement, node does not save complete routing table and only saves the information of best next-hop node, so that agreement more light weight
Change, faster, operational efficiency is higher for convergence rate, the wireless Mesh netword unstable suitable for transmission quality.
Not no retransmission mechanism in existing BATMAN-ADV agreement, between each node of link, link-quality compared with
In the case where difference, once packet loss occurs for intermediate node, which will retransmit since source node, this is by serious consumption network
Bandwidth increases network delay.Therefore, link-quality is poor or the self-organizing network of violent upheaval in, existing BATMAN-
ADV agreement is simultaneously not suitable for.
Summary of the invention
The object of the present invention is to provide a kind of wireless route method with hop-by-hop affirmation mechanism, the place for taking hop-by-hop to confirm
Reason mechanism can effectively reduce the time delay caused by packet loss in data transmission procedure, improve the stability of network with
And efficiency of transmission.
The purpose of the present invention is what is be achieved through the following technical solutions:
A kind of wireless route method with hop-by-hop affirmation mechanism, comprising: local packets send, data packet receive with really
Recognize packet to send, data packet forwarding, confirmation packet receives four processes；Wherein:
In local packets transmission process, data packet to be sent is sent to local buffer area by routing node, then is sent out
It send to next routing node；If not receiving confirmation packet in the stipulated time, by the data packet of buffer area, a downward routing is saved again
Point is sent；
Data packet receives and confirms in packet transmission process, after routing node receives data packet, if packet rs destination exists
Local, then feedback acknowledgment packet, process terminate；If packet rs destination carries out data packet and turns not in local, feedback acknowledgment packet
Hair；
In data packet repeating process, routing node sends data packets to local buffer area, then is forwarded to next routing
Node；If not receiving confirmation packet in the stipulated time, by the data packet of buffer area, a downward routing node is forwarded again；
Confirm in packet receive process, it is whether correct to determine whether to delete the correspondence in buffer area according to confirmation packet serial number
Data packet will confirm that packet abandons later.
As seen from the above technical solution provided by the invention, caching is sent by being arranged in each routing node, it is real
Existing hop-by-hop affirmation mechanism of the data packet on link layer, so that the data improved in the poor network of link-quality transmit effect
Rate.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill in field, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is a kind of flow chart of the wireless route method with hop-by-hop affirmation mechanism provided in an embodiment of the present invention；
Fig. 2 is that data provided in an embodiment of the present invention transmit schematic diagram；
Fig. 3 is that hop-by-hop provided in an embodiment of the present invention confirms schematic diagram.
Specific embodiment
With reference to the attached drawing in the embodiment of the present invention, technical solution in the embodiment of the present invention carries out clear, complete
Ground description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based on this
The embodiment of invention, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, belongs to protection scope of the present invention.
Due to poor in link-quality, in the higher self-organizing network of packet loss, existing BATMAN-ADV agreement transmits number
According to time delay it is higher, the present invention devises a kind of wireless route method with hop-by-hop affirmation mechanism: by setting in each node
Transmission caching is set, realizes hop-by-hop affirmation mechanism of the data packet on link layer, to improve in the poor network of link-quality
Data transmission efficiency.
The embodiment of the present invention provides a kind of wireless route method with hop-by-hop affirmation mechanism, and each routing node is with meter
Calculate the routing device with caching capabilities.Buffer area is sent by being arranged in each routing node, realizes data packet in transmission process
In hop-by-hop affirmation mechanism.In multi-hop link, transmission again by intermediary routing node to lost data packets, so that losing
Data packet do not have to by Transmission Control Protocol from source node retransmit, not only ensure that reliable data transmission end to end, but also reduce re-transmission
Data bring time delay.
It is specifically included that as shown in Figure 1, the embodiment of the present invention provides a kind of wireless route method with hop-by-hop affirmation mechanism
Local packets are sent, and data packet is received to be sent with confirmation packet, and data packet forwarding, confirmation packet receives four processes.
1, in local packets transmission process, data packet to be sent is sent to local buffer area by routing node, then
It is sent to next routing node；If not receiving confirmation packet in the stipulated time, by the downward routing again of the data packet of buffer area
Node is sent.
Local packets transmission process preferred embodiment is as follows: 1) encapsulating data packet to be sent and send to data packet and send out
Send module；2) packet sending module assigns data packet serial number to be sent, and data packet copy is a local to sending
Buffer area, then be added into transmit queue；If 3) do not receive confirmation packet in stipulated time, the data packet of buffer area is copied
Portion, and pushed data packet sending module.
2, data packet receives and confirms in packet transmission process, after routing node receives data packet, if packet rs destination
In local, then feedback acknowledgment packet, process terminate；If packet rs destination carries out data packet not in local, feedback acknowledgment packet
Forwarding.
Data packet receives as follows with confirmation packet transmission process preferred embodiment: 1) it from receiving queue by data packet takes out,
Unicast packet handing module is transferred to after categorized；2) in unicast packet handing module, by data packet and confirmation packet separation, and to data
Packet carries out destination address classification；If 3) packet rs destination in local, transfer to network layer interface module to be received, and
Sending confirmation packet indicates to receive, and process terminates；If the packet rs destination not in local, sending confirmation packet first indicates to receive,
Then forwarding addressed module is transferred to, into data packet forwarding process.
Wireless route method provided by the embodiment of the present invention mainly for the data transmitted data packet, in practical biography
The control packet of agreement operation information needed is further comprised in defeated, data packet can be distinguished with control packet by distributor, for
Data packet can transfer to unicast report processing module to do subsequent processing, transfer to the control most subsequent place of packet handing module for control Bao Ze
Reason.
3, in data packet repeating process, routing node sends data packets to local buffer area, then is forwarded to down all the way
By node；If not receiving confirmation packet in the stipulated time, by the data packet of buffer area, a downward routing node is forwarded again.
Data packet repeating process preferred embodiment is as follows: 1) data packet being sent into forwarding addressed module, found most suitable
Next hop address, then be sent to packet sending module；2) packet sending module assigns data packet serial number to be sent, and
By a buffer area local to transmission of data packet copy, then it is added into transmit queue；If 3) do not received in stipulated time
The corresponding data packet of buffer area is copied portion, and pushed data packet sending module by confirmation packet.
4, confirm in packet receive process, it is whether correct to determine whether to delete pair in buffer area according to confirmation packet serial number
Data packet is answered, later, will confirm that packet abandons.
Confirmation packet receive process preferred embodiment is as follows: 1) taking out from receiving queue by data packet, transfer to after categorized
Unicast packet handing module；2) in unicast packet handing module, by data packet and confirmation packet separation, confirmation packet is sent at confirmation packet
Manage module；3) in confirmation packet handing module, the serial number of confirmation packet is extracted, determines whether to delete the corresponding data in buffer area
Packet；That is: serial number is correct, then deletes caching, otherwise, retains caching；4) after having handled, it will confirm that packet abandons.
In above scheme of the embodiment of the present invention, data packet transmitting by the way of hop-by-hop confirmation on link layer, so that
It transmits the data packet lost on the way no longer to need to retransmit from source node, to reduce in the poor network of link-quality because losing
Packet retransmits and bring time delay.The transmission mechanism that router is confirmed by the hop-by-hop is guaranteeing the end-to-end reliable transmission of data
Meanwhile also improving the efficiency of transmission of network.
In order to make it easy to understand, being illustrated below with reference to two examples.
Example one: as shown in Fig. 2, data packet is needed from server transport to client by five hop routers.Data packet
There are buffer areas for each router between server, i.e., meeting hop-by-hop is confirmed whether to be lost when data packet is transmitted
Packet.In case of packet loss, then retransmitted from buffer area copy corresponding data packet.
Router 1 has been illustrated to the step of the transmission of 3 data of router in example two, Fig. 3: 1. router 1 is by data packet
It is put into local cache area, and sends data packet to router 2；2. router 2 sends confirmation packet to router 1；3. router 2 will
Data packet is put into local cache area；4. router 2 forwards data packet failure to router 3；5. router 2 failed in the stipulated time
Inside receive confirmation packet；6. router 2 copies out the data packet for sending failure from local cache area, then forward again；7. road
Confirmation packet is sent by 3 successful data reception packet of device, and to router 2；8. router 2 delete local cache area in it is acknowledged
The data packet being successfully transmitted.
Above scheme of the embodiment of the present invention takes hop-by-hop to confirm data packet transmission under the bad environment of link circuit condition
Treatment mechanism, the time delay caused by packet loss in data transmission procedure can be effectively reduced, improve the stabilization of network
Property and efficiency of transmission.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment can
The mode of necessary general hardware platform can also be added to realize by software by software realization.Based on this understanding,
The technical solution of above-described embodiment can be embodied in the form of software products, which can store non-easy at one
In the property lost storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), including some instructions are with so that a computer is set
Standby (can be personal computer, server or the network equipment etc.) executes method described in each embodiment of the present invention.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Within the technical scope of the present disclosure, any changes or substitutions that can be easily thought of by anyone skilled in the art,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of claims
Subject to enclosing.
Claims (5)
1. a kind of wireless route method with hop-by-hop affirmation mechanism characterized by comprising local packets are sent, data
Packet is received to be sent with confirmation packet, and data packet forwarding, confirmation packet receives four processes；Wherein:
In local packets transmission process, data packet to be sent is sent to local buffer area by routing node, retransmit to
Next routing node；If not receiving confirmation packet in the stipulated time, by the data packet of buffer area, a downward routing node is sent out again
It send；
Data packet receive in confirmation packet transmission process, after routing node receives data packet, if packet rs destination in local,
Then feedback acknowledgment packet, process terminate；If packet rs destination carries out data packet forwarding not in local, feedback acknowledgment packet；
In data packet repeating process, routing node sends data packets to local buffer area, then is forwarded to next routing node；
If not receiving confirmation packet in the stipulated time, by the data packet of buffer area, a downward routing node is forwarded again；
Confirm in packet receive process, it is whether correct to determine whether to delete the corresponding data in buffer area according to confirmation packet serial number
Packet will confirm that packet abandons later.
2. a kind of wireless route method with hop-by-hop affirmation mechanism according to claim 1, which is characterized in that described
Ground data packet transmission process includes:
It encapsulates data packet to be sent and send to packet sending module；Packet sending module assigns data packet sequence to be sent
Number, and by a buffer area local to transmission of data packet copy, then it is added into transmit queue；If in the stipulated time not
Confirmation packet is received, the data packet of buffer area is copied into portion, and pushed data packet sending module.
3. a kind of wireless route method with hop-by-hop affirmation mechanism according to claim 1, which is characterized in that the number
It is received according to packet and includes: with confirmation packet transmission process
It is taken out from receiving queue by data packet, unicast packet handing module is transferred to after categorized；In unicast packet handing module, it will count
According to packet and confirmation packet separation, and destination address classification is carried out to data packet；If the packet rs destination in local, transfer to net
Network layers interface module is received, and is sent confirmation packet expression and received, and process terminates；If the packet rs destination not in local,
Sending confirmation packet first indicates to receive, and forwarding addressed module is then transferred to, into data packet forwarding process.
4. a kind of wireless route method with hop-by-hop affirmation mechanism according to claim 1, which is characterized in that the number
Include: according to packet repeating process
Data packet is sent into forwarding addressed module, finds most suitable next hop address, then be sent to packet sending module；
Packet sending module assigns data packet serial number to be sent, and by a buffer area local to transmission of data packet copy, then
It is added into transmit queue；If not receiving confirmation packet in the stipulated time, the corresponding data packet of buffer area is copied into portion, and be pushed into
Packet sending module.
5. a kind of wireless route method with hop-by-hop affirmation mechanism according to claim 1, which is characterized in that described true
Recognizing packet receive process includes:
It is taken out from receiving queue by data packet, unicast packet handing module is transferred to after categorized；In unicast packet handing module, it will count
According to packet and confirmation packet separation, confirmation packet is sent to confirmation packet handing module；In confirmation packet handing module, the sequence of confirmation packet is extracted
Number, it determines whether to delete the corresponding data packet in buffer area；After having handled, it will confirm that packet abandons.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810996555.4A CN109041156B (en) | 2018-08-29 | 2018-08-29 | Wireless routing method with hop-by-hop acknowledgement mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810996555.4A CN109041156B (en) | 2018-08-29 | 2018-08-29 | Wireless routing method with hop-by-hop acknowledgement mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109041156A true CN109041156A (en) | 2018-12-18 |
| CN109041156B CN109041156B (en) | 2020-12-25 |
Family
ID=64625251
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810996555.4A Active CN109041156B (en) | 2018-08-29 | 2018-08-29 | Wireless routing method with hop-by-hop acknowledgement mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109041156B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600312A (en) * | 2019-01-04 | 2019-04-09 | 南京邮电大学 | A kind of BATMAN-Adv protocol optimization design method towards intelligent terminal ad hoc network |
| CN110830472A (en) * | 2019-11-07 | 2020-02-21 | 西北工业大学 | Flexible data transmission method of flexible data transmission protocol based on TCP/IP protocol |
| CN113141308A (en) * | 2021-06-21 | 2021-07-20 | 之江实验室 | Lightweight wired Mesh networking design method |
| CN113438058A (en) * | 2021-06-22 | 2021-09-24 | 中国科学院计算机网络信息中心 | Data transmission method, device, network relay equipment and system |
| CN114124316A (en) * | 2020-09-01 | 2022-03-01 | ***通信有限公司研究院 | Data transmission method, device, node equipment and data transmission network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626597A (en) * | 2009-08-07 | 2010-01-13 | 中国科学院软件研究所 | Hop to hop transmission method based on satellite network |
| CN102158864A (en) * | 2011-04-15 | 2011-08-17 | 北京航空航天大学 | Mobile AD Hoc network self-adapting secure routing method based on reliability |
| CN102255807A (en) * | 2011-07-07 | 2011-11-23 | 浙江大学 | Multipath segmental routing method based on multihop network with master-slave structure |
| CN102340391A (en) * | 2011-11-14 | 2012-02-01 | 电子科技大学 | Segmented ARQ (automatic repeat request) automatic retransmission method |
| WO2013036453A1 (en) * | 2011-09-08 | 2013-03-14 | Interdigital Patent Holdings, Inc. | Methods, system and apparatus for packet routing using a hop-by-hop protocol in multi-homed environments |
| CN104717144A (en) * | 2015-03-23 | 2015-06-17 | 中国科学技术大学 | Reliable multicast method based on within-network caching and hop-by-hop confirmation |
-
2018
- 2018-08-29 CN CN201810996555.4A patent/CN109041156B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626597A (en) * | 2009-08-07 | 2010-01-13 | 中国科学院软件研究所 | Hop to hop transmission method based on satellite network |
| CN102158864A (en) * | 2011-04-15 | 2011-08-17 | 北京航空航天大学 | Mobile AD Hoc network self-adapting secure routing method based on reliability |
| CN102255807A (en) * | 2011-07-07 | 2011-11-23 | 浙江大学 | Multipath segmental routing method based on multihop network with master-slave structure |
| WO2013036453A1 (en) * | 2011-09-08 | 2013-03-14 | Interdigital Patent Holdings, Inc. | Methods, system and apparatus for packet routing using a hop-by-hop protocol in multi-homed environments |
| CN102340391A (en) * | 2011-11-14 | 2012-02-01 | 电子科技大学 | Segmented ARQ (automatic repeat request) automatic retransmission method |
| CN104717144A (en) * | 2015-03-23 | 2015-06-17 | 中国科学技术大学 | Reliable multicast method based on within-network caching and hop-by-hop confirmation |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600312A (en) * | 2019-01-04 | 2019-04-09 | 南京邮电大学 | A kind of BATMAN-Adv protocol optimization design method towards intelligent terminal ad hoc network |
| CN109600312B (en) * | 2019-01-04 | 2021-03-12 | 南京邮电大学 | BATMAN-Adv protocol optimization design method for intelligent terminal ad hoc network |
| CN110830472A (en) * | 2019-11-07 | 2020-02-21 | 西北工业大学 | Flexible data transmission method of flexible data transmission protocol based on TCP/IP protocol |
| CN114124316A (en) * | 2020-09-01 | 2022-03-01 | ***通信有限公司研究院 | Data transmission method, device, node equipment and data transmission network |
| CN113141308A (en) * | 2021-06-21 | 2021-07-20 | 之江实验室 | Lightweight wired Mesh networking design method |
| CN113141308B (en) * | 2021-06-21 | 2021-09-14 | 之江实验室 | Lightweight wired Mesh networking design method |
| CN113438058A (en) * | 2021-06-22 | 2021-09-24 | 中国科学院计算机网络信息中心 | Data transmission method, device, network relay equipment and system |
| CN113438058B (en) * | 2021-06-22 | 2022-11-25 | 中国科学院计算机网络信息中心 | Data transmission method, device, network relay equipment and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109041156B (en) | 2020-12-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109041156A (en) | Wireless route method with hop-by-hop affirmation mechanism | |
| KR101610715B1 (en) | One-way data transmission and reception system, and one-way data transmission and reception method | |
| WO2011043755A1 (en) | A method and apparatus for hop-by hop reliable multicast in wireless networks | |
| EP2486696A1 (en) | A method and apparatus for hop-by-hop reliable multicast in wireless networks | |
| WO2019242755A1 (en) | Data transmission method, network device and terminal device | |
| US9686733B2 (en) | Communication method in a wireless telecommunications network, associated computer program and wireless communication node | |
| WO2011100911A2 (en) | Detection processing method, data transmitter, data receiver and communication system | |
| KR102465917B1 (en) | Data retransmission method and device | |
| Gopinath et al. | An experimental study of the cache-and-forward network architecture in multi-hop wireless scenarios | |
| Oh et al. | Robust MANET routing using adaptive path redundancy and coding | |
| Zeng et al. | Dynamic segmented network coding for reliable data dissemination in delay tolerant networks | |
| JP2006101428A (en) | Wireless network control device and its method, control program and recording medium | |
| CN116264724A (en) | Method and device for routing data packets in wireless mesh network and readable medium thereof | |
| EP3424163B1 (en) | Enhancement of relay arq in mmw network | |
| Oh et al. | A flow-based hybrid mechanism to improve performance in nox and wireless openflow switch networks | |
| US11012914B2 (en) | Method and apparatus for configuring path in communication system including Xhaul network | |
| KR20130015800A (en) | Multi-path qos(quality-of-service) routing method for wireless mesh network | |
| Bhople et al. | An analysis of ADTCP, I-ADTCP and Cross-Layer Based Protocol for Improving Performance of TCP in Mobile Adhoc Network | |
| US20230189117A1 (en) | Packet routing in a layer 2 mesh network | |
| Chandra et al. | TCP performance for future IP-based wireless networks | |
| Shagdar et al. | Improving ECN-based TCP performance over wireless networks using a homogeneous implementation of EWLN | |
| Oh | A hybrid routing protocol for wireless Mesh Networks | |
| Jiang et al. | LEOTP: An Information-Centric Transport Layer Protocol for LEO Satellite Networks | |
| US20210297198A1 (en) | Operation of automatic repeat request | |
| Nikopour et al. | Linear Packet Network Coding to Enhance Reliability and Resiliency of Next Generation Wireless Networks with Topological Redundancies |
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 |