CN118019080A

CN118019080A - Message sending method, electronic equipment and medium

Info

Publication number: CN118019080A
Application number: CN202410048608.5A
Authority: CN
Inventors: 刘建德; 马显卿; 陈良
Original assignee: Shenzhen Gaoxin Sitong Technology Co ltd
Current assignee: Shenzhen Gaoxin Sitong Technology Co ltd
Priority date: 2024-01-12
Filing date: 2024-01-12
Publication date: 2024-05-10

Abstract

The embodiment of the application provides a message sending method, electronic equipment and a medium, wherein the method is applied to a target node and comprises the following steps: acquiring an nth first forwarding message, wherein the first forwarding message comprises first hop count information, and n is an integer greater than or equal to 1; obtaining second hop count information locally to replace the hop count information of the first forwarding message to obtain a corresponding nth second forwarding message; according to the frequency corresponding to the first hop count information in the preset frequency table, an nth second forwarding message is sent to one or more next hop nodes; the target node and the next-hop node are both nodes in the ad hoc network. By using the frequency corresponding to the preset frequency table to transmit and receive the message according to the hop count information, the target node and other nodes can all transmit the message in the self-organizing network according to the hop count frequency corresponding to the target node and other nodes, so that the self-organizing network uses the same transmitting frequency after two hop nodes, and the time slot multiplexing rate of the self-organizing network is improved.

Description

Message sending method, electronic equipment and medium

Technical Field

The present application relates to the field of self-organizing networks, and in particular, to a method for sending a message, an electronic device, and a medium.

Background

The self-organizing network is a centerless, multi-hop and temporary autonomous system formed by a group of equipment with the functions of terminals and routing through wireless links, and aims to transmit information flows meeting the most requirements of certain service quality through dynamic routing and mobile management technology. When the source node and the destination node are not within direct communication range, they can communicate by means of intermediate node relay. When the intermediate node helps other nodes to relay, the packet sent by the previous node is received first, and then forwarded to the next node to realize relay.

At present, in the related self-organizing network technology, if the whole network adopts the same frequency to transmit under the multi-hop node-level forwarding scene, the same-frequency interference problem of a plurality of nodes can exist when the time slot is multiplexed, and in order to solve the same-frequency interference problem, the frequency is multiplexed after the multi-hop by a method for reducing the time slot multiplexing rate in the prior art.

The self-organizing network can coordinate the frequencies before forwarding in a uniform way, and in the practical situation, different frequencies can be allocated to the same hop, so that the frequencies can be multiplexed only after a plurality of hops, the time slot multiplexing rate is greatly reduced, and the throughput capacity of the system is reduced.

Disclosure of Invention

Aiming at the defects of the prior art, the application provides a message sending method, electronic equipment and a medium, and aims to improve the time slot multiplexing rate of an ad hoc network.

In order to achieve the above object, a first aspect of the present application provides a method for sending a message, applied to a target node, where the method includes:

acquiring an nth first concurrent forwarding message, wherein the first concurrent forwarding message comprises first hop count information, and n is an integer greater than or equal to 1;

obtaining second hop count information locally to replace the hop count information of the first forwarding message to obtain a corresponding nth second forwarding message;

According to the frequency corresponding to the first hop count information in a preset frequency table, an nth second forwarding message is sent to one or more next hop nodes;

wherein the target node and the next-hop node are both nodes in an ad hoc network.

In some possible embodiments of the present application, the locally acquiring the second hop count information includes:

Determining the hop count of the local node according to the first hop count information;

And determining the node hop count of the next hop node according to the local node hop count, and generating the second hop count information according to the node hop count of the next hop node.

In some possible embodiments of the present application, the preset frequency table includes a plurality of preset frequency groups, each of the preset frequency groups includes a frequency corresponding to a hop count of each node, and the preset frequency groups are used for the ad hoc network to complete one-time forwarding;

the sending the nth second forwarding message to one or more next hop nodes according to the frequency corresponding to the first hop count information in the preset frequency table includes:

Determining a first frequency of the node hop count corresponding to the local node hop count in a first preset frequency group according to the local node hop count, wherein the first preset frequency group is one of a plurality of preset frequency groups, and the first preset frequency group is determined by management node setting in the self-organizing network;

And sending the nth second forwarding message to one or more next hop nodes according to the first frequency.

In some possible embodiments of the present application, the first forwarding message further includes frequency setting information;

Before the sending the second flush message to one or more next-hop nodes according to the first frequency, the method further includes:

Determining a second preset frequency group among a plurality of preset frequency groups other than the first preset frequency group according to the frequency setting information;

after sending the nth second flush packet to one or more of the next hop nodes according to the first frequency, the method further includes:

Acquiring an n+1th first forwarding message;

Acquiring the second hop count information, and replacing the hop count information according to the second hop count information to obtain an n+1th second forwarding message;

And according to the second frequency corresponding to the second preset frequency group of the first hop count information in the n+1th first forwarding message, sending the n+1th second forwarding message to one or more next hop nodes.

In some possible embodiments of the present application, before the locally acquiring the second hop count information, the method further includes:

Locally obtaining the sending times, wherein the sending times are times when the target node sends the nth second forwarding message to one or more next hop nodes;

