CN110932980B - Communication method, terminal, and computer-readable storage medium - Google Patents

Abstract

The embodiment of the invention relates to the technical field of communication, and discloses a communication method, which comprises the following steps: acquiring at least M addresses, wherein M is ≧ 2; respectively and simultaneously searching nodes which can communicate with each address in the M addresses within a first preset time length; and selecting an address with the node number larger than a first threshold value from the M addresses as a first sending address, sending first to-be-transmitted information to a plurality of first nodes which can be communicated with the first sending address, and acquiring first return information of the plurality of first nodes returning to the first sending address. The invention also provides a terminal and a computer readable storage medium. The communication method, the terminal and the computer readable storage medium provided by the invention can improve the message transmission efficiency on the premise of ensuring the message transmission reliability.

Description

Communication method, terminal, and computer-readable storage medium

technical field

Embodiments of the present invention relate to the field of communication technologies, and in particular, to a communication method, a terminal, and a computer-readable storage medium.

Background technique

In chat software, centralized servers are generally used to provide background services, but in some scenarios, for security reasons, DHT networks are preferred for communication. The full name of DHT is Distributed Hash Table, which is a distributed storage method. That is, without the need for a server, each client is responsible for a small range of routing and is responsible for storing a small portion of data, thereby realizing addressing and storage of the entire DHT network. In the prior art, there are two steps to send a message in the network environment of DHT, respectively: 1) search for a group of nodes whose addresses are relatively close and online; 2) send the corresponding content to this group of nodes .

The inventor finds that there are at least the following problems in the prior art: in order to ensure the reliability of message transmission, it usually takes a long time to find a node corresponding to an address, resulting in low efficiency of message transmission.

SUMMARY OF THE INVENTION

The purpose of the embodiments of the present invention is to provide a communication method, a terminal, and a computer-readable storage medium, which can improve the efficiency of message transmission on the premise of ensuring the reliability of message transmission.

In order to solve the above-mentioned technical problem, an embodiment of the present invention provides a communication method, including: acquiring at least M addresses, where M≧2; within a first preset time period, searching for each of the M addresses separately and simultaneously. nodes with communicable addresses; select an address whose number of nodes is greater than the first threshold from the M addresses as the first sending address, and send the first sending address to a plurality of first nodes that can communicate with the first sending address information to be transmitted, and obtain the first reply information returned by the plurality of first nodes to the first sending address.

Embodiments of the present invention also provide a terminal, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores a program executable by the at least one processor. instructions, the instructions being executed by the at least one processor to enable the at least one processor to perform a communication method as claimed in any one of claims 1 to 7.

Embodiments of the present invention also provide a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the above-mentioned communication method is implemented.

Compared with the prior art, the embodiment of the present invention searches for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period, because the communicable nodes corresponding to the M addresses are searched for. , which can ensure that at least one of the M addresses corresponds to the number of nodes that meet the requirements, so that an address whose number of nodes is greater than the first threshold can be selected from the M addresses as the first sending address, that is, to ensure that This ensures that the number of communicable nodes corresponding to the first sending address can meet the demand, thereby ensuring the reliability of message sending. Therefore, it is not necessary to set the first preset duration to be too large to ensure that the number of nodes is large enough. At the same time, since there are M addresses The communicable nodes corresponding to each address are searched at the same time, that is, the concurrent processing of the program is used to make the searched nodes many and fast, so that it only takes the first preset time to complete the communication corresponding to the M addresses. The search of the communication node reduces the search time of the node corresponding to the address and improves the efficiency of message transmission.

In addition, after searching for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period, the method further includes: comparing each of the M addresses with the found node respectively. Associating and saving the nodes with which it can communicate; after acquiring the first reply information returned by the multiple first nodes, the method further includes: selecting another address whose number of nodes is greater than the first threshold from the M addresses as the second sending address, and obtain multiple second nodes associated with the second sending address; send second information to be transmitted to the multiple second nodes, and obtain the multiple second nodes and return the The second reply information of the second sending address. By associating and saving each of the M addresses with the found node that can communicate with it, the address and the associated node can be selected from the current M addresses when sending a message later, without the need for each time Node search is performed for all messages sent, which further improves the efficiency of message transmission.

