CN109041156B - Wireless routing method with hop-by-hop acknowledgement mechanism - Google Patents
Wireless routing method with hop-by-hop acknowledgement mechanism Download PDFInfo
- Publication number
- CN109041156B CN109041156B CN201810996555.4A CN201810996555A CN109041156B CN 109041156 B CN109041156 B CN 109041156B CN 201810996555 A CN201810996555 A CN 201810996555A CN 109041156 B CN109041156 B CN 109041156B
- Authority
- CN
- China
- Prior art keywords
- data packet
- packet
- sending
- hop
- confirmation
- 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
- 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
Abstract
The invention discloses a wireless routing method with a hop-by-hop confirmation mechanism, which realizes the hop-by-hop confirmation mechanism of a data packet in the transmission process by setting a sending cache region in each routing node. On the multi-hop link, the lost data packet is retransmitted through the intermediate routing node, so that the lost data packet does not need to be retransmitted from the source node through a TCP (transmission control protocol), the reliable transmission of end-to-end data is ensured, and the time delay caused by retransmitting the data is reduced.
Description
Technical Field
The invention relates to the technical field of wireless self-organizing networks, in particular to a wireless routing method with a hop-by-hop confirmation mechanism.
Background
With the rapid growth and evolution of wireless network sizes, existing wireless routing protocols have been unable to meet the needs of new applications. Under the background, a more reliable wireless routing protocol is designed, so that the requirement of a novel wireless network can be met, and the development of industrialization can be promoted.
In the existing wireless communication technology, a wireless Mesh network is being researched and used by more and more organizations. In a wireless Mesh network, not all nodes may communicate directly with any node in the network, and therefore must pass messages through intermediate nodes in the network, maintaining connectivity of the network through multi-hop communications. A high performance wireless Mesh network should provide Quality of Service (QoS) guarantees. Because each node in the network needs a routing protocol to select the optimal path for sending a data packet from a source node to a destination node, in order to enable both throughput and delay to meet the QoS requirements, the performance of the protocol is a primary consideration when people design.
The wireless Mesh network has several typical routing protocols, such as AODV protocol, OLSR protocol, BATMAN protocol, etc. Among them, AODV is a reactive routing protocol whose routing table is established only when needed. Due to its reactive nature, AODV is well suited to handle high-speed dynamic networks dedicated to automobiles; however, the reactive characteristic of AODV also causes a certain delay in data transmission in a large-scale mesh network, and at the same time, it uses the shortest hop count as the characteristic of routing metric, so that it is more prone to select a long-distance low-bandwidth link, and reduces transmission efficiency. The OLSR is an active routing protocol, is very suitable for a wireless Mesh network, and is also commonly used in a community network; it requires significant energy and network resources to maintain active routing; the protocol causes serious resource waste due to the propagation of a large amount of unused wireless routing information. BATMAN-ADV is a novel two-layer wireless routing protocol, belongs to a priori type routing protocol, and can be generally classified into a distance vector routing algorithm; when the protocol is used in the Mesh network, the nodes do not store a complete routing table but only store the information of the best next hop node, so that the protocol is lighter, the convergence rate is higher, the operation efficiency is higher, and the method is suitable for the wireless Mesh network with unstable transmission quality.
In the existing BATMAN-ADV protocol, there is no retransmission mechanism between nodes of a link, and under the condition of poor link quality, once an intermediate node loses a packet, the data packet will be retransmitted from a source node, which will seriously consume network bandwidth and increase network delay. Therefore, the existing battman-ADV protocol is not applicable in ad-hoc networks with poor link quality or strong fluctuations.
Disclosure of Invention
The invention aims to provide a wireless routing method with a hop-by-hop confirmation mechanism, which adopts the hop-by-hop confirmation processing mechanism, can effectively reduce the time delay caused by packet loss in the data transmission process, and improves the stability and the transmission efficiency of a network.
The purpose of the invention is realized by the following technical scheme:
a wireless routing method with a hop-by-hop acknowledgement mechanism, comprising: sending a local data packet, receiving the data packet, sending a confirmation packet, forwarding the data packet and receiving the confirmation packet; wherein:
in the process of sending the local data packet, the routing node sends the data packet to be sent to a local cache region and then sends the data packet to a next routing node; if the confirmation packet is not received within the specified time, the data packet in the cache region is sent to the next routing node again;
in the process of receiving the data packet and sending the confirmation packet, after the routing node receives the data packet, if the purpose of the data packet is local, feeding back the confirmation packet, and ending the process; if the purpose of the data packet is not local, feeding back a confirmation packet and forwarding the data packet;
in the process of forwarding the data packet, the routing node sends the data packet to a local cache region and forwards the data packet to the next routing node; if the confirmation packet is not received within the specified time, the data packet in the cache region is forwarded to the next routing node again;
and in the process of confirming the packet receiving, judging whether to delete the corresponding data packet in the buffer area according to whether the sequence number of the confirmation packet is correct or not, and then discarding the confirmation packet.
The technical scheme provided by the invention can be seen that the hop-by-hop confirmation mechanism of the data packet on the link layer is realized by arranging the sending cache in each routing node, so that the data transmission efficiency in the network with poor link quality is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a flowchart of a wireless routing method with a hop-by-hop acknowledgement mechanism according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating data transmission according to an embodiment of the present invention;
fig. 3 is a schematic diagram of hop-by-hop acknowledgement according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
Because the time delay of data transmission of the conventional BATMAN-ADV protocol is higher in the self-organizing network with poorer link quality and higher packet loss rate, the invention designs a wireless routing method with a hop-by-hop confirmation mechanism, which comprises the following steps: by setting a sending cache in each node, a hop-by-hop confirmation mechanism of a data packet on a link layer is realized, so that the data transmission efficiency in a network with poor link quality is improved.
The embodiment of the invention provides a wireless routing method with a hop-by-hop confirmation mechanism, and each routing node is a routing device with calculation and cache capabilities. By setting a sending buffer area in each routing node, a hop-by-hop confirmation mechanism of the data packet in the transmission process is realized. On the multi-hop link, the lost data packet is retransmitted through the intermediate routing node, so that the lost data packet does not need to be retransmitted from the source node through a TCP (transmission control protocol), the reliable transmission of end-to-end data is ensured, and the time delay caused by retransmitting the data is reduced.
As shown in fig. 1, a wireless routing method with a hop-by-hop acknowledgement mechanism according to an embodiment of the present invention mainly includes: sending a local data packet, receiving the data packet, sending a confirmation packet, forwarding the data packet and receiving the confirmation packet.
1. In the process of sending the local data packet, the routing node sends the data packet to be sent to a local cache region and then sends the data packet to a next routing node; and if the confirmation packet is not received within the specified time, sending the data packet in the cache region to the next routing node again.
The preferred embodiment of the local data packet sending process is as follows: 1) packaging a data packet to be sent and sending the data packet to a data packet sending module; 2) the data packet sending module gives a sequence number to the data packet to be sent, copies the data packet to a local sending cache region and adds the data packet to a sending queue; 3) and if the confirmation packet is not received within the specified time, copying the data packet in the buffer area, and pushing the data packet into a data packet sending module.
2. In the process of receiving the data packet and sending the confirmation packet, after the routing node receives the data packet, if the purpose of the data packet is local, feeding back the confirmation packet, and ending the process; and if the destination of the data packet is not local, feeding back an acknowledgement packet and forwarding the data packet.
The preferred embodiment of the data packet receiving and acknowledgement packet sending process is as follows: 1) taking out the data packet from the receiving queue, and delivering the data packet to a unicast packet processing module after classification; 2) in the unicast packet processing module, separating the data packet from the acknowledgement packet, and classifying the destination address of the data packet; 3) if the destination of the data packet is local, the data packet is sent to a network layer interface module for receiving, and a confirmation packet is sent to indicate that the data packet is received, so that the process is ended; if the destination of the data packet is not local, firstly sending a confirmation packet to indicate the receipt, then handing the confirmation packet to a forwarding addressing module, and entering a data packet forwarding process.
The wireless routing method provided by the embodiment of the invention mainly aims at the data packet of the data to be transmitted, and also comprises the control packet of the information required by the protocol operation in the actual transmission, the data packet and the control packet can be distinguished by the distributor, the data packet can be sent to the unicast message processing module for subsequent processing, and the control packet is sent to the control packet processing module for final subsequent processing.
3. In the process of forwarding the data packet, the routing node sends the data packet to a local cache region and forwards the data packet to the next routing node; and if the confirmation packet is not received within the specified time, forwarding the data packet in the cache region to the next routing node again.
The preferred embodiment of the packet forwarding process is as follows: 1) sending the data packet into a forwarding addressing module, finding the most suitable next hop address, and sending the address into a data packet sending module; 2) the data packet sending module gives a sequence number to the data packet to be sent, copies the data packet to a local sending cache region and adds the data packet into a sending queue; 3) and if the confirmation packet is not received within the specified time, copying the data packet corresponding to the cache region, and pushing the data packet into the data packet sending module.
4. And in the process of confirming the packet receiving, judging whether to delete the corresponding data packet in the buffer area according to whether the sequence number of the confirmation packet is correct or not, and then discarding the confirmation packet.
The preferred embodiment of the acknowledgement packet reception process is as follows: 1) taking out the data packet from the receiving queue, and delivering the data packet to a unicast packet processing module after classification; 2) in the unicast packet processing module, separating the data packet from the acknowledgement packet, and sending the acknowledgement packet to the acknowledgement packet processing module; 3) in the acknowledgement packet processing module, extracting the serial number of the acknowledgement packet, and judging whether to delete the corresponding data packet in the cache region; namely: if the serial number is correct, deleting the cache, otherwise, keeping the cache; 4) after processing, the acknowledgement packet is discarded.
In the above-mentioned solution of the embodiment of the present invention, the transmission of the data packet on the link layer adopts a hop-by-hop acknowledgement manner, so that the data packet lost in the transmission process does not need to be retransmitted from the source node any more, thereby reducing the time delay caused by packet loss retransmission in the network with poor link quality. The router ensures end-to-end reliable data transmission and improves the network transmission efficiency through the hop-by-hop confirmed transmission mechanism.
For ease of understanding, the following description is made in connection with two examples.
Example one: as shown in fig. 2, a data packet transmitted from a server to a client needs to pass through a five-hop router. Each router between the data packet and the server has a buffer area, that is, when the data packet is transmitted, whether packet loss occurs or not can be confirmed hop by hop. And if packet loss occurs, copying the corresponding data packet from the buffer area for retransmission.
Example two, fig. 3 illustrates the steps of data transmission from router 1 to router 3: firstly, the router 1 puts the data packet into a local cache region and sends the data packet to the router 2; the router 2 sends a confirmation packet to the router 1; the router 2 puts the data packet into a local cache area; the router 2 fails to forward the data packet to the router 3; router 2 fails to receive the acknowledgement packet within the specified time; sixthly, the router 2 copies the data packet which fails to be sent out from the local cache region and then forwards the data packet again; seventhly, the router 3 successfully receives the data packet and sends an acknowledgement packet to the router 2; and the router 2 deletes the data packet which is confirmed to be successfully sent in the local cache region.
According to the scheme of the embodiment of the invention, under the environment of poor link condition, a hop-by-hop confirmation processing mechanism is adopted for data packet transmission, so that the time delay caused by packet loss in the data transmission process can be effectively reduced, and the stability and the transmission efficiency of the network are improved.
Through the above description of the embodiments, it is clear to those skilled in the art that the above embodiments can be implemented by software, and can also be implemented by software plus a necessary general hardware platform. With this understanding, the technical solutions of the embodiments can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.), and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods according to the embodiments of the present invention.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (4)
1. A wireless routing method with a hop-by-hop acknowledgement mechanism, comprising: sending a local data packet, receiving the data packet, sending a confirmation packet, forwarding the data packet and receiving the confirmation packet; wherein:
in the process of sending the local data packet, the routing node sends the data packet to be sent to a local cache region and then sends the data packet to a next routing node; if the confirmation packet is not received within the specified time, the data packet in the cache region is sent to the next routing node again;
in the process of receiving the data packet and sending the confirmation packet, after the routing node receives the data packet, if the purpose of the data packet is local, feeding back the confirmation packet, and ending the process; if the purpose of the data packet is not local, feeding back a confirmation packet and forwarding the data packet;
in the process of forwarding the data packet, the routing node sends the data packet to a local cache region and forwards the data packet to the next routing node; if the confirmation packet is not received within the specified time, the data packet in the cache region is forwarded to the next routing node again;
in the process of confirming packet receiving, whether the corresponding data packet in the cache region is to be deleted is judged according to whether the sequence number of the confirmation packet is correct or not, and then the confirmation packet is discarded;
the data packet receiving and acknowledgement packet sending process comprises the following steps: taking out the data packet from the receiving queue, and delivering the data packet to a unicast packet processing module after classification; in the unicast packet processing module, separating the data packet from the acknowledgement packet, and classifying the destination address of the data packet; if the destination of the data packet is local, the data packet is sent to a network layer interface module for receiving, and a confirmation packet is sent to indicate that the data packet is received, so that the process is ended; if the destination of the data packet is not local, firstly sending a confirmation packet to indicate the receipt, then handing the confirmation packet to a forwarding addressing module, and entering a data packet forwarding process.
2. The wireless routing method with hop-by-hop acknowledgement mechanism according to claim 1, wherein the local packet sending procedure comprises:
packaging a data packet to be sent and sending the data packet to a data packet sending module; the data packet sending module gives a sequence number to the data packet to be sent, copies the data packet to a local sending cache region and adds the data packet to a sending queue; and if the confirmation packet is not received within the specified time, copying the data packet in the buffer area, and pushing the data packet into a data packet sending module.
3. The wireless routing method with hop-by-hop acknowledgement mechanism according to claim 1, wherein the packet forwarding procedure comprises:
sending the data packet into a forwarding addressing module, finding the most suitable next hop address, and sending the address into a data packet sending module; the data packet sending module gives a sequence number to the data packet to be sent, copies the data packet to a local sending cache region and adds the data packet into a sending queue; and if the confirmation packet is not received within the specified time, copying the data packet corresponding to the cache region, and pushing the data packet into the data packet sending module.
4. The wireless routing method with hop-by-hop acknowledgement mechanism according to claim 1, wherein the acknowledgement packet reception procedure comprises:
taking out the data packet from the receiving queue, and delivering the data packet to a unicast packet processing module after classification; in the unicast packet processing module, separating the data packet from the acknowledgement packet, and sending the acknowledgement packet to the acknowledgement packet processing module; in the acknowledgement packet processing module, extracting the serial number of the acknowledgement packet, and judging whether to delete the corresponding data packet in the cache region; after processing, the acknowledgement packet is discarded.
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 CN109041156A (en) | 2018-12-18 |
| CN109041156B true 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) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600312B (en) * | 2019-01-04 | 2021-03-12 | 南京邮电大学 | BATMAN-Adv protocol optimization design method for intelligent terminal ad hoc network |
| CN110830472B (en) * | 2019-11-07 | 2021-09-24 | 西北工业大学 | 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 |
| CN113141308B (en) * | 2021-06-21 | 2021-09-14 | 之江实验室 | Lightweight wired Mesh networking design method |
| CN113438058B (en) * | 2021-06-22 | 2022-11-25 | 中国科学院计算机网络信息中心 | Data transmission method, device, network relay equipment and system |
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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109041156A (en) | 2018-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109041156B (en) | Wireless routing method with hop-by-hop acknowledgement mechanism | |
| Tran et al. | Congestion adaptive routing in mobile ad hoc networks | |
| KR102615567B1 (en) | Information transmission methods and devices | |
| US7054271B2 (en) | Wireless network system and method for providing same | |
| WO2021027860A1 (en) | Routing method, bsr generation method, apparatus, and storage medium | |
| US9686733B2 (en) | Communication method in a wireless telecommunications network, associated computer program and wireless communication node | |
| Tran et al. | Routing with congestion awareness and adaptivity in mobile ad hoc networks | |
| CN113518405A (en) | Mesh network system | |
| CN111131179B (en) | Service processing method, device, network equipment and storage medium | |
| CN113727415B (en) | Method for improving AODV routing protocol by dynamically perceived unmanned aerial vehicle ad hoc network | |
| CN108616465B (en) | Routing method of mobile self-organizing network supporting carrying store-and-forward mechanism | |
| Zeng et al. | Dynamic segmented network coding for reliable data dissemination in delay tolerant networks | |
| US7827243B2 (en) | Method for transmitting file based on multiplex forwarder | |
| CN116709592A (en) | Data transmission method and system based on MESH ad hoc network content sharing | |
| Raghavendra et al. | Congestion adaptive routing in ad hoc networks | |
| CN116264724A (en) | Method and device for routing data packets in wireless mesh network and readable medium thereof | |
| CN107959956A (en) | A kind of WIA-PA network packet aggregation method based on radio channel state | |
| Zhang et al. | Network coding for applications in the delay tolerant network (dtn) | |
| Pestin et al. | Protocol for Multipath Routing of Traffic in Wireless Ad-Hoc Networks Based on the Status of Channels and Network Nodes | |
| CN109348492B (en) | MAC layer transmission protocol design method with limited control overhead | |
| CN114302473B (en) | Energy perception routing method oriented to delay tolerant network | |
| Dinesh et al. | Ultimate Video Spreading With Qos over Wireless Network Using Selective Repeat Algorithm | |
| Ishibayashi et al. | A Message Transmission Method Based on Gossip Protocol and Anti-Packets in DTN Environment | |
| WO2023019527A1 (en) | Communication apparatus and method for radio link failure | |
| US11431622B2 (en) | Device and method for increasing reliability of downlink traffic to mobile devices in RPL environment |
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 |