the sending the nth second forwarding packet to one or more next hop nodes includes:

and when the number of the transmissions is greater than 1, transmitting an nth second flush message to one or more next-hop nodes in each flush time slot in a plurality of continuous flush time slots, wherein the flush time slots are determined by the management node according to the transmission and node hop numbers of each node.

In some possible embodiments of the present application, the number of transmissions is obtained through a network search process, the network search process including the steps of:

Acquiring a first search message, wherein the first search message comprises first search hop count information;

acquiring second search hop count information, and replacing the hop count information of the first search message to obtain a second search message;

transmitting the second search message according to the frequency corresponding to the first search hop count information in the preset frequency table;

And receiving a third search message according to the frequency corresponding to the second search hop count information in the preset frequency table, and storing the sending times to the local when the third search message is received in the next search time slot for sending the second search message, wherein the third search message is sent by the node for receiving the second search message.

In some possible embodiments of the present application, after the receiving of the third search packet, the method further includes:

And when the third search message is not received in the next search time slot for sending the second search message, retransmitting the second search message according to the frequency corresponding to the first search hop count information in the preset frequency table in the next search time slot so as to re-receive the third search message.

In some possible embodiments of the present application, the frequency corresponding to the first search hop count information in a preset frequency table and the frequency corresponding to the second search hop count information in the preset frequency table are both one frequency in a preset network search frequency group, where the preset network search frequency group is one of a plurality of preset frequency groups;

when the target node is a forwarding node, the obtaining the first search packet includes:

And in the continuous multiple search time slots, searching the first search message one by one according to the multiple frequencies of the preset network search frequency group so as to receive the first search message, wherein the multiple search time slots are in one-to-one correspondence with the multiple frequencies of the preset network search frequency group.

To achieve the above object, a second aspect of the embodiments of the present application proposes an electronic device, including a memory and a processor, the memory storing a computer program, the processor implementing the method according to the first aspect when executing the computer program.

To achieve the above object, a third aspect of the embodiments of the present application proposes a computer-readable storage medium storing a computer program which, when executed by a processor, implements the method of the first aspect.

The embodiment of the application provides a message sending method, electronic equipment and a medium, wherein the method is applied to a target node and comprises the following steps: acquiring an nth first concurrent forwarding message, wherein the first concurrent forwarding message comprises first hop count information, and n is an integer greater than or equal to 1; obtaining second hop count information locally to replace the hop count information of the first forwarding message to obtain a corresponding nth second forwarding message; according to the frequency corresponding to the first hop count information in a preset frequency table, an nth second forwarding message is sent to one or more next hop nodes; wherein the target node and the next-hop node are both nodes in an ad hoc network. The frequency corresponding to the preset frequency table is used for carrying out receiving and transmitting frequency matching with the next hop node according to the hop count information, so that the target node and other nodes in the self-organizing network can carry out message forwarding in the self-organizing network according to the hop count frequency corresponding to the target node, the self-organizing network can use the same transmitting frequency after the two hop nodes, and the time slot multiplexing rate of the self-organizing network is improved.

Drawings

FIG. 1 is a schematic diagram illustrating steps of a message sending method according to an embodiment of the present application;

FIG. 2 is a step schematic diagram of one substep embodiment of step S102 of FIG. 1;

FIG. 3 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application;

FIG. 4 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application;

FIG. 5 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application;

FIG. 6 is a schematic diagram of steps of one embodiment of a web search process in accordance with embodiments of the present application;

FIG. 7 is a schematic diagram of steps of another network search process embodiment of the present application

Fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.

It is to be noted that all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs unless defined otherwise. The terminology used herein is for the purpose of describing embodiments of the application only and is not intended to be limiting of the application.

Based on this, the embodiment of the application provides a message sending method, electronic equipment and a medium, aiming at improving the time slot multiplexing rate of an ad hoc network.

The embodiment of the application provides a message sending method, electronic equipment and a medium, and specifically, the following embodiment is used for explaining, first, a message sending method provided in the first aspect of the embodiment of the application.

Referring to fig. 1, fig. 1 is a schematic diagram illustrating steps of a message sending method according to an embodiment of the present application. In this embodiment, the method for sending a message includes, but is not limited to, the following embodiments.

Step S101, an nth first forwarding message is obtained.

Step S102, second hop count information is obtained locally, so that the hop count information of the first forwarding message is replaced, and a corresponding nth second forwarding message is obtained.

Step S103, according to the frequency corresponding to the first hop count information in the preset frequency table, the nth second forwarding message is sent to one or more next hop nodes.

It should be noted that, the target node and the next hop node are both nodes in the ad hoc network, the first forwarding packet includes first hop count information, and n is an integer greater than or equal to 1.

It should be noted that, the first forwarding message herein refers to a forwarding message obtained by a node, and the second forwarding message refers to a forwarding message sent by a node after the node performs hop count information replacement, for example, for a next-hop node, the next-hop node receives an n-1 first forwarding message in a previous time slot, and after an n-th second forwarding message sent by a target node, the next-hop node can obtain an n-th first forwarding message corresponding to the first forwarding message obtained by the next-hop node.

