WO2019156114A1 - 経路選択装置、経路選択方法及びプログラム - Google Patents

経路選択装置、経路選択方法及びプログラム Download PDF

Info

Publication number
WO2019156114A1
WO2019156114A1 PCT/JP2019/004220 JP2019004220W WO2019156114A1 WO 2019156114 A1 WO2019156114 A1 WO 2019156114A1 JP 2019004220 W JP2019004220 W JP 2019004220W WO 2019156114 A1 WO2019156114 A1 WO 2019156114A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
tree
sensor
nodes
subtree
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.)
Ceased
Application number
PCT/JP2019/004220
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
洋 松浦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Inc
Original Assignee
Nippon Telegraph and Telephone Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to US16/966,753 priority Critical patent/US11553396B2/en
Publication of WO2019156114A1 publication Critical patent/WO2019156114A1/ja
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to a route selection device, a route selection method, and a program in a sensor tree composed of a plurality of nodes including a plurality of sensor nodes.
  • Sensors are placed at specific locations, the humidity, temperature, gas concentration, etc. of the target area are measured by the sensor node, the sensor reports are collected in the data collection tree, and analysis is performed by notifying the base station from the root sensor node.
  • RPL Radio Protocol for Low-power and Lossy Networks
  • the data collection tree is a set of sensor nodes configured in a tree shape and relay nodes that are located between the sensor nodes and play a role of relaying sensor reports, and are also referred to as sensor trees.
  • Each sensor node on the data collection tree combines the required number of sensor reports from that sensor in the collection cycle into a packet together with sensor reports from all the lower sensor nodes of that node on the tree. Send to node. Since there is an upper limit (data aggregation rate: S) for the number of sensor reports that can be stored in one packet, the number of packets sent by each sensor node / relay node is the number of sensor reports that the sensor node / relay node needs to send. And derived from S.
  • E (i) E Tx ⁇ T N (i) + E Rx ⁇ R N (i) (Formula 1)
  • E Tx is the amount of energy required to transmit one sensor packet
  • E Rx is the amount of energy required to receive one sensor packet
  • T N (i) is the node i in one data collection cycle
  • the required number of transmitted packets, R N (i) is the number of received packets that node i needs for one data collection cycle.
  • T N (i) Is represented by the following formulas 2 and 3.
  • T N (i) (d (below_i) + d (i)) / S + 1, (when (d (below_i) + d (i))% S ⁇ 0) (Formula 3)
  • “/” indicates a quotient of division and “%” indicates a remainder of division. From equations 2 and 3, it can be seen that there is a vacant packet to be transmitted and received when the remainder is other than 0. For this reason, it is considered that reducing the number of empty packets in each link is also an effective means for reducing the number of packets.
  • E tree is the sum of energy usage in one data collection cycle of the entire tree T, and therefore can be expressed by the following Expression 4.
  • E tree ⁇ i ⁇ T E (i) (Formula 4)
  • the power used by each sensor is supplied from an AC adapter. In this case, it is necessary to reduce the total power provided to the sensors as much as possible. Therefore, a method for minimizing E tree represented by Expression 4 has been studied (see Non-Patent Document 2).
  • Non-Patent Document 2 addresses two problems. One is the MECAT (Minimum Energy Cost Aggregation Tree) problem.
  • This problem does not generate a sensor report, and there is no WSN (Wireless Sensor) that does not have a relay node used to transfer only the sensor reports of the lower sensor nodes on the tree.
  • WSN Wireless Sensor
  • MECAT-RN MECAT with Relay Node
  • E Tx and E Rx are fixed values, so all links on the tree (adjacent tree nodes use for sensor report transfer), both WSNs with no relay nodes and WSNs with relay nodes. (Relationship) Minimizing the total number of packets transmitted and received is equivalent to the MECAT problem and MECAT-RN problem.
  • the MECAT problem and the MECAT-RN problem are equivalent to the following Expression 5
  • E Tx and E Rx are fixed values, and therefore are equivalent to Expression 6.
  • G indicates the WSN
  • T (G) indicates a tree set on G.
  • e indicates a link on the tree
  • Figure 1 shows an example of the number of link packets on the data collection tree.
  • the data aggregation rate S is set to 5.
  • Node 0 indicates a root node
  • a circle node beginning with N indicates a sensor node
  • a node indicated by a triangle indicates a relay node.
  • the number in parentheses in each node indicates the number of sensor reports generated from the node: d (i), and the underlined number next to it indicates d (below_i).
  • a solid line between nodes indicates a link on the tree, and a direction indicated by ⁇ indicates a packet transmission direction.
  • the number beside the link on the tree indicates the number of packets transmitted on the link in one data collection cycle.
  • Non-Patent Document 2 the shortest path tree created at random is effective for the MECAT problem, and in the shortest path tree, the sensor solution within twice the optimal solution (the minimum total energy consumption used by all tree nodes) It is proved that the total energy consumption is suppressed.
  • the shortest path tree is a tree in which each sensor node on the tree takes the minimum number of hops from the root node. For example, in FIG. 2, (1) indicates the adjacency relationship between nodes on the WSN by dotted lines.
  • the adjacency relationship refers to a relationship in which communication (connection) is possible, for example, a relationship in which one node is within the reach of a radio signal (for example, RSSI (Received Signal Strength Indicator)) from the other node.
  • a radio signal for example, RSSI (Received Signal Strength Indicator)
  • the number in parentheses next to each node is the number of sensor reports that the node reports in one data collection cycle. Examples of sensor trees created on this WSN are shown in (2) to (4).
  • (2) is an example of the shortest path tree, and the hierarchical relationship (link) of the nodes on the tree is indicated by a solid line ⁇ , and using this hierarchical relationship, the node whose sensor report is the root node along the tree 0 is transmitted.
  • all nodes on the tree are on the minimum hop path to node 0.
  • (3) is also an example of the shortest path tree, and it can be seen that there are a plurality of shortest path trees in addition to (2).
  • (4) shows a tree example that is not the shortest path tree. In this example, the number of hops on the tree from node 5 to node 0 is 3, but since the minimum number of hops is 2, it is not the shortest path tree.
  • Non-Patent Document 2 regardless of the number of sensor reports reported by each node, in the case of the shortest path tree, it is confirmed that the total energy of the sensor tree represented by Equation 6 can be suppressed within twice the optimal solution (minimum energy). Prove that.
  • Non-Patent Document 2 shows that it is effective to apply the LAST (Light Approximate Shortest-path Tree) algorithm (see Non-Patent Document 3) for the MECAT-RN problem.
  • the LAST algorithm has parameters: ⁇ , ⁇ , and in a tree created with ( ⁇ , ⁇ ) -LAST, the distance from the root node at each node on the tree is within ⁇ times the shortest path from the root node. It is guaranteed that the total cost (sum of tree link costs) is within ⁇ times the tree cost of MST (minimum spanning tree).
  • Non-Patent Document 2 proves that the tree created by applying (3,2) -LAST on the WSN including the relay node can be suppressed to a total energy amount within 7 times the optimal solution (minimum energy tree). ing.
  • FIG. 3 (1) shows a WSN including a relay node (RN: ⁇ ).
  • the relay node plays a role of relaying between sensor nodes having no adjacent relationship, and the relay node itself is characterized in that it does not transmit a sensor report to the root node 0.
  • a logical link between sensor nodes not including a relay node is created.
  • the logical link indicates the connection between the sensor nodes excluding the relay node.
  • each logical link cost is the minimum number of hops including a relay node between sensor nodes.
  • (3) and (4) are applications of the (3,2) -LAST algorithm.
  • an MST is created in the network of (2).
  • the MST is a tree having a minimum logical link cost constituting a tree extending over all nodes (sensor nodes 0 to 5), and uses the Prim algorithm or the like.
  • (4) which is a feature of (3,2) -LAST
  • the shortest path costs at each node on MST are compared, and if the path on MST> (3 x shortest path from root node) If the condition is satisfied, the MST path is replaced with the shortest path from the root node.
  • the route to the nodes 5 and 2 on the MST is replaced with the shortest route.
  • (5) shows the result of expanding the tree created as a result of the (3,2) -LAST algorithm in (4), including relay nodes. If there are a plurality of routes from node 0 as a result of (5), the shortest route is selected, but in the example of FIG. 3, the route is uniquely determined in each node.
  • FIG. 4 shows a countermeasure when a plurality of routes appear for one node as a result of disassembly into relay nodes.
  • a logical link between sensor nodes not including a relay node is created in (2).
  • the nodes 1 to 4 have two routes to the root node 0.
  • the shortest path is selected in order from the node 1. Since the shortest path from the node 1 is a node via the relay node (r1), the link between the node 1 and the node r2 is deleted. As a result, the path from each node to node 0 is uniquely determined, and the final tree of (5) is generated.
  • Non-Patent Document 2 the upper limit is the energy consumption within 2 times the optimal solution for MECAT problem and 7 times the optimal solution for MECAT-RN problem. There is a concern that energy will increase up to 2 times in the MECAT problem and up to 7 times in the MECAT-RN problem. No method has been proposed to reduce the increase in energy consumption from these optimal solutions.
  • the present invention has been made in view of the above points, and an object of the present invention is to reduce energy usage of nodes on the sensor tree by moving the nodes of the sensor tree and changing the configuration of the sensor tree. To do.
  • a route selection device In a sensor tree composed of a plurality of nodes including a plurality of sensor nodes, a route selection device that selects a route when a sensor report from a lower node is stored in a packet and transmitted to an upper node, In the sensor tree, a first node holding child nodes is selected, and a second node under a subtree having the first node as a vertex is selected as a third node that does not belong to the subtree. When the total number of packets transmitted and received in the sensor tree decreases when moving under the control, the node has a node moving unit that moves the second node under the third node in the sensor tree. .
  • a route selection method includes: A route selection method in a route selection device that selects a route when storing a sensor report from a lower node in a packet and transmitting it to a higher node in a sensor tree composed of a plurality of nodes including a plurality of sensor nodes. There, In the sensor tree, a first node holding child nodes is selected, and a second node under a subtree having the first node as a vertex is selected as a third node that does not belong to the subtree. When the total number of packets transmitted and received in the sensor tree decreases when moving to a subordinate, the step of moving the second node to the subordinate of the third node in the sensor tree is provided.
  • a program according to an aspect of the present invention is A computer is caused to function as each part of the route selection device.
  • the present invention it is possible to reduce the energy usage of the nodes on the sensor tree by moving the nodes of the sensor tree and changing the configuration of the sensor tree.
  • FIG. 5 shows a functional configuration example of the route selection apparatus 100 according to the embodiment of the present invention.
  • a sensor tree composed of a plurality of nodes (sensor nodes / relay nodes)
  • network use is repeated to store a sensor report from a lower node in a packet and transmit it to a higher node.
  • This embodiment can be applied to a WSN in which no relay node exists, and can also be applied to a WSN including a relay node.
  • the energy consumption may increase up to twice the optimal solution.
  • Energy use may increase up to 7 times.
  • the report size of each node there is a difference in the report size of each node, and a node having a larger report size saves energy by reducing the number of links on the tree to the root node as much as possible.
  • the remainder of (d (below_i) + d (i))% S is other than 0, there is a vacant packet to be transmitted / received, so it is better to fill as many sensor reports S that can be accommodated in each packet as possible. It will save energy.
  • the route selection apparatus 100 moves a node of the sensor tree from such a viewpoint, and selects a route that can reduce energy consumption.
  • the route selection device 100 includes a node information acquisition unit 110, a routing request unit 120, a route determination unit 130, a WSN storage unit 140, and a tree storage unit 150.
  • the route determination unit 130 includes a WSN recognition unit 131, an initial tree creation unit 132, a sensor report number calculation unit 133, and a node movement unit 134.
  • the route selection device 100 is included in the route node (0).
  • the route selection device 100 is not necessarily included in the route node, and may be included in, for example, one of the sensor nodes / routes. It may be included in a device connected to a root node such as a station.
  • the node information acquisition unit 110 acquires information on nodes adjacent to the root node, and acquires information on nodes adjacent to those nodes. Similarly, node information acquisition is repeated, and as a result, adjacency relationships of all nodes belonging to the WSN to which the root node belongs can be acquired.
  • the WSN recognition unit 131 in the route determination unit 130 can recognize the configuration of the WSN from the adjacent relationship of the nodes, and stores the WSN configuration in the WSN storage unit 140 as a result.
  • the initial tree creation unit 132 creates an initial tree.
  • the shortest path tree is used in the MECAT problem and the (3,2) -LAST algorithm is used in the MECAT-RN problem.
  • the initial tree created in this way is stored in the tree storage unit 150.
  • the sensor report number calculation unit 133 calculates the total number of sensor reports d (below_i) of the lower nodes transferred by each node i.
  • the node moving unit 134 moves the nodes of the sensor tree so that the total number of packets transmitted and received in the sensor tree is reduced.
  • the total number of packets is calculated from the number of sensor reports d (i) created by node i, the total number of sensor reports d (below_i) of the lower nodes transferred by node i, and the data aggregation rate S when the sensor reports are stored in packets. Desired.
  • the nodes on the initial tree are moved, the total number of packets is reduced.
  • the node moving unit 134 moves the nodes.
  • the resulting tree is stored in the tree storage unit 150.
  • the finally generated tree configuration is reflected in the tree on the actual WSN by setting routing for each node from the routing request unit 120.
  • FIG. 6 is a flowchart showing the operation of the route selection apparatus 100 according to the embodiment of the present invention.
  • Step S101 is a process in which the initial tree creation unit 132 initially creates an initial tree.
  • the initial tree is created by an existing method such as the shortest path tree for the MECAT problem and (3,2) -LAST for the MECAT-RN problem.
  • the node moving unit 134 creates a tree after the node has moved.
  • the sensor report number calculation unit 133 sets, for the initial tree, the number of reports d (i) created by each node i and the total number of sensor reports d (below_i) of lower nodes transferred by each node i. Further, when the total number of sensor reports d (below_i) of the lower nodes transferred by each node i is changed in the tree after the node movement, resetting is performed.
  • the following steps S102 to S105 are processes executed by the node moving unit 134.
  • Step S102 determines the vertex node of the movement target sub-tree in the tree generated in Step S101.
  • the condition at this time is that the vertex node has at least one child node, not a leaf node of the tree. Further, after the tree generation in step S101, a node that has not been selected in the loop of steps S102 to S105 is selected.
  • step S103 it is determined whether or not the vertex node of the subtree has been selected in step S102. If it cannot be selected (No), the tree created up to that point becomes the final output tree, and the process ends. If the vertex node of the subtree can be selected, the process proceeds to step S104.
  • step S104 it is determined whether there is a node under the vertex node (not including the vertex node) of the subtree in which the total number of packets transmitted / received on the tree is reduced due to movement.
  • the condition at this time is that the destination node does not belong to the subtree.
  • step S105 if there is a node determined to have a packet reduction effect due to movement in step S104 (Yes), the process moves to step S101, moves to the destination node, and creates a tree after movement. To do. If it is determined that there is no packet reduction effect due to movement under the subtree (No), the process moves to step S102 to search for a vertex node of another subtree.
  • FIG. 7 shows an example of node movement when the present embodiment is applied to the MECAT problem.
  • the shortest path tree is already formed as shown in FIG.
  • (a, b) written beside each tree node a is the number of sensor reports of one data collection cycle created by node i itself: d (i), and b is node i.
  • the number written beside each link indicates the number of packets transmitted on the link, and the data aggregation rate S is 5.
  • the node 7 is moved among the nodes (nodes 7 to 10) under the subtree having the node 5 as a vertex.
  • the node 7 has four adjacent nodes (node 3, node 4, node 8, and node 9).
  • the nodes 8 and 9 are excluded from the movement destination. The reason is that nodes 8 and 9 belong to a subtree having node 5 as a vertex, and even if the node moves, the total number of sensor reports transmitted by nodes under node 5: d (below_5) does not change. . Therefore, the total number of packets on the tree when the node 7 is moved under the node 3 and when the node 7 is moved under the node 4 is compared, and the node with the smaller total number of packets is moved under the node.
  • the result of moving node 7 under node 4 is shown in FIG. It can be seen that the number of packets in the link (5-2) and the link (2-0) is decreased by 1 as in the case of moving to the node 3 node. However, it can be seen that there is no change in the number of transmitted packets before and after the movement of the node 7 in both the link (3-1) and the link (1-0). Therefore, the decrease in the total number of packets due to this movement is 2, and when the node 3 is moved under the node 3, the decrease number is larger than 1, and the node 7 moves under the node 4.
  • the node moves to a subordinate node where the total number of packets decreases.
  • the route to the nearest ancestor (node 0) that the node 5 and the parent of the movement destination (node 4) have in common to determine the reduction number of the total number of packets. become. That is, only the two routes (5-2-0) and (4-1-0) are sections in which the number of packets changes due to this movement.
  • the root node 0 happens to be a common ancestor, but the closest common ancestor may be other than the root node.
  • the next step is to select the vertex node of the subtree on the tree of FIG. 7 (2), and if there is a movement that reduces the total number of packets in that subtree, move again and move Repeat until there is a tree where there is no reduction in the total number of packets.
  • nodes whose value of d (below_i) has changed due to movement such as nodes on the paths (5-2-0) and (4-1-0), as shown in FIG.
  • the value is updated to a new value for each movement.
  • the node i selected as the vertex node of the subtree is (d (below_i) + d as (d (below_i) + d (i))% S ⁇ 0.
  • a node obtained by dividing (i)) by the data aggregation rate S may be a node larger than 0 (that is, the remainder is 1 or more). This is because, when the remainder is usually 0, the packet accommodation rate is high, so that moving the subordinate node has little effect. Also, by creating such a condition, there is a possibility that the processing time can be shortened because the number of movement target nodes is reduced. That is, the number of routines in steps S102 to S105 in FIG. 6 can be reduced.
  • a change in the total number of packets when the node moves may be obtained, and the movement of the node with the smallest decrease in the total number of packets may be executed.
  • the movement of the node 7 is checked, but since there are nodes 7 to 10 in the subtree under the node 5, the movement possibility of all the nodes is checked, and the packet when moved When the decrease number is 3 or more, the node 7 is moved instead of the node 7.
  • This approach often results in large tree configuration changes that can greatly reduce the total number of packets sent and received on the final tree.
  • an upper limit may be set for the number of times a node such as node 5 in FIG. 7 is selected as the vertex of the subtree. For example, when the upper limit is set to 5 times, if the node 5 has already been selected 5 times, the node 5 is not selected as the vertex node of the subtree. By this means, it is possible to prevent a specific node from being excessively selected as a vertex of the subtree and reduce the processing time. That is, the number of routines in steps S102 to S105 in FIG. 6 can be reduced.
  • an upper limit may be set for the number of times each node moves. For example, if the upper limit number is set to 5 and the node 7 has already moved 5 times, the node 7 is excluded from movement.
  • FIG. 8 shows an example of node movement when the present embodiment is applied to the MECAT-RN problem.
  • a tree including relay nodes has already been configured by the (3,2) -LAST algorithm.
  • R1 to R5 indicate relay nodes
  • the other nodes 0 to 5 indicate sensor nodes.
  • the solid line indicates the adjacency relationship between the tree nodes, and the sensor report is transferred from the lower node to the upper node along the solid line, and finally sent to the root node 0.
  • Dotted lines indicate adjacencies between nodes that are not used in the tree.
  • the number next to the link indicates the number of packets transmitted on the link, and the data aggregation rate S is 5.
  • node 1 is selected as the vertex node of the subtree, and on the tree when the most moved node (node R2, node 3, node R3, node 4) under node 1 in the subtree.
  • a packet having a large decrease in the total number of packets is moved.
  • the node 3, the node R3, and the node 4 which are adjacent to the nodes other than the subtree.
  • node 3 When node 3 is moved under node R5, the number of packets decreases by one for link (1-R1) and link (R1-0), but link (R5-2), link (2-R4), link Since the number of packets is incremented by 1 at (R4-0), the total number of packets is incremented by 1 and is not a movement target.
  • node 3's attribution only changes from node R2 to node R5, so node R3 and node 4 also move to the subtree under node R5. Is to do.
  • the part peculiar to the MECAT-RN problem is that it is necessary to delete the relay node when the sensor node eventually disappears under the relay node like the node R3 in FIG. 8 (2). That is, since the relay node exists to relay the sensor report of the sensor node, it becomes unnecessary when the sensor report is not relayed.
  • FIG. 9A shows the difference between the energy consumption of the shortest path tree per data collection cycle and the energy consumption of the tree after moving the node according to the present embodiment (method 1 and method 2).
  • method 1 only the subtree under the vertex node whose remainder of (d (below_i) + d (i))% S is 1 or more is set as the movement target. Further, in both method 1 and method 2, the upper limit selected as the vertex node of the subtree is 10, and the upper limit of the number of node movements is 10. However, method 1 does not move the node with the largest packet reduction number under the subtree, but moves the node when even one node that has a packet reduction effect is found under the subtree. In method 2, the node having the largest packet reduction number under the selected subtree is moved.
  • FIG. 10 shows the evaluation result of the processing load according to this embodiment.
  • FIG. 10A shows the tree generation time. In a network with 1000 nodes and 13.4 average neighbors like this WSN, it takes about 2 seconds to create the shortest path tree. Including the tree creation time, it takes about 3 seconds for method 1 and 4 to 4.5 seconds for method 2. The tree creation usually does not require real-time characteristics and is not frequent. Therefore, it is considered that the overhead of about 2 seconds does not become a big problem.
  • FIG. 10B shows that the number of movements of method 2 is significantly larger than the number of movements of method 1. From this result, it can be seen that moving a node having the largest number of packet reductions under the sub-tree gives a significant change to the tree structure and increases the number of times of movement. Compared with FIG. 10A, it can be seen that the load for 1000 movements is about 1 second, and the load for one movement is slight.
  • FIG. 11 shows an evaluation result when an upper limit is set for the number of times a node is selected as a vertex of the subtree and an upper limit is set for the number of times the node is moved.
  • FIG. 11 (a) shows the results of calculating the amount of energy used in method 1 and method 2 by changing these upper limit values at intervals of 2 to 14 simultaneously
  • method 2 can generate a tree in less than 4 seconds. It can be seen that by setting these upper limit values around 6, the load can be reduced and the energy reduction can be maintained in some cases.
  • FIG. 12 shows a hardware configuration example of the route selection apparatus 100 according to the embodiment of the present invention.
  • the route selection device 100 may be a computer including a processor such as a CPU (Central Processing Unit) 201, a memory device 202 such as a RAM (Random Access Memory) and a ROM (Read Only Memory), a storage device 203 such as a hard disk, and the like.
  • the functions and processing of the route selection device 100 are realized by the CPU 201 executing data and programs stored in the storage device 203 or the memory device 202.
  • Information necessary for the route selection device 100 may be input from the input / output interface device 204, and a result obtained by the route selection device 100 may be output from the input / output interface device 204.
  • the route selection device according to the embodiment of the present invention has been described using a functional block diagram, but the route selection device according to the embodiment of the present invention may be hardware, software, or their It may be realized in combination.
  • the embodiment of the present invention executes a program for causing a computer to realize the function of the route selection device according to the embodiment of the present invention, and executes each procedure of the method according to the embodiment of the present invention to the computer. It may be realized by a program to be executed.
  • the functional units may be used in combination as necessary.
  • the method according to the embodiment of the present invention may be performed in an order different from the order shown in the embodiment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
