CN115834464A - Communication method of network node and related device - Google Patents
Communication method of network node and related device Download PDFInfo
- Publication number
- CN115834464A CN115834464A CN202111095210.XA CN202111095210A CN115834464A CN 115834464 A CN115834464 A CN 115834464A CN 202111095210 A CN202111095210 A CN 202111095210A CN 115834464 A CN115834464 A CN 115834464A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- information
- nodes
- network
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a communication method of a network node and a related device in the technical field of communication. In the technical scheme provided by the application, the network comprises a first node, the first node stores a first routing table, the first routing table comprises routing information among nodes in a first node set in the network, and the first node set comprises the first node. After receiving a first routing query message, a first node queries whether a first routing table contains routing information of a destination node, and sends a first routing response query message to a source node under the condition that the first routing table contains the routing information of the destination node, wherein the first routing response query message is used for requesting to query the routing information from the source node to the destination node and comprises the first routing information. According to the technical scheme, the query efficiency of the routing information of the network node is improved, and the communication efficiency of the network node is improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a communication method for a network node and a related apparatus.
Background
When any two nodes (one is a source node and the other is a destination node) in a device-to-device (D2D) network communicate, the source node in any two nodes queries the routing tables of all nodes in the D2D network to obtain one or more routes from the source node to the destination node. If only one route from the source node to the destination node is obtained, the communication from the source node to the destination node is directly realized according to the route; if a plurality of routes from the source node to the destination node are obtained, an optimal path is determined by executing a routing algorithm, and then the communication from the source node to the destination node is realized according to the optimal path. However, in this method, the efficiency of determining the route by the source node in the D2D network is low, so that the communication efficiency of the D2D network node is low, and resources are wasted.
Therefore, how to improve the communication efficiency of the network node by improving the efficiency of the network node for determining the route becomes an urgent problem to be solved.
Disclosure of Invention
The application provides a communication method and a related device of a network node, which improve the query efficiency of routing information of the network node and further improve the communication efficiency of the network node.
In a first aspect, the present application provides a communication method for a network node, where the network includes a first node, the first node stores a first routing table, the first routing table includes routing information between nodes in a first set of nodes in the network, the first set of nodes includes the first node, and the method includes: the first node receives a first routing query message, wherein the first routing query message is used for requesting to query routing information from a source node to a destination node; the first node inquires whether the first routing table contains first routing information of the destination node; and under the condition that the first routing table contains the routing information of the destination node, the first node sends a first routing response query message to the source node, wherein the first routing response query message comprises the first routing information.
The method comprises the steps that a network comprises a first node, the first node stores a first routing table, the first routing table comprises routing information among nodes in a first node set in the network, the first node set comprises the first node, when the routing information from a source node to a destination node is inquired in the network, the first node receives a first routing inquiry message, the first routing inquiry message is used for requesting to inquire the routing information from the source node to the destination node, the first node inquires whether the first routing table contains the routing information of the destination node or not, under the condition that the first routing table contains the routing information of the destination node, the first node sends a first routing response inquiry message to the source node, the first routing response inquiry message comprises the first routing information, one or more routes from the source node to the destination node are obtained compared with the routing tables from the source node inquiry equipment to all nodes in the equipment network, when the plurality of routes from the source node to the destination node are obtained, an optimal route is determined through executing a routing algorithm, then the routing efficiency from the source node to the destination node is realized according to the routing tables of the optimal route, the communication efficiency of the source node is improved, and the communication efficiency of the network node is improved.
In a possible implementation manner, the source node is a node in the first node set, and accordingly, the first routing information includes routing information from the source node to the destination node.
In this implementation manner, when the source node is a node in the first node set and the first routing table includes routing information of the destination node, the first routing information includes routing information from the source node to the destination node. That is to say, when the source node and the destination node are both nodes in the first node set, after receiving the first routing query message sent by the source node, the first node queries the routing information from the source node to the destination node in the first routing table, and directly sends the routing information from the source node to the destination node to the source node, so that the query efficiency of the routing information from the source node to the destination node is improved, and meanwhile, the communication efficiency between the source node and the destination node is further improved.
In one possible implementation, the network further includes a second node, where the second node stores a second routing table, the second routing table includes routing information between nodes in a second set of nodes in the network, and the second set of nodes includes the second node; accordingly, the method further comprises: and under the condition that the first routing table does not contain the routing information of the destination node, the first node sends a second routing query message to the second node through a gateway node, wherein the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used for requesting to query the routing information from the source node to the destination node.
In this implementation manner, under the condition that the first routing table does not contain the routing information of the destination node, the first node sends a second routing query message to the second node through the gateway node, where the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used to request to query the routing information from the source node to the destination node. That is to say, when the destination node is not in the first node set, regardless of whether the source node is a node in the first node set, after receiving the first routing query message, the first node forwards the second routing query message to the second node through the gateway node when the routing information of the destination node is not queried in the first routing table, where the second routing query message is obtained by adding a logical port or an address identifier of the first node on the basis of the first routing query message, so that the efficiency of querying the routing information from the source node to the destination node is improved, and meanwhile, the communication efficiency between the source node and the destination node is further improved.
In one possible implementation, the method further includes: the first node receives a second routing response query message forwarded by the gateway node, where the second routing response query message includes routing information from the first node to a third node in the network and routing information of the destination node in a third node set in the network, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node; the first node generates second routing information according to the second routing response query message and the first routing table, wherein the second routing information comprises routing information from the source node to the destination node; and the first node sends the second routing information to the source node.
In this implementation manner, when the source node is a node in the first node set and the destination node is a node in a third node set, the first node receives a second route reply query message forwarded by the gateway node, where the second route reply query message includes routing information between the first node and the third node and routing information of the destination node in the third node set, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node; the first node generates second routing information according to the second routing response query message and the first routing table, wherein the second routing information comprises routing information from the source node to the destination node, and sends the second routing information to the source node, so that the query efficiency of the routing information from the source node to the destination node is improved, and meanwhile, the communication efficiency between the source node and the destination node is further improved.
In a possible implementation manner, the generating, by the first node, the second routing information according to the second route reply query packet and the first routing table includes: the first node combines the routing information between the first node and the third node in the second routing response query message, the routing information between the destination node and the third node in the third routing table, and the routing information between the source node and the first node in the first routing table to obtain the second routing information.
In the implementation manner, the first node obtains the second routing information by combining the routing information from the first node to the third node, the routing information from the destination node to the third node, and the routing information from the source node to the first node, so that the accuracy of the second routing information is improved.
In one possible implementation, the method further includes: the first node receives a second route reply query message forwarded by the gateway node, where the second route reply query message includes route information and third route information between a fourth node in the network and a fifth node in the network, the fourth node is a node in a fourth node set in the network, the fourth node set further includes the source node, the fourth node stores a fourth routing table, the fourth routing table includes route information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes route information between nodes in a fifth node set in the network, the fifth node set includes the fifth node and the destination node, and the third route information includes route information of the destination node in the fifth node set; and the first node forwards the second route response inquiry message.
In the implementation manner, when neither a source node nor a destination node is a node in a first node set, a first node receives a second route reply query message forwarded by a gateway node, where the second route reply query message includes routing information and third routing information between fourth nodes and fifth nodes, the fourth node is a node in a fourth node set, the fourth node set further includes the source node, the fourth node stores a fourth routing table, the fourth routing table includes routing information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes routing information between nodes in the fifth node set, the fifth node set includes the fifth node and the destination node, the third routing information includes routing information of the destination node in the fifth node set, and the first node forwards the second route reply query message, so that query efficiency of the routing information between the source node and the destination node is improved, and communication efficiency of the source node and the destination node is further improved.
In a possible implementation manner, the second routing query packet includes: and the logical port of the first node corresponds to the neighbor node of the first node one by one.
In a possible implementation manner, the network further includes a sixth node, where the sixth node stores a sixth routing table, the sixth routing table includes routing information between nodes in a sixth set of nodes in the network, and the sixth set of nodes includes the sixth node and the source node;
accordingly, the method further comprises: the first node determines first routing information according to the first routing query message and the first routing table, wherein the first routing query message comprises routing information from the sixth node to the first node; and the first node sends the first routing query response message to the sixth node, wherein the first routing query response message comprises the first routing information.
In the implementation manner, under the condition that the source node is a node in the sixth node set and the destination node is a node in the first node set, the first node determines the first routing information according to the first routing query message and the first routing table, and sends the first routing information to the sixth node, so that the query efficiency of the routing information from the source node to the destination node is improved, and meanwhile, the communication efficiency between the source node and the destination node is further improved.
In a possible implementation manner, the determining, by the first node, the first routing information according to the first routing query packet and the first routing table includes: the first node merges the routing information from the sixth node to the first node in the first routing query message with the routing information from the first node to the destination node in the first routing table to obtain the first routing information.
In the implementation manner, the first node obtains the first routing information by combining the routing information from the sixth node to the first node in the first routing query message and the routing information from the first node to the destination node in the first routing table, so that the accuracy of the first routing information is improved.
In one possible implementation, the method further includes: the first node receives first neighbor table information sent by other nodes except the first node in the first node set, wherein the first neighbor table information is used for indicating routing information between the other nodes and the neighbor nodes in the first node set; the first node generates the first routing table based on the first neighbor table information.
In the implementation mode, a first node receives first neighbor table information sent by other nodes except the first node in a first node set, wherein the first neighbor table information is used for indicating routing information between the other nodes and adjacent nodes in the first node set; the first node generates the first routing table based on the first neighbor table information, so that the accuracy of the first routing table is improved, and meanwhile, the accuracy of inquiring the routing information from the source node to the destination node in the network is improved.
In one possible implementation, the method further includes: the first node receives second neighbor table information sent by other nodes except the first node in the first node set, wherein the second neighbor table information is used for updating routing information between the other nodes and the neighbor nodes in the first node set; the first node updates the first routing table based on the second neighbor table information.
In the implementation mode, the first node receives second neighbor table information sent by other nodes except the first node in the first node set, and the second neighbor table information is used for updating routing information between the other nodes and the adjacent nodes in the first node set; the first node updates the first routing table based on the second neighbor table information, so that the accuracy of the first routing table is improved, and meanwhile, the accuracy of inquiring the routing information from the source node to the destination node in the network is improved.
In one possible implementation, the method further includes: the first node receives first message information sent by other nodes except the first node in the first node set, wherein the first message information is used for determining adjacent nodes of the other nodes in the first node set; and the first node generates the first routing table based on the first message information.
In the implementation manner, a first node receives first message information sent by other nodes except the first node in a first node set, wherein the first message information is used for determining adjacent nodes of the other nodes in the first node set; the first node generates the first routing table based on the first message information, so that the accuracy of the first routing table is improved, and meanwhile, the accuracy of inquiring the routing information from the source node to the destination node in the network is improved.
In one possible implementation, the method further includes: the first node receives second message information sent by other nodes except the first node in the first node set, wherein the second message information is used for updating adjacent nodes of the other nodes in the first node set; and the first node updates the first routing table based on the second message information.
In the implementation manner, the first node receives second message information sent by other nodes except the first node in the first node set, and the second message information is used for updating adjacent nodes of the other nodes in the first node set; the first node updates the first routing table based on the second message information, so that the accuracy of the first routing table is improved, and meanwhile, the accuracy of inquiring the routing information from the source node to the destination node in the network is improved.
In one possible implementation, the method further includes: the first node calculates a first node capacity value; the first node sends the first node capability value to other nodes except the first node in the first node set; the first node receives node capability values of other nodes except the first node in the first node set; and the first node determines that the first node is the net head node according to the first node capacity value and the node capacity values of other nodes except the first node in the first node set.
In the implementation mode, the first node is determined to be the head node of the first node set according to the first node capability value of the first node and the node capability values of other nodes except the first node in the first node set, so that the structure of the first node set is more stable, the divided routing area is more stable on the basis, and the occurrence of rerouting caused by node change is reduced.
In one possible implementation, the first node capability value includes one or more of the following characteristic values: and the node degree of the first node, the change rate of the neighbor node, the available electric quantity, the sending power, the available residual bandwidth and the calculation and storage capacity value.
In one possible implementation, the method further includes: the first node sends a first net head declaration message to other nodes except the first node in the first node set, wherein the first net head declaration message is used for indicating that the first node is a net head node of the first node set; and the first node receives a first join message sent by other nodes except the first node in the first node set, wherein the first join message is used for indicating to join the first node set.
In the implementation manner, after the first node is determined to be the head node of the first node set, the first node sends the first head declaration message to other nodes except the first node in the first node set, and receives the first join message sent by other nodes except the first node in the first node set, so that the network grouping efficiency is improved.
In a possible implementation manner, the first node set includes the first node and a node that sends the first join packet to the first node.
In a second aspect, the present application provides a communication device for a network node, the network including a first node storing a first routing table including routing information between nodes in a first set of nodes in the network, the first set of nodes including the first node, the device comprising: a receiving module, configured to receive, by the first node, a first routing query packet, where the first routing query packet is used to request to query routing information from a source node to a destination node; a query module, configured to query, by the first node, whether the first routing table includes the first routing information of the destination node; a sending module, configured to send, by the first node to the source node, a first routing response query packet when the first routing table includes the routing information of the destination node, where the first routing response query packet includes the first routing information.
In a possible implementation manner, the source node is a node in the first node set, and accordingly, the first routing information includes routing information from the source node to the destination node.
In one possible implementation, the network further includes a second node, where the second node stores a second routing table, the second routing table includes routing information between nodes in a second set of nodes in the network, and the second set of nodes includes the second node;
correspondingly, the sending module is further configured to: and under the condition that the first routing table does not contain the routing information of the destination node, the first node sends a second routing query message to the second node through a gateway node, wherein the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used for requesting to query the routing information from the source node to the destination node.
In one possible implementation, the apparatus further includes a processing module, configured to: the first node receives a second routing response query message forwarded by the gateway node, where the second routing response query message includes routing information from the first node to a third node in the network and routing information of the destination node in a third node set in the network, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node; the first node generates second routing information according to the second routing response query message and the first routing table, wherein the second routing information comprises routing information from the source node to the destination node; and the first node sends the second routing information to the source node.
In a possible implementation manner, the processing module is specifically configured to: the first node combines the routing information between the first node and the third node in the second routing response query message, the routing information between the destination node and the third node in the third routing table, and the routing information between the source node and the first node in the first routing table to obtain the second routing information.
In one possible implementation manner, the apparatus further includes a forwarding module, where the forwarding module is configured to: the first node receives a second route reply query message forwarded by the gateway node, where the second route reply query message includes route information and third route information between a fourth node in the network and a fifth node in the network, the fourth node is a node in a fourth node set in the network, the fourth node set further includes the source node, the fourth node stores a fourth routing table, the fourth routing table includes route information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes route information between nodes in a fifth node set in the network, the fifth node set includes the fifth node and the destination node, and the third route information includes route information of the destination node in the fifth node set; and the first node forwards the second route response inquiry message.
In a possible implementation manner, the second routing query packet includes: and the logical port of the first node corresponds to the neighbor node of the first node one by one.
In a possible implementation manner, the network further includes a sixth node, where the sixth node stores a sixth routing table, the sixth routing table includes routing information between nodes in a sixth set of nodes in the network, and the sixth set of nodes includes the sixth node and the source node;
accordingly, the apparatus further comprises a processing module configured to: the first node determines first routing information according to the first routing query message and the first routing table, wherein the first routing query message comprises routing information from the sixth node to the first node; and the first node sends the first routing information to the sixth node.
In a possible implementation manner, the processing module is specifically configured to: the first node merges the routing information from the sixth node to the first node in the first routing query message with the routing information from the first node to the destination node in the first routing table to obtain the first routing information.
In one possible implementation manner, the apparatus further includes a route generation module, and the route generation module is configured to: the first node receives first neighbor table information sent by other nodes except the first node in the first node set, wherein the first neighbor table information is used for indicating routing information between the other nodes and the neighbor nodes in the first node set; the first node generates the first routing table based on the first neighbor table information.
In one possible implementation manner, the route generation module is further configured to: the first node receives second neighbor table information sent by other nodes except the first node in the first node set, wherein the second neighbor table information is used for updating routing information between the other nodes and the neighbor nodes in the first node set; the first node updates the first routing table based on the second neighbor table information.
In one possible implementation manner, the apparatus further includes a route generation module, and the route generation module is configured to: the first node receives first message information sent by other nodes except the first node in the first node set, wherein the first message information is used for determining adjacent nodes of the other nodes in the first node set; and the first node generates the first routing table based on the first message information.
In one possible implementation manner, the route generation module is further configured to: the first node receives second message information sent by other nodes except the first node in the first node set, wherein the second message information is used for updating adjacent nodes of the other nodes in the first node set; and the first node updates the first routing table based on the second message information.
In one possible implementation manner, the apparatus further includes a net preference module, where the net preference module is configured to: the first node calculates a first node capacity value; the first node sends the first node capability value to other nodes except the first node in the first node set; the first node receives node capability values of other nodes except the first node in the first node set; and the first node determines that the first node is the net head node according to the first node capacity value and the node capacity values of other nodes except the first node in the first node set.
In one possible implementation, the first node capability value includes one or more of the following characteristic values: the node degree of the first node, the change rate of the neighbor nodes, the available electric quantity, the sending power, the available residual bandwidth and the calculation and storage capacity value.
In one possible implementation, the network preferred module is further configured to: the first node sends a first net head declaration message to other nodes except the first node in the first node set, wherein the first net head declaration message is used for indicating that the first node is a net head node of the first node set; and the first node receives a first join message sent by other nodes except the first node in the first node set, wherein the first join message is used for indicating to join the first node set.
In a possible implementation manner, the first node set includes the first node and a node that sends the first join packet to the first node.
The beneficial effects of the second aspect and various possible implementations of the second aspect can be seen in the beneficial effects of the first aspect and various possible implementations of the first aspect, and are not described herein again.
In a third aspect, the present application provides a communication device of a network node. The apparatus may include a processor coupled with a memory. Wherein the memory is adapted to store program code and the processor is adapted to execute the program code in the memory to implement the method of the first aspect.
Optionally, the apparatus may further comprise the memory.
In a fourth aspect, the present application provides a chip comprising at least one processor and a communication interface, the communication interface and the at least one processor are interconnected by a line, and the at least one processor is configured to execute a computer program or instructions to perform the method according to the first aspect or any one of the possible implementations thereof.
In a fifth aspect, the present application provides a computer readable medium storing program code for execution by a device, the program code comprising instructions for performing the method according to the first aspect or any one of its possible implementations.
In a sixth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method according to the first aspect or any one of its possible implementations.
In a seventh aspect, the present application provides a computing device comprising at least one processor and a communication interface, the communication interface and the at least one processor being interconnected by a line, the communication interface being in communication with a target system, the at least one processor being configured to execute a computer program or instructions to perform the method according to the first aspect or any one of the possible implementations.
In an eighth aspect, the present application provides a computing system comprising at least one processor and a communication interface, the communication interface and the at least one processor being interconnected by a line, the communication interface being in communication with a target system, the at least one processor being configured to execute a computer program or instructions to perform the method according to the first aspect or any one of the possible implementations thereof.
The communication method of the network node is realized based on a clustering network architecture. In the cluster network architecture, the movement or up-down line of the node only affects the subgroup network where the node is located and the routing information maintained in the subgroup network, thereby effectively reducing the influence of the movement or up-down line of the node on the whole network topology and reducing the flooding overhead in the route discovery process.
The main group backbone network in the cluster network architecture provided by the application only consists of the head node of each subgroup network, so that the number of nodes of the backbone network is greatly reduced, and the number of nodes participating in route exchange is reduced, thereby reducing the communication overhead required for exchanging route information among the nodes.
The clustering network architecture provided by the application has good network expansibility, and the newly added nodes are only related to the added sub-network structure and cannot influence the topological structure of the whole network.
In addition, the terminal equipment only stores the default pairing of the network head node of the subgroup network, and does not need to perform full scanning during service discovery, but obtains a route corresponding to the service from the network head node, and the network head node can perform service discovery in advance, so that the discovery speed is improved; the terminal equipment only maintains the keep-alive (keep alive) relationship with the network head node, thereby enhancing the expandability of network connection.
Drawings
Fig. 1 is a schematic architecture diagram of a clustering network model according to an embodiment of the present application;
fig. 2 is a flowchart illustrating a communication method of a network node according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a communication method of a network node according to an embodiment of the present application;
fig. 4 is a schematic diagram of a routing information query of a network node according to an embodiment of the present application;
fig. 5 is a flowchart illustrating a communication method of a network node according to another embodiment of the present application;
fig. 6 is a flowchart illustrating a communication method of a network node according to another embodiment of the present application;
FIG. 7 is a schematic diagram of a network topology and an initial routing table of a sub-swarm network according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a communication device of a network node according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a communication device of a network node according to an embodiment of the present application.
Detailed Description
Technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a schematic architecture diagram of a clustering network model according to an embodiment of the present application. As shown in fig. 1, the clustering network model includes a main cluster backbone network, a sub cluster network 1, a sub cluster network 2, and a sub cluster network 3.
Each subgroup network comprises a head node, member nodes and gateway nodes. In the clustering network model, a network head node is taken as a center, r hops are taken as radii to partition a plurality of subgroup networks, and r is an integer greater than or equal to 0. The head node is responsible for calculating and selecting the routing of the sub-group network, and is responsible for serving as a service directory node to maintain a service directory. The head node may be selected by configuration, or automatically selected by a head election algorithm, which is not limited in this application. A gateway node is a node located at the edge of the belonging sub-group network and connected to a neighboring sub-group network node, the gateway node being a special member node. For example, the head node of the subgroup network 1 is d, the member nodes are e and l, and the gateway nodes are c and f; the head node of the subgroup network 2 is b, the member nodes are a, i and j, and the gateway node is c; the head node of the subgroup network 3 is h, the member nodes are g, n and m, and the gateway node is f.
The main group backbone network is composed of the net head node of each subgroup network, and the net head node of the subgroup network with the best stability and comprehensive performance in the net head nodes of each subgroup network is used as the net head node of the main group backbone network. For example, the main group backbone network is composed of a head node d of the sub-group network 1, a head node b of the sub-group network 2, and a head node h of the sub-group network 3, and the head node of the main group backbone network is a node d.
It is understood that the group network model shown in fig. 1 is only an example, in other embodiments of the present application, the group network model may include more or less sub-groups than those shown, each sub-group may include more or less nodes than those shown, for example, a certain sub-group in the group network model may include only one head node, only head nodes and gateway nodes, or only head nodes and member nodes, and the present application is not limited thereto.
Fig. 2 is a flowchart illustrating a communication method of a network node according to an embodiment of the present application. As shown in fig. 2, the method includes at least S201 to S203.
S201, a first node receives a first routing query message, and the first routing query message is used for requesting to query routing information from a source node to a destination node.
The device-to-device network includes a first node, the first node stores a first routing table, the first routing table includes routing information between nodes in a first node set in the device-to-device network, and the first node set includes the first node.
As an example, the first node set is a first sub-group network in the clustering network model, the first node is a head node in the first sub-group network, and the first node stores a first routing table, where the first routing table includes routing information between all nodes in the first sub-group network.
In a possible implementation manner, the source node is a node in the first node set, and the first node receives the first routing query packet from the source node.
In another possible implementation manner, if the source node is not a node in the first node set, the first node receives a first routing query message from a head node of a neighbor sub-group network, where the first routing query message includes routing information from the head node of the sub-group network to which the source node belongs to the first node.
The first route inquiry message is used for requesting to inquire the route information from the source node to the destination node.
Table 1 is an example of a first routing query message. As shown in table 1, the first routing query packet includes a packet type, a source address, a destination address, a routing query identifier, a routing vector, a radius, a service port number or a service identifier, and a service description. The message type is a Route Request (RREQ), a service port number or a service identifier, and a service description, where the service description is used for service discovery, that is, a corresponding route vector is queried through the service port number or the service identifier.
Table 1 first route query message
S202, the first node inquires whether the first routing table contains the routing information of the destination node.
The first node stores a first routing table, the first routing table comprises routing information among all nodes in the first node set, and after the first node receives the first routing query message, whether the first routing table contains the routing information of the destination node is queried.
In a possible implementation manner, the source node is a node in the first node set, and the routing information that the first node queries in the first routing table and includes the destination node is the routing information from the source node to the destination node.
In another possible implementation manner, the source node is not a node in the first node set, and the routing information that the first node queries in the first routing table and includes the destination node is the routing information from the first node to the destination node.
S203, when the first routing table includes the routing information of the destination node, the first node sends a first routing response query message to the source node, where the first routing response query message includes the first routing information.
Table 2 is an example of the first route reply query message. As shown in table 2, the first routing response query packet includes a packet type, a source address, a destination address, a routing query identifier, a routing vector, a radius, a service port number or a service identifier, and a service description. The message type is route reply query (RREP), a service port number or service identifier, and service description, which are used for service discovery, that is, a reply to the service port number or service identifier is used to query a corresponding route vector.
Table 2 first route reply query message
And under the condition that the first routing table contains the routing information of the destination node, the first node sends a first routing response query message to the source node.
In a possible implementation manner, the source node is a node in the first node set, and accordingly, the first routing information in the first routing reply query message includes routing information from the source node to the destination node.
In another possible implementation manner, the source node is not a node in the first node set, the clustered network further includes a sixth node, the sixth node stores a sixth routing table, the sixth routing table includes routing information between nodes in the sixth node set in the network, and the sixth node set includes the sixth node and the source node.
The first node determines first routing information according to the first routing query message and the first routing table, and sends a first routing query response message to the sixth node, wherein the first routing query response message comprises the first routing information, and the first routing query message comprises routing information from the sixth node to the first node.
As an example, the first node merges the routing information from the sixth node to the first node in the first routing query message and the routing information from the first node to the destination node in the first routing table to obtain the first routing information.
Under the condition that the first routing table does not contain the routing information of the destination node, the following possible implementation modes are provided:
in a possible implementation manner, the clustered network further includes a second node, where the second node stores a second routing table, the second routing table includes routing information between nodes in a second node set in the network, and the second node set includes the second node.
The first node sends a second routing query message to the second node through the gateway node, the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used for requesting for querying routing information from the source node to the destination node.
In this possible implementation manner, when the destination node is not in the first node set, regardless of whether the source node is a node in the first node set, after receiving the first routing query packet, the first node forwards, to the second node, the second routing query packet through the gateway node when the routing information of the destination node is not queried in the first routing table, where the second routing query packet is a routing query packet obtained by adding a logical port or an address identifier of the first node on the basis of the first routing query packet.
In another possible implementation manner, the source node is a node in a first node set, the first node receives a second route reply query message forwarded by the gateway node, the second route reply query message includes routing information from the first node to a third node in the network and routing information of the destination node in a third node set in the network, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node.
And the first node generates second routing information according to the second routing response query message and the first routing table, and sends the second routing information to the source node, wherein the second routing information comprises routing information from the source node to the destination node.
As an example, the first node combines the routing information between the first node and the third node in the second route reply query message and the routing information between the destination node and the third node in the third routing table with the routing information between the source node and the first node in the first routing table to obtain the second routing information.
In this possible implementation manner, when the source node is a node in the first node set and the destination node is a node in the third node set, the first node receives a second routing response query message forwarded by the gateway node, where the second routing response query message includes routing information between the first node and the third node and routing information of the destination node in the third node set, the first node generates second routing information according to the second routing response query message and the first routing table, and the second routing information includes routing information from the source node to the destination node, and sends the second routing information to the source node.
In yet another possible implementation manner, the first node receives a second route reply query packet forwarded by the gateway node, where the second route reply query packet includes route information between a fourth node in the network and a fifth node in the network and third route information, the fourth node is a node in a fourth node set in the network, the fourth node set further includes a source node, the fourth node stores a fourth routing table, the fourth routing table includes route information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes route information between nodes in a fifth node set in the network, the fifth node set includes the fifth node and a destination node, the third route information includes route information of the destination node in the fifth node set, and the first node forwards the second route reply query packet.
In this implementation manner, when the source node is a node in the fourth node set and the destination node is a node in the fifth node set, the first node receives a second route response query packet forwarded by the gateway node, where the second route response query packet includes routing information between the fourth node and the fifth node and third routing information, the third routing information includes routing information of the destination node in the fifth node set, and the first node forwards the second route response query packet.
It should be noted that, in several possible implementation manners, the second routing query packet includes a node address identifier or a logical port identifier of the first node, and the logical ports of the first node correspond to the neighbor nodes of the first node one to one.
A first node in the clustered network may establish a first routing table for a first set of nodes.
In a possible implementation manner, a first node receives first neighbor table information sent by other nodes in a first node set except the first node, the first neighbor table information is used for indicating routing information between the other nodes and adjacent nodes in the first node set, and the first node generates a first routing table based on the first neighbor table information.
In another possible implementation manner, the first node receives first packet information sent by other nodes in the first node set except the first node, where the first packet information is used to determine neighboring nodes of the other nodes in the first node set, and the first node generates the first routing table based on the first packet information.
The first node in the clustered network may also update a first routing table for the first set of nodes.
In a possible implementation manner, a first node receives second neighbor table information sent by other nodes in a first node set except the first node, the second neighbor table information is used for updating routing information between the other nodes and adjacent nodes in the first node set, and the first node updates a first routing table based on the second neighbor table information.
In another possible implementation manner, the first node receives second packet information sent by other nodes in the first node set except the first node, where the second packet information is used to update neighboring nodes of the other nodes in the first node set, and the first node updates the first routing table based on the second packet information.
The first node set of the clustered network may include a plurality of nodes, and the method of selecting the first node among the plurality of nodes as the head node of the first node set may include:
the first node calculates a first node capacity value, sends the first node capacity value to other nodes except the first node in the first node set, and receives the node capacity values of the other nodes except the first node in the first node set, and the first node determines that the first node is a net head node according to the first node capacity value and the node capacity values of the other nodes except the first node in the first node set. Wherein the first node capability value may include one or more of the following characteristic values: the node degree of the first node, the change rate of the neighbor nodes, the available electric quantity, the sending power, the available residual bandwidth, the calculation and storage capacity value and the like.
In a possible implementation manner, the first node calculates a first node capability value, receives node capability values of other nodes except the first node in the first node set, compares the first node capability value with the node capability values of the other nodes, and uses the first node as a head node of the first node set because the first node capability value is greater than the node capability values of the other nodes.
As an example, the first node may send the first node capability value to other nodes in the first node set except the first node through a node capability declaration message.
Table 3 is an example of a node capability declaration message, and as shown in table 3, the node capability declaration message includes a message type, a node identifier, a node capability value, and a radius. The message type is a node capability statement, and the radius field is used for indicating the hop count of the message flooding.
Table 3 node capability declaration message
| Message type = node capability declaration | Node identifier | Nodal capability value | Radius of |
After the first node is determined to be the head node of the first node set, the first node sends a first head declaration message to other nodes except the first node in the first node set, the first head declaration message is used for indicating that the first node is the head node of the first node set, and receives a first join message sent by other nodes except the first node in the first node set, and the first join message is used for indicating to join the first node set. The first node set comprises a first node and a node which sends a first join message to the first node.
Table 4 is an example of the first net head declaration message, and as shown in table 4, the first net head declaration message includes a message type, a node identifier, a net head node identifier, a node capability value, and a radius. The message type is a net head statement, the net head node mark is used for indicating that the node is the net head node, and the radius field is used for indicating the hop count of the message flooding.
Table 4 first net head declaration message
| Message type = net head declaration | Node identifier | Net head sectionPoint mark | Nodal capability value | Radius of |
Table 5 is an example of the first join packet, and as shown in table 5, the first join packet includes a packet type, a head node identifier, whether it is a gateway node, a node identifier, and a radius. Wherein the message type is join.
TABLE 5 first join message
| Message type = join | Head node identifier | Is a gateway node | Node identifier | Radius of the pipe |
According to the technical scheme, the head node of each subgroup network in the subgroup network stores the routing information among all nodes in the subgroup network, and the head node of each subgroup network inquires the routing information from the source node to the destination node, so that the inquiry efficiency of the routing information of the network node is improved, meanwhile, the communication efficiency of the network node is improved, and the resources are saved.
Fig. 3 is a flowchart illustrating a communication method of a network node according to an embodiment of the present application. As shown in fig. 3, the method includes at least S301 to S307.
S301, a first network head node receives a first route query message sent by a source node, wherein the first network head node is a network head node of a first subgroup network, and the source node is a node in the first subgroup network.
An example of the first routing query message is shown in table 1.
S302, the first network head node inquires whether the first routing table contains routing information of a destination node or a service identifier, wherein the first routing table is the routing information among all nodes in the first subgroup network stored by the first network head node.
If so, the process goes to step S303,
if not, executing S304 to S307.
S303, the first head node sends a first route response query message to the source node, where the first route response query message includes first route information.
An example of the first route reply query message is shown in table 2.
In one possible implementation, the first routing information includes a path vector between the source node and the destination node.
In another possible implementation, the first routing information includes a path vector corresponding to the service identifier.
S304, the first net head node transmits the second route inquiry message through the net joint node.
In a possible implementation manner, the first head node selects a head node of a neighbor subgroup from the head nodes of a plurality of neighbor subgroup networks through a relay network first-choice algorithm, and forwards the second routing query message to the head node through the gateway node.
In another possible implementation manner, the first head node transfers the second routing query packet to the head nodes of all the neighbor sub-group networks through the gateway node.
The second routing query message comprises a node address identifier or a logic port identifier of the first network head node, and the logic ports of the first node correspond to the neighbor nodes of the first node one to one.
S305, the first net head node receives the second route response inquiry message.
In a possible implementation manner, the first network head node receives a second route reply query message sent by a second network head node, where the second network head node is a network head node of a second subgroup network, and the destination node is a node in the second subgroup network.
The second route response query message comprises the route information from the first network head node to the second network head node and the route information from the destination node to the second network head node.
For example, the routing information in the second route reply query message may be represented by a logical port of each hop and a node identifier.
Fig. 4 is a schematic diagram of routing information query of a network node according to an embodiment of the present application, and as shown in fig. 4, a path vector may be formed by addresses or identifiers of nodes on a path, but the path vector has a relatively long bit length, and is preferably formed by logical ports of each node (that is, "the path vector" is formed by a series of logical port components), so that the addresses or identifiers of each node can be greatly reduced. The logical ports of a node correspond one-to-one to the neighbor nodes of a node.
Illustratively, node 11 is the source node and node 16 is the destination node. The path vector from the source node to the destination node displayed by the node address identification method is {10,9,6,5,3,2,7,15,12,16}; the path vector from the source node to the destination node displayed by the logical port identification method is {1,1,2,1,2,3,3,3,2,2}.
The advantage of representing the path vector based on logical ports is: when a source node sends data to a destination node, as long as a message carries a path vector, a network intermediate node can forward the message according to a corresponding logic port in the message path vector, and the forwarding does not need to search a traditional forwarding table, so that the forwarding method is particularly suitable for forwarding an internet of things (IoT) node with limited resources.
Optionally, when the source node sends data to the destination node, as long as the packet carries a path vector based on an address or an identifier, the network intermediate node may forward the packet according to the corresponding address or identifier in the packet path vector.
S306, the first head node determines second routing information, and the second routing information represents routing information from the source node to the destination node.
In a possible implementation manner, the first network head node only receives one second route reply query message, and then the first network head node queries the route information from the source node to the first network head node, and combines the route information from the source node to the first network head node, the route information from the first network head node to the second network head node, and the route information from the second network head node to the destination node, which are carried in the second route reply query message, to obtain the second route information.
In another possible implementation manner, the first network head node receives a plurality of second route reply query messages, the first network head node determines a route (i.e. a path vector) from the source node to the first network head node, determines all routes from the plurality of first network head nodes to the destination node or the service identifier through the plurality of second route reply query messages, and selects an optimal route by executing a route selection algorithm; and merging the routing information from the source node to the first network head node with the selected optimal path to obtain second routing information.
S307, the first net head node sends the second routing information to the source node.
In a possible implementation manner, the first net head node sends a third route reply query message to the source node, and a path vector field in the third route reply query message carries the second route information.
According to the technical scheme, under the condition that a first network head node is a network head node of a first subgroup network and a source node is a node in the first subgroup network, the first network head node receives a first routing query message sent by the source node, and queries whether routing information of a destination node or a service identifier is contained in a first routing table or not according to the first routing query message, and if the first routing table contains the routing information of the destination node or the service identifier, the first network head node directly sends a first routing response query message carrying the first routing information to the source node; if the first routing table does not contain routing information of a destination node or a service identifier, the first net head node forwards a second routing query message through the gateway node and receives a second routing response query message, and after the first net head node determines the second routing information, the second routing information is sent to the source node, so that the query efficiency of the routing information from the source node to the destination node is improved, meanwhile, the communication efficiency from the source node to the destination node is improved, and resources are saved.
Fig. 5 is a flowchart illustrating a communication method of a network node according to another embodiment of the present application. As shown in fig. 5, the method includes at least S501 to S505.
S501, a first network head node receives a first route query message, the first network head node is a network head node of a first subgroup network, the first route query message comprises route information from a second network head node to the first network head node, the second network head node is a network head node of a second subgroup network, and a source node is a node in the second subgroup network.
An example of the first routing query message is shown in table 1.
S502, the first network head node inquires whether the first routing table contains routing information of a destination node or a service identifier, and the first routing table is the routing information among all nodes in the first subgroup network stored by the first network head node.
If not, executing S503;
if yes, go to S504-S505.
S503, the first net head node forwards the second route inquiry message through the net joint node.
In a possible implementation manner, the first head node selects a head node of a neighbor subgroup from the head nodes of a plurality of neighbor subgroup networks through a relay network first-choice algorithm, and forwards the second routing query message to the head node through the gateway node.
In another possible implementation manner, the first head node transfers the second routing query packet to the head nodes of all the neighbor sub-group networks through the gateway node.
The second routing query message comprises a node address identifier or a logic port identifier of the first network head node, and the logic ports of the first node correspond to the neighbor nodes of the first node one to one.
S504, the first head node determines first routing information according to the first routing query message and the first routing table.
As an example, the first head node merges, in the first routing query message, routing information from the second head node to the first head node, and routing information from the destination node to the first head node in the first routing table, to obtain the first routing information.
As another example, the first head node merges, by the first head node, the routing information from the second head node to the first head node in the first routing query message with the routing information corresponding to the service identifier in the first routing table, so as to obtain the first routing information.
And S505, the first head node sends a first route query response message to the second head node, wherein the first route query response message comprises first route information.
An example of the first reply query message is shown in table 2.
According to the technical scheme, under the condition that a first net head node is a net head node of a first subgroup network, a second net head node is a net head node of a second subgroup network, and a source node is a node in the second subgroup network, the first net head node receives a first routing query message, and queries whether a first routing table contains routing information of a destination node or not according to the first routing query message, and if the first routing table does not contain the routing information of the destination node, the first net head node forwards a second routing query message through a gateway node; if the first routing table contains the routing information of the destination node, the first network head node determines the first routing information according to the first routing query message and the first routing table, and sends the first routing information to the second network head node, so that the query efficiency of the routing information from the source node to the destination node is improved, meanwhile, the communication efficiency from the source node to the destination node is improved, and resources are saved.
Fig. 6 is a flowchart illustrating a communication method of a network node according to another embodiment of the present application. As shown in fig. 6, the method includes at least S601 to S607.
S601, the first node calculates a first node capacity value.
The first node capability value comprises one or more of the following characteristic values: the node degree of the first node, the change rate of the neighbor nodes, the available electric quantity, the sending power, the available residual bandwidth and the calculation and storage capacity value.
In a possible implementation manner, the capability value of the first node can be obtained by using formula 1, and the change rate M of the neighbor node of the first node can be calculated by using formula 2 i The connectivity N of the first node can be calculated by using equation 3 i 。
An example of equation 1 is shown below:
N＝(d*N i *M i )+(e*E)+(p*P)+(b*B)+(c*C)
wherein N represents a node capability value, M i Representing the rate of change of the neighbor nodes of the node, N i Representing the degree of the node, E representing the available electric quantity of the node, P representing the sending power of the node, B representing the available residual bandwidth of the node, C representing the calculation and storage capacity of the node, d, E, P, B and C being the influence factors of the variables respectively, and the value range being [0,1%]The value of the influence factor can be changed according to the actual condition and the requirement of the network, so that the influence of a certain variable corresponding to the influence factor on the value of N is enhanced or weakened.
Neighbor node change rate M i Is a variable that reflects the stability of a node by comparing the changes of neighboring nodes of the node over a period of time.
Illustratively, if node i can hear the signal sent by node j, node j is a neighbor of node i, and all neighbor nodes of node i constitute a neighbor set of node i. t is t 1 The neighbor set of the time node i is S i-t1 ，t 2 The time neighbor set is S i-t2 ，
An example of equation 2 is shown below:
M i reflecting the stability of the topology between the node i and its neighbor nodes. M i The larger the node is, the smaller the link change between the node i and the neighbor node is, and the more stable the local topological structure taking the node i as the center is; conversely, the more drastic the local topology changes.
An example of equation 3 is shown below:
wherein d is ij R represents the communication range of the node i, i.e., the number of hops, as the distance between the nodes i, j.
N i *M i And the stable connectivity of the node is indicated, and the stable connectivity is used for reflecting the connection condition of the node and the neighbor nodes and the stability of the local topology of the node.
The calculation formula of N shows that the degree N of a certain node in the network i Node neighbor change rate M i The larger the remaining capacity E, the transmission power P, the remaining bandwidth B, or the calculation and storage capacity C of the node, the larger N of the node is, the more it has the capability of serving as a network head node.
S602, the first node sends the first node capability value to other nodes according to the preset radius.
The first node broadcasts the node capability value of the first node to other nodes in the network in a flooding mode according to the preset radius (hop count) r of the subgroup network, wherein r is an integer greater than or equal to 0. For example, a first node employs a publishing node capability declaration message to advertise the first node capability value to other nodes.
An example of the node capability declaration message is shown in table 3.
S603, the first node receives the node capability values sent by other nodes.
And S604, determining the first node as a net head node of the first subgroup network according to the first node capability value and the node capability values of other nodes.
In a possible implementation manner, the first node compares the capability value of the first node with the received capability values of other nodes, and if the capability value of the first node is the maximum, the first node is determined to be the head node.
After the first node is determined to be the network head node, a first subgroup network is established by taking the first node as the center and taking a certain hop count r as the radius.
The first node broadcasts a net head declaration message according to the radius r of the first subgroup network, and informs other nodes of being the net head node.
An example of the net head declaration message is shown in table 4.
For a node which does not join any subgroup network, after receiving a declaration (close) message of a head node, sending a join (join) message to the head node, wherein the join (join) message indicates that the head node is declared to join the subgroup network to which the head node belongs. After the head node receives the join message sent by the node, the node is used as a member node to be added into the member node set of the sub-group network to which the node belongs.
In a possible implementation manner, when the node receives a declaration (close) message of multiple head nodes at the same time, the node may select to join a sub-group network to which the head node with the largest node capability value belongs, from among the multiple head nodes that send the declaration message. When a plurality of head nodes in the plurality of head nodes sending the declaration message have the same maximum value, the node may select to join the subgroup network to which the head node with the smallest head node identifier belongs.
In another possible implementation manner, when the node receives declaration (close) messages of a plurality of head nodes at the same time, the node selects to join a plurality of subgroups, sets the node state of the node as a gateway node, and informs the head node that the node is the gateway node.
Illustratively, the node may identify itself as a gateway node in a join (join) message sent to the head node of the network.
An example of the join message is shown in table 5.
In another possible implementation manner, when a node detects that all neighbor nodes smaller than the capability value of its own node have joined the sub-group network and still have not joined any sub-group network, or when a node is an isolated node, it may itself serve as a head node to form a single sub-group network.
After the subgroup network is established, a member node only belongs to the subgroup network, the identifier of the head node of the member node is recorded in the routing table of the member node, and the identifier of all nodes in the subgroup network managed by the head node of the member node is recorded by the head node of the member node.
Table 6 is an example of a subgroup network member table, which includes member node identifications and gateway identifications, as shown in table 6.
Table 6 subgroup network member table
| Member node identification | Gateway identification |
| 6 | 1 |
| 8 | 0 |
| 10 | 0 |
| 11 | 0 |
After the member nodes join the subgroups, the member nodes do not release the node capability values of the member nodes, namely, the member nodes do not release the node capability statement messages; the head node periodically issues a head declaration message; if the member node does not receive the head declaration message of the head node of the sub-group network within a certain time, the head node is considered to be absent, and the node capability value of the member node is reissued; when the member node receives a periodic net head declaration message, it will send a joining message to the net head node to indicate that it is still in the subgroup network.
S605, the first node generates an intra-group neighbor table of the first sub-group network.
In a possible implementation manner, for some terminals (e.g., thin terminals), due to limited storage resources, the hello messages sent by the neighbor nodes are directly reported to the first node after being received, and the first node establishes or updates a corresponding neighbor table for each node in the first subgroup network according to the received hello messages of the neighbor nodes.
In another possible implementation manner, for other terminals (e.g., fat terminals), each node establishes or updates a neighbor table after receiving a Hello packet sent by a neighbor node, and then sends the neighbor table to the first node, and the first node collects the neighbor tables of each member node and deletes a node in the neighbor table that does not reply to the Hello packet, so as to maintain the accuracy of the topology structure.
Table 7 is an example of a hello packet, and as shown in table 7, the hello packet includes a packet type and a node identifier.
TABLE 7hello messages
| Message type = hello | Node identifier |
Table 8 is an example of a neighbor table of a first sub-group network, which includes logical ports and neighbor node identifications, wherein the logical ports of a node correspond to the neighbor nodes of the node one to one.
Table 8 neighbor table of first subgroup network
| Logical port | |
| 1 | 6 |
| 2 | 8 |
| 3 | 10 |
S606, the first node generates an intra-group routing table according to the intra-group neighbor table.
The first node maintains a routing table in the first subgroup network, the routing table includes routes between nodes in the first subgroup network, and the routing table includes all paths from any node in the first subgroup network to other nodes.
In one possible implementation manner, after the neighbor table of the first sub-group network is established or updated, the step of the first node generating or updating the intra-group routing table according to the intra-group neighbor table of the first sub-group network includes:
step one, appointing any node in the first subgroup network as a source node.
And step two, appointing any node except the source node in the first subgroup network as a destination node.
And step three, selecting any neighbor node of the source node as a first relay node.
And step four, adding the routing table of the first relay node into the routing table of the source node to obtain a first routing table.
And step five, judging whether any route in the first route table forms a ring route.
If yes, deleting the route; if not, executing the step six.
And step six, judging whether a route in the first routing table reaches a destination node.
If yes, the generation of the routing table is finished; if not, executing the step seven.
And step seven, selecting any neighbor node of the first relay node as a second relay node, and repeatedly executing the steps four to seven until the destination node is finally reached.
In the possible implementation mode, the member node is free from routing, maintenance-free neighbor table or only maintains the neighbor table, so that the requirement of the member node on resources (storage and calculation) is very low.
Fig. 7 is a schematic diagram of a network topology and an initial routing table of a sub-group network according to an embodiment of the present application. As shown in fig. 7, the subgroup network includes five nodes A, B, C, D and E, the network head node maintains an intra-group routing table of A, B, C, D, E in a subgroup, and the initial routing table is obtained from a neighbor table.
Taking a node B as an example, a neighbor table of B includes A, C, D, and a routing table of B includes a path vector [ B, a ] from B to a, a path vector [ B ] from B to B, a path vector [ B, C ] from B to C, a path vector [ B, D ] from B to D, and a path vector [ B ] from B to E; wherein [ B, A ] indicates that A can be reached from B, and [ B ] indicates that no route exists and the A cannot be reached.
In one possible implementation, a head node in the subgroup network can update the intra-group routing table.
For example, node C in fig. 6 is designated as a source node, node a is designated as a destination node, and the head node can add the routing table of node B into the routing table of node C, so as to generate a new routing table of node C.
Specifically, a path vector [ B, A ] from a node B to a node A in a routing table of the node B is added to a path vector [ C ] from a node C to a node A in a routing table of an old node C to obtain a new path vector [ C, B, A ] from the node C to the node A; adding a route vector (B, C) from a node B to a node C in a routing table of the node B to a route vector (C) from the node C to the node C in a routing table of an old node C to obtain a route vector (C, B, C) from the node C to the node C, wherein the (C, B, C) is not closer than the (C), so that the route vector from the node C to the node C is still kept to be (C) in the routing table of the node C; adding a path vector (B, D) from a node B to a node D in a routing table of the node B to a path vector (C, D) from a node C to a node D in a routing table of an old node C to obtain a path vector (C, D, B, D) from the node C to the node D, wherein the path vector (C, D, B, D) is not closer than the path vector (C, D), B, D) from the node C to the node D, so that the path vector (C, D) from the node C to the node D is still reserved in the routing table of the node C; and adding the path vector [ C, E ] from the node B to the node E in the routing table of the node B to the path vector [ C, E ] from the node C to the node E in the routing table of the old node C to obtain a path vector [ C, E ] from the node C to the node E, wherein the path vector [ C, E ] is the same as the original path vector and is not closer to the original path vector, so that the path vector [ C, E ] from the node C to the node E is still reserved in the routing table of the node C. The destination node a has arrived, and therefore the updating of the routing table of the node C this time is completed.
S607, the first node performs a routing query according to the intra-group routing table of the first sub-group network.
It should be noted that, the step of the first node performing the routing query according to the intra-group routing table of the first sub-group network may refer to the step of the first node performing the routing query according to the intra-group routing table of the first sub-group network shown in fig. 2, fig. 3, or fig. 5, and details are not repeated here.
The technical scheme provided by the application is realized based on a group network architecture, in the group network architecture, the movement or up-down line of the node only affects the subgroup network structure where the node is located and the routing information maintained in the subgroup network, so that the influence of the movement or up-down line of the node on the whole network topology is effectively reduced, the flooding overhead in the route discovery process is reduced, the communication efficiency of the network node is improved, and the resource is saved.
Fig. 8 is a schematic structural diagram of a communication device of a network node according to an embodiment of the present application. As shown in fig. 8, the apparatus 800 may include a receiving module 801, a querying module 802, and a sending module 803.
Any module of the receiving module, the querying module and the sending module in the embodiments of the present application may be wholly or partially implemented by software and/or hardware. The part realized by software can be run on the processor to realize corresponding functions, and the part realized by hardware can be a constituent part of the processor.
In one implementation, the apparatus 800 may be used to implement the method illustrated in fig. 2 described above. For example, the receiving module 801 is configured to implement S201, the querying module 802 is configured to implement S202, and the sending module 803 is configured to implement S203.
In another implementation, the apparatus 800 further includes a forwarding module and a processing module, and the apparatus 800 in this implementation may be configured to implement the method shown in fig. 3. For example, the receiving module 801 is configured to implement S301 and S305, the querying module 802 is configured to implement S302, the sending module 803 is configured to implement S303 and S307, the forwarding module is configured to implement S304, and the processing module is configured to implement S306.
In yet another implementation, the apparatus 800 further includes a forwarding module and a processing module, and the apparatus 800 in this implementation may be configured to implement the method shown in fig. 5 described above. For example, the receiving module 801 is configured to implement S501, the querying module 802 is configured to implement S502, the sending module 803 is configured to implement S505, the forwarding module is configured to implement S503, and the processing module is configured to implement S504.
In yet another implementation, the apparatus 800 further includes a network preference module and a route generation module, and the apparatus 800 in this implementation may be configured to implement the method shown in fig. 6. For example, the query module 802 is configured to implement S607, the net top preference module is configured to implement S601 to S604, and the route generation module is configured to implement S605 and S606.
Fig. 9 is a schematic structural diagram of a communication device of a network node according to an embodiment of the present application. The apparatus 900 of fig. 9 may be used to perform the method of any of the previous embodiments.
As shown in fig. 9, the apparatus 900 of the present embodiment includes: memory 901, processor 902, communication interface 903, and bus 904. The memory 901, the processor 902 and the communication interface 903 are connected to each other by a bus 904.
The memory 901 may be a Read Only Memory (ROM), a static memory device, a dynamic memory device, or a Random Access Memory (RAM). The memory 901 may store programs and the processor 902 may be adapted to perform the steps of the methods shown in fig. 2,3, 5 and 6 when the programs stored in the memory 901 are executed by the processor 902.
The processor 902 may be a general Central Processing Unit (CPU), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits, configured to execute related programs to implement the communication method of the network node according to the embodiment of the present application.
The processor 902 may also be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the method of the embodiments of the present application may be implemented by integrated logic circuits of hardware or instructions in the form of software in the processor 902.
The processor 902 may also be a general-purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, or discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in the memory 901, and the processor 902 reads the information in the memory 901, and completes the functions required to be performed by each method in the embodiments of the present application in combination with the hardware thereof, for example, may perform each step/function of the embodiments shown in fig. 2, fig. 3, fig. 5 and fig. 6.
The communication interface 903 may enable communication between the apparatus 900 and other devices or communication networks using, but not limited to, transceiver devices.
Bus 904 may include a pathway to transfer information between various components of apparatus 900 (e.g., memory 901, processor 902, communication interface 903).
It should be understood that the apparatus 900 shown in the embodiment of the present application may be an electronic device, or may also be a chip configured in the electronic device.
It should be understood that the processor in the embodiments of the present application may be a Central Processing Unit (CPU), and the processor may also be other general purpose processors, digital Signal Processors (DSPs), application Specific Integrated Circuits (ASICs), field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will also be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of Random Access Memory (RAM) are available, such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and direct bus RAM (DR RAM).
The above-described embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product comprises one or more computer instructions or computer programs. The procedures or functions according to the embodiments of the present application are wholly or partially generated when the computer instructions or the computer program are loaded or executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more collections of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.
It should be understood that the term "and/or" herein is only one kind of association relationship describing the association object, and means that there may be three kinds of relationships, for example, a and/or B, and may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. In addition, the "/" in this document generally indicates that the former and latter associated objects are in an "or" relationship, but may also indicate an "and/or" relationship, which may be understood with particular reference to the former and latter text.
In the present application, "at least one" means one or more, "a plurality" means two or more. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: u disk, removable hard disk, read only memory, random access memory, magnetic disk or optical disk, etc. for storing program codes.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (38)
1. A method of communication of a network node, the network including a first node storing a first routing table including routing information between nodes in a first set of nodes in the network, the first set of nodes including the first node, the method comprising:
the first node receives a first routing query message, wherein the first routing query message is used for requesting to query routing information from a source node to a destination node;
the first node inquires whether the first routing table contains the routing information of the destination node;
and under the condition that the first routing table contains the routing information of the destination node, the first node sends a first routing response query message to the source node, wherein the first routing response query message comprises first routing information.
2. The method of claim 1, wherein the source node is a node in the first set of nodes, and wherein the first routing information comprises routing information from the source node to the destination node, respectively.
3. The method according to claim 1 or 2, wherein the network further comprises a second node, the second node storing a second routing table, the second routing table comprising routing information between nodes in a second set of nodes in the network, the second set of nodes comprising the second node;
accordingly, the method further comprises:
and under the condition that the first routing table does not contain the routing information of the destination node, the first node sends a second routing query message to the second node through a gateway node, wherein the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used for requesting to query the routing information from the source node to the destination node.
4. The method of claim 3, further comprising:
the first node receives a second routing response query message forwarded by the gateway node, where the second routing response query message includes routing information from the first node to a third node in the network and routing information of the destination node in a third node set in the network, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node;
the first node generates second routing information according to the second routing response query message and the first routing table, wherein the second routing information comprises routing information from the source node to the destination node;
and the first node sends the second routing information to the source node.
5. The method according to claim 4, wherein the first node generating second routing information according to the second routing reply query message and the first routing table comprises:
the first node combines the routing information between the first node and the third node in the second routing response query message, the routing information between the destination node and the third node in the third routing table, and the routing information between the source node and the first node in the first routing table to obtain the second routing information.
6. The method of claim 3, further comprising:
the first node receives a second route reply query message forwarded by the gateway node, where the second route reply query message includes route information and third route information between a fourth node in the network and a fifth node in the network, the fourth node is a node in a fourth node set in the network, the fourth node set further includes the source node, the fourth node stores a fourth routing table, the fourth routing table includes route information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes route information between nodes in a fifth node set in the network, the fifth node set includes the fifth node and the destination node, and the third route information includes route information of the destination node in the fifth node set;
and the first node forwards the second route response inquiry message.
7. The method according to any of claims 3 to 6, wherein the second routing query message comprises: and the logical port of the first node corresponds to the neighbor node of the first node one by one.
8. The method of claim 1, wherein the network further comprises a sixth node, wherein the sixth node stores a sixth routing table, wherein the sixth routing table comprises routing information between nodes in a sixth set of nodes in the network, wherein the sixth set of nodes comprises the sixth node and the source node;
accordingly, the method further comprises:
the first node determines first routing information according to the first routing query message and the first routing table, wherein the first routing query message comprises routing information from the sixth node to the first node;
and the first node sends the first routing query response message to the sixth node, wherein the first routing query response message comprises the first routing information.
9. The method according to claim 8, wherein the first node determining the first routing information according to the first routing query packet and the first routing table comprises:
the first node merges the routing information from the sixth node to the first node in the first routing query message with the routing information from the first node to the destination node in the first routing table to obtain the first routing information.
10. The method according to any one of claims 1 to 9, further comprising:
the first node receives first neighbor table information sent by other nodes except the first node in the first node set, wherein the first neighbor table information is used for indicating routing information between the other nodes and the neighbor nodes in the first node set;
the first node generates the first routing table based on the first neighbor table information.
11. The method of claim 10, further comprising:
the first node receives second neighbor table information sent by other nodes except the first node in the first node set, wherein the second neighbor table information is used for updating routing information between the other nodes and the neighbor nodes in the first node set;
the first node updates the first routing table based on the second neighbor table information.
12. The method according to any one of claims 1 to 9, further comprising:
the first node receives first message information sent by other nodes except the first node in the first node set, wherein the first message information is used for determining adjacent nodes of the other nodes in the first node set;
and the first node generates the first routing table based on the first message information.
13. The method of claim 12, further comprising:
the first node receives second message information sent by other nodes except the first node in the first node set, wherein the second message information is used for updating adjacent nodes of the other nodes in the first node set;
and the first node updates the first routing table based on the second message information.
14. The method according to any one of claims 1 to 13, further comprising:
the first node calculates a first node capacity value;
the first node sends the first node capability value to other nodes except the first node in the first node set;
the first node receives node capability values of other nodes except the first node in the first node set;
and the first node determines that the first node is the net head node according to the first node capacity value and the node capacity values of other nodes except the first node in the first node set.
15. The method of claim 14, wherein the first node capability value comprises one or more of the following characteristic values: the node degree of the first node, the change rate of the neighbor nodes, the available electric quantity, the sending power, the available residual bandwidth and the calculation and storage capacity value.
16. The method according to claim 14 or 15, characterized in that the method further comprises:
the first node sends a first network head declaration message to other nodes except the first node in the first node set, wherein the first network head declaration message is used for indicating that the first node is a network head node of the first node set;
and the first node receives a first join message sent by other nodes except the first node in the first node set, wherein the first join message is used for indicating to join the first node set.
17. The method according to any of claims 14 to 16, wherein the first set of nodes comprises the first node and a node sending the first join packet to the first node.
18. A communications apparatus of a network node, the network including a first node storing a first routing table including routing information between nodes of a first set of nodes in the network, the first set of nodes including the first node, the apparatus comprising:
a receiving module, configured to receive, by the first node, a first routing query packet, where the first routing query packet is used to request to query routing information from a source node to a destination node;
a query module, configured to query, by the first node, whether the first routing table includes the first routing information of the destination node;
a sending module, configured to send, by the first node to the source node, a first routing response query packet when the first routing table includes the routing information of the destination node, where the first routing response query packet includes the first routing information.
19. The apparatus of claim 18, wherein the source node is a node in the first set of nodes, and wherein the first routing information comprises routing information from the source node to the destination node.
20. The apparatus according to claim 18 or 19, wherein the network further comprises a second node, the second node storing a second routing table, the second routing table comprising routing information between nodes in a second set of nodes in the network, the second set of nodes comprising the second node;
correspondingly, the sending module is further configured to:
and under the condition that the first routing table does not contain the routing information of the destination node, the first node sends a second routing query message to the second node through a gateway node, wherein the gateway node is a node commonly contained in the first node set and the second node set, and the second routing query message is used for requesting to query the routing information from the source node to the destination node.
21. The apparatus of claim 20, further comprising a processing module configured to:
the first node receives a second routing response query message forwarded by the gateway node, where the second routing response query message includes routing information from the first node to a third node in the network and routing information of the destination node in a third node set in the device-to-device network, the third node stores a third routing table, the third routing table includes routing information between nodes in the third node set, and the third node set includes the third node;
the first node generates second routing information according to the second routing response query message and the first routing table, wherein the second routing information comprises routing information from the source node to the destination node;
and the first node sends the second routing information to the source node.
22. The apparatus of claim 21, wherein the processing module is specifically configured to:
the first node combines the routing information between the first node and the third node in the second routing response query message, the routing information between the destination node and the third node in the third routing table, and the routing information between the source node and the first node in the first routing table to obtain the second routing information.
23. The apparatus of claim 20, further comprising a forwarding module configured to:
the first node receives a second route reply query message forwarded by the gateway node, where the second route reply query message includes route information and third route information between a fourth node in the network and a fifth node in the network, the fourth node is a node in a fourth node set in the network, the fourth node set further includes the source node, the fourth node stores a fourth routing table, the fourth routing table includes route information between nodes in the fourth node set, the fifth node stores a fifth routing table, the fifth routing table includes route information between nodes in a fifth node set in the network, the fifth node set includes the fifth node and the destination node, and the third route information includes route information of the destination node in the fifth node set;
and the first node forwards the second route response inquiry message.
24. The apparatus according to any of claims 20 to 23, wherein the second routing query message comprises: and the logical port of the first node corresponds to the neighbor node of the first node one by one.
25. The apparatus of claim 18, wherein the network further comprises a sixth node, wherein the sixth node stores a sixth routing table, wherein the sixth routing table comprises routing information between nodes in a sixth set of nodes in the network, wherein the sixth set of nodes comprises the sixth node and the source node;
accordingly, the apparatus further comprises a processing module for:
the first node determines first routing information according to the first routing query message and the first routing table, wherein the first routing query message comprises routing information from the sixth node to the first node;
and the first node sends the first routing query response message to the sixth node, wherein the first routing query response message comprises the first routing information.
26. The apparatus of claim 25, wherein the processing module is specifically configured to:
the first node merges the routing information from the sixth node to the first node in the first routing query message with the routing information from the first node to the destination node in the first routing table to obtain the first routing information.
27. The apparatus according to any of claims 18 to 26, wherein the apparatus further comprises a route generation module configured to:
the first node receives first neighbor table information sent by other nodes except the first node in the first node set, wherein the first neighbor table information is used for indicating routing information between the other nodes and the neighbor nodes in the first node set;
the first node generates the first routing table based on the first neighbor table information.
28. The apparatus of claim 27, wherein the route generation module is further configured to:
the first node receives second neighbor table information sent by other nodes except the first node in the first node set, wherein the second neighbor table information is used for updating routing information between the other nodes and the neighbor nodes in the first node set;
the first node updates the first routing table based on the second neighbor table information.
29. The apparatus according to any of claims 18 to 26, wherein the apparatus further comprises a route generation module configured to:
the first node receives first message information sent by other nodes except the first node in the first node set, wherein the first message information is used for determining adjacent nodes of the other nodes in the first node set;
and the first node generates the first routing table based on the first message information.
30. The apparatus of claim 29, wherein the route generation module is further configured to:
the first node receives second message information sent by other nodes except the first node in the first node set, wherein the second message information is used for updating adjacent nodes of the other nodes in the first node set;
and the first node updates the first routing table based on the second message information.
31. The apparatus of any one of claims 18 to 30, further comprising a net preference module to:
the first node calculates a first node capacity value;
the first node sends the first node capability value to other nodes except the first node in the first node set;
the first node receives node capability values of other nodes except the first node in the first node set;
and the first node determines that the first node is the net head node according to the first node capacity value and the node capacity values of other nodes except the first node in the first node set.
32. The apparatus of claim 31, wherein the first node capability value comprises one or more of the following characteristic values: the node degree of the first node, the change rate of the neighbor nodes, the available electric quantity, the sending power, the available residual bandwidth and the calculation and storage capacity value.
33. The apparatus of claim 31 or 32, wherein the web preferred module is further configured to:
the first node sends a first net head declaration message to other nodes except the first node in the first node set, wherein the first net head declaration message is used for indicating that the first node is a net head node of the first node set;
and the first node receives a first join message sent by other nodes except the first node in the first node set, wherein the first join message is used for indicating to join the first node set.
34. The apparatus according to any of claims 31-33, wherein the first set of nodes comprises the first node and a node sending the first join packet to the first node.
35. A communications apparatus of a network node, comprising: a memory and a processor;
the memory is to store program instructions;
the processor is configured to invoke program instructions in the memory to perform the method of any of claims 1 to 17.
36. A chip comprising at least one processor and a communication interface, the communication interface and the at least one processor being interconnected by a line, the at least one processor being configured to execute a computer program or instructions to perform the method of any one of claims 1 to 17.
37. A computer-readable medium, characterized in that the computer-readable medium stores program code for computer execution, the program code comprising instructions for performing the method of any of claims 1 to 17.
38. A computer program product comprising instructions that, when executed, cause a computer to perform the method of any of claims 1 to 17.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111095210.XA CN115834464A (en) | 2021-09-17 | 2021-09-17 | Communication method of network node and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111095210.XA CN115834464A (en) | 2021-09-17 | 2021-09-17 | Communication method of network node and related device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115834464A true CN115834464A (en) | 2023-03-21 |
Family
ID=85515955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111095210.XA Pending CN115834464A (en) | 2021-09-17 | 2021-09-17 | Communication method of network node and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115834464A (en) |
-
2021
- 2021-09-17 CN CN202111095210.XA patent/CN115834464A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7656857B2 (en) | Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation | |
| US7778235B2 (en) | Compression of a routing header in a packet by a mobile router in an ad hoc network | |
| Gupta et al. | Review of various routing protocols for MANETs | |
| US7567577B2 (en) | Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof | |
| US8441958B2 (en) | Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network | |
| US7366111B2 (en) | Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network | |
| US20050036486A1 (en) | Route discovery in ad-hoc networks with data packets | |
| CN112104558B (en) | Method, system, terminal and medium for implementing block chain distribution network | |
| JP2009508410A (en) | Parallel execution of peer-to-peer overlay communication using multi-destination routing | |
| CN101640628B (en) | Mesh network-based routing management and routing methods, node, device and system | |
| Omar et al. | On-demand source routing with reduced packets protocol in mobile ad-hoc networks | |
| Ramalakshmi et al. | Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | |
| Parthiban et al. | Maximizing the network life time based on energy efficient routing in ad hoc networks | |
| Mule et al. | Proactive source routing protocol for opportunistic data forwarding in MANETs | |
| CN101409905A (en) | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode | |
| WO2020134713A1 (en) | Network node election method and node device | |
| CN101662374B (en) | Broadcasting method for mobile ad hoc network | |
| WO2007081566A2 (en) | Compression of a routing header in a packet by a mobile router in an ad hoc network | |
| CN115834464A (en) | Communication method of network node and related device | |
| Preetha et al. | Enhanced domination set based routing in mobile ad hoc networks with reliable nodes | |
| JP5664768B2 (en) | Node, link forming method and link forming program | |
| Marwaha et al. | Biologically inspired ant-based routing in mobile ad hoc networks (MANET): a survey | |
| Mir et al. | Data forwarding with finite buffer capacity in opportunistic networks | |
| Chen et al. | Shortcut anycast tree routing in MANETs | |
| Phoummavong et al. | Energy Efficiency by Using Greedy Forwarding Based on Three-hop Information over MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |