WO2021146911A1 - 路由的建立方法及装置、电子设备以及计算机存储介质 - Google Patents

路由的建立方法及装置、电子设备以及计算机存储介质 Download PDF

Info

Publication number
WO2021146911A1
WO2021146911A1 PCT/CN2020/073494 CN2020073494W WO2021146911A1 WO 2021146911 A1 WO2021146911 A1 WO 2021146911A1 CN 2020073494 W CN2020073494 W CN 2020073494W WO 2021146911 A1 WO2021146911 A1 WO 2021146911A1
Authority
WO
WIPO (PCT)
Prior art keywords
request message
node
hop relay
network
received
Prior art date
Application number
PCT/CN2020/073494
Other languages
English (en)
French (fr)
Inventor
李伟
Original Assignee
深圳市汇顶科技股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市汇顶科技股份有限公司 filed Critical 深圳市汇顶科技股份有限公司
Priority to CN202080001505.3A priority Critical patent/CN111837424A/zh
Priority to PCT/CN2020/073494 priority patent/WO2021146911A1/zh
Publication of WO2021146911A1 publication Critical patent/WO2021146911A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Definitions

  • the embodiments of the present application relate to the field of communication technology, and in particular, to a method and device for establishing a route, electronic equipment, and a computer storage medium.
  • a relay node In order to realize the transmission of target data from the source node in the communication network to the destination node, a relay node is usually determined from the network node of the communication network to establish a route.
  • the established route can include multiple mediums.
  • the relay node realizes the transmission of target data from the source node to the destination node in a multi-hop data transmission manner through the forwarding of the multiple relay nodes.
  • each transmission target data must be forwarded multiple times to reach the destination node, which leads to an increase in the number of network nodes working in the communication network, resulting in a large number of repeated invalid data and speeding up the network.
  • the energy consumption of the node when the number of network nodes in the communication network is large, each transmission target data must be forwarded multiple times to reach the destination node, which leads to an increase in the number of network nodes working in the communication network, resulting in a large number of repeated invalid data and speeding up the network. The energy consumption of the node.
  • the BLE mesh specification introduces friendly nodes (Friend Node) and low power nodes (Low Power Node).
  • Low power nodes refer to battery-powered network nodes such as some sensors.
  • Friendly nodes are Refers to a network node such as a smart light tube powered by a continuous power supply (for example, hardware resources and software resources with data storage and processing). In the BLE mesh specification, low-power nodes stay asleep most of the time and periodically wake up to receive subscribed target data.
  • the low-power node will be The friendly node corresponding to the node temporarily stores the target data, and after the low-power node wakes up, the friendly node forwards the target data to the low-power node. This relationship between friendly nodes and low-power nodes is called Friendship.
  • the inventor found that in the process of establishing a route based on the above-mentioned BLE mesh specification, only the requirement of the shortest communication distance between nodes is considered, and in some cases, the normal transmission of target data may not be achieved. For example, because the low-power node is powered by a battery, if the low-power node with less remaining power is used as a relay node, when the target data is forwarded, the remaining power is too small to achieve normal transmission of the target data.
  • one of the technical problems solved by the embodiments of the present application is to provide a route establishment method and device, electronic equipment, and computer storage medium to overcome or alleviate the above-mentioned defects in the prior art.
  • an embodiment of the present application provides a route establishment method, which includes:
  • Determining that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node;
  • a relay node is determined from network nodes other than the source node in the communication network, and the relay node is used to send the target data to the source node Perform forwarding processing so as to be received by the destination node;
  • an embodiment of the present application provides an apparatus for establishing a route, which is characterized in that it includes:
  • An end node determination module used for determining that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node;
  • the relay node determining module is configured to determine a relay node from the network nodes of the communication network according to at least the set node power balance rule, and the relay node is used to forward the target data sent by the source node Processed so as to be received by the destination node;
  • the route establishment module is configured to establish a route for the source node to send the target data to the destination node according to the source node, the destination node, and the determined relay node.
  • an embodiment of the present application provides an electronic device, including: a processor, a communication interface, a memory, and a communication bus.
  • the processor, the communication interface, and the memory complete mutual communication through the communication bus.
  • the memory is used to store at least one executable instruction, and the executable instruction causes the processor to perform an operation corresponding to the method described in any one of the embodiments of the first aspect of the present application.
  • an embodiment of the present application provides a computer storage medium on which a computer program is stored, and when the program is executed by a processor, the method as described in any one of the embodiments of the first aspect of the present application is implemented.
  • the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node; at least according to the set node power balance rule, remove from the communication network
  • a relay node is determined from a network node other than the source node, and the relay node is configured to forward the target data sent by the source node so as to be received by the destination node;
  • the node, the destination node, and the determined relay node establish a route for the source node to send the target data to the destination node.
  • the communication distance between nodes and also considers the remaining power or energy consumption of the network nodes, so that the relay node in the route not only meets the requirements of the communication distance for forwarding the target data, but also meets the requirements when forwarding the target data.
  • the power or energy consumption requirements can effectively achieve the target data transmission. For example, in some cases, it is avoided that low-power nodes with less remaining power are used as the medium when only considering the communication distance requirements when establishing a route. When the subsequent node is forwarding the target data, it cannot realize the normal transmission of the target data due to its low remaining power.
  • Fig. 1 is a schematic flow chart of a method for establishing a route provided in the first implementation of this application;
  • FIG. 2A is a schematic flow chart of a method for establishing a route provided in Embodiment 2 of this application;
  • step S202 is a schematic flowchart of step S202 in the second embodiment of this application.
  • FIG. 2C is a schematic diagram of another process of step S202 in the second embodiment of this application.
  • 3A is a schematic diagram of the communication network structure provided in the third embodiment of this application.
  • Fig. 3B is a schematic diagram of the data structure of a route request message
  • Figure 3C is a schematic diagram of the data structure of routing table entries
  • 3D is a schematic diagram of the data structure of a relay request message according to an embodiment of the application.
  • 3E is a schematic diagram of another communication network structure provided in the third embodiment of this application.
  • FIG. 4A is a schematic structural diagram of an apparatus for establishing a route according to Embodiment 4 of this application;
  • 4B is a schematic diagram of the structure of the relay node determining module
  • Fig. 1 is a schematic flow chart of a method for establishing a route provided in the first implementation of the application; as shown in Fig. 1, in this embodiment, it includes the following steps S101-S103:
  • S101 Determine that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node;
  • the communication network may be any network to which the technical solution of this embodiment can be applied, such as a network that meets the BLE mesh specification or other networks that are not BLE mesh specifications.
  • the communication network may include multiple network nodes.
  • the network node that sends the target data is called the source node
  • the network node that receives the target data is called the destination node.
  • the source node and the destination node are both end nodes, the source node serves as a provider of the target data, and the destination node serves as a receiver of the target data.
  • the target data is not particularly limited, and may be data in different forms or structures, such as audio data or user instructions.
  • the node power balance rule is mainly used to control the energy guarantee when the target data is transmitted from the source node to the destination node, for example, including but not limited to preventing network nodes with too little remaining power from participating in routing. Either replace the network node with less remaining power, or make the network node with greater energy consumption not participate in routing, or replace the network node with greater energy consumption, etc.
  • the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node; at least according to the set node power balance rule, remove from the communication network
  • a relay node is determined from a network node other than the source node, and the relay node is configured to forward the target data sent by the source node so as to be received by the destination node;
  • the node, the destination node, and the determined relay node establish a route for the source node to send the target data to the destination node.
  • the relay nodes participating in the route establishment not only meet the requirements of the communication distance of forwarding target data, but also meet the requirements of forwarding target data.
  • the required power or energy consumption requirements can effectively achieve the target data transmission. For example, in some cases, it will avoid the low power consumption when only considering the communication distance requirements when establishing a route, resulting in less remaining power.
  • the node is a relay node, when the target data is forwarded, it cannot realize the normal transmission of the target data due to the low remaining power.
  • Fig. 2A is a schematic flow chart of a method for establishing a route provided in the second embodiment of the application; as shown in Fig. 2A, it includes the following steps S201-S203:
  • S201 Determine that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node;
  • the communication network may be a network that meets the BLE mesh specification or other non-BLE mesh specifications.
  • the communication network may include multiple network nodes.
  • the network node that sends the target data is called the source node
  • the network node that receives the target data is called the destination node.
  • the source node and the destination node are both end nodes, the source node serves as a provider of the target data, and the destination node serves as a receiver of the target data.
  • these network nodes may be devices or terminals or sensors or devices in any form, which are not particularly limited here, as long as they can participate in the transmission of the target data from the source node to the destination.
  • the node can either realize the transmission of the target data from the source node to the destination node, or it can be referred to as a resource that has any function of sending, receiving, and forwarding target data.
  • S202 Determine a relay node from network nodes other than the source node in the communication network according to the set node communication distance balance rule and the node power balance rule.
  • the target data sent by the source node is forwarded so as to be received by the destination node;
  • the node communication distance equalization rule is mainly used to control the transmission of the target data from the source node to the destination node based on the shortest communication distance.
  • the node power balance rule is mainly used to control the energy guarantee when the target data is transmitted from the source node to the destination node, for example, to prevent network nodes with too little power from participating in routing, or to replace the remaining power. Network nodes with less power, or network nodes with greater energy consumption do not participate in routing, or network nodes with greater energy consumption are replaced.
  • the network node responsible for each forwarding is called a relay node.
  • the network node responsible for a certain forwarding is called the current hop relay node, and the network node responsible for the previous forwarding Call it the last hop relay node.
  • Fig. 2B is a schematic diagram of a flow of step S202 in the second embodiment of the application; alternatively, in this embodiment or other embodiments, as shown in Fig. 2B, step S202 is based on the set node communication distance equalization rule and the node
  • the power balance rule when a relay node is determined from network nodes other than the source node in the communication network, may include the following steps S212-S252:
  • S212 According to the set node communication distance equalization rule, make the network nodes in the communication network other than the source node receive the routing request message sent by the source node;
  • the source node can send a routing request message to the network node in the communication network in the form of broadcast, and the network node theory that receives the routing request message The above may be the network node other than the source node.
  • the source node may also send a routing request message to a network node in a communication network in a unicast form.
  • the node communication distance equalization rule is mainly used to control the transmission of the target data from the source node to the destination node based on the shortest communication distance. Therefore, in theory, in the process of establishing a route, all data is received.
  • the network node of the route request message sent by the source node may be one or more network nodes within the communication range of the source node.
  • the destination node may also receive the route request message. For example, in an application scenario, If the physical location of the source node moves, so that the destination node is within the communication distance range of the source node.
  • step S232 according to the set node power balance rule, the network node that has received the routing request message is caused to process the received routing request message, and generate The corresponding first-hop relay request message may specifically include:
  • the network node that successively receives the route request message will parse the received route request message when the corresponding delay time arrives, and generate a corresponding first-hop relay Request message
  • the network node that successively receives the route request message parses the received route request message, and generates the corresponding first hop when the corresponding delay time arrives Relay request message;
  • the network node that has successively received the routing request message parses the received routing request message and generates the corresponding first-hop relay request message, and the corresponding first-hop relay request message is generated Send the first hop relay request message when the delay time of is reached;
  • the network node that receives the route request message parses the received route request message and generates a corresponding first-hop relay request message, and according to the set node power balance rule, causes the received route request message to be received.
  • the network node of the route request message controls the sending sequence of the corresponding first-hop relay request message according to the respective remaining power.
  • the node power balance rule is, for example:
  • the network node that first receives the routing request message is made The corresponding delay time is greater than the delay time corresponding to the network node after receiving the route request message;
  • the network node that first receives the routing request message is made The delay time corresponding to the network node is less than the delay time corresponding to the network node after receiving the route request message;
  • the network node that has received the route request message and has more power remaining sends the corresponding first-hop relay request message earlier than the network node that has less power remaining.
  • the delay time may be inversely proportional to the remaining power, which is not limited in this embodiment.
  • the network node that has successively received the routing request message will parse the received routing request message when the corresponding delay time arrives, and generate the corresponding first hop Following the request message, a network node with more remaining power has a delay time shorter than that of a network node with less remaining power. Therefore, the former is before the latter for the received routing request.
  • the message is parsed;
  • the network nodes that have successively received the routing request message are made to parse the received routing request message, and generate the corresponding first when the corresponding delay time arrives.
  • Hop relay request message the delay time of the network node with more power remaining is less than the delay time of the latter compared with the network node with less power remaining, therefore, the former generates the first hop relay before the latter Request message
  • the network node that successively receives the route request message parses the received route request message and generates the corresponding first-hop relay request message, and When the corresponding delay time is reached, the first hop relay request message is sent, and the network node with more power remaining will have a delay time less than the delay time of the latter compared to the network node with less power remaining. Therefore, the former is first. In the latter, the first hop relay request message is sent.
  • the network node that has received the routing request message parses the received routing request message and generates a corresponding first-hop relay request message, then according to the set node power balance rule, When the network node that has received the route request message controls the sending sequence of the corresponding first-hop relay request message according to their respective remaining power, the network node with more remaining power is earlier than the one with less remaining power. The network node sends the corresponding first-hop relay request message.
  • S252 According to the first hop relay request message, determine a first hop relay node from the network nodes that have received the route request message.
  • the first hop routing node when the first hop routing node is determined from the network nodes that have received the routing request message according to the first hop relay request message in step S252, Including the following steps S2521-S2522:
  • the routing table entry of the network node that receives the route request message may include the parsing time of the route request message, then in step S2522, it may be specifically based on The analysis time of the routing request message in the routing table entry determines the first hop relay node from the network nodes that have received the routing request message.
  • the network node corresponding to the earlier analysis time is selected as the first-hop relay node.
  • the network node that has successively received the routing request message is made to parse the received routing request message, and delay When the time arrives, the corresponding first-hop relay request message is generated, then the routing table entry of the network node that receives the route request message may include the generation time of the first-hop relay request message; then in step In S2522, the first hop relay node may be determined from the network nodes that have received the route request message according to the generation time of the first hop relay request message in the routing table entry.
  • the network node that has successively received the routing request message parses the received routing request message and generates a corresponding first-hop relay request message , And the first hop relay request message is sent when the corresponding delay time arrives, the routing table entry of the network node that receives the route request message may include the sending time of the first hop relay request message , Then in step S2522, the first hop relay can be determined from the network nodes that have received the routing request message according to the sending time of the first hop relay request message in the routing table entry. node.
  • the execution subject of the foregoing step S2522 may specifically be the network node that receives the route request message, or may be a configured control device.
  • the network node that successively receives the routing request message is made to parse the received routing request message and generate a corresponding If the first hop relay request message is sent when the corresponding delay time arrives, the first hop relay request message may include the sending of the first hop relay request message Time, the subject of step S252 may be the network node that receives the first hop relay request message, and the network node that receives the first hop relay request message will generate the first hop received first.
  • the network node that relays the request message serves as the first-hop relay node.
  • the parsing time of the route request message, the generation time of the first hop relay request message, and the sending time of the first hop relay request message may also be stored in the received
  • the locality of the network node of the route request message is not only included in the routing table entry of the network node that receives the route request message.
  • the first hop The generation time of the relay request message and the sending time of the first hop relay request message may include the number of route updates, and then the step S252 receives the The network node of the first-hop relay request message parses the first-hop relay request message received first and generates a second-hop relay request message and a corresponding routing table entry.
  • the routing table entry may include the The number of routing updates; the network node that receives the first-hop relay request message analyzes the first-hop relay request message received later, if the route in the first-hop relay request message received later The number of updates is the same as the number of routing updates in the routing table entry corresponding to the second-hop relay request message, then the first-hop relay request message received after discarding, or also called receiving after wrong The received first-hop relay request message is processed, but the network node that generated the first-hop relay request message received first is directly used as the first-hop relay node.
  • the number of routing updates that may be included in the routing table entry corresponding to the second-hop relay request message may also be stored in the receiving of the first-hop relay request message.
  • the locality of the network node is not only included in the routing table entry corresponding to the second-hop relay request message.
  • the network nodes that have received the route request message can control their correspondence according to their respective remaining power According to the first hop relay request message, in step S252, the first hop relay request message is determined from the network nodes that have received the route request message.
  • the network node that receives the first-hop relay request message will use the network node that generated the first-hop relay request message received first as the first-hop relay node.
  • the relay node that forwards the target data for the first time (that is, the above-mentioned first-hop relay Node), if the determined route has a total of n relay nodes according to the forwarding sequence, the relay node that forwards the target data for the first time is the first-hop relay node.
  • each relay node has a corresponding routing table entry. Therefore, in order to meet the BLE mesh specification, the communication network uses multiple hops (for example, n relay nodes, that is, n hops) to achieve target data transmission.
  • the routing table entry of each relay node includes the identifier of the previous hop relay node.
  • the target data is transmitted from the source node to the destination node. Therefore, there are also routing table entries for the source node and the destination node. Therefore, the route can be established based on the routing table entries of the source node, the destination node, and the determined relay node. For example, in some scenarios, taking n relay nodes as an example, plus the source node and the destination node, for one-way data transmission, there are a total of n+2 routing table entries in the established route.
  • the first hop relay node is determined by performing the above steps S232-S252.
  • step S202 when a relay node is determined from network nodes other than the source node in the communication network according to the set node communication distance balance rule and the node power balance rule, it may further include:
  • S222 According to the set node communication distance equalization rule, enable the network node in the communication network to receive the last hop relay request message sent by the last hop relay node;
  • all network nodes including the source node, the destination node, and other than the source node located within the communication distance of the previous hop relay node A network node other than the destination node) can receive the last hop relay request information.
  • step S242 according to the set node power balance rule, the network node that has received the previous hop relay request message is made to respond to the received previous hop relay request
  • the network node that has received the previous hop relay request message is made to respond to the received previous hop relay request
  • the network nodes that have successively received the last hop relay request message will parse the received last hop relay request message when the corresponding delay time arrives, and Generate the corresponding current hop relay request message;
  • the network node that has successively received the last hop relay request message parses the received last hop relay request message, and the corresponding delay time Generate the corresponding current hop relay request message upon arrival;
  • the network node that successively receives the previous hop relay request message parses the received previous hop relay request message and generates the corresponding current hop Following the request message, and sending the current hop relay request message when the corresponding delay time arrives;
  • the network node that has received the last hop relay request message parses the received last hop relay request message and generates a corresponding current hop relay request message, and according to the set node power
  • the equalization rule enables the network node that has received the previous hop relay request message to control the sending timing of the corresponding current hop relay request message according to their respective remaining power.
  • the node power balance rule is, for example:
  • the remaining power of the network node that first received the last hop relay request message is less than the remaining power of the network node that received the last hop relay request message later, then make the first to receive the The delay time corresponding to the network node of the last hop relay request message is greater than the delay time corresponding to the network node that later receives the last hop relay request message;
  • the remaining power of the network node that first received the last hop relay request message is greater than the remaining power of the network node that later received the last hop relay request message, then make the first received The delay time corresponding to the network node of the last hop relay request message is less than the delay time corresponding to the network node that subsequently receives the last hop relay request message.
  • the network node that has received the last hop relay request message and has more remaining power is made to send the corresponding current hop relay request message earlier than the network node that has less remaining power.
  • the network node that successively receives the last hop relay request message parses the received last hop relay request message when the corresponding delay time arrives, And generate the corresponding current hop relay request message, the delay time of the network node with more power remaining than the network node with less power remaining is less than the delay time of the latter, therefore, the former is before the latter. Parse the received last hop relay request message;
  • the network node that has successively received the last hop relay request message will parse the received last hop relay request message and delay the corresponding
  • the corresponding current hop relay request message is generated, and the delay time of the network node with the more remaining power is less than the delay time of the latter compared with the network node with the less remaining power. Therefore, the former is before the latter.
  • the person generates the current hop relay request message;
  • the network node that successively receives the previous hop relay request message parses the received previous hop relay request message and generates the corresponding current hop Relay request message, and send the current hop relay request message when the corresponding delay time arrives, the delay time of the network node with more power remaining is less than that of the network node with less power remaining Therefore, the former sends the current hop relay request message before the latter.
  • the network node that has received the previous hop relay request message parses the received previous hop relay request message and generates a corresponding current hop relay request message
  • the network node receives the previous hop relay request message.
  • the node power balance rule enables the network nodes that have received the last hop relay request message to control the sending timing of the corresponding current hop relay request message according to their respective remaining power, and the network with more remaining power
  • the node sends the corresponding current hop relay request message before the network node with less remaining power.
  • S262 According to the current hop relay request message, determine the current hop relay node from the network nodes that have received the previous hop relay request message.
  • S2622 determine the current hop relay node from the network nodes that have received the last hop relay request message.
  • the network node that has successively received the last-hop relay request message will respond to the received last-hop relay request message when the corresponding delay time arrives.
  • the hop relay request message is parsed, and a corresponding current hop relay request message is generated, then the routing table entry of the network node that receives the previous hop relay request message may include the previous hop relay Request message parsing time, in step S2622, according to the parsing time of the previous hop relay request message in the routing table entry, from the one that received the previous hop relay request message
  • the current hop relay node is determined from the network node.
  • the network node corresponding to the earlier parsing time is selected as the current hop relay node by comparing the parsing time.
  • the network node that has successively received the last hop relay request message will respond to the received last hop relay request message. Parse, and generate the corresponding current hop relay request message when the corresponding delay time arrives, then the routing table entry of the network node that received the last hop relay request message may include the current hop Following the generation time of the request message; then in step S2622, according to the generation time of the current hop relay request message in the routing table entry, it can be determined from the network that received the previous hop relay request message. The current hop relay node is determined among the nodes.
  • the network node that has successively received the last hop relay request message is made to parse the received last hop relay request message and generate a corresponding If the current hop relay request message is sent when the corresponding delay time arrives, the routing table entry of the network node that receives the previous hop relay request message may include The sending time of the current hop relay request message, in step S2622, may be specifically based on the sending time of the current hop relay request message in the routing table entry, from receiving the previous hop relay request message The current hop relay node is determined among the network nodes.
  • the execution subject of the foregoing step S2622 may specifically be the network node that receives the last hop relay request message, or may be a configured control device.
  • step S242 if in step S242 according to the set node power balance rule, the network node that has successively received the last hop relay request message will be Then the request message is parsed and the corresponding current hop relay request message is generated, and the current hop relay request message is sent when the corresponding delay time arrives.
  • the current hop relay request message may include the current hop relay request message.
  • the main body of execution of step S262 may be the network node that receives the current hop relay request message, and the network node that receives the current hop relay request message will generate the current hop received first.
  • the network node that relays the request message serves as the current hop relay node.
  • the parsing time of the last hop relay request message, the generation time of the current hop relay request message, and the sending time of the current hop relay request message may also be stored in The local area of the network node that received the last hop relay request message is not limited to the routing table entry of the network node that received the last hop relay request message.
  • the network node that received the last hop relay request message is not stored locally or the corresponding routing table entry does not include the previous hop relay request message Parsing time, the generation time of the current hop relay request message, and the sending time of the current hop relay request message, then optionally, the current hop relay request message may include the number of route updates, then step In S262, the network node that receives the current hop relay request message parses the current hop relay request message received first and generates a corresponding relay request message and a corresponding routing table entry.
  • the routing table entry may include The number of times of the route update; the network node receiving the current hop relay request message analyzes the current hop relay request message received later, if the route update in the current hop relay request message received later The number of times is the same as the number of times of routing updates in the routing table entry corresponding to the corresponding hop relay request message, then the current hop relay request message received after discarding, or also called the received after wrong The current hop relay request message is processed, but the network node that generated the current hop relay request message received first is directly used as the current hop relay node.
  • the number of routing updates that may be included in the routing table entry corresponding to the corresponding relay request message may also be stored in the current hop relay request message.
  • the locality of the network node is not only included in the routing table entry of the network node that receives the current hop relay request message.
  • the network node that received the last hop request message is not stored locally or the corresponding routing table entry does not include the resolution time of the last hop relay request message
  • the current hop following the generation time of the request message and the sending time of the current hop relay request message can also be made according to the set node power balance rule
  • the node controls the sending timing of the corresponding current hop relay request message according to the respective remaining power, in step S262, according to the current hop relay request message, from the one that received the previous hop relay request message
  • the network node that receives the current hop relay request message will generate the current hop relay request message first as the current hop relay node.
  • performing the above steps S222-S262 can determine the second hop relay node (ie, the current hop relay node); relative to the second hop relay node Hop relay node (that is, the last hop relay node), perform the above steps S222-S262 to determine the third hop relay node (that is, the current hop relay node), and so on, until the nth hop relay is determined node.
  • previous hop relay node and the current hop relay node are exemplary relative expressions and are not uniquely limited.
  • the network node that sends the target data in the communication network is the source node
  • the network node that receives the target data is the destination node
  • a relay node is determined from network nodes other than the source node in the communication network, and the relay node is used to forward the target data sent by the source node so that it can be used by the destination node.
  • the route when the route is established It not only considers the communication distance between the relay nodes participating in the route establishment, but also considers the remaining power or energy consumption of the relay nodes, so that the relay nodes participating in the route establishment meet the requirements of the communication distance for forwarding the target data. , It also meets the requirements of power or energy consumption when forwarding target data, so that the transmission of target data can be effectively realized. For example, in some cases, it will avoid only considering the communication distance requirements when establishing a route, making the remaining A low-power node with less power is used as a relay node, and when the target data is forwarded, the remaining power is too small to achieve the normal transmission of the target data.
  • "receive” or “send” can be implemented in the form of broadcast, or implemented in the form of unicast, or a mixture of unicast and broadcast
  • the form of realization is not particularly limited here, and it may include any form that can realize the technical solution of the present application.
  • the method may further include: according to the set node power balance The rules dynamically maintain the established route, so that according to the energy consumption of the relay node, the network node that satisfies the node communication distance balance rule and the node power balance rule can be selected in real time as a new relay node, thereby replacing it Network nodes with less remaining power or greater energy consumption are removed, thereby ensuring the real-time effectiveness of routing and ensuring the normal transmission of target data.
  • the network node A is the source node
  • the network node E is the destination node
  • these two network nodes are the end nodes.
  • take the node communication distance equalization rule as an example, establish a route that can realize the use of relay nodes to forward the target data to send the target data from the network node A to the network node E as an example, considering that the network node E is also possible As the source node, the network node A may also be the destination node. For this reason, the following (1)-(10) can realize the transmission of target data from the network node A to the network node E through the process of one-time route establishment.
  • the technical solution provided in FIG. 2A is exemplified.
  • the source node and the destination node are end nodes, and the network node that forwards the target data is a relay node.
  • the establishment can realize the transmission of target data from the network node A to the network node E, and the transmission of the target data from the network node E to the network node A. It may also only include the following (1)-(7), and only establish a route to realize the transmission of target data from the network node A to the network node E or realize the transmission of the target data from the network node E to the network node A.
  • the routing process is described by taking the number of routing updates as an example.
  • Source node A sends routing request information to network nodes in the communication network
  • the source node is one of the end nodes of the route.
  • Figure 3B is a schematic diagram of the data structure of the route request message; as shown in Figure 3B, the data structure of the route request message includes a type field, a current field, a src field, a dest field, and an update field.
  • the type field is used to identify the type of the message.
  • This field is 1 means request message (request), 2 means reply message (reply); the current field is used to identify the ID of the node that sent the route request message; the src field and dest field are used to identify the source node and the destination node, respectively ID and update fields are used to identify the number of routing updates of the source node.
  • the routing request information (denoted as A request ) sent by the source node A is 1-AAE-1, which means that this is a request message sent by A, and a route from A to E needs to be established.
  • FIG. 3C is a schematic diagram of the data structure of the routing table entry; As shown in Figure 3C, the routing table entries include the src field, dest field, update field, p-node field, and n-node field.
  • the src field and dest field are used to identify the ID of the source node and the destination node respectively; the p-node field Used to identify the ID of the previous hop relay node, the n-node field is used to identify the ID of the next hop relay node of the source node (the ID of the current hop relay node), and the update field is used to identify the number of route updates.
  • the initial value of update is 0. Therefore, for source node A, its routing table entry is AE-1-0-0, where it is determined whether it is network node B or network node after network nodes B and C process the routing request information A request. C is the current hop relay node.
  • the value of the n-node field is 0 in the route request information A request .
  • the value of the p-node field is also 0.
  • the route request message is configured to include the n-node field.
  • the n-node field may not be included in the route request message, that is, the route is established through the previous hop relay node-current hop relay node mechanism, or, if it includes For the n-node field, the value of the n-node field is 0.
  • the network node B receives the route request message A request sent by the source node and parses it to generate a relay request message B request corresponding to the network node B;
  • the network node B receives the route request message A request before the network node C.
  • the other network nodes B, C, and D can play the role of forwarding the target data.
  • the network nodes B and C can receive the route request message A request .
  • a relay request message B request and C request will be generated correspondingly.
  • Figure 3D is a schematic diagram of the data structure of the relay request message according to the embodiment of the application; as shown in Figure 3D, the relay request message includes a type field, a current field, a src field, a dest field, an update field, a p-node field, and an n-node.
  • the relay request message includes a type field, a current field, a src field, a dest field, an update field, a p-node field, and an n-node.
  • the network node D may also receive the route request message A request .
  • the physical location of the network node A changes and the network node D is located within the communication range of network node A.
  • the situation here is only an example, and is not the only limitation.
  • generating the relay request message B request includes: the network node B receives the route request message A request , parses it, and generates a relay request message B request through data assembly and sends it .
  • the current field in the relay request message B request is filled with B
  • the src field, dest field, and update field can be directly filled with the corresponding field values in A request
  • the p-node field can be filled with A
  • the src field in the request is filled (as A), and the n-node field is filled with 0.
  • the relay request message B request sent by the network node B is 1-BAE-1-A-0. Similar to the above-mentioned routing table entry definition, the routing table entry of network node B is AE-1-A-0.
  • the network node C receives the route request message A request sent by the source node and processes it to generate a corresponding relay request message C request ;
  • the relay request message C request generated by the network node C is 1-CAE-1-A-0, and the routing table entry of C is: AE-1-A-0.
  • the network node D receives and processes the relay request message B request and generates a corresponding relay request message D request ;
  • the network node D will receive the relay request message C after receiving the relay request message B request request , so the relay request message B reqqest is first parsed to generate the corresponding relay request message D request ; and the relay request message C request received after being discarded, the reason for discarding is similar to the following network node B discarding the relay request The reason for the message C request.
  • the relay request message D request sent by the network node D is 1-DAE-1-B-0, and the routing table entry of the network node D is AE-1-B-0.
  • the network node B receives and parses the relay request message C request
  • the network node D receives and parses the relay request message C request .
  • network node B After network node B receives the relay request message C request (1-CAE-1-A-0), it further compares the routing table entry corresponding to network node B with the information corresponding to src and dest in the relay request message C request, and finds The establishment of this route is to establish a route to transmit target data from network node A to network node E. It is further discovered that the update in the routing table entry corresponding to network node B is the same as the update in the relay request message C request, both 1. Therefore, the routing table entry of the network node B is not updated, and the network node B discards the relay request message C request so as not to process the relay request message C request.
  • the update in the routing table entry corresponding to the network node B can be compared with the update in the relay request message C request , and the routing table entry and the relay request message corresponding to the network node B can be compared.
  • this route establishment is to establish a route that realizes the transmission of target data from network node A to network node E, but it is found that the update and relay request in the routing table entry corresponding to network node B If the value of update in the message C request is all 1, the routing table entry of the network node B is not updated and the relay request message C request is discarded so as not to process the relay request message C request.
  • the route establishment is to establish a route from the network node A to the network node E transmits the route of the target data, it can process the relay request message C request and update the routing table entry of the network node B.
  • the network node C it will also receive the relay request message B request . Since the routing table entry obtained by the network node C processing A request also includes the update field, the routing table entry of the network node C The update field and the update field of the relay request message B request have the same value (that is, 1). Therefore, the network node C discards the relay request message B request so as not to process the relay request message B request and never update the network node C.
  • the existing routing table entry is the routing table entry obtained by processing the A request.
  • the network node D receives and parses the relay request message B request and the relay request message C request
  • the network node D since the network node B is closer to the network node D, and the network node C is further away from the network node C, the network node D first receives the relay request message B request and responds to the relay request message B request The analysis is performed to generate the relay request message D request , and the identifier of the network node B is directly filled into the relay request message D request , and the corresponding routing table entry is further generated.
  • the value of the update field in the routing table entry is 1; and Since C request message receives the relay request, the relay request message by analyzing B request to generate a routing table entry field upadate the relay C request message field update request in the network node D, it is found that two If the value of the update field is all 1, the network node D discards the relay request message C request so as not to parse the relay request message C request and update the update field in the routing table entry (or also called the relay request The message C request is parsed and the routing table entry is regenerated), so that the network node B is directly used as the current hop relay node.
  • the network node E receives and processes the relay request message D request .
  • the network node E Since the network node E is the destination node, it receives and processes the relay request message D request and generates a route reply message E reply . Since the destination node is the other end node, the structure of the end node reply message is shown in Figure 3B Specifically, because it is a reply message, the type field is filled with 2; the current field is filled with E; the src and dest fields are filled with A and E respectively; the initial value of the update field is 1, and after increasing by 1, it is filled with 2. Therefore, the route reply message E reply is 2-EAE-2.
  • the network node E sends a routing reply message E reply .
  • E can determine that D request comes from D, so when sending the route reply message E reply , it only needs to be unicast to the network node D.
  • the route established through the above (1)-(7) corresponds to ABDE, where the first hop relay node is B , The second-hop relay node is D, and there are a total of 2 relay nodes participating in the forwarding of target data.
  • the network node D receives and parses the route reply message E reply .
  • the network node D parses the E reply and learns from it that this is a route reply message of an AE route request message, and the value of its update field is 2, which is greater than the route table entry of the network node D (AE-1-B-0) Therefore, the routing table entry of the network node D is updated to AE-2-BE.
  • the network node D generates a route reply message D reply .
  • the data structure of the route reply message is the same as the data structure of the route request message, as shown in Figure 3C. Among them, the difference is that the type field is filled with 2; other fields such as the current field are filled with D; the src and dest fields are filled with A and E respectively; the update field is filled with 2; p->node is filled with 0; n-node is filled with E , So the route reply message D reply is 2-DAE-2-0-E.
  • the network node B receives and parses the route reply message D reply .
  • routing network routing table entry Node B generates a reply message to B Reply.
  • the routing table entry of network node B is updated to AE-2-AD, and the routing reply message B reply is 2-BAE-2-0-D.
  • the network node A receives and parses the route reply message B reply .
  • the parsing of the route reply message B reply by the network node A is similar to the parsing of the route reply message D reply by the network node B.
  • the source node A updates its routing table entry to AE-2-0-B according to the route reply message B reply.
  • the route can be obtained as ABDE, which can satisfy the transmission of target data from network node A to network node E, or from network node E to network node A
  • the target data is transmitted, so that a route establishment process is realized and the two-way target data transmission needs are met.
  • any network node will receive redundant routing request messages or relay request messages or routing reply messages.
  • source node A may receive routing request messages B request
  • Network node B may receive routing request message D request
  • network node C will receive routing request message D reques_, etc.
  • the size of the update field can also be used to discard them. If the update value is the same, they are discarded.
  • the messages received later (corresponding to the routing request message or routing relay message or routing reply message respectively). For a certain network node, if there is already a routing table entry, and the fields in the routing table entry have been filled with valid data, it indicates that the relay request message has been received first.
  • the establishment of a route that satisfies two-way data transmission is completed.
  • the target data transmission can be completed by relying on the routing table entries of the end node and the relay node.
  • the above process only considers the principle of node communication distance balance, and determines the relay node from the network node.
  • taking the battery to provide power considering the power consumption problem, if a low-power relay node frequently If it is used, it will cause the low-power relay node to consume too much power, or even run out and fail to work normally, or when the route is established, a low-power node has less remaining power. For this reason, when determining the relay node from the network node based on the above set node communication distance balance rule, the consideration of the node power balance principle is added.
  • network node B is a low-power node, taking into account that frequent data transmission between AEs will cause the continuous consumption of network node B's power, and even run out of power, it will not work properly Or, when the route is established, the remaining power of the network node B is less.
  • Comprehensive consideration of the node communication distance rule and the node power balance principle it can be determined that the network node C is an alternative to the network node B.
  • the difference from the above-mentioned screening processing result in Figure 3A is that according to the set node communication distance balance rule and the node power balance The rule is that the network node C is determined from the network nodes B and C instead of B as the first-hop relay node.
  • a relay node is determined from network nodes other than the source node in the communication network according to the set node communication distance balance rule and the node power balance rule.
  • a relay node is determined from network nodes other than the source node in the communication network according to the set node communication distance balance rule and the node power balance rule.
  • the set node communication distance balance rule make the network node B/C in the communication network except the source node receive the route request message A request sent by the source node A; according to the set node power balance
  • the rule enables the network node B/C that has received the route request message to parse the received route request message A request and generate a corresponding current hop relay request message B request /C request .
  • the network node B/C that has received the route request message parses the received route request message A request according to the set node power balance rule, And when generating the corresponding current-hop relay request message B request /C request , it may include: according to the set node power balance rule, make the network node B/C that successively receive the route request message within the corresponding delay time Upon arrival, the received routing request message A request is parsed, and the corresponding current hop relay request message B request /C request is generated; according to the current hop relay request message B request /C request , the received The network node B/C of the route request message determines that the current hop relay node is C.
  • the network nodes that successively receive the route request message are in the corresponding delay time Analyze the received routing request message when it arrives, and generate and send the corresponding first-hop relay request message, the less the remaining power, the longer the delay time, on the contrary, the more the remaining power, the shorter the delay time , So that the network node B with less remaining power is later than the network node C with more remaining power to parse the received routing request message A request , and generate a corresponding current hop relay request message B request /C request .
  • the corresponding power threshold can be set for different network nodes.
  • the above step S202 is started, otherwise, the set node communication distance equalization rule can be directly used ,
  • the relay node is determined from the network nodes other than the source node in the communication network, and the above-mentioned process (1)-(7) is executed.
  • the remaining power percentages of network nodes B and C are used to indicate the amount of remaining power, they are recorded as Power B and Power C respectively , and the power thresholds configured for these two network nodes are Limit respectively.
  • B and Limit C define the delay processing time constant as P Constant , then when the above network nodes B and C receive A request , as mentioned above, since d A,B ⁇ d A,C , in the above (2) , B will receive A request before C. At this time, the network node B checks its own battery power percentage, that is, Power B. If Power B ⁇ Limit B , the network node B delays P Constant /Power B before processing A request .
  • C will receive A request later than B, and network node C checks its own battery power percentage, namely Power C , if Power C ⁇ Limit C , network node C delays P Constant /Power C A request will be processed after time.
  • the first hop relay node when the first hop relay node is determined from the network nodes that have received the route request message according to the first hop relay request message, it may include: According to the first hop relay request message B request /C request , the routing table entry of the network node B/C that receives the routing request message A request is determined; according to the routing table of the network node B/C Item, it is determined from the network node B/C that has received the route request message A request that the first-hop relay node is the network node B.
  • network node C will receive the B request of network node B, but because the value of update in the routing table entries of network node B/C is 1, and because of consideration Delay processing time, the C request of the network node C is generated before the B request of the network node B, and the network node D first receives the relay request message C request and parses it to generate the corresponding routing table entry.
  • the above is only combined with the specific communication network pair shown in FIG. 3A, how to determine from the network node B/C other than the source node in the communication network according to the set node communication distance balance rule and the node power balance rule Take the first hop relay node as an example for description. However, if there are n relay nodes, it can also be applied to the process of determining the second hop relay node to the nth hop relay node. If the first hop relay request message B request /C request is compared as If the current hop relay request message is compared with the route request message A request as the previous hop relay request message, the specific technical processing process is similar to that according to the set node communication distance balance rule and the node power balance rule to determine the first The process of a one-hop relay node.
  • different power thresholds can be set for low-power nodes and friendly nodes; and for different low-power nodes Different power thresholds can also be set, and different friendly nodes can set different power thresholds.
  • the friendly node is preferably used as a relay node, and the friendly node can be set. The power threshold of the node is less than the threshold of the low-power node.
  • the established route can also be dynamically maintained according to the set node power balance rule.
  • the remaining power (or power consumption) of the existing relay node in the route is detected in real time, and when there is a relay node whose remaining power is less than the corresponding power threshold (or greater than the corresponding power consumption) Threshold), the relay node whose remaining power is less than the corresponding power threshold notifies the network nodes within its communication range to dynamically maintain the established route according to the set node power balance rule .
  • the established route is A-C-D-E.
  • Each relay node regularly checks its own power information. For example, if the power of network node C is too low, that is, Power C ⁇ Limit C , then network nodes A, B, and D are within the communication range of network node C. C sends a notification of its low battery status to network nodes A, B, and D.
  • the routing situation of node E transmitting target data to network node A.
  • network nodes A, B, and D receive the low battery status notification of network node C, they compare their routing table entries and find the next hop (n-node). Field)
  • the relay node is the routing table entry of the network node C. In the above specific application scenario, only the next hop relay node in the routing table entry AE-2-0-C of A is C.
  • the network node A Re-initiate the route request message for establishing AE, that is, for this specific scenario, it is equivalent to re-initiate the route request message to find other network nodes that replace the current hop relay node C from the communication network as the new first hop Relay node, and the second-hop relay node D remains unchanged.
  • the network node A re-initiates the route request message for establishing the AE route to re-establish the AE route.
  • the route request message generated by the network node A again is: 1-AAE-3.
  • the network node B is used instead of the network node C as the new current-hop relay node.
  • the value of the update field in the routing table entry of network node A is 1, then complete the above (8)
  • the value of the update field is increased by 1 to update to 2; and then the above-mentioned network node A re-initiates the route request message to establish the AE route to re-establish the AE route.
  • Use network node B to replace network node C.
  • the value of the update field is updated to 3 by adding 1 to it.
  • the target data can also be transmitted from the network node E to the network node A, or also known as the network node A and the network node E
  • the two-way data transmission situation or the two-way data transmission situation between end nodes therefore, during maintenance, real-time detection of the power consumption of the relay node, when the remaining power of the relay node is less than the corresponding power threshold, according to the
  • the set node power balance rule dynamically maintains the established route, which specifically includes: a relay node whose remaining power is less than a corresponding power threshold notifies the network node within its communication range; the network that receives the notification
  • the nodes compare their corresponding routing table entries to determine the routing table entry that includes the relay node ID of the relay node whose remaining power is less than the corresponding power threshold for the last hop relay node, and if the routing table entry corresponds to the network node as the source
  • the set node power balance rule dynamically maintains the established route, which specifically includes: a relay node whose remaining power is less than
  • the second-hop relay node is D1; when it is detected in real time that the remaining power of the second-hop relay node D1 is less than the corresponding power threshold, the second-hop relay node D1 will send a status notification that its power is too low to the network node B, D2, and E, because the last hop relay node in the routing table entry of the second hop relay node D1 is B (that is, the current hop relay node B), not the source node A, therefore, further according to the current hop
  • the routing table entry of the relay node B is traced back to the source node A, and the source node A resends the routing request message to establish a new route. For example, if the remaining power of the network node D2 is not less than its corresponding power threshold, it will be re-established In routing, the network node D2 is used instead of the network node D1 as the
  • the second-hop relay node D1 receives and analyzes the current-hop relay request message B request sent by the current-hop relay node B to generate a second-hop relay request message D1 request , and further generates a second Jump to the routing table entry of the relay node D1. Therefore, the p-node field in the routing table entry of the second hop relay node D1 is filled with the identifier of the current hop relay node, that is, B; therefore, relatively speaking, the first The two-hop relay node D1 can be called the current hop relay node D1, and the current hop relay node B can be called the previous hop relay node B, that is, the routing table entry of the current hop relay node will be filled with the previous hop The ID of the relay node. Therefore, if only one-way data transmission between network node A and network node E is considered, it is necessary to trace back to the source node A to re-establish the route, for example, the re-established route is: AB-D2-E.
  • network node B can look up its own routing table entry, and regard network node B as the current hop relay node, because its corresponding routing table entry will record There is the ID of network node A.
  • the route request message for establishing AE is re-initiated from network node A, that is, for this specific scenario, it is equivalent to re-initiating a route request message to find a replacement from the communication network
  • the other network nodes of the network node B as the current hop relay node serve as the new first hop relay node.
  • the network node A re-initiates the route request message to establish the AE route to re-establish the AE route.
  • the route request message generated by the network node A again is: 1-AAE-3.
  • the remaining power does not exceed its power, refer to the above-mentioned set node communication distance balance rule and the node power balance rule to determine the processing process of the relay node, use network node C instead of network node B as the new current hop relay node, For example, the re-established route is AC-D2-E.
  • the transmission of target data from network node A to network node E or also known as the one-way data transmission between network node A and network node E, or the data sheet between end nodes Therefore, during maintenance, the power consumption of the relay node is detected in real time. When the remaining power of the relay node is less than the corresponding power threshold, the established route will be adjusted according to the set node power balance rule.
  • the routing table entry of the previous hop relay node can determine the previous hop relay node when the previous hop relay node is used as the current hop relay node, until the source is traced back The node thus resends the route request message from the source node to establish a new route to replace the relay node whose remaining power is less than the corresponding power threshold.
  • Fig. 4A is a schematic structural diagram of a device for establishing a route according to the fourth embodiment of the application; the route is used to send target data from the source node to the destination node through the forwarding of the relay node, as shown in Fig. 4A, which includes:
  • the end node determining module 301 is used to determine that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node;
  • the relay node determining module 302 is configured to determine a relay node from the network nodes of the communication network according to at least the set node power balance rule, and the relay node is used to perform processing on the target data sent by the source node. Forwarding processing so as to be received by the destination node;
  • the route establishment module 303 is configured to establish a route for the source node to send the target data to the destination node according to the source node, the destination node, and the determined relay node.
  • Fig. 4B is a schematic structural diagram of the relay node determining module; as shown in Fig. 4B, optionally, in this embodiment or other embodiments, the relay node determining module may include:
  • the message receiving control unit 312 is configured to enable the network nodes in the communication network other than the source node to receive the routing request message sent by the source node according to the set node communication distance equalization rule;
  • the message parsing control unit 322 is configured to make the network node that received the route request message parse the received route request message according to the set node power balance rule, and generate a corresponding first-hop relay Request message
  • the relay node determining unit 332 is configured to determine the first hop relay node from the network nodes that have received the route request message according to the current hop relay request message.
  • the message receiving control unit 312 may also be configured to enable the network node in the communication network to receive the last hop relay request message sent by the last hop relay node according to the set node communication distance equalization rule;
  • the message parsing control unit 322 can also be used to make the network node that received the last-hop relay request message process the last-hop relay request message according to the set node power balance rule to generate a corresponding Current hop relay request message;
  • the relay node determining unit 332 may also be configured to determine the current hop relay node from the network nodes that have received the previous hop relay request message according to the current hop relay request message.
  • the end node determination module 301 determines that the network node that sends the target data in the communication network is the source node, and the network node that receives the target data is the destination node; the relay node determination module 302 is at least based on the set node power
  • the balance rule determines a relay node from network nodes other than the source node in the communication network, and the relay node is used to forward the target data sent by the source node so that it can be
  • the destination node receives; the route establishment module 303 establishes a route for the source node to send the target data to the destination node according to the source node, the destination node, and the determined relay node, thereby It can be seen that when the route is established, not only the communication distance between the relay nodes participating in the route establishment is considered, but also the remaining power or energy consumption of the relay node is also considered, so that the relay nodes participating in the route establishment conform to the forwarding requirements.
  • the communication distance requirement of the target data meets the requirements of the required power or energy consumption when forwarding the target data, so that the transmission of the target data can be effectively realized. For example, in some cases, it is avoided to only consider when establishing a route.
  • a low-power node with less remaining power is used as a relay node.
  • the remaining power is too small to achieve normal transmission of the target data.
  • the above-mentioned products can execute the methods provided in the embodiments of the present application, and have functional modules and beneficial effects corresponding to the execution methods.
  • the method provided by the embodiments of the present application can also be applied to a chip, the chip includes a memory and a processor, the memory and the processor are coupled, the memory is used to store program instructions, and the processor is used to call the program instructions stored in the memory so that the chip executes the above Any one of the routing establishment methods mentioned in the embodiment.
  • the chip provided in this embodiment can also be used in a headset to achieve the above-mentioned corresponding functions and effects.
  • the chip provided in this embodiment can be used in multiple headsets, and the headsets can be connected through Bluetooth technology.
  • the improvement of a technology can be clearly distinguished between hardware improvements (for example, improvements in circuit structures such as diodes, transistors, switches, etc.) or software improvements (improvements in method flow).
  • hardware improvements for example, improvements in circuit structures such as diodes, transistors, switches, etc.
  • software improvements improvements in method flow.
  • the improvement of many methods and processes of today can be regarded as a direct improvement of the hardware circuit structure.
  • Designers almost always get the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that the improvement of a method flow cannot be realized by the hardware entity module.
  • a programmable logic device for example, a Field Programmable Gate Array (Field Programmable Gate Array, FPGA)
  • PLD Programmable Logic Device
  • FPGA Field Programmable Gate Array
  • HDL Hardware Description Language
  • ABEL Advanced Boolean Expression Language
  • AHDL Altera Hardware Description Language
  • HDCal JHDL
  • Lava Lava
  • Lola MyHDL
  • PALASM RHDL
  • VHDL Very-High-Speed Integrated Circuit Hardware Description Language
  • Verilog Verilog
  • the controller can be implemented in any suitable manner.
  • the controller can take the form of, for example, a microprocessor or a processor and a computer-readable medium storing computer-readable program codes (such as software or firmware) executable by the (micro)processor. , Logic gates, switches, application specific integrated circuits (ASICs), programmable logic controllers and embedded microcontrollers.
  • controllers include but are not limited to the following microcontrollers: ARC625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicon Labs C8051F320, the memory controller can also be implemented as part of the control logic of the memory.
  • controllers in addition to implementing the controller in a purely computer-readable program code manner, it is entirely possible to program the method steps to make the controller use logic gates, switches, application specific integrated circuits, programmable logic controllers, and embedded logic.
  • the same function can be realized in the form of a microcontroller or the like. Therefore, such a controller can be regarded as a hardware component, and the devices included in it for realizing various functions can also be regarded as a structure within the hardware component. Or even, the device for realizing various functions can be regarded as both a software module for realizing the method and a structure within a hardware component.
  • a typical implementation device is a computer.
  • the computer may be, for example, a personal computer, a laptop computer, a cell phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or Any combination of these devices.
  • this application can be provided as methods, systems, or computer program products. Therefore, this application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device.
  • the device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
  • These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment.
  • the instructions provide steps for implementing the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
  • the computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
  • processors CPUs
  • input/output interfaces network interfaces
  • memory volatile and non-volatile memory
  • the memory may include non-permanent memory in computer readable media, random access memory (RAM) and/or non-volatile memory, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of computer readable media.
  • RAM random access memory
  • ROM read-only memory
  • flash RAM flash memory
  • Computer-readable media include permanent and non-permanent, removable and non-removable media, and information storage can be realized by any method or technology.
  • Information can be computer readable instructions, data structures, program modules, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical storage, Magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices. According to the definition in this article, computer-readable media does not include transitory media, such as modulated data signals and carrier waves.
  • this application can be provided as a method, a system, or a computer program product. Therefore, this application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
  • a computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • This application may be described in the general context of computer-executable instructions executed by a computer, such as a program module.
  • program modules include routines, programs, objects, components, data structures, etc. that perform specific transactions or implement specific abstract data types.
  • This application can also be practiced in distributed computing environments. In these distributed computing environments, remote processing devices connected through a communication network execute transactions.
  • program modules can be located in local and remote computer storage media including storage devices.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种路由的建立方法及装置、电子设备以及计算机存储介质，路由的建立方法包括：通过确定通讯网络中发送目标数据的网络节点为源节点，以及接收目标数据的网络节点为目的节点（S101）；至少根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从通讯网络中除源节点和目的节点之外的网络节点中确定出中继节点，中继节点用于对源节点发送的目标数据进行转发处理以可被目的节点接收（S102）；根据源节点、目的节点以及确定出的中继节点，建立源节点向目的节点发送目标数据的路由（S103）。由此可见，路由的建立方法使得参与路由建立的中继节点既符合转发目标数据的通信距离的要求，又符合转发目标数据时的所需电量或者能耗的要求。

Description

路由的建立方法及装置、电子设备以及计算机存储介质 技术领域
本申请实施例涉及通讯技术领域，尤其涉及一种路由的建立方法及装置、电子设备以及计算机存储介质。
背景技术
为实现将目标数据从通讯网络中的源节点传输到目的节点，通常从通讯网络的网络节点中确定出中继节点以建立路由，比如在BLE mesh规范中，建立的路由中可以包括多个中继节点，通过该多个中继节点的转发，实现以多跳的数据传输方式将目标数据从源节点传输到目的节点。但是，当通讯网络中网络节点数较多时，每次传输目标数据都要多次转发才能到达目的节点，导致通讯网络中工作的网络节点数增多，从而产生大量重复的无效数据，也加快了网络节点的能量消耗。
为了降低网络节点的功耗，BLE mesh规范中引入了友好节点(Friend Node)和低功耗节点(Low Power Node)，低功耗节点是指通过电池供电的网络节点比如一些传感器，友好节点是指由持续电源供电的网络节点比如智能灯管(比如具备数据存储以及处理的硬件资源、软件资源)。在BLE mesh规范中，低功耗节点在大多数时间保持睡眠状态，定期唤醒接收订阅的目标数据，如果在睡眠期间有其他网络节点发送目标数据给该低功耗节点，会由该低功耗节点对应的友好节点暂存目标数据，并在该低功耗节点唤醒后，由友好节点转发目标数据至该低功耗节点。友好节点和低功耗节点之间的这种关系称为Friendship。
但是，在实现本申请的过程中，发明人发现，在基于上述BLE mesh规范建立路由的过程中，仅仅考虑了节点间通信距离最短的要求，在一些情形就会出现无法实现目标数据的正常传输，比如，由于该低功耗节点由电池供电，如果剩余电量较少的低功耗节点作为中继节点，则在转发目标数据时，由于其剩余电量过少而无法实现目标数据的正常传输。
发明内容
有鉴于此，本申请实施例所解决的技术问题之一在于提供一种路由的建立方法及装置、电子设备以及计算机存储介质，用以克服或者缓解现有技术中上述缺陷。
第一方面，本申请实施例提供一种路由的建立方法，其包括：
确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
第二方面，本申请实施例提供一种路由的建立装置，其特征在于，包括：
端节点确定模块，用于确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
中继节点确定模块，用于至少根据设置的节点电量均衡规则，从通讯网络的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
路由建立模块，用于根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
第三方面，本申请实施例提供一种电子设备，包括：处理器、通信接口、存储器和通信总线，所述处理器、所述通信接口、以及所述存储器通过所述通信总线完成相互间的通信；
所述存储器用于存放至少一可执行指令，所述可执行指令使所述处理器执行如本申请第一方面任一实施例中所述的方法对应的操作。
第四方面，本申请实施例提供一种计算机存储介质，其上存储有计算机程序，该程序被处理器执行时实现如本申请第一方面任一实施例中所述的方法。
本申请实施例中，通过确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由，由此可见，在建立路由的时候不但考量参与路由建立的网络节点之间的通信距离，而且还考量了网络节点的剩余电量或者能耗，从而使得所述路由中的中继节点既符合转发目标数据的通信距离的要求，又符合转发目标数据时的所需电量或者能耗的要求，从而可以有效实现目标数据的传输，比如，在一些情形中， 会避免了在建立路由的时候仅仅考虑通信距离要求时，使得剩余电量较少的低功耗节点作为中继节点，则在转发目标数据时，由于其剩余电量过少而无法实现目标数据的正常传输。
附图说明
后文将参照附图以示例性而非限制性的方式详细描述本申请实施例的一些具体实施例。附图中相同的附图标记标示了相同或类似的部件或部分。本领域技术人员应该理解，这些附图未必是按比例绘制的。附图中：
图1为本申请实施一提供的一种路由的建立方法流程示意图；
图2A为本申请实施例二中提供的一种路由的建立方法流程示意图；
图2B为本申请实施例二中步骤S202的一流程示意图；
图2C为本申请实施例二中步骤S202的另一流程示意图；
图3A为本申请实施例三中提供的通讯网络结构示意图；
图3B为路由请求消息的数据结构示意图；
图3C为路由表项的数据结构示意图；
图3D为本申请实施例中继请求消息的数据结构示意图；
图3E为本申请实施例三中提供的另外一种通讯网络结构示意图；
图4A为本申请实施例四提供的一种路由的建立装置结构示意图；
图4B为所述中继节点确定模块的结构示意图；
[根据细则26改正05.03.2020]　
具体实施方式
实施本申请实施例的任一技术方案必不一定需要达到以上的所有优点。
为了使本领域的人员更好地理解本申请实施例中的技术方案，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅是本申请实施例二部分实施例，而不是全部的实施例。基于本申请实施例中的实施例，本领域普通技术人员所获得的所有其他实施例，都应当属于本申请实施例保护的范围。
下面结合本申请实施例附图进一步说明本申请实施例具体实现。
图1为本申请实施一提供的一种路由的建立方法流程示意图；如图1所示，本实施例中，其包括如下步骤S101-S103：
S101、确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
本实施例或者其他实施例中，通讯网络可以是任意可应用本实施例技术方案的网络，比如满足BLE mesh规范的网络或者其他非BLE mesh规范的网络。
通讯网络可以包括多个网络节点，其中，为实现目标数据的传输，发送所述目标数据的网络节点称之为源节点，接收所述目标数据的网络节点称之为目的节点。对于所述目标数据的传输来说，所述源节点和所述目的节点均为端节点，所述源节点作为所述目标数据的提供者，所述目的节点作为所述目标数据的接收者。
所述目标数据不做特别限定，可以为不同形式或者结构的数据，例如音频数据或者用户指令等。
S102、至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
本实施例中，节点电量均衡规则主要用于控制所述目标数据从所述源节点传输至所述目的节点时的能量保障，比如包括但不限于使得剩余电量过少的网络节点不参与路由，或者替换掉剩余电量较少的网络节点，或者，使得能耗较大的网络节点不参与路由，或者替换掉能耗较大的网络节点等。
S103、根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
综上实施例二，通过确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由，由此可见，在建立路由的时候不但考量参与路由建立的中继节点之间的通信距离，而且还考量了中继节点的剩余电量或者能耗，从而使得参与所述路由建立的中继节点既符合转发目标数据的通信距离的要求，又符合转发目标数据时的所需电量或者能耗的要求，从而可以有效实现目标数据的传输，比如，在一些情形中，会避免了在建立路由的时候仅仅考虑通信距离要求时，使得剩余电量较少的低功耗节点作为中继节点，则在转发目标数据时，由于其剩余电量过少而无法实现目标数据的正常传输。
图2A为本申请实施例二中提供的一种路由的建立方法流程示意图；如图2A所示，其包括如下步骤S201-S203：
S201、确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
与上述实施例类似，本实施例或者其他实施例中，通讯网络可以是满足BLE mesh规范或者其他非BLE mesh规范的网络。通讯网络可以包括多个网络节点，为实现目标数据的传输，发送所述目标数据的网络节点称之为源节点，接收所述目标数据的网络节点称之为目的节点。对于所述目标数据的传输来说，所述源节点和所述目的节点均为端节点，所述源节点作为所述目标数据的提供者，所述目的节点作为所述目标数据的接收者。
进一步地，本实施例或者其他实施例中，这些网络节点可以为任意形式的设备或者终端或者传感器或者器件，在此不做特别限定，只要可以参与所述目标数据从源节点传输至所述目的节点，或者实现所述目标数据从源节点传输至所述目的节点即可，或者，又称之具备发送、接收、转发目标数据中任一功能的资源即可。
S202、根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
本实施例或者其他实施例中，节点通信距离均衡规则主要用于控制所述目标数据从所述源节点传输至所述目的节点时基于最短通信距离。如前所述，节点电量均衡规则主要用于控制所述目标数据从所述源节点传输至所述目的节点时的能量保障，比如使得剩余电量过少的网络节点不参与路由，或者替换掉剩余电量较少的网络节点，或者，使得能耗较大的网络节点不参与路由，或者替换掉能耗较大的网络节点。
本实施例或者其他实施例中，对于满足BLE mesh规范的通讯网络来说，要实现所述目标数据从所述源节点传输至所述目的节点，所述目标数据若经过多次转发(又可称之为多跳)，负责每一次转发的网络节点称之为中继节点，比如某一时刻，对于负责某一次转发网络节点称之为当前跳中继节点，而负责上一次转发的网络节点称之为上一跳中继节点。
图2B为本申请实施例二中步骤S202的一流程示意图；可选地，本实施例或者其他实施例中，如图2B所示，步骤S202中根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点时，可以包括如下步骤S212-S252：
S212、根据设置的节点通信距离均衡规则，使所述通讯网络中除所述源节点之外的所述网络节点接收所述源节点发送的路由请求消息；
本实施例中，如果应用满足BLE mesh规范的通讯网络话，则所述源节点可以以广播的形式向通讯网络中的网络节点发送路由请求消息，而接收到所述路由请求消息的网络节点理论上可能是除所述源节点之外的所述网络节点。此处，需要说明的是，在一些应用场景中，所述源节点也可以以单播的形式向通讯网络中的网络节点发送路由请求消息。
如前所述，节点通信距离均衡规则主要用于控制所述目标数据从所述源节点传输至所述目的节点时基于最短通信距离，因此，理论上，在建立路由的过程中，接收到所述源节点发送的路由请求消息的网络节点可能为在所述源节点的通信范围内的一个或者多个网络节点。
本实施例或其他实施例中，如果所述目的节点在所述源节点的通信距离范围内，则所述目的节点也可能会接收到所述路由请求消息，比如，在一种应用场景中，如果所述源节点的物理位置发生移动，从而使得所述目的节点在所述源节点的通信距离范围内。
S232、根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行处理，并生成对应的第一跳中继请求消息；
进一步地，本实施例或其他实施例中，步骤S232中根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行处理，并生成对应的第一跳中继请求消息时，可以具体包括：
根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息；
或者，根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析，并在对应的延迟时间到达时生成对应的第一跳中继请求消息；
或者，根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，且在对应的延迟时间到达时发送第一跳中继请求消息；
或者，接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，并根据设置的节点电量均衡规则，使接 收到所述路由请求消息的所述网络节点按照各自的剩余电量控制对应的所述第一跳中继请求消息的发送时序。
优选地，本实施例中，所述节点电量均衡规则比如为：
若先接收到所述路由请求消息的所述网络节点的剩余电量小于后接收到所述路由请求消息的所述网络节点的剩余电量，则使先接收到所述路由请求消息的所述网络节点对应的所述延迟时间大于后接收到所述路由请求消息的所述网络节点对应的所述延迟时间；
或者，若先接收到所述路由请求消息的所述网络节点的剩余电量大于后接收到所述路由请求消息的所述网络节点的剩余电量，则使先接收到所述路由请求消息的所述网络节点对应的所述延迟时间小于后接收到所述路由请求消息的所述网络节点对应的所述延迟时间；
或者，使接收到所述路由请求消息且剩余电量多的所述网络节点早于剩余电量少的所述网络节点发送对应的所述第一跳中继请求消息。
由此可见，剩余电量越少则延迟时间越长，反之，剩余电量越多则延迟时间越短。在一些实施例中，延迟时间可以与剩余电量成反比关系，本实施例对此不作限定。
若根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者对接收到的所述路由请求消息进行解析；
或者，若根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析，并在对应的延迟时间到达时生成对应的第一跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者生成第一跳中继请求消息；
或者，若根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，且在对应的延迟时间到达时发送第一跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者发送第一跳中继请求消息。
再比如，如接收到所述路由请求消息的所述网络节点对接收到的所述路由请求 消息进行解析并生成对应的第一跳中继请求消息，则在根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点按照各自的剩余电量控制对应的所述第一跳中继请求消息的发送时序时，剩余电量多的所述网络节点先于剩余电量少的所述网络节点发送对应的第一跳中继请求消息。
S252、根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
进一步地，本实施例或其他实施例中，步骤S252中根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳路由节点时，可以包括如下步骤S2521-S2522：
S2521、根据所述第一跳中继请求消息，确定接收到所述路由请求消息的所述网络节点的路由表项；
S2522、根据所述路由表项，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
本实施例中，若步骤S232中根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息，则接收到所述路由请求消息的所述网络节点的路由表项中可以包括所述路由请求消息的解析时间，则在步骤S2522中，可以具体根据所述路由表项中所述路由请求消息的解析时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述路由请求消息的解析时间越晚；剩余电量越多则延迟时间越短，则对应的所述路由请求消息的解析时间越早，因此，通过比对解析时间，从中选择较早解析时间对应的网络节点作为第一跳中继节点。
或者，本实施例中，若步骤S232中根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析，并在对应的延迟时间到达时生成对应的第一跳中继请求消息，则接收到所述路由请求消息的所述网络节点的路由表项中可以包括所述第一跳中继请求消息的生成时间；则在步骤S2522中，可以具体根据所述路由表项中所述第一跳中继请求消息的生成时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述第一跳中继请求消息的生成时间越晚；剩余电量越多则延迟时间越短，则对应的所述第一跳中继请求消息的生成时间越早，因此，通过比对生成时间，从中选择较早生成时间对应的网络节点作为第一跳中继节点。
或者，若步骤S232中根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，且在对应的延迟时间到达时发送第一跳中继请求消息，则接收到所述路由请求消息的所述网络节点的路由表项中可以包括所述第一跳中继请求消息的发送时间，则在步骤S2522中，可以具体根据所述路由表项中所述第一跳中继请求消息的发送时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述第一跳中继请求消息的发送时间越晚；剩余电量越多则延迟时间越短，则对应的所述第一跳中继请求消息的发送时间越早，因此，通过比对发送时间，从中选择较早发送时间对应的网络节点作为第一跳中继节点。
本实施例中，上述步骤S2522的执行主体具体可以为接收到所述路由请求消息的所述网络节点，也可以为配置的一控制设备。
可替代地，在其他实施例中，若步骤S232中根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，且在对应的延迟时间到达时发送第一跳中继请求消息，则所述第一跳中继请求消息中可以包括所述第一跳中继请求消息的发送时间，则步骤S252的执行主体主体可以为接收所述第一跳中继请求消息的网络节点，该接收所述第一跳中继请求消息的网络节点将产生先接收到的所述第一跳中继请求消息的所述网络节点作为第一跳中继节点。
可替代地，在一些应用场景中，所述路由请求消息的解析时间、所述第一跳中继请求消息的生成时间、所述第一跳中继请求消息的发送时间也可以保存在接收到所述路由请求消息的所述网络节点的本地，而并非只能包括在接收到所述路由请求消息的所述网络节点的路由表项中。
可替代地，在一些应用场景中，若接收到所述路由请求消息的所述网络节点的本地未保存或者对应的路由表项中不包括所述路由请求消息的解析时间、所述第一跳中继请求消息的生成时间、所述第一跳中继请求消息的发送时间，则可选地，所述第一跳中继请求消息中可以包括路由更新的次数，则步骤S252中接收所述第一跳中继请求消息的网络节点对先接收到的第一跳中继请求消息进行解析并生成第二跳中继请求消息以及对应的路由表项，所述路由表项中可以包括所述路由更新的次数；接收所述第一跳中继请求消息的网络节点对后接收到的第一跳中继请求消息进行解析，若后接收到的第一跳中继请求消息中的所述路由更新的次数与所述第二跳中继请求消 息对应的路由表项中的所述路由更新的次数相同，则丢弃后接收到的第一跳中继请求消息，或者又称之为不对后接收到的第一跳中继请求消息进行处理，而是直接将产生先接收到的所述的第一跳中继请求消息的网络节点作为第一跳中继节点。
可替代地，在其他实施例中，所述第二跳中继请求消息对应的路由表项中可以包括的所述路由更新的次数，也可以保存在接收所述第一跳中继请求消息的所述网络节点的本地，而并非只能包括在所述第二跳中继请求消息对应的路由表项中。
可替代地，若接收到所述路由请求消息的所述网络节点的本地未保存或者对应的路由表项中不包括所述路由请求消息的解析时间、所述第一跳中继请求消息的生成时间、所述第一跳中继请求消息的发送时间，而可选地，还可以根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点按照各自的剩余电量控制对应的所述第一跳中继请求消息的发送时序，则在步骤S252中根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点时，接收所述第一跳中继请求消息的网络节点将产生先接收到的所述第一跳中继请求消息的所述网络节点作为第一跳中继节点。
此处，执行上述步骤S232-S252的处理过程，可以确定出所述源节点发送出所述目标数据之后，对所述目标数据进行第一次转发的中继节点(即上述第一跳中继节点)，如果确定出的路由按照转发的先后顺序总共有n个中继节点的话，则对所述目标数据进行第一次转发的中继节点即为第一跳中继节点。
S203、根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
具体地，比如，对于每个中继节点都有对应的路由表项，因此，为了满足BLE mesh规范的通讯网络通过多跳(比如n个中继节点即n跳)来实现目标数据传输，在每个中继节点的路由表项包括上一跳中继节点的标识，除此之外，目标数据是从源节点传输到目的节点，因此，对于源节点和目的节点同样分别对应有路由表项，因此，基于所述源节点、所述目的节点以及确定出的所述中继节点的路由表项即可建立所述路由。比如，在一些场景中，以包括n个中继节点为例，再加上源节点和目的节点，对于单向数据数据传输来说，建立的路由中共计有n+2个路由表项。
本实施例或其他实施例中，以包括n个中继节点为例，通过执行上述步骤S232-S252确定出了第一跳中继节点。
图2C为本申请实施例二中步骤S202的另一流程示意图；为确定出第2-第n跳中继节点，可选地，本实施例或者其他实施例中，如图2C所示，进一步地，步骤 S202中在根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点时，还可以包括：
S222、根据设置的节点通信距离均衡规则，使所述通讯网络中的所述网络节点接收上一跳中继节点发送的上一跳中继请求消息；
本实施例中，类似上述步骤S212，理论上来看，位于所述上一跳中继节点的通信距离范围内的所有网络节点(包括所述源节点、所述目的节点，以及除所述源节点、所述目的节点外的网络节点)可以接收到所述上一跳中继请求信息。
S242、根据设置的节点电量均衡规则，使接收到上一跳中继请求消息的所述网络节点对所述上一跳中继请求消息进行处理，以生成对应的当前跳中继请求消息；
进一步地，本实施例或其他实施例中，步骤S242中根据设置的节点电量均衡规则，使接收到上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行处理，并生成对应的当前跳中继请求消息时，可以具体包括：
根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述上一跳中继请求消息进行解析，并生成对应的当前跳中继请求消息；
或者，根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析，并在对应的延迟时间到达时生成对应的当前跳中继请求消息；
或者，根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，且在对应的延迟时间到达时发送所述当前跳中继请求消息；
或者，接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，并根据设置的节点电量均衡规则，使接收到所述上一跳中继请求消息的所述网络节点按照各自的剩余电量控制对应的所述当前跳中继请求消息的发送时序。
本实施例中，所述节点电量均衡规则比如为：
若先接收到所述上一跳中继请求消息的所述网络节点的剩余电量小于后接收到所述上一跳中继请求消息的所述网络节点的剩余电量，则使先接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间大于后接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间；
或者，若先接收到所述上一跳中继请求消息的所述网络节点的剩余电量大于后 接收到所述上一跳中继请求消息的所述网络节点的剩余电量，则使先接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间小于后接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间。
或者，使接收到所述上一跳中继请求消息且剩余电量多的所述网络节点早于剩余电量少的所述网络节点发送对应的所述当前跳中继请求消息。
由此可见，剩余电量越少则延迟时间越长，反之，剩余电量越多则延迟时间越短。比如：
若根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述上一跳中继请求消息进行解析，并生成对应的当前跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者对接收到的所述上一跳中继请求消息进行解析；
或者，若根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析，并在对应的延迟时间到达时生成对应的当前跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者生成当前跳中继请求消息；
或者，若根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，且在对应的延迟时间到达时发送所述当前跳中继请求消息，则剩余电量越多的网络节点相对于剩余电量越少的网络节点来说，前者的延迟时间小于后者的延迟时间，因此，前者先于后者发送当前跳中继请求消息。
再比如，如接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，在根据设置的节点电量均衡规则，使接收到所述上一跳中继请求消息的所述网络节点按照各自的剩余电量控制对应的所述当前跳中继请求消息的发送时序时，剩余电量多的所述网络节点先于剩余电量少的所述网络节点发送对应的当前跳中继请求消息。
S262、根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。
进一步地，本实施例或其他实施例中，步骤S262中根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中确定出当前跳中继节点时，可 以包括：
S2621、根据所述当前跳中继请求消息，确定接收到上一跳中继请求消息的所述网络节点的路由表项；
S2622、根据所述路由表项，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。
本实施例中，若步骤S242中根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述上一跳中继请求消息进行解析，并生成对应的当前跳中继请求消息，则接收到所述上一跳中继请求消息的所述网络节点的路由表项中可以包括所述上一跳中继请求消息的解析时间，则在步骤S2622中，可以具体根据所述路由表项中对所述上一跳中继请求消息的解析时间，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述上一跳中继请求消息的解析时间越晚；剩余电量越多则延迟时间越短，则对应的所述上一跳中继请求消息的解析时间越早，因此，通过比对解析时间，从中选择较早解析时间对应的网络节点作为当前跳中继节点。
或者，本实施例中，若步骤S242中根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析，并在对应的延迟时间到达时生成对应的当前跳中继请求消息，则接收到所述上一跳中继请求消息的所述网络节点的路由表项中可以包括所述当前跳中继请求消息的生成时间；则在步骤S2622中，可以具体根据所述路由表项中所述当前跳中继请求消息的生成时间，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述当前跳中继请求消息的生成时间越晚；剩余电量越多则延迟时间越短，则对应的所述当前跳中继请求消息的生成时间越早，因此，通过比对生成时间，从中选择较早生成时间对应的网络节点作为当前跳中继节点。
或者，若步骤S242中根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，且在对应的延迟时间到达时发送所述当前跳中继请求消息，则接收到所述上一跳中继请求消息的所述网络节点的路由表项中可以包括所述当前跳中继请求消息的发送时间，在步骤S2622中，可以具体根据所述路由表项中所述当前跳中继请求消息的发送时间，从接收到所述上一跳中继请求消息的所述网络节 点中确定出当前跳中继节点。如前所述，剩余电量越少则延迟时间越长，则对应的所述当前跳中继请求消息的发送时间越晚；剩余电量越多则延迟时间越短，则对应的所述当前跳中继请求消息的发送时间越早，因此，通过比对发送时间，从中选择较早发送时间对应的网络节点作为当前跳中继节点。
本实施例中，上述步骤S2622的执行主体具体可以为接收到所述上一跳中继请求消息的所述网络节点，也可以为配置的一控制设备。
可替代地，在其他实施例中，若步骤S242中根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，且在对应的延迟时间到达时发送所述当前跳中继请求消息，所述当前跳中继请求消息中可以包括所述当前跳中继请求消息的发送时间，则步骤S262的执行主体主体可以为接收所述当前跳中继请求消息的网络节点，接收到当前跳中继请求消息的网络节点将产生先接收到的所述当前跳中继请求消息的所述网络节点作为当前跳中继节点。
可替代地，在一些应用场景中，所述上一跳中继请求消息的解析时间、所述当前跳中继请求消息的生成时间、所述当前跳中继请求消息的发送时间也可以保存在接收到所述上一跳中继请求消息的所述网络节点的本地，而并非只能包括在接收到所述上一跳中继请求消息的所述网络节点的路有表项中。
可替代地，在一些应用场景中，若接收到所述上一跳中继请求消息的所述网络节点的本地未保存或者对应的路由表项中不包括所述上一跳中继请求消息的解析时间、所述当前跳中继请求消息的生成时间、所述当前跳中继请求消息的发送时间，则可选地，所述当前跳中继请求消息中可以包括路由更新的次数，则步骤S262中接收所述当前跳中继请求消息的网络节点对先接收到的当前跳中继请求消息进行解析并生成对应的中继请求消息以及对应的路由表项，所述路由表项中可以包括所述路由更新的次数；接收所述当前跳中继请求消息的网络节点对后接收到的当前跳中继请求消息进行解析，若后接收到的当前跳中继请求消息中的所述路由更新的次数与所述对应的跳中继请求消息对应的路由表项中的所述路由更新的次数相同，则丢弃后接收到的当前跳中继请求消息，或者又称之为不对后接收到的当前跳中继请求消息进行处理，而是直接将产生先接收到的所述的当前跳中继请求消息的网络节点作为当前跳中继节点。
可替代地，在其他实施例中，所述对应的中继请求消息对应的路由表项中可以包括的所述路由更新的次数，也可以保存在接收所述当前跳中继请求消息的所述网络 节点的本地，而并非只能包括在接收所述当前跳中继请求消息的所述网络节点的所述路由表项中。
可替代地，若接收到所述上一跳请求消息的所述网络节点的本地未保存或者对应的路由表项中不包括所述上一跳中继请求消息的解析时间、所述当前跳中继请求消息的生成时间、所述当前跳中继请求消息的发送时间，而可选地，还可以根据设置的节点电量均衡规则，使接收到所述上一跳中继请求消息的所述网络节点按照各自的剩余电量控制对应的所述当前跳中继请求消息的发送时序时，则在步骤S262中根据所述当前跳中继请求消息，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点时，接收所述当前跳中继请求消息的网络节点将产生先接收到的所述当前跳中继请求消息的所述网络节点作为当前跳中继节点。
由此可见，相对于第一跳中继节点(即上一跳中继节点)，执行上述步骤S222-S262可以确定出第2跳中继节点(即当前跳中继节点)；相对于第2跳中继节点(即上一跳中继节点)，执行上述步骤S222-S262可以确定出第3跳中继节点(即当前跳中继节点)，以此类推，直至确定出第n跳中继节点。
此处，需要说明的是，上一跳中继节点、当前跳中继节点是示例性的相对表述，并非唯一性限定。
综上实施例二，通过确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由，由此可见，在建立路由的时候不但考量参与路由建立的中继节点之间的通信距离，而且还考量了中继节点的剩余电量或者能耗，从而使得参与所述路由建立的中继节点既符合转发目标数据的通信距离的要求，又符合转发目标数据时的所需电量或者能耗的要求，从而可以有效实现目标数据的传输，比如，在一些情形中，会避免了在建立路由的时候仅仅考虑通信距离要求时，使得剩余电量较少的低功耗节点作为中继节点，则在转发目标数据时，由于其剩余电量过少而无法实现目标数据的正常传输。
可选地，在本实施例或者其他实施例中，在一些应用场景中，“接收”或者“发送”可以以广播的形式实现，或者，以单播的形式实现，或者，单播和广播混合的形式实现，在此不做特别限定，可以包括可以实现本申请的技术方案的任意形式即可。
可选地，在本实施例或者其他实施例中，所述根据源节点、目的节点以及确定出的所述中继节点，建立所述路由之后，还可以包括：根据设置的所述节点电量均衡规则对已建立的所述路由进行动态维护，从而可以根据中继节点的耗能情况，实时选出既满足节点通信距离均衡规则以及节点电量均衡规则的网络节点作为新的中继节点，从而替换掉剩余电量较少或者能耗较大的网络节点，从而保证了路由的实时有效性，并保证了目标数据的正常传输。
以下结合具体的应用场景对本申请上述图2B实施例提供的方案进行示例性解释。
图3A为本申请实施例三中提供的通讯网络结构示意图；如图3A所示，在该通讯网络(以满足BLE mesh规范的通讯网络为例)中可以包括五个网络节点，分别记为A、B、C、D、E，图3A上每个圆圈的大小表示对应网络节点的通信范围，圆圈圆心之间的距离表示两个节点之间直接通信距离，记为d i,j，i,j＝A、B、C、D、E，且i≠j。
另外，假设节点A、B、C、D、E的直接通信距离满足如下关系：d A,B<d A,C；d B,C＝d C,D＝d B,D＝d D,E。
在图3A所示应用场景中，以网络节点A要向网络节点E发送目标数据为例，因此，网络节点A为源节点、网络节点E为目的节点，这两个网络节点为端节点。为此，以基于节点通信距离均衡规则为例，建立可实现使用中继节点对目标数据进行转发以将目标数据从网络节点A发送到网络节点E的路由为例，考虑到网络节点E也可能作为源节点、网络节点A也有可能作为目的节点，为此，下述(1)-(10)通过一次路由建立的过程，建立即可以实现从网络节点A向网络节点E传输目标数据，又可以实现从网络节点E向网络节点A传输目标数据，对上述图2A提供的技术方案进行示例性说明。对于路由来说，所述源节点、所述目的节点为端节点，对目标数据进行转发的网络节点为中继节点。但是，在其他实施例中，如果不考虑通过一次路由建立的过程，建立即可以实现从网络节点A向网络节点E传输目标数据，又可以实现从网络节点E向网络节点A传输目标数据的话，也可以只包括如下(1)-(7)即可，仅建立路由以实现从网络节点A向网络节点E传输目标数据或者实现从网络节点E向网络节点A传输目标数据。下述实施例中，以路由更新的次数为例对路由的过程进行描述。
(1)源节点A向通讯网络中的网络节点发送路由请求信息；
源节点为路由的端节点之一。图3B为路由请求消息的数据结构示意图；如图 3B所示，该路由请求消息的数据结构包括type字段、current字段、src字段、dest字段以及update字段，其中，type字段用于标识消息的类型，该字段为1表示请求消息(request)，为2表示回复消息(reply)；current字段用于标识发出路由请求消息的节点的ID；src字段和dest字段分别用于标识源节点和目的节点的ID，update字段用于标识源节点的路由更新的次数。
基于上述图3B数据结构的定义，源节点A发送的路由请求信息(记为A request)为1-A-A-E-1，表示这是一条由A发出的request消息，需要建立由A到E的路由。
进一步地，由于路由请求信息A request被发送出去之后即销毁，因此为保留或者固化路由请求信息A request中的数据，为源节点配置有路由表项，图3C为路由表项的数据结构示意图；如图3C所示，路由表项包括src字段、dest字段、update字段、p-node字段、n-node字段，src字段、dest字段分别用于标识源节点和目的节点的ID；p-node字段用于标识上一跳中继节点的ID，n-node字段用于标识源节点的下一跳中继节点的ID(当前跳中继节点的ID)，update字段用于标识路由更新的次数，对于源节点来说，update的初始值为0。因此，对于源节点A来说，其路由表项为A-E-1-0-0，其中，由于在网络节点B、C对路由请求信息A request处理之后才会确定出是网络节点B还是网络节点C作为当前跳中继节点，因此，对于源节点A其对应的路由请求信息A request中，n-node字段的值为0，而对于源节点A，并不存在上一跳中继节点，因此，p-node字段的值也为0。上，此处需要所明的是，路由请求消息中配置为包括n-node字段，如前所述，主要考虑到考虑通过一次路由建立的过程，建立即可以实现从网络节点A向网络节点E传输目标数据，又可以实现从网络节点E向网络节点A传输目标数据，即双向数据传输。如果考虑从网络节点A向网络节点E传输目标数据，则路由请求消息中也可以不包括n-node字段，即通过上一跳中继节点-当前跳中继节点机制建立路由，或者，如果包括n-node字段的话，n-node字段的值为0。
(2)网络节点B接收到源节点发送的路由请求消息A request并对其进行解析以生成网络节点B对应的中继请求消息B request；
如前所述，如果基于节点通信距离均衡规则只考虑直接通信距离的限制，由于d A,B<d A,C，所以网络节点B比网络节点C先收到路由请求消息A request。
如前所述，由于源节点为网络节点A，目的节点为网络节点E，因此，除此之外的网络节点B、C、D可以起到转发目标数据的作用，在图3A所示的应用场景中，由于网络节点D不位于网络节点A的通信范围内，由此，网络节点B、C可接收到路由请求消息A request。对于网络节点B、C来说，接收到源节点的路由请求消息A request分 别会对应生成一个中继请求消息B request、C request。图3D为本申请实施例中继请求消息的数据结构示意图；如图3D所示，中继请求消息包括type字段、current字段、src字段、dest字段、update字段、p-node字段和n-node字段，这些字段的含义请参见上述图3B和图3C所示的记载。
此处，在其他应用场景中，如果网络节点D位于网络节点A的通信范围内，则网络节点D也可以接收到路由请求消息A request，比如网络节点A的物理位置发生变化导致网络节点D位于网络节点A的通信范围内。此处的情形仅仅是示例，并非唯一性限定。
具体地，对于网络节点B来说，其生成中继请求消息B request包括：网络节点B收到路由请求消息A request，对其进行解析并通过数据组装生成一条中继请求消息B request并进行发送。参见图3D提供的数据结构示意；中继请求消息B request中的current字段填充为B；src字段、dest字段、update字段直接用A request中对应的字段值填充即可；p-node字段用A request中的src字段填充(为A)，n-node字段填充为0。因此，对于要建立实现从网络节点A向网络节点E传输目标数据的路由来说，网络节点B发送的中继请求消息B request为1-B-A-E-1-A-0。类似上述的路由表项定义，网络节点B的路由表项为A-E-1-A-0。
(3)网络节点C接收到源节点发送的路由请求消息A request并对其进行处理生成对应的中继请求消息C request；
与(2)中的处理类似，网络节点C生成的中继请求消息C request为1-C-A-E-1-A-0，C的路由表项为：A-E-1-A-0。
(4)网络节点D接收并处理中继请求消息B request并生成对应的中继请求消息D request；
基于最短通信距离优先，由于d A,B+d B,D<d A,C+d C,D，所以网络节点D收到中继请求消息B request之后，才会收到中继请求消息C request，所以先对中继请求消息B reqqest进行解析以生成对应的中继请求消息D request；而丢弃后收到的中继请求消息C request，丢弃的原因类似下述网络节点B丢弃中继请求消息C request的原因。
与(2)中的处理类似，网络节点D发送的中继请求消息D request为1-D-A-E-1-B-0，网络节点D的路由表项为A-E-1-B-0。
(5)网络节点B接收并解析中继请求消息C request，网络节点D接收并解析中继请求消息C request。
网络节点B接收到中继请求消息C request(1-C-A-E-1-A-0)后，进一步对比网络节点B对应的路由表项和中继请求消息C request中对应src和dest的信息，发现此次路由建立是要建立实现从网络节点A向网络节点E传输目标数据的路由，进一步发现其网络节点B对应的路由表项中的update与中继请求消息C request中的update相同，均为1，所以不更新网络节点B的路由表项，网络节点B丢弃中继请求消息C request以不对中继请求消息C request进行处理。若对比网络节点B对应的路由表项和中继请求消息C request中对应src和dest的信息，发现此次路由建立并非是要建立实现从网络节点A向网络节点E传输目标数据的路由，则直接丢弃中继请求消息C request。
可替代地，在其他实施例中，也可以先对比网络节点B对应的路由表项中的update与中继请求消息C request中的update，发现网络节点B对应的路由表项中的update与中继请求消息C request中的update的值均为1；进一步再比对网络节点B对应的路由表项和中继请求消息C request中对应src和dest的信息，发现此次路由建立是要建立实现从网络节点A向网络节点E传输目标数据的路由，所以不更新网络节点B的路由表项并丢弃中继请求消息C request以不对中继请求消息C request进行处理。
可替代地，在其他实施例中，也可以对比网络节点B对应的路由表项中的update与中继请求消息C request中的update，以及对比网络节点B对应的路由表项和中继请求消息C request中对应src和dest的信息，发现此次路由建立是要建立实现从网络节点A向网络节点E传输目标数据的路由，但发现网络节点B对应的路由表项中的update与中继请求消息C request中的update的值均为1，则不更新网络节点B的路由表项并丢弃中继请求消息C request以不对中继请求消息C request进行处理。
在其他一些实施例中，若发现网络节点B对应的路由表项中的update小于中继请求消息C request中的update的值，且发现此次路由建立是要建立实现从网络节点A向网络节点E传输目标数据的路由，则可以处理中继请求消息C request并更新网络节点B的路由表项。
通过上述对比网络节点B对应的路由表项中的update与中继请求消息C request中的update，以及对比网络节点B对应的路由表项和中继请求消息C request中对应src和dest的信息，从而实现了同一条路由的建立过程中控制路由表项的更新或者不更新。
另外，对于网络节点C来说，其也会收到中继请求消息B request，由于网络节点C对A request进行处理得到的路由表项中也包括update字段，网络节点C的路由表 项中的update字段与中继请求消息B request的update字段具有相同的值(即1)，因此，网络节点C丢弃中继请求消息B request以不对中继请求消息B request进行处理，从不更新网络节点C已有的路由表项，即对A request进行处理得到的路由表项。
(6)网络节点D接收并解析中继请求消息B request、中继请求消息C request
如前所述，由于网络节点B距离网络节点D更近，而网络节点C距离网络节点C更远，因此，网络节点D先接收到中继请求消息B request，并对中继请求消息B request进行解析从而生成中继请求消息D request，直接将网络节点B的标识填充到中继请求消息D request中，进一步生成对应的路由表项，该路由表项中的update字段的值为1；而由于网络节点D后收到中继请求消息C request，通过中继请求消息B request进行解析从而生成的路由表项中的upadate字段与中继请求消息C request中的update字段比较，发现这两个update字段的值均为1，则网络节点D丢弃中继请求消息C request以不对中继请求消息C request进行解析并对路由表项中的update字段进行更新(或者又称之为对中继请求消息C request进行解析并重新生成路由表项)，从而实现了直接将网络节点B作为当前跳中继节点。
(7)网络节点E接收并处理中继请求消息D request。
由于网络节点E为目的节点，因此，其接收并处理中继请求消息D request，生成路由回复消息E reply，由于目的节点为另一端节点，因此，该端节点回复消息的结构如图3B所示，具体地，由于是回复消息，因此，其中，type字段填充为2；current字段填充为E；src和dest字段分别填充为A和E；update字段的初始值为1，增加1之后，填充为2。所以，路由回复消息E reply为2-E-A-E-2。
网络节点E发送路由回复消息E reply。此处，需要注意的是，E在上述处理过程中，可以确定D request来源于D，所以在发送路由回复消息E reply时，只需要以单播的形式发给网络节点D即可。
自此，如果只考虑由网络节点A作为源节点向网络节点E作为目的节点传输数据的话，通过上述(1)-(7)建立的路由对应为A-B-D-E，其中，第一跳中继节点为B，第二跳中继节点为D，总共有2个中继节点参与目标数据的转发。
(8)网络节点D接收并解析路由回复消息E reply。
网络节点D对E reply进行解析并从中得知这是一条A-E路由请求消息的路由回复消息，并且其update字段的值为2，大于网络节点D的路由表项(A-E-1-B-0)中 的update字段的值，所以更新网络节点D的路由表项为A-E-2-B-E。
网络节点D生成一条路由回复消息D reply。路由回复消息的数据结构与路由请求消息的数据结构相同，如图3C所示。其中，区别在于type字段填充为2；其他字段如current字段填充为D；src和dest字段分别填充为A和E；update字段填充为2；p->node填充为0；n-node填充为E，所以路由回复消息D reply为2-D-A-E-2-0-E。
(9)网络节点B接收并解析路由回复消息D reply。
B对D reply的处理和D对E reply的处理类似，同样是完成网络节点B路由表项的更新和路由回复消息B reply的生成。网络节点B的路由表项更新为A-E-2-A-D，路由回复消息B reply为2-B-A-E-2-0-D。
(10)网络节点A接收并解析路由回复消息B reply。
网络节点A对路由回复消息B reply的解析，与网络节点B对路由回复消息D reply的解析类似。
源节点A根据路由回复消息B reply，更新其路由表项为A-E-2-0-B。
上述步骤后，根据A、B、D、E的路由表项，可以得到路由为A-B-D-E，该路由即可以满足从网络节点A向网络节点E传输目标数据，也可以从网络节点E向网络节点A传输目标数据，从而实现了一次路由建立过程，满足双向的目标数据传输需求。
需要注意的是，在消息发送的过程中，任一网络节点中会收到冗余的路由请求消息或者中继请求消息或者路由回复消息，比如源节点A可能会收到路由请求消息B request、网络节点B可能会收到路由请求消息D request、网络节点C会收到路由请求消息D reques_等等，对于这些消息，同样可以通过update字段的大小从而丢弃掉，如果update值相同，则丢弃在后收到的消息(分别对应路由请求消息或者路由中继消息或者路由回复消息的情形)。对于某个网络节点，如果已经有路由表项，该路由表项中的字段已经填充了有效的数据，则表明在先收到过中继请求消息。
至此，完成了满足双向数据传输的路由建立，后续传输目标数据时时，依靠端节点和中继节点的路由表项，就可以完成目标数据的传输。
上述过程仅仅是考虑了节点通信距离均衡原则，从网络节点中确定出中继节点，但是，以电池提供电量为例，考虑到功耗的问题，如果某个低功耗的中继节点频繁的被使用，就会导致低功耗的中继节点电量消耗过多，甚至耗尽无法正常工作的情形，或者，在建立路由的时候，某个低功耗节点的剩余电量较少。为此，在从上述根据设 置的节点通信距离均衡规则，从网络节点中确定出中继节点时增加了节点电量均衡原则的考量。
示例性地，结合上述图3A提供的具体应用场景，假如网络节点B为低功耗节点，考虑到A-E之间的频繁数据传输将导致网络节点B电量的持续消耗，甚至电量耗尽无法正常工作，或者，在建立路由的时候，网络节点B的剩余电量较少。综合考量节点通信距离规则和节点电量均衡原则，可以确定网络节点C上是可替代网络节点B，与上述图3A筛选处理结果不同的是，根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从网络节点B、C中确定出网络节点C而并非B作为第一跳中继节点。
可选地，本实施例中，步骤S202中根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点时，可以包括：
根据设置的节点通信距离均衡规则，使所述通讯网络中除所述源节点之外的所述网络节点B/C接收所述源节点A发送的路由请求消息A request；根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点B/C对接收到的所述路由请求消息A request进行解析，并生成对应的当前跳中继请求消息B request/C request。
进一步地，本实施例或其他实施例中，根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点B/C对接收到的所述路由请求消息A request进行解析，并生成对应的当前跳中继请求消息B request/C request时，可以包括：根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点B/C在对应的延迟时间到达时对接收到的所述路由请求消息A request进行解析，并生成对应的当前跳中继请求消息B request/C request；根据所述当前跳中继请求消息B request/C request，从接收到所述路由请求消息的所述网络节点B/C中确定出当前跳中继节点为C。
由此可见，假设网络节点B剩余的电量比网络节点C剩余的电量少，由于按照上述根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息并发送的话，剩余电量越少则延迟时间越长，反之，剩余电量越多则延迟时间越短，从而使得剩余电量少的网络节点B晚于剩余电量多的网络节点C对接收到的所述路由请求消息进行解析A request，并生成对应的当前跳中继请求消息B request/C request。进一步基于节点距离均衡原则，参见图3A，由于d C,D＝d B,D，因此， 当前跳中继请求消息B request晚于当前跳中继请求消息C request被网络节点D接收，因此B request会被网络节点D丢弃，而网络节点D对C request进行处理从而生成D request进而生成对应的路由表项，在该路由表项中p-node字段填充为网络节点C的ID，而并非网络节点B的ID，从而将网络节点C作为当前跳中继节点。
在一种应用场景中，对于不同的网络节点可以设置对应的电量阈值，当网络节点的剩余电量低于对应的电量阈值时，启动上述步骤S202，否则，可以直接根据设置的节点通信距离均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，既执行上述(1)-(7)的过程。
比如，对于上述网络节点来说，假如用网络节点B、C的剩余电量百分比来表示剩余电量的多少，其分别记为Power B和Power C，为这两个网络节点配置的电量阈值分别为Limit B和Limit C，定义延迟处理时间常量为P Constant，则在上述网络节点B和C接收A request时，如前所述，由于d A,B<d A,C，所以在上述(2)中，B会先于C收到A request。此时，网络节点B检查自身电池电量百分比，即Power B，如果Power B<Limit B，则网络节点B延迟P Constant/Power B时间后再处理A request。
类似地，在上述(3)中，C会晚于B收到A request，网络节点C检查自身电池电量百分比，即Power C，如果Power C<Limit C，则网络节点C延迟P Constant/Power C时间后再处理A request。
进一步地，本实施例或其他实施例中，根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点时，可以包括：根据所述第一跳中继请求消息B request/C request，确定接收到所述路由请求消息A request的所述网络节点B/C的路由表项；根据所述网络节点B/C的路由表项，从接收到所述路由请求消息A request的所述网络节点B/C中确定出第一跳中继节点为网络节点B。
类似上述(1)-(10)的描述，但是，网络节点C会收到网络节点B的B request，但是由于网络节点B/C的路由表项中update的值均为1，而由于考虑到延迟处理时间，网络节点C的C request先于网络节点B的B request产生，网络节点D先收到中继请求消息C request并对其进行解析从而生成对应的路由表项，该路由表项中update字段的值为1，而后收到中继请求消息B request，中继请求消息B request与网络节点D已生成的路由表项中的update字段的值相同，因此，网络节点D丢弃中继请求消息B request，而将网络节点C作为第一跳中继节点，从而使得建立的路由为A-C-D-E，对应地，网络节点A的路由表项变为A-E-2-0-C。
上述仅仅结合图3A所示的具体通讯网络对如何根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点B/C中确定出第一跳中继节点为例进行说明。但是，如果有n个中继节点的话，也可以应用到确定第2跳中继节点至第n跳中继节点的处理过程中，假如将第一跳中继请求消息B request/C request比作为当前跳中继请求消息，将所述路由请求消息A request比作为上一跳中继请求消息的话，其具体技术处理过程类似根据设置的节点通信距离均衡规则以及所述节点电量均衡规则确定出第一跳中继节点的过程。
当将上述实施例二的方案应用到即包括低功耗节点，又包括友好节点的通讯网络中时，可以针对低功耗节点和友好节点设置不同的电量阈值；而对于不同的低功耗节点也可以设置不同的电量阈值，不同的友好节点设置不同的电量阈值。对于针对低功耗节点和友好节点设置不同的电量阈值的情形来说，考虑到友好节点为持续电源供电，而低功耗节点由电池供电，则优选友好节点作为中继节点，则可以设置友好节点的电量阈值小于低功耗节点的阈值。
另外，在一些其他实施例中，考虑到到目标数据传输的次数越多，即某个中继节参与目标数据的转发越多，其电量消耗也会越多，对于电池供电来说，电池的剩余电量也就越少，因此，在使用上述实施例提供的方案完成路由的建立之后，还可以根据所述设置的所述节点电量均衡规则对已建立的所述路由进行动态维护。
具体地，在维护时，实时检测路由中已有的所述中继节点的剩余电量(或者电量消耗)，当存在剩余电量小于对应的电量阈值的所述中继节点时(或者大于对应电量消耗阈值时)，剩余电量小于对应的电量阈值的所述中继节点通知其通信范围内的所述网络节点，以根据所述设置的所述节点电量均衡规则对已建立的所述路由进行动态维护。
比如，继续结合上述图3A所示的通讯网络为例，建立的路由为A-C-D-E，参见具体示例性的过程如下：
每个中继节点定期检查自身电量信息，比如其中如果网络节点C的电量过低，即满足Power C<Limit C，则由于网络节点A、B、D在网络节点C的通信范围内，网络节点C将其电量过低的状态通知发送给网络节点A、B、D。
对于上述包括(1)-(10)以建立可以满足从网络节点A向网络节点E传输目标数据，也可以从网络节点E向网络节点A传输目标数据的路由情形来说，因此，对于从网络节点E向网络节点A传输目标数据的路由情形网络节点A、B、D节点收到网络节点C的电量过低的状态通知后，对照各自的路由表项，找到包括下一跳(n-node 字段)中继节点为网络节点C的路由表项，在上述具体应用场景中，只有A的路由表项A-E-2-0-C中后一跳中继节点为C，因此，从网络节点A重新发起建立A-E的路由请求消息，即对于这种特定的场景，相当于重新发起路由请求消息，以从所述通讯网络中找到替代当前跳中继节点C的其他网络节点作为新的第一跳中继节点，而第二跳中继节点D保持不变。网络节点A重新发起建立A-E路由的路由请求消息即可重新建立A-E路由即可，对应到上述具体应用场景，网络节点A再次生成的路由请求消息为：1-A-A-E-3，假如网络节点B的剩余电量未小于其电量阈值Limit B，则使用网络节点B代替网络节点C作为新的当前跳中继节点。此处，需要说明的是，对于网络节点A来说，完成上述(1)-(7)的处理之后，由于网络节点A的路由表项中，update字段的值为1，再完成上述(8)-(10)的处理之后，网络节点A的路由表项中，update字段的值加1以更新为2；再经过上述网络节点A重新发起建立A-E路由的路由请求消息可重新建立A-E路由以使用网络节点B替换网络节点C，网络节点A的路由表项中，update字段的值加1更新为3。
由上述可见，对于上述考虑了从网络节点A向网络节点E传输目标数据，也可以从网络节点E向网络节点A传输目标数据的路由情形，或者又称之网络节点A和网络节点E之间的数据双向传输情形或者又称之端节点之间的数据双向传输情形，因此，在维护时，实时检测中继节点的电量消耗，当中继节点的剩余电量小于对应的电量阈值时，根据所述设置的所述节点电量均衡规则对已建立的所述路由进行动态维护，具体包括：剩余电量小于对应电量阈值的中继节点通知其通信范围内的所述网络节点；接收到所述通知的网络节点对照各自对应的路由表项，从中确定出包括上一跳中继节点为剩余电量小于对应电量阈值的中继节点的ID的路由表项，且若该路由表项对应网络节点为所述源节点则由所述源节点重新发送路由请求消息，以确定新的中继节点，以替代掉剩余电量小于对应电量阈值的中继节点；若该路由表项对应网络节点不为所述源节点，则由于该路由表项中可以包括上一跳中继节点的ID，因此，可以上一跳中继节点的路由表项确定出将上一跳中继节点作为当前跳中继节点时的上一跳中继节点，直至追溯到所述源节点，从而从所述源节点重新发送路由请求消息，以建立新的路由，以替代剩余电量小于对应电量阈值的中继节点。
比如，图3E为本申请实施例三中提供的另外一种通讯网络结构示意图；通讯网络中共计有6个网络节点：A、B、C、D1、D2、E，AB<AC，BD1<BD2＝CD2，D1E＝D2E，网络节点A为源节点，网络节点E为目的节点，若按照上述实施例三提供的方案，假如建立的路由为A-B-D1-E，当前跳中继节点为B，第二跳中继节点为D1；当实时检 测到第二跳中继节点D1的剩余电量小于对应的电量阈值时，则第二跳中继节点D1将其电量过低的状态通知发送给网络节点B、D2、E，由于第二跳中继节点D1的路由表项中的上一跳中继节点为B(即当前跳中继节点B)，并非为源节点A，因此，进一步根据当前跳中继节点B的路由表项，追溯到源节点A，由源节点A重新发送路由请求消息，以建立新的路由，比如网络节点D2的剩余电量未小于其对应的电量阈值，则重新建立的路由中，使用网络节点D2代替网络节点D1作为新的第二跳中继节点。
此处，在第二跳中继节点D1对当前跳中继节点B发送的当前跳中继请求消息B request接收并进行解析处理以生成第二跳中继请求消息D1 request，进一步再生成第二跳中继节点D1的路由表项，因此，在第二跳中继节点D1中的路由表项中的p-node字段中填充当前跳中继节点的标识即B；因此，相对来说，第二跳中继节点D1可称之当前跳中继节点D1，而当前跳中继节点B可称之为上一跳中继节点B，即当前跳中继节点的路由表项会填充上一跳中继节点的标识。因此，若仅考虑网络节点A和网络节点E之间的数据单向传输情形，所以要重新追溯到源节点A重新建立路由，比如重新建立的路由为：A-B-D2-E。
另外，如果仅仅考虑上述包括(1)-(7)以建立满足从网络节点A向网络节点E传输目标数据的路由的话，或者又称之网络节点A和网络节点E之间的数据单向传输情形或者又称之端节点之间的数据单向传输情形，则可以网络节点B查找其自身的路由表项，将网络节点B视为当前跳中继节点，由于其对应的路由表项会记录有网络节点A的ID，为此，因此，从网络节点A重新发起建立A-E的路由请求消息，即对于这种特定的场景，相当于重新发起路由请求消息，以从所述通讯网络中找到替代作为当前跳中继节点的网络节点B的其他网络节点作为新的第一跳中继节点。网络节点A重新发起建立A-E路由的路由请求消息即可重新建立A-E路由即可，对应到上述具体应用场景，网络节点A再次生成的路由请求消息为：1-A-A-E-3，假如网络节点C的剩余电量未超过其电量，参照上述根据设置的节点通信距离均衡规则以及所述节点电量均衡规则确定出中继节点的处理过程，使用网络节点C代替网络节点B作为新的当前跳中继节点，比如，重新建立的路由为A-C-D2-E。
由上述可见，对于上述考虑了从网络节点A向网络节点E传输目标数据，或又称之网络节点A和网络节点E之间的数据单向传输情形或者又称之端节点之间的数据单向传输情形，因此，在维护时，实时检测中继节点的电量消耗，当中继节点的剩余电量小于对应的电量阈值时，根据所述设置的所述节点电量均衡规则对已建立的所述 路由进行动态维护，具体包括：剩余电量小于对应电量阈值的中继节点对照其对应的路由表项，从中确定出上一跳节点为源节点，则由所述源节点重新发送路由请求消息，以确定新的中继节点，以替代剩余电量小于对应电量阈值的中继节点；若上一跳节点不为所述源节点，则由于该路由表项中可以包括的上一跳节点的ID为上一跳中继节点的ID，因此，可以上一跳中继节点的路由表项确定出将上一跳中继节点作为当前跳中继节点时的上一跳中继节点，直至追溯到所述源节点，从而从所述源节点重新发送路由请求消息，以建立新的路由，以替代剩余电量小于对应电量阈值的中继节点。
图4A为本申请实施例四提供的一种路由的建立装置结构示意图；所述路由用于令目标数据经过中继节点的转发从源节点发送至目的节点，如图4A所示，其包括：
端节点确定模块301，用于确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
中继节点确定模块302，用于至少根据设置的节点电量均衡规则，从通讯网络的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
路由建立模块303，用于根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
图4B为所述中继节点确定模块的结构示意图；如图4B所示，可选地，在本实施例或其他实施例中，所述中继节点确定模块可以包括：
消息接收控制单元312，用于根据设置的节点通信距离均衡规则，使所述通讯网络中除所述源节点之外的所述网络节点接收所述源节点发送的路由请求消息；
消息解析控制单元322，用于根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息；
中继节点确定单元332，用于根据所述当前跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
另外，消息接收控制单元312，还可以用于根据设置的节点通信距离均衡规则，使所述通讯网络中的所述网络节点接收上一跳中继节点发送的上一跳中继请求消息；
消息解析控制单元322，还可以用于根据设置的节点电量均衡规则，使接收到上一跳中继请求消息的所述网络节点对所述上一跳中继请求消息进行处理，以生成对应的当前跳中继请求消息；
中继节点确定单元332，还可以用于根据所述当前跳中继请求消息，从接收到 上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。
有关确定第一跳中继节点、当前跳中继节点的示例性解释可参见上述实施例的记载。
综上实施例，通过端节点确定模块301确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；中继节点确定模块302至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；路由建立模块303根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由，由此可见，在建立路由的时候不但考量参与路由建立的中继节点之间的通信距离，而且还考量了中继节点的剩余电量或者能耗，从而使得参与所述路由建立的中继节点既符合转发目标数据的通信距离的要求，又符合转发目标数据时的所需电量或者能耗的要求，从而可以有效实现目标数据的传输，比如，在一些情形中，会避免了在建立路由的时候仅仅考虑通信距离要求时，使得剩余电量较少的低功耗节点作为中继节点，则在转发目标数据时，由于其剩余电量过少而无法实现目标数据的正常传输。
上述产品可执行本申请实施例所提供的方法，具备执行方法相应的功能模块和有益效果。未在本实施例中详尽描述的技术细节，可参见本申请实施例所提供的方法。本申请实施例提供的方法也可以适用于一种芯片，该芯片包括存储器和处理器，存储器和处理器耦合，存储器用于存储程序指令，处理器用于调用存储器存储的程序指令，使得芯片执行上述实施例提到的任意一种路由的建立方法。本实施例提供的芯片也可以用于一种耳机中，以实现上述相应的功能和效果，本实施例提供的芯片可以用于多个耳机中，耳机之间可以通过蓝牙技术进行连接。
至此，已经对本主题的特定实施例进行了描述。其它实施例在所附权利要求书的范围内。在一些情况下，在权利要求书中记载的动作可以按照不同的顺序来执行并且仍然可以实现期望的结果。另外，在附图中描绘的过程不一定要求示出的特定顺序或者连续顺序，以实现期望的结果。在某些实施方式中，多任务处理和并行处理可以是有利的。
在20世纪90年代，对于一个技术的改进可以很明显地区分是硬件上的改进(例如，对二极管、晶体管、开关等电路结构的改进)还是软件上的改进(对于方法流程的改进)。然而，随着技术的发展，当今的很多方法流程的改进已经可以视为硬件电路结构的直接改进。设计人员几乎都通过将改进的方法流程编程到硬件电路中来得到 相应的硬件电路结构。因此，不能说一个方法流程的改进就不能用硬件实体模块来实现。例如，可编程逻辑器件(Programmable Logic Device,PLD)(例如现场可编程门阵列(Field Programmable Gate Array，FPGA))就是这样一种集成电路，其逻辑功能由用户对器件编程来确定。由设计人员自行编程来把一个数字系统“集成”在一片PLD上，而不需要请芯片制造厂商来设计和制作专用的集成电路芯片。而且，如今，取代手工地制作集成电路芯片，这种编程也多半改用“逻辑编译器(logic compiler)”软件来实现，它与程序开发撰写时所用的软件编译器相类似，而要编译之前的原始代码也得用特定的编程语言来撰写，此称之为硬件描述语言(Hardware Description Language，HDL)，而HDL也并非仅有一种，而是有许多种，如ABEL(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description Language)、Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby Hardware Description Language)等，目前最普遍使用的是VHDL(Very-High-Speed Integrated Circuit Hardware Description Language)与Verilog。本领域技术人员也应该清楚，只需要将方法流程用上述几种硬件描述语言稍作逻辑编程并编程到集成电路中，就可以很容易得到实现该逻辑方法流程的硬件电路。
控制器可以按任何适当的方式实现，例如，控制器可以采取例如微处理器或处理器以及存储可由该(微)处理器执行的计算机可读程序代码(例如软件或固件)的计算机可读介质、逻辑门、开关、专用集成电路(Application Specific Integrated Circuit，ASIC)、可编程逻辑控制器和嵌入微控制器的形式，控制器的例子包括但不限于以下微控制器：ARC 625D、Atmel AT91SAM、Microchip PIC18F26K20以及Silicone Labs C8051F320，存储器控制器还可以可被实现为存储器的控制逻辑的一部分。本领域技术人员也知道，除了以纯计算机可读程序代码方式实现控制器以外，完全可以通过将方法步骤进行逻辑编程来使得控制器以逻辑门、开关、专用集成电路、可编程逻辑控制器和嵌入微控制器等的形式来实现相同功能。因此这种控制器可以可被认为是一种硬件部件，而对其内包括的用于实现各种功能的装置也可以视为硬件部件内的结构。或者甚至，可以将用于实现各种功能的装置视为既可以是实现方法的软件模块又可以是硬件部件内的结构。
上述实施例阐明的系统、装置、模块或单元，具体可以由计算机芯片或实体实现，或者由具有某种功能的产品来实现。一种典型的实现设备为计算机。具体的，计算机例如可以为个人计算机、膝上型计算机、蜂窝电话、相机电话、智能电话、个人 数字助理、媒体播放器、导航设备、电子邮件设备、游戏控制台、平板计算机、可穿戴设备或者这些设备中的任何设备的组合。
为了描述的方便，描述以上装置时以功能分为各种单元分别描述。当然，在实施本申请时可以把各单元的功能在同一个或多个软件和/或硬件中实现。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
在一个典型的配置中，计算设备包括一个或多个处理器(CPU)、输入/输出接口、网络接口和内存。
内存可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)。内存是计算机可读介质的示例。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其 他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以可被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
还需要说明的是，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、商品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、商品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个…”限定的要素，并不排除在包括所述要素的过程、方法、商品或者设备中还存在另外的相同要素。
本领域技术人员应明白，本申请的实施例可提供为方法、系统或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请可以在由计算机执行的计算机可执行指令的一般上下文中描述，例如程序模块。一般地，程序模块包括执行特定事务或实现特定抽象数据类型的例程、程序、对象、组件、数据结构等等。也可以在分布式计算环境中实践本申请，在这些分布式计算环境中，由通过通信网络而被连接的远程处理设备来执行事务。在分布式计算环境中，程序模块可以位于包括存储设备在内的本地和远程计算机存储介质中。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于系统实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例的部分说明即可。
以上所述仅为本申请的实施例而已，并不用于限制本申请。对于本领域技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本申请的权利要求范围之内。

Claims (21)

  1. 一种路由的建立方法，其特征在于，包括：
    确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
    至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
    根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
  2. 根据权利要求1所述的的方法，其特征在于，所述至少根据设置的节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，包括：
    根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点。
  3. 根据权利要求2所述的方法，其特征在于，所述根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，包括：
    根据设置的节点通信距离均衡规则，使所述通讯网络中除所述源节点之外的所述网络节点接收所述源节点发送的路由请求消息；
    根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行处理，并生成对应的第一跳中继请求消息；
    根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
  4. 根据权利要求3所述的方法，其特征在于，所述根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行处理，并生成对应的第一跳中继请求消息，包括：
    根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述路由请求消息进行解析，并生成对应的第一跳中继请求消息；
    或者，根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析，并在对应的延迟时间到达时生成对应的第一跳中继请求消息；
    或者，根据设置的节点电量均衡规则，使先后接收到所述路由请求消息的所述网 络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，且在对应的延迟时间到达时发送所述第一跳中继请求消息；
    或者，接收到所述路由请求消息的所述网络节点对接收到的所述路由请求消息进行解析并生成对应的第一跳中继请求消息，并根据设置的节点电量均衡规则，使接收到所述路由请求消息的所述网络节点按照各自的剩余电量控制对应的所述第一跳中继请求消息的发送时序。
  5. 根据权利要求4所述的方法，其特征在于，所述节点电量均衡规则包括：
    若先接收到所述路由请求消息的所述网络节点的剩余电量小于后接收到所述路由请求消息的所述网络节点的剩余电量，则使先接收到所述路由请求消息的所述网络节点对应的所述延迟时间大于后接收到所述路由请求消息的所述网络节点对应的所述延迟时间；
    或者，若先接收到所述路由请求消息的所述网络节点的剩余电量大于后接收到所述路由请求消息的所述网络节点的剩余电量，则使先接收到所述路由请求消息的所述网络节点对应的所述延迟时间小于后接收到所述路由请求消息的所述网络节点对应的所述延迟时间；
    或者，使接收到所述路由请求消息且剩余电量多的所述网络节点早于剩余电量少的所述网络节点发送对应的所述第一跳中继请求消息。
  6. 根据权利要求3-5任一项所述的方法，其特征在于，所述根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点，包括：
    根据所述第一跳中继请求消息，确定接收到所述路由请求消息的所述网络节点的路由表项；
    根据所述路由表项，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
  7. 根据权利要求3-6任一项所述的方法，其特征在于，若接收到所述路由请求消息的所述网络节点的路由表项中包括所述路由请求消息的解析时间，则所述根据所述路由表项，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点包括：根据所述路由表项中所述路由请求消息的解析时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点；
    或者，若接收到所述路由请求消息的所述网络节点的路由表项中包括所述第一跳中继请求消息的生成时间，则所述根据所述路由表项，从接收到所述路由请求消息的 所述网络节点中确定出第一跳中继节点包括：根据所述路由表项中所述第一跳中继请求消息的生成时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点；
    或者，若接收到所述路由请求消息的所述网络节点的路由表项中包括所述第一跳中继请求消息的发送时间，则所述根据所述路由表项，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点包括：根据所述路由表项中所述第一跳中继请求消息的发送时间，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点。
  8. 根据权利要求3所述的方法，其特征在于，所述根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点包括：若所述第一跳中继请求消息中包括所述第一跳中继请求消息的发送时间，则接收到所述第一跳中继请求消息的网络节点将产生先接收到的所述第一跳中继请求消息的所述网络节点作为第一跳中继节点。
  9. 根据权利要求3所述的方法，其特征在于，所述根据所述第一跳中继请求消息，从接收到所述路由请求消息的所述网络节点中确定出第一跳中继节点包括：
    若所述第一跳中继请求消息中包括路由更新的次数，则接收所述第一跳中继请求消息的网络节点对先接收到的第一跳中继请求消息进行解析并生成第二跳中继请求消息以及对应的路由表项，所述对应的路由表项中包括所述路由更新的次数；
    接收所述第一跳中继请求消息的网络节点对后接收到的第一跳中继请求消息进行解析；
    若后接收到的第一跳中继请求消息中的所述路由更新的次数与所述第二跳中继请求消息对应的路由表项中的所述路由更新的次数相同，将产生先接收到的所述的第一跳中继请求消息的网络节点作为第一跳中继节点。
  10. 根据权利要求2-9任一项所述的方法，其特征在于，所述根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从所述通讯网络中除所述源节点之外的网络节点中确定出中继节点，还包括：
    根据设置的节点通信距离均衡规则，使所述通讯网络中的所述网络节点接收上一跳中继节点发送的上一跳中继请求消息；
    根据设置的节点电量均衡规则，使接收到上一跳中继请求消息的所述网络节点对所述上一跳中继请求消息进行处理，以生成对应的当前跳中继请求消息；
    根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中 确定出当前跳中继节点。
  11. 根据权利要求10所述的方法，其特征在于，所述根据设置的节点电量均衡规则，使接收到上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行处理，并生成对应的当前跳中继请求消息，包括：
    根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点在对应的延迟时间到达时对接收到的所述上一跳中继请求消息进行解析，并生成对应的当前跳中继请求消息；
    或者，根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析，并在对应的延迟时间到达时生成对应的当前跳中继请求消息；
    或者，根据设置的节点电量均衡规则，使先后接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，且在对应的延迟时间到达时发送所述当前跳中继请求消息；
    或者，接收到所述上一跳中继请求消息的所述网络节点对接收到的所述上一跳中继请求消息进行解析并生成对应的当前跳中继请求消息，并根据设置的节点电量均衡规则，使接收到所述上一跳中继请求消息的所述网络节点按照各自的剩余电量控制对应的所述当前跳中继请求消息的发送时序。
  12. 根据权利要求11所述的方法，其特征在于，所述节点电量均衡规则为：
    若先接收到所述上一跳中继请求消息的所述网络节点的剩余电量小于后接收到所述上一跳中继请求消息的所述网络节点的剩余电量，则使先接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间大于后接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间；
    或，若先接收到所述上一跳中继请求消息的所述网络节点的剩余电量大于后接收到所述上一跳中继请求消息的所述网络节点的剩余电量，则使先接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间小于后接收到所述上一跳中继请求消息的所述网络节点对应的所述延迟时间；
    或，使接收到所述上一跳中继请求消息且剩余电量多的所述网络节点早于剩余电量少的所述网络节点发送对应的所述当前跳中继请求消息。
  13. 根据权利要求10-12任一项所述的方法，其特征在于，所述根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：
    根据所述当前跳中继请求消息，确定接收到上一跳中继请求消息的所述网络节点的路由表项；
    根据所述路由表项，从接收到所述当前跳中继请求消息的所述网络节点中确定出当前跳中继节点。
  14. 根据权利要求10-13任一项所述的方法，其特征在于，若接收到所述上一跳中继请求消息的所述网络节点的路由表项中包括所述上一跳中继请求消息的解析时间，则所述根据所述路由表项，从接收到所述当前跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：根据所述路由表项中对所述上一跳中继请求消息的解析时间，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点；
    或者，若接收到所述上一跳中继请求消息的所述网络节点的路由表项中包括所述当前跳中继请求消息的生成时间；则所述根据所述路由表项，从接收到所述当前跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：根据所述路由表项中所述当前跳中继请求消息的生成时间，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点；
    或者，若接收到所述上一跳中继请求消息的所述网络节点的路由表项中包括所述当前跳中继请求消息的发送时间，则所述根据所述路由表项，从接收到所述当前跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：根据所述路由表项中所述当前跳中继请求消息的发送时间，从接收到所述上一跳中继请求消息的所述网络节点中确定出当前跳中继节点。
  15. 根据权利要求10所述的方法，其特征在于，所述根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：若所述当前跳中继请求消息中包括所述当前跳中继请求消息的发送时间，则接收到所述当前跳中继请求消息的发送时间的网络节点将产生先接收到的所述当前跳中继请求消息的所述网络节点作为当前跳中继节点。
  16. 根据权利要求10所述的方法，其特征在于，所述根据所述当前跳中继请求消息，从接收到上一跳中继请求消息的所述网络节点中确定出当前跳中继节点，包括：
    接收所述当前跳中继请求消息的网络节点对先接收到的当前跳中继请求消息进行解析并生成第二跳中继请求消息以及对应的路由表项，所述对应的路由表项中包括路由更新的次数；
    接收所述当前跳中继请求消息的网络节点对后接收到的当前跳中继请求消息进行解析；
    若后接收到的当前跳中继请求消息中的所述路由更新的次数与所述第二跳中继请求消息对应的路由表项中的所述路由更新的次数相同，则将产生先接收到的所述的当前跳中继请求消息的网络节点作为当前跳中继节点。
  17. 根据权利要求2-16任一项所述的方法，其特征在于，所述根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由之后，还包括：根据设置的所述节点电量均衡规则对已建立的所述路由进行动态维护。
  18. 根据权利要求17所述的方法，其特征在于，所述根据设置的所述节点电量均衡规则对已建立的所述路由进行动态维护，包括：
    实时检测所述路由中已有的所述中继节点的剩余电量；
    当存在剩余电量小于对应的电量阈值的所述中继节点时，所述剩余电量小于所述对应的电量阈值的所述中继节点通知其通信范围内的所述网络节点，以根据所述设置的所述节点电量均衡规则对已建立的所述路由进行动态维护。
  19. 一种路由的建立装置，其特征在于，包括：
    端节点确定模块，用于确定通讯网络中发送目标数据的网络节点为源节点，以及接收所述目标数据的网络节点为目的节点；
    中继节点确定模块，用于至少根据设置的节点通信距离均衡规则以及所述节点电量均衡规则，从通讯网络的网络节点中确定出中继节点，所述中继节点用于对所述源节点发送的所述目标数据进行转发处理以可被所述目的节点接收；
    路由建立模块，用于根据所述源节点、所述目的节点以及确定出的所述中继节点，建立所述源节点向所述目的节点发送所述目标数据的路由。
  20. 一种电子设备，包括：处理器、通信接口、存储器和通信总线，所述处理器、所述通信接口、以及所述存储器通过所述通信总线完成相互间的通信；
    所述存储器用于存放至少一可执行指令，所述可执行指令使所述处理器执行如权利要求1-18任一项所述的方法对应的操作。
  21. 一种计算机存储介质，其上存储有计算机程序，该程序被处理器执行时实现如权利要求1-18中任一所述的方法。
PCT/CN2020/073494 2020-01-21 2020-01-21 路由的建立方法及装置、电子设备以及计算机存储介质 WO2021146911A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202080001505.3A CN111837424A (zh) 2020-01-21 2020-01-21 路由的建立方法及装置、电子设备以及计算机存储介质
PCT/CN2020/073494 WO2021146911A1 (zh) 2020-01-21 2020-01-21 路由的建立方法及装置、电子设备以及计算机存储介质

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/073494 WO2021146911A1 (zh) 2020-01-21 2020-01-21 路由的建立方法及装置、电子设备以及计算机存储介质

Publications (1)

Publication Number Publication Date
WO2021146911A1 true WO2021146911A1 (zh) 2021-07-29

Family

ID=72918764

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/073494 WO2021146911A1 (zh) 2020-01-21 2020-01-21 路由的建立方法及装置、电子设备以及计算机存储介质

Country Status (2)

Country Link
CN (1) CN111837424A (zh)
WO (1) WO2021146911A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113596797B (zh) * 2021-07-28 2024-01-12 深圳创维－Rgb电子有限公司 设备查找装置、设备查找方法、显示装置及存储介质
CN113595910B (zh) * 2021-07-30 2022-11-25 歌尔科技有限公司 一种组网系统，通信方法、设备及可读存储介质
CN113905349A (zh) * 2021-09-29 2022-01-07 中国铁道科学研究院集团有限公司 组网方法、装置及系统
CN114884562B (zh) * 2022-05-05 2023-08-11 武昌理工学院 一种基于跳转处理的延迟信号处理方法
CN115988037B (zh) * 2023-02-17 2023-05-30 中汽研汽车工业工程(天津)有限公司 一种汽车工业装备数据采集和处理方法、系统及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101489293A (zh) * 2009-02-27 2009-07-22 重庆邮电大学 基于能耗均衡策略的无线传感器网络路由调度方法
CN104284402A (zh) * 2013-07-09 2015-01-14 鸿富锦精密工业（深圳）有限公司 无线传感器网络的电量调度方法及控制装置
CN105515994A (zh) * 2015-11-30 2016-04-20 华为技术有限公司 一种路由选择方法及装置
CN109699060A (zh) * 2018-12-17 2019-04-30 江汉大学 一种无线传感器网络的通讯方法及装置
US20190174390A1 (en) * 2017-05-25 2019-06-06 King Fahd University Of Petroleum And Minerals Sensor node for selecting and transmitting a data packet to a relay node

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741685A (zh) * 2008-11-14 2010-06-16 华为技术有限公司 一种路由查找方法和路由装置
CN101577956B (zh) * 2009-06-15 2012-10-10 北京邮电大学 协作中继节点选择方法及系统
CN103354654B (zh) * 2013-07-24 2016-09-28 桂林电子科技大学 基于蚁群算法的高能效无线传感器网络路由方法
US9838943B2 (en) * 2015-11-24 2017-12-05 King Fahd University Of Petroleum And Minerals Method of routing for wireless ad hoc and sensor networks

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101489293A (zh) * 2009-02-27 2009-07-22 重庆邮电大学 基于能耗均衡策略的无线传感器网络路由调度方法
CN104284402A (zh) * 2013-07-09 2015-01-14 鸿富锦精密工业（深圳）有限公司 无线传感器网络的电量调度方法及控制装置
CN105515994A (zh) * 2015-11-30 2016-04-20 华为技术有限公司 一种路由选择方法及装置
US20190174390A1 (en) * 2017-05-25 2019-06-06 King Fahd University Of Petroleum And Minerals Sensor node for selecting and transmitting a data packet to a relay node
CN109699060A (zh) * 2018-12-17 2019-04-30 江汉大学 一种无线传感器网络的通讯方法及装置

Also Published As

Publication number Publication date
CN111837424A (zh) 2020-10-27

Similar Documents

Publication Publication Date Title
WO2021146911A1 (zh) 路由的建立方法及装置、电子设备以及计算机存储介质
TWI602457B (zh) 節點網路、電池供電之節點及管理電池供電之節點的方法
US10445287B2 (en) Circuit switch pre-reservation in an on-chip network
US9477280B1 (en) Specification for automatic power management of network-on-chip and system-on-chip
JP6593801B2 (ja) バッテリー駆動式ノード（ｂｐｎ）を管理するためのコンピューター実施方法
US11089533B2 (en) Method and apparatus for connecting to a node of a mesh network
US9811374B1 (en) Partial resume for operating system modules
CN107960151B (zh) 无线通信系统中的响应装置和请求装置及其实现方法
WO2019184455A1 (zh) 信息传输方法、装置、设备及存储介质
US20110087943A1 (en) Reliable communications in on-chip networks
US8107451B2 (en) Efficient deallocation of network resources based on network node location extrapolation
US9722949B2 (en) Reducing power utilization by transferring communication sessions from a main processor
CN104954148A (zh) 节点设备的控制方法、装置及路由器
WO2020147081A1 (zh) 一种数据传输方法、相关设备及计算机存储介质
JP6590402B2 (ja) 無線ノード
US20160099997A1 (en) Method and system for managing application data in a communication device
Zheng Design, analysis and empirical evaluation of power management in multi-hop wireless networks
Kimura et al. Design of energy‐efficient intermittently connected sensor networks
CN117241347A (zh) 一种睡眠调度方法、装置、节点设备及存储介质
TW201540078A (zh) 光纖網路元件及操作光纖網路元件的方法
CN103763752A (zh) Ad hoc网络路由的信标报文发送方法和系统
JP2010258551A (ja) 無線通信装置及び管理装置
JP2015033139A (ja) 光加入者網で同期化されたスリープ周期を用いる電力節減方法
JP2012114955A (ja) 情報通信装置、及び情報通信システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20915238

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20915238

Country of ref document: EP

Kind code of ref document: A1