WO2013136527A1 - Procédé de sélection de chemin et dispositif sans fil - Google Patents

Procédé de sélection de chemin et dispositif sans fil Download PDF

Info

Publication number
WO2013136527A1
WO2013136527A1 PCT/JP2012/056940 JP2012056940W WO2013136527A1 WO 2013136527 A1 WO2013136527 A1 WO 2013136527A1 JP 2012056940 W JP2012056940 W JP 2012056940W WO 2013136527 A1 WO2013136527 A1 WO 2013136527A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
power supply
evaluation value
value
wireless device
Prior art date
Application number
PCT/JP2012/056940
Other languages
English (en)
Japanese (ja)
Inventor
岳夫 本田
秀成 三輪
瑞直 石川
正和 由良
Original Assignee
富士通株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 富士通株式会社 filed Critical 富士通株式会社
Priority to PCT/JP2012/056940 priority Critical patent/WO2013136527A1/fr
Publication of WO2013136527A1 publication Critical patent/WO2013136527A1/fr

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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0219—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave where the power saving management affects multiple terminals
    • 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 method and a wireless device.
  • each node transmits a packet to a destination by relaying the packet received from an adjacent node to another node based on communication path information. That is, each node calculates an evaluation value of a plurality of communication paths leading to a certain target node, selects an adjacent node included in a communication path with a better evaluation value as a relay node as a packet transfer destination, and selects a packet. Forward.
  • the communication path evaluation value is calculated using, for example, an evaluation formula that combines a plurality of types of evaluation parameters.
  • a node using an external power source such as an AC power source as a driving power source and a node using an internal power source such as a battery as the driving power source coexist. Even in this case, each node selects a relay node as a packet transfer destination regardless of the type of power supply of the node. For this reason, nodes using an AC power source and nodes using a battery are equally selected as packet transfer destinations. However, a node using a battery becomes unusable when the electric power stored in the battery is exhausted. Therefore, it is desired to suppress the power consumption of the node using the battery as much as possible.
  • each node acquires information indicating the type of power supply of other nodes, and when the acquired information indicates an AC power supply, the other node is selected as a packet transfer destination, There is a technique for excluding other nodes from the packet transfer destination when a battery is indicated. Further, there is a technique in which each node measures the remaining power of the battery of another node and determines whether or not to select another node as a packet transfer destination based on the measured remaining power.
  • JP 2004-282268 A Japanese Patent Laid-Open No. 2005-160062
  • the above-described conventional technology has a problem in that although it is possible to suppress power consumption of a node using a battery as a power source, an appropriate communication path may not necessarily be selected.
  • the other node having the smallest remaining power is excluded from the packet transfer destination. Only the node using the AC power supply is selected as the packet transfer destination. For this reason, when nodes using AC power supplies are installed at positions separated from each other, the communication path becomes a detour and there is a possibility that the arrival rate of the packet is lowered.
  • the disclosed technology has been made in view of the above, and provides a route selection method and a wireless device capable of selecting an appropriate communication route while suppressing power consumption of a node using a battery as a power source. With the goal.
  • the route selection method disclosed in the present application is, in one aspect, a route selection method in a wireless device constituting an ad hoc network.
  • the route selection method power information indicating whether an adjacent wireless device or the power supply of the wireless device is an internal power supply or an external power supply is acquired.
  • the route selection method calculates a first value as an evaluation value of a route between the adjacent wireless device and the wireless device when the acquired power supply information indicates an internal power supply.
  • a second value indicating that the evaluation value is higher in quality than the first value is calculated.
  • the route selection method may include the neighboring corresponding to the evaluation value representing the highest quality among the addition values of the evaluation value of the route from each adjacent wireless device to the destination and the calculated evaluation value. Are selected as transfer destinations when packets are transmitted to the destination.
  • route selection method it is possible to select an appropriate communication route while suppressing power consumption of a node using a battery as a power source.
  • FIG. 1 is a diagram illustrating the configuration of the ad hoc network according to the first embodiment.
  • FIG. 2 is a diagram illustrating an example of a data structure of a hello packet according to the first embodiment.
  • FIG. 3 is a functional block diagram illustrating the configuration of the node according to the first embodiment.
  • FIG. 4 is a diagram illustrating an example of a data structure of the work table according to the first embodiment.
  • FIG. 5 is a diagram illustrating an example of a data structure of the communication path table according to the first embodiment.
  • FIG. 6 is a diagram illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit according to the first embodiment.
  • FIG. 7 is a diagram for explaining an example of a processing flow from when the node according to the first embodiment receives a hello packet to when a data packet transfer destination is selected.
  • FIG. 8 is a flowchart illustrating a processing procedure of processing for calculating an evaluation value of a wireless link from a node according to the first embodiment to a destination node and storing the evaluation value in a communication path table.
  • FIG. 9 is a flowchart showing a processing procedure of processing for transferring a data packet.
  • FIG. 10 is a flowchart illustrating a processing procedure of processing for transmitting a hello packet.
  • FIG. 11 is a flowchart illustrating a processing procedure for transmitting a data packet.
  • FIG. 12 is a diagram illustrating verification conditions of the verification method according to the first embodiment.
  • FIG. 13 is a diagram illustrating weighting factors of other evaluation parameters.
  • FIG. 14 is a diagram illustrating a configuration of an ad hoc network applied to a simulation program.
  • FIG. 15 is a diagram illustrating a result of comparing the average value of the number of relay packets of the battery nodes included in the ad hoc network for each verification condition.
  • FIG. 16 is a diagram illustrating a result of comparing the average value of the number of relay packets of the AC power supply node included in the ad hoc network for each verification condition.
  • FIG. 17 is a diagram illustrating a result of comparing the ratio between the number of relay packets of the AC power supply node and the number of relay packets of the battery node in the total number of packets for each verification condition.
  • FIG. 15 is a diagram illustrating a result of comparing the average value of the number of relay packets of the battery nodes included in the ad hoc network for each verification condition.
  • FIG. 16 is a diagram illustrating
  • FIG. 18 is a diagram illustrating a result of comparing the drop rate for each verification condition.
  • FIG. 19 is a diagram (part 1) illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit according to the second embodiment.
  • FIG. 20 is a diagram (part 2) illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit according to the second embodiment.
  • FIG. 21 is a flowchart illustrating a processing procedure of processing for calculating an evaluation value of a wireless link from a node according to the second embodiment to a destination node and storing the evaluation value in a communication path table.
  • FIG. 19 is a diagram (part 1) illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit according to the second embodiment.
  • FIG. 20 is a diagram (part 2) illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit according to the second embodiment.
  • FIG. 21 is a flowchart illustrating a processing
  • FIG. 22 is a diagram illustrating a result of comparing the number of out-of-battery nodes included in the ad hoc network for each verification condition.
  • FIG. 23 is a diagram illustrating a hardware configuration of a computer that configures a node according to the first and second embodiments.
  • FIG. 1 is a diagram illustrating the configuration of the ad hoc network according to the first embodiment.
  • the ad hoc network includes a GW (Gate Way) 1 and nodes 100a to 100e.
  • the nodes 100a to 100e are examples of wireless devices.
  • the ad hoc network may have other nodes.
  • GW1 and each of the nodes 100a to 100e are connected to adjacent nodes by wireless links.
  • a wireless link is an example of a route.
  • the GW 1 is connected to the nodes 100c, 100d, and 100e.
  • the node 100a is connected to the nodes 100b and 100c.
  • the node 100b is connected to the nodes 100a, 100d, and 100e.
  • the node 100c is connected to the nodes 100a, 100e, and GW1.
  • the node 100d is connected to the nodes 100b and GW1.
  • the node 100e is connected to the nodes 100b, 100c, and GW1.
  • the nodes 100a, 100b, and 100e are nodes (hereinafter referred to as “AC power supply nodes”) that use AC power as an example of external power as drive power.
  • the nodes 100c and 100d are nodes (hereinafter referred to as “battery nodes”) that use batteries, which are examples of internal power supplies, as drive power supplies.
  • the nodes 100a to 100e are collectively referred to as the node 100 when the nodes 100a to 100e are not particularly distinguished.
  • the node 100 constructs a communication path by transmitting and receiving a hello packet.
  • the node 100 calculates a communication path evaluation value using a plurality of types of evaluation parameters including a parameter indicating the type of power supply of the node 100 or the adjacent node 100.
  • the node 100 receives the data packet to be transferred or transmits a new data packet, the node 100 selects a communication path corresponding to the evaluation value indicating the highest quality, and selects the selected communication path. The data packet is transferred.
  • the node 100 calculates a different value as the evaluation value of the radio link with the adjacent node 100 depending on whether the power type of the adjacent node 100 or the own node 100 is a battery or an AC power supply. To do. Specifically, when the type of power supply of the adjacent node 100 or the own node 100 is an AC power supply, the node 100 uses a value indicating that the quality is higher than the value corresponding to the battery as the evaluation value of the radio link. calculate. Then, the node 100 transmits, to the destination, a route having the highest quality of the added value of the evaluation value of the wireless link from the adjacent node 100 to the destination node 100 and the calculated evaluation value of the wireless link. Select as the destination of the data packet. Thereby, it is possible to preferentially select the communication path including the AC power supply node while reducing the opportunity for selecting the communication path including the battery node.
  • the higher the quality of the radio link the smaller the evaluation value.
  • the evaluation value that decreases as the quality of the radio link increases is equivalent to an evaluation value in which the quality of the radio link is replaced with the concept of distance, and is also referred to as “path quality distance”.
  • FIG. 2 is a diagram illustrating an example of a data structure of a hello packet according to the first embodiment.
  • this hello packet has a transmission source, power supply information, a destination, ⁇ D, and the number of hops.
  • the “source” stores the address of the node that is the source of the hello packet.
  • the “power supply information” stores power supply information indicating whether the power source of the “transmission source” node of the hello packet is a battery or an AC power supply.
  • “Destination” stores the address of the destination node of the communication path.
  • “ ⁇ D” stores the total value of the evaluation values of the radio links from the “destination” node to the “transmission source” node of the hello packet.
  • the “hop count” stores the number of hops from the “source” node to the “destination” node of the hello packet.
  • FIG. 3 is a functional block diagram illustrating the configuration of the node according to the first embodiment.
  • the node 100 according to the first embodiment includes a wireless communication unit 110, an input unit 120, a display unit 130, a storage unit 140, and a control unit 150.
  • the wireless communication unit 110 is a device that performs wireless data communication with adjacent nodes.
  • the wireless communication unit 110 corresponds to a wireless link module or the like.
  • the control unit 150 transmits / receives a hello packet, a data packet, and the like to / from an adjacent node via the wireless communication unit 110.
  • the input unit 120 is an input device for inputting various information to the node 100.
  • the input unit 120 corresponds to a keyboard, a mouse, a touch panel, and the like.
  • the display unit 130 is a display device that displays various types of information.
  • the display unit 130 corresponds to a display, a touch panel, and the like.
  • the storage unit 140 stores a work table 141 and a communication path table 142, for example.
  • the storage unit 140 corresponds to, for example, a semiconductor memory element such as a RAM (Random Access Memory), a ROM (Read Only Memory), and a flash memory (Flash Memory), or a storage device such as a hard disk or an optical disk.
  • the work table 141 is a table for temporarily storing hello packet information.
  • FIG. 4 is a diagram illustrating an example of a data structure of the work table according to the first embodiment. As shown in FIG. 4, this work table 141 has a destination, a transfer destination, ⁇ D, D, and the number of hops. Among these, the destination and the transfer destination store the destination and source of the hello packet shown in FIG. As the hop count, a value obtained by incrementing the hop count of the hello packet is stored. D stores the evaluation value of the radio link between the transfer destination node and the own node 100. ⁇ D stores an addition value of the value of ⁇ D of the hello packet and the value of D of the work table 141.
  • the communication path table 142 is a table that stores information on communication paths.
  • FIG. 5 is a diagram illustrating an example of a data structure of the communication path table according to the first embodiment. As illustrated in FIG. 5, the communication path table 142 stores a destination, a transfer destination, ⁇ D, the number of hops, and an update time in association with each other.
  • the destination indicates the destination of the packet.
  • the transfer destination indicates a transfer destination when the packet is transferred to the destination.
  • ⁇ D is a total value of the evaluation values of the radio links from the own node 100 to the destination node.
  • the number of hops indicates the number of hops from the own node 100 to the destination node.
  • the update time indicates the latest update time of the record in the communication path table 142.
  • the communication path table 142 shown in FIG. 5 indicates that there are a plurality of communication paths having the same destination. For example, in FIG. 5, there are two communication paths for the destination “GW1”. Specifically, there are a communication path having the transfer destination “node 100b” and a communication path having the transfer destination “node 100c”. In FIG. 5, for convenience of explanation, the name of the node is shown as the destination or transfer destination, but the address of the node may be registered.
  • the control unit 150 includes a power supply information acquisition unit 151, an evaluation value calculation unit 152, a route selection unit 153, a hello packet generation unit 154, and a data packet generation unit 155.
  • the control unit 150 corresponds to an integrated device such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA).
  • the power source information acquisition unit 151 acquires and acquires power source information indicating whether the power source of the adjacent node or the own node 100 is a battery or an AC power source at the time of transmission / reception of a hello packet with the adjacent node.
  • the power supply information is output to the evaluation value calculation unit 152.
  • the power information acquisition unit 151 When receiving the hello packet, the power information acquisition unit 151 extracts the power information included in the hello packet and acquires the power information of the adjacent node that is the transmission source of the hello packet. Furthermore, the power information acquisition unit 151 acquires the power information of the own node 100 held in a predetermined area of the storage unit 140. The power information acquisition unit 151 outputs the acquired power information of adjacent nodes and the power information of the own node 100 to the evaluation value calculation unit 152.
  • the evaluation value calculation unit 152 calculates the evaluation value D of the radio link between the adjacent node and the own node 100 at the time of transmission / reception of the hello packet with the adjacent node.
  • the evaluation value D of the radio link calculated by the evaluation value calculation unit 152 is a different value depending on the type of power supply of the adjacent node or the own node 100. For example, the evaluation value calculation unit 152 calculates “20” as the evaluation value of the radio link when the power supply of the adjacent node or the own node 100 is a battery. On the other hand, the evaluation value calculation unit 152 sets “1” indicating that the evaluation value of the radio link is higher than “20” as the evaluation value of the radio link when the power supply of the adjacent node or the own node 100 is an AC power supply. calculate.
  • the evaluation value calculation unit 152 detects the reception quality of a hello packet when a hello packet is received from an adjacent node.
  • the evaluation value calculation unit 152 uses an average value of the radio wave intensity of the hello packet, a dispersion value of the radio wave intensity of the hello packet, an average value of the reception period of the hello packet, and a reception period of the hello packet The variance value of is detected.
  • the evaluation value calculation unit 152 receives the power supply information of the adjacent node and the power supply information of the own node 100 from the power supply information acquisition unit 151.
  • the evaluation value calculation unit 152 holds a conversion table in which each reception quality and power supply information as evaluation parameters are associated with evaluation values that are conversion values of the evaluation parameters.
  • FIG. 6 is a diagram illustrating an example of a data structure of a conversion table held by the evaluation value calculation unit 152 according to the first embodiment.
  • the conversion table shown in FIG. 6 stores evaluation parameters and evaluation values in association with each other.
  • the evaluation parameter includes items of radio wave intensity average value, radio wave intensity dispersion value, reception cycle average value, reception cycle dispersion value, and power supply information.
  • the radio field intensity average value indicates the average radio field intensity of the hello packet.
  • the radio field intensity dispersion value indicates the dispersion value of the radio field intensity of the hello packet.
  • the reception period average value indicates an average value of the reception period of the hello packet.
  • the reception cycle dispersion value indicates a dispersion value of the reception cycle of the hello packet.
  • the evaluation parameter further includes an item of power supply information.
  • the power source information indicates whether the power source of the node is a battery or an AC power source.
  • an evaluation value shows the conversion value of each evaluation parameter.
  • the evaluation value is smaller than the value corresponding to the battery when the power supply information indicates an AC power supply. For example, in FIG. 6, the evaluation value “1” when the power supply information “ps” is “AC power supply” is smaller than the evaluation value “20” corresponding to “battery”.
  • the evaluation value calculation unit 152 compares the conversion table with the detected reception quality and the received power supply information to determine an evaluation value. For example, in FIG. 6, the evaluation value calculation unit 152 determines the evaluation value “2” when the radio wave intensity average value “x” that is the reception quality is “45”. For example, the evaluation value calculation unit 152 determines the evaluation value “20” when the power supply information “ps” is “battery”.
  • the evaluation value calculation unit 152 applies the determined evaluation value to an evaluation formula that adds each reception quality and power supply information, which are evaluation parameters, while weighting them, so that the adjacent node and the own node 100 can be compared.
  • the evaluation value D of the wireless link is calculated.
  • the evaluation value calculation unit 152 calculates the evaluation value D of the radio link between the adjacent node and the own node 100 by applying the determined evaluation value to the evaluation formula shown by the following formula (1). To do.
  • Equation (1) a, b, c, d, and d are weighting factors.
  • Px, Py, Pz, Pw, and Pps are evaluation parameters indicating a radio wave intensity average value, a radio wave intensity variance value, a reception cycle average value, a reception cycle variance value, and radio wave information, respectively.
  • the evaluation value calculation unit 152 stores the calculated D in the work table 141.
  • the evaluation value calculation unit 152 uses the following equation (2). May be used to calculate the evaluation value D of the radio link.
  • Db is D in the formula (1).
  • D calculated using equation (2) is a round-trip evaluation value of the radio link.
  • the evaluation value calculation unit 152 when the evaluation value calculation unit 152 receives a hello packet, the evaluation value calculation unit 152 stores information included in the hello packet in the work table 141 and updates the communication path table 142 based on the record of the work table 141.
  • the evaluation value calculation unit 152 receives the hello packet and sets the destination included in the hello packet as the destination of the work table 141.
  • the evaluation value calculation unit 152 sets the transmission source node of the hello packet as the transfer destination of the work table 141.
  • the evaluation value calculation unit 152 stores a value obtained by adding the D value of the work table 141 to the ⁇ D value of the hello packet in the ⁇ D of the work table 141.
  • ⁇ D stored in the work table 141 corresponds to the evaluation value of the radio link from the own node 100 to the destination node.
  • the evaluation value calculation unit 152 stores a value obtained by incrementing the hop number of the hello packet in the hop number of the work table 141. Note that the evaluation value calculation unit 152 sets D in the work table 141 to have been set by the above processing.
  • the evaluation value calculation unit 152 updates the communication path table 142 based on the work table 141. Specifically, the evaluation value calculation unit 152 sets the destination, transfer destination, ⁇ D, and hop count included in the work table 141 in the communication path table 142, and sets the current time as the update time of each record.
  • the route selection unit 153 is a processing unit that selects a packet route when a packet is transmitted to a destination based on the communication route table 142.
  • a process in which the route selection unit 153 selects a route of a packet will be described.
  • the route selection unit 153 receives a data packet from a data packet generation unit 155 described later.
  • the route selection unit 153 refers to the communication route table 142 and compares ⁇ D for each identical destination. As a result of the comparison, the route selection unit 153 selects the transfer destination node having the smallest value of ⁇ D in the communication route table 142, and transmits the data packet to the selected transfer destination node.
  • ⁇ D for each identical destination.
  • the path selection unit 153 selects the node 100b that is the first transfer destination having the smallest value of ⁇ D, and transmits the data packet to the selected node 100b. In other words, the path selection unit 153 does not select the node 100c that is the second-stage transfer destination having a value of ⁇ D larger than that of the first stage.
  • Node 100b is an AC power supply node
  • node 100c is a battery node. Therefore, the node 100 according to the present embodiment can reduce the chance of selecting a route in which the transmission destination of the data packet is a battery node, and can preferentially select the AC power supply node as the transmission destination of the data packet.
  • the route selection unit 153 selects a route for transferring the data packet.
  • the route selection unit 153 refers to the communication route table 142 and compares ⁇ D for each identical destination. As a result of the comparison, the route selection unit 153 selects the transfer destination node having the smallest value of ⁇ D in the communication route table 142, and transfers the data packet to the selected transfer destination node.
  • the destinations of the first stage and the second stage are the same, and the value of the first stage ⁇ D is smaller than the value of the second stage ⁇ D.
  • the route selection unit 153 selects the node 100b that is the first-stage transfer destination having the smallest value of ⁇ D, and transfers the data packet to the selected node 100b.
  • the path selection unit 153 does not select the node 100c that is the second-stage transfer destination having a value of ⁇ D larger than that of the first stage.
  • Node 100b is an AC power supply node
  • node 100c is a battery node. Therefore, the node 100 according to the present embodiment can reduce the chance of selecting a route in which the transfer destination of the data packet is a battery node, and can preferentially select the AC power supply node as the transfer destination of the data packet.
  • the hello packet generation unit 154 is a processing unit that generates a hello packet based on the communication path table 142 and broadcasts the generated hello packet. For example, the hello packet generation unit 154 generates a hello packet every time a clock event occurs, and broadcasts the generated hello packet.
  • the hello packet generation unit 154 refers to the communication path table 142 and groups records for each destination.
  • the hello packet generation unit 154 sets a common destination for the group as the destination of the hello packet, and sets its own node 100 as the transmission source of the hello packet.
  • the hello packet generation unit 154 sets the hop number of the communication path table 142 to the hop number of the hello packet, and sets the power information of the own node 100 to the power information of the hello packet.
  • the hello packet generation unit 154 generates a hello packet by setting the minimum ⁇ D among the ⁇ Ds included in the group to ⁇ D of the hello packet.
  • the data packet generation unit 155 is a processing unit that generates a data packet and outputs the generated data packet to the route selection unit 153. For example, the data packet generation unit 155 generates a data packet when receiving a data packet transmission instruction from the input unit 120. The data packet generation unit 155 may generate a data packet every time a clock event occurs.
  • FIG. 7 is a diagram for explaining an example of a processing flow from when the node 100 according to the first embodiment receives a hello packet to when a transfer destination of a data packet is selected.
  • the node 100 when the node 100 receives the hello packet 161 from the adjacent node, the node 100 extracts the power supply information included in the hello packet 161, so that the power supply information of the adjacent node that is the transmission source of the hello packet 161 is obtained. 162 is acquired. The node 100 acquires the power supply information 163 of the own node 100 held in the storage unit 140. Further, the node 100 detects the reception quality 164 of the received hello packet 161.
  • the node 100 associates the reception quality and power supply information as evaluation parameters with evaluation values that are conversion values of the evaluation parameters, power supply information 162 of adjacent nodes, and power supply information 163 of the own node 100. And the reception quality 164 is compared.
  • the own node 100 determines the evaluation value as a result of the comparison, and applies the determined evaluation value to an evaluation expression that weights and adds each evaluation parameter, thereby allowing the radio link between the adjacent node and the own node 100 to The evaluation value 165 is calculated.
  • the node 100 calculates the evaluation value 165 of the wireless link round-trip. Also good.
  • the node 100 adds the calculated evaluation value 165 to the evaluation value 166 of the wireless link from the adjacent node to the destination node included in the hello packet 161, and reaches from the node 100 to the destination node.
  • An evaluation value 167 of the wireless link is calculated.
  • the own node 100 sets the evaluation value 167 of the radio link from the own node 100 to the destination node in the communication route table 168, and updates the communication route table 168.
  • the communication path table 168 corresponds to the communication path table 142 illustrated in FIG.
  • the node 100 when the node 100 receives the data packet 169 to be transferred, the node 100 refers to the communication path table 142 and compares ⁇ D for each identical destination. As a result of the comparison, the node 100 selects the transfer destination node having the smallest value of ⁇ D, and transfers the data packet 169 to the selected transfer destination node.
  • FIG. 8 is a flowchart illustrating a processing procedure of processing for calculating an evaluation value of a wireless link from a node according to the first embodiment to a destination node and storing the evaluation value in a communication path table.
  • the process illustrated in FIG. 8 is executed when a hello packet is received.
  • step S101 when the node 100 has not received the hello packet (step S101; No), the process ends.
  • the node 100 receives the hello packet (step S101; Yes)
  • the node 100 acquires the power information of the adjacent node that is the transmission source of the hello packet and the power information of the own node 100 held in the storage unit 140. (Step S102). Further, the node 100 detects the reception quality of the received hello packet.
  • the node 100 calculates the evaluation value D of the radio link between the adjacent node and the own node 100 based on the acquired power supply information and the received reception quality of the hello packet (step S103).
  • the node 100 newly creates a record in the work table 141 (step S104), and sets the “destination” included in the hello packet in the “destination” of the work table 141 (step S105).
  • the node 100 sets the address of the “transmission source” node of the hello packet in “transfer destination” of the work table 141 (step S106).
  • the node 100 stores “D” calculated in step S103 in “D” of the work table 141 (step S107).
  • the node 100 stores a value obtained by adding “ ⁇ D” included in the hello packet and “D” of the work table 141 as “ ⁇ D” of the work table 141 (step S108).
  • step S109 When the same “destination” and “transfer destination” records do not exist in the communication path table 142 (step S109; No), the node 100 stores the created record in the work table 141 in the communication path table 142. A new addition is made (step S110). Then, the node 100 moves the process to step S112.
  • step S109 when the same “destination” and “forwarding destination” records exist in the communication path table 142 (step S109; Yes), the node 100 overwrites them (step S111).
  • step S112 When there is an unprocessed packet received (step S112; Yes), the node 100 acquires unprocessed information (step S113), and returns the process to step S104.
  • step S112 when there is no unprocessed packet received (step S112; No), the node 100 ends the process.
  • FIG. 9 is a flowchart showing a processing procedure of processing for transferring a data packet. For example, the process shown in FIG. 9 is executed when a data packet is received.
  • step S201 when the node 100 has not received a data packet (step S201; No), the process ends.
  • step S201; Yes when receiving the data packet (step S201; Yes), the node 100 determines whether or not the destination of the data packet is its own address (step S202). If the destination of the data packet is its own address (step S202; Yes), the node 100 executes predetermined data processing based on the data packet (step S203).
  • the node 100 searches the communication path table 142 and groups the same “destination” (step S204). The node 100 compares “ ⁇ D” in the group, selects the “transfer destination” with the smallest “ ⁇ D” (step S205), and adds the selected “transfer destination” to the header of the data packet (step S206). ). Then, the node 100 transfers the data packet to the selected “transfer destination” node (step S207).
  • FIG. 10 illustrates a process for transmitting a hello packet.
  • FIG. 10 is a flowchart illustrating a processing procedure of processing for transmitting a hello packet. For example, the process shown in FIG. 10 is executed when a clock event occurs.
  • step S301 when there is no clock event, the node 100 returns the process to step S301.
  • step S301 Yes
  • the node 100 searches the communication path table 142 and groups the same “destination” (step S302).
  • the node 100 sets a common destination for the group in the “destination” of the hello packet (step S303).
  • the node 100 sets its own address as the “source” of the hello packet (step S304).
  • the node 100 sets the “hop number” of the communication path table 142 to the “hop number” of the hello packet (step S305), and sets the power information of the node 100 to the “power information” of the hello packet (step S306). ).
  • the node 100 sets the minimum “ ⁇ D” in the group to “ ⁇ D” of the hello packet (step S307). Then, the node 100 transmits a hello packet (step S308).
  • FIG. 11 is a flowchart illustrating a processing procedure for transmitting a data packet. For example, the process illustrated in FIG. 11 is executed when a data packet transmission instruction is received.
  • step S401 when the node 100 has not received a data packet transmission instruction (step S401; No), the process returns to step S401.
  • step S401 when the node 100 receives a data packet transmission instruction (step S401; Yes), the node 100 generates a data packet (step S402).
  • the node 100 searches the communication route table 142 and groups the same “destination” (step S403).
  • the node 100 compares “ ⁇ D” in the group and selects the “transfer destination” with the smallest “ ⁇ D” (step S404). The node 100 adds the selected “transfer destination” to the header of the data packet (step S405). Then, the node 100 transmits a data packet (step S406).
  • the node 100 included in the ad hoc network calculates a different value as the evaluation value of the radio link with the adjacent node according to the type of the power supply of the adjacent node or the own node 100. That is, the node 100 calculates a value indicating that the quality is higher than the value corresponding to the battery as the evaluation value of the radio link when the type of the power supply of the adjacent node or the node 100 is an AC power supply. Then, the own node 100 selects, as the transfer destination of the packet to be transmitted to the destination, the route having the highest quality value of the evaluation values of the radio links from the own node 100 to the destination node.
  • the node 100 can preferentially select the communication path including the AC power supply node while reducing the chance of selecting the communication path including the battery node. As a result, the node 100 can select an appropriate communication path while suppressing the power consumption of the battery node. For example, in the case where the AC power supply nodes are installed at positions separated from each other, the node 100 does not make a detour by selecting a communication path including a battery node instead of the AC power supply node, and packet It is possible to select a route that maintains the arrival rate.
  • the battery life of a battery node and the arrival rate of packets in an ad hoc network were verified using an existing simulation program.
  • the average value of the number of packets relayed by each of the AC power supply node and the battery node as an intermediate node of the ad hoc network (hereinafter “relay packet number”) is compared for each verification condition described later.
  • the average value of the number of relay packets is a value obtained by dividing the total number of packets by the number of AC power supply nodes or the number of battery nodes.
  • the Drop rate which is the ratio of unreachable packets that have not reached the destination, with respect to all packets is compared for each verification condition described later.
  • FIG. 12 is a diagram illustrating verification conditions of the verification method according to the first embodiment.
  • the above-described evaluation formula (1) is applied to the simulation program.
  • the verification condition “A” is a condition that the evaluation parameter “Pps” corresponding to the power supply information is deleted from the evaluation formula shown by the formula (1). That is, in the verification condition “A”, “0” is set to the weighting coefficient “e” of the evaluation parameter “Pps”.
  • the verification condition “B” is a condition that a relatively small value is set in the weighting coefficient “e” of the evaluation parameter “Pps” in the evaluation formula shown by the formula (1).
  • the verification condition “C” is a condition in the evaluation formula shown by the formula (1) that a value larger than the value of the verification condition “B” is set for the weighting coefficient “e” of the evaluation parameter “Pps”. . That is, in the verification condition “C”, “100” is set to the weighting coefficient “e” of the evaluation parameter “Pps”.
  • the verification condition “D” is a condition that the maximum value in the simulation program is set to the weighting coefficient “e” of the evaluation parameter “Pps” in the evaluation formula shown by the formula (1).
  • the maximum value “65535” is set to the weighting coefficient “e” of the evaluation parameter “Pps”.
  • the verification condition “D” corresponds to the prior art that excludes the battery node from the packet transfer destination.
  • the values shown in FIG. 13 are used as the weighting coefficients of evaluation parameters other than the evaluation parameter “Pps”.
  • FIG. 13 is a diagram illustrating weighting factors of other evaluation parameters.
  • the conversion table shown in FIG. 6 is used as a conversion table in which each evaluation parameter is associated with an evaluation value.
  • FIG. 14 is a diagram illustrating a configuration of an ad hoc network applied to a simulation program.
  • the ad hoc network shown in FIG. 14 includes one gateway (GW), 25 AC power supply nodes, and 81 battery nodes.
  • FIG. 15 is a diagram illustrating a result of comparing the average value of the number of relay packets of the battery nodes included in the ad hoc network for each verification condition.
  • FIG. 16 is a diagram illustrating a result of comparing the average value of the number of relay packets of the AC power supply node included in the ad hoc network for each verification condition.
  • FIG. 17 is a diagram illustrating a result of comparing the ratio between the number of relay packets of the AC power supply node and the number of relay packets of the battery node in the total number of packets for each verification condition. From the results shown in FIGS.
  • each node of the ad hoc network according to the first embodiment preferentially selects the communication path including the AC power supply node while reducing the chance of selecting the communication path including the battery node.
  • Example 1 it can be seen that the battery life of the battery node can be extended.
  • FIG. 18 is a diagram illustrating a result of comparing the drop rate for each verification condition. From the result shown in FIG. 18, the Drop rate corresponding to the verification condition “D” is the largest, and the Drop rate corresponding to the verification conditions “B” and “C” is maintained equal to the Drop rate corresponding to the verification condition “A”. You can see that. These results mean that each node of the ad hoc network according to the first embodiment selects an appropriate route that maintains the packet arrival rate.
  • the node according to the second embodiment is the same as the first embodiment except that the processing content of the evaluation value calculation unit 152 is different from the node according to the first embodiment, the description overlapping with the first embodiment is omitted.
  • the evaluation value calculation unit 152 measures the remaining power of the battery of the own node 100 at the time of transmission / reception of the hello packet with the adjacent node, and between the adjacent node and the own node 100 according to the measured remaining power. An evaluation value D of the radio link is calculated.
  • the evaluation value calculation unit 152 detects the reception quality of a hello packet when a hello packet is received from an adjacent node.
  • the evaluation value calculation unit 152 includes, as an example of reception quality, an average value of the radio wave intensity of the hello packet, a dispersion value of the radio wave intensity of the hello packet, an average value of the reception period of the hello packet, and a reception period of the hello packet. Detect the variance value.
  • the evaluation value calculation unit 152 receives the power supply information of the adjacent node and the power supply information of the own node 100 from the power supply information acquisition unit 151.
  • the evaluation value calculation unit 152 measures the remaining power of the battery when the power supply information of the own node 100 indicates the battery.
  • the evaluation value calculation unit 152 holds a conversion table in which each received product as an evaluation parameter, power supply information, and remaining power of the battery are associated with an evaluation value that is a conversion value of the evaluation parameter.
  • the conversion table shown in FIG. 19 stores the radio wave intensity average value, radio wave intensity dispersion value, reception period average value, reception period dispersion value, power supply information, and power supply information as evaluation parameters in association with each other.
  • the conversion table shown in FIG. 20 stores the remaining power of the battery as the evaluation parameter and the evaluation value of the power supply information indicating the battery in association with each other.
  • the explanation of the radio wave intensity average value, radio wave intensity dispersion value, reception period average value, reception period dispersion value, and power supply information is the same as that in FIG.
  • the remaining power of the battery indicates the remaining power of the battery of the own node 100.
  • an evaluation value shows the conversion value of each evaluation parameter.
  • the evaluation value is a fixed value smaller than the value corresponding to the battery when the power supply information indicates an AC power supply, and is larger than the fixed value corresponding to the AC power supply when the power supply information indicates a battery. It becomes. Furthermore, when the power supply information indicates a battery, the difference between the evaluation value and the fixed value corresponding to the AC power supply increases as the remaining power of the battery decreases. For example, in FIGS. 19 and 20, the evaluation value when the power supply information “ps” is “battery” becomes a larger value as the remaining power “b” of the battery is smaller. Further, in FIG. 19 and FIG. 20, the difference between the evaluation value when the power information “ps” is “battery” and the evaluation value “1” when the power information “ps” is “AC power” increases. .
  • the evaluation value calculation unit 152 determines the evaluation value by comparing the conversion table with the detected reception quality, the received power supply information, and the remaining power of the battery. For example, in FIG. 19, the evaluation value calculation unit 152 determines the evaluation value “1” when the power supply information “ps” is “AC power supply”. For example, in FIG. 19 and FIG. 20, the evaluation value calculation unit 152 causes the AC power supply when the power information “ps” is “battery” and the remaining power “b” of the battery of the node 100 is “5500”. An evaluation value “4” larger than the evaluation value “1” is determined.
  • the evaluation value calculation unit 152 determines the evaluation value “20” when the power supply information “ps” is “battery” and the remaining power “b” of the battery of the node 100 is “1500”. Then, the difference from the evaluation value “1” of the AC power supply is increased. That is, the evaluation value calculation unit 152 increases the difference between the evaluation value of the AC power source, which is a fixed value, and the evaluation value of the battery according to the decrease in the remaining power of the battery of the own node 100.
  • the evaluation value calculation unit 152 applies the determined evaluation value to an evaluation formula that adds each weighted reception quality and power supply information, which are evaluation parameters, while weighting, so that the node between the adjacent node and the own node 100 can be applied.
  • An evaluation value D of the radio link is calculated.
  • the evaluation value calculation unit 152 calculates the evaluation value D of the radio link between the above equation (1).
  • the evaluation value calculation unit 152 stores the calculated D in the work table 141.
  • FIG. 21 is a flowchart illustrating a processing procedure of processing for calculating an evaluation value of a wireless link from a node according to the second embodiment to a destination node and storing the evaluation value in a communication path table.
  • the process illustrated in FIG. 21 is executed when a hello packet is received. Note that steps S505 to S514 in FIG. 21 are the same as steps S104 to S113 in FIG. 8, and a detailed description thereof will be omitted.
  • step S501 when the node 100 has not received a hello packet (step S501; No), the process ends.
  • the node 100 receives the hello packet (step S501; Yes)
  • the node 100 obtains the power information of the adjacent node that is the transmission source of the hello packet and the power information of the own node 100 held in the storage unit 140. (Step S502). Further, the node 100 detects the reception quality of the received hello packet.
  • the node 100 measures the remaining power of the battery of the node 100 (Step S503).
  • the node 100 calculates the evaluation value D of the radio link between the adjacent node and the own node 100 based on the remaining battery power, the power supply information, and the reception quality of the hello packet (step S504), and the process is performed in step S505. Move to.
  • the node 100 included in the ad hoc network measures the remaining power of the battery when the power information of the node 100 is a battery.
  • the node 100 increases the difference between the evaluation value corresponding to the AC power source, which is a fixed value, and the evaluation value corresponding to the battery, according to the measured decrease in the remaining power of the battery.
  • the node 100 selects, as the transfer destination of the packet to be transmitted to the destination, the route having the highest quality value of the evaluation value of the radio link from the node 100 to the destination node.
  • the node 100 can reduce the chance of selecting a communication path including the battery node, and as a result, the number of nodes that run out of batteries can be suppressed. it can.
  • the number of battery nodes that run out of batteries (hereinafter referred to as “battery dead nodes”) among battery nodes in the ad hoc network was verified using an existing simulation program.
  • the number of battery exhausted nodes is compared for each verification condition.
  • the battery node whose number of relay packets of the battery node exceeds a predetermined number (for example, 1000) was counted as a battery dead node with a remaining power of “0”.
  • the verification conditions of this verification method are the same as the verification conditions “A” to “C” of the first embodiment shown in FIG. Further, in this verification method, the values of the first embodiment shown in FIG. 13 are used as the weighting coefficients of the evaluation parameters other than the evaluation parameter “Pps”.
  • the conversion table shown in FIG.19 and FIG.20 was used as a conversion table which matched each evaluation parameter and evaluation value.
  • the configuration shown in FIG. 14 is used as the configuration of the ad hoc network applied to the simulation program.
  • FIG. 22 is a diagram illustrating a result of comparing the number of out-of-battery nodes included in the ad hoc network for each verification condition.
  • the vertical axis indicates the number of nodes that have run out of battery
  • the horizontal axis indicates the time that has elapsed since the start of execution of the simulation program. From the results shown in FIG. 22, it is understood that the number of out-of-battery nodes corresponding to the verification conditions “B” and “C” is smaller than the verification condition “A” when the same time has elapsed. That is, in Example 2, it can be seen that the number of nodes that run out of batteries can be suppressed.
  • each component of the nodes 100 and 200 is functionally conceptual and does not necessarily need to be physically configured as illustrated. That is, the specific forms of the nodes 100 and 200 are not limited to those shown in the drawings, and can be configured to be functionally or physically distributed and integrated in arbitrary units according to various loads and usage conditions. For example, the functions of the processing units 151 to 155 in FIG.
  • FIG. 23 is a diagram illustrating a hardware configuration of a computer that configures a node according to the first and second embodiments.
  • the computer 300 includes a CPU 301 that executes various arithmetic processes, an input device 302 that receives input of data from a user, and a display 303.
  • the computer 300 also includes a reading device 304 that reads a program and the like from a storage medium, and an interface device 305 for connecting to other devices.
  • the computer 300 also includes a wireless communication device 306 that is wirelessly connected to other devices, a RAM 307 that temporarily stores various types of information, and a hard disk device 308. Each device 301 to 308 is connected to a bus 309.
  • the hard disk device 308 stores various programs such as a power information acquisition program, an evaluation value calculation program, and a route selection program.
  • the CPU 301 reads out each program stored in the hard disk device 308, develops it in the RAM 307, and performs various processes.
  • these programs can cause the computer to function as the power supply information acquisition unit 151, the evaluation value calculation unit 152, and the route selection unit 153 in FIG.
  • the computer 300 may read and execute a program stored in a storage medium such as a CD-ROM.
  • a storage medium such as a CD-ROM.
  • Each program may be stored in a storage device connected to a public line, the Internet, a LAN (Local Area Network), a WAN (Wide Area Network), or the like. In this case, the computer 300 may read and execute each program from these.