In addition, after searching for nodes that can communicate with each of the M addresses within the first preset time period, respectively and simultaneously, the method further includes: marking the addresses of the M addresses whose number of nodes is greater than the first threshold. ; The marked addresses in the M addresses are respectively associated with the found and communicable nodes and save; The described M addresses are selected from an address whose number of nodes is greater than the first threshold as the first The sending address is specifically: selecting an address from the marked addresses as the first sending address.

In addition, after acquiring the first reply information returned by the plurality of first nodes, the method further includes: selecting another address from the marked addresses as a second sending address, and obtaining the address related to the second sending address. multiple second nodes associated with the addresses; sending second information to be transmitted to the multiple second nodes, and acquiring second reply information returned by the multiple second nodes to the second sending address. By marking the addresses with the number of nodes greater than the first threshold in the M addresses, and associating and saving the marked addresses in the M addresses with the found nodes that can communicate with them, so that when sending the first Second, for the information to be transmitted, another address can be directly selected from the marked addresses as the second sending address, and there is no need to search for nodes every time a message is sent, which further improves the efficiency of message transmission.

In addition, after the second sending address is selected, the method further includes: acquiring the address number of the addresses whose node number is greater than the first threshold in the M addresses; if the address number is less than the second threshold, the second Within a preset time period, nodes that can communicate with each of the P addresses are searched separately and simultaneously, wherein the P addresses do not overlap with the M addresses. If the number of addresses is less than the second threshold, within the second preset time period, separately and simultaneously search for nodes that can communicate with each of the P addresses, that is, when the number of remaining available addresses is insufficient, The search for the communicable nodes of the next batch of addresses is carried out in advance, so that the searched addresses can be directly obtained when sending a message, which saves time waiting for addresses to find communicable nodes, and improves the efficiency of message sending.

In addition, the acquiring at least M addresses is specifically: acquiring at least the M addresses and the P addresses.

In addition, the acquiring at least M addresses is specifically: acquiring the M addresses; before searching for nodes that can communicate with each of the P addresses respectively and simultaneously within the second preset time period, further comprising: : Obtain the P addresses, where P≧2.

Description of drawings

One or more embodiments are exemplified by the pictures in the corresponding drawings, and these exemplifications do not constitute limitations of the embodiments, and elements with the same reference numerals in the drawings are denoted as similar elements, Unless otherwise stated, the figures in the accompanying drawings do not constitute a scale limitation.

1 is a flowchart of a communication method provided by a first embodiment of the present invention;

2 is a flowchart of a communication method provided by a second embodiment of the present invention;

3 is a flowchart of a communication method provided by a third embodiment of the present invention;

4 is a flowchart of a communication method provided by a fourth embodiment of the present invention;

5 is a flowchart of a communication method provided by a fifth embodiment of the present invention;

FIG. 6 is a schematic structural diagram of a terminal provided by a sixth embodiment of the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the embodiments of the present invention clearer, the various embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, those of ordinary skill in the art can appreciate that, in the various embodiments of the present invention, many technical details are set forth in order for the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solutions claimed in the present application can be realized.

The first embodiment of the present invention relates to a communication method, as shown in FIG. 1 , including the following steps:

S11: Acquire at least M addresses.

Specifically, only M addresses can be obtained, or more than M addresses can be obtained. The specific form of the address is similar to the SHA1 hash value, and it can be an integer of up to 160 bits, which is randomly generated, which is similar to the SHA1 hash value. The probability of other nodes having the same address is very small, almost impossible.

S12: Within the first preset time period, separately and simultaneously search for nodes that can communicate with each of the M addresses.

In this step, the search duration is set as the first preset duration, and the nodes that can communicate with each of the M addresses are searched separately and simultaneously, and the steps of searching for the nodes that can communicate with each address are performed simultaneously, When the search time period reaches the first preset time period, the search of each node that can communicate with each address is stopped. Among them, the first preset duration can be set as required, and it can be set to a value that does not affect the chatting experience, such as 5 seconds, M can be set according to experience, as long as it is ensured that within the first preset duration, respectively And when searching for nodes that can communicate with each of the M addresses at the same time, there is at least one address that can find the number of communicable nodes that can meet the needs of sending the first information to be transmitted and replying to the information. For example, M is equal to 20. At this time, there are usually 30% to 50% of the addresses found and the number of communicable nodes that can meet the demand.

