WO2023273241A1 - Networking communication method and system, and node device, storage medium and electronic device - Google Patents

Abstract

Disclosed in the present application are a networking communication method and system, and a node device, a storage medium and an electronic device. The method comprises: when a message is sent to a second node device in the same network, filling the message with node information from a local routing table of a first node device; and determining a receiving node device according to the node information from the local routing table of the first node device, and sending the message to the receiving node device, so that the receiving node device executes the following operations until the receiving node device is the second node device: when the receiving node device is a third node device in the same network, supplementing the message with node information from a local routing table of the receiving node device, determining the next node device according to the node information from the local routing table of the receiving node device, sending the updated message to the next node device, and determining the next node device as a new receiving node device.

Description

Networking communication method, system, node device, storage medium and electronic device

References to related applications

This disclosure requires the application number of 202110725787.8 submitted to the State Intellectual Property Office of the People's Republic of China on June 29, 2021, and the invention title is "networking communication method, system, node equipment, storage medium and electronic equipment". interests, and the entire contents of which are incorporated into this disclosure by reference.

field

The present disclosure generally relates to the computer field, and more specifically relates to a networking communication method, system, node device, storage medium and electronic device.

background

The walkie-talkie is a common communication device in daily life. During the communication process of the walkie-talkie, because the communication distance of the walkie-talkie is limited, if the distance between the walkie-talkies exceeds the communication distance, the communication cannot be carried out. Therefore, ad hoc networks emerged as the times require. The goal of ad hoc networks is to achieve fast, accurate, and efficient networking. It is required to find accurate and available routing information in the shortest possible time and be able to adapt to rapid changes in network topology.

overview

In related technologies, if an ad hoc network is established, each node in the ad hoc network cannot know the connection relationship of other nodes, and if a key node is disconnected, effective communication cannot be performed.

In a first aspect, the present disclosure relates to a network communication method, which is applied to a first node device, and the method includes: when sending a message to a second node device in the same network, the local route of the first node device Filling the node information in the table into the message; and determining a receiving node device according to the node information in the local routing table of the first node device, and sending the message to the receiving node device, so that the The receiving node device performs the following operations until the receiving node device is the second node device: when the receiving node device is the third node device in the same network, the local routing table of the receiving node device The node information of the received node device is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, the updated message is sent to the next node device, and the The next node device described above is determined as the new receiving node device.

In some implementations, the node information includes adjacent node devices and corresponding hop values, where the hop value is the number of hops from the adjacent node devices to the second node device, according to the first The node information in the local routing table of a node device determines the receiving node device includes: determining the node device with the smallest hop value from the adjacent node devices of the first node device; determining the node device with the smallest hop value from the node device with the smallest hop value determining the node device with the highest signal strength; and determining the determined node device with the highest signal strength as the receiving node device.

In some embodiments, filling the node information of the first node device into the message or supplementing the node information of the receiving node device into the message includes: writing the node information into the In the node information flag bit of the above message.

In some embodiments, the message is a GPS short message, the source address flag and the target address flag in the GPS short message each occupy 1 byte, and the node information flag occupies at most 8 bytes .

In some embodiments, the method further includes: filling the node address of the first node device into the sending address flag of the message, so that the receiving node device Filling the node address of the receiving node device into the receiving address set flag bit of the message to form the transmission path information of the message.

In some embodiments, the networking mode of the networking is narrowband communication ad hoc network.

In some implementations, the narrowband communication ad hoc network includes at least two node devices, each node device sends broadcast tokens in turn, and the node device that receives the broadcast token sends the broadcast token The source address information and the hop value are stored in the local routing table, wherein the hop value is the number of hops from the node device sending the broadcast token to the second node device.

In a second aspect, the present disclosure relates to a network communication method, which is applied to a receiving node device. The method includes: receiving a message sent by a first node device in the same network; the message is sent by the first node device to the same sent by the second node device in the networking, the message includes the node information in the local routing table of the first node device; perform the following operations on the receiving node device until the receiving node device is the first node device Two-node device: when the receiving node device is the third node device in the same network, add the node information in the local routing table of the receiving node device to the message, and according to the information of the receiving node device The node information in the local routing table determines the next node device, and sends the updated message to the next node device, so that the next node device is determined as a new receiving node device.

In some implementations, the node information includes a hop value of an adjacent node, where the hop value is the number of hops from the adjacent node device to the second node device, and the The node information in the local routing table determines the next node device, including: determining the node device with the smallest hop value from the adjacent node devices of the receiving node device; determining the node device with the smallest hop value from the node device with the smallest hop value The node device with the highest signal strength; determining the determined node device with the highest signal strength as the receiving node device.

In some implementations, adding node information in the local routing table of the receiving node device to the message includes: writing the node information into a node information flag bit of the message.

In some embodiments, the message is a GPS short message, the source address flag and the target address flag in the GPS short message each occupy 1 byte, and the node information flag occupies at most 8 bytes .

