WO2020200021A1 - 邻居发现方法及节点 - Google Patents

邻居发现方法及节点 Download PDF

Info

Publication number
WO2020200021A1
WO2020200021A1 PCT/CN2020/081308 CN2020081308W WO2020200021A1 WO 2020200021 A1 WO2020200021 A1 WO 2020200021A1 CN 2020081308 W CN2020081308 W CN 2020081308W WO 2020200021 A1 WO2020200021 A1 WO 2020200021A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
neighbor
neighbor list
list
different
Prior art date
Application number
PCT/CN2020/081308
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 WO2020200021A1 publication Critical patent/WO2020200021A1/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/023—Limited or focused flooding to selected areas of a network
    • 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
    • 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • 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

  • the present disclosure relates to the field of communication technology, and in particular to a neighbor discovery method and node.
  • non-centered wireless networks such as mobile ad hoc networks, sensor networks
  • the neighbor relationship between nodes and the status of neighbor nodes are obtained through neighbor interaction data between nodes, which is used for network topology control, routing, data transmission, etc. Provide the basis.
  • the establishment of neighbor relationships and the acquisition of the link status of neighbor nodes are mainly obtained by nodes periodically broadcasting their own and neighbor information.
  • Such messages that periodically broadcast their own and neighbor information are usually called Hello messages.
  • Nodes in the network first obtain the link status between nodes by exchanging Hello messages, establish and collect the node's 1-hop neighbor relationship and neighbor node link status; then collect the collected 1-hop neighbor relationship and neighbor node link status as needed Broadcast within the hop range of N (N is a positive integer), while receiving, processing and forwarding the neighbor relationship and neighbor node link status broadcast by other nodes; finally establish and collect self-centered (N+ 1) The neighbor relationship of the hop and the link state of the neighbor node.
  • the relevant neighbor discovery strategy if the nodes in the network want to establish and collect the neighbor relationship and neighbor node link state within the (N+1) hop range, the collected 1-hop neighbor relationship and neighbor node link state need to be set to N Broadcast within jumping range. In this way, a large amount of redundant information is broadcast and forwarded, which increases the system overhead and burden of the network.
  • the present disclosure provides a neighbor discovery method and node to solve the problem that a large amount of redundant information in the neighbor discovery strategy is broadcast and forwarded, which increases the system overhead and burden of the network.
  • the present disclosure provides a neighbor discovery method applied to a first node, and the method includes:
  • broadcasting different neighbor lists in different ranges includes:
  • the broadcast carries at least one neighbor list of the TTL.
  • the different ranges include different hop count ranges
  • the broadcasting of different neighbor lists in different ranges includes:
  • the method before the classifying the 1-hop neighbor nodes of the first node to form at least one neighbor list, the method further includes:
  • the classifying the 1-hop neighbor nodes of the first node to form at least one neighbor list includes:
  • the 1-hop neighbor nodes of the first node are classified to form at least one neighbor list.
  • the one-hop neighbor nodes of the first node are classified according to the link quality between the one-hop neighbor nodes of the first node and the first node to form at least one neighbor list ,include:
  • the link quality includes at least one of the following:
  • a neighbor discovery method is also provided, which is applied to a second node, and the method includes:
  • the quality level of the neighbor list is the link quality level between the nodes in the neighbor list and the source node that sends the neighbor list.
  • the preset condition further includes:
  • the second node receives the neighbor list for the first time.
  • the method further includes:
  • the preset condition further includes:
  • the TTL of the neighbor list is greater than 1.
  • the forwarding the neighbor list includes:
  • a node is also provided.
  • the node is a first node and includes a processor, a transceiver, a memory, and a program stored on the memory and running on the processor, wherein the When the processor runs the program, it is specifically used for:
  • Different neighbor lists are broadcast in different ranges through the transceiver, wherein the lower the quality level, the smaller the broadcast range of the neighbor list.
  • the processor is specifically configured to:
  • the different ranges include different hop count ranges
  • the processor is specifically configured to:
  • a neighbor list with a quality level of M is broadcast within a range of M hops through the transceiver, where M is a non-negative integer.
  • the processor is further configured to:
  • Receive neighbor interaction data through the transceiver determine the 1-hop neighbor node of the first node according to the neighbor interaction data, and evaluate the relationship between the 1-hop neighbor node of the first node and the first node.
  • Link quality
  • the processor is specifically used for:
  • the 1-hop neighbor nodes of the first node are classified to form at least one neighbor list.
  • the processor is specifically configured to:
  • the 1-hop neighbor nodes of the first node are classified according to the divided link quality levels to form at least one neighbor list.
  • the link quality includes at least one of the following:
  • a node is also provided, where the node is a second node, and includes a processor, a transceiver, a memory, and a program stored on the memory and running on the processor, wherein the When the processor runs the program, it is specifically used for:
  • the neighbor list is forwarded through the transceiver, where the preset condition at least includes that the link quality level between the third node and the second node is not lower than that of the neighbor.
  • the quality level of the list, where the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list.
  • the preset condition further includes:
  • the second node receives the neighbor list for the first time.
  • the processor is further used to:
  • the preset condition further includes:
  • the TTL of the neighbor list is greater than 1.
  • the processor is specifically configured to:
  • the neighbor list is forwarded through the transceiver.
  • a node is also provided, the node is a first node, and the first node includes:
  • the classification module is used to classify the 1-hop neighbor nodes of the first node to form at least one neighbor list, wherein the quality levels of different neighbor lists are different, and the quality levels of the neighbor lists are those in the neighbor list The link quality level between the node and the first node;
  • the broadcast module is used to broadcast different neighbor lists in different ranges, where the lower the quality level, the smaller the broadcast range of the neighbor list.
  • a node is also provided, the node is a second node, and the second node includes:
  • the receiving module is used to receive the neighbor list sent by the third node
  • a sending module configured to forward the neighbor list if a preset condition is met, where the preset condition at least includes that the link quality level between the third node and the second node is not lower than that of the neighbor
  • the quality level of the list, where the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list.
  • a computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, it implements the steps performed by the first node in the neighbor discovery method; Or, when the computer program is executed by the processor, the steps executed by the second node in the neighbor discovery method described above are implemented.
  • the neighbor discovery method classifies the 1-hop neighbor nodes of the first node to form at least one neighbor list, wherein the quality levels of different neighbor lists are different, and the quality levels of the neighbor lists It is the link quality level between the node in the neighbor list and the first node; different neighbor lists are broadcast in different ranges, wherein the broadcast range of the neighbor list with a lower quality level is smaller.
  • the neighbor discovery method classifies 1-hop neighbor nodes to form neighbor lists with different quality levels, and controls the broadcast range of the neighbor lists according to the quality levels of the neighbor lists, which can reduce the amount of data exchanged during the neighbor discovery process and reduce the network System overhead and burden.
  • FIG. 1 is one of the flowcharts of the neighbor discovery method of some embodiments of the present disclosure
  • FIG. 3 is a schematic diagram of a network topology structure provided by some embodiments of the present disclosure.
  • FIG. 4 is a schematic diagram of the local topology structure of the node 16 in the network topology shown in FIG. 3;
  • FIG. 5 is a schematic diagram of the local topology structure of the node 10 in the network topology shown in FIG. 3;
  • FIG. 6 is one of the schematic diagrams of the first node in some embodiments of the present disclosure.
  • FIG. 7 is one of the schematic diagrams of the second node in some embodiments of the present disclosure.
  • FIG. 8 is the second schematic diagram of the first node of some embodiments of the present disclosure.
  • FIG. 9 is a second schematic diagram of the second node in some embodiments of the present disclosure.
  • FIG. 10 is the third schematic diagram of the first node of some embodiments of the present disclosure.
  • FIG. 11 is the third diagram of the second node in some embodiments of the present disclosure.
  • words such as “exemplary” or “for example” are used as examples, illustrations, or illustrations. Any embodiment or design solution described as “exemplary” or “for example” in the embodiments of the present disclosure should not be construed as being more preferable or advantageous than other embodiments or design solutions. To be precise, words such as “exemplary” or “for example” are used to present related concepts in a specific manner.
  • the technology described in this article is not limited to new wireless communication systems (New RAT, NR), and can also be used in various wireless communication systems, such as Long Time Evolution (LTE)/LTE-Advanced (LTE-Advanced, LTE).
  • LTE Long Time Evolution
  • LTE-Advanced LTE-Advanced
  • LTE-A System, Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (Frequency Division Multiple Access, FDMA), Orthogonal Frequency Division Multiple Access ( Orthogonal Frequency Division Multiple Access, OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA) and other systems.
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • OFDMA Orthogonal Frequency Division Multiple Access
  • SC-FDMA Single-carrier Frequency-Division Multiple Access
  • the CDMA system can implement radio technologies such as CDMA2000 and Universal Terrestrial Radio Access
  • UTRA includes Wideband Code Division Multiple Access (WCDMA) and other CDMA variants.
  • the TDMA system can implement radio technologies such as the Global System for Mobile Communication (GSM).
  • OFDMA system can realize such as Ultra Mobile Broadband (UMB), Evolved UTRA (Evolution-UTRA, E-UTRA), IEEE 802.11 (Wi-Fi), IEEE802.16 (WiMAX), IEEE802.20, Flash-OFDM And other radio technology.
  • UMB Ultra Mobile Broadband
  • Evolved UTRA Evolved UTRA
  • E-UTRA IEEE 802.11
  • WiMAX IEEE802.16
  • IEEE802.20 Flash-OFDM And other radio technology.
  • UTRA and E-UTRA are part of Universal Mobile Telecommunications System (UMTS).
  • LTE and more advanced LTE (such as LTE-A) are new UMTS versions that use E-UTRA.
  • UTRA, E-UTRA, UMTS, LTE, LTE-A, NR, and GSM are described in documents from an organization named "3rd Generation Partnership Project” (3GPP).
  • CDMA2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2" (3GPP2).
  • the technology described in this article can be used for the systems and radio technologies mentioned above as well as other systems and radio technologies.
  • nodes mentioned in some embodiments of the present disclosure are any device with a unique network address, such as workstations, terminal devices, servers, sensor devices, etc.
  • the embodiments of the present disclosure do not limit the specific types of nodes. .
  • FIG. 1 is one of the flowcharts of the neighbor discovery method provided by some embodiments of the present disclosure.
  • the execution subject of the neighbor discovery method is the first node, and the specific steps are as follows:
  • Step 101 Classify the 1-hop neighbor nodes of the first node to form at least one neighbor list, wherein the quality levels of different neighbor lists are different, and the quality levels of the neighbor lists are the same as those of the nodes in the neighbor list.
  • Step 102 Broadcast different neighbor lists in different ranges, where a neighbor list with a lower quality level has a smaller broadcast range.
  • the first node classifies 1-hop neighbor nodes to form at least one neighbor list, and broadcasts different neighbor lists in different ranges.
  • Each neighbor list includes at least one 1-hop neighbor node.
  • the neighbor lists have different quality levels. The lower the quality level, the smaller the broadcast range of the neighbor list.
  • the quality level of the neighbor list is the link quality level between the node in the neighbor list and the first node.
  • the first node is any node in the wireless network.
  • the first node may determine the 1-hop neighbor node of the first node in the neighbor listening process, that is, the first node may determine the 1-hop neighbor node according to its own state and the obtained neighbor interaction data, and compare the 1-hop neighbor node Neighbor nodes are classified. Specifically, the first node may receive neighbor interaction data sent by neighbor nodes, and determine the 1-hop neighbor nodes of the first node according to the neighbor interaction data, and evaluate the 1-hop neighbor nodes of the first node respectively The link quality between the first node and the first node, and then according to the link quality between the first node’s 1-hop neighbor node and the first node, the first node’s 1-hop neighbor node Perform classification to form at least one neighbor list.
  • the first node may broadcast different neighbor lists in different ranges when determining that it satisfies the conditions for sending neighbor interaction data, wherein the broadcast range of the neighbor list with lower quality is smaller.
  • the condition for sending neighbor interaction data may include that the node obtains network synchronization, and/or the current time is the time when the node periodically sends neighbor interaction data.
  • the first node determines that it meets the conditions for sending neighbor interaction data, and Broadcast different neighbor lists in different ranges.
  • the broadcasting different neighbor lists in different ranges may include: setting different TTLs (Time To Live, time to live) for neighbor lists of different quality levels, and broadcasting at least one neighbor list carrying the TTL, where the quality The lower the TTL of the neighbor list is.
  • the broadcasting of different neighbor lists in different ranges may also include: broadcasting a neighbor list with a quality level of M in a range of M hops, where M is a non-negative integer.
  • the broadcast neighbor list mentioned in this embodiment is an attempt to send the neighbor list to all nodes within the broadcast range, and the actual transmission range of the neighbor list is also affected by the link quality between nodes, that is, due to Due to the impact of link quality, some nodes within the broadcast range may not be able to receive the broadcast neighbor list.
  • the neighbor discovery method classifies the 1-hop neighbor nodes of the first node to form at least one neighbor list, wherein the quality levels of different neighbor lists are different, and the quality level of the neighbor list is the neighbor The link quality level between the nodes in the list and the first node; different neighbor lists are broadcast in different ranges, wherein the broadcast range of the neighbor list with a lower quality level is smaller.
  • the neighbor discovery method classifies 1-hop neighbor nodes to form neighbor lists with different quality levels, and controls the broadcast range of the neighbor lists according to the quality levels of the neighbor lists, which can reduce the amount of data exchanged during the neighbor discovery process and reduce the network System overhead and burden.
  • broadcasting different neighbor lists in different ranges includes:
  • the broadcast carries at least one neighbor list of the TTL.
  • broadcasting different neighbor lists in different ranges specifically includes: setting different time-to-live TTLs for neighbor lists of different quality levels, and broadcasting at least one neighbor list carrying the TTL, where the quality The lower the TTL of the neighbor list is.
  • the neighbor discovery method realizes broadcasting different neighbor lists in different ranges by setting different TTLs for different neighbor lists.
  • the different ranges include different hop count ranges
  • the broadcasting of different neighbor lists in different ranges includes:
  • different ranges include different hop count ranges
  • broadcasting different neighbor lists in different ranges specifically includes broadcasting a neighbor list with a quality level of M within an M hop range, where M is a non-negative integer.
  • the first node may broadcast a neighbor list with a quality level of 0 within a range of 0 hops, that is, not send a neighbor list with a quality level of 0; broadcast a neighbor list with a quality level of 1 within a 1-hop range, and The neighbor list with quality level 2 is broadcast within a 2-hop range.
  • the link quality level between the node in the neighbor list with the quality level M and the first node is M.
  • the method before the classifying the 1-hop neighbor nodes of the first node to form at least one neighbor list, the method further includes:
  • the classifying the 1-hop neighbor nodes of the first node to form at least one neighbor list includes:
  • the 1-hop neighbor nodes of the first node are classified to form at least one neighbor list.
  • the first node classifies the 1-hop neighbor nodes of the first node according to the received neighbor interaction data to form at least one neighbor list. Specifically, the first node receives neighbor interaction data sent by other nodes, determines the one-hop neighbor node of the first node according to the neighbor interaction data, and evaluates that the one-hop neighbor node of the first node is different from each other. According to the link quality between the first nodes, the 1-hop neighbor nodes of the first node are classified according to the link quality to form at least one neighbor list.
  • the first node may classify the links between the 1-hop neighbor nodes of the first node and the first node into different link quality levels according to link quality. Then, the 1-hop neighbor nodes of the first node are classified according to the divided link quality levels to form at least one neighbor list.
  • the first node may also broadcast the link quality between each node in the neighbor list and the first node while broadcasting the neighbor list, so that it is convenient to receive
  • the node to the neighbor list establishes a neighbor relationship with the first node, and collects the link quality with the first node.
  • the first node may carry the neighbor list in neighbor interaction data for broadcasting, and the neighbor interaction data may also include the link quality between each node in the neighbor list and the first node.
  • the neighbor interaction data may also carry the first node information, so that it is convenient for the node that receives the neighbor list to determine the source node that sends the neighbor list.
  • the one-hop neighbor nodes of the first node are classified according to the link quality between the one-hop neighbor nodes of the first node and the first node to form at least one neighbor list ,include:
  • the 1-hop neighbor nodes of the first node are classified according to the divided link quality levels to form at least one neighbor list.
  • the first node may classify links into different levels according to link quality, and then classify 1-hop neighbor nodes according to different link quality levels between nodes to form neighbors of different quality levels List. Specifically, the first node first classifies the link quality between the one-hop neighbor node of the first node and the first node into different link quality levels according to the link quality, and then according to the divided link quality The link quality level classifies the 1-hop neighbor nodes of the first node to form at least one neighbor list.
  • node i is the first node
  • the node i evaluates the link state between nodes according to the received neighbor interaction data, that is, evaluate The status of links S(j,i), S(k,i), and S(m,i).
  • the link quality is divided into (L+1) levels, where the lowest level is 0 and the highest level is N , The larger the value, the better the link quality.
  • the node i obtains node information I(j), I(k), I(m) of nodes j, k, and m, and classifies nodes j, k, and m according to the divided link quality levels to form at least one neighbor List.
  • the first node also determines whether the neighbor interaction data is received for the first time, and if it is the first time the neighbor interaction data is received, the first node processes the neighbor interaction data Conversely, if the neighbor interaction data is not received for the first time, the first node directly discards the neighbor interaction data without performing subsequent processing.
  • the link quality includes at least one of the following:
  • the link quality is a characterization of the quality of the link, and the link quality may be represented by one or more of the transmission rate, channel bandwidth, packet loss rate, and link stability.
  • some embodiments of the present disclosure provide the second flowchart of the neighbor discovery method.
  • the execution subject of the neighbor discovery method is the second node, which specifically includes the following steps:
  • Step 201 Receive a neighbor list sent by a third node.
  • Step 202 If a preset condition is met, forward the neighbor list, where the preset condition at least includes that the link quality level between the third node and the second node is not lower than that of the neighbor list Quality level, the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list.
  • the second node receives the neighbor list sent by the third node, and if a preset condition is met, forwards the neighbor list.
  • the preset condition at least includes that the quality level of the link between the third node and the second node is not lower than the quality level of the neighbor list, and the quality level of the neighbor list is the neighbor list.
  • the second node may evaluate the link quality between the third node and the second node according to the data packet sent by the third node, for example, may evaluate the quality of the link between the third node and the neighbor list sent by the third node. The quality of the link between the third node and the second node.
  • the second node may also evaluate the link quality between the third node and the second node in other ways, which is not limited to the above-mentioned The way in which the data packets sent by the three nodes are evaluated.
  • the second node may be the same node as the first node, or may be a node different from the first node.
  • the third node is a node different from the first node and the second node; when the second node is When a node is different from the first node, the third node may be the same node as the first node, or may be a node different from the first node.
  • the neighbor list may be the neighbor list described in the embodiment shown in FIG. 1, or may be a neighbor list different from the neighbor list described in the embodiment shown in FIG. 1.
  • the neighbor list mentioned in this embodiment may be the neighbor list described in the embodiment shown in FIG. 1.
  • the third node may only send the neighbor list to the second node, and the second node directly receives the neighbor list sent by the third node; the third node may also send to the second node
  • the neighbor interaction data may also include the link quality between the node in the neighbor list and the source node.
  • the neighbor interaction data also carries the information of the source node that sends the neighbor interaction data, and/or the information of the relay node that forwards the neighbor interaction data, so that the second node can The neighbors exchange data to establish a neighbor relationship.
  • the second node may determine whether a preset condition is satisfied, and if the preset condition is satisfied, the second node forwards the neighbor list. Specifically, the second node obtains the link quality between the third node and the second node, and determines whether the link quality level between the third node and the second node is not low The quality level of the neighbor list. If the quality level of the link between the third node and the second node is not lower than the quality level of the neighbor list, the second node forwards the neighbor list. That is, the second node only forwards the neighbor list whose quality level is lower than the quality level of the link between the third node and the second node.
  • the second node receives the neighbor list sent by the third node; if a preset condition is met, the neighbor list is forwarded, where the preset condition includes at least the third node and the second node.
  • the link quality level between nodes is not lower than the quality level of the neighbor list, and the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list .
  • the second node conditionally forwards the received neighbor list, avoids unnecessary data forwarding in the neighbor discovery process, reduces data redundancy in the neighbor discovery process, and reduces the number of nodes in the network through distributed processing. The burden of sending and receiving data.
  • the preset condition further includes:
  • the second node receives the neighbor list for the first time.
  • the preset condition further includes that the second node receives the neighbor list for the first time. Specifically, if the second node receives the neighbor list for the first time, and the quality level of the link between the third node and the second node is not lower than the quality level of the neighbor list, The second node forwards the neighbor list. Conversely, if the second node does not receive the neighbor list for the first time, the second node discards the neighbor list without performing subsequent processing.
  • the second node when the second node receives the neighbor list for the first time, the second node has already processed the neighbor list. In this embodiment, if the second node is not the first Receiving the neighbor list once, discarding the neighbor list without performing subsequent processing, can effectively reduce data redundancy and reduce the transmission burden of the node.
  • the method further includes:
  • the second node if the second node receives the neighbor list for the first time, the second node establishes or updates the neighbor relationship of the second node according to the neighbor list. In this way, the second node By receiving and forwarding neighbor lists of different levels sent by other nodes, establish a local neighbor relationship centered on itself, collect link status with neighbors, and complete neighbor establishment. By continuously receiving and forwarding neighbor interaction data, maintaining the established neighbor relationship, updating the collected link state, and performing neighbor maintenance, the local neighbor topology with different quality levels centered on itself can be constructed through a distributed working method.
  • the preset condition further includes:
  • the TTL of the neighbor list is greater than 1.
  • the preset condition further includes that the TTL of the neighbor list is greater than 1. It is understandable that when the source node that sends the neighbor list controls the transmission range of the neighbor list by setting the TTL, the TTL of the neighbor list is reduced by 1 each time the neighbor list is forwarded, and when the TTL is not greater than 1, no Then continue to forward the neighbor list, so that control of the transmission range of the neighbor list can be achieved.
  • the second node forwards the neighbor list only when the TTL of the neighbor list is greater than 1, and does not forward the neighbor list when the TTL of the neighbor list is not greater than 1.
  • the forwarding the neighbor list includes:
  • the second node decrements the TTL of the neighbor list by 1 and forwards the neighbor list.
  • the node continuously sends, receives and forwards neighbor interaction data, establishes or maintains a local neighbor topology centered on itself, and collects or updates the link status of neighbor nodes, thereby Realize the establishment and maintenance of neighbors.
  • Some embodiments of the present disclosure are applicable to networks with bidirectional transmission links, and are also applicable to networks with unidirectional transmission links.
  • Some embodiments of the present disclosure are applicable to wireless networks.
  • Nodes in the network independently collect 1-hop neighbor nodes, establish neighbor lists of different levels, and combine the link quality between nodes and the information contained in the data to be forwarded, conditionally Forward neighbor interaction data sent by other nodes, process and/or filter the data that needs to be forwarded, and construct local neighbor topologies with different quality levels centered on itself, which can reduce the amount of data exchanged in the neighbor discovery process and reduce network traffic System overhead and burden.
  • the transmission links are bidirectional links, and the status of the sending link and the receiving link between any two nodes are the same;
  • the transmission range of the neighbor list is represented by the number of data transmission hops and is equal to the quality level of the neighbor list.
  • the nodes in the network After the nodes in the network complete neighbor monitoring, they obtain neighbor node information and the link status between nodes, and classify their 1-hop neighbor nodes to form at least one neighbor list.
  • the 1-hop neighbor nodes of node 16 include node 14, node 1, and node 10, and the link quality levels with node 16 are 0, 1, and 2, respectively.
  • Node 16 can classify 1-hop neighbor nodes into quality levels A neighbor list A (including node 14) of 0, a neighbor list B of quality level 1 (including node 1), and a neighbor list C of quality level 2 (including node 10).
  • the 1-hop neighbor nodes of node 10 include node 16, node 2, node 5, node 3, and node 7.
  • node 10 can classify its 1-hop neighbor node as quality
  • the neighbor list D of level 1 including node 2 and node 5
  • the neighbor list E of quality level 2 including node 16, node 3, and node 7.
  • a node can broadcast a neighbor list with a quality level of M within a range of M hops, that is, it does not broadcast a neighbor list with a quality level of 0, and broadcasts a neighbor list with a quality level of 1 within a 1-hop range.
  • the broadcast quality level is within a 2-hop range 2’s neighbor list.
  • node 16 may not send neighbor list A, broadcast neighbor list B within a 1-hop range (for example, set the TTL of neighbor list B to 1), and broadcast neighbor list C within a 2-hop range (for example, set neighbor list C TTL is set to 2).
  • the node 10 may broadcast the neighbor list D within a 1-hop range (for example, set the TTL of the neighbor list D to 1), and broadcast the neighbor list E within a 2-hop range (for example, set the TTL of the neighbor list E to 2).
  • the actual transmission range of the neighbor list is also affected by the link quality between nodes.
  • a node When determining whether to forward the neighbor list sent by other nodes, a node needs to compare the link quality level between itself and the previous hop node. For the relationship of the neighbor list quality level, only the neighbor list whose quality level is lower than the link quality level between itself and the previous hop node is forwarded. For example, node 1 can receive neighbor list B and neighbor list C sent by node 16, and it needs to continue to forward neighbor list C according to TTL.
  • the link quality level between node 1 and node 16 is 1, and the quality level of neighbor list C is It is 2, the quality level of the link between node 1 and node 16 is lower than neighbor list C, therefore, node 1 no longer forwards neighbor list C.
  • Node 10 can receive neighbor list B and neighbor list C sent by node 16, and determine the need to forward neighbor list C according to the size of TTL.
  • the link quality level between node 10 and node 16 is 2, which is not lower than neighbor list C. The quality level, therefore, the node 10 subtracts 1 from the TTL of the neighbor list C and forwards the neighbor list C, so that its neighbor nodes 3, 5, 7 and 2 can receive the neighbor list C.
  • nodes can establish local neighbor topologies of different quality levels through distributed algorithms. For example, in the network topology shown in FIG. 3, the local topology established by node 16 is shown in FIG. 4, and the local topology established by node 10 is shown in FIG.
  • nodes in the network can construct neighbor relationships with different quality levels centered on themselves. Whether a node can be discovered by other nodes, that is, the number and range of neighbor nodes that a node can collect, depends on the quality of single-hop or multi-hop links between nodes.
  • some embodiments of the present disclosure also provide a node, where the node is a first node 600, and the first node 600 includes a processor 601, a transceiver 602, a memory 603, and storage on the memory 603. And a program that can run on the processor 601.
  • the transceiver 602 may be a plurality of elements, including a transmitter and a transceiver, and provide a unit for communicating with various other devices on a transmission medium.
  • the transceiver 602 is used to control the processor 601 To receive and send data;
  • Different neighbor lists are broadcast in different ranges through the transceiver 602, wherein the lower the quality level, the smaller the broadcast range of the neighbor list.
  • the processor 601 is specifically configured to:
  • the different ranges include different hop count ranges
  • the processor 601 is specifically configured to:
  • a neighbor list with a quality level of M is broadcast within a range of M hops through the transceiver 602, where M is a non-negative integer.
  • the processor 601 is further configured to:
  • the processor 601 is specifically configured to:
  • the 1-hop neighbor nodes of the first node are classified to form at least one neighbor list.
  • the processor 601 is specifically configured to:
  • the 1-hop neighbor nodes of the first node are classified according to the divided link quality levels to form at least one neighbor list.
  • the link quality includes at least one of the following:
  • the node is a second node 700.
  • the second node 700 includes a processor 701, a transceiver 702, a memory 703, and is stored on the memory 703. And a computer program that can run on the processor 701.
  • the transceiver 702 may be a plurality of elements, including a transmitter and a transceiver, and provide a unit for communicating with various other devices on a transmission medium.
  • the transceiver 702 is used to control the processor 701. To receive and send data;
  • the neighbor list is forwarded through the transceiver 702, where the preset condition at least includes that the link quality level between the third node and the second node is not lower than the The quality level of the neighbor list, where the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list.
  • the preset condition further includes:
  • the second node receives the neighbor list for the first time.
  • the processor 701 is further configured to:
  • the preset condition further includes:
  • the TTL of the neighbor list is greater than 1.
  • the processor 701 is specifically configured to:
  • the neighbor list is forwarded through the transceiver 702.
  • the present disclosure also provides a node.
  • the node is a first node 800.
  • the first node 800 includes:
  • the classification module 801 is configured to classify the 1-hop neighbor nodes of the first node to form at least one neighbor list, wherein the quality levels of different neighbor lists are different, and the quality levels of the neighbor lists are in the neighbor list The link quality level between the node at and the first node;
  • the broadcasting module 802 is used to broadcast different neighbor lists in different ranges, where the lower the quality level, the smaller the broadcast range of the neighbor list.
  • the present disclosure also provides a node, where the node is a second node 900.
  • the second node 900 includes:
  • the receiving module 901 is configured to receive the neighbor list sent by the third node
  • the sending module 902 is configured to forward the neighbor list if a preset condition is met, where the preset condition at least includes that the link quality level between the third node and the second node is not lower than the The quality level of the neighbor list, where the quality level of the neighbor list is the link quality level between the node in the neighbor list and the source node that sends the neighbor list.
  • the first node 1000 shown in FIG. 10 includes: at least one processor 1001, a memory 1002, at least one user interface 1003, and a network interface 1004.
  • the components in the first node 1000 are coupled together through the bus system 1005.
  • the bus system 1005 is used to implement connection and communication between these components.
  • the bus system 1005 also includes a power bus, a control bus, and a status signal bus.
  • various buses are marked as the bus system 1005 in FIG. 10.
  • the user interface 1003 may include a display, a keyboard or a pointing device (for example, a mouse, a trackball (trackball), a touch panel or a touch screen, etc.).
  • a keyboard or a pointing device for example, a mouse, a trackball (trackball), a touch panel or a touch screen, etc.
  • the memory 1002 in some embodiments of the present disclosure may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), and electrically available Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data rate SDRAM DDRSDRAM
  • enhanced SDRAM ESDRAM
  • Synchlink DRAM SLDRAM
  • Direct Rambus RAM DRRAM
  • the memory 1002 of the system and method described in the embodiments of the present disclosure is intended to include, but is not limited to, these and any other suitable types of memory.
  • the memory 1002 stores the following elements, executable modules or data structures, or their subsets, or their extended sets: operating system 10021 and application programs 10022.
  • the operating system 10021 includes various system programs, such as a framework layer, a core library layer, a driver layer, etc., for implementing various basic services and processing hardware-based tasks.
  • the application program 10022 includes various application programs, such as a media player (Media Player), a browser (Browser), etc., which are used to implement various application services.
  • a program for implementing the method of the embodiments of the present disclosure may be included in the application program 10022.
  • each step executed by the first node in the foregoing neighbor discovery method is implemented during execution.
  • the first node provided by some embodiments of the present disclosure can execute the steps performed by the first node in the foregoing neighbor discovery method embodiment, and the implementation principles and technical effects are similar, and the details are not described herein again in this embodiment.
  • the second node 1100 shown in FIG. 11 includes: at least one processor 1101, a memory 1102, at least one user interface 1103, and a network interface 1104.
  • the components in the second node 1100 are coupled together through the bus system 1105.
  • the bus system 1105 is used to implement connection and communication between these components.
  • the bus system 1105 also includes a power bus, a control bus, and a status signal bus.
  • various buses are marked as the bus system 1105 in FIG. 11.
  • the user interface 1103 may include a display, a keyboard, or a pointing device (for example, a mouse, a trackball (trackball), a touch panel, or a touch screen).
  • a pointing device for example, a mouse, a trackball (trackball), a touch panel, or a touch screen.
  • the memory 1102 in some embodiments of the present disclosure may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), and electrically available Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data rate SDRAM DDRSDRAM
  • enhanced SDRAM ESDRAM
  • Synchlink DRAM SLDRAM
  • Direct Rambus RAM DRRAM
  • the memory 1102 of the system and method described in some embodiments of the present disclosure is intended to include, but not limited to, these and any other suitable types of memory.
  • the memory 1102 stores the following elements, executable modules or data structures, or a subset of them, or an extended set of them: operating system 11021 and application programs 11022.
  • the operating system 11021 includes various system programs, such as a framework layer, a core library layer, a driver layer, etc., for implementing various basic services and processing hardware-based tasks.
  • the application program 11022 includes various application programs, such as a media player (Media Player), a browser (Browser), etc., which are used to implement various application services.
  • the program for implementing the method of the embodiment of the present disclosure may be included in the application program 11022.
  • each step executed by the second node in the foregoing neighbor discovery method is implemented during execution.
  • the second node provided by some embodiments of the present disclosure can execute the steps performed by the second node in the foregoing neighbor discovery method embodiments, and the implementation principles and technical effects are similar, and details are not described in this embodiment.
  • Some embodiments of the present disclosure also provide a computer-readable storage medium on which a computer program is stored.
  • the computer program is executed by a processor, the first step in the neighbor discovery method provided by some embodiments of the present disclosure can be realized.
  • the steps executed by the node; or, when the computer program is executed by the processor, the steps executed by the second node in the foregoing neighbor discovery method are implemented.
  • the disclosed method and device can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • the functional units in the various embodiments of the present disclosure may be integrated into one processing unit, or each unit may be separately physically included, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit may be implemented in the form of hardware, or may be implemented in the form of hardware plus software functional units.
  • the above-mentioned integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium.
  • the above-mentioned software functional unit is stored in a storage medium and includes several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute part of the steps of the neighbor discovery method described in the various embodiments of the present disclosure.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disks or optical disks, etc., which can store program codes Medium.
  • modules, units, sub-modules, sub-units, etc. can be implemented in one or more application specific integrated circuits (ASICs), digital signal processors (Digital Signal Processing, DSP), digital signal processing equipment ( DSP Device, DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA), general-purpose processors, controllers, microcontrollers, microprocessors, Other electronic units or combinations thereof that perform the functions described in the present disclosure.
  • ASICs application specific integrated circuits
  • DSP Digital Signal Processing
  • DSP Device digital signal processing equipment
  • PLD Programmable Logic Device
  • Field-Programmable Gate Array Field-Programmable Gate Array
  • FPGA Field-Programmable Gate Array
  • the technology described in the embodiments of the present disclosure can be implemented through modules (for example, procedures, functions, etc.) that perform the functions described in the embodiments of the present disclosure.
  • the software codes can be stored in the memory and executed by the processor.
  • the memory can be implemented in the processor or external to the processor.
  • the purpose of the present disclosure can also be realized by running a program or a group of programs on any computing device.
  • the computing device may be a well-known general-purpose device. Therefore, the purpose of the present disclosure can also be achieved only by providing a program product containing program code for implementing the method or device. That is, such a program product also constitutes the present disclosure, and a storage medium storing such a program product also constitutes the present disclosure.
  • the storage medium may be any well-known storage medium or any storage medium developed in the future. It should also be pointed out that, in the device and method of the present disclosure, obviously, each component or each step can be decomposed and/or recombined.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

