WO2015077940A1

WO2015077940A1 - Sink node routing method and node device

Info

Publication number: WO2015077940A1
Application number: PCT/CN2013/087956
Authority: WO
Inventors: 刘培
Original assignee: 华为技术有限公司
Priority date: 2013-11-27
Filing date: 2013-11-27
Publication date: 2015-06-04
Also published as: CN104813640A; CN104813640B

Abstract

Provided in an embodiment of the present invention are a Sink node routing method and node device, the node device comprising: a threshold calculating module for calculating a node degree threshold of the node itself according to node parameters; a node screening module for discarding some of the neighbor nodes of all the neighbor nodes according to the node degree threshold and the node parameters of all neighbor nodes, and identifying the remaining neighbor nodes as Sink routing forwarding nodes; and a routing request module for transmitting a Sink routing forwarding request to the Sink routing forwarding node. The embodiment of the present invention enables a node device to find a Sink node accurately and effectively while conserving energy.

Description

Sink node routing method and node device

Technical field

The present invention relates to the field of communications, and in particular, to a Sink node routing method and a node device. Background technique

IETF (Internet Engineering Task Force), ROLL (Distributed Over Low power and Lossy Networks) Working Group in RFC6550 Version 6, Internet Protocol 6th Edition) Wireless Sensor Network In the RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks low-power loss network IPv6 routing protocol) routing mechanism, the construction of the Destination Oriented Directed Acyclic Graph (DODAG) is established for the RPL route establishment. Define, and describe the overall mechanism of the RPL protocol. According to the definition, the root node (fixed node) broadcasts a DIO (DOD AG Information Object) message, and the node that receives the DIO message sequentially joins the graph and broadcasts the DIO message to the surrounding nodes, and finally forms a network extension as shown in FIG. Park is a non-loop diagram. The RPL protocol stipulates that the network consists of multiple directed acyclic graphs, and each directed acyclic graph is constructed by following different object functions (Object Function, OF). Each acyclic graph distributes a certain number of nodes. The root node and other sensor nodes form a tree-structured network, and each sensor node is connected to its parent node. When the sensor node needs to send data to the root node, the node directly sends the data up to its own parent node. After receiving the data, the parent node sends the data up to its own parent node, and finally sends the data to the root node. The shortcomings of this program are:

1) The default root node of the RPL routing mechanism is a fixed node, and the frequent data to the root node makes the nodes around the root node consume too much energy, and finally forms an energy hole around the root node, thereby affecting the performance of the RPL route.

2) Each node in the network belongs to a specific directed acyclic graph. When there are many nodes deployed in the network, the energy consumption for maintaining the directed acyclic graph becomes larger.

The use of mobile Sink (sink) nodes can better solve the above problems, but in the existing use shift In the case of a mobile Sink, the sensor node searches for a mobile Sink node through a flooded broadcast routing request, and the node's energy consumption is too large. Moreover, the manner of flooding the broadcast routing request increases the number of routing request messages. If multiple source nodes in the network are looking for the sink node at the same time, collisions are likely to occur, causing network congestion. Summary of the invention

The technical problem to be solved by the embodiments of the present invention is to provide a Sink node routing method and a node device, so that the node device can accurately and efficiently find the Sink node under the condition of saving energy.

A first aspect of the embodiments of the present invention provides a node device, where the node device includes: a threshold calculation module, configured to calculate a node degree threshold of the node according to the node parameter; and a node screening module, configured to use the node threshold and the node threshold The node parameters of all neighbor nodes discard some neighbor nodes among all neighbor nodes, and determine the remaining neighbor nodes as Sink routing forwarding nodes;

The routing request module is configured to send a Sink routing forwarding request to the Sink routing forwarding node. In a first possible implementation manner of the first aspect, the node parameter includes: a node degree of all neighbor nodes of the own node and/or a hop count of the source node of the self-node to the current Sink route search.

With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner, the node degree threshold is +0 5 , where r _max is a neighbor node with the largest node degree

The node degree is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum search hop count. With reference to the first aspect and the first or second possible implementation manner of the first aspect, in a third possible implementation, the node screening module includes:

