An adaptive forwarding area mechanism implementation method based on beaconless forwarding technology

Abstract

The application discloses a kind of adaptive forwarding area mechanism implementation method based on beaconless forwarding technology, designs a kind of adaptive forwarding area mechanism based on beaconless forwarding technology, first to the same level node analysis in forwarding area, according to area classification, and judge whether multiple nodes exist in the same level forwarding area condition, then the multiple same level nodes in the same level area are classified again, and finally the node after secondary classification is adjusted DFD delay, to realize the adaptive adjustment of forwarding area.The method of the application can effectively avoid the collision when multiple same level nodes are located in the same level and are hidden stations, reduce the overhead caused by data duplication, and realize lightweight forwarding.

Description

Technical Field

[0001] This invention belongs to the field of network protocol technology, specifically relating to an implementation method of an adaptive forwarding region mechanism based on beaconless forwarding technology. Background Technology

[0002] In wireless communication networks, beaconless forwarding based on location is a primary message transmission strategy. In this strategy, the sending node broadcasts its message, while the forwarding node sets its dynamic forward delay (DFD) according to its own priority and responds accordingly. However, this strategy has certain limitations. Since each node only records the location information of its neighbors, the problem of hidden nodes may arise.

[0003] More specifically, a situation might arise where there are only two nodes in the forwarding zone, both at the same priority level and acting as hidden nodes for each other. In this case, because the two nodes are unaware of each other's presence, they cannot avoid collisions through interaction. This could not only lead to packet loss or duplication but also further increase network overhead and transmission latency.

[0004] This situation reveals the limitations of beaconless forwarding technology based on geographic location in handling highly dynamic network environments, especially in cases of complex network topologies or low node density. Therefore, it is necessary to investigate more effective methods to optimize node selection and information propagation, thereby improving the performance and reliability of beaconless forwarding technology in highly dynamic network environments. However, current research has not provided a complete solution to this problem. Summary of the Invention

[0005] To address the aforementioned technical problems, this invention proposes an adaptive forwarding region mechanism implementation method based on beaconless forwarding technology. By designing an adaptive forwarding region mechanism, the forwarding region is adaptively adjusted to reduce the overhead caused by data duplication and achieve lightweight forwarding.

[0006] The technical solution adopted in this invention is: an implementation method for an adaptive forwarding region mechanism based on beacon-free forwarding technology, the specific steps of which are as follows:

[0007] S1. Analyze the nodes of the same level within the forwarding area, classify them by region, and determine whether there are multiple nodes appearing in the same level forwarding area;

[0008] S2. Based on step S1, perform secondary forwarding area classification for multiple peer nodes within the same level area;

[0009] S3. Based on step S2, perform DFD delay adjustment on the nodes after secondary classification to achieve adaptive adjustment of the forwarding area.

[0010] Furthermore, step S1 is specifically as follows:

[0011] To perform beaconless forwarding, the forwarding area is first determined, and the candidate nodes within the forwarding area are sorted and classified.

[0012] A progress-based discrete mapping method is adopted, where R represents the communication radius of a node. The destination node D is positioned directly to the right of the sending node S, and only the forwarding region to the right of the sending node is considered. The forwarding region of S is divided into n sub-regions of width R / n according to the progress, numbered A1 to A2 in descending order of progress. n .

[0013] Here, 1 to n represent the sub-regions from high to low levels, and the above steps are used to sort and classify the candidate nodes.

[0014] Then, data forwarding is performed. Before data forwarding, the sending node calculates the progress and angle of each node within its neighbor range. Then, it calculates the sub-region level of each candidate node in the forwarding area. If multiple nodes are located in the same positive region at the same level, the sub-regions at their respective levels need to be classified a second time.

[0015] The angle refers to the angle between the line connecting the sending node and the candidate node and the vertical direction.

[0016] Furthermore, step S2 is specifically as follows:

[0017] Based on step S1, if there are only two candidate nodes in the forwarding area, and they fall into the same sub-area, then the two nodes in this area are further classified. The secondary classification is based on the progress and angle between the peer node and the sending node, as follows:

[0018] Dividing the area into upper and lower regions using the angle bisector of the angle between the two nodes as the boundary, with the upper region having higher priority, the sending node S calculates the progress and angle of the nodes within its neighboring range and divides the area into sub-regions. It is found that node 1 and node 2 are both located in sub-region A2, with node 1 making an angle θ1 with the vertical direction and node 2 making an angle θ2 with the vertical direction. Therefore, the dividing angle is:

[0019]

[0020] Based on this dividing angle, the angle bisector is determined, and nodes 1 and 2 are divided into different position areas according to the angle bisector. The upper half of the area where node 1 is located has a higher priority than the lower half of the area where node 2 is located.

[0021] If k candidate nodes are in the same sub-region (k>2), then the above operation is performed between two candidate nodes in a counter-clockwise order, and the region is divided k-1 times to obtain k divided regions.

[0022] Furthermore, step S3 is specifically as follows:

[0023] Based on step S2, after completing the secondary classification of peer nodes, the new region allocation is sent to candidate nodes. The candidate nodes adjust their own DFD latency according to the new classification results to achieve adaptive adjustment of the forwarding region, as follows:

[0024] The sending node prepares to forward information by including the partitioning information in the packet header and broadcasting it to candidate nodes. Upon receiving the broadcast information, candidate nodes calculate their own forwarding region priority and DFD delay, and adjust their DFD delay based on their forwarding priority and the received information. After completing the DFD delay adjustment, candidate nodes will re-compete for forwarding based on the adjusted DFD delay, thus achieving adaptive adjustment of the forwarding region and ensuring the adaptive forwarding region mechanism correctly fulfills its function.

[0025] Furthermore, in step S3, the adaptive forwarding region mechanism designs a unique message interaction format that is compatible with the complete lightweight interaction mechanism, and the adaptive forwarding region mechanism only uses the message header content, as detailed below:

[0026] The message header content includes:

[0027] Version: Protocol version field. When the value of this field is 2, it indicates that the adaptive forwarding zone mechanism is used.

[0028] Packet type: Indicates different packet types, namely data packets, address request packets, address reply packets, beacon request packets, and beacons;

[0029] Sequence number: A unique numerical sequence number that identifies a data packet; when used in conjunction with the source address, it enables better identification.

[0030] Backup distance: This field indicates the distance from the node where greedy routing failed to the target, helping to determine when to switch back to greedy routing from recovery mode;

[0031] Previous location, Source location, Destination location: These indicate the geographical locations of the sending node, source node, and destination node, respectively, and are used to calculate the DFD latency;

[0032] Adaptation reserve_1 and Adaptation reserve_2 are used for the adaptive forwarding region mechanism to achieve adaptive functionality. The level of the region to be divided is written in Adaptation reserve_1, and the angle of division is written in Adaptation reserve_2, providing a standard for candidate nodes to adjust DFD latency.

[0033] Checksum: Used to check for errors in the message header. The calculation method is the same as IP. The message header is added in 16-bit increments, the carry-over of the result is added to the lower 16 bits, and then the result is inverted.

[0034] Furthermore, in step S3, when performing DFD delay adjustment, it is first necessary to prepare the message information, as follows:

[0035] First, the Version field in the packet header is set to 2, indicating the use of the adaptive forwarding region mechanism. Second, the level of the region to be divided is written to the Adaptation reserve_1 field in the packet header, and the angle of division is written to the Adaptationreserve_2 field, serving as the standard for forwarding region classification. After the packet information is prepared, the sending node broadcasts the information to all candidate nodes.

[0036] After receiving the information, the candidate node first calculates the original DFD delay according to the formula:

[0037] DFD=(CSA×T delay )+random(T delay )

[0038] Where CSA represents the level of the sub-region where the candidate node is located, and its value ranges from 0 to n; T delay This represents the interval between adjacent DFD delay levels, and is associated with the interaction protocol used; random(T) delay () indicates that a random value is selected from 0 to the value inside the parentheses.

[0039] Furthermore, in step S3, after the candidate node completes its own DFD delay calculation, the candidate node needs to adjust the delay according to the broadcast information of the sending node, as follows:

[0040] (1) If the level is higher than the level of the forwarding area, the DFD delay setting is not affected;

