WO2021103272A1 - 确定多跳网络节点生存时间值的方法及装置 - Google Patents

确定多跳网络节点生存时间值的方法及装置 Download PDF

Info

Publication number
WO2021103272A1
WO2021103272A1 PCT/CN2019/130474 CN2019130474W WO2021103272A1 WO 2021103272 A1 WO2021103272 A1 WO 2021103272A1 CN 2019130474 W CN2019130474 W CN 2019130474W WO 2021103272 A1 WO2021103272 A1 WO 2021103272A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
relay
value
determining
time
Prior art date
Application number
PCT/CN2019/130474
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 美的集团股份有限公司
Publication of WO2021103272A1 publication Critical patent/WO2021103272A1/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/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • This application relates to the field of wireless communication, and in particular to a method and device for determining the survival time value of a multi-hop network node.
  • Multi-hop networks are constructed by nodes, including devices such as computers and mobile phones, all of which are wirelessly connected to each other, and then each other can forward data through the network. Data jumps from one node to another until it reaches the destination. Unless all nodes fail, data is always available, which makes this network topology reliable and scalable.
  • the multi-hop network consists of nodes forming a backbone network and is connected to the Internet, and is responsible for providing multi-hop network connections for clients.
  • Multi-hop networks are based on mutual cooperation and coordination among many nodes distributed in a mesh pattern. They have the advantages of broadband high speed and high spectrum efficiency, and have outstanding features such as dynamic self-organization, self-configuration, and self-maintenance.
  • Time To Live (Time To Live), referred to as TTL, is configured as a representation of the number of hops in a multi-hop network. Its function is to limit the time that the data packet exists in the computer network.
  • TTL Time To Live
  • All data packets in a multi-hop network include a TTL field, which is configured to limit the number of hops that the data packet can be relayed and forwarded.
  • the method for determining the TTL value of a node in the existing multi-hop network is based on experience. After the TTL value is determined, the node will fix the TTL value during the product life cycle. Therefore, such multi-hop network nodes cannot adapt to a wider network radiation range, or redundant repeated transmissions are prone to occur within the compact multi-hop network range.
  • this application aims to solve at least one of the technical problems existing in the prior art. For this reason, this application proposes a method for determining the time-to-live value of a multi-hop network node, which can determine the time-to-live value that the node should set each time a data packet is sent to ensure that the data packet is transmitted to other nodes in the network without generating redundant Invalid repeated transmission.
  • This application also provides a device for determining the lifetime value of a multi-hop network node.
  • the target node sends a data packet requesting the node state to the node in the multi-hop network according to the first time-to-live value, and obtains the node state fed back by the node, and determines the relay times list according to the node state;
  • the target node is a node in a multi-hop network
  • the first time-to-live value is a preset limited time-to-live value
  • the node sends a data packet requesting the node status to other nodes with a preset limited lifetime value, and determines the list of relay times according to the node status, and then according to the middle The list of subsequent times determines the number of relay times as the lifetime value of the target node to ensure that data packets are transmitted to other nodes in the network without redundant and invalid repeated transmissions.
  • the determining the survival time value of the target node according to the list of relay times includes:
  • the determining the number of candidate relays corresponding to each node of the feedback node status according to the list of the number of relay times includes:
  • the determining the number of candidate relays corresponding to each node of the feedback node status according to the list of the number of relay times includes:
  • the second time-to-live value is one of the relay times corresponding to the node.
  • the determining the number of candidate relays corresponding to each node of the feedback node status according to the list of the number of relay times includes:
  • the second time-to-live value is the maximum number of relay times among the number of relay times corresponding to the node, and the node status fed back by the node is not received, and the number of candidate relay times for configuring the node is empty.
  • the determining the number of candidate relays corresponding to each node of the feedback node status according to the list of the number of relay times includes:
  • a processing module configured to send a data packet requesting a node state to a node in the multi-hop network according to the first time-to-live value, and obtain the node state fed back by the node, and determine a list of relay times according to the node state;
  • the determining module is configured to determine the survival time value of the target node according to the list of relay times;
  • the target node to which the processing module and the determining module belong is a node in a multi-hop network
  • the first time-to-live value is a preset limited time-to-live value
  • the device for determining the lifetime value of a multi-hop network node provided by the embodiment of the present application sends a data packet requesting the node status to other nodes with a preset limited lifetime value through the node, and determines the list of relay times according to the node status, and then according to the middle The list of subsequent times determines the number of relay times as the lifetime value of the target node to ensure that data packets are transmitted to other nodes in the network without redundant and invalid repeated transmissions.
  • the determining module includes a selecting unit and a determining unit, wherein:
  • the selecting unit is configured to determine, according to the list of times of relay times, the number of times to be selected for each node that feedbacks the state of the node;
  • the determining unit is configured to configure the maximum value of the number of relays to be selected corresponding to each node as the survival time value of the target node.
  • selecting unit is specifically configured as:
  • selecting unit is specifically configured as:
  • the second time-to-live value is one of the relay times corresponding to the node.
  • selecting unit is specifically configured as:
  • the second time-to-live value is the maximum number of relay times among the number of relay times corresponding to the node, and the node status fed back by the node is not received, and the number of candidate relay times for configuring the node is empty.
  • selecting unit is specifically configured as:
  • a router includes the above-mentioned device for determining the lifetime value of a multi-hop network node.
  • An electronic device includes a memory, a processor, and a computer program that is stored in the memory and can run on the processor, and the processor executes the program to realize multi-hop determination as described above.
  • the steps of the method for the network node time-to-live value.
  • a non-transitory computer-readable storage medium having a computer program stored thereon is characterized in that, when the computer program is executed by a processor, the determination of the survival time value of a multi-hop network node as described above is achieved Steps of the method.
  • FIG. 1 is a schematic flowchart of a method for determining a time-to-live value of a multi-hop network node provided by an embodiment of the present application;
  • FIG. 2 is a schematic flowchart of a method for determining the survival time value of a multi-hop network node provided by an embodiment of the present application
  • FIG. 3 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method for determining the survival time value of a multi-hop network node provided by an embodiment of the present application;
  • FIG. 4 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method for determining the survival time value of a multi-hop network node provided by an embodiment of the present application;
  • FIG. 5 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method for determining the survival time value of a multi-hop network node provided by an embodiment of the present application;
  • FIG. 6 is a schematic diagram of the execution flow of the method for determining the time-to-live value of a time-to-live network node provided by an embodiment of the present application;
  • FIG. 7 is a schematic structural diagram of an apparatus for determining the survival time value of a multi-hop network node provided by an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • connection and “connected” should be understood in a broad sense, for example, it may be a fixed connection or a detachable connection. Or integrally connected; it can be mechanically connected or electrically connected; it can be directly connected or indirectly connected through an intermediate medium.
  • connection should be understood in a broad sense, for example, it may be a fixed connection or a detachable connection. Or integrally connected; it can be mechanically connected or electrically connected; it can be directly connected or indirectly connected through an intermediate medium.
  • the specific meanings of the above-mentioned terms in the embodiments of the present application can be understood under specific circumstances.
  • the first feature “on” or “under” the second feature may be in direct contact with the first and second features, or the first and second features may pass through the middle. Indirect media contact.
  • the "above”, “above”, and “above” of the first feature on the second feature may mean that the first feature is directly above or obliquely above the second feature, or it simply means that the level of the first feature is higher than the second feature.
  • the “below”, “below” and “below” of the second feature of the first feature may mean that the first feature is directly below or obliquely below the second feature, or it simply means that the level of the first feature is smaller than the second feature.
  • Fig. 1 shows a schematic flowchart of a method for determining the survival time value of a multi-hop network node according to an embodiment of the present application. As can be seen from Fig. 1, the method includes:
  • the target node sends a data packet requesting the node state to the node in the multi-hop network according to the first time-to-live value, and obtains the node state fed back by the node, and determines the list of relay times according to the node state;
  • S12 Determine the survival time value of the target node according to the list of relay times
  • the target node is a node in a multi-hop network
  • the first time-to-live value is a preset limited time-to-live value
  • the multi-hop network is constructed by nodes, including devices such as computers and mobile phones. These devices are all connected to each other wirelessly, and then can connect to each other. Forward data through the network. Data jumps from one node to another until it reaches the destination. Unless all nodes fail, data is always available, which makes this network topology reliable and scalable.
  • the multi-hop network consists of nodes forming a backbone network and is connected to the Internet, and is responsible for providing multi-hop network connections for clients.
  • Multi-hop networks are based on mutual cooperation and coordination among many nodes distributed in a mesh pattern. They have the advantages of broadband high speed and high spectrum efficiency, and have outstanding features such as dynamic self-organization, self-configuration, and self-maintenance.
  • Time To Live (Time To Live), referred to as TTL, is configured as a representation of the number of hops in a multi-hop network. Its function is to limit the time that the data packet exists in the computer network.
  • Multi-hop networks include wireless mesh networks (Mesh networks), mobile AdHoc networks (also known as ad hoc networks), wireless sensor networks, and wireless relay networks, which are not listed here.
  • a multi-hop network In a multi-hop network, the lifetime of data packets in the network is controlled by setting the TTL value at each node. All data packets in a multi-hop network include a TTL field, which is configured to limit the number of times a data packet is relayed and forwarded. When each data packet is sent, a node as the message source will be set according to the preset TTL value of the sent data packet to form the initial TTL value on the TTL field of the data packet.
  • the method for determining the TTL value of a node in the existing multi-hop network is based on experience. After the TTL value is determined, the node will fix the TTL value during the product life cycle. Therefore, such multi-hop network nodes cannot adapt to a wider network radiation range, or redundant repeated transmissions are prone to occur within the compact multi-hop network range. Therefore, the method of determining the TTL value of a node needs to be changed.
  • the method of the embodiment of the present application is used to determine the TTL value of the node, so that the multi-hop network node can adapt to a wider multi-hop network radiation range, or redundant repeated transmission is not easy to occur in the compact multi-hop network range.
  • the TTL value determination process is performed on the nodes in the multi-hop network respectively, and the determination process performed on each node is implemented by the method of the embodiment of the present application. Which node in the multi-hop network performs the TTL value determination process, this node is used as the target node in the method in the embodiment of the present application.
  • the path requesting the node status received by the node for the first time in the network is the shortest path.
  • the target node will send a data packet requesting the node status to other nodes in the multi-hop network according to the preset limit survival time value, and obtain the node status fed back by the node, and determine the list of relay times according to the node status.
  • the preset limited time-to-live value is the maximum TTL value specified in the standard protocol corresponding to the multi-hop network. After receiving a data packet requesting node status from the target node, any node in the network except the target node will subtract the remaining TTL value of the data packet from the maximum TTL value to obtain the number of relays in the request node status path transfer , And add the number of relays to the node status and feed it back to the target node.
  • the target node can determine the list of relay times according to the node.
  • the list of relay times includes node identifiers that feed back the status of the node, and the respective corresponding relay times.
  • the number of relay times corresponding to each node is at least one value.
  • the target node determines one of the relay times as the target node survival time value according to the obtained relay times list.
  • the node sends a data packet requesting the node status to other nodes with a preset limited lifetime value, and determines the list of relay times according to the node status, and then according to the middle The list of subsequent times determines the number of relay times as the lifetime value of the target node to ensure that data packets are transmitted to other nodes in the network without redundant and invalid repeated transmissions.
  • Fig. 2 shows a schematic flow chart of a method for determining the survival time value of a multi-hop network node according to an embodiment of the present application. As can be seen from Fig. 2, the method includes:
  • the target node sends a data packet requesting the node status to the node in the multi-hop network according to the first time-to-live value, and obtains the node status fed back by the node, and determines the list of relay times according to the node status;
  • S22 Determine, according to the list of times of relay times, the number of times to be selected for each node that feedbacks the status of the node;
  • the target node is a node in a multi-hop network
  • the first time-to-live value is a preset limited time-to-live value
  • the number of relays to be selected is a relay selected from the number of relays corresponding to the node frequency.
  • step S21 it should be noted that this step is the same as step S11 in the foregoing embodiment in principle, and will not be repeated here.
  • the target node analyzes the obtained relay times list, so as to determine the candidate relay belonging to each node from the relay times corresponding to each node frequency.
  • the number of relays to be selected is configured as the number of relays for further determining the survival time value of the target node. That is to say, the target node needs to select one of the number of relay times to be selected from the number of relay times corresponding to each node as the target node survival time value.
  • the maximum value of the number of candidate relays corresponding to each node is configured as the target node survival time value. If there are several nodes corresponding to the same number of to-be-selected relays, and they are all at the maximum value, the maximum value is directly configured as the target node survival time value.
  • step S22 is explained. It is determined according to the relay frequency list that the number of relay times corresponding to any node of the feedback node status is at least two, and the number of occurrences of each relay frequency is counted. , And determine that the number of occurrences of the minimum number of relays is not the minimum, and configure the minimum number of relays as the number of to-be-selected relays.
  • the target node receives 5 node states fed back by a certain node, and the corresponding relay times can be parsed in each node state. At this time, the number of occurrences of each relay frequency can be counted.
  • the number of relays is 1, and there are 2 occurrences.
  • the number of relays is 2, and it occurs once.
  • the number of relays is 3, and there are 2 occurrences.
  • the minimum number of relays is 1 as the number of candidate relays corresponding to the node.
  • step S22 is explained. It is determined according to the relay frequency list that the number of relay times corresponding to any node of the feedback node status is at least two, and the number of occurrences of each relay frequency is counted. ;
  • the second survival time value is one of the relay times corresponding to the node.
  • the target node needs to send a data packet requesting the node status to the node again, and determine the number of relays to be selected for the node based on whether the node status fed back by the node is received.
  • the time-to-live value according to which the target node sends the data packet requesting the node status to the node again as the "second time-to-live value”.
  • the smallest number of relay times among the number of relay times corresponding to the node is used as the first second time-to-live value, and a data packet requesting the node status is sent to the node.
  • the minimum number of relays is configured as the number of relays to be selected.
  • a new second survival time value is determined according to the minimum number of relays and a preset interval strategy (such as the value plus 1), and a second request is sent to the node according to the second survival time value Data packet of node status.
  • the increment of the number of relays is used as the second time-to-live value, and according to the second time-to-live value, a data packet that requests the node status again is sent to the node. As long as it is determined that the node status fed back by the node is received, the current middle is configured.
  • the number of successions is regarded as the number of relays to be selected for the node.
  • the second time-to-live value is the maximum number of relay times among the number of relay times corresponding to the node, and the node status fed back by the node is not received, it indicates that the node status previously fed back by the node is invalid and the reason for the invalidity It can include that the node is currently in failure, offline, etc.
  • the number of relays to be selected for the configurable node is empty. If the number of relays to be selected is empty, it will not affect the determination of the TTL value of the target node.
  • the target node receives 5 node states fed back by a certain node, and the corresponding relay times can be parsed in each node state. At this time, the number of occurrences of each relay frequency can be counted.
  • the number of relays is 2, and there are 2 occurrences.
  • the number of relays is 3, and there are 3 occurrences.
  • the target node needs to re-send the request to the node according to the above method.
  • the number of relay times is 2 as the time-to-live value
  • a data packet requesting the node status is sent to the node, and the node feedbacks the node status.
  • the number of relay times 2 is used as the number of candidate relays for the node.
  • step S22 is explained. It is determined that there is one number of relay times corresponding to any node that feedbacks the node status according to the list of times of relay times, and the number of existing relay times is configured as a candidate relay. frequency.
  • the node has fed back the node status to the target node many times. After analyzing the node status, it is determined that the number of relay times carried by all node statuses is the same. At this time, the only number of relay times that exists The number of relays to be selected as the node.
  • the target node receives 5 node states fed back by a certain node, and the corresponding relay times can be parsed in each node state. At this time, the number of occurrences of each relay frequency can be counted.
  • the number of relays is 2, and there are 5 occurrences.
  • the target node uses the number of relay times 2 as the number of candidate relays for the node.
  • FIG. 3 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method of this embodiment.
  • Node 1 uses the maximum TTL value to publish data packets requesting node status to other nodes in the network.
  • online nodes 2, 3, 4, 7, 9, and 13 all receive the data packets and count the number of relay responses.
  • the number of relays to be selected for nodes 2, 3, and 4 is 1, the number of relays to be selected for nodes 7, 9 is 2, and the number of relays to be selected for node 13 is 3.
  • the maximum number of relays is 3. So set the TTL value of the selected node to 3.
  • FIG. 4 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method of this embodiment.
  • select node 1 as the target node.
  • Node 1 uses the maximum TTL value to publish data packets requesting node status to other nodes in the network.
  • all online nodes 2-16 receive the data packets and count the number of relays to reply.
  • node 1 After node 1 receives the reply message, it determines that the number of candidate relays of node 13 is 3.
  • FIG. 5 is a schematic diagram of the process of determining the survival time value between multi-hop network nodes in the method of this embodiment.
  • Node 1 uses the maximum TTL value to publish data packets requesting node status to other nodes in the network.
  • all online nodes 2-16 receive the data packets and count the number of relays to reply.
  • the message with a minimum number of relays of 3 replies from the node 13 is only one time, and a message with a number of relays of 6 appears 4 times in total.
  • the node 13 is offline.
  • the node 2 If the node 2 does not receive the reply message within the specified time, it increments the TTL, and releases the data packet requesting the node status to the node 13 again.
  • Node 1 confirms that node 13 is offline, and the data in the previous reply message is invalid.
  • FIG. 6 is a schematic diagram of the execution flow of the method of the embodiment. Since the entire flow is explained in detail above, it can be clearly understood with reference to FIG. 6, and FIG. 6 is not described in detail here.
  • the node sends a data packet requesting the node status to other nodes with a preset limited lifetime value, and determines the list of relay times according to the node status, and then according to the middle
  • the list of subsequent times determines the number of candidate relay times corresponding to each node, and configures the maximum value of the number of candidate relay times corresponding to each node as the lifetime value of the target node to ensure that data packets are transmitted to other nodes in the network without unnecessary invalidity. Repeated transmission.
  • Fig. 7 shows a device for determining the lifetime value of a multi-hop network node provided by an embodiment of the present application, including a processing module 31 and a determining module 32, wherein:
  • the processing module 31 is configured to send a data packet requesting a node status to a node in the multi-hop network according to the first time-to-live value, and obtain the node status fed back by the node, and determine a list of relay times according to the node status;
  • the determining module 32 is configured to determine the survival time value of the target node according to the list of relay times;
  • the target node to which the processing module and the determining module belong is a node in a multi-hop network
  • the first time-to-live value is a preset limited time-to-live value
  • a hardware processor (hardware processor) may be used to implement related functional modules.
  • the device for determining the lifetime value of a multi-hop network node provided by the embodiment of the present application sends a data packet requesting the node status to other nodes with a preset limited lifetime value through the node, and determines the list of relay times according to the node status, and then according to the middle The list of subsequent times determines the number of relay times as the lifetime value of the target node to ensure that data packets are transmitted to other nodes in the network without redundant and invalid repeated transmissions.
  • the determining module is specifically configured to:
  • the determining module includes a selecting unit and a determining unit, wherein:
  • the selecting unit is configured to determine, according to the list of times of relay times, the number of times to be selected for each node that feedbacks the state of the node;
  • the determining unit is configured to configure the maximum value of the number of relays to be selected corresponding to each node as the survival time value of the target node.
  • the selecting unit is specifically configured as:
  • the selecting unit is specifically configured as:
  • the second time-to-live value is one of the relay times corresponding to the node.
  • the selecting unit is specifically configured as:
  • the second time-to-live value is the maximum number of relay times among the number of relay times corresponding to the node, and the node status fed back by the node is not received, and the number of candidate relay times for configuring the node is empty.
  • the selection unit is specifically configured as:
  • An embodiment of the present application also provides a router, which includes the device for determining the lifetime value of a multi-hop network node provided in the foregoing embodiment.
  • FIG. 8 illustrates a schematic diagram of the physical structure of an electronic device.
  • the electronic device may include: a processor 41, a communication interface 42, a memory 43, and a communication bus 44, Among them, the processor 41, the communication interface 42, and the memory 43 communicate with each other through the communication bus 44.
  • the processor 41 can call the logic instructions in the memory 43 to execute the following method: send a data packet requesting the node state to the node in the multi-hop network according to the first time-to-live value, and obtain the node state fed back by the node, according to the node state Determining a list of the number of relay times; determining a target node survival time value according to the list of relay times, the target node is a node in a multi-hop network, and the first survival time value is a preset limited survival time value.
  • the above-mentioned logical instructions in the memory 43 can be implemented in the form of a software functional unit and when sold or used as an independent product, they can be stored in a computer readable storage medium.
  • the technical solution of this application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program code .
  • the embodiments of the present application disclose a computer program product
  • the computer program product includes a computer program stored on a non-transitory computer-readable storage medium
  • the computer program includes program instructions, when the program instructions are executed by a computer
  • the computer can execute the methods provided in the above-mentioned method embodiments, for example, including: sending a data packet requesting the node status to the node in the multi-hop network according to the first time-to-live value, and obtaining the node status fed back by the node, according to the The node status determines a list of the number of times of relay; the target node survival time value is determined according to the list of the number of relay times, the target node is a node in a multi-hop network, and the first survival time value is a preset limit survival time value.
  • the embodiments of the present application also provide a non-transitory computer-readable storage medium on which a computer program is stored.
  • the computer program is executed by a processor, the computer program is implemented to perform the transmission methods provided in the foregoing embodiments, for example, including : Send a data packet requesting the node status to the node in the multi-hop network according to the first time-to-live value, and obtain the node status fed back by the node, and determine the relay times list according to the node status; determine the target node according to the relay times list
  • the survival time value, the target node is a node in a multi-hop network, and the first survival time value is a preset limited survival time value.
  • the device embodiments described above are merely illustrative, where the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in One place, or it can be distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the objectives of the solutions of the embodiments. Those of ordinary skill in the art can understand and implement it without creative work.
  • each implementation manner can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware.
  • the above technical solutions can be embodied in the form of software products, which can be stored in computer-readable storage media, such as ROM/RAM, magnetic A disc, an optical disc, etc., include several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute the methods described in each embodiment or some parts of the embodiment.