And a threshold screening unit, configured to discard a neighbor node whose node degree is less than the node degree threshold.

With reference to the first aspect, and the first or the second or the third possible implementation manner of the first aspect, in the fourth possible implementation, the node screening module includes:

a reference node selection unit, configured to be used in a neighbor node whose node degree is not less than the node degree threshold Selecting a neighbor node with the largest degree of node as the reference node;

And a direction filtering unit, configured to discard the neighbor node that meets the discarding condition with the number of the common neighbor nodes of the reference node in the neighboring node whose node degree is not less than the node degree threshold.

In conjunction with the fourth possible implementation of the first aspect, in a fifth possible implementation manner of the first aspect, the discarding condition includes:

The ratio of the number of co-neighbor nodes to the reference node to the node degree of the neighbor node does not exceed a preset threshold.

With reference to the fourth or fifth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the reference node selecting unit is further configured to: And a neighboring node that is smaller than the node degree threshold, after the neighboring node that meets the discarding condition of the number of the common neighboring nodes of the reference node is discarded, the reference node is determined as the Sink routing forwarding node, and in the remaining Determining, by the neighboring node whose node degree is not less than the node degree threshold, a neighboring node having the largest node degree as a new reference node, and triggering the direction screening unit to be a neighbor node whose node degree is not less than the node degree threshold The middle node and the neighboring node whose number of co-neighbor nodes of the new reference node satisfy the discard condition are discarded.

With reference to the sixth possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, the reference node selecting unit is further configured to: when only one neighbor node having a node degree not less than the node degree threshold is remaining When the node is a node, the neighboring node whose node degree is not less than the node degree threshold is determined as the sink routing forwarding node.

With reference to the first aspect, and the first to the seventh possible implementation manners of the first aspect, in the eighth possible implementation manner of the first aspect, the node device further includes:

a node confirmation module, configured to: when determining that the self node is not a slot node or a slot node member of the sink node, triggering the node screening module to discard part of all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes Neighbor node, and the remaining neighbor nodes are determined as Sink routing forwarding nodes.

A second aspect of the embodiments of the present invention provides a node device, where the node device includes a network interface, a memory, and a processor, where the memory stores a set of program codes, and the processor is configured to call the storage in the memory. Program code, used to do the following: Calculating a node degree threshold of the own node according to the node parameter;

And discarding a part of neighbor nodes in all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes, and determining the remaining neighbor nodes as Sink routing forwarding nodes;

Sending a Sink routing forwarding request to the Sink routing forwarding node through the network interface. A third aspect of the embodiments of the present invention provides a Sink node routing method, where the method includes: calculating a node degree threshold of a self node according to a node parameter;

Sending a Sink route forwarding request to the Sink routing forwarding node.

In a first possible implementation manner of the third aspect, the node parameter includes: a node degree of all neighbor nodes of the own node and/or a hop count of the source node of the current node to the current Sink route search.

With reference to the first possible implementation manner of the third aspect, in a second possible implementation manner of the third aspect, the calculating, according to the node degree of all neighbor nodes, and the hop count of the source node of the current node to the current Sink route search Node degree threshold, where r _max is the neighbor with the largest node degree

The node degree of the node is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum number of hops. With reference to the third aspect and the first or second possible implementation manner of the third aspect, in a third possible implementation manner, the discarding part of all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes Neighbor nodes, and determining the remaining neighbor nodes as Sink routing forwarding nodes include:

A neighbor node whose node degree is less than the node degree threshold is discarded.

With reference to the third aspect and the first or second or third possible implementation manner of the third aspect, in a fourth possible implementation, the node parameter according to the node degree threshold and all neighbor nodes are in all neighbor nodes The partial neighbor nodes are discarded, and the remaining neighbor nodes are determined as Sink routing forwarding nodes, including:

In a neighbor node whose node degree is not less than the node degree threshold, the neighbor with the largest node degree is selected. The living node serves as a reference node;

And in the neighboring node whose node degree is not less than the node degree threshold, the neighbor node that satisfies the discarding condition with the number of the common neighbor nodes of the reference node is discarded.