In some implementations, the message further includes the node address of the first node device in the sending address flag; the method further includes: after receiving the message, sending the node address of the receiving node device to The node address is filled into the receiving address set flag bit of the message to form the transmission path information of the message.

In some embodiments, the networking mode of the networking is narrowband communication ad hoc network.

In some implementations, the narrowband communication ad hoc network includes at least two node devices, each node device sends broadcast tokens in turn, and the node device that receives the broadcast token sends the broadcast token The source address information and the hop value are stored in the local routing table, wherein the hop value is the number of hops from the node device sending the broadcast token to the second node device.

In a third aspect, the present disclosure also relates to a first node device, which includes: a first filling unit configured to, when sending a message to a second node device in the same network, add the local routing table of the first node device to Fill in the node information in the message; and, the determining unit is configured to determine the receiving node device according to the node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations until the receiving node device is the second node device: when the receiving node device is the third node device in the same network, the receiving node device The node information in the local routing table of the receiving node device is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, and the updated message is sent to the next node device device, and determine the next node device as a new receiving node device.

In some implementations, the node information includes adjacent node devices and corresponding hop values, where the hop value is the number of hops from the adjacent node devices to the second node device, and the determining unit includes: The first determination module is configured to determine the node device with the smallest hop value from the adjacent node devices of the first node device; the second determination module is configured to determine the node device with the smallest hop value from the node devices with the smallest hop value a node device with the highest signal strength; and a third determining module configured to determine the determined node device with the highest signal strength as the receiving node device.

In some embodiments, the first node device is further configured to: when filling the node information of the first node device into the message or adding the node information of the receiving node device to the message , write the node information into the node information flag bit of the message.

In some embodiments, the message is a GPS short message, the source address flag and the target address flag in the GPS short message each occupy 1 byte, and the node information flag occupies at most 8 bytes .

In some implementations, the first node device further includes: a second filling unit, configured to fill the node address of the first node into the sending address flag of the message, so that the After receiving the message, the receiving node fills the node address of the receiving node into the receiving address set flag of the message, so as to form the transmission path information of the message.

In some embodiments, the networking mode of the networking is narrowband communication ad hoc network.

In some embodiments, the narrowband communication ad hoc network includes at least two nodes, and each node sends a broadcast token in turn, and the node that receives the broadcast token sends the source address information in the broadcast token to and the hop value are stored in the local routing table, wherein the hop value is the number of hops from the node sending the broadcast token to the second node.

In a fourth aspect, the present disclosure also relates to a receiving node device, which includes: a receiving unit configured to receive a message sent by a first node device in the same network; the message is sent by the first node device to a node in the same network Sent by the second node device, the message includes node information in the local routing table of the first node device; the processing unit is configured to perform the following operations on the receiving node device until the receiving node device is the Second node device: when the receiving node device is the third node device in the same network, add the node information in the local routing table of the receiving node device to the message, and according to the receiving node device The node information in the local routing table determines the next node device, and sends the updated message to the next node device, so that the next node device is determined as a new receiving node device.

In some implementations, the node information includes a hop value of an adjacent node, the hop value is the number of hops from the adjacent node device to the second node device, and the processing unit includes: a first determination A module configured to determine the node device with the smallest hop value from the adjacent node devices of the receiving node device; a second determination module configured to determine the node device with the largest signal strength from the node devices with the smallest hop value A node device; a third determining module configured to determine the determined node device with the highest signal strength as the receiving node device.

In some implementations, the processing unit includes: a writing module configured to write the node information into a node information flag bit of the message.

In some embodiments, the message is a GPS short message, the source address flag and the target address flag in the GPS short message each occupy 1 byte, and the node information flag occupies at most 8 bytes .

In some embodiments, the message further includes the node address of the first node in the sending address flag; the device further includes: a filling unit configured to, after receiving the message, send the The node address of the receiving node is filled into the receiving address set flag bit of the message to form the transmission path information of the message.

In some embodiments, the networking mode of the networking is narrowband communication ad hoc network.

In some embodiments, the narrowband communication ad hoc network includes at least two nodes, and each node sends a broadcast token in turn, and the node that receives the broadcast token sends the source address information in the broadcast token to and the hop value are stored in the local routing table, wherein the hop value is the number of hops from the node sending the broadcast token to the second node.

In a fifth aspect, the present disclosure also relates to a storage medium, in which a computer program is stored, wherein the computer program is configured to execute the networking communication method of the present disclosure when running.

In a sixth aspect, the present disclosure also relates to electronic equipment, which includes a memory and a processor, the memory is configured to store a computer program, and the processor is configured to execute the above-mentioned networking communication method through the computer program.

In a seventh aspect, the present disclosure also relates to a networked communication system, which includes the first node device of the present disclosure and the receiving node device of the present disclosure.