Landscapes

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

Abstract

本申请涉及无线通讯领域，提供一种确定多跳网络节点生存时间值的方法及装置，方法包括：目标节点根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；根据所述中继次数清单确定所述目标节点生存时间值。本申请提供的确定多跳网络节点生存时间值的方法及装置，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定中继次数作为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。

Description

确定多跳网络节点生存时间值的方法及装置
交叉引用
本申请引用于2019年11月27日提交的专利名称为“确定多跳网络节点生存时间值的方法及装置”的第2019111857444号中国专利申请，其通过引用被全部并入本申请。
技术领域
本申请涉及无线通讯领域，尤其涉及确定多跳网络节点生存时间值的方法及装置。
背景技术
多跳网络是由节点构造的，包括诸如电脑和移动电话这些设备，这些设备全都用无线连接到彼此，然后互相可以通过网络转发数据。数据从一个节点跳到另一个节点，直到抵达目的地。除非所有的节点都发生故障，否则数据总是可用的，如此使得这种网络拓扑结构可靠且可扩展。
多跳网络由节点构成骨干网络，并和互联网相连接，负责为客户端提供多跳的网络连接。多跳网络基于呈网状分布的众多节点间的相互合作和协同，具有宽带高速和高频谱效率的优势，具有动态自组织、自配置、自维护等突出特点。
生存时间(Time To Live)，简称TTL，该TTL值被配置为多跳网络中跳数的表征。其作用是限制数据包在计算机网络中的存在的时间。在多跳网络中，通过在每个节点设定TTL值来控制数据包在网络中的生存期。所有多跳网络中的数据包均包括TTL字段，其被配置为限制限制数据包中继转发的跳数。每个数据包发出时，都会有作为消息源的节点根据预设的发送数据包的TTL值进行设定形成数据包TTL字段上的初始TTL值。
现有多跳网络中确定节点TTL值的方式是根据经验确定，TTL值确定后，该节点在产品生命周期内将固定该TTL值。因此，这类多跳网络节点无法适应更广的网络辐射范围，或者在紧凑的多跳网络范围内容易出现多余的反复传输。
发明内容
本申请旨在至少解决现有技术中存在的技术问题之一。为此，本申请提出一种确定多跳网络节点生存时间值的方法，其能够确定该节点每次发送数据包应该设置的生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
本申请还提供一种确定多跳网络节点生存时间值的装置。
根据本申请第一方面实施例的确定多跳网络节点生存时间值的方法，包括：
目标节点根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
根据所述中继次数清单确定所述目标节点生存时间值；
其中，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
本申请实施例提供的确定多跳网络节点生存时间值的方法，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定中继次数作为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
本申请实施例提供的确定多跳网络节点生存时间值的方法，还具有以下附加技术特征：
进一步地，所述根据所述中继次数清单确定所述目标节点生存时间值，包括：
根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值。
进一步地，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次 数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
进一步地，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数为最小值，根据第二生存时间值向所述节点发送请求节点状态的数据包；
确定接收到所述节点反馈的节点状态，配置第二生存时间值为待选中继次数；
确定未接收到所述节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向所述节点发送再次请求节点状态的数据包；
其中，所述第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
进一步地，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
确定所述第二生存时间值为所述节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，配置所述节点的待选中继次数为空。
进一步地，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
根据本申请第二方面实施例的确定多跳网络节点生存时间值的装置，包括：
处理模块，被配置为根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
确定模块，被配置为根据所述中继次数清单确定目标节点生存时间值；
其中，所述处理模块和所述确定模块所属目标节点，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
本申请实施例提供的确定多跳网络节点生存时间值的装置，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定中继次数作为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
本申请实施例提供的确定多跳网络节点生存时间值的装置，还具有以下附加技术特征：
进一步地，所述确定模块包括选取单元和确定单元，其中：
选取单元，被配置为根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
确定单元，被配置为使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值。
进一步地，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
进一步地，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数为最小值，根据第二生存时间值向所述节点发送请求节点状态的数据包；
确定接收到所述节点反馈的节点状态，配置第二生存时间值为待选中继次数；
确定未接收到所述节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向所述节点发送再次请求节点状态的数据包；
其中，所述第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
进一步地，所述选取单元具体被配置为：
确定所述第二生存时间值为所述节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，配置所述节点的待选中继次数为空。
进一步地，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
根据本申请第三方面实施例的一种路由器，包括上述的确定多跳网络节点生存时间值的装置。
根据本申请第四方面实施例的一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现如上述确定多跳网络节点生存时间值的方法的步骤。
根据本申请第五方面实施例的一种非暂态计算机可读存储介质，其上存储有计算机程序，其特征在于，该计算机程序被处理器执行时实现如上述确定多跳网络节点生存时间值的方法的步骤。
本申请的附加方面和优点将在下面的描述中部分给出，部分将从下面的描述中变得明显，或通过本申请的实践了解到。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1是本申请实施例提供的确定多跳网络节点生存时间值的方法的流程示意图；
图2是本申请实施例提供的确定多跳网络节点生存时间值的方法的流程示意图；
图3是本申请实施例提供的确定多跳网络节点生存时间值的方法在多 跳网络节点间生存时间值确定过程示意图；
图4是本申请实施例提供的确定多跳网络节点生存时间值的方法在多跳网络节点间生存时间值确定过程示意图；
图5是本申请实施例提供的确定多跳网络节点生存时间值的方法在多跳网络节点间生存时间值确定过程示意图；
图6是本申请实施例提供的确定生存时间网络节点生存时间值的方法的执行流程示意图；
图7本申请实施例提供的确定多跳网络节点生存时间值的装置的结构示意图；
图8本申请实施例提供的电子设备的结构示意图。
具体实施方式
下面结合附图和实施例对本申请的实施方式作进一步详细描述。以下实施例用于说明本申请，但不能用来限制本申请的范围。
在本申请实施例的描述中，需要说明的是，术语“中心”、“纵向”、“横向”、“上”、“下”、“前”、“后”、“左”、“右”、“竖直”、“水平”、“顶”、“底”、“内”、“外”等指示的方位或位置关系为基于附图所示的方位或位置关系，仅是为了便于描述本申请实施例和简化描述，而不是指示或暗示所指的装置或元件必须具有特定的方位、以特定的方位构造和操作，因此不能理解为对本申请实施例的限制。此外，术语“第一”、“第二”、“第三”仅用于描述目的，而不能理解为指示或暗示相对重要性。
在本申请实施例的描述中，需要说明的是，除非另有明确的规定和限定，术语“相连”、“连接”应做广义理解，例如，可以是固定连接，也可以是可拆卸连接，或一体连接；可以是机械连接，也可以是电连接；可以是直接相连，也可以通过中间媒介间接相连。对于本领域的普通技术人员而言，可以具体情况理解上述术语在本申请实施例中的具体含义。
在本申请实施例中，除非另有明确的规定和限定，第一特征在第二特征“上”或“下”可以是第一和第二特征直接接触，或第一和第二特征通过中间媒介间接接触。而且，第一特征在第二特征“之上”、“上方”和“上面”可是第一特征在第二特征正上方或斜上方，或仅仅表示第一特征 水平高度高于第二特征。第一特征在第二特征“之下”、“下方”和“下面”可以是第一特征在第二特征正下方或斜下方，或仅仅表示第一特征水平高度小于第二特征。
在本说明书的描述中，参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本申请实施例的至少一个实施例或示例中。在本说明书中，对上述术语的示意性表述不必须针对的是相同的实施例或示例。而且，描述的具体特征、结构、材料或者特点可以在任一个或多个实施例或示例中以合适的方式结合。此外，在不相互矛盾的情况下，本领域的技术人员可以将本说明书中描述的不同实施例或示例以及不同实施例或示例的特征进行结合和组合。
图1示出了本申请一实施例提供的一种确定多跳网络节点生存时间值的方法的流程示意图，从图1中可以看出，该方法包括：
S11、目标节点根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
S12、根据所述中继次数清单确定所述目标节点生存时间值；
其中，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
针对上述步骤S11和步骤S12，需要说明的是，在本申请实施例中，多跳网络是由节点构造的，包括诸如电脑和移动电话这些设备，这些设备全都用无线连接到彼此，然后互相可以通过网络转发数据。数据从一个节点跳到另一个节点，直到抵达目的地。除非所有的节点都发生故障，否则数据总是可用的，如此使得这种网络拓扑结构可靠且可扩展。
多跳网络由节点构成骨干网络，并和互联网相连接，负责为客户端提供多跳的网络连接。多跳网络基于呈网状分布的众多节点间的相互合作和协同，具有宽带高速和高频谱效率的优势，具有动态自组织、自配置、自维护等突出特点。
生存时间(Time To Live)，简称TTL，该TTL值被配置为多跳网络中跳数的表征。其作用是限制数据包在计算机网络中的存在的时间。
多跳网络包括无线网格网络(Mesh网络)、移动AdHoc网络(又称自组织网)、无线传感器网络和无线中继网络，在此不一一举出。
在多跳网络中，通过在每个节点设定TTL值来控制数据包在网络中的生存期。所有多跳网络中的数据包均包括TTL字段，其被配置为限制限制数据包中继转发的次数。每个数据包发出时，都会有作为消息源的节点根据预设的发送数据包的TTL值进行设定形成数据包TTL字段上的初始TTL值。
现有多跳网络中确定节点TTL值的方式是根据经验确定，TTL值确定后，该节点在产品生命周期内将固定该TTL值。因此，这类多跳网络节点无法适应更广的网络辐射范围，或者在紧凑的多跳网络范围内容易出现多余的反复传输。因此需要对确定节点TTL值的方式进行改变。
本申请实施例的方法用于对节点TTL值的确定，使多跳网络节点能够适应更广的多跳网络辐射范围，或者在紧凑的多跳网络范围内不易出现多余的反复传输。
在整个多跳网络中存在多个节点，需确定每个节点对应的节点TTL值。因此，对多跳网络中的节点分别进行TTL值确定过程，对每个节点进行的确定过程均采用本申请实施例的方法所实现。多跳网络中哪个节点执行TTL值确定过程，该节点便作为本申请实施例方法中的目标节点。
在本申请实施例中，根据多跳网络特性，网络中节点第一次接收到的请求节点状态的路径是最短路径。目标节点会根据预设限制生存时间值向多跳网络中其他节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据节点状态确定中继次数清单。
对此需要说明的是，预设限制生存时间值为多跳网络对应标准协议中规定的最大TTL值。网络中除目标节点的其他任一节点在接收到目标节点发送请求节点状态的数据包后，会用最大TTL值减去该数据包的剩余TTL值，得到请求节点状态路径传递中的中继次数，并将中继次数加在节点状态中反馈给目标节点。
当网络中除目标节点的所有接收到请求节点节点状态数据包的节点反馈节点状态后，目标节点根据节点可确定中继次数清单。该中继次数清单中包括反馈节点状态的节点标识，以及各自对应的中继次数。在这里， 每个节点对应的中继次数为至少一个数值。
目标节点根据得到的中继次数清单确定其中的一个中继次数作为目标节点生存时间值。
本申请实施例提供的确定多跳网络节点生存时间值的方法，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定中继次数作为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
图2示出了本申请一实施例提供的一种确定多跳网络节点生存时间值的方法的流程示意图，从图2中可以看出，该方法包括：
S21、目标节点根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
S22、根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
S23、使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值；
其中，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值，所述待选中继次数为从节点对应的各中继次数中选出的中继次数。
针对步骤S21，需要说明的是，该步骤与上述实施例步骤S11在原理上相同，在此不再赘述。
针对步骤S22和步骤S23，需要说明的是，在本申请实施例中，目标节点对获得的中继次数清单进行分析，从而从各节点对应的各中继次数中确定属于各节点的待选中继次数。
在这里，待选中继次数被配置为进一步确定目标节点生存时间值的中继次数。也就是说，目标节点需要从各节点对应的待选中继次数中选取其中的一个中继次数作为目标节点生存时间值。在本申请实施例中，使各节点对应的待选中继次数中的最大值配置为目标节点生存时间值。若存在几个节点对应的待选中继次数相同，且均为最大值，则直接将该最大值配置 为目标节点生存时间值。
在本申请实施例方法的进一步实施例中，对步骤S22进行解释说明，根据中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数，并确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
对此，需要说明的是，在本申请实施例中，由于节点对应的中继次数会存在多个(至少两个)，因此，当确定反馈节点状态的任一节点对应的中继次数为多个时，需要统计各中继次数的出现次数。然后，确定最小中继次数的出现次数非最小值，配置该最小中继次数为待选中继次数。
例如目标节点收到某一个节点反馈的5个节点状态，每个节点状态中均可解析出对应的中继次数，此时，可统计出各中继次数的出现次数。
中继次数为1，出现2次。
中继次数为2，出现1次。
中继次数为3，出现2次。
从上述的统计结果可以得知，最小中继次数为1的出现次数非最小值，此时，将最小中继次数为1作为该节点对应的待选中继次数。
在本申请实施例方法的进一步实施例中，对步骤S22进行解释说明，根据中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数为最小值，根据第二生存时间值向该节点发送请求节点状态的数据包；
确定接收到该节点反馈的节点状态，配置第二生存时间值为待选中继次数；
确定未接收到该节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向该节点发送再次请求节点状态的数据包；
其中，第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
对此，需要说明的是，在本申请实施例中，由于节点对应的中继次数会存在多个(至少两个)，因此，当确定反馈节点状态的节点对应的中继 次数为多个时，需要统计各中继次数的出现次数。然后判断最小中继次数的出现次数是否为最小值，当确定最小中继次数为最小值，不能直观的将该最小中继次数配置为该节点的待选中继次数。目标节点需要再次向该节点发送请求节点状态的数据包，以是否接收到该节点反馈的节点状态为依据确定该节点的待选中继次数。在这里，为了方便描述，目标节点再次向该节点发送请求节点状态的数据包所按照的生存时间值作为“第二生存时间值”。
在本申请实施例中，以该节点对应的各中继次数中最小中继次数为首个第二生存时间值，向该节点发送请求节点状态的数据包。
当确定接收到该节点反馈的节点状态，配置最小中继次数为待选中继次数。
当确定未接收到该节点反馈的节点状态，根据最小中继次数和预设间隔策略(如数值加1)确定新的第二生存时间值，并根据第二生存时间值向该节点发送再次请求节点状态的数据包。
在这里，将中继次数递增作为第二生存时间值，并根据第二生存时间值向该节点发送再次请求节点状态的数据包，只要确定接收到该节点反馈的节点状态，则配置当前的中继次数作为该节点的待选中继次数。
另外，若第二生存时间值为为该节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，则表明该节点之前反馈的节点状态无效，无效的原因可包括该节点目前处于故障、不在线等。此时，可配置节点的待选中继次数为空。待选中继次数为空对确定目标节点的TTL值不产生影响。
例如目标节点收到某一个节点反馈的5个节点状态，每个节点状态中均可解析出对应的中继次数，此时，可统计出各中继次数的出现次数。
中继次数为2，出现2次。
中继次数为3，出现3次。
从上述的统计结果可以得知，最小中继次数为2的出现次数为最小值，此时，目标节点需要按上述方法重新向该节点发送请求。
当按中继次数为2作为生存时间值向该节点发送请求节点状态的数据包，该节点反馈了节点状态，此时，将中继次数2作为该节点的待选中继 次数。
当按中继次数为3作为生存时间值向该节点发送请求节点状态的数据包，该节点未反馈节点状态，此时，该节点的数据无效，配置该节点的待选中继次数为空。
在本申请实施例方法的进一步实施例中，对步骤S22进行解释说明，根据中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
对此，需要说明的是，节点向目标节点反馈了多次节点状态，对节点状态进行解析后，确定所有节点状态所携带的中继次数均相同，此时，将这唯一存在的中继次数作为该节点的待选中继次数。
例如目标节点收到某一个节点反馈的5个节点状态，每个节点状态中均可解析出对应的中继次数，此时，可统计出各中继次数的出现次数。
中继次数为2，出现5次。
从上述的统计结果可以得知，仅出现了中继次数为2，此时，目标节点将中继次数2作为该节点的待选中继次数。
如图3所示为本实施例方法在多跳网络节点间生存时间值确定过程示意图。参照图3，选中节点1为目标节点。节点1用最大TTL值向网络中其他节点发布请求节点状态的数据包，此时在线节点2、3、4、7、9、13都接收到数据包，并计算中继次数回复。
依照上述确定待选中继次数的过程可以得知，其中节点2、3、4的待选中继次数为1，节点7、9的待选中继次数为2，节点13的待选中继次数为3。
此时所有在线节点2、3、4、7、9、13中，最大中继次数为3。于是设置该选定节点的TTL值为3。
如图4所示为本实施例方法在多跳网络节点间生存时间值确定过程示意图。参照图4，选中节点1为目标节点。节点1用最大TTL值向网络中其他节点发布请求节点状态的数据包，此时在线节点2～16都接收到数据包，并计算中继次数回复。
依照上述确定待选中继次数的过程可以得知，节点13回复的最小中继次数为3的消息只有1次，而中继次数为6的消息共出现6次。
此时，节点1以TTL＝3向节点13发布请求节点状态的数据包，节点13收到数据包，并计算中继次数回复。
节点1收到回复消息后，确定节点13的待选中继次数为3。
如图5所示为本实施例方法在多跳网络节点间生存时间值确定过程示意图。参照图5，选中节点1为目标节点。节点1用最大TTL值向网络中其他节点发布请求节点状态的数据包，此时在线节点2～16都接收到数据包，并计算中继次数回复。
依照上述确定待选中继次数的过程可以得知，节点13回复的最小中继次数为3的消息只有1次，而中继次数为6的消息共出现4次。
节点1以TTL＝3向节点13发布请求节点状态的数据包，。
此时节点13离线。
节点2在规定时间内未收到回复消息，则将TTL递增，再次向节点13发布请求节点状态的数据包，。
重复多次，一直到TTL＝6，节点1仍未在规定时间内收到回复消息。
节点1确认节点13离线，之前回复消息的数据无效。
如图6所示为本实施例方法的执行流程示意图，由于上述对整个流程进行了详细的解释说明，因此参照图6可以清楚理解，在此不对图6进行详细说明。
本申请实施例提供的确定多跳网络节点生存时间值的方法，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定各节点对应的待选中继次数，使各节点对应的待选中继次数中的最大值配置为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
图7示出了本申请一实施例提供的一种确定多跳网络节点生存时间值的装置，包括处理模块31和确定模块32，其中：
处理模块31，被配置为根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
确定模块32，被配置为根据所述中继次数清单确定目标节点生存时间 值；
其中，所述处理模块和所述确定模块所属目标节点，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
由于本申请实施例所述装置与上述实施例所述方法的原理相同，对于更加详细的解释内容在此不再赘述。
需要说明的是，本申请实施例中可以通过硬件处理器(hardware processor)来实现相关功能模块。
本申请实施例提供的确定多跳网络节点生存时间值的装置，通过节点以预设限制生存时间值向其他节点发送请求节点状态的数据包，并根据节点状态确定中继次数清单，然后根据中继次数清单确定中继次数作为目标节点生存时间值，保证数据包传输到网络中其他节点，不会产生多余无效的反复传输。
在上述装置实施例的进一步实施例，所述确定模块具体被配置为：
所述确定模块包括选取单元和确定单元，其中：
选取单元，被配置为根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
确定单元，被配置为使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值。
在上述装置实施例的进一步实施例，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
在上述装置实施例的进一步实施例，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
确定最小中继次数的出现次数为最小值，根据第二生存时间值向所述节点发送请求节点状态的数据包；
确定接收到所述节点反馈的节点状态，配置第二生存时间值为待选中继次数；
确定未接收到所述节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向所述节点发送再次请求节点状态的数据包；
其中，所述第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
在上述装置实施例的进一步实施例，所述选取单元具体被配置为：
确定所述第二生存时间值为所述节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，配置所述节点的待选中继次数为空。
在上述装置实施例的进一步实施例，所述选取单元具体被配置为：
根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
本申请实施例还提供一种路由器，该路由器包括上述实施例提供的确定多跳网络节点生存时间值的装置。
图8示例了一种电子设备的实体结构示意图，如图8所示，该电子设备可以包括：处理器(processor)41、通信接口(Communications Interface)42、存储器(memory)43和通信总线44，其中，处理器41，通信接口42，存储器43通过通信总线44完成相互间的通信。处理器41可以调用存储器43中的逻辑指令，以执行如下方法：根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；根据所述中继次数清单确定目标节点生存时间值，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
此外，上述的存储器43中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动 硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
进一步地，本申请实施例公开一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，计算机能够执行上述各方法实施例所提供的方法，例如包括：根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；根据所述中继次数清单确定目标节点生存时间值，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
另一方面，本申请实施例还提供一种非暂态计算机可读存储介质，其上存储有计算机程序，该计算机程序被处理器执行时实现以执行上述各实施例提供的传输方法，例如包括：根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；根据所述中继次数清单确定目标节点生存时间值，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
以上所描述的装置实施例仅仅是示意性的，其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。本领域普通技术人员在不付出创造性的劳动的情况下，即可以理解并实施。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到各实施方式可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件。基于这样的理解，上述技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如ROM/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行各个实施例或者实施例的某些部分所述的方法。
最后应说明的是：以上实施例仅用以说明本申请的技术方案，而非对其限制；尽管参照前述实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的精神和范围。
以上实施方式仅用于说明本申请，而非对本申请的限制。尽管参照实施例对本申请进行了详细说明，本领域的普通技术人员应当理解，对本申请的技术方案进行各种组合、修改或者等同替换，都不脱离本申请技术方案的精神和范围，均应涵盖在本申请的权利要求范围中。