In conjunction with the fourth possible implementation of the third aspect, in a fifth possible implementation, the discarding condition includes:

With reference to the fourth or fifth possible implementation manner of the third aspect, in a sixth possible implementation manner, the neighboring node that is not less than the node degree threshold is not associated with the reference node After the neighbor node whose number of common neighbor nodes meets the discard condition is discarded, it also includes:

And determining, by the reference node, the Sink routing forwarding node, and selecting a neighbor node with the largest node degree as a new reference node among the remaining neighbor nodes whose node degree is not less than the node degree threshold;

52. The remaining neighboring nodes whose node degrees are not less than the node degree threshold are discarded by neighboring nodes that satisfy the discarding condition with the number of co-neighbor nodes of the new reference node.

With reference to the sixth possible implementation manner of the third aspect, in a seventh possible implementation manner, S1 and S2 are repeatedly performed, and when only one neighbor node whose node degree is not less than the node degree threshold is remaining, the node degree is not A neighbor node that is smaller than the node degree threshold is determined to be the Sink route forwarding node.

With reference to the third aspect, and the first to the seventh possible implementation manners of the third aspect, in the eighth possible implementation manner of the third aspect, the calculating, before the calculating the node degree threshold of the self node according to the node parameter, the method further includes:

Determine the acyclic graph member node whose own node is not a Sink node or a Sink node.

A fourth aspect of the embodiments of the present invention further provides a computer storage medium, where the computer storage medium stores a program, and the program includes all or part of the steps of the Sink node routing method provided by the third aspect of the embodiment of the present invention. .

The node device in the embodiment of the present invention calculates the node degree threshold by using the parameter of the node, so that the neighbor node that satisfies the condition can be adaptively selected according to the distribution of the network node, and the neighbor node that meets the threshold condition is subjected to secondary screening. Help energy-saving equipment to find accurate and effective The Sink node avoids the problem that the neighbor nodes are densely concentrated in the same direction, reduces the sending of the Sink routing request information, and reduces the system consumption. DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly described below. Obviously, the drawings in the following description are only some embodiments of the present invention. Other drawings may also be obtained from those of ordinary skill in the art based on these drawings without the inventive labor.

1 is a schematic structural diagram of a node device according to an embodiment of the present invention;

2 is a schematic structural diagram of a node screening module in an embodiment of the present invention;

3 is a schematic structural diagram of a node device according to another embodiment of the present invention;

4 is a schematic flowchart of a Sink node routing method in an embodiment of the present invention; FIG. 5 is a schematic flowchart of a Sink node routing method in another embodiment of the present invention; FIG. 6 is another embodiment of the present invention. A schematic diagram of a Sink node routing method; FIG. 8 is a schematic structural diagram of a wireless sensor network in the embodiment of the present invention. detailed description

BRIEF DESCRIPTION OF THE DRAWINGS The technical solutions in the embodiments of the present invention will be described in detail below with reference to the accompanying drawings. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative work are within the scope of the present invention.

The embodiment of the present invention can be implemented in a wireless sensor network, and can be applied to an IPv6 wireless sensor network that is moved by a Sink node. In the case of reducing network overhead, in order to ensure the reliability of data transmission, the node device is configured to find a Sink node. The problem.

1 is a schematic structural diagram of a node device according to an embodiment of the present invention. As shown in the figure, the node device in the embodiment may include at least:

The threshold calculation module 110 is configured to calculate a node degree threshold of the self node according to the node parameter. In a specific implementation, the threshold calculation module 110 may calculate a node degree threshold of the node according to the node degree of all neighbor nodes of the own node and the hop count of the source node that the node searches for the current sink route. _Max is the largest neighbor of the node

The node degree of the neighboring node is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum number of hops, which may be, for example, a preset based on the network. The maximum number of lookup hops for adaptive multicast lookup. It should be noted that the algorithm of the node degree threshold is only an example. In other optional embodiments, the threshold calculation module 110 may calculate the node degree threshold by other means, for example, according to the average value of the node degrees of all neighbor nodes. The node degree threshold is calculated, or the node degree threshold is calculated according to the degree of self node degree and h/h _max , etc., and the implementation of the present invention should not be considered to be limited by the node degree threshold algorithm described above.