Landscapes

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

Abstract

La présente invention se rapporte à un dispositif sans fil comprenant : un module d'acquisition de données relatives à une alimentation électrique ; un module de calcul de valeur de notation ; et un module de sélection de chemin. Le module d'acquisition de données relatives à une alimentation électrique acquiert des données relatives à une alimentation électrique qui indiquent si l'alimentation électrique d'un dispositif sans fil voisin ou du dispositif lui-même est une alimentation électrique interne ou une alimentation électrique externe. Si les données relatives à une alimentation électrique qui ont été acquises par le module d'acquisition de données relatives à une alimentation électrique indiquent que l'alimentation électrique est une alimentation électrique interne, le module de calcul de valeur de notation calcule une première valeur en tant qu'une valeur de notation d'un chemin entre le dispositif sans fil voisin et le dispositif lui-même. Si les données relatives à une alimentation électrique indiquent que l'alimentation électrique est une alimentation électrique externe, le module de calcul de valeur de notation calcule une seconde valeur qui est d'une qualité supérieure à celle de la première valeur, en tant que la valeur de notation. Le module de sélection de chemin sélectionne un dispositif sans fil voisin qui correspond à la valeur de notation qui est d'une qualité supérieure à celle de la première valeur, entre une somme de valeurs de notation pour un chemin allant de chaque dispositif sans fil voisin à une destination et la valeur de notation calculée au module de calcul de valeur de notation, en tant qu'une destination de transfert quand des paquets sont transmis à la destination.
PCT/JP2012/056940 2012-03-16 2012-03-16 Procédé de sélection de chemin et dispositif sans fil WO2013136527A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2012/056940 WO2013136527A1 (fr) 2012-03-16 2012-03-16 Procédé de sélection de chemin et dispositif sans fil

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2012/056940 WO2013136527A1 (fr) 2012-03-16 2012-03-16 Procédé de sélection de chemin et dispositif sans fil