When the self-organizing network performs networking and performs coordination of forwarding service, specific sending actions and forwarding time slots corresponding to receiving actions are allocated to each node in the network, each node in the network including the central node performs time slot calculation, and therefore message sending or message receiving is performed on the corresponding time slots or messages sent by other nodes. In the application, the network also distributes the same preset frequency table for each node in the networking or running process, wherein the preset frequency table comprises the transmission frequency corresponding to the hop count of each node, and after the central node is determined, the network sets the receiving frequency of each node as the transmission frequency of the previous hop node according to the hop count of each node in the preset frequency table.

Based on this, for the target node, the target node obtains the nth first forwarding message, determines the local hop count of the node according to the first hop count information included in the first forwarding message, and then determines the transmission frequency corresponding to the local hop count of the node in the preset frequency table.

Because in the self-organizing network's self-organizing forwarding flow, the management node coordinates the nodes only in the self-organizing network's self-organizing forwarding time slots, each node can not know the hop count of itself, can only follow the self-organizing forwarding time slots, the receiving time slot of each node is earlier than the transmitting time slot, and when the node obtains the forwarding message, the node will execute the transmitting action in the subsequent forwarding time slot, and it should be noted that the management node is a node in the ad hoc network.

Thus, the next hop node cannot know the hop count of the next hop node, and therefore cannot select a specific transmission frequency to transmit a message during transmission. Therefore, the target node provides a hop count information for the next hop node, so that the next hop node adopts the frequency corresponding to the hop count information as the transmission frequency in the self-transmission time slot for transmission, and completes the receiving and transmitting frequency matching with the next hop node, thereby completing the message transmission of the whole network.

And the second forwarding message is sent to the next hop node through the frequency corresponding to the first hop information in the preset frequency table.

For example, assuming that the destination node is the mth hop, the transmission frequency corresponding to the mth hop is F00, the transmission frequency corresponding to the mth+1th hop is F01, in the forwarding time slot of the destination node for transmission, the reception frequency of the mth+1th hop node is F00, and the destination node determines that the used transmission frequency is F00 according to the first hop count information, so that the destination node completes the receiving and transmitting frequency matching with the mth+1th hop node, and sends the second forwarding message to the mth+1th hop node through the F00.

After the transmission of the nth second forwarding message is completed, the target node enters a receiving state, and waits for the (n+1) th first forwarding message by taking the transmission frequency of the previous hop node as the receiving frequency, so that the forwarding of the whole self-organizing network is smooth and continuous.

For the self-organizing network, since the message forwarding needs to be continuously performed to keep the integrity of the data stream, each node needs to continuously perform the message forwarding in different synchronous forwarding time slots, wherein the problem of same-frequency interference and time slot multiplexing is involved, in this time slot, two nodes adjacent to the left and right cannot use the same frequency for communication, and the frequency multiplexing must be performed after at least two hops, that is, at least five consecutive hops cannot use the same frequency. Therefore, the frequencies corresponding to the continuous 5 hops in the preset frequency table are set to different frequencies, that is, the next three-hop node of the target node can use the same transmission frequency to transmit the nth second flush forwarding message with the target node.

For a general self-organizing network, after a central node is determined or changed, the self-organizing network needs to coordinate with each hop node and determine the transceiving frequencies of other hop nodes, wherein the nodes of the same hop can coordinate to be the same transceiving frequency or can be different transceiving frequencies, so that frequency multiplexing becomes uncertain, the time slot multiplexing rate becomes uncertain, and the self-organizing network allows dynamic topology, if the nodes are added, the network needs to coordinate the transceiving frequencies of newly added nodes, so that the time slot multiplexing performance can be further reduced.

Each node in the application needs to transmit by adopting the frequency corresponding to the hop count in the preset frequency table and receive by adopting the transmission frequency of the previous hop node, so that each node does not need to coordinate the frequency when determining the central node or the change of the central node, and only needs to allocate the forwarding time slot by the management node, thereby enabling the network to use the same transmission frequency after two hop nodes and improving the transmission efficiency of the self-organizing network; when the self-organizing network increases nodes, the increased nodes do not need to coordinate frequencies with other nodes again, and only the management nodes need to allocate the forwarding time slots, so that the self-organizing network can keep the same sending frequency after two-hop nodes under any condition, and meanwhile, the efficiency of the operation of the expansion network is improved.

It should be noted that, the target nodes herein are particularly diverse, and the following embodiments may be provided for obtaining the nth first forwarding message according to different target nodes, or other embodiments may be provided, which are not limited by the embodiments of the present application.

In an embodiment, when the target node is a central node, the central node acquires data, performs data slicing processing on the data according to the allocated forwarding time slots in the self-organizing network, obtains a plurality of slices, generates a plurality of forwarding messages according to the plurality of slices, and enters a queue to be sent of the central node according to the slicing sequence. After finishing the transmission of the n-1 second flush transmission message, the central node locally acquires the n first flush transmission message, carries out hop number replacement on the first flush transmission message, then uses the frequency corresponding to the 0 th hop node in the preset frequency table to transmit the n second flush transmission message to one or more 1 st hop nodes according to the first hop number information, and the 1 st hop node is set to use the transmission frequency corresponding to the 0 th hop node as the receiving frequency of the first flush transmission message so as to receive the n first flush transmission message relative to the first flush transmission message.