Claims (15)

  1. 一种确定多跳网络节点生存时间值的方法，其特征在于，包括：
    目标节点根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
    根据所述中继次数清单确定所述目标节点生存时间值；
    其中，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
  2. 根据权利要求1所述的确定多跳网络节点生存时间值的方法，其特征在于，所述根据所述中继次数清单确定所述目标节点生存时间值，包括：
    根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
    使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值。
  3. 根据权利要求2所述的确定多跳网络节点生存时间值的方法，其特征在于，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
    确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
  4. 根据权利要求2所述的确定多跳网络节点生存时间值的方法，其特征在于，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
    确定最小中继次数的出现次数为最小值，根据第二生存时间值向所述节点发送请求节点状态的数据包；
    确定接收到所述节点反馈的节点状态，配置第二生存时间值为待选中 继次数；
    确定未接收到所述节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向所述节点发送再次请求节点状态的数据包；
    其中，所述第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
  5. 根据权利要求4所述的确定多跳网络节点生存时间值的方法，其特征在于，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
    确定所述第二生存时间值为所述节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，配置所述节点的待选中继次数为空。
  6. 根据权利要求2所述的确定多跳网络节点生存时间值的方法，其特征在于，所述根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数，包括：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
  7. 一种确定多跳网络节点生存时间值的装置，其特征在于，包括：
    处理模块，被配置为根据第一生存时间值向多跳网络中节点发送请求节点状态的数据包，并获取节点反馈的节点状态，根据所述节点状态确定中继次数清单；
    确定模块，被配置为根据所述中继次数清单确定目标节点生存时间值；
    其中，所述处理模块和所述确定模块所属目标节点，所述目标节点为多跳网络中一节点，所述第一生存时间值为预设限制生存时间值。
  8. 根据权利要求7所述的确定多跳网络节点生存时间值的装置，其特征在于，所述确定模块包括选取单元和确定单元，其中：
    选取单元，被配置为根据所述中继次数清单确定反馈节点状态的各节点对应的待选中继次数；
    确定单元，被配置为使各节点对应的待选中继次数中的最大值配置为所述目标节点生存时间值。
  9. 根据权利要求8所述的确定多跳网络节点生存时间值的装置，其特征在于，所述选取单元具体被配置为：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
    确定最小中继次数的出现次数非最小值，配置最小中继次数为待选中继次数。
  10. 根据权利要求8所述的确定多跳网络节点生存时间值的装置，其特征在于，所述选取单元具体被配置为：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数为至少两个，统计各中继次数的出现次数；
    确定最小中继次数的出现次数为最小值，根据第二生存时间值向所述节点发送请求节点状态的数据包；
    确定接收到所述节点反馈的节点状态，配置第二生存时间值为待选中继次数；
    确定未接收到所述节点反馈的节点状态，根据第二生存时间值和预设间隔策略确定新的第二生存时间值，并根据第二生存时间值向所述节点发送再次请求节点状态的数据包；
    其中，所述第二生存时间值为所述节点对应的各中继次数中的一个中继次数。
  11. 根据权利要求8所述的确定多跳网络节点生存时间值的装置，其特征在于，所述选取单元具体被配置为：
    确定所述第二生存时间值为所述节点对应的各中继次数中最大中继次数，且未接收到所述节点反馈的节点状态，配置所述节点的待选中继次数为空。
  12. 根据权利要求10所述的确定多跳网络节点生存时间值的装置，其特征在于，所述选取单元具体被配置为：
    根据所述中继次数清单确定反馈节点状态的任一节点对应的中继次数存在一个，配置存在的中继次数为待选中继次数。
  13. 一种路由器，其特征在于，包括上述权利要求7-12中任一项所述的确定多跳网络节点生存时间值的装置。
  14. 一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述程序时实现如权利要求1至6任一项所述确定多跳网络节点生存时间值的方法的步骤。
  15. 一种非暂态计算机可读存储介质，其上存储有计算机程序，其特征在于，该计算机程序被处理器执行时实现如权利要求1至6任一项所述确定多跳网络节点生存时间值的方法的步骤。