PCT/JP2019/004220 2018-02-08 2019-02-06 経路選択装置、経路選択方法及びプログラム Ceased WO2019156114A1 (ja)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/966,753 US11553396B2 (en) 2018-02-08 2019-02-06 Path selection apparatus, path selection method and program

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2018-021370 2018-02-08
JP2018021370A JP6927072B2 (ja) 2018-02-08 2018-02-08 経路選択装置、経路選択方法及びプログラム

Publications (1)

Publication Number Publication Date
WO2019156114A1 true WO2019156114A1 (ja) 2019-08-15

Family

ID=67549641

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2019/004220 Ceased WO2019156114A1 (ja) 2018-02-08 2019-02-06 経路選択装置、経路選択方法及びプログラム

Country Status (3)

Country Link
US (1) US11553396B2 (enExample)
JP (1) JP6927072B2 (enExample)
WO (1) WO2019156114A1 (enExample)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240228741A9 (en) * 2021-02-19 2024-07-11 Daicel Corporation Cellulose acylate composition and production method therefor

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3751800A1 (en) * 2019-06-13 2020-12-16 Pycom Ltd Inter-mesh networks routing protocol
US11102698B2 (en) * 2019-12-30 2021-08-24 Prince Sultan University Tabu node selection with minimum spanning tree for WSNs
US11356501B1 (en) * 2020-12-29 2022-06-07 Here Global B.V. Method, apparatus, and system for dynamic beacons address allocation
CN113207156B (zh) * 2021-04-30 2022-06-07 华北电力大学 一种无线传感器网络的分簇路由方法及系统
US20230102401A1 (en) * 2021-09-30 2023-03-30 Qualcomm Incorporated Inter prediction coding for geometry point cloud compression

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007267381A (ja) * 2006-03-13 2007-10-11 Ntt Docomo Inc データの送信を制御する方法および装置
JP2017038148A (ja) * 2015-08-07 2017-02-16 日本電信電話株式会社 ツリー経路決定装置、及びツリー経路決定方法
JP2017139635A (ja) * 2016-02-04 2017-08-10 日本電信電話株式会社 経路選択装置及び経路選択方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100713590B1 (ko) * 2005-02-04 2007-05-02 삼성전자주식회사 무선 센서 네트워크에서 최소 전력으로 데이터를 전송하기위한 방법
JP2009021654A (ja) * 2007-07-10 2009-01-29 Panasonic Corp 無線通信装置及びその通信負荷算出方法
US10439874B2 (en) * 2017-06-12 2019-10-08 Cisco Technology, Inc. Tracking and implementing workarounds to computer-related issues
US10425281B2 (en) * 2017-11-10 2019-09-24 Cisco Technology, Inc. Automated network entity replacement based on historical topology consciousness
WO2020023909A1 (en) * 2018-07-27 2020-01-30 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks
EP3606280B1 (en) * 2018-08-02 2022-10-05 Mitsubishi Electric R&D Centre Europe B.V. Method for managing a network and apparatus for implementing the same

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007267381A (ja) * 2006-03-13 2007-10-11 Ntt Docomo Inc データの送信を制御する方法および装置
JP2017038148A (ja) * 2015-08-07 2017-02-16 日本電信電話株式会社 ツリー経路決定装置、及びツリー経路決定方法
JP2017139635A (ja) * 2016-02-04 2017-08-10 日本電信電話株式会社 経路選択装置及び経路選択方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240228741A9 (en) * 2021-02-19 2024-07-11 Daicel Corporation Cellulose acylate composition and production method therefor