In some embodiments, the present disclosure adopts the method of filling the message with the node information in the local routing table of the first node device when sending the message to the second node device in the same network; and Determine the receiving node device according to the node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations until the receiving node device For the second node device: when the receiving node device is a third node device in the same network, add the node information in the local routing table of the receiving node device to the message, and according to the The method of determining the next node device according to the node information in the local routing table of the receiving node device, sending the updated message to the next node device, and determining the next node device as a new receiving node device , because in the above method, when sending a message between node devices in the same network, the node information of the receiving node device will be written into the message, and the receiving node device will be determined according to the node information in the local routing table, thus The purpose of accurate communication between each node device is realized, and then the technical problem that each node device cannot know the connection relationship of other node devices during the networking communication process and cannot communicate effectively.

Brief description of the drawings

The drawings described here are used to provide a further understanding of the present disclosure, and constitute a part of the present disclosure. The schematic embodiments of the present disclosure and their descriptions are used to explain the present disclosure, and do not constitute improper limitations to the present disclosure. In the attached picture:

FIG. 1 is a flowchart of a networking communication method provided by an embodiment of the present disclosure;

FIG. 2 is a schematic diagram of a network topology of a networking communication method provided by an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of sending a broadcast token in a networking communication method provided by an embodiment of the present disclosure;

FIG. 4 is a schematic diagram of time slots of a networking communication method provided by an embodiment of the present disclosure;

FIG. 5 is a flowchart of a networking communication method provided by an embodiment of the present disclosure;

FIG. 6 is a flowchart of a networking communication method provided by an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of configuring routing information and forwarding information of a networking communication method provided by an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a local routing table of a networking communication method provided by an embodiment of the present disclosure;

FIG. 9 is a flowchart of a networking communication method provided by an embodiment of the present disclosure;

FIG. 10 is a schematic structural diagram of a first node device provided by an embodiment of the present disclosure;

FIG. 11 is a schematic structural diagram of a receiving node device provided by an embodiment of the present disclosure;

FIG. 12 is a schematic structural diagram of a networking communication system provided by an embodiment of the present disclosure; and

Fig. 13 is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure.

detail

In order to enable those skilled in the art to better understand the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only It is an embodiment of a part of the present disclosure, but not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts shall fall within the protection scope of the present disclosure.

It should be noted that the terms "first" and "second" in the specification and claims of the present disclosure and the above drawings are used to distinguish similar objects, but not necessarily used to describe a specific sequence or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having", as well as any variations thereof, are intended to cover a non-exclusive inclusion, for example, a process, method, system, product or device comprising a sequence of steps or elements is not necessarily limited to the expressly listed instead, may include other steps or elements not explicitly listed or inherent to the process, method, product or apparatus.

The present disclosure relates to a networking communication method, which is applied to a first node device, as shown in FIG. 1 , the above method includes:

S102. When sending a message to a second node device in the same network, fill in the node information in the local routing table of the first node device into the message; and

S104. Determine a receiving node device according to the node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations until the receiving The node device is the second node device: when the receiving node device is the third node device in the same network, the node information in the local routing table of the receiving node device is added to the message, and according to The node information in the local routing table of the receiving node device determines the next node device, sends the updated message to the next node device, and determines the next node device as a new receiving node device .

In some embodiments, the same network can be a network formed by multiple mobile communication terminals. Each mobile communication terminal among multiple mobile communication terminals can be used as a node, and its location can be moved. The mobile communication terminal may be a mobile phone, a tablet computer, a walkie-talkie, and the like. The communication distance of the mobile communication terminal is limited, and the distance between two mobile communication terminals is too far, beyond the direct communication distance (the direct communication distance of the walkie-talkie is 5 kilometers), then they can communicate by setting up the same network. It can be understood that, when the first node device can directly send the message to the second node device, the second node device receives the message and acquires the node information in the message.

It should be noted that the first node device is different from the second node device, and the third node device is different from the first node device and the second node device, that is, the first node device, the second node device and the third node device are respectively different node devices.

In some embodiments, a total of 6 walkie-talkies from A to F are taken as an example, as shown in FIG. 2 . Fig. 2 is an optional network topology diagram. In Figure 2, the node device is assumed to be a walkie-talkie, and the circle is the coverage of the walkie-talkie, that is, the effective direct communication distance. B, C, D are within the coverage of A, A, D, E are within the coverage of C, C, D, F are within the coverage of E, E are within the coverage of F, E, F are within the coverage of A out of coverage. There is communication between C and D (not shown in the figure), and communication between C and E (not shown in the figure). The distance between A and F is too far beyond the direct communication distance, therefore, the communication between A and F can be realized through an ad hoc network.

Fig. 3 is a schematic diagram of transmitting broadcast tokens according to time sequence. In FIG. 3 , SLOT1 is time slot 1, and SLOT2 is time slot 2. Node A broadcasts data in time slot 1, sends A's broadcast token in time slot 2, and B, C, D, E, and F all send broadcast tokens in time slot 2. Nodes A to F send broadcast tokens in different time slots 2, and each sending once is a period, so as to realize the networking in this way.