It should be noted that the first hop count information is carried in the flush forwarding packet generated at the central node.

In an embodiment, when the target node is an nth hop node, the nth hop node receives an nth second forwarding message (i.e., an nth first forwarding message of the nth hop node in comparison) sent by the nth hop node according to a sending frequency of the nth hop node, the nth hop node performs hop number replacement on the first forwarding message, then the first hop number information sends the second forwarding message generated by the nth hop node to one or more n+1th hop nodes by using a sending frequency of the nth hop node as a receiving frequency of the nth hop node, and the n+1th hop node is configured to receive the second forwarding message sent by the nth hop node.

It should be noted that the source mode of the central node is particularly various, and exemplary, for example, the central node is obtained by each node in the ad hoc network through a competition mode; and then, designating a node in the self-organizing network by a management node in the self-organizing network; and as a central node, a node with a specific attribute is used.

It should be noted that, the manner in which the central node obtains the data is particularly diverse, and the following embodiments may be adopted, or other embodiments may also be adopted, which are not limited by the embodiments of the present application.

In one embodiment, the data is generated by nodes other than the central node, the node generating the data is sent to the central node in a unicast mode, and the central node performs the slicing and then performs the forwarding.

In an embodiment, the data is obtained by uploading the data to be sent to the central node by the auxiliary devices of the central node, and the central node performs the concurrent forwarding after the data is fragmented.

It should be noted that, in order to ensure that the forwarding process is normal, in the present application, the number of frequencies stored in the preset frequency table is greater than the maximum node hop count in the ad hoc network, when the target node is the last forwarding node, the action of sending the n second forwarding message generated by itself to the next hop node is still executed, but no node receives the n second forwarding message sent by the last forwarding node.

According to the application, the frequency corresponding to the preset frequency table is used for carrying out receiving-transmitting frequency matching with the next hop node according to the hop count information, so that the target node and other nodes in the self-organizing network can carry out message forwarding according to the hop count frequency corresponding to the target node and the self-organizing network, the self-organizing network uses the same transmitting frequency after the two hop nodes, the time slot multiplexing rate of the self-organizing network is improved, and the throughput capacity of the system is improved; in addition, the self-organizing network can use the same sending frequency after two-hop nodes under any condition, so that the time slot multiplexing rate is not influenced by network topology, and is kept the maximum under any condition, thereby improving the stability of the time slot multiplexing rate and the communication quality of the network.

Referring to fig. 2, fig. 2 is a step schematic diagram of an embodiment of a substep of step S102 in fig. 1, where step S102 includes, but is not limited to, the following substeps.

Step S201, determining the local node hop count according to the first hop count information.

Step S202, determining the node hop count of the next hop node according to the local node hop count, and generating second hop count information according to the node hop count of the next hop node.

In an embodiment, the first hop count information indicates a hop count value of the target node, the hop count of the local node can be directly determined according to the hop count value, and the hop count value of the local node is added with one to obtain a node hop count value of the next hop node, so as to generate the second hop count information.

In an embodiment, the ad hoc network sets each node to decrypt and encrypt hop count information of the forwarding message according to the coordinated encryption algorithm, the first hop count information is represented as encrypted information, the target node decrypts the first hop count information according to the encryption algorithm coordinated by the ad hoc network, knows the hop count of the local node according to the decryption result, performs addition processing on the hop count of the local node to obtain the hop count of the next hop node, and encrypts the hop count of the next hop node according to the coordinated encryption algorithm to obtain second hop count information. According to the embodiment, the communication safety problem caused by leakage of the preset frequency table is reduced through the number of hops of the encryption nodes, so that the safety of the synchronous forwarding is improved.

In an embodiment, the hop count information is specific information, and after the management node determines the central node and the forwarding node in the ad hoc network, the management node directly distributes a hop count information interpretation table for each node, where the hop count information interpretation table includes a plurality of hop count information and node hop counts corresponding to each hop count information. Searching in a hop count information interpretation table according to the first hop count information, determining the hop count of the local node corresponding to the target node, adding one to the hop count of the local node to obtain the node hop count of the next hop node, and searching in the hop count information interpretation table according to the node hop count of the next hop node to obtain the corresponding second hop count information. Based on the method, the first hop count information can be added into the forward message in a simpler mode, so that the length of the forward message is shortened, the influence caused by the transmission speed of the forward message due to the expansion of the message is reduced, and the transmission speed of the forward message is improved.

Referring to fig. 3, fig. 3 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application, and in an embodiment, step S103 includes, but is not limited to, the following substeps.

Step S301, determining a first frequency corresponding to the local node hop count from the first preset frequency group according to the local node hop count.

Step S302, an nth second forwarding message is sent to one or more next hop nodes according to the first frequency.

Specifically, the preset frequency table includes a plurality of preset frequency groups, each preset frequency group has a plurality of frequencies, each frequency corresponds to a node hop count, and the preset frequency groups are used for completing one-time forwarding of the self-organizing network.

It should be noted that, the first preset frequency group is one of a plurality of preset frequency groups, and the determination manner thereof is determined by the management node, which is not limited in this embodiment of the present application.

Illustratively, in determining the central node, the management node directly sets the usage first preset frequency group for each node.