PCT/CN2019/130474 2019-11-27 2019-12-31 确定多跳网络节点生存时间值的方法及装置 WO2021103272A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911185744.4A CN110933730B (zh) 2019-11-27 2019-11-27 确定多跳网络节点生存时间值的方法及装置
CN201911185744.4 2019-11-27

Publications (1)

Publication Number Publication Date
WO2021103272A1 true WO2021103272A1 (zh) 2021-06-03

Family

ID=69846853

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/130474 WO2021103272A1 (zh) 2019-11-27 2019-12-31 确定多跳网络节点生存时间值的方法及装置

Country Status (2)

Country Link
CN (1) CN110933730B (zh)
WO (1) WO2021103272A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114465918B (zh) * 2022-02-24 2024-03-08 杭州中天微系统有限公司 消息应答方法以及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101366243A (zh) * 2006-01-06 2009-02-11 日本电气株式会社 通信系统、通信方法、节点和节点程序
CN103516615A (zh) * 2013-07-15 2014-01-15 中国人民解放军国防科学技术大学 网络拓扑确定方法和装置
US20160065689A1 (en) * 2014-08-28 2016-03-03 Fujitsu Limited Cache control device and cache control method
US10257077B1 (en) * 2017-03-22 2019-04-09 Amazon Technologies, Inc. Hop-aware multicast in a mesh network
CN109862548A (zh) * 2019-03-06 2019-06-07 乐鑫信息科技（上海）股份有限公司 用于在蓝牙Mesh网络中的节点处对数据包进行处理的方法

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101951659B (zh) * 2010-08-13 2013-09-25 华南理工大学 传感器网络自组织方法及基于该方法的移动终端系统
CN102497646A (zh) * 2011-12-08 2012-06-13 中山大学 一种用于无线网络的低开销缓存数据发现机制
CN102821409B (zh) * 2012-08-17 2014-12-10 北京交通大学 一种优化无线传感器节点生存时间的服务质量保障方法
CN105636148B (zh) * 2016-01-06 2019-01-04 中央军委装备发展部第六十三研究所 一种无线多跳网络数据传输方法
CN106454899A (zh) * 2016-10-21 2017-02-22 高道华 一种无线mesh网络生存时间优化方法
CN106385701B (zh) * 2016-12-14 2019-10-29 武汉博思创信息科技有限公司 一种基于传输时间长度确定最佳路由的方法
US20180343200A1 (en) * 2017-05-26 2018-11-29 Qualcomm Incorporated Congestion control and message analysis in a wireless mesh network
CN109618321A (zh) * 2019-01-30 2019-04-12 深圳众享互联科技有限公司 一种基于路由表实现的蓝牙Mesh网络传输系统及方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101366243A (zh) * 2006-01-06 2009-02-11 日本电气株式会社 通信系统、通信方法、节点和节点程序
CN103516615A (zh) * 2013-07-15 2014-01-15 中国人民解放军国防科学技术大学 网络拓扑确定方法和装置
US20160065689A1 (en) * 2014-08-28 2016-03-03 Fujitsu Limited Cache control device and cache control method
US10257077B1 (en) * 2017-03-22 2019-04-09 Amazon Technologies, Inc. Hop-aware multicast in a mesh network
CN109862548A (zh) * 2019-03-06 2019-06-07 乐鑫信息科技（上海）股份有限公司 用于在蓝牙Mesh网络中的节点处对数据包进行处理的方法

Also Published As

Publication number Publication date
CN110933730B (zh) 2021-09-03
CN110933730A (zh) 2020-03-27

Similar Documents

Publication Publication Date Title
EP3012999B1 (en) Method, apparatus and system for creating virtual interfaces based on network characteristics
JP6001797B2 (ja) モノのインターネットにおけるＺｉｇＢｅｅネットワークを管理する方法
EP2383934B1 (en) Ip session liveness monitoring method and system, home gateway and network equipment
KR20180034618A (ko) 사물 인터넷 단-대-단 서비스 계층의 서비스 품질 관리
US10171986B2 (en) Radio relay device and system with waiting time optimization
US20180262401A1 (en) Systems and Methods for Selection of Parent Nodes in a Network
WO2021051992A1 (zh) 一种nat穿越的方法、设备和系统
EP2996292B1 (en) Method for processing message and forwarder
JP7430224B2 (ja) パケット処理方法およびゲートウェイ・デバイス
WO2018192288A1 (zh) 一种调整节点检测参数的方法、节点和网状网络
WO2022253087A1 (zh) 一种数据传输方法、节点、网络管理器及系统
WO2019119346A1 (zh) 一种通信路径确定方法及网络设备
JP6480452B2 (ja) パケット処理方法および装置
TW201729568A (zh) 網路系統及建立資料連線的方法
US20230010837A1 (en) Fault diagnosis method and apparatus thereof
WO2021103272A1 (zh) 确定多跳网络节点生存时间值的方法及装置
JP6493945B2 (ja) 高密度大規模ネットワーク向けのＧｒｅｅｎ Ｐｏｗｅｒ（プロキシテーブルのスケーリング）
CN112887209A (zh) 关于数据传输的表项建立方法及相关设备
WO2021103273A1 (zh) 确定多跳网络节点生存时间值的方法及装置
WO2022188869A1 (en) System and method for implementing relay nodes in a wireless network
WO2021146879A1 (zh) 消息传输的方法、ble设备和ble芯片
CN109983734B (zh) 具有中继设备的远程计算设备的子组
CN110912824B (zh) 确定多跳网络节点生存时间值的方法及装置
JP3613207B2 (ja) Ａｒｐテーブル形成方法及びこれを用いた経路制御方法
JPWO2005062549A1 (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: 19954047

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 03/11/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 19954047

Country of ref document: EP

Kind code of ref document: A1