Publications (1)

Publication Number Publication Date
WO2013136527A1 true WO2013136527A1 (fr) 2013-09-19

Family

ID=49160492

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/056940 WO2013136527A1 (fr) 2012-03-16 2012-03-16 Procédé de sélection de chemin et dispositif sans fil

Country Status (1)

Country Link
WO (1) WO2013136527A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2015231071A (ja) * 2014-06-03 2015-12-21 三菱電機株式会社 ネットワーク制御装置
JP2016024703A (ja) * 2014-07-23 2016-02-08 富士電機株式会社 無線ネットワークシステム
JP2017530663A (ja) * 2015-01-20 2017-10-12 三菱電機株式会社 ノードのネットワーク、バッテリー駆動式ノードおよびバッテリー駆動式ノードを管理する方法
JP2018513595A (ja) * 2015-03-13 2018-05-24 クアルコム，インコーポレイテッド あらゆるモノのインターネットデバイスの中継器の発見および選択
US10645631B2 (en) 2016-06-09 2020-05-05 Qualcomm Incorporated Device detection in mixed static and mobile device networks
US11350338B2 (en) 2016-09-23 2022-05-31 Nec Corporation Information processing apparatus, communication method, communication program, communication system, IoT device, and base station
CN117896762A (zh) * 2024-03-15 2024-04-16 沈阳市芷腾科技有限公司 基于5g通信技术的智慧城市数据交互方法及系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007074561A (ja) * 2005-09-08 2007-03-22 Advanced Telecommunication Research Institute International 無線ネットワークのルーティング方法及び無線通信システム
JP2007158478A (ja) * 2005-11-30 2007-06-21 Sharp Corp 携帯端末装置
JP2008160584A (ja) * 2006-12-25 2008-07-10 Fujitsu Ltd ネットワークシステムおよびデータ転送方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007074561A (ja) * 2005-09-08 2007-03-22 Advanced Telecommunication Research Institute International 無線ネットワークのルーティング方法及び無線通信システム
JP2007158478A (ja) * 2005-11-30 2007-06-21 Sharp Corp 携帯端末装置
JP2008160584A (ja) * 2006-12-25 2008-07-10 Fujitsu Ltd ネットワークシステムおよびデータ転送方法

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2015231071A (ja) * 2014-06-03 2015-12-21 三菱電機株式会社 ネットワーク制御装置
JP2016024703A (ja) * 2014-07-23 2016-02-08 富士電機株式会社 無線ネットワークシステム
JP2017530663A (ja) * 2015-01-20 2017-10-12 三菱電機株式会社 ノードのネットワーク、バッテリー駆動式ノードおよびバッテリー駆動式ノードを管理する方法
JP2018513595A (ja) * 2015-03-13 2018-05-24 クアルコム，インコーポレイテッド あらゆるモノのインターネットデバイスの中継器の発見および選択
US10476964B2 (en) 2015-03-13 2019-11-12 Qualcomm Incorporated Internet of everything device relay discovery and selection
US10645631B2 (en) 2016-06-09 2020-05-05 Qualcomm Incorporated Device detection in mixed static and mobile device networks
US11284329B2 (en) 2016-06-09 2022-03-22 Qualcomm Incorporated Device detection in mixed static and mobile device networks
US11350338B2 (en) 2016-09-23 2022-05-31 Nec Corporation Information processing apparatus, communication method, communication program, communication system, IoT device, and base station
CN117896762A (zh) * 2024-03-15 2024-04-16 沈阳市芷腾科技有限公司 基于5g通信技术的智慧城市数据交互方法及系统
CN117896762B (zh) * 2024-03-15 2024-05-31 沈阳市芷腾科技有限公司 基于5g通信技术的智慧城市数据交互方法及系统