FIG. 4 is a schematic diagram of a node A device broadcasting a GPS short message in time slot 1. FIG. In Figure 4, in time slot 1 of different frames, PRE_CSBK1, PRE_CSBK2, GPS DATA_HEADER, GPS DATA_BLOCK and GPS DATA_Lastblock are broadcast in sequence.

In some embodiments, the message may be a GPS short message, further a GPS short message in the DMR protocol. It can be understood that the message may also be other messages than the GPS short message.

In some embodiments, when communication is performed between the first node device and the second node device, the first node device may send communication data to the second node device through the receiving node device. The first node device may send the location information of the first node device to the second node device. When sending the location information, the node information of the first node device may be filled into the address information, and the message is sent to the receiving node device. The receiving node device fills the node information of the receiving node device into the location information. There may be multiple receiving node devices, and any receiving node device may be used to forward the location information of the first node device. The node address of the receiving node device is filled in the location information, and any receiving node device can be selected to forward the location information. The location information is forwarded by the receiving node device to the second node device.

Through this embodiment, through the above method, it can ensure that each node device can communicate effectively during the communication process, and avoid the problem that each node device cannot know the connection relationship of other nodes and cannot effectively communicate.

In some implementations, the node information includes adjacent node devices and corresponding hop values, where the hop value is the number of hops from the adjacent node devices to the second node device. As shown in FIG. 5, the determining the receiving node device according to the node information in the local routing table of the first node device includes:

S502. Determine the node device with the smallest hop value from the adjacent node devices of the first node device;

S504. Determine the node device with the highest signal strength from the node devices with the smallest hop value; and

S506. Determine the determined node device with the highest signal strength as the receiving node device.

In some embodiments, since the first node device can have multiple adjacent node devices, the node device with the smallest hop value can be determined first, and then the node device with the highest signal strength can be determined as the first node device receiving node device. The above-mentioned hop value indicates the number of hops from the adjacent node device to the second node device. The number of hops refers to the number of forwarding node devices required for a node device to reach a second node device. Node device F to node device A needs to be forwarded by node devices E and D, so the number of hops from node device F to node device A is 2. In some embodiments, the hop value represents the minimum number of hops from the neighboring node device to the second node device. It can be understood that the adjacent node devices are other node devices within the communication coverage of a certain node device. Taking the example in FIG. 2 as an example, the adjacent node devices of node device A are node devices within the coverage of node device A B, C, D, that is, node devices B, C, and D are adjacent node devices of node device A. By using the node device with the smallest hop value and the largest signal strength among adjacent node devices as the receiving node device, it is equivalent to selecting the optimal path for message transmission, and realizing fast and reliable message transmission.

In some embodiments, filling the node information of the first node device into the message or supplementing the node information of the receiving node device into the message includes: writing the node information into the In the node information flag bit of the above message.

In some embodiments, the message is a GPS short message, the source address flag and the target address flag in the GPS short message each occupy 1 byte, and the node information flag occupies at most 8 bytes .

In some embodiments, when the node address is filled in the GPS short message, the GPS short message includes an active address flag and a target address flag, and the source address flag and the target address flag in this embodiment The size of each occupies one byte of the GPS short message, and the node information flag of the node occupies at most 8 bytes of the GPS short message. In the existing GPS short message, in the PRE_CSBK1 of the GPS short message, the source address flag and the target address flag respectively account for 3 bytes, and the source address flag and the target address flag each account for 1 byte in the present embodiment byte, in the PRE_CSBK1 of the GPS short message, the source address flag and the target address flag each occupy 3 bytes, and in the present embodiment, the source address flag and the target address flag each occupy 1 byte, and the remaining 8 One or more bytes can be arbitrarily selected to record node information, that is, as a node information flag. In the specific implementation, 8 bytes can be fully utilized, and 2 bytes are used as a group to record the node addresses of the two adjacent node devices with the highest signal strength under the corresponding hop value. For example, the first 2 bytes in PRE_CSBK1 are used as The node address flag bits of two node devices with high signal strength with a hop count of 1, the last 2 bytes in PRE_CSBK1 are used as the node address flag bits of two node devices with a high signal strength with a hop count of 2, occupying a total of 4 byte; the first 2 bytes in PRE_CSBK2 in the GPS short message are used as the node address flags of two node devices with high signal strength with a hop count of 3, and the last 2 bytes in PRE_CSBK2 are used as the two node devices with a hop count of 4 The node address flag bit of the node device with high signal strength occupies 4 bytes in total. Through the above method, the record of the node information is realized, and the routing information of the previous node device (sending node device) can be obtained when the GPS short message is transmitted.

In some embodiments, as shown in Figure 6, the above method also includes:

S602. Fill the node address of the first node device into the sending address flag of the message, so that the receiving node device fills in the node address of the receiving node device after receiving the message into the receiving address set flag bit of the message to form the transmission path information of the message.