Specifically, "a node that can communicate with an address" can be understood as a node that is close to the address and is online, wherein the distance between two nodes is not measured by physical distance or router hop count, and the distance d is defined by It is the bit-by-bit binary sum of the two ID values, that is, assuming that the IDs of the two nodes are a and b, respectively, there is: d=a XORb. Each node can judge the distance between other nodes according to this distance concept. When the value of d is large, the distance between nodes is farther, and when the value of d is small, the two nodes are very close. The "far and near" and "distance" here are only a logical metric description, that is, the metric of distance here is non-directional, that is to say, the distance from a to b is always equal to the distance from b to a.

In practical applications, the search process of the communicable nodes corresponding to each address is roughly as follows: a. The query initiator selects several nodes closest to the target ID from its own k-bucket, and sends asynchronous messages to these nodes at the same time. Query request; b. After the queried node receives the request, it will find out several nodes that it knows are closest to the query target ID from its own k-bucket, and return it to the initiator; c. The initiator receives the request. After the returned information, select a number of nodes that have not been requested from all the known nodes that are closer to the target, and repeat step 1; d. The above steps are repeated until it is impossible to obtain k that is better than the current known by the queryer. The nodes are closer to the active node of the target; e. During the query process, the nodes that do not respond in time will be immediately excluded; the queryer must ensure that the k most nodes obtained are active.

S13: Select an address whose number of nodes is greater than the first threshold from the M addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain multiple first sending addresses. A node returns the first reply information of the first sending address.

In this step, addresses can be sequentially extracted from the M addresses according to the generation sequence of the M addresses, and it is determined whether the number of nodes that can communicate with the address is greater than the first threshold, until the number of nodes that can communicate with the extracted address is greater than the first threshold. threshold, it is used as the first sending address, where the first threshold can be set as required. In this embodiment, the first threshold is the minimum number of nodes that can ensure that the message to be transmitted can be sent and the first reply message can be received .

It can be understood that, when the number of addresses obtained in step S11 is greater than M, selecting the first sending address may be selected from all addresses in the order in which the addresses are generated. At this time, there may be selected addresses that have not been searched for. For nodes that can communicate, it is necessary to load (that is, find nodes that can communicate with addresses) a batch of addresses, and wait for the batch of addresses to be loaded before using the addresses. If the subsequent addresses are loaded, they are prepared for subsequent use. , because it does not affect this use, you don't have to wait.

After selecting the first sending address, the terminal sends the first information to be transmitted to a plurality of first nodes that can communicate with the first sending address, and sends the first information to be transmitted to the target address via the plurality of first nodes, and the target terminal The returned first reply information is returned to the first sending address via the original path for sending the information, so as to be received by the terminal.

Compared with the prior art, the embodiment of the present invention searches for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period, because the communicable nodes corresponding to the M addresses are searched for. , which can ensure that at least one of the M addresses corresponds to the number of nodes that meet the requirements, so that an address whose number of nodes is greater than the first threshold can be selected from the M addresses as the first sending address, that is, to ensure that This ensures that the number of communicable nodes corresponding to the first sending address can meet the demand, thereby ensuring the reliability of message sending. Therefore, it is not necessary to set the first preset duration to be too large to ensure that the number of nodes is large enough. At the same time, since there are M addresses The communicable nodes corresponding to each address are searched at the same time, that is, the concurrent processing of the program is used to make the searched nodes many and fast, so that it only takes the first preset time to complete the communication corresponding to the M addresses. The search of the communication node reduces the search time of the node corresponding to the address and improves the efficiency of message transmission.

A second embodiment of the present invention relates to a communication method. The second embodiment is substantially the same as the first embodiment, and the main difference is that: in the second embodiment of the present invention, within the first preset time period, the search is performed separately and simultaneously for each of the M addresses. After addressing the communicable nodes, the method further includes: associating and saving each of the M addresses with the found communicable nodes respectively; and obtaining the first replies returned by the plurality of first nodes After obtaining the information, the method further includes: selecting another address whose number of nodes is greater than the first threshold from the M addresses as the second sending address, and acquiring a plurality of second nodes associated with the second sending address; The plurality of second nodes send second information to be transmitted, and obtain second reply information returned by the plurality of second nodes to the second sending address. By associating and saving each of the M addresses with the found node that can communicate with it, the address and the associated node can be selected from the current M addresses when sending a message later, without the need for each time Node search is performed for all messages sent, which further improves the efficiency of message transmission.