By way of example, the management node is configured to test the message forwarding speed of each preset frequency group in the entire network, and determine the first preset frequency group from the plurality of preset frequency groups according to the time when each frequency group transmits the forwarding message to the last hop node.

Based on the above, the nth first retransmission message is received, the local node hop count is determined according to the first hop count information in the first retransmission message, and according to the local node hop count, the frequency corresponding to the local hop count is searched in the first preset frequency group of the preset frequency table, and the frequency is determined as the first frequency. And then transmitting an nth second forwarding message to one or more next-hop nodes according to the first frequency.

Since the first preset frequency group is selected by the management node, that is, for each node from the target node to the last forwarding node, the transmission of the nth second forwarding message is completed by using the first preset frequency group.

According to the embodiment of the application, the target node uses the first frequency corresponding to the first preset frequency group according to the hop count of the local node, so that the target node can use the same preset frequency group as other nodes, the receiving and transmitting frequency matching of the target node and the next hop node is synchronous with the forwarding process of the whole network, and the forwarding stability of the target node in the whole network is improved.

In an embodiment, the first forwarding message further includes frequency setting information. Referring to fig. 4, fig. 4 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application. Prior to step S302, the method further includes, but is not limited to, the following steps.

Step S401, determining a second preset frequency group from a plurality of preset frequency groups other than the first preset frequency group according to the frequency setting information.

After step S302, the method further includes, but is not limited to, the following steps.

Step S402, an n+1th first forwarding message is obtained.

Step S403, obtaining second hop count information, and obtaining an n+1th second forwarding message according to the second hop count information.

Step S404, according to the first hop count information in the n+1th first forwarding message, the n+1th second forwarding message is sent to one or more next hop nodes at a second frequency corresponding to the second preset frequency group.

Specifically, the frequency setting information is used for informing the node that a second preset frequency group different from the first preset frequency group needs to be adopted for processing when the next forwarding message is sent locally, so that the purpose of frequency hopping is achieved.

When the first forwarding packet further includes frequency setting information, the target node determines, according to the frequency setting information, a preset frequency group (i.e., a second preset frequency group) used for transmitting the next forwarding packet, and because the target node is still in the transmission process of the nth second forwarding packet, the transmission of the nth second forwarding packet and the negotiation of the subsequent node use the first preset frequency group, in order to keep the transceiving frequencies of the nodes in the subsequent forwarding packet Wen Ji matched, the corresponding frequency in the first preset frequency group needs to be used for transmitting the nth second forwarding packet to the next hop node. And the next hop node also determines a second preset frequency group according to the same flow until the last forwarding node obtains the nth first concurrent forwarding message.

After the target node sends the nth second flush message, determining the node hop count of the target node according to the first hop count information, and after the transmission of the nth second flush message is completed, changing the receiving frequency of the target node to the transmitting frequency (namely the second frequency) corresponding to the second preset frequency group according to the node hop count of the target node.

After the nth second forwarding message is completed, when the nth first forwarding message is further followed by the (n+1) th first forwarding message, the (n+1) th first forwarding message is obtained, second hop count information is obtained, hop count information replacement is carried out on the (n+1) th first forwarding message, the (n+1) th second forwarding message is obtained, and a corresponding second frequency is determined in a second preset frequency group according to the first hop count information in the (n+1) th first forwarding message, so that frequency hopping receiving and transmitting frequency matching with a next hop node is completed, synchronization is kept with the whole network forwarding process, and the stability of the target node in the whole network in an aligned manner is improved.

In an embodiment, when the target node is a central node, the central node generates frequency setting information by a mode of receiving an external instruction or setting a timing change frequency group, adds the frequency setting information to the nth first forwarding packet, and determines a second preset frequency group according to the frequency setting information. After the transmission of the nth second flush message is completed, the central node acquires the (n+1) th first flush message, carries out hop count replacement on the first flush message, then uses a second frequency corresponding to the 0 th hop node in a second preset frequency group to transmit the second flush message to one or more 1 st hop nodes according to the first hop count information, and the 1 st hop node is set to receive the (n+1) th second flush message transmitted by the central node by using the second frequency as a receiving frequency of the first flush message.

In an embodiment, when the target node is the nth hop node, the nth hop node receives the nth second forwarding message (i.e., the nth first forwarding message of the nth hop node) sent by the nth-1 hop node according to the sending frequency of the nth-1 hop node, and determines the second preset frequency group according to the frequency setting information. After the transmission of the nth second forwarding message is completed, the nth hop node obtains the (n+1) th first forwarding message, the first forwarding message is subjected to hop number replacement, and then the second forwarding message is transmitted to one or more (n+1) th hop nodes by using the second frequency corresponding to the nth hop node in a second preset frequency group according to the first hop number information.

Referring to fig. 5, fig. 5 is a schematic diagram illustrating steps of a message sending method according to another embodiment of the present application. Prior to step S102, the method further includes, but is not limited to, the following steps.

In step S501, the number of transmissions is acquired locally.

Step S103 includes, but is not limited to, the following embodiments.

In step S502, when the number of transmissions is greater than 1, in a plurality of consecutive regular forwarding time slots, the nth second regular forwarding message is transmitted to one or more next-hop nodes in each regular forwarding time slot.