The node screening module 120 is configured to discard a part of neighbor nodes among all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes, and determine the remaining neighbor nodes as Sink routing nodes. The node parameters of the neighbor nodes may include the degree of nodes of each neighbor node, and may also include the number of common neighbor nodes between all neighbor nodes.

In a specific implementation, the node screening module 120 may further include:

The threshold screening unit 121 is configured to discard the neighbor node whose node degree is less than the node degree threshold. Specifically, the threshold screening unit 121 may compare the node degrees of all the neighbor nodes of the self node with the node degree threshold calculated by the threshold calculation module 110, and discard the neighbor nodes whose node degrees are smaller than the node degree threshold, and the retention node degree is not A neighbor node that is less than the node degree threshold.

Further optionally, the node screening module 120 may further include:

The reference node selecting unit 122 is configured to select, as the reference node, a neighbor node with the largest degree of node among the neighbor nodes whose node degree is not less than the node degree threshold. Specifically, if there are multiple neighbor nodes with the largest degree of node, the reference node selecting unit 122 may randomly select one of them as the reference node. The direction screening unit 123 is configured to discard the neighbor node that meets the discarding condition with the number of the common neighbor nodes of the reference node in the neighboring node whose node degree is not less than the node degree threshold.

Specifically, the direction screening unit 123 may compare the reference node with the neighbor nodes whose other node degrees are not less than the node degree threshold, and compare the number of the common neighbor nodes one by one, and if the number of the common neighbor nodes meets the preset discarding condition, The neighbor node is discarded. Exemplarily, the discarding condition may include: a ratio of a number of co-neighbor nodes to the reference node to a node degree of the neighboring node does not exceed a preset threshold (eg, 50%), and may include, for example, the reference node The number of common neighbor nodes is not greater than a preset threshold, etc. (such as 5).

The reference node selection unit 122 is further configured to: in the neighboring node whose node degree is not less than the node degree threshold, the direction selection unit 123 satisfies the discarding condition with the number of co-neighbor nodes of the reference node. After the neighboring node discards, the reference node is determined as the Sink routing forwarding node, and a neighbor node with the largest node degree is selected as a new reference among the remaining neighboring nodes whose node degrees are not less than the node degree threshold. a node, and triggering the direction selection unit to discard the neighbor node that meets the discarding condition with the number of the common neighbor nodes of the new reference node in the neighbor node whose node degree is not less than the node degree threshold.

The reference node selection unit 122 is further configured to determine, when only one neighbor node whose node degree is not less than the node degree threshold, the neighbor node whose node degree is not less than the node degree threshold as the Sink route forwarding node.

After filtering the neighbor nodes of the self node by all or part of the threshold filtering unit 121, the reference node selecting unit 122, and the direction filtering unit 123, the node screening module 120 may determine the neighbor node that is finally reserved as the sink. Route forwarding node. begging. . Optionally, the node device in the embodiment of the present invention may further include:

The node confirmation module 140 is configured to trigger, when determining that the self node is not a sink node or a ring node member node of the sink node, the node screening module 120 is configured in all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes. Partial neighbor nodes are discarded, and the remaining neighbor nodes are determined as Sink routing forwarding nodes. For example, in the system structure of the wireless sensor network as shown in FIG. 8, when The node device confirms that the sink route forwarding request needs to be forwarded. For example, when the node device itself needs to send data to the sink route, or receives a Sink route forwarding request forwarded by another node device, the node confirmation module 140 first determines whether the node is If the anode node of the Sink node or the sink node is a sink node, if the node is confirmed to be a sink node, the source node of the sink routing request is returned with a response message, and if the node is confirmed to be a ring graph member node of the sink node, The data may be sent up to the parent node according to the directed acyclic graph (as shown in FIG. 7) according to the RPL route, and then sent upward to the sink node, if and only if it is determined that the node is not a sink node or a sink. When the acyclic graph member node of the node triggers, the node screening module 120 discards a part of the neighbor nodes in all neighbor nodes according to the node degree threshold and the node parameters of all neighbor nodes, and determines the remaining neighbor nodes as the Sink route forwarding. node.