The communication method in this embodiment, as shown in Figure 2, specifically includes the following steps:

S21: Acquire at least M addresses.

S22: Search for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period.

S23: Associate and save each of the M addresses with the found node that can communicate with it.

Specifically, each address is associated and saved with the found node that can communicate with it, so that the associated node that can communicate with it can be found in the process of taking out the address and using it later. Each address is saved, so the remaining addresses after the message is sent this time can also be reserved for subsequent sending of other messages.

S24: Select an address with a number of nodes greater than the first threshold from the M addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain multiple first sending addresses A node returns the first reply information of the first sending address.

S25: Select another address with a number of nodes greater than the first threshold from the M addresses as the second sending address, obtain multiple second nodes associated with the second sending address, and send the second pending address to the multiple second nodes Information is transmitted, and second reply information returned by multiple second nodes to the second sending address is obtained.

In this step, the addresses after the first sending address can be sequentially extracted according to the generation sequence of the M addresses, and it is determined whether the number of nodes that can communicate with the address is greater than the first threshold, until the number of nodes that can communicate with the extracted address is greater than the number of nodes that can communicate with the address. If a threshold is reached, it is used as the second sending address. After that, the terminal sends the second information to be transmitted to multiple second nodes that can communicate with the second sending address, and sends the second information to be transmitted via multiple first nodes. To the target address, the second reply information returned by the target terminal returns to the second sending address via the original path for sending the information, so as to be received by the terminal.

Steps S21 , S22 , and S24 in this embodiment are similar to steps S11 , S12 , and S13 in the first embodiment, and are not repeated here in order to avoid repetition.

Compared with the prior art, the embodiment of the present invention not only ensures the reliability of message transmission, but also reduces the search time of the node corresponding to the address, and improves the efficiency of message transmission; Each address is associated with the found node that can communicate with it and saved, so that the address and the associated node can be selected from the M addresses this time when sending a message later, without the need to search for a node every time a message is sent, and further The efficiency of message transmission is improved.

A third embodiment of the present invention relates to a communication method. The third embodiment is substantially the same as the second embodiment, and the main difference is that: in the second embodiment, within the first preset time period, the search is performed separately and simultaneously for each address in the M addresses. After communicating with the node, the method further includes: associating and saving each address of the M addresses with the found node that can communicate with it. In the third embodiment of the present invention, after searching for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period, the method further includes: adding the number of nodes in the M addresses to the number of nodes in the M addresses. The addresses larger than the first threshold are marked; the marked addresses among the M addresses are respectively associated with the found nodes that can communicate with them and saved. By associating and saving only the addresses of the M addresses whose number of nodes is greater than the first threshold with the corresponding nodes, the space occupied by the memory is reduced.

The communication method in this embodiment, as shown in Figure 3, specifically includes the following steps:

S31: Acquire at least M addresses.

S32: Within the first preset time period, separately and simultaneously search for nodes that can communicate with each of the M addresses.

S33: Mark the addresses in the M addresses whose number of nodes is greater than the first threshold, and associate and save the marked addresses in the M addresses with the found nodes that can communicate with them, respectively.

In this step, the addresses can be taken out in sequence according to the generation sequence of the M addresses, and it is determined whether the number of nodes that can communicate with the addresses is greater than the first threshold. Associate and save the node with which it can communicate.

S34: Select an address from the marked addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain multiple first nodes and return the first sending address The address of the first reply message.

In this step, since the marked addresses are all addresses whose number of nodes is greater than the first threshold, selecting one address from the marked addresses as the first sending address ensures that the number of nodes that can communicate with the first sending address can satisfy This ensures that the terminal sends the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and the terminal subsequently obtains the target address and returns the first reply information to the first sending address via multiple first nodes. reliability.

S35: Select another address from the marked addresses as the second sending address, obtain multiple second nodes associated with the second sending address, send the second information to be transmitted to multiple second nodes, and obtain multiple second nodes. The second node returns the second reply information of the second sending address.

In this step, another address may be selected from the marked addresses as the second sending address according to the order in which the marked addresses are saved. When the terminal needs to send other messages later, it may send a message to the address that can communicate with the second sending address. The plurality of second nodes send the second information to be transmitted, and obtain first reply information that the target address returns to the first sending address via the plurality of first nodes.