It should be noted that, the number of times of transmission is the number of times that the target node transmits the nth second flush packet to one or more next-hop nodes.

Because the nodes may have application faults, overload equipment and other conditions, when one node sends the second forwarding message to the next hop node, the message may be lost, so that some nodes need to retransmit for multiple times, so as to ensure that the nodes can receive the second forwarding message at least once.

It should be noted that, when the ad hoc network has a node that needs to perform multiple transmissions, the management node needs to refer to the transmission times of each node when coordinating and forwarding time slots, so as to avoid the conflict between the transmission and the reception of a node that needs to perform multiple transmissions and a next hop node. For a node, since the node can only be in one of receiving and transmitting states in one flush forwarding time slot, when a node needs to transmit x times, when the management node allocates flush forwarding time slots, the management node needs to delay the flush forwarding time slots used for transmitting by the next hop node by x times, so that the node can be guaranteed to finish transmitting a second flush forwarding message. For example, when the number of transmissions of the target node is 1, the transmission of the target node occupies a flush timeslot, and if the flush timeslot is timeslot 1, the flush timeslot used for transmission by the next hop node is timeslot 2 or a flush timeslot (e.g. a guard timeslot) following timeslot 2; when the number of transmissions is 3, the flush time slot used for transmission by the target node is time slot 1 to 3, the flush time slot used for transmission by the next hop node is time slot 4 or the flush time slot after time slot 4, and the node transmits a second flush message to the next node in each time slot 1 to 3.

After the management node determines the central node, the management node distributes corresponding sending times and specific synchronous forwarding time slots for the node to send and receive actions to each node. When the target node obtains the nth first forwarding message, the distributed sending times are locally obtained, when the sending times are larger than 1, the nth second forwarding message is sent to the next hop node for a plurality of times in a plurality of next forwarding time slots according to the sending times, and the next hop node is ensured to be capable of receiving the nth second forwarding message sent by the target node at least once.

According to the embodiment of the application, the target node sends the nth second forwarding message to the next hop node for multiple times by setting the sending times, so that the next hop node can receive the nth second forwarding message at least once, the influence of message loss on the forwarding process is reduced, the probability of interruption of forwarding is reduced, the transmission stability between the target node and the next hop node is improved, and the stability of the self-organizing network is improved.

Note that, the transmission number acquisition method is particularly diverse, and may be the following embodiment or other embodiments, which are not limited by the embodiment of the present application.

In one embodiment, the number of transmissions is set locally at the target node.

Referring to fig. 6, fig. 6 is a schematic diagram illustrating steps of an embodiment of a network searching process according to an embodiment of the present application. In one embodiment, the number of transmissions is obtained through a web search process, including but not limited to the following steps.

Step S601, a first search message is acquired.

Step S602, obtaining second search hop count information, and replacing the hop count information of the first search message to obtain a second search message.

Step S603, a second search message is sent according to the frequency corresponding to the first search hop count information in the preset frequency table.

Step S604, receiving the third search message according to the frequency corresponding to the second search hop count information in the preset frequency table, and storing the sending times to the local when the third search message is received in the next search time slot for sending the second search message.

It should be noted that the first search packet here includes first search hop count information, and the third search packet here is sent by the node that receives the second search packet.

In an embodiment, when the target node is a central node, the central node locally obtains a first search message in a generating manner, obtains second search hop count information, and performs hop count replacement on the first search message according to the second search hop count information to obtain a second search message. And then, according to the first search hop count information, using the frequency corresponding to the 0 th hop node in the preset frequency table to send a second search message outwards.

After the transmission of the corresponding frequency in the preset frequency table is completed, the third search message is received according to the frequency of the first hop node in the preset frequency table, and when the third search message is received in the next search time slot for transmitting the second search message, the transmission times are stored locally. It should be noted that, if the third search packet is received in the next search time slot for sending the second search packet, it is proved that no packet is lost in the packet transmission process with the next hop node, and the number of times of sending is 1.

In an embodiment, when the target node is a forwarding node, a first search message sent by a previous hop node is obtained, second search hop information is obtained, and hop replacement is performed on the first search message according to the second search hop information to obtain a second search message. And then, according to the first search hop count information, using the corresponding frequency in the preset frequency table to send a second search message outwards.

After the transmission of the corresponding frequency in the preset frequency table is completed, the third search message is received according to the frequency of the next hop node of the target node in the preset frequency table, and when the third search message is received in the next search time slot for transmitting the second search message, the transmission times are stored locally. It should be noted that, if the third search packet is received in the next search time slot for sending the second search packet, it is proved that there is no packet loss in the packet transmission process with the next hop node, and the number of times of sending is 1 at this time.

It should be noted that, at this time, forwarding time slots are not allocated in the ad hoc network, the target node performs network searching by adopting the existing time slots (i.e. searching time slots), and each node which does not receive the first searching message performs searching time slot calculation; after each node receives the third message, all the search time slots for sending the second search message and the search time slots for receiving the third search message are reported to the management node, so that the management node performs forwarding time slot allocation according to the reported search time slots.

It should be noted that, in steps S601 and S603, steps S101 to S103 are similar, and some related embodiments of steps S601 and S603 are referred to the above, and are not described herein.