The node device in the embodiment of the present invention calculates the node degree threshold by using the parameter of the node, so that the neighbor node that satisfies the condition can be adaptively selected according to the distribution of the network node, and the neighbor node that meets the threshold condition is subjected to secondary screening. The power saving device can accurately and efficiently find the sink node, and avoids the problem that the neighbor nodes are densely concentrated in the same direction, reduces the sending of the Sink routing request information, and reduces the system consumption.

FIG. 3 is a schematic structural diagram of a node device according to another embodiment of the present invention. As shown in FIG. 3, the user terminal 300 may include: at least one processor 301, such as a CPU, at least one network interface 303. The memory 304 is at least one communication bus 302. Among them, the communication bus 302 is used to implement connection communication between these components. The network interface 303 of the node device in the embodiment of the present invention may be a wireless interface, for example, including an antenna device, for signaling or data communication with other node devices. The memory 304 can be a high speed RAM memory or a non-unstable memory.

(non-volatile memory), such as at least one disk storage. The memory 304 can optionally also be at least one storage device located remotely from the aforementioned processor 301. A set of program code is stored in the memory 304, and the processor is configured to call program code stored in the memory for performing the following operations:

Calculating a node degree threshold of the own node according to the node parameter;

Sending a Sink routing forwarding request to the Sink routing forwarding node through the network interface 303. The following describes the flow of the method for implementing the Sink node routing in the node device of the present invention by using a specific embodiment. It should be noted that the following embodiments may be implemented by using the node device described in conjunction with FIG. 1 or FIG. All or part of the process.

4 is a schematic flowchart of a method for routing a Sink node in the embodiment of the present invention. The flow of the Sink node routing method in this embodiment may include:

S401. Calculate a node degree threshold of the own node according to the node parameter.

Specifically, when the node device confirms that the Sink routing forwarding request needs to be forwarded, for example, the node device itself needs to send data to the Sink route, or receives a Sink routing forwarding request forwarded by another node device, the node device may according to the node itself. The Node Degree of all neighbor nodes and the hop count of the source node of the current node to the current Sink route lookup calculate the node degree threshold of the own node, and the node degree threshold, where r _max is the neighbor with the largest node degree

The node degree of the neighboring node is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum number of hops, which may be, for example, a preset based on the network. The maximum number of lookup hops for adaptive multicast lookup. It should be noted that the foregoing algorithm for the node degree threshold is only an example. In other optional embodiments, the node device may calculate the node degree threshold by other means, for example, calculating the node according to the average value of the node degrees of all neighbor nodes. The degree threshold, or the node degree threshold is calculated based on the degree of self-node degrees and h/h _max , etc., and the implementation of the present invention should not be considered to be limited by the node degree threshold algorithm described above.

S402. Discard a part of neighbor nodes in all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes, and determine the remaining neighbor nodes as Sink route forwarding nodes. The node parameters of the neighbor nodes may include the node degrees of the respective neighbor nodes, and may also include the number of common neighbor nodes between all the neighbor nodes.

In a specific implementation, the power saving device may compare the node degrees of all neighbor nodes of the own node with the node degree threshold calculated in step S401, and discard the neighbor nodes whose node degrees are smaller than the node degree threshold, and the reserved node degree is not less than a neighbor node that describes the node threshold, which in turn can be retained The incoming neighbor node is determined to be a Sink routing forwarding node. In other optional embodiments, the neighbor nodes whose node degrees are not less than the node degree threshold may be further filtered, and some of the neighbor nodes are determined as the sink route forwarding node.

S403. Send a Sink route forwarding request to the Sink routing forwarding node.