In some embodiments, the node address of the first node device may be filled in the sending address flag of the message, and the node address of the receiving node device may be filled in the receiving address set flag of the message. The address information filled in the receiving address set flag bit of the message forms the transmission path information of the message. As an optional example, the networking manner of the networking is a narrowband communication ad hoc network.

In some embodiments, communication between the walkie-talkies is achieved through a narrowband communication ad hoc network.

In some implementations, the narrowband communication ad hoc network includes at least two node devices, each node device sends broadcast tokens in turn, and the node device that receives the broadcast token sends the broadcast token The source address information and the hop value are stored in the local routing table, wherein the hop value is the number of hops from the node device sending the broadcast token to the second node device.

The description will be made in conjunction with the network topology in FIG. 2 above. Six nodes from A to F form an ad hoc network. Among the six nodes, node A can communicate with node E and node F. Since the distance between A and E or between A and F is too far beyond the direct communication distance, it can be forwarded through other nodes. In this embodiment, the communication information may be a Global Positioning System (Global Positioning System, GPS for short) short message. Define PRE_CSBK frame to deliver local route when transmitting GPS short message. This embodiment defines the first PRE_CSBK frame (PRE_CSBK_1), including Target address (target address), Source address (source address), Jump 1 (the node address of the node whose jump value is 1), Jump 2 (the jump value is 2 The node address of the node), define the second PRE_CSBK frame (PRE_CSBK_2), including Target address (target address), Source address (source address), Jump 3 (the node address of the node whose jump value is 3), Jump 4 ( The node address of the node whose hop value is 4). In the DMR protocol, the length of the Target address and the Source address is 3 bytes. In this embodiment, there is only one byte (the number of nodes in the group is controlled at <256), and the 4 bytes that are vacated are used for Fill in the Jump address. In addition, when transferring GPS short messages, this embodiment defines DATA_HEADER to transfer the forwarding relationship. This embodiment defines the Forward Num field position in the DATA_HEADER as the number of forwarding times; the length of Destination (target address) and Source address (source address) is defined as one byte (the number of nodes in the group is controlled at <256), and the empty ones The 4 bytes are used to fill in the Jump address. In a specific implementation manner, the 4 bytes are used to sequentially record the node addresses of the forwarding receiving nodes.

Table 1 is a table for configuring PRE_CSBK_1 in this embodiment. As shown in Table 1, the length of the target address Target address and the source address Source address is one byte, that is, 8 bits, and the next 4 bytes are respectively filled with the node addresses of the two nodes with the highest signal strength in the first hop Jump1 and the node addresses of the two nodes with the highest signal strength of the second jump Jump2. Here, the source address is F as an example.

Table 1

Table 2 is a table for configuring PRE_CSBK_2 in this embodiment. As shown in Table 2, the length of the target address Target address and the source address Source address is one byte, namely 8 bits, and the remaining 4 bytes are respectively filled in the node addresses and The node addresses of the two nodes with the highest signal strength in the second hop Jump3. Here, the source address is F as an example.

Table 2

Tables 3 to 5 are tables for configuring the DATA_HEADER of node F, node E, and node D in this embodiment. In this example, the source address is F as an example, indicating that the message of node F is forwarded through node E and node D in turn. As shown in Table 3, Destination and Source are each 1 byte, and the remaining 4 bytes respectively record the node addresses of the nodes from the first hop to the fourth hop. When F sends location information to A, in Table 4, the first hop is recorded as the node address of E, in Table 5, the first hop is recorded as the node address of E, and the second hop is recorded as the node address of D.

table 3

Table 4

table 5

In some embodiments, nodes A to F establish a network topology as shown in FIG. 2 , each node sends a broadcast token to establish a connection in the sequence shown in FIG. 3 , and each node sends GPS location information. The routing information of each node is carried in PRE_CSBK, and the forwarding information is carried in DATA_HEADER. With the spread of the whole network, each node knows the location and connection relationship of other nodes, and automatically identifies the optimal path when forwarding messages.

Taking node F as an example, the steps for node F to configure routing information and forwarding information in PRE_CSBK and DATA_HEADER are as follows:

1. Obtain F local routing information and forwarding information;

2. Configure the local routing information and forwarding information of node F in PRE_CSBK_1, PRE_CSBK_2, and DATA_HEADER. The information after configuration is shown in Figure 7;

3. Make sure to send PRE_CSBK_1, PRE_CSBK_2, DATA_HEADER, DATA_Block, DATA_Lastblock in time slot 1, that is, send a GPS short message.

For example, taking node E as an example, the processing steps after receiving the GPS location information of node F are as follows:

1. Receive the GPS short message sent by node F, analyze the GPS location information, and obtain the local routing information and forwarding information of node F;

2. Record the local routing information and forwarding information of node F to the local routing table of node E, and configure the local routing information and forwarding information of node E in PRE_CSBK_1, PRE_CSBK_2, DATA_HEADER according to the local routing table of node E;

3. Determine to send the modified GPS short message sent by node F to node D in time slot 1.