Referring to fig. 7, fig. 7 is a schematic diagram illustrating steps of another network searching process according to an embodiment of the present application. In one embodiment, after step S603, the following steps are included, but not limited to.

In step S701, when the third search packet is not received in the next search time slot in which the second search packet is transmitted, the second search packet is retransmitted according to the frequency corresponding to the first search hop count information in the preset frequency table in the next search time slot, so as to re-receive the third search packet.

When the third search message is not received in the next search time slot for sending the second search message, there are two cases, namely, the target node is the last node in the past, no next-hop node responds to the target node through the third search message, and the next-hop node is lost in the message transmission process with the next-hop node, so that the next-hop node does not receive the third search message, and retransmission is needed until the third search message is received.

For the above situation, the application sets a certain threshold of the number of times of transmission, and when the number of times of transmission is greater than the threshold of the number of times of transmission, the node determines the last forwarding node.

That is, when the third search packet is not received, the target node may repeat step S605 multiple times within the range of the threshold limit of the number of transmissions until the third search packet transmitted by the next hop node is received.

In an embodiment, the frequency corresponding to the first search hop count information in the preset frequency table and the frequency corresponding to the second search hop count information in the preset frequency table are both one frequency in a preset network search frequency group, where the preset network search frequency group is one of a plurality of preset frequency groups.

It should be noted that, the preset network search frequency group may be a frequency group used in the last forwarding process, or may be a frequency group initially set by a node, which is not limited in the embodiment of the present application.

When the target node is a forwarding node, step S601 includes, but is not limited to, the following sub-steps: and in a plurality of continuous search time slots, searching the first search message one by one according to a plurality of frequencies of a preset network search frequency group so as to receive the first search message.

It should be noted that the plurality of search slots corresponds to a plurality of frequencies of the preset network search frequency group one by one.

The forwarding node cannot know the hop count of the forwarding node, and the management node cannot know the node hop count of the target node in the network before the forwarding node reports the search time slot, so that the target node cannot be configured with the receiving frequency, at this time, the target node cannot set the sending frequency used by the last node for sending the second search message as the receiving frequency, and at this time, the target node can only test the frequency corresponding to one node hop count of the preset network search frequency group in each search time slot so as to detect whether the first search message can be received.

For example, the target node is a artificially defined 1 st hop node, theoretically, the 1 st hop node can receive the second search message sent by the central node according to the sending frequency corresponding to the 0 st hop node in the preset network search frequency group, so that the target node starts testing in one search time slot from the frequency corresponding to the 0 th hop node in the preset network search frequency group, uses the frequency corresponding to the 0 st hop node as the receiving frequency to test whether the first search message can be obtained or not, and at this time, the first search message will be obtained and the search time slot is reported to the management node.

For example, the target node is the nth hop node, in theory, the nth hop node can receive the second search message sent by the nth hop node according to the corresponding sending frequency of the nth hop node in the preset network search frequency group, so that the target node starts to test the frequency corresponding to the 0 th hop node in the preset network search frequency group in one search time slot, tests the frequency corresponding to the 1 st hop node in the preset network search frequency group in the next time slot, and accordingly, the target node can obtain the first search message and report the search time slot to the management node when the frequency of the nth hop node in the preset network search frequency group is set as the receiving frequency according to the corresponding sending frequency of the nth hop node in the preset network search frequency group.

It should be noted that, since the regular forwarding time slots are allocated, when the target node does not acquire the nth first regular forwarding message in the predetermined regular forwarding time slot, the target node performs the progressive search of the message according to the frequency in the preset frequency table in the next regular forwarding time slot, and if the message still cannot be received, the step S601 is entered to perform the network search processing.

For example, assume that the target node is an mth hop node, and is allocated to receive an nth first forwarding message in the flush forwarding time slot x, where the mth hop node sets a receiving frequency according to a sending frequency of the mth-1 hop node, and waits for arrival of the nth first forwarding message in the flush forwarding time slot x.

If the message is lost, in the forwarding time slot x+1, the mth hop node determines the node hop number corresponding to the frequency according to the sending frequency table lookup of the mth-1 hop node, and then the sending frequency of the next hop node is set as the receiving frequency, that is, the mth hop node sets the sending frequency of the mth hop node as the receiving frequency to receive the message, if a plurality of normal mth hop nodes exist on the network, the mth hop node can theoretically receive the nth second forwarding message sent by other mth hop nodes, and at the moment, the current forwarding of the self-organizing network is proved to be uninterrupted.

Similarly, the mth hop node can set the sending frequency of other hop nodes such as the mth+1st hop node as the receiving frequency to receive the message, and confirm whether the forwarding process is normal. If the m-th hop node still cannot receive the message at the sending frequency corresponding to the preset frequency table by using the following hop nodes, the current concurrent forwarding of the self-organizing network is proved to be interrupted, and the management node is required to perform concurrent forwarding coordination again.

The embodiment of the application also provides electronic equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the message sending method when executing the computer program. The electronic equipment can be any intelligent terminal including a tablet personal computer, a vehicle-mounted computer and the like.

Referring to fig. 8, fig. 8 illustrates a hardware structure of an electronic device according to another embodiment, and the electronic device 800 includes:

The processor 801 may be implemented by a general-purpose CPU (central processing unit), a microprocessor, an application-specific integrated circuit (ApplicationSpecificIntegratedCircuit, ASIC), or one or more integrated circuits, etc. for executing related programs to implement the technical solution provided by the embodiments of the present application;

Memory 802 may be implemented in the form of read-only memory (ReadOnlyMemory, ROM), static storage, dynamic storage, or random access memory (RandomAccessMemory, RAM), among others. The memory 802 may store an operating system and other application programs, and when the technical solutions provided in the embodiments of the present disclosure are implemented by software or firmware, relevant program codes are stored in the memory 802, and the processor 801 invokes a messaging method for executing the embodiments of the present disclosure;

an input/output interface 803 for implementing information input and output;

The communication interface 804 is configured to implement communication interaction between the device and other devices, and may implement communication in a wired manner (e.g. USB, network cable, etc.), or may implement communication in a wireless manner (e.g. mobile network, WI F I, bluetooth, etc.);

A bus 805 that transfers information between the various components of the device (e.g., the processor 801, the memory 802, the input/output interface 803, and the communication interface 804);

Wherein the processor 801, the memory 802, the input/output interface 803, and the communication interface 804 implement communication connection between each other inside the device through a bus 805.

The embodiment of the application also provides a computer readable storage medium, which stores a computer program, and the computer program realizes the message sending method when being executed by a processor.

The memory, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs as well as non-transitory computer executable programs. In addition, the memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located relative to the processor, the remote memory being connectable to the processor through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The embodiments described in the embodiments of the present application are for more clearly describing the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application, and those skilled in the art can know that, with the evolution of technology and the appearance of new application scenarios, the technical solutions provided by the embodiments of the present application are equally applicable to similar technical problems.

It will be appreciated by persons skilled in the art that the embodiments of the application are not limited by the illustrations, and that more or fewer steps than those shown may be included, or certain steps may be combined, or different steps may be included.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

In the embodiments of the present application, "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relation of association objects, and indicates that there may be three kinds of relations, for example, a and/or B, and may indicate that a alone exists, a and B together, and B alone exists. Wherein A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of the following" and the like means any combination of these items, including any combination of single or plural items. For example, at least one of a, b and c may represent: a alone, b alone, c alone, a and b together, a and c together, b and c together, or a and b and c together, wherein a, b, c may be single or plural.

In embodiments of the present application, "indication" may include direct indication and indirect indication, as well as explicit indication and implicit indication. The information indicated by a certain information is referred to as information to be indicated, and in a specific implementation process, there may be various ways of indicating the information to be indicated, for example, but not limited to, directly indicating the information to be indicated, such as indicating the information to be indicated itself or an index of the information to be indicated. The information to be indicated can also be indicated indirectly by indicating other information, wherein the other information and the information to be indicated have an association relation. It is also possible to indicate only a part of the information to be indicated, while other parts of the information to be indicated are known or agreed in advance. For example, the indication of the specific information may also be achieved by means of a pre-agreed (e.g., protocol-specified) arrangement sequence of the respective information, thereby reducing the indication overhead to some extent.

In the embodiments of the present application, each term and english abbreviation are given as exemplary examples for convenience of description, and should not be construed as limiting the present application in any way. The present application does not exclude the possibility of defining other terms in existing or future protocols that perform the same or similar functions.

In embodiments of the present application, the terms "first," "second," "third," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first", "a second", or a third "may explicitly or implicitly include one or more such feature.

The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application.

Claims

1. A method for sending a message, the method being applied to a target node, the method comprising:

2. The method of claim 1, wherein the locally obtaining the second hop count information comprises:

3. The method of claim 2, wherein the preset frequency table comprises a plurality of preset frequency groups, each preset frequency group comprising a frequency corresponding to a hop count of each node, the preset frequency groups being used by the ad hoc network to complete one-time forwarding;

Determining a first frequency of the node hop count corresponding to the local node hop count in a first preset frequency group according to the local node hop count, wherein the first preset frequency group is one of a plurality of preset frequency groups, and the first preset frequency group is determined by setting of management nodes in the self-organizing network;

4. The method of claim 3, wherein the first multicast message further comprises frequency setting information;

Acquiring an n+1th first forwarding message;

5. The method of claim 3, wherein prior to said locally acquiring the second hop count information, the method further comprises:

And when the transmission times are greater than 1, in a plurality of continuous flush forwarding time slots, transmitting an nth second flush forwarding message to one or more next-hop nodes in each flush forwarding time slot, wherein the flush forwarding time slots are determined by the management node according to the transmission times of each node and the node hop count.

6. The method according to claim 5, wherein the number of transmissions is obtained by a network search process comprising the steps of:

7. The method of claim 6, wherein after the receiving of the third search message, the method further comprises:

8. The method of claim 6, wherein the frequency corresponding to the first search hop count information in a preset frequency table and the frequency corresponding to the second search hop count information in the preset frequency table are each one of a preset network search frequency group, the preset network search frequency group being one of a plurality of the preset frequency groups;

9. An electronic device comprising a memory storing a computer program and a processor implementing the method of any one of claims 1 to 8 when the computer program is executed by the processor.

10. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the method of any one of claims 1 to 8.