Optionally, the Sink node routing method in the embodiment of the present invention may further include: before calculating the node degree threshold of the self node according to the node parameter, first determining that the node is not a Sink node or a ring graph member node of the Sink node. For example, in the system structure of the wireless sensor network shown in FIG. 8, when the node device confirms that the sink route forwarding request needs to be forwarded, for example, the node needs to send data to the sink node, or receives the forwarding from other node devices. When the Sink routes the forwarding request, it first determines whether the own node is a non-ring graph member node of the sink node or the sink node. If it is confirmed that the self node is a sink node, the source node that forwards the request to the sink route returns a response message, if it confirms itself If the node is a ring-free graph member node of the sink node, the data can be sent up to the parent node according to the directed acyclic graph (as shown in FIG. 7) according to the RPL route, and then sent to the sink node in turn, when And only when determining that the self node is not a sink node or a ring graph member node of the sink node, triggering calculation of a node degree threshold of the own node according to the node parameter, and according to the node degree threshold and node parameters of all neighbor nodes in all neighbor nodes Discarding some of the neighbor nodes, thereby determining the remaining neighbor nodes as Sink routing forwarding node.

The node device in the embodiment of the present invention calculates the node degree threshold by using the parameter of the node, so that the neighbor node that satisfies the condition can be adaptively selected according to the distribution of the network node, so that the power saving device can accurately and effectively find the sink node. The sending of Sink routing request information is reduced, and system consumption is reduced.

FIG. 5 is a schematic flowchart of a Sink node routing method in another embodiment of the present invention. The Sink node routing method in this embodiment includes:

S501. Calculate a node degree threshold of the own node according to the node parameter.

Specifically, when the node device confirms that the Sink routing forwarding request needs to be forwarded, for example, the node device itself needs to send data to the Sink route, or receives a Sink routing forwarding request forwarded by another node device, the node device may according to the node itself. The Node Degree of all neighbor nodes and the hop count of the source node of the self-node to the current Sink route lookup Node degree threshold.

S502: A neighbor node whose node degree is less than the node degree threshold is discarded.

S503, in a neighbor node whose node degree is not less than the node degree threshold, select a neighbor node with the largest node degree as the reference node. Specifically, if there are multiple neighbor nodes with the largest degree of node, one of them may be randomly selected as the reference node.

S504, in the neighboring node whose node degree is not less than the node degree threshold, discarding the neighbor node that meets the discarding condition with the number of common neighbor nodes of the reference node.

In a specific implementation, the reference node may compare the number of the common neighbor nodes with the neighbor nodes whose node degrees are not less than the node degree threshold, and if the number of the common neighbor nodes meets the preset discarding condition, the neighbor node is compared. give up. Exemplarily, the discarding condition may include: the ratio of the number of co-neighbor nodes to the reference node to the node degree of the neighboring node does not exceed a preset threshold (eg

50%), for example, may include the number of co-neighbor nodes with the reference node not greater than a preset threshold or the like (eg, 5).

S505: Determine the remaining neighbor nodes as Sink routing forwarding nodes, and send a Sink routing forwarding request to the Sink routing forwarding node.

The node device in the embodiment of the present invention calculates the node degree threshold by using the parameter of the node, so that the neighbor node that satisfies the condition can be adaptively selected according to the distribution of the network node, and the neighbor node that meets the threshold condition is subjected to secondary screening. Helps the power-saving device to accurately and efficiently find the Sink node, and avoids the problem that the neighbor nodes are concentrated in the same direction, which reduces the sending of the Sink routing request information and reduces the system consumption.

FIG. 6 is a schematic flowchart of a Sink node routing method in another embodiment of the present invention. The Sink node routing method in this embodiment is as follows:

S601: Determine an acyclic graph member node whose own node is not a sink node or a sink node.

Specifically, for example, in the system structure of the wireless sensor network shown in FIG. 8, when the node device confirms that the sink route forwarding request needs to be forwarded, for example, the node needs to send data to the sink node, or receives other nodes. When the device forwards the Sink route forwarding request, it first determines whether the own node is a Sink node or a ring chart member node of the Sink node. If it is confirmed that the own node is a Sink node, the source node that returns the request to the Sink route returns a response message. If you confirm your own node As the acyclic graph member node of the sink node, the data may be sent up to the parent node according to the directed acyclic graph (as shown in FIG. 7) according to the RPL route, and then sent to the sink node in turn, when determining When the self node is not a Sink node or an acyclic graph member node of the Sink node, the following steps in this embodiment are performed.

S602. Calculate a node degree threshold of the own node according to the node parameter.