Steps S31 and S32 in this embodiment are similar to steps S21 and S22 in the second embodiment, and are not repeated here to avoid repetition.

Compared with the prior art, the embodiment of the present invention not only ensures the reliability of message transmission, but also reduces the search time of the node corresponding to the address, and improves the efficiency of message transmission; Each address is associated with the found node that can communicate with it and saved, so that the address and the associated node can be selected from the M addresses this time when sending a message later, without the need to search for a node every time a message is sent, and further The efficiency of message transmission is improved; and, by associating and saving only the addresses in the M addresses whose number of nodes is greater than the first threshold with the corresponding nodes, the space occupied by the memory is reduced.

A fourth embodiment of the present invention relates to a communication method. The fourth embodiment is substantially the same as the third embodiment, and the main difference is that: in the fourth embodiment of the present invention, after the second sending address is selected, the method further includes: acquiring the remaining nodes in the M addresses The number of addresses of addresses whose number is greater than the first threshold; if the number of addresses is less than the second threshold, within the second preset time period, separately and simultaneously search for nodes that can communicate with each of the P addresses, where all The P addresses do not overlap the M addresses. If the number of addresses is less than the second threshold, within the second preset time period, separately and simultaneously search for nodes that can communicate with each of the P addresses, that is, when the number of remaining available addresses is insufficient, The search for the communicable nodes of the next batch of addresses is carried out in advance, so that the searched addresses can be directly obtained when sending a message, which saves time waiting for addresses to find communicable nodes, and improves the efficiency of message sending.

The communication method in this embodiment, as shown in FIG. 4 , specifically includes the following steps:

S41: Obtain at least M addresses and P addresses.

That is, only M addresses and P addresses to be used for subsequent two loads may be generated, or more addresses may be generated for subsequent use, that is, multiple batches of addresses to be loaded are generated at one time.

S42: Within the first preset time period, separately and simultaneously search for nodes that can communicate with each of the M addresses.

S43: Mark the addresses in the M addresses whose number of nodes is greater than the first threshold, and associate and save the marked addresses in the M addresses with the found nodes that can communicate with them, respectively.

S44: Select one address from the marked addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain multiple first nodes and return the first sending address The address of the first reply message.

S45: Select another address from the marked addresses as the second sending address, obtain multiple second nodes associated with the second sending address, send the second information to be transmitted to multiple second nodes, and obtain multiple second nodes. The second node returns the second reply information of the second sending address.

S46: Obtain the number of addresses remaining in the marked addresses.

In this step, the number of remaining addresses is specifically: the number of addresses among the marked addresses that are not used as sending addresses to send messages, that is, the number of addresses whose number of unused nodes is greater than the first threshold.

S47: When the number of addresses is less than the second threshold, within the second preset time period, search for nodes that can communicate with each of the P addresses respectively and simultaneously.

Wherein, the P addresses do not overlap with the M addresses, that is, the P addresses are another batch of new addresses, and when the number of addresses is less than the second threshold, within the second preset duration, respectively And at the same time search for nodes that can communicate with each of the P addresses, wherein the second threshold can be set as required, for example, the second threshold can be 5, that is, when the remaining marked addresses are When the number is less than 5, start to search for nodes that can communicate with each address in the next batch of P addresses.

Specifically, the second preset duration may be the same as or different from the first preset duration, and P may or may not be equal to N. Optionally, P≧2. The specific search process is similar to that described above, and will not be repeated here.

Steps S41 , S42 , S43 , S44 , and S45 in this embodiment are similar to steps S31 , S32 , S33 , S34 , and S35 in the second embodiment, and in order to avoid repetition, they will not be repeated here.

Of course, steps S41, S42, S43, S44, and S45 in this embodiment can also be similar to steps S21, S22, S23, S24, and S25 in the second embodiment. In this case, the remaining M addresses can be obtained. number of addresses, if the number of addresses is less than the third threshold, then within a third preset time period, separately and simultaneously search for nodes that can communicate with each of the N addresses, where the N addresses and the The M addresses do not overlap, and the third threshold can be set as required, for example, five. The third preset duration and the first preset duration can be the same or different. To avoid repetition, details are not repeated here.