Similar Documents

Publication Publication Date Title
WO2013136527A1 (fr) Procédé de sélection de chemin et dispositif sans fil
Laouid et al. A distributed multi-path routing algorithm to balance energy consumption in wireless sensor networks
KR101421145B1 (ko) 무선 메쉬 네트워크에서 게이트웨이 선택 방법
JP5939262B2 (ja) 送信制御方法、ノードおよび送信制御プログラム
Temel et al. Routing protocol design guidelines for smart grid environments
EP3425861A1 (fr) Routage amélioré dans un réseau iot hétérogène
Mahiddin et al. An internet access solution: MANET routing and a gateway selection approach for disaster scenarios
JP5810899B2 (ja) 無線通信装置、無線通信プログラムおよび無線通信方法
JP5058020B2 (ja) 通信システム
JP5712715B2 (ja) 無線通信装置および経路構築方法
Chu et al. Deployment of a connected reinforced backbone network with a limited number of backbone nodes
JPWO2013136527A1 (ja) 経路選択方法及び無線装置
JP2016045022A (ja) 位置推定装置
Ng et al. Energy-balanced dynamic source routing protocol for wireless sensor network
JP6241339B2 (ja) 経路選択方法、ノード装置、及び、プログラム
JP2012147054A (ja) 輻輳通知方法、輻輳通知装置および輻輳通知プログラム
JP6273942B2 (ja) 経路選択方法、ノード装置、中継システム、及び、プログラム
Jain et al. Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks
Tung Heuristic energy-efficient routing solutions to extend the lifetime of wireless ad-hoc sensor networks
JP5692404B2 (ja) 送信制御方法および送信制御装置
JP6408648B2 (ja) 無線通信装置および方法、ならびにプログラム
Pham et al. Lossy link-aware routing algorithm for ISA100. 11a wireless networks
KR20120044703A (ko) 무선 센서 및 액터 네트워크의 주문형 라우팅 방법
JP2007306280A (ja) 無線マルチホップネットワークにおけるノード位置の検索表示方式
JP6747204B2 (ja) 無線通信装置、無線通信プログラム及び無線通信方法

Legal Events

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

Ref document number: 12871071

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2014504606

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12871071

Country of ref document: EP

Kind code of ref document: A1