[0041] (2) If it is in the divided forwarding area and is located in the upper half area after angle comparison, the DFD delay setting is not affected;

[0042] (3) If it is located in the lower half of the divided forwarding area, the DFD delay needs to be increased by one level, that is, by one T. delay length;

[0043] (4) If the level is lower than the level of the assigned forwarding area, the DFD latency also needs to be increased by one T. delay length.

[0044] When there are k sibling nodes (k>2), k-1 sibling node partitionings will be performed, and k-1 DFD delay adjustments will be made.

[0045] The beneficial effects of this invention are as follows: The method of this invention designs an adaptive forwarding region mechanism based on beaconless forwarding technology. First, it analyzes peer nodes within the forwarding region, classifies them by region, and determines whether multiple nodes appear in the same forwarding region. Then, it performs a secondary forwarding region classification on multiple peer nodes within the same region. Finally, it performs DFD delay adjustment on the nodes after the secondary classification, achieving adaptive adjustment of the forwarding region. By implementing the adaptive forwarding region mechanism, the method of this invention can effectively avoid collisions when multiple peer nodes are located at the same level and act as covert stations for each other, reducing the overhead caused by data duplication and achieving lightweight forwarding. Attached Figure Description

[0046] Figure 1 This is a flowchart of an adaptive forwarding region mechanism implementation method based on beaconless forwarding technology according to the present invention.

[0047] Figure 2 This is a schematic diagram illustrating the analysis of sibling nodes in the forwarding region in an embodiment of the present invention.

[0048] Figure 3 This is a schematic diagram of the secondary hierarchical classification of the forwarding area of ​​the same level node in an embodiment of the present invention.

[0049] Figure 4 This is a flowchart of the DFD delay adjustment process in an embodiment of the present invention.

[0050] Figure 5 This is a schematic diagram of the format of the interactive message header used by the adaptive forwarding region mechanism in this embodiment of the invention. Detailed Implementation

[0051] The method of the present invention will be further described below with reference to the accompanying drawings and embodiments.

[0052] like Figure 1 The flowchart shown illustrates an adaptive forwarding region mechanism implementation method based on beacon-free forwarding technology according to the present invention. The specific steps are as follows:

[0053] S1. Analyze the nodes of the same level within the forwarding area, classify them by region, and determine whether there are multiple nodes appearing in the same level forwarding area;

[0054] S2. Based on step S1, perform secondary forwarding area classification for multiple peer nodes within the same level area;

[0055] S3. Based on step S2, perform DFD delay adjustment on the nodes after secondary classification to achieve adaptive adjustment of the forwarding area.

[0056] In this embodiment, step S1 is specifically as follows:

[0057] To perform beaconless forwarding, the forwarding area is first determined, and the candidate nodes within the forwarding area are sorted and classified.

[0058] like Figure 2 As shown, this embodiment employs a progress-based discrete mapping method. In the figure, R represents the communication radius of a node. The destination node D is positioned directly to the right of the sending node S, and only the forwarding region to the right of the sending node is considered. The forwarding region of S is divided into n sub-regions of width R / n according to the progress, numbered A1 to A2 according to the progress from largest to smallest. n Here, 1 to n represent the sub-region levels from high to low. The higher the sub-region level of a candidate node, the shorter the DFD latency, allowing it to respond with an ACK (Acknowledgement) earlier and making it more likely to become a forwarding node. The above steps are used to sort and classify candidate nodes.

[0059] Then, data forwarding is performed. Before data forwarding, the sending node calculates the progress and angle of each node within its neighbor range. Then, it calculates the sub-region level of each candidate node in the forwarding area. If multiple nodes are located in the same positive region at the same level, the sub-regions at their respective levels need to be classified a second time.

[0060] The angle refers to the angle between the line connecting the sending node and the candidate node and the vertical direction.

[0061] In this embodiment, step S2 is specifically as follows:

[0062] like Figure 3 As shown, based on step S1, in the forwarding area, there may be a situation where there are only two candidate nodes in the forwarding area, and they fall into the same sub-area. Therefore, it is necessary to perform secondary classification on the two nodes in this area. At this time, the progress and angle between the peer node and the sending node need to be used as the basis for secondary classification, as follows:

[0063] Divide the area into upper and lower regions using the angle bisectors of the angles at the two nodes as boundaries, with the upper region having higher priority. Figure 3 As shown, the sending node S calculates the progress and angle of the nodes within its neighboring range and divides the region into sub-regions. It is found that node 1 and node 2 are both located in sub-region A2, and the angle between node 1 and the vertical direction is θ1, while the angle between node 2 and the vertical direction is θ2. Therefore, the boundary angle is:

[0064]

[0065] Based on this dividing angle, the angle bisector is determined, and nodes 1 and 2 are divided into different position areas according to the angle bisector. The upper half of the area where node 1 is located has a higher priority than the lower half of the area where node 2 is located.

[0066] If k candidate nodes are in the same sub-region (k>2), then the above operation is performed between two candidate nodes in a counter-clockwise order, and the region is divided k-1 times to obtain k divided regions.

[0067] In this embodiment, step S3 is specifically as follows:

[0068] like Figure 4 As shown, based on step S2, after completing the secondary classification of peer nodes, the new region allocation is sent to candidate nodes. The candidate nodes adjust their own DFD latency according to the new classification results to achieve adaptive adjustment of the forwarding region, as detailed below:

[0069] The sending node prepares to forward information by including the partitioning information in the packet header and broadcasting it to candidate nodes. Upon receiving the broadcast information, candidate nodes calculate their own forwarding region priority and DFD delay, and adjust their DFD delay based on their forwarding priority and the received information. After completing the DFD delay adjustment, candidate nodes will re-compete for forwarding based on the adjusted DFD delay, thus achieving adaptive adjustment of the forwarding region and ensuring the adaptive forwarding region mechanism correctly fulfills its function.

[0070] like Figure 5 As shown, in this embodiment, in step S3, the adaptive forwarding region mechanism designs a unique message interaction format that is compatible with the complete lightweight interaction mechanism, and the adaptive forwarding region mechanism only uses the message header content, as detailed below:

[0071] The message header content includes:

[0072] Version: Protocol version field. When the field value is 2, it indicates that the adaptive forwarding zone mechanism is used.

[0073] Packet type: Indicates different packet types, namely data packets, address request packets, address reply packets, beacon request packets, and beacons.

[0074] Sequence number: A unique identifier for a data packet using a numerical sequence number. It can be used in conjunction with the source address for better identification.

[0075] Backup distance: This field indicates the distance from the node where greedy routing failed to the target, helping to determine when to switch back to greedy routing from recovery mode.

[0076] Previous location, Source location, Destination location: These indicate the geographical locations of the sending node, source node, and destination node, respectively, and are used to calculate the DFD latency.

[0077] Adaptation reserve_1 and Adaptation reserve_2 are used for the adaptive forwarding region mechanism to achieve adaptive functionality. Adaptation reserve_1 contains the level of the divided region, and Adaptation reserve_2 contains the division angle, providing a standard for candidate nodes to adjust DFD latency.

[0078] Checksum: Used to check for errors in the message header. The calculation method is the same as IP. The message header is added in 16-bit increments, the carry-over of the result is added to the lower 16 bits, and then the result is inverted.

[0079] In this embodiment, when performing DFD delay adjustment in step S3, it is first necessary to prepare the message information, as follows:

[0080] First, the Version field in the packet header is set to 2, indicating the use of the adaptive forwarding region mechanism. Second, the level of the region to be divided is written to the Adaptation reserve_1 field in the packet header, and the angle of division is written to the Adaptationreserve_2 field, serving as the standard for forwarding region classification. After the packet information is prepared, the sending node broadcasts the information to all candidate nodes.

[0081] After receiving the information, the candidate node first calculates the original DFD delay according to the formula:

[0082] DFD=(CSA×T delay )+random(T delay )

[0083] Where CSA represents the level of the sub-region where the candidate node is located, and its value ranges from 0 to n; T delay This represents the interval between adjacent DFD delay levels, and is associated with the interaction protocol used; random(T) delay The parentheses indicate that a random value is selected from 0 to the value within the parentheses. This random value is set to avoid possible collisions within the same level.

[0084] In this embodiment, in step S3, after the candidate node completes its own DFD delay calculation, the candidate node needs to adjust the delay according to the broadcast information of the sending node, as follows:

[0085] (1) If the level is higher than the level of the forwarding area being divided, the DFD delay setting is not affected, such as Figure 3 Nodes within region A1;

[0086] (2) If the device is within the assigned forwarding area and, based on angle comparison, is located in the upper half of the area, then the DFD delay setting is unaffected. Figure 3 Middle node 1;

[0087] (3) If it is located in the lower half of the divided forwarding area, the DFD delay needs to be increased by one level, that is, by one T. delay Length, such as Figure 3 Middle node 2;

[0088] (4) If the level is lower than the level of the assigned forwarding area, the DFD latency also needs to be increased by one T. delay Length, such as Figure 3 China A n Nodes within the region.

[0089] Similarly, when there are k sibling nodes (k>2), k-1 sibling node partitioning will be performed, and k-1 DFD delay adjustments will also be required.

[0090] In summary, this invention proposes an adaptive forwarding region mechanism based on beaconless forwarding technology. It designs three aspects: analysis of peer nodes within the forwarding region, secondary classification of forwarding regions for peer nodes, and adjustment of dynamic forwarding delay (DFD). When preparing to forward, the system first classifies its own forwarding region to determine if multiple nodes exist within the same level of the forwarding region. If so, a secondary classification is needed for the forwarding regions containing multiple peer nodes. After the secondary classification, the affected nodes' levels and DFD delays are adjusted. This invention, through its adaptive forwarding region mechanism, effectively avoids collisions when multiple peer nodes are at the same level and act as covert stations, reducing the overhead caused by data duplication and achieving lightweight forwarding.

[0091] Those skilled in the art will recognize that the embodiments described herein are intended to help the reader understand the principles of the invention, and should be understood that the scope of protection of the invention is not limited to such specific statements and embodiments. Those skilled in the art can make various other specific modifications and combinations based on the technical teachings disclosed in this invention without departing from the spirit of the invention, and these modifications and combinations are still within the scope of protection of this invention.

Claims

1. A method for implementing an adaptive forwarding region mechanism based on beacon-free forwarding technology, the specific steps of which are as follows: S1. Analyze the nodes of the same level within the forwarding area, classify them by region, and determine whether there are multiple nodes appearing in the same level forwarding area; S2. Based on step S1, perform secondary forwarding area classification for multiple peer nodes within the same level area; S3. Based on step S2, perform DFD delay adjustment on the nodes after secondary classification to achieve adaptive adjustment of the forwarding area; The specific steps of S1 are as follows: To perform beaconless forwarding, the forwarding area is first determined, and the candidate nodes within the forwarding area are sorted and classified. A progress-based discrete mapping method is adopted, where R represents the communication radius of a node. The destination node D is positioned directly to the right of the sending node S, and only the forwarding region to the right of the sending node is considered. The forwarding region of S is divided into n sub-regions of width R / n according to the progress, numbered A1 to A2 according to the progress from largest to smallest. n ; in, 1 to n represent the levels of the sub-regions from high to low. The above steps are used to sort and classify the candidate nodes. Then data forwarding is performed. Before data forwarding, the sending node calculates the progress and angle of each node within its neighbor range. Then it calculates the sub-region level of each candidate node in the forwarding area. If there are multiple nodes in the same positive region, the sub-regions of their respective levels need to be classified a second time. Wherein, the angle refers to the angle between the line connecting the sending node and the candidate node and the vertical direction; Step S2 is as follows: Based on step S1, if there are only two candidate nodes in the forwarding area, and they fall into the same sub-area, then the two nodes in this area are further classified. The secondary classification is based on the progress and angle between the peer node and the sending node, as follows: Dividing the area into upper and lower regions using the angle bisector of the angle between the two nodes as the boundary, with the upper region having higher priority, the sending node S calculates the progress and angle of the nodes within its neighboring range and divides the area into sub-regions. It is found that node 1 and node 2 are both located in sub-region A2, with node 1 making an angle θ1 with the vertical direction and node 2 making an angle θ2 with the vertical direction. Therefore, the dividing angle is: Based on this dividing angle, the angle bisector is determined, and node 1 and node 2 are divided into different position areas according to the angle bisector. The upper half of the area where node 1 is located has a higher priority than the lower half of the area where node 2 is located. If k candidate nodes are in the same sub-region, k>2, then the above operation is performed between two candidate nodes in a counterclockwise order, and the region is divided k-1 times to obtain k divided regions. Step S3 is as follows: Based on step S2, after completing the secondary classification of peer nodes, the new region allocation is sent to candidate nodes. The candidate nodes adjust their own DFD latency according to the new classification results to achieve adaptive adjustment of the forwarding region, as follows: The sending node prepares to forward information by loading the partition information into the packet header and broadcasting it to the candidate nodes. After receiving the broadcast information, the candidate nodes calculate their own forwarding area priority and DFD delay, and adjust the DFD delay according to their forwarding priority and received information. After the DFD delay adjustment is completed, the candidate nodes will re-compete for forwarding based on the adjusted DFD delay, thereby realizing the adaptive adjustment of the forwarding area. The adaptive forwarding area mechanism correctly completes its function.

2. The method for implementing an adaptive forwarding region mechanism based on beaconless forwarding technology according to claim 1, characterized in that, In step S3, the adaptive forwarding region mechanism designs a unique message interaction format that is compatible with the complete lightweight interaction mechanism, and the adaptive forwarding region mechanism only uses the message header content, as detailed below: The message header content includes: Version: Protocol version field. When the value of this field is 2, it indicates that the adaptive forwarding zone mechanism is used. Packet type: Indicates different packet types, namely data packets, address request packets, address reply packets, beacon request packets, and beacons; Sequence number: A unique numerical sequence number that identifies a data packet; when used in conjunction with the source address, it enables better identification. Backup distance: This field indicates the distance from the node where greedy routing failed to the target, helping to determine when to switch back to greedy routing from recovery mode; Previous location, Source location, Destination location: These indicate the geographical locations of the sending node, source node, and destination node, respectively, and are used to calculate the DFD latency; Adaptation reserve_1 and Adaptation reserve_2 are used for the adaptive forwarding region mechanism to achieve adaptive functionality. The level of the region to be divided is written in Adaptation reserve_1, and the angle of division is written in Adaptation reserve_2, providing a standard for candidate nodes to adjust DFD latency. Checksum: Used to check for errors in the message header. The calculation method is the same as IP. The message header is added in 16-bit increments, the carry-over of the result is added to the lower 16 bits, and then the result is inverted.

3. The method for implementing an adaptive forwarding region mechanism based on beaconless forwarding technology according to claim 1, characterized in that, In step S3, when performing DFD delay adjustment, it is first necessary to prepare the message information, as follows: First, the Version field in the packet header is set to 2, indicating that the adaptive forwarding region mechanism is used; second, the level of the region to be divided is written into the Adaptation reserve_1 field in the packet header, and the angle of division is written into the Adaptationreserve_2 field, which serve as the standard for the classification of forwarding regions; after the packet information is prepared, the sending node broadcasts the information to all candidate nodes. After receiving the information, the candidate node first calculates the original DFD delay according to the formula: DFD=(CSA×T delay )+random(T delay ) Where CSA represents the level of the sub-region where the candidate node is located, and its value ranges from 0 to n; T delay This represents the interval between adjacent DFD delay levels, and is associated with the interaction protocol used; random(T) delay () indicates that a random value is selected from 0 to the value inside the parentheses.

4. The method for implementing an adaptive forwarding region mechanism based on beaconless forwarding technology according to claim 1, characterized in that, In step S3, after the candidate node completes its own DFD delay calculation, the candidate node needs to adjust the delay according to the broadcast information of the sending node, as follows: (1) If the level is higher than the level of the forwarding area, the DFD delay setting is not affected; (2) If it is in the divided forwarding area and is located in the upper half area after angle comparison, the DFD delay setting is not affected; (3) If it is located in the lower half of the divided forwarding area, the DFD delay needs to be increased by one level, that is, by one T. delay length; (4) If the level is lower than the level of the assigned forwarding area, the DFD latency also needs to be increased by one T. delay length; When there are k sibling nodes, k>2, k-1 sibling node partitioning will be performed, and k-1 DFD delay adjustments will be performed.

Images