Specifically, when the node device confirms that the Sink routing forwarding request needs to be forwarded, for example, the node device itself needs to send data to the Sink route, or receives a Sink routing forwarding request forwarded by another node device, the node device may according to the node itself. The Node Degree of all neighbor nodes and the hop count of the source node from the self node to the current Sink route lookup calculate the node degree threshold of the own node.

S603: A neighbor node whose node degree is less than the node degree threshold is discarded.

5604. In the neighbor node whose remaining node degree is not less than the node degree threshold, select one neighbor node with the largest node degree as the reference node. Specifically, if there are multiple neighbor nodes with the largest degree of node, one of them may be randomly selected as the reference node.

S605. In the neighboring node whose node degree is not less than the node degree threshold, the neighbor node that meets the discarding condition with the number of the common neighbor nodes of the reference node is discarded.

S606, determining the reference node as the Sink routing forwarding node.

S607: Determine whether there is only one neighbor node whose node degree is not less than the node degree threshold. If yes, execute S608, otherwise return to execution S604~S606.

In a specific implementation, all the neighbor nodes that are not less than the node degree threshold obtained after the S603 may be placed in the forwarding node candidate set, and the neighbor nodes are discarded from each time S604~S606, and the selected reference node is selected. Put in the forwarding node set, when the forwarding node candidate set is only left When the remaining node whose node degree is not less than the node degree threshold is performed, S608 is performed.

S608: Determine, as the Sink routing forwarding node, the remaining neighboring node whose node degree is not less than the node degree threshold.

S609: Send a Sink route forwarding request to the Sink routing forwarding node.

The embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a program, and the program execution includes some or all of the Sink node routing methods described in the embodiment of the present invention in conjunction with FIG. 4 to FIG. A step of.

Through the description of the above embodiments, those skilled in the art can clearly understand that the present invention can be implemented by hardware implementation, firmware implementation, or a combination thereof. When implemented in software, the functions described above may be stored in or transmitted as one or more instructions or code on a computer readable medium. Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another. A storage medium may be any available media that can be accessed by a computer. By way of example and not limitation, computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure. The desired program code and any other medium that can be accessed by the computer. Also. Any connection may suitably be a computer readable medium. For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable , fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwaves are included in the fixing of the associated media. As used in the present invention, a disk and a disc include a compact disc (CD), a laser disc, a disc, a digital versatile disc (DVD), a floppy disk, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. The above combination should also be included in the computer The scope of protection of the readable medium.

The above is only the preferred embodiment of the present invention, and the scope of the present invention is not limited thereto, and the equivalent changes made by the claims of the present invention are still within the scope of the present invention.

Claims

Rights request

A node device, the node device comprising:

a threshold calculation module, configured to calculate a node degree threshold of the self node according to the node parameter; a node screening module, configured to discard a part of the neighbor nodes in all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes, and the remaining The neighbor node is determined to be a Sink routing forwarding node;

The routing request module is configured to send a Sink routing forwarding request to the Sink routing forwarding node.

2. The node device according to claim 1, wherein the node parameter comprises: a node degree of all neighbor nodes of the self node and/or a hop count of the source node of the own node to the current Sink route search.

3. The node device according to claim 2, wherein the node degree threshold

K = ( Γ max - Τ匪 · ) , where r _max is the node of the neighbor node with the largest degree of node

Degree, which is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum search hop count.

The node device according to any one of claims 1 to 3, wherein the node screening module comprises:

The node device according to any one of claims 1 to 4, wherein the node screening module comprises:

a reference node selecting unit, configured to: in a neighbor node whose node degree is not less than the node degree threshold, select a neighbor node with the largest node degree as a reference node;

a direction screening unit, configured to: in the neighbor node whose node degree is not less than the node degree threshold, A neighbor node that satisfies the discarding condition with the number of co-neighbor nodes of the reference node is discarded.

The node device according to claim 5, wherein the discarding condition comprises: a ratio of a number of co-neighbor nodes to the reference node to a node degree of the neighboring node does not exceed a preset threshold.

7. The node device according to claim 5 or 6, wherein