Also Published As

Publication number Publication date
JP2019140497A (ja) 2019-08-22
JP6927072B2 (ja) 2021-08-25
US11553396B2 (en) 2023-01-10
US20200367133A1 (en) 2020-11-19

Similar Documents

Publication Publication Date Title
WO2019156114A1 (ja) 経路選択装置、経路選択方法及びプログラム
JP5804504B2 (ja) マルチホップ無線ネットワークの経路制御方法
JP5900947B2 (ja) センサネットワークシステム、センサネットワーク制御方法、センサノード、センサノード制御方法、及び、センサノード制御プログラム
EP2638670B1 (en) Dynamic address assignment for address aggregation in low power and lossy networks
JP7119699B2 (ja) 経路選択装置、経路選択方法及びプログラム
CN102740393A (zh) 一种基于动态规划的无线传感器网络路由方法
JP7265200B2 (ja) 経路選択装置、経路選択方法、および経路選択プログラム
Berradi et al. Improvement of OLSR Protocol Using the Hello Message Scheme Based on Neighbors Mobility.
US20230052930A1 (en) Frame compatibility across network protocol version
Becker et al. Performance of routing protocols for real wireless sensor networks
Meghanathan Use of minimum node velocity based stable connected dominating sets for mobile ad hoc networks
KR100994732B1 (ko) 애드 혹 네트워크의 클러스터 형성 방법
Chenji et al. Pareto optimal cross layer lifetime optimization for disaster response networks
JP2018023013A (ja) 経路選択装置、経路選択方法及びプログラム
JP2017139635A (ja) 経路選択装置及び経路選択方法
Di et al. Connected dominating set based hybrid routing algorithm in ad hoc networks with obstacles
Manikandan et al. Performance Analysis of Mobile Ad-Hoc Network Routing Protocols using Network Simulator–2
CN106341843A (zh) 一种基于多路径的无线传感器网络数据流量分流路由方法
Zhang et al. Body-to-body network routing algorithm based on link comprehensive stability
Atri et al. A comparative analysis of MANET routing protocols over TCP
CN101772123A (zh) 一种无线传感器网络中的多源单汇路由算法
Fu et al. Construction k-dominating set with multiple relaying technique in wireless mobile ad hoc networks
Safrianti et al. Discovery Routing Time Speed Comparison of AODV, OLSR and ZRP protocols on MANET
CN107484205B (zh) 一种无线仪表数据传输及获取方法
Taj et al. History Based Reliability: A novel routing metric in mobile ad hoc networks

Legal Events

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

Ref document number: 19750404

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19750404

Country of ref document: EP

Kind code of ref document: A1