本公开提供一种邻居发现方法及节点，所述邻居发现方法将第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。

Description

邻居发现方法及节点
相关申请的交叉引用
本申请主张在2019年4月3日在中国提交的中国专利申请号No.201910265792.8的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其涉及一种邻居发现方法及节点。
背景技术
在无中心的无线网络中(例如移动自组织网络、传感器网络)，通过节点间的邻居交互数据获取节点的邻居关系、邻居节点的状态等信息，为网络的拓扑控制、路由选择、数据传输等提供基础。
相关的无线网络组网技术中，邻居关系的建立以及邻居节点链路状态的获取主要通过节点周期性广播自身及邻居信息获得，此类周期性广播自身及邻居信息的消息通常称为Hello消息。网络中的节点首先通过交互Hello消息，获取节点间的链路状态，建立和收集节点的1跳邻居关系和邻居节点链路状态；然后根据需要将收集的1跳邻居关系和邻居节点链路状态在N(N为正整数)跳范围内广播，同时接收、处理和转发其他节点广播的邻居关系和邻居节点链路状态；最后根据接收到的广播消息建立和收集以自身为中心的(N+1)跳的邻居关系和邻居节点链路状态。
根据相关的邻居发现策略，如果网络中的节点要建立和收集(N+1)跳范围内的邻居关系和邻居节点链路状态，需要将收集的1跳邻居关系和邻居节点链路状态在N跳范围内广播。这样一来，大量的冗余信息被广播和转发，增加了网络的系统开销和负担。
发明内容
有鉴于此，本公开提供一种邻居发现方法及节点，以解决邻居发现策略中大量的冗余信息被广播和转发，增加了网络的系统开销和负担的问题。
为解决上述技术问题，本公开提供一种邻居发现方法，应用于第一节点，所述方法包括：
将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
可选地，所述在不同范围内广播不同的邻居列表，包括：
为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
广播携带有所述TTL的至少一个邻居列表。
可选地，所述不同范围包括不同跳数范围，所述在不同范围内广播不同的邻居列表，包括：
在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
可选地，所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表之前，所述方法还包括：
接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
可选地，所述根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级；
根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形 成至少一个邻居列表。
可选地，所述链路质量包括以下的至少一种：
传输速率、信道带宽、丢包率、链路稳定性。
第二方面，还提供了一种邻居发现方法，应用于第二节点，所述方法包括：
接收第三节点发送的邻居列表；
若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
可选地，所述预设条件还包括：
所述第二节点第一次接收到所述邻居列表。
可选地，若所述第二节点第一次接收到所述邻居列表，所述方法还包括：
根据所述邻居列表建立或者更新所述第二节点的邻居关系。
可选地，所述预设条件还包括：
所述邻居列表的生存时间TTL大于1。
可选地，所述转发所述邻居列表，包括：
将所述邻居列表的TTL减1后转发所述邻居列表。
第三方面，还提供了一种节点，所述节点为第一节点，包括处理器、收发机、存储器及存储在所述存储器上并可在所述处理器上运行的程序，其中，所述处理器运行所述程序时，具体用于：
将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
通过所述收发机在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
可选地，所述处理器，具体用于：
为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
通过所述收发机广播携带有所述TTL的至少一个邻居列表。
可选地，所述不同范围包括不同跳数范围，所述处理器，具体用于：
通过所述收发机在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
可选地，所述处理器，还用于：
通过所述收发机接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
所述处理器，具体用于：
根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
可选地，所述处理器，具体用于：
根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级；
根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
可选地，所述链路质量包括以下的至少一种：
传输速率、信道带宽、丢包率、链路稳定性。
第四方面，还提供了一种节点，所述节点为第二节点，包括处理器、收发机、存储器及存储在所述存储器上并可在所述处理器上运行的程序，其中，所述处理器运行所述程序时，具体用于：
通过所述收发机接收第三节点发送的邻居列表；
若满足预设条件，通过所述收发机转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
可选地，所述预设条件还包括：
所述第二节点第一次接收到所述邻居列表。
可选地，若所述第二节点第一次接收到所述邻居列表，所述处理器还用 于：
根据所述邻居列表建立或者更新所述第二节点的邻居关系。
可选地，所述预设条件还包括：
所述邻居列表的生存时间TTL大于1。
可选地，所述处理器，具体用于：
将所述邻居列表的TTL减1后，通过所述收发机转发所述邻居列表。
第五方面，还提供了一种节点，所述节点为第一节点，所述第一节点包括：
分类模块，用于将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
广播模块，用于在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
第六方面，还提供了一种节点，所述节点为第二节点，所述第二节点包括：
接收模块，用于接收第三节点发送的邻居列表；
发送模块，用于若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
第七方面，还提供了一种计算机可读存储介质，所述计算机可读存储介质上存储有计算机程序，所述计算机程序被处理器执行时实现上述邻居发现方法中第一节点执行的步骤；或者，所述计算机程序被处理器执行时实现上述邻居发现方法中第二节点执行的步骤。
在本公开的一些实施例中，所述邻居发现方法将第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。这样，所述邻居发现方法对1跳邻居节点进行 分类，形成不同质量等级的邻居列表，并根据邻居列表的质量等级控制邻居列表的广播范围，能够减少邻居发现过程中交互的数据量，降低网络的系统开销和负担。
附图说明
图1为本公开的一些实施例的邻居发现方法的流程图之一；
图2为本公开的一些实施例的邻居发现方法的流程图之二；
图3为本公开的一些实施例提供的一种网络拓扑结构示意图；
图4为图3所示的网络拓扑中节点16的局域拓扑结构示意图；
图5为图3所示的网络拓扑中节点10的局域拓扑结构示意图；
图6为本公开的一些实施例的第一节点的示意图之一；
图7为本公开的一些实施例的第二节点的示意图之一；
图8为本公开的一些实施例的第一节点的示意图之二；
图9为本公开的一些实施例的第二节点的示意图之二；
图10为本公开的一些实施例的第一节点的示意图之三；以及
图11为本公开的一些实施例的第二节点的示意图之三。
具体实施方式
下面将结合附图和实施例，对本公开的具体实施方式作进一步详细描述。以下实施例用于说明本公开，但不用来限制本公开的范围。
本申请的说明书和权利要求书中的术语“包括”以及它的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。此外，说明书以及权利要求中使用“和/或”表示所连接对象的至少其中之一，例如A和/或B，表示包含单独A，单独B，以及A和B都存在三种情况。
在本公开实施例中，“示例性的”或者“例如”等词用于表示作例子、例证或说明。本公开实施例中被描述为“示例性的”或者“例如”的任何实施例或设计方案不应被解释为比其它实施例或设计方案更优选或更具优势。 确切而言，使用“示例性的”或者“例如”等词旨在以具体方式呈现相关概念。
本文所描述的技术不限于新的无线通信系统(New RAT,NR)，并且也可用于各种无线通信系统，诸如长期演进型(Long Time Evolution，LTE)/LTE的演进(LTE-Advanced，LTE-A)系统、码分多址(Code Division Multiple Access，CDMA)、时分多址(Time Division Multiple Access，TDMA)、频分多址(Frequency Division Multiple Access，FDMA)、正交频分多址(Orthogonal Frequency Division Multiple Access，OFDMA)、单载波频分多址(Single-carrier Frequency-Division Multiple Access，SC-FDMA)和其他系统。术语“系统”和“网络”常被可互换地使用。CDMA系统可实现诸如CDMA2000、通用地面无线电接入(Universal Terrestrial Radio Access，UTRA)等无线电技术。UTRA包括宽带CDMA(Wideband Code Division Multiple Access，WCDMA)和其他CDMA变体。TDMA系统可实现诸如全球移动通信系统(Global System for Mobile Communication，GSM)之类的无线电技术。OFDMA系统可实现诸如超移动宽带(Ultra Mobile Broadband，UMB)、演进型UTRA(Evolution-UTRA，E-UTRA)、IEEE 802.11(Wi-Fi)、IEEE802.16(WiMAX)、IEEE 802.20、Flash-OFDM等无线电技术。UTRA和E-UTRA是通用移动电信系统(Universal Mobile Telecommunications System，UMTS)的部分。LTE和更高级的LTE(如LTE-A)是使用E-UTRA的新UMTS版本。UTRA、E-UTRA、UMTS、LTE、LTE-A、NR以及GSM在来自名为“第三代伙伴项目”(3rd Generation Partnership Project，3GPP)的组织的文献中描述。CDMA2000和UMB在来自名为“第三代伙伴项目2”(3GPP2)的组织的文献中描述。本文所描述的技术既可用于以上提及的系统和无线电技术，也可用于其他系统和无线电技术。
需要说明的是，本公开的一些实施例提到的节点为任意拥有唯一网络地址的设备，例如可以为工作站、终端设备、服务器、传感器设备等，本公开实施例对节点的具体类型不做限定。
参见图1，图1是本公开的一些实施例提供的邻居发现方法的流程图之一，参见图1，该邻居发现方法的执行主体为第一节点，具体步骤如下：
步骤101、将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级。
步骤102、在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
本实施例中，所述第一节点将1跳邻居节点进行分类，形成至少一个邻居列表，并在不同范围内广播不同的邻居列表，其中，每一邻居列表包括至少一个1跳邻居节点，不同邻居列表的质量等级不相同，质量等级越低的邻居列表的广播范围越小。所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级。所述第一节点为无线网络中的任意节点。
所述第一节点可以在邻居侦听过程中确定所述第一节点的1跳邻居节点，即所述第一节点可以根据自身状态和获得的邻居交互数据确定1跳邻居节点，并对1跳邻居节点进行分类。具体地，所述第一节点可以接收邻居节点发送的邻居交互数据，并根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，然后根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
所述第一节点可以在确定自身满足发送邻居交互数据的条件时，在不同范围内广播不同的邻居列表，其中，质量越低的邻居列表的广播范围越小。所述发送邻居交互数据的条件可以包括节点获得网络同步，和/或当前时间为所述节点周期性发送邻居交互数据的时间。相应地，若所述第一节点获得网络同步，和/或当前时间为所述第一节点周期性发送邻居交互数据的时间，所述第一节点确定自身满足发送邻居交互数据的条件，并在不同范围内广播不同的邻居列表。
所述在不同范围内广播不同的邻居列表可以包括：为不同质量等级的邻居列表设置不同的TTL(Time To Live，生存时间)，并广播携带有所述TTL的至少一个邻居列表，其中，质量等级越低的邻居列表的TTL越小。所述在不同范围内广播不同的邻居列表也可以包括：在M跳范围内广播质量等级为 M的邻居列表，其中，M为非负整数。
需要说明的是，本实施例中提到的广播邻居列表为尝试向广播范围内所有节点发送邻居列表，而邻居列表的实际传输范围还受到节点之间链路质量的影响，即因节点之间链路质量的影响，广播范围内的一些节点可能无法接收到广播的邻居列表。
本实施例中，所述邻居发现方法将第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。这样，所述邻居发现方法对1跳邻居节点进行分类，形成不同质量等级的邻居列表，并根据邻居列表的质量等级控制邻居列表的广播范围，能够减少邻居发现过程中交互的数据量，降低网络的系统开销和负担。
可选地，所述在不同范围内广播不同的邻居列表，包括：
为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
广播携带有所述TTL的至少一个邻居列表。
该实施例中，所述在不同范围内广播不同的邻居列表，具体包括：为不同质量等级的邻居列表设置不同的生存时间TTL，并广播携带有所述TTL的至少一个邻居列表，其中，质量等级越低的邻居列表的TTL越小。
可以理解的是，邻居列表每被转发一次，其TTL会减1，当TTL不大于1时，该邻居列表不会被继续转发。因此，该实施方式中，所述邻居发现方法通过为不同的邻居列表设置不同的TTL实现在不同范围内广播不同的邻居列表。
可选地，所述不同范围包括不同跳数范围，所述在不同范围内广播不同的邻居列表，包括：
在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
该实施例中，不同范围包括不同跳数范围，所述在不同范围内广播不同的邻居列表，具体包括在M跳范围内广播质量等级为M的邻居列表，其中M为非负整数。
举例而言，所述第一节点可以在0跳范围内广播质量等级为0的邻居列表，即不发送质量等级为0的邻居列表；在1跳范围内广播质量等级为1的邻居列表，在2跳范围内广播质量等级为2的邻居列表。
可以理解的是，质量等级为M的邻居列表内的节点与所述第一节点之间的链路质量等级为M。
可选地，所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表之前，所述方法还包括：
接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
该实施例中，所述第一节点根据接收到的邻居交互数据对所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。具体地，所述第一节点接收其他节点发送的邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，并评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，然后根据链路质量将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
具体地，所述第一节点可以根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级。然后根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
需要说明的是，本公开一些实施方式中，所述第一节点还可以在广播邻居列表的同时，广播邻居列表中每一节点与所述第一节点之间的链路质量，这样，方便接收到所述邻居列表的节点建立与所述第一节点的邻居关系，以及收集与所述第一节点之间的链路质量。
具体地，所述第一节点可以将邻居列表携带在邻居交互数据中进行广播， 所述邻居交互数据还可以包括邻居列表中每一节点与所述第一节点之间的链路质量。本公开一些实施方式中，所述邻居交互数据中还可以携带所述第一节点信息，这样，方便接收到所述邻居列表的节点确定发送该邻居列表的源节点。
可选地，所述根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级；
根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
该实施例中，所述第一节点可以按照链路质量将链路划分为不同的等级，进而按照节点之间的链路质量等级的不同将1跳邻居节点进行分类，形成不同质量等级的邻居列表。具体地，所述第一节点首先根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量划分为不同的链路质量等级，然后根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
举例而言，假设节点i为第一节点，若节点i接收到节点j、k、m发送的邻居交互数据，所述节点i根据接收到的邻居交互数据评估节点间的链路状态，即评估链路S(j，i)、S(k，i)、S(m，i)的状态，将链路质量划分为(L+1)个等级，其中，最低等级为0，最高等级为N，数值越大表示链路质量越好。所述节点i获取节点j、k、m的节点信息I(j)、I(k)、I(m)，并根据划分链路质量等级将节点j、k、m进行分类，形成至少一个邻居列表。
本公开一些实施方式中，所述第一节点还判断是否第一次接收到邻居交互数据，若为第一次接收到所述邻居交互数据，所述第一节点对所述邻居交互数据进行处理；相反地，若不为第一次接收到所述邻居交互数据，则所述第一节点直接丢弃所述邻居交互数据，不进行后续处理。
可选地，所述链路质量包括以下的至少一种：
传输速率、信道带宽、丢包率、链路稳定性。
所述链路质量为链路好坏的表征，所述链路质量可以用传输速率、信道带宽、丢包率和链路稳定性中的一种或者多种指标表示。
参考图2，图2本公开的一些实施例提供邻居发现方法的流程图之二，如图2所示，所述邻居发现方法的执行主体为第二节点，具体包括以下步骤：
步骤201、接收第三节点发送的邻居列表。
步骤202、若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
该实施例中，所述第二节点接收第三节点发送的邻居列表，并在满足预设条件的情况下，转发所述邻居列表。其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。所述第二节点可以根据所述第三节点发送的数据包评估所述第三节点与所述第二节点之间的链路质量，例如可以根据所述第三节点发送的邻居列表评估所述第三节点与所述第二节点之间的链路质量。可以理解的是，本公开一些实施例中，所述第二节点还可以通过其他方式评估所述第三节点与所述第二节点之间的链路质量，并不限定于上述根据所述第三节点发送的数据包进行评估的方式。
所述第二节点可以为与所述第一节点相同的节点，也可以为与所述第一节点不相同的节点。具体地，当所述第二节点为与所述第一节点相同的节点时，所述第三节点为不同于所述第一节点和所述第二节点的节点；当所述第二节点为与所述第一节点不相同的节点时，所述第三节点可以为与所述第一节点相同的节点，也可以为与所述第一节点不相同的节点。所述邻居列表可以为与图1所示的实施例中描述的邻居列表，也可以为与图1所示的实施例中描述的邻居列表不相同的邻居列表。具体地，当所述第三节点为与所述第一节点相同的节点时，该实施例中提到的邻居列表可以为与图1所示的实施例中描述的邻居列表。
所述第三节点可以仅向所述第二节点发送邻居列表，所述第二节点直接 接收所述第三节点发送的邻居列表；所述第三节点也可以向所述第二节点发送携带有邻居列表的邻居交互数据，所述第二节点接收所述第三节点发送的邻居交互数据，并获取邻居列表。可以理解的是，所述邻居交互数据还可以包括所述邻居列表内节点与源节点的链路质量。本公开一些实施方式中，所述邻居交互数据还携带有发送该邻居交互数据的源节点信息，和/或转发所述邻居交互数据的中继节点信息，这样，所述第二节点可以根据所述邻居交互数据建立邻居关系。
所述第二节点在接收到所述第三节点发送的邻居列表之后，可以判断是否满足预设条件，若满足预设条件，所述第二节点转发所述邻居列表。具体地，所述第二节点获取所述第三节点与所述第二节点之间的链路质量，并判断所述第三节点与所述第二节点之间的链路质量等级是否不低于所述邻居列表的质量等级。若所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述第二节点转发所述邻居列表。即所述第二节点仅转发质量等级低于所述第三节点与所述第二节点之间的链路质量等级的邻居列表。
本实施例中，所述第二节点接收第三节点发送的邻居列表；若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。这样，所述第二节点有条件地转发接收到的邻居列表，避免邻居发现过程中不必要的数据转发，减小邻居发现过程中的数据冗余，并通过分布式的处理减轻了网络中节点的数据收发负担。
可选地，所述预设条件还包括：
所述第二节点第一次接收到所述邻居列表。
该实施例中，所述预设条件还包括所述第二节点第一次接收到所述邻居列表。具体地，若所述第二节点第一次接收到所述邻居列表，且所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述第二节点转发所述邻居列表。相反地，若所述第二节点非第一次接收到所述邻居列表，所述第二节点丢弃该邻居列表，不做后续处理。
可以理解的是，当所述第二节点第一次接收到所述邻居列表时，所述第二节点已经对该邻居列表进行了处理，该实施例中，若所述第二节点非第一次接收到所述邻居列表，丢弃该邻居列表，不做后续处理，能够有效减小数据的冗余，减轻节点的传输负担。
可选地，若所述第二节点第一次接收到所述邻居列表，所述方法还包括：
根据所述邻居列表建立或者更新所述第二节点的邻居关系。
该实施例中，若所述第二节点第一次接收到所述邻居列表，所述第二节点根据所述邻居列表建立或者更新所述第二节点的邻居关系，这样，所述第二节点通过接收和转发其他节点发送的不同等级的邻居列表，建立以自身为中心的局域邻居关系，收集与邻居之间的链路状态，完成邻居建立。通过持续的接收和转发邻居交互数据，维护已经建立的邻居关系，更新收集的链路状态，进行邻居维护，从而通过分布式的工作方式构建以自身为中心的不同质量等级的局域邻居拓扑。
可选地，所述预设条件还包括：
所述邻居列表的生存时间TTL大于1。
该实施例中，所述预设条件还包括所述邻居列表的TTL大于1。可以理解的是，当发送所述邻居列表的源节点通过设置TTL控制所述邻居列表的传输范围时，所述邻居列表每被转发一次，其TTL减1，当其TTL不大于1时，不再继续对所述邻居列表进行转发，这样能够实现对邻居列表传输范围的控制。该实施例中，所述第二节点仅在所述邻居列表的TTL大于1时转发所述邻居列表，在所述邻居列表的TTL不大于1时不转发所述邻居列表。
可选地，所述转发所述邻居列表，包括：
将所述邻居列表的TTL减1后转发所述邻居列表。
该实施例中，若满足所述预设条件，所述第二节点将所述邻居列表的TTL减1后转发所述邻居列表。
通过上述图1和图2所示的实施例，节点通过持续地发送、接收和转发邻居交互数据，建立或维护以自身为中心的局域邻居拓扑，收集或更新邻居节点的链路状态，从而实现邻居的建立和维护。本公开的一些实施例适用于双向传输链路的网络，也适用于单向传输链路的网络。
本公开的一些实施例中适用于无线网络，网络中的节点独立收集1跳邻居节点，建立不同等级的邻居列表，结合节点之间的链路质量和需要转发的数据包含的信息，有条件地转发其他节点发送的邻居交互数据，对需要转发的数据进行处理和/或过滤，构造以自身为中心的不同质量等级的局域邻居拓扑，能够减少邻居发现过程中交互的数据量，降低网络的系统开销和负担。
以下结合具体实例对本公开的邻居发现方法进行举例说明，假设无线网络中节点之间的连接关系如图3所示，节点数量为16个，现假设图3所示的网络具有以下的约束条件：
节点的位置保持不变；
传输链路均为双向链路，且任意两个节点之间的发送链路和接收链路的状态相同；
链路质量分为3个等级，即N＝2，并用图3所示的连接线上的数字表示链路质量等级；
邻居列表的传输范围用数据传输跳数表示，且等于邻居列表的质量等级。
网络中的节点在完成邻居侦听后，获得邻居节点信息和节点间的链路状态，并对自身的1跳邻居节点进行分类，形成至少一个邻居列表。例如，节点16的1跳邻居节点包括节点14、节点1和节点10，与节点16之间的链路质量等级分别为0、1、2，该节点16可以将1跳邻居节点划分为质量等级为0的邻居列表A(包括节点14)、质量等级为1的邻居列表B(包括节点1)和质量等级为2的邻居列表C(包括节点10)。节点10的1跳邻居节点包括节点16、节点2、节点5、节点3和节点7，根据各节点与节点10之间的链路质量等级，该节点10可以将其1跳邻居节点划分为质量等级为1的邻居列表D(包括节点2和节点5)，和质量等级为2的邻居列表E(包括节点16、节点3和节点7)。
节点可以在M跳范围内广播质量等级为M的邻居列表，即不广播质量等级为0的邻居列表，在1跳范围内广播质量等级为1的邻居列表，在2跳范围内广播质量等级为2的邻居列表。相应地，节点16可以不发送邻居列表A，在1跳范围内广播邻居列表B(例如将邻居列表B的TTL设置为1)，在2跳范围内广播邻居列表C(例如将邻居列表C的TTL设置为2)。节点10 可以在1跳范围内广播邻居列表D(例如将邻居列表D的TTL设置为1)，在2跳范围内广播邻居列表E(例如将邻居列表E的TTL设置为2)。
此外，邻居列表的实际传输范围还受到节点之间的链路质量的影响，节点在确定是否需要转发其他节点发送的邻居列表时，需要比较自身到上一跳节点之间的链路质量等级与邻居列表质量等级的关系，只转发质量等级低于自身与上一跳节点之间的链路质量等级的邻居列表。例如，节点1能够收到节点16发送的邻居列表B和邻居列表C，根据TTL判断需要继续转发邻居列表C，节点1到节点16之间的链路质量等级为1，邻居列表C的质量等级为2，节点1到节点16之间的链路质量等级低于邻居列表C，因此，节点1不再转发邻居列表C。节点10能够收到节点16发送的邻居列表B和邻居列表C，根据TTL的大小确定需要转发邻居列表C，节点10到节点16之间的链路质量等级为2，不低于邻居列表C的质量等级，因此节点10将邻居列表C的TTL减去1后转发该邻居列表C，进而其邻居节点3、节点5、节点7和节点2能够接收到该邻居列表C。
同理，网络中的其他所有节点都按照上述规则发送和转发邻居列表，经过持续的发送和接收邻居列表，节点可以通过分布式算法建立不同质量等级的局域邻居拓扑。例如在如图3所示的网络拓扑中，节点16建立的局域拓扑如图4所示，节点10建立的局域拓扑如图5所示。
可见，通过建立不同等级的邻居列表，有条件地转发其他节点发送的邻居列表，网络中的节点能够构造以自身为中心的不同质量等级的邻居关系。一个节点是否能够被其他节点发现，即一个节点能够收集的邻居节点的数量和范围，取决于节点间单跳或者多跳链路的质量。
参见图6，本公开的一些实施例还提供了一种节点，所述节点为第一节点600，该第一节点600包括处理器601、收发机602、存储器603及存储在所述存储器603上并可在所述处理器601上运行的程序。
所述收发机602可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元，所述收发机602用于在所述处理器601的控制下接收和发送数据；
将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其 中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
通过所述收发机602在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
可选地，所述处理器601，具体用于：
为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
通过所述收发机602广播携带有所述TTL的至少一个邻居列表。
可选地，所述不同范围包括不同跳数范围，所述处理器601，具体用于：
通过所述收发机602在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
可选地，所述处理器601，还用于：
通过所述收发机602接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
所述处理器601，具体用于：
根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
可选地，所述处理器601，具体用于：
根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级；
根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
可选地，所述链路质量包括以下的至少一种：
传输速率、信道带宽、丢包率、链路稳定性。
需要说明的是，本公开的一些实施例提供的第一节点能够实现图1的方法实施例中的各个过程，其实现原理和技术效果类似，本实施例此处不再赘述。
参见图7，本公开的一些实施例还提供了一种节点，所述节点为第二节 点700，该第二节点700包括处理器701、收发机702、存储器703及存储在所述存储器703上并可在所述处理器701上运行的计算机程序。
所述收发机702可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元，所述收发机702用于在所述处理器701的控制下接收和发送数据；
通过所述收发机702接收第三节点发送的邻居列表；
若满足预设条件，通过所述收发机702转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
可选地，所述预设条件还包括：
所述第二节点第一次接收到所述邻居列表。
可选地，若所述第二节点第一次接收到所述邻居列表，所述处理器701还用于：
根据所述邻居列表建立或者更新所述第二节点的邻居关系。
可选地，所述预设条件还包括：
所述邻居列表的生存时间TTL大于1。
可选地，所述处理器701，具体用于：
将所述邻居列表的TTL减1后，通过所述收发机702转发所述邻居列表。
需要说明的是，本公开的一些实施例提供的第二节点能够实现图2的方法实施例中的各个过程，其实现原理和技术效果类似，本实施例此处不再赘述。
参见图8，本公开还提供一种节点，所述节点为第一节点800，如图8所示，所述第一节点800包括：
分类模块801，用于将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
广播模块802，用于在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
需要说明的是，本公开的一些实施例提供的第一节点能够实现图1的方法实施例中的各个过程，其实现原理和技术效果类似，本实施例此处不再赘述。
参见图9，本公开还提供一种节点，所述节点为第二节点900，如图9所示，所述第二节点900包括：
接收模块901，用于接收第三节点发送的邻居列表；
发送模块902，用于若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
需要说明的是，本公开的一些实施例提供的第二节点能够实现图2的方法实施例中的各个过程，其实现原理和技术效果类似，本实施例此处不再赘述。
如图10所示，图10所示的第一节点1000包括：至少一个处理器1001、存储器1002、至少一个用户接口1003和网络接口1004。第一节点1000中的各个组件通过总线系统1005耦合在一起。可理解，总线系统1005用于实现这些组件之间的连接通信。总线系统1005除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。但是为了清楚说明起见，在图10中将各种总线都标为总线系统1005。
其中，用户接口1003可以包括显示器、键盘或者点击设备(例如，鼠标，轨迹球(trackball)、触感板或者触摸屏等。
可以理解，本公开的一些实施例中的存储器1002可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器 (Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data rate SDRAM，DDRSDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DRRAM)。本公开实施例描述的系统和方法的存储器1002旨在包括但不限于这些和任意其它适合类型的存储器。
在一些实施方式中，存储器1002保存了如下的元素，可执行模块或者数据结构，或者他们的子集，或者他们的扩展集：操作系统10021和应用程序10022。
其中，操作系统10021，包含各种系统程序，例如框架层、核心库层、驱动层等，用于实现各种基础业务以及处理基于硬件的任务。应用程序10022，包含各种应用程序，例如媒体播放器(Media Player)、浏览器(Browser)等，用于实现各种应用业务。实现本公开实施例方法的程序可以包含在应用程序10022中。
在本公开的一个实施例中，通过调用存储器1002保存的程序或指令，具体的，可以是应用程序10022中保存的程序或指令，执行时实现上述邻居发现方法中第一节点执行的各个步骤。
本公开的一些实施例提供的第一节点，可以执行上述邻居发现方法实施例中第一节点执行的步骤，其实现原理和技术效果类似，本实施例此处不再赘述。
如图11所示，图11所示的第二节点1100包括：至少一个处理器1101、存储器1102、至少一个用户接口1103和网络接口1104。第二节点1100中的各个组件通过总线系统1105耦合在一起。可理解，总线系统1105用于实现这些组件之间的连接通信。总线系统1105除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。但是为了清楚说明起见，在图11中将各种总线都标为总线系统1105。
其中，用户接口1103可以包括显示器、键盘或者点击设备(例如，鼠标，轨迹球(trackball)、触感板或者触摸屏等。
可以理解，本公开的一些实施例中的存储器1102可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器(Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data rate SDRAM，DDRSDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DRRAM)。本公开的一些实施例描述的系统和方法的存储器1102旨在包括但不限于这些和任意其它适合类型的存储器。
在一些实施方式中，存储器1102保存了如下的元素，可执行模块或者数据结构，或者他们的子集，或者他们的扩展集：操作系统11021和应用程序11022。
其中，操作系统11021，包含各种系统程序，例如框架层、核心库层、驱动层等，用于实现各种基础业务以及处理基于硬件的任务。应用程序11022，包含各种应用程序，例如媒体播放器(Media Player)、浏览器(Browser)等，用于实现各种应用业务。实现本公开实施例方法的程序可以包含在应用程序11022中。
在本公开的一个实施例中，通过调用存储器1102保存的程序或指令，具体的，可以是应用程序11022中保存的程序或指令，执行时实现上述邻居发现方法中第二节点执行的各个步骤。
本公开的一些实施例提供的第二节点，可以执行上述邻居发现方法实施例中第二节点执行的步骤，其实现原理和技术效果类似，本实施例此处不再赘述。
本公开的一些实施例还提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时可以实现本公开的一些实施例提供的邻居发现方法中所述第一节点执行的的步骤；或者，所述计算机程序被处理器执行时实现上述邻居发现方法中所述第二节点执行的步骤。
在本申请所提供的几个实施例中，应该理解到，所揭露方法和装置，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理包括，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能单元的形式实现。
上述以软件功能单元的形式实现的集成的单元，可以存储在一个计算机可读取存储介质中。上述软件功能单元存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开各个实施例所述邻居发现方法的部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，简称ROM)、随机存取存储器(Random Access Memory，简称RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
可以理解的是，本公开实施例描述的这些实施例可以用硬件、软件、固件、中间件、微码或其组合来实现。对于硬件实现，模块、单元、子模块、子单元等可以实现在一个或多个专用集成电路(Application Specific Integrated Circuits，ASIC)、数字信号处理器(Digital Signal Processing，DSP)、数字信号处理设备(DSP Device，DSPD)、可编程逻辑设备(Programmable Logic Device，PLD)、现场可编程门阵列(Field-Programmable Gate Array，FPGA)、通用处理器、控制器、微控制器、微处理器、用于执行本公开所述功能的其它电子单 元或其组合中。
对于软件实现，可通过执行本公开实施例所述功能的模块(例如过程、函数等)来实现本公开实施例所述的技术。软件代码可存储在存储器中并通过处理器执行。存储器可以在处理器中或在处理器外部实现。
因此，本公开的目的还可以通过在任何计算装置上运行一个程序或者一组程序来实现。所述计算装置可以是公知的通用装置。因此，本公开的目的也可以仅仅通过提供包含实现所述方法或者装置的程序代码的程序产品来实现。也就是说，这样的程序产品也构成本公开，并且存储有这样的程序产品的存储介质也构成本公开。显然，所述存储介质可以是任何公知的存储介质或者将来所开发出来的任何存储介质。还需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行。某些步骤可以并行或彼此独立地执行。
以上所述是本公开的可选实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本公开所述原理的前提下，还可以作出若干改进和润饰，这些改进和润饰也应视为本公开的保护范围。

Claims (25)

  1. 一种邻居发现方法，应用于第一节点，包括：
    将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
    在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
  2. 根据权利要求1所述的邻居发现方法，其中，所述在不同范围内广播不同的邻居列表，包括：
    为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
    广播携带有所述TTL的至少一个邻居列表。
  3. 根据权利要求1所述的邻居发现方法，其中，所述不同范围包括不同跳数范围，所述在不同范围内广播不同的邻居列表，包括：
    在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
  4. 根据权利要求1所述的邻居发现方法，其中，所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表之前，所述方法还包括：
    接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
    所述将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
    根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
  5. 根据权利要求4所述的邻居发现方法，其中，所述根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，包括：
    根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间 的链路划分为不同的链路质量等级；
    根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
  6. 根据权利要求4或5所述的邻居发现方法，其中，所述链路质量包括以下的至少一种：
    传输速率、信道带宽、丢包率、链路稳定性。
  7. 一种邻居发现方法，应用于第二节点，包括：
    接收第三节点发送的邻居列表；
    若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
  8. 根据权利要求7所述的邻居发现方法，其中，所述预设条件还包括：
    所述第二节点第一次接收到所述邻居列表。
  9. 根据权利要求8所述的邻居发现方法，其中，若所述第二节点第一次接收到所述邻居列表，所述方法还包括：
    根据所述邻居列表建立或者更新所述第二节点的邻居关系。
  10. 根据权利要求7或8所述的邻居发现方法，其中，所述预设条件还包括：
    所述邻居列表的生存时间TTL大于1。
  11. 根据权利要求10所述的邻居发现方法，其中，所述转发所述邻居列表，包括：
    将所述邻居列表的TTL减1后转发所述邻居列表。
  12. 一种节点，所述节点为第一节点，包括处理器、收发机、存储器及存储在所述存储器上并可在所述处理器上运行的程序，其中，所述处理器运行所述程序时，具体用于：
    将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
    通过所述收发机在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
  13. 根据权利要求12所述的节点，其中，所述处理器，具体用于：
    为不同质量等级的邻居列表设置不同的生存时间TTL，其中，质量等级越低的邻居列表的TTL越小；
    通过所述收发机广播携带有所述TTL的至少一个邻居列表。
  14. 根据权利要求12所述的节点，其中，所述不同范围包括不同跳数范围，所述处理器，具体用于：
    通过所述收发机在M跳范围内广播质量等级为M的邻居列表，其中，M为非负整数。
  15. 根据权利要求12所述的节点，其中，所述处理器，还用于：
    通过所述收发机接收邻居交互数据，根据所述邻居交互数据确定所述第一节点的1跳邻居节点，以及评估所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量；
    所述处理器，具体用于：
    根据所述第一节点的1跳邻居节点分别与所述第一节点之间的链路质量，将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
  16. 根据权利要求15所述的节点，其中，所述处理器，具体用于：
    根据链路质量将所述第一节点的1跳邻居节点分别与所述第一节点之间的链路划分为不同的链路质量等级；
    根据划分的链路质量等级将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表。
  17. 根据权利要求15或16所述的节点，其中，所述链路质量包括以下的至少一种：
    传输速率、信道带宽、丢包率、链路稳定性。
  18. 一种节点，所述节点为第二节点，包括处理器、收发机、存储器及存储在所述存储器上并可在所述处理器上运行的程序，其中，所述处理器运行所述程序时，具体用于：
    通过所述收发机接收第三节点发送的邻居列表；
    若满足预设条件，通过所述收发机转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
  19. 根据权利要求18所述的节点，其中，所述预设条件还包括：
    所述第二节点第一次接收到所述邻居列表。
  20. 根据权利要求19所述的节点，其中，若所述第二节点第一次接收到所述邻居列表，所述处理器还用于：
    根据所述邻居列表建立或者更新所述第二节点的邻居关系。
  21. 根据权利要求18或19所述的节点，其中，所述预设条件还包括：
    所述邻居列表的生存时间TTL大于1。
  22. 根据权利要求21所述的节点，其中，所述处理器，具体用于：
    将所述邻居列表的TTL减1后，通过所述收发机转发所述邻居列表。
  23. 一种节点，所述节点为第一节点，其中，所述第一节点包括：
    分类模块，用于将所述第一节点的1跳邻居节点进行分类，形成至少一个邻居列表，其中，不同邻居列表的质量等级不相同，所述邻居列表的质量等级为所述邻居列表内的节点与所述第一节点之间的链路质量等级；
    广播模块，用于在不同范围内广播不同的邻居列表，其中，质量等级越低的邻居列表的广播范围越小。
  24. 一种节点，所述节点为第二节点，其中，所述第二节点包括：
    接收模块，用于接收第三节点发送的邻居列表；
    发送模块，用于若满足预设条件，转发所述邻居列表，其中，所述预设条件至少包括所述第三节点与所述第二节点之间的链路质量等级不低于所述邻居列表的质量等级，所述邻居列表的质量等级为所述邻居列表内的节点与发送所述邻居列表的源节点之间的链路质量等级。
  25. 一种计算机可读存储介质，其中，所述计算机可读存储介质上存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1至6中任一项所述的邻居发现方法中的步骤；
    或者，所述计算机程序被处理器执行时实现如权利要求7至11中任一项 所述的邻居发现方法中的步骤。
PCT/CN2020/081308 2019-04-03 2020-03-26 邻居发现方法及节点 WO2020200021A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910265792.8 2019-04-03
CN201910265792.8A CN111787591B (zh) 2019-04-03 2019-04-03 一种邻居发现方法及节点

Publications (1)

Publication Number Publication Date
WO2020200021A1 true WO2020200021A1 (zh) 2020-10-08

Family

ID=72664889

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/081308 WO2020200021A1 (zh) 2019-04-03 2020-03-26 邻居发现方法及节点

Country Status (2)

Country Link
CN (1) CN111787591B (zh)
WO (1) WO2020200021A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117098161B (zh) * 2023-10-18 2024-01-05 西安蜂语信息科技有限公司 数据传输方法、装置、网络设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101499975A (zh) * 2009-02-27 2009-08-05 中国人民解放军信息工程大学 一种实现分组交换网络业务传输QoS保证的方法及系统
US20130121178A1 (en) * 2011-11-11 2013-05-16 Itron, Inc. Routing communications based on link quality
US20150016452A1 (en) * 2013-07-10 2015-01-15 Kabushiki Kaisha Toshiba Communication node device, communication system, communication control method and computer-readable program product
CN106028413A (zh) * 2015-03-20 2016-10-12 北京信威通信技术股份有限公司 一种基于邻接稳定等级的分簇路由方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8693322B2 (en) * 2012-02-21 2014-04-08 Yikun Zhang Routing method for a wireless multi-hop network
CN105050156A (zh) * 2015-06-18 2015-11-11 中国科学院上海微系统与信息技术研究所 无线自组织网络中的单向链路通告方法
CN107370677B (zh) * 2016-05-12 2021-01-26 西安三星电子研究有限公司 节点确定路径生存时间的方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101499975A (zh) * 2009-02-27 2009-08-05 中国人民解放军信息工程大学 一种实现分组交换网络业务传输QoS保证的方法及系统
US20130121178A1 (en) * 2011-11-11 2013-05-16 Itron, Inc. Routing communications based on link quality
US20150016452A1 (en) * 2013-07-10 2015-01-15 Kabushiki Kaisha Toshiba Communication node device, communication system, communication control method and computer-readable program product
CN106028413A (zh) * 2015-03-20 2016-10-12 北京信威通信技术股份有限公司 一种基于邻接稳定等级的分簇路由方法

Also Published As

Publication number Publication date
CN111787591B (zh) 2022-11-11
CN111787591A (zh) 2020-10-16

Similar Documents

Publication Publication Date Title
CN107852362B (zh) 网格网络系统和方法
US11445430B2 (en) Data forwarding method and apparatus
US11290942B2 (en) System and method for independent dominating set (IDS) based routing in mobile AD hoc networks (MANET)
US10965584B1 (en) Zero-overhead data initiated AnyCasting
TW201818743A (zh) 無線網狀網路路由方法與無線節點
US20200344664A1 (en) Relay routing method and communication node
US20190327134A1 (en) Mission critical push notification in high-reliability information centric network
EP3314951B1 (en) Enhanced peer discovery in a mesh network
US10205665B2 (en) Mesh network nodes configured to alleviate congestion in cellular network
WO2020200021A1 (zh) 邻居发现方法及节点
CN105072586B (zh) 嵌入式无线自组织网络中对广播消息的转发的管理方法
CN104053208B (zh) 无线自组网中基于信道分配的路由方法、装置
Gadallah et al. ECTP: Enhanced Collection Tree Protocol for practical wireless sensor network applications
WO2023070633A1 (zh) 一种d2d通信方法
Barz et al. Extending OLSRv2 for tactical applications
US11451469B2 (en) On-demand table and route update after a node failure in a wireless network
US11304084B1 (en) System and method for beacon-based passive clustering in mobile ad hoc networks (MANET)
US20200252832A1 (en) Packet Sending Method and Packet Sending Apparatus
Yassein et al. New adaptive counter based broadcast using neighborhood information in manets
Kim et al. Link-state routing protocol for multi-channel multi-interface wireless networks
US11296966B2 (en) System and method for efficient information collection and distribution (EICD) via independent dominating sets
Saadi et al. An adaptive approach to control broadcast traffic in wireless mesh networks based IEEE 802.11 s
TWI714987B (zh) 無線連線方法
Azzuhri et al. Evaluating the performance impact of protocol parameters on ad-hoc network routing protocols
Zuhairi et al. AODV routing protocol in heterogeneous networks

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: 20784627

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: 20784627

Country of ref document: EP

Kind code of ref document: A1