When a node disappears, the path will be dynamically adjusted according to the routing of each node, for example: F->E->D->A, when node D goes offline for some reason, node E will re-select the path, F- ＞E-＞C-＞A, to ensure reliable communication.

If the node E does not receive the heartbeat wave of the node D within the cycle period, it is judged that the node D cannot be forwarded. The steps for node E to reselect the path are as follows: node E checks the routing table and finds that node C can reach node A after 0 hops; E sends a broadcast token (heartbeat wave) to node C and requests forwarding; node E sends the GPS location of node F The information is sent to node C.

Fill in Table 1-5 with the forwarding path data of F->E->D->A. During the sending process, the routing and forwarding path of F are obtained from all network nodes. For example, the local routing table of node D can be recorded as shown in FIG. 8 .

It should be noted that for the foregoing method embodiments, for the sake of simple description, they are all expressed as a series of action combinations, but those skilled in the art should know that the present disclosure is not limited by the described action sequence. Because of this disclosure, certain steps may be performed in other orders or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification belong to preferred embodiments, and the actions and modules involved are not necessarily required by the present disclosure.

The present disclosure also relates to a networking communication method, which is applied to a receiving node device, as shown in FIG. 9 , the method includes:

S902. Receive a message sent by a first node device in the same network; the message is sent by the first node device to a second node device in the same network, and the message includes the message of the first node device node information in the local routing table; and

S904. Perform the following operation on the receiving node device until the receiving node device is the second node device: when the receiving node device is the third node device in the same network, set the receiving node device The node information in the local routing table is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, and the updated message is sent to the next node device , so that the next node device is determined as a new receiving node device.

In some embodiments, the same network can be a network formed by multiple mobile communication terminals. Each mobile communication terminal among multiple mobile communication terminals can be used as a node, and its location can be moved. The mobile communication terminal may be a mobile phone, a tablet computer, a walkie-talkie, and the like. The communication distance of mobile communication terminals is limited. For example, if the distance between two mobile communication terminals is too far to exceed the direct communication distance (for example, the direct communication distance of a walkie-talkie is 5 kilometers), they can communicate by forming the same network. It can be understood that, when the first node device can directly send the message to the second node device, the second node device receives the message and acquires the node information in the message.

Take a total of 6 walkie-talkies from A to F as an example, as shown in Figure 2. Fig. 2 is an optional network topology diagram. In Figure 2, the node device is assumed to be a walkie-talkie, and the circle is the coverage of the walkie-talkie, that is, the effective direct communication distance. B, C, D are within the coverage of A, A, D, E are within the coverage of C, C, D, F are within the coverage of E, E are within the coverage of F, E, F are within the coverage of A out of coverage. There is communication between C and D (not shown in the figure), and communication between C and E (not shown in the figure). The distance between A and F is too far beyond the direct communication distance, therefore, the communication between A and F can be realized through an ad hoc network.

Fig. 3 is a schematic diagram of transmitting broadcast tokens according to time sequence. In FIG. 3 , SLOT1 is time slot 1, and SLOT2 is time slot 2. Node A broadcasts data in time slot 1, sends A's broadcast token in time slot 2, and B, C, D, E, and F all send broadcast tokens in time slot 2. Nodes A to F send broadcast tokens in different time slots 2, and each sending once is a period, so as to realize the networking in this way.

Fig. 4 is a schematic diagram of an optional A-node device broadcasting a GPS short message in time slot 1. In Figure 4, in time slot 1 of different frames, PRE_CSBK1, PRE_CSBK2, GPS DATA_HEADER, GPS DATA_BLOCK and GPS DATA_Lastblock are broadcast in sequence.

In some embodiments, the message may be a GPS short message, further a GPS short message in the DMR protocol. It can be understood that the message may also be other messages than the GPS short message.

In some embodiments, when the first node device communicates with the second node device, the first node device may send communication data to the second node device through the receiving node device. The first node device may send the location information of the first node device to the second node device. When sending the location information, the node information of the first node device may be filled into the address information, and the message is sent to the receiving node device. The receiving node device fills the node information of the receiving node device into the location information. There may be multiple receiving node devices, and any receiving node device may be used to forward the location information of the first node device. The node address of the receiving node device is filled in the location information, and any receiving node device can be selected to forward the location information. The location information is forwarded by the receiving node device to the second node device.

In some embodiments, the above method can ensure that each node device can communicate effectively during the communication process, and avoid the problem that each node device cannot know the connection relationship of other nodes and cannot effectively communicate.

For other examples of this embodiment, refer to the above examples, and details are not repeated here.

The present disclosure also relates to a first node device 1000 for implementing the above-mentioned networking communication method. As shown in FIG. 10 , the first node device 1000 includes:

The first filling unit 1002 is configured to fill in the node information in the local routing table of the first node device into the message when sending the message to the second node device in the same networking;