Compared with the prior art, the embodiment of the present invention not only ensures the reliability of message transmission, but also reduces the search time of the node corresponding to the address, and improves the efficiency of message transmission; Each address is associated with the found node that can communicate with it and saved, so that the address and the associated node can be selected from the M addresses this time when sending a message later, without the need to search for a node every time a message is sent, and further The efficiency of message transmission is improved; and, by only associating and saving the addresses with the number of nodes in the M addresses greater than the first threshold with the corresponding nodes, the space occupied by the memory is reduced; When the number of available addresses is insufficient, the next batch of addresses can be searched for communicable nodes in advance, so that the searched addresses can be directly obtained when sending a message, which saves the time waiting for addresses to find communicable nodes and improves the message Efficiency of sending.

A fifth embodiment of the present invention relates to a communication method. The fifth embodiment is substantially the same as the fourth embodiment, and the main difference is that: in the fourth embodiment, the acquiring at least M addresses is specifically: acquiring at least M addresses and P addresses. In the fifth embodiment of the present invention, the acquiring at least M addresses is specifically: acquiring the M addresses; and searching for each address in the P addresses separately and simultaneously within the second preset time period Before the communicable nodes, the method further includes: acquiring the P addresses. By generating the next batch of addresses when the communicable nodes of the next batch of addresses need to be searched, the waste of time caused by generating too many addresses at one time and not being used later is avoided. delivery efficiency.

The communication method in this embodiment, as shown in FIG. 5 , specifically includes the following steps:

S51: Obtain M addresses.

In this step, only the address required for this loading (finding the node that can communicate with the address) is generated, so that too much time is not wasted for generating the address, and the efficiency of subsequent sending of the first information to be transmitted is improved.

S52: Search for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period.

S53: Mark the addresses in the M addresses whose number of nodes is greater than the first threshold, and associate and save the marked addresses in the M addresses with the found nodes that can communicate with them, respectively.

S54: Select one address from the marked addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain multiple first nodes and return the first sending address The address of the first reply message.

S55: Select another address from the marked addresses as the second sending address, obtain multiple second nodes associated with the second sending address, send the second information to be transmitted to multiple second nodes, and obtain multiple second nodes. The second node returns the second reply information of the second sending address.

S56: Obtain the number of addresses remaining in the marked addresses.

S57: When the number of addresses is less than the second threshold, acquire the P addresses, and search for nodes that can communicate with each of the P addresses respectively and simultaneously within a second preset time period.

In this step, the process of acquiring the P addresses is similar to the aforementioned process of acquiring the M addresses. "In the second preset time period, separately and simultaneously search for nodes that can communicate with each of the P addresses" and the first The fourth embodiment is similar and will not be repeated here. The second preset duration and the first preset duration may be the same or different, and P may or may not be equal to N. Optionally, P≧2.

Steps S52 , S53 , S54 , S55 , and S56 in this embodiment are similar to steps S42 , S43 , S44 , S45 , and S46 in the second embodiment, and are not repeated here to avoid repetition.

Compared with the prior art, the embodiment of the present invention not only ensures the reliability of message transmission, but also reduces the search time of the node corresponding to the address, and improves the efficiency of message transmission; Each address is associated with the found node that can communicate with it and saved, so that the address and the associated node can be selected from the M addresses this time when sending a message later, without the need to search for a node every time a message is sent, and further The efficiency of message transmission is improved; and, by only associating and saving the addresses with the number of nodes in the M addresses greater than the first threshold with the corresponding nodes, the space occupied by the memory is reduced; When the number of available addresses is insufficient, the next batch of addresses can be searched for communicable nodes in advance, so that the searched addresses can be directly obtained when sending a message, which saves the time waiting for addresses to find communicable nodes and improves the message Moreover, by regenerating the next batch of addresses when the communicable nodes of the next batch of addresses need to be searched, the time waste caused by generating too many addresses at one time and not being used subsequently is avoided, and at the same time, the The transmission efficiency of the first information to be transmitted.

The steps of the above various methods are divided only for the purpose of describing clearly. During implementation, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as the same logical relationship is included, they are all within the protection scope of this patent. ;Adding insignificant modifications to the algorithm or process or introducing insignificant designs, but not changing the core design of the algorithm and process are all within the scope of protection of this patent.

The sixth embodiment of the present invention relates to a terminal, as shown in Figure 6, comprising:

at least one processor 601; and,

a memory 602 in communication with the at least one processor 601; wherein,