The reference node selecting unit is further configured to: in the neighboring node whose node degree is not less than the node degree threshold, the neighboring node that satisfies the discarding condition with the number of co-neighbor nodes of the reference node After the discarding, the reference node is determined as the Sink routing forwarding node, and a neighbor node with the largest node degree is selected as a new reference node among the remaining neighbor nodes whose node degree is not less than the node degree threshold. And triggering the direction screening unit to discard the neighbor node that meets the discarding condition with the number of the common neighbor nodes of the new reference node in the neighboring node whose node degree is not less than the node degree threshold.

8. The node device of claim 7, wherein

And the reference node selecting unit is further configured to determine, when only one neighbor node whose node degree is not less than the node degree threshold, the neighbor node whose node degree is not less than the node degree threshold as the Sink routing forwarding node .

The node device according to any one of claims 1 to 8, wherein the node device further comprises:

a node confirmation module, configured to: when determining that the self node is not a slot node or a slot node member of the sink node, triggering the node screening module to discard part of all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes Neighbor nodes, and the remaining neighbor nodes are determined as Sink routing forwarding nodes. Node device, characterized in that the node device comprises a network interface, a memory And a processor, wherein the memory stores a set of program codes, and the processor is configured to call the program code stored in the memory to perform the following operations:

Sending a Sink routing forwarding request to the Sink routing forwarding node through the network interface.

A method for routing a Sink node, the method comprising:

Determining a part of neighbor nodes in all neighbors according to the node degree threshold and node parameters of all neighbor nodes, and determining the remaining neighbor nodes as Sink routing forwarding nodes;

Sending a Sink route forwarding request to the Sink routing forwarding node.

The Sink node routing method according to claim 11, wherein the node parameters include: a node degree of all neighbor nodes of the own node and/or a hop count of the source node of the self-node to the current sink route search. .

The Sink node routing method according to claim 12, wherein the calculating the node degree threshold of the self node according to the node degree of all the neighbor nodes and the hop count of the source node of the self-node to the current sink route search includes : Node degree threshold +0.5 where T _max is the neighbor with the largest node degree

The node degree of the neighboring node, 7, is the node degree of the neighbor node with the smallest node degree, h is the hop count of the own node to the source node, and h _max is the preset maximum search hop count

The Sink node routing method according to any one of claims 11 to 13, wherein the node parameter according to the node degree threshold and all neighbor nodes are in all neighbor nodes. Abandoning a part of the neighboring node, and determining the remaining neighboring node as the sink routing forwarding node includes: discarding the neighboring node whose node degree is less than the node degree threshold.

The Sink node routing method according to any one of claims 11 to 14, wherein the partial neighbor nodes are discarded in all neighbor nodes according to the node degree threshold and node parameters of all neighbor nodes, and Determining the remaining neighbor nodes as Sink routing forwarding nodes includes:

And selecting, in the neighboring node whose node degree is not less than the node degree threshold, a neighboring node having the largest node degree as the reference node;

The Sink node routing method according to claim 15, wherein the discarding condition comprises:

The Sink node routing method according to claim 15 or 16, wherein, in the neighbor node whose node degree is not less than the node degree threshold, the number of co-neighbor nodes with the reference node After the neighbor nodes that satisfy the discard condition are discarded, they also include:

S1, the reference node is determined as the Sink routing forwarding node, and a neighbor node with the largest node degree is selected as a new reference node among the remaining neighbor nodes whose node degrees are not less than the node degree threshold;

S2. The remaining neighbor nodes whose node degrees are not less than the node degree threshold are discarded by the neighbor nodes whose number of co-neighbor nodes of the new reference node meets the discarding condition.

The Sink node routing method according to claim 17, wherein S1 and S2 are repeatedly executed, and when only one neighbor node whose node degree is not less than the node degree threshold is remaining, the node degree is not less than the The neighbor node of the node degree threshold is determined to be the Sink route forwarding node. The Sink node routing method according to any one of claims 11 to 18, wherein before the calculating the node degree threshold of the self node according to the node parameter, the method further includes:

A computer storage medium, characterized in that said computer storage medium stores a program, and said program execution comprises the steps of any one of claims 11 to 19.