The determining unit 1004 is configured to determine a receiving node device according to node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations, Until the receiving node device is the second node device: when the receiving node device is the third node device in the same network, add the node information in the local routing table of the receiving node device to the message , and determine the next node device according to the node information in the local routing table of the receiving node device, send the updated message to the next node device, and determine the next node device as the new receiving node device.

For other examples of this embodiment, refer to the above examples, and details are not repeated here.

The present disclosure also relates to the receiving node device 1100 for implementing the above-mentioned networking communication method. As shown in Figure 11, the receiving node equipment includes:

The receiving unit 1102 is configured to receive a message sent by a first node device in the same network; the message is sent by the first node device to a second node device in the same network, and the message includes the first Node information in the local routing table of a node device;

The processing unit 1104 is configured to perform the following operation on the receiving node device until the receiving node device is the second node device: when the receiving node device is a third node device in the same network, the The node information in the local routing table of the receiving node device is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, and the updated message is sent to the The next node device, so that the next node device is determined as a new receiving node device.

For other examples of this embodiment, refer to the above examples, and details are not repeated here.

The present disclosure also relates to an electronic device 1300 for implementing the above-mentioned networking communication method. The electronic device may include a memory 1301 and a processor 1302. The memory is configured to store a computer program, and the processor is configured to execute the grouping of the present disclosure through the computer program. steps in the network communication method or the embodiment of the network communication method of the present disclosure.

The present disclosure also relates to a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute the steps in the embodiments of the networking communication method of the present disclosure during operation.

The present disclosure also relates to a networked communication system 1200, which includes the first node device 1000 of the present disclosure and the receiving node device 1100 of the present disclosure.