The memory 602 stores instructions executable by the at least one processor 601, and the instructions are executed by the at least one processor 601 to enable the at least one processor 601 to perform the above-described communication method.

The memory 602 and the processor 601 are connected by a bus, and the bus may include any number of interconnected buses and bridges, and the bus connects one or more processors 601 and various circuits of the memory 602 together. The bus may also connect together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides the interface between the bus and the transceiver. A transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other devices over a transmission medium. The data processed by the processor 601 is transmitted on the wireless medium through the antenna, and further, the antenna also receives the data and transmits the data to the processor 601 .

Processor 601 is responsible for managing the bus and general processing, and may also provide various functions, including timing, peripheral interface, voltage regulation, power management, and other control functions. The memory 602 may be used to store data used by the processor 601 when performing operations.

A seventh embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The above method embodiments are implemented when the computer program is executed by the processor.

That is, those skilled in the art can understand that all or part of the steps in the method for implementing the above embodiments can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium and includes several instructions to make a device ( It may be a single chip microcomputer, a chip, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: U disk, removable hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes.

Those of ordinary skill in the art can understand that the above-mentioned embodiments are specific examples for realizing the present invention, and in practical applications, various changes in form and details can be made without departing from the spirit and the spirit of the present invention. scope.

Those skilled in the art can understand that the above-mentioned embodiments are specific examples for realizing the present invention, and in practical applications, various changes in form and details can be made without departing from the spirit and the spirit of the present invention. scope.

Claims (9)

1. a communication method, is characterized in that, comprises: Obtain at least M addresses, where M≧2; Within a first preset time period, separately and simultaneously search for nodes that can communicate with each of the M addresses; Select an address with a number of nodes greater than the first threshold from the M addresses as the first sending address, send the first information to be transmitted to multiple first nodes that can communicate with the first sending address, and obtain all the addresses to be transmitted. The multiple first nodes return first reply information of the first sending address, where the first sending address is an address used by the terminal to send the first information to be transmitted. 2. The communication method according to claim 1, wherein, after searching for nodes that can communicate with each of the M addresses respectively and simultaneously within the first preset time period, the method further comprises: Associating and saving each of the M addresses with the found node that can communicate with it; After the acquiring the first reply information returned by the multiple first nodes, the method further includes: Select another address whose number of nodes is greater than the first threshold from the M addresses as the second sending address, and acquire a plurality of second nodes associated with the second sending address; Send second information to be transmitted to the plurality of second nodes, and obtain second reply information returned by the plurality of second nodes to the second sending address. 3. The communication method according to claim 1, characterized in that, after searching for a node that can communicate with each of the M addresses respectively and simultaneously within the first preset duration, the method further comprises: marking the addresses whose number of nodes is greater than the first threshold in the M addresses; Associating and saving the marked addresses in the M addresses with the found nodes that can communicate with them respectively; The selecting an address whose number of nodes is greater than the first threshold is selected from the M addresses as the first sending address, specifically: An address is selected from the marked addresses as the first sending address. 4. The communication method according to claim 3, wherein after acquiring the first reply information returned by the plurality of first nodes, the method further comprises: Selecting another address from the marked addresses as the second sending address, and acquiring a plurality of second nodes associated with the second sending address; Send second information to be transmitted to the plurality of second nodes, and obtain second reply information returned by the plurality of second nodes to the second sending address. 5. The communication method according to any one of claims 2 or 4, wherein after selecting the second sending address, the method further comprises: Acquire the number of addresses of addresses where the number of nodes remaining in the M addresses is greater than the first threshold; If the number of addresses is less than the second threshold, within a second preset period of time, separately and simultaneously search for nodes that can communicate with each of the P addresses, where the P addresses and the M addresses are different from each other. overlapping. 6 . The communication method according to claim 5 , wherein the acquiring at least M addresses is specifically: acquiring at least the M addresses and the P addresses. 7 . 7. The communication method according to claim 5, wherein the acquiring at least M addresses is specifically: obtain the M addresses; Before searching for nodes that can communicate with each of the P addresses respectively and simultaneously within the second preset time period, the method further includes: Obtain the P addresses, where P≧2. 8. A terminal, characterized in that, comprising: at least one processor; and, a memory communicatively coupled to the at least one processor; wherein, The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform any one of claims 1 to 7 communication method. 9 . A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the communication method according to any one of claims 1 to 7 is implemented. 10 .

Images