In some embodiments, those skilled in the art can understand that all or part of the steps in the various methods of the above-mentioned embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable In the storage medium, the storage medium may include: a flash disk, a read-only memory (Read-Only Memory, ROM), a random access device (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.

The serial numbers of the above-mentioned embodiments of the present disclosure are for description only, and do not represent the advantages and disadvantages of the embodiments.

If the integrated units in the above embodiments are realized in the form of software function units and sold or used as independent products, they can be stored in the above computer-readable storage medium. Based on this understanding, the essence of the technical solution disclosed in this disclosure or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of software products, and the computer software products are stored in storage media. Several instructions are included to make one or more computer devices (which may be personal computers, servers or network devices, etc.) execute all or part of the steps of the methods described in the various embodiments of the present disclosure.

In the above-mentioned embodiments of the present disclosure, the descriptions of each embodiment have their own emphases, and for parts not described in detail in a certain embodiment, reference may be made to relevant descriptions of other embodiments.

In the several embodiments provided in the present disclosure, it should be understood that the disclosed client may be implemented in other ways. Wherein, the device embodiments described above are only illustrative, for example, the division of the units is only a logical function division, and there may be other division methods in actual implementation, for example, multiple units or components can be combined or can be Integrate into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of units or modules may be in electrical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

The above descriptions are only preferred implementations of the present disclosure. It should be pointed out that those skilled in the art can make some improvements and modifications without departing from the principle of the present disclosure. These improvements and modifications are also It should be regarded as the protection scope of the present disclosure.

Claims (25)

A networking communication method, which is applied to a first node device, the method comprising: When sending a message to a second node device in the same network, filling the message with node information in the local routing table of the first node device; and Determine the receiving node device according to the node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations until the receiving node device For the second node device: when the receiving node device is a third node device in the same network, add the node information in the local routing table of the receiving node device to the message, and according to the The node information in the local routing table of the receiving node device determines the next node device, sends the updated message to the next node device, and determines the next node device as a new receiving node device. The method according to claim 1, wherein the node information includes adjacent node devices and corresponding hop values, the hop value is the number of hops from the adjacent node devices to the second node device, the Determining the receiving node device according to the node information in the local routing table of the first node device includes: determining the node device with the smallest hop value from adjacent node devices of the first node device; determining the node device with the highest signal strength from the node devices with the smallest hop value; and The determined node device with the highest signal strength is determined as the receiving node device. The method according to claim 1 or 2, wherein filling the node information of the first node device into the message or supplementing the node information of the receiving node device into the message comprises: Write the node information into the node information flag bit of the message. The method according to any one of claims 1 to 3, wherein the message is a GPS short message, and the source address flag and the target address flag in the GPS short message each occupy 1 byte, so The above-mentioned node information flag occupies at most 8 bytes. The method according to any one of claims 1 to 4, wherein the method further comprises: filling the node address of the first node device into the sending address flag bit of the message, so that the After receiving the message, the receiving node device fills the node address of the receiving node device into the receiving address set flag bit of the message, so as to form the transmission path information of the message. The method according to any one of claims 1 to 5, wherein the networking mode of the networking is a narrowband communication ad hoc network. The method according to claim 6, wherein the narrowband communication ad hoc network includes at least two node devices, each node device sends broadcast tokens in sequence, and the node device that receives the broadcast token sends the broadcast token The source address information and the hop value in the token are stored in the local routing table, wherein the hop value is the hop number from the node device sending the broadcast token to the second node device. A networking communication method, which is applied to a receiving node device, the method comprising: receiving a message sent by a first node device in the same network; the message is sent by the first node device to a second node device in the same network, and the message includes a local route of the first node device the node information in the table; and Perform the following operations on the receiving node device until the receiving node device is the second node device: when the receiving node device is the third node device in the same network, the local route of the receiving node device The node information in the table is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, and the updated message is sent to the next node device to The next node device is determined as a new receiving node device. The method according to claim 8, wherein the node information includes a hop value of an adjacent node, the hop value is the number of hops from the adjacent node device to the second node device, and the The node information in the local routing table of the receiving node device determines the next node device, including: determining the node device with the smallest hop value from adjacent node devices of the receiving node device; determining the node device with the highest signal strength from the node devices with the smallest hop value; and The determined node device with the highest signal strength is determined as the receiving node device. The method according to claim 8 or 9, wherein adding node information in the local routing table of the receiving node device to the message includes: Write the node information into the node information flag bit of the message. The method according to any one of claims 8 to 10, wherein the message is a GPS short message, and the source address flag and the target address flag in the GPS short message each occupy 1 byte, so The above-mentioned node information flag occupies at most 8 bytes. The method according to any one of claims 8 to 11, wherein the message further includes the node address of the first node device in the sending address flag; the method further comprises: upon receiving the After receiving the above message, fill the node address of the receiving node device into the receiving address set flag bit of the message to form the transmission path information of the message. The method according to any one of claims 8 to 12, wherein the networking mode of the networking is a narrowband communication ad hoc network. The method according to claim 13, wherein the narrowband communication ad hoc network comprises at least two node devices, each node device sends a broadcast token in sequence, and the node device that receives the broadcast token transmits the broadcast token The source address information and the hop value in the token are stored in the local routing table, wherein the hop value is the hop number from the node device sending the broadcast token to the second node device. A first node device, which includes: The first filling unit is configured to fill in the node information in the local routing table of the first node device into the message when sending the message to the second node device in the same network; and A determining unit configured to determine a receiving node device according to node information in the local routing table of the first node device, and send the message to the receiving node device, so that the receiving node device performs the following operations until The receiving node device is the second node device: when the receiving node device is the third node device in the same network, add the node information in the local routing table of the receiving node device to the message , and determine the next node device according to the node information in the local routing table of the receiving node device, send the updated message to the next node device, and determine the next node device as a new Receive node device. The first node device according to claim 15, wherein the node information includes adjacent node devices and corresponding hop values, and the hop value is the number of hops from the adjacent node devices to the second node device , the determination unit includes: The first determining module is configured to determine the node device with the smallest hop value from the adjacent node devices of the first node device; The second determination module is configured to determine the node device with the highest signal strength from the node devices with the smallest hop value; and The third determining module is configured to determine the determined node device with the highest signal strength as the receiving node device. The first node device according to claim 15 or 16, wherein the first node device is further configured to: when filling the node information of the first node device into the message or adding the receiving node device When adding the node information to the message, write the node information into the node information flag bit of the message. The first node device according to any one of claims 15 to 17, wherein the message is a GPS short message, and the source address flag and the target address flag in the GPS short message each occupy 1 word section, the node information flag occupies at most 8 bytes. Receiving node equipment, which includes: The receiving unit is configured to receive a message sent by a first node device in the same network; the message is sent by the first node device to a second node device in the same network, and the message includes the first node information in the local routing table of the node device; and A processing unit configured to perform the following operations on the receiving node device until the receiving node device is the second node device: when the receiving node device is a third node device in the same network, the receiving node device The node information in the local routing table of the node device is added to the message, and the next node device is determined according to the node information in the local routing table of the receiving node device, and the updated message is sent to the next node device. a node device, so that the next node device is determined as a new receiving node device. The receiving node device according to claim 19, wherein the node information includes a hop value of an adjacent node, the hop value is the number of hops from the adjacent node device to the second node device, and the processing Units include: The first determining module is configured to determine the node device with the smallest hop value from adjacent node devices of the receiving node device; The second determination module is configured to determine the node device with the highest signal strength from the node devices with the smallest hop value; and The third determining module is configured to determine the determined node device with the highest signal strength as the receiving node device. The receiving node device according to claim 19 or 20, wherein the processing unit comprises: A writing module configured to write the node information into the node information flag bit of the message. The receiving node device according to any one of claims 19 to 21, wherein the message is a GPS short message, and the source address flag and the target address flag in the GPS short message each occupy 1 byte , the node information flag occupies at most 8 bytes. A network communication system, comprising the first node device according to any one of claims 15 to 18 and the receiving node device according to any one of claims 19 to 22. A computer-readable storage medium storing a computer program, wherein the computer program executes the method according to any one of claims 1 to 7 or 8 to 14 when running. An electronic device comprising a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to execute any one of claims 1 to 7 or 8 to 14 through the computer program the method described.

Images