WO2012073578A1 - 無線マルチホップネットワークを用いた情報収集システム、端末、シンクノード、およびこれらの通信方法 - Google Patents
無線マルチホップネットワークを用いた情報収集システム、端末、シンクノード、およびこれらの通信方法 Download PDFInfo
- Publication number
- WO2012073578A1 WO2012073578A1 PCT/JP2011/071118 JP2011071118W WO2012073578A1 WO 2012073578 A1 WO2012073578 A1 WO 2012073578A1 JP 2011071118 W JP2011071118 W JP 2011071118W WO 2012073578 A1 WO2012073578 A1 WO 2012073578A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- message
- hop
- information collection
- period
- sink node
- Prior art date
Links
- 238000004891 communication Methods 0.000 title claims description 35
- 238000000034 method Methods 0.000 title claims description 23
- 230000005540 biological transmission Effects 0.000 claims abstract description 162
- 235000008694 Humulus lupulus Nutrition 0.000 claims abstract description 89
- 238000004364 calculation method Methods 0.000 description 8
- 238000012546 transfer Methods 0.000 description 8
- UCTWMZQNUQWSLP-VIFPVBQESA-N (R)-adrenaline Chemical compound CNC[C@H](O)C1=CC=C(O)C(O)=C1 UCTWMZQNUQWSLP-VIFPVBQESA-N 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/04—Scheduled access
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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/302—Route determination based on requested QoS
- H04L45/304—Route determination for signalling traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
Definitions
- the present invention relates to an information collection system, a terminal, a sink node, and a communication method thereof using a wireless multihop network, and more particularly, to a wireless multihop that performs transmission control according to a message transmission schedule for periodic information collection by the wireless multihop network.
- the present invention relates to an information collection system using a hop network, a terminal, a sink node, and a communication method thereof.
- wireless information collection is often used because of the ease of installation and low cost.
- sink node such as an information collection server
- other terminals perform relaying.
- a wireless multi-hop network that enables communication is used.
- any terminal can communicate with any other terminal.
- Non-Patent Documents 4 to 5 are known.
- an information collection system in a wireless multi-hop network can be constructed.
- path control for establishing a communication path from each terminal to the sink is performed by sequentially transferring path control messages transmitted from the sink to terminals that are sequentially away from the sink.
- information collection information is transferred from the terminal farthest from the sink in the sink direction while collecting the information.
- the route control message and the information collection message are transferred in opposite directions. Therefore, when there is no margin in the communication band with respect to the number of terminals, the transmission timings of the route control message and the information collection message always collide even when scheduling for collision avoidance is performed as in Non-Patent Documents 4 and 5. When such a collision between transmission of the route control message and the information collection message occurs frequently, a message transmission delay occurs, and as a result, there is a high possibility that the request time for periodic information collection cannot be satisfied.
- the present invention solves the above-described problems, avoids a collision between a route control message and an information collection message in a wireless multi-hop network, and uses a wireless multi-hop network capable of completing information collection within a predetermined time. It is an object of the present invention to provide a collection system, a terminal, a sink node, and a communication method thereof.
- a system terminal that periodically collects information in a wireless multi-hop network, the number of hops from a sink node constituting the wireless multi-hop network and the number of terminals per hop. And a transmission possible period of a hop-by-hop route control message for constructing a route to the sink node, and a transmission possible period of a hop-by-hop information collection message for transmitting collection information to the sink node. And calculating a period in which the routing control message collides with the information collection message based on the calculated both transmittable periods, and transmitting the routing control message while avoiding the calculated collision period.
- a transmission period control unit that recalculates the transmission available period of the route control message, and the number corresponding to the number of hops
- a routing control unit that creates and transmits the route control message within a transmittable period of a route control message, and creates and transmits the information collection message within a transmittable period of the information collection message according to the number of hops of the routing control message.
- a sink node of a system for periodically collecting information in a wireless multi-hop network which is transmitted from a terminal constituting the wireless multi-hop network to the sink node
- An information collection unit that receives an information collection message for transmitting collection information; and, from the information collection message, obtains the number of terminals per hop from the sink node, and determines the number of terminals obtained per hop as the sink node
- a routing control unit that transmits the message in a route control message for constructing a route to the sink node.
- a sink node of a system for periodically collecting information in a wireless multi-hop network which is transmitted from a terminal constituting the wireless multi-hop network toward the sink node
- An information collection unit that receives an information collection message for transmitting collection information; and, from the information collection message, obtains the number of terminals per hop from the sink node, and based on the obtained number of terminals per hop, A transmission possible period of a hop-by-hop route control message for constructing a route from the terminal to the sink node, and a transmission possible period of a hop-by-hop information collection message for transmitting collection information to the sink node
- a transmission period control unit that recalculates a transmittable period of the route control message so as to transmit the route control message while avoiding the calculated collision period, and information collection for each calculated hop
- a sink node comprising a routing control unit that transmits a message and a transmission-enabled period of
- a system for periodically collecting information in a wireless multi-hop network comprising a sink node and a terminal constituting the wireless multi-hop network, An information collection unit that holds an information collection message for transmitting collection information that is transmitted from the terminal to the sink node, and acquires the number of terminals per hop from the sink node from the information collection message, A routing control unit that transmits the obtained number of terminals for each hop in a route control message for constructing a route to the sink node, and the terminal includes the number of hops from the sink node and each hop. Based on the number of terminals, the transmission period of the routing control message and information collection message for each hop is calculated.
- a transmission period control unit that recalculates a transmittable period, a routing control unit that creates and transmits the route control message within the transmittable period of the route control message according to the number of hops, and the number of hops
- an information collection system comprising: an information transmission unit that creates and transmits the information collection message within a period in which the information collection message can be transmitted.
- a communication method for a terminal of a system that periodically collects information in a wireless multi-hop network, the number of hops from a sink node constituting the wireless multi-hop network and each hop. Based on the number of terminals, a transmission possible period of a path control message for each hop for establishing a path to the sink node, and an information collection message for each hop for transmitting collection information to the sink node A transmission possible period is calculated, a period in which the route control message collides with the information collection message is calculated based on both calculated transmission available periods, and the route control message is transmitted while avoiding the calculated collision period.
- the route control message is recalculated so that the route control according to the number of hops of the route control message is recalculated.
- the route control message is generated and transmitted within a transmission period of a message, and the information collection message is generated and transmitted within a transmission period of the information collection message corresponding to the number of hops of the message.
- a terminal communication method is provided.
- information collection and route control are performed simultaneously by determining the transmission timing of a route control message and an information collection message based on the number of hops from a sink node and the number of terminals per hop.
- information collection can be performed within the required time by preventing delay in information collection due to collision between the route control message and the information collection message.
- FIG. 1 shows the structural example of the information collection system using the radio
- surface which shows the relationship between each transmission possible period of a route control message and an information collection message, and the number of hops.
- the information collection system shown in FIG. 1 it is a figure explaining the case where the collision with an information collection message has occurred in the schedule of the transmission timing of a route control message.
- FIG. 6 is a diagram illustrating a case where an interference avoidance period is set in order to avoid a collision between the route control message and the information collection message shown in FIG. 5.
- FIG. 7 is a diagram for explaining a case where the transmission possible period of the route control message is recalculated after the interference avoidance period shown in FIG. 6 is set. It is a figure which shows the function structure of the sink node and terminal shown in FIG. It is a schematic flowchart explaining the calculation process of the transmission possible period of the information collection message and routing control message by the terminal shown in FIG. It is a schematic flowchart explaining transmission control of the information collection message by the terminal shown in FIG. It is a schematic flowchart explaining transmission control of the route control message by the terminal shown in FIG.
- FIG. 1 shows an outline of the configuration of an information collection system using a wireless multi-hop network in the present embodiment.
- 1 is a server (information collection server) that collects information from each of the terminals 21n to 28n represented by other squares in the figure.
- Concentric circles 101 to 108 represent the number of hops 1 to 8 in wireless communication from the sink node 201, and the terminals 21m1 to 28m8 arranged on the concentric circles 101 to 108 are the number of hops indicated by the concentric circles 101 to 108 from the sink node 201. Represents a terminal group that can be reached by.
- the terminal 21m1 existing on the concentric circle 101 is a terminal capable of directly communicating with the sink node 201 by hop number 1, that is, the sink node 201.
- the terminal 22m2 existing on the concentric circle 102 is a terminal capable of communicating with the sink node 201 with the number of hops 2 through one or more terminals 21m1 existing on the concentric circle 101.
- the terminal 21mn existing on the concentric circle 10n can communicate with the sink node 201 via one or more terminals 21m (n-1) on the concentric circle 10 (n-1).
- Fig. 1 shows a wireless multi-hop network with a maximum of 8 hops.
- the terminals 21m1 to 28m8 are arranged concentrically in order to simplify the description. However, in practice, any arrangement is possible.
- Each of the terminals 21m1 to 28m8 needs to determine a relay terminal for performing communication with the sink node 201.
- the sink node 201 and each of the terminals 21m1 to 28m8 periodically transmit a path control message.
- Node ID (hereinafter abbreviated as “ID” as necessary) -Number of hops-Neighboring terminal list-Number of terminals at each hop
- the node ID is its own ID
- the number of hops is its own hop number
- the adjacent terminal list is a list of IDs of adjacent terminals (or sink nodes)
- the number of terminals at each hop represents the number of terminals at each hop.
- the number of terminals at each hop is set by the sink node 201 based on the information on the number of hops of each terminal set in the information collection message in the periodical information collection immediately before described later.
- the terminals other than the sink node 201 copy the received information on the number of terminals at each hop.
- each terminal waits for a random time after first receiving the route control message, and then creates and transmits its own route control message.
- the transmission period of the route control message is calculated from the number of hops of itself, and the route control message is generated and transmitted at random timing within the period.
- FIG. 2 shows a sink node 201, two terminals 211 and 212 with a hop number of 1 existing on a concentric circle 101, two terminals 221 and 222 with a hop number of 2 existing on a concentric circle 102, and a concentric circle 103.
- Two terminals 231 and 232 having a hop number of 3 are illustrated (in this example, terminals having a hop number of 4 or more are omitted for convenience).
- the sink node 201 first transmits a route control message by broadcast.
- the route control message transmitted by the sink node 201 has the following contents.
- 211 and 212 are set in the neighboring terminal list. This is because the sink node 201 can receive the route control messages of the terminals 211 and 212 in the exchange of the route control messages up to the previous time.
- the number of terminals at each hop is set to the number of terminals 2 of hop number 1, the number of terminals 2 of hop number 2, and the number of terminals 2 of hop number 3 (in this example, the number of hops 4 for convenience). The above is omitted).
- the route control message transmitted by the sink node 201 is received by the terminals 211 and 212.
- Each of the terminals 211 and 212 creates and transmits a route control message within a transmission possible period of hop number 1 calculated in advance, which will be described later.
- the route control message transmitted by the terminals 211 and 212 is as follows.
- 1 is set for each hop count.
- the number of hops is obtained by adding 1 to the minimum number of hop numbers in the routing control message received by itself and having its own ID in the adjacent terminal list. In this case, since the number of hops 0 included in the route control message received from the sink node 201 of the terminals 211 and 212 are both the minimum number of hops, the number of hops of the terminals 211 and 212 is both 0 plus 1. The one, ie 1.
- the adjacent terminal list is set to 201, 212, and 221 for the terminal 211, and 201, 211, and 222 for the terminal 212, respectively.
- the terminal 211 can receive the control path messages of the sink node 201 and the terminals 212 and 221 in the exchange of the path control messages up to the previous time, and the terminal 212 can receive the control path messages of the sink node 201 and the terminals 211 and 222. Because it is possible to receive.
- the number of terminals at each hop is copied from that included in the route control message of the sink node 201.
- the route control messages transmitted by the terminals 221 to 232 are as follows.
- each terminal determines a relay terminal that can be used when it transmits data to the sink node 201.
- the relay terminal is a set of adjacent terminals that satisfy the following two conditions.
- the relay terminal list of each terminal is as follows.
- the best one can be selected in consideration of the reception quality of the route control message.
- Other relay terminals can be used as alternative relay terminals when the best relay terminal is no longer available.
- Each terminal transmits an information collection message to be described later to the relay terminal.
- one terminal 261 with six hops existing on the concentric circle 106 one terminal 271 with seven hops existing on the concentric circle 107, and eight hops existing on the concentric circle 108 (maximum hops).
- the number of terminals 281 and 282 is illustrated (in this example, terminals and sink nodes having a hop number of 5 or less are omitted for convenience).
- Each terminal collects the information reported by itself and the information from the terminal of the next hop number transmitted to itself in the transmission possible period of the information collection message for each hop number calculated by the method described later. Create and send information gathering messages.
- the information collection message includes the following information.
- terminals 281 and 282 transmit an information collection message in a period in which a terminal with 8 hops transmits.
- the message destination is the terminal 271 which is a relay terminal determined by the above-described route control message.
- aaaaaaa and bbbbbb contain arbitrary information depending on the system and application.
- route control from sink node to terminal direction In the information collection process of (2) above, route control from the sink node 201 to each terminal direction is also performed simultaneously.
- the terminal that has received the information collection message records, as a relay terminal, the terminal that has transmitted the information collection message to the terminal included in the information of the message.
- the terminal 261 when the terminal 261 receives data addressed to the terminals 271, 281 and 282, the terminal 261 transfers the data to the terminal 271.
- the data transfer table of the terminal 261 is shown as an example below.
- Destination 271 Forwarding destination 271
- Destination 281 Forwarding destination 271
- Destination 282 Forwarding destination 271
- the sink node 201 can know the number of terminals at each hop, such as how many hops away from itself, from the information collection message.
- the sink node 201 transmits the information on the number of terminals at each hop in a route control message so that all terminals can know the number of terminals at each hop.
- Each terminal calculates the transmittable period at each hop of the route control message and the information collection message from the information on the number of terminals at each hop.
- the transmission schedule of the information collection message and the routing message is roughly as shown in FIG.
- the information collection cycle is expressed as T, and its start time is expressed as t0.
- T and t0 are set in advance in the sink node 201 and each terminal.
- g is the guard time to avoid transmission collisions between hops due to time lag between terminals.
- J (h) (J (1) to J (8) in the example of FIG. 4) is transferred from the terminal having the hop number h to the relay terminal having the previous hop number h-1 in the information collection cycle T.
- This is a period during which the information collection message is allowed to be transmitted, that is, a period in which the information collection message can be transmitted for each hop.
- R (h) (R (0) to R (7) in the example of FIG. 4) is a period during which the terminal having the number of hops h is allowed to transmit a route control message in the information collection cycle T, that is, This is a period during which a routing control message can be transmitted for each hop.
- the interference avoidance period I is a period in which transmission of the route control message is stopped in order to prevent the transfer of the information collection message and the transfer of the route control message from interfering in the information collection cycle T.
- the information collection message is transmitted in the order of the terminals having the largest number of hops, that is, in the order of the respective terminals having the number of hops 8, 7, 6,. , J (7), J (6),..., J (1), and reaches the sink node 201.
- the route control message is transmitted from the sink node 201 on the contrary, and can be transmitted in the direction of the terminal having a large number of hops, that is, the direction of each terminal having the number of hops 1, 2, 3,. Transferred to periods R (1), R (2), R (3),..., R (8).
- the length of the information collection message transmission period J (h) at each hop is determined in consideration of the number of terminals at each hop, the amount of information to be transmitted, and the degree of interference. For example, the period J (h) is set longer as the number of terminals N (h) existing in the hop number h is larger. Also, the smaller the hop count h, the greater the amount of information transmitted by one terminal, so the period J (h) becomes longer. Furthermore, since the degree of interference increases as the hop number h decreases, the period J (h) is also set longer.
- the time required to send information per terminal is m. Overhead time required for one terminal to send a message (header transmission time + CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance))
- header transmission time + CSMA / CA Carrier Sense Multiple Access with Collision Avoidance
- Jmin (h) [ ⁇ N (h) + N (h + 1) + ... + N (Hmax) ⁇ * m + N (h) * p] * (1 / s) (Formula 1)
- correction is performed as follows, for example, according to the number of hops h.
- the route control message sends a message of a certain size to any terminal.
- R (0) is completed in a very short time because the sink node 201 only broadcasts one routing control message.
- the minimum required routing control message transmission time Rmin (h) at each hop is as follows.
- Rmin (h) N (h) * (p + q) * (1 / s) (Formula 7) Since the probability that a plurality of terminals can transmit simultaneously increases as the number of hops h increases, Rmin (h) is corrected as follows, for example, according to the number of hops h. Here, the corrected Rmin (h) is defined as Rmin ′ (h).
- Rmin '(h) Rmin (h) * h ⁇ ( ⁇ 1/2) (Formula 8)
- Tr (h) _end is Indicates the end time of the transmittable period R (h).
- the period from the start time Tr (h) _start of the transmission period R (h) of the route control message with the hop count h to the end time Tr (h) _end + the guard time g is When it overlaps with the period from the start time Tj (h + 2) _start to the end time Tj (h + 2) _end of the transmission period J (h + 2) of the information collection message with the number of hops h + 2 (see overlap period a in FIG. 5) In the hop count h + 1, transmission of the information collection message and the routing control message collides.
- the period between (h) end time Tj (h) _end + guard time g is set as an interference avoidance period I during which the transmission of the route control message is stopped.
- the number of hops h at which the conflicting path control message is transmitted is assumed to be Hcol.
- the transmission possible period R (h) for each hop is again set so that the transmission of the route control message does not overlap with the interference avoidance period I as shown in FIG. Recalculate.
- the information collection message with the hop number Hmax It is allocated between the transmission possible period J (Hmax) and the transmission possible period J (Hcol + 2) of the information collection message with the number of hops Hcol + 2.
- Tr1 J (Hmax) +... + J (Hcol + 2)
- the transmission time Rext1 that can be allocated extra in Tr1 can be calculated as follows.
- Rext1 Tr1-g * Hcol- ⁇ Rmin '(0) + Rmin' (1) + ... + Rmin '(Hcol-1) ⁇ (Formula 10) This Rext1 is distributed according to the weight y (h) of each hop.
- the weight y (h) of each hop is calculated as follows.
- R (h) Rmin '(h) + y (h) * Rext1 (Formula 12)
- the transmission period R (Hmax) of the route control message with the hop number Hmax from the transmission period R (Hcol) of the route control message with the hop number Hcol to the transmission of the information collection message with the hop number Hcol-1.
- the information is allocated between the possible period J (Hcol-1) and the transmission possible period J (1) of the information collection message with the number of hops 1.
- Tr2 J (Hcol + 1) +... + J (1)
- the transmission time Rext2 that can be allocated extra in Tr2 can be calculated as follows.
- Rext2 Tr2-g * (Hmax-Hcol + 1)- ⁇ Rmin '(Hcol) + Rmin' (Hcol + 1) + ... + Rmin '(Hmax) ⁇ (Formula 13)
- This Rext2 is distributed according to the weight y (h) of each hop.
- the weight y (h) of each hop is calculated as follows.
- each terminal can transmit the transmission period J (h) and R according to its own hop count h.
- An information collection message and a route control message are transmitted in (h).
- information collection and route control can be performed simultaneously, and information collection can be performed within the required time by preventing delay in information collection due to collision between the route control message and the information collection message.
- FIG. 8 shows the functional configuration of the above sink node and terminal.
- the wireless multi-hop network shown in FIG. 8 includes a sink node 201, a terminal 211 adjacent to the sink node 201, and a terminal 221 adjacent to the terminal 211 (other terminals are omitted for convenience). Note that since the functional configuration of terminals other than the terminal 211 in the wireless multi-hop network is the same as that of the terminal 211, only the terminal 211 will be described.
- the sink node 201 includes a routing control unit 302, an information collection unit 305, and a wireless communication unit 304 (in addition, a known clock function (not shown) or the like is incorporated).
- the wireless communication unit 304 transmits and receives the information collection message and the route control message described above by wireless communication with the adjacent terminal 211.
- the information collection unit 305 receives and holds the information collection message via the wireless communication unit 304.
- the routing control unit 302 obtains information on the number of terminals N (h) of each hop from the information collection message of the information collection unit 305, and periodically creates a route control message based on the information to create a wireless communication unit 304. To the adjacent terminal 211.
- the route control message is created and transmitted every information collection cycle T.
- the start time t0 of the information collection cycle T is determined based on, for example, the time of a built-in clock function.
- the terminal 211 includes a transmission period control unit 311, a routing control unit 312, an information transmission unit 313, and a wireless communication unit 314 (in addition, a known clock function (not shown) and the like are also incorporated).
- the wireless communication unit 314 transmits and receives the above-described information collection message and route control message by wireless communication between the sink node 201 and other adjacent terminals 221.
- the transmission period control unit 311 acquires information on the number of hops h of its own terminal and the number of terminals N (h) for each hop from the routing control unit 312, and collects information and route control messages at each hop.
- the transmission possible periods J (h) and R (h) are calculated and notified to the routing control unit 312 and the information transmission unit 313.
- the routing control unit 312 determines the start time Tr (h) based on the transmittable period R (h) of the route control message according to its own hop count h notified from the transmission period control unit 311 in the information collection cycle T. ) _start to the end time Tr (h) _end, the above-described route control message is created, and the created route control message is transmitted to the adjacent terminal 221 via the wireless communication unit 304.
- a relay terminal that can be used when transmitting the information collection message to the sink node 201 is determined, and a communication path between the sink node and the terminal and between the two terminals is constructed.
- the start time Tr (h) _start and the end time Tr (h) _end of the route control message transmission possible period R (h) are determined based on, for example, the time of a built-in clock function.
- the information transmission unit 313 determines the start time Tj (based on the transmission period J (h) of the information collection message according to the hop number h of the own terminal notified from the transmission period control unit 311. h) The information collection message described above is created between _start and the end time Tj (h) _end, and the created information collection message is transmitted to the relay terminal acquired from the routing control unit 312. Also, the information transmission unit 313 acquires an information collection message from the adjacent terminal 221 via the wireless communication unit 314, and puts information included in the information collection message into an information collection message to be created next time. Note that the start time Tj (h) _start and the end time Tj (h) _end of the information collection message transmission possible period J (h) are determined based on, for example, the time of a built-in clock function.
- FIG. 9 illustrates a calculation processing flow of the transmission possible period of the information collection message and the path control message by the transmission period control unit 311 of the terminal 211.
- the terminal 211 obtains the number of terminals at each hop from the route control message from the sink node 201 by the transmission period control unit 311 (step S1), and sets the obtained number of terminals at each hop. Based on this, a transmission possible period J (h) of the information collection message for each hop and a transmission possible period R (h) of the path control message for each hop are calculated (steps S2 and S3). And the terminal 211 sets the interference avoidance period I according to the period when a path control message collides with an information collection message based on J (h) and R (h) by the transmission period control part 311 (step S4). The route control message transmission possible period R (h) is recalculated so as not to overlap with the interference avoidance period I (step S5).
- FIG. 10 is a flowchart for explaining the information collection message transmission control flow by the terminal 211.
- the terminal 211 determines whether or not T has arrived at the start time t0 of the preset information collection cycle T (step S21), and when T arrives (step S11: YES) It is determined whether J (h) has arrived from the start time Tj (h) _start of the transmission period J (h) of the information collection message according to the number of hops h (step S22), and J (h) has arrived Then (step S22: YES), between the start time Tj (h) _start and the end time Tj (h) _end, the information transmission unit 313 creates and transmits its own information collection message (step S23). .
- FIG. 11 illustrates a flow of transmission control of the route control message by the terminal 211.
- the terminal 211 determines whether or not the information collection cycle T has arrived at a preset information collection start time t0 (step S21).
- T arrives step S21: YES
- R (h) It is determined whether or not R (h) has arrived at the start time Tr (h) _start of the transmission period R (h) of the route control message according to its own hop count h (step S22).
- the routing control unit 312 creates and transmits its own route control message between the start time Tr (h) _start and the end time Tr (h) _end (step S23).
- the “number of terminals at each hop” of the route control message created by the sink node 201 (the routing control unit 302 in the example of FIG. 8) is set.
- the number of dummy (fictional) terminals may be set to a number of hops greater than the maximum number of hops (8 in the above example) recognized by the sink node 201. For example, information that 10% of the number of hops of 8 is present in the number of hops of 9 is entered as a dummy.
- the calculation of (4) in the above embodiment may be performed by the sink node 201 instead of the terminal.
- a functional configuration of the sink node 201 in this case a configuration further including a transmission period control unit having the same function as the transmission period control unit 311 on the terminal 211 side illustrated in the example of FIG. 8 is exemplified.
- the route control message generated and transmitted by the sink node 201 includes the calculated information collection message for each hop and the transmission possible period J (h) of the route control message.
- R (h) or J (h) start time Tj (h) _start, its end time Tj (h) _end, R (h) start time Tr (h) _start, its end time Tr (h) _end You may send the information.
- each terminal transmits the information collection message and the route control message based on the transmission schedule of the received information collection message and the route control message, that is, the hop-by-hop information collection message and the route control message transmission possible period.
- the sink node and the terminal constituting the wireless multi-hop network can be realized by hardware, software, or a combination thereof.
- the hardware and software configurations in this case are not particularly limited, and any form can be applied as long as the functions described above can be realized.
- a terminal of a system that periodically collects information in a wireless multi-hop network wherein the sink node is based on the number of hops from the sink node that constitutes the wireless multi-hop network and the number of terminals per hop.
- a period during which the route control message collides with the information collection message is calculated based on both transmission possible periods, and the route control message is transmitted so as to avoid the calculated collision period.
- a transmission period control unit for recalculating the routing control message according to the number of hops of the transmission period control unit A routing control unit that creates and transmits the route control message within a transmittable period, and an information transmission unit that generates and transmits the information collection message within the transmittable period of the information collection message according to its own hop count And a terminal.
- the number of terminals per hop is transmitted in a route control message created by the sink node, and the transmission period control unit obtains the number of terminals per hop from the route control message.
- the said transmission period control part calculates the transmission possible period of the route control message for every hop weighted according to the number of terminals for every said hop, and an information collection message, It is characterized by the above-mentioned The terminal described in.
- a sink node of a system that periodically collects information in a wireless multi-hop network, for transmitting collected information transmitted from a terminal constituting the wireless multi-hop network to the sink node
- An information collection unit that receives the information collection message, and from the information collection message, obtains the number of terminals per hop from the sink node, and constructs a route to the sink node using the obtained number of terminals per hop
- a routing control unit that transmits the message in a path control message.
- An information collection unit that receives the information collection message, and from the information collection message, obtains the number of terminals per hop from the sink node, and based on the obtained number of terminals per hop, from the terminal to the sink node
- Both transmissions are calculated by calculating a transmission possible period of a route control message for each hop for constructing a route and a transmission possible period of an information collection message for each hop for transmitting collection information to the sink node. Based on the possible period, the period during which the routing message collides with the information collection message is calculated.
- a transmission period control unit that recalculates a transmission possible period of the route control message so as to transmit the route control message while avoiding the calculated collision period, and the calculated information collection message and route control message for each hop
- a sink node comprising: a routing control unit that transmits a transmittable period in its own route control message.
- the transmission period control unit calculates a transmission possible period of the route control message and the information collection message for each hop weighted according to the number of terminals for each hop, and the routing control unit calculates 8.
- a system for periodically collecting information in a wireless multi-hop network comprising a sink node and a terminal constituting the wireless multi-hop network, wherein the sink node is directed from the terminal to the sink node
- the information collection unit that holds the information collection message for transmitting the collection information that is transmitted and the number of terminals for each hop from the sink node from the information collection message, and the number of terminals for each acquired hop
- a routing control unit that transmits in a route control message for constructing a route to the sink node, the terminal based on the number of hops from the sink node and the number of terminals per hop, Calculate the transmission possible period of the routing control message and information collection message for each hop, and both calculated transmissions Based on the performance period, a time period during which the route control message collides with the information collection message is calculated, and the transmission possible period of the route control message is retransmitted so as to transmit the route control message while avoiding the calculated collision time period.
- An information collection system comprising: an information transmission unit that creates and transmits the information collection message within a message transmission possible period.
- a communication method for a terminal of a system that periodically collects information in a wireless multi-hop network, based on the number of hops from the sink node constituting the wireless multi-hop network and the number of terminals per hop, Calculating a transmission possible period of a hop-by-hop route control message for constructing a route to the sink node and a transmission period of an information collection message for each hop for transmitting collection information to the sink node Calculating a period in which the route control message collides with the information collection message based on the calculated both transmittable periods, and transmitting the route control message so as to avoid the calculated collision period.
- the terminal communication characterized in that the route control message is created and transmitted within an active period, and the information collection message is created and transmitted within a transmittable period of the information collection message according to the number of hops of the terminal.
- a communication method of a sink node of a system for periodically collecting information in a wireless multi-hop network wherein collected information transmitted from a terminal constituting the wireless multi-hop network to the sink node
- Receiving an information collection message for transmission obtaining the number of terminals per hop from the sink node from the information collection message, and constructing a route to the sink node from the obtained number of terminals per hop
- a communication method of a sink node of a system that periodically collects information in a wireless multi-hop network wherein collected information transmitted from a terminal constituting the wireless multi-hop network to the sink node
- Receiving an information collection message for transmission obtaining the number of terminals per hop from the sink node from the information collection message, and based on the obtained number of terminals per hop, the route from the terminal to the sink node
- the transmission possible period of the routing control message for each hop for constructing the transmission information and the transmission possible period of the information collection message for each hop for transmitting the collection information to the sink node are calculated. Based on the time period, the time period during which the routing message collides with the information collection message is calculated.
- a sink node which is transmitted in its own routing message.
- the present invention can be used for an information collection system, a terminal, a sink node, and a communication method using a wireless multi-hop network.
- the present invention relates to a control message for path control in a system that periodically collects information using a wireless multi-hop network, for example, automatic meter reading by a smart meter, and an information collection system (sensor network) using a sensor. It can be used as a method for scheduling the transmission timing of messages for information collection.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Telephonic Communication Services (AREA)
Abstract
Description
各端末21m1~28m8は、シンクノード201への通信を行うための中継端末を決定する必要がある。その経路制御のため、シンクノード201および各端末21m1~28m8は、定期的に経路制御メッセージを送信する。
・ホップ数
・隣接端末リスト
・各ホップでの端末数
ここで、ノードIDは自身のID、ホップ数は自身のホップ数、隣接端末リストは、隣接する端末(又はシンクノード)のIDからなるリスト、各ホップでの端末数は、ホップ毎の端末数を表している。
・ID:201
・ホップ数:0
・隣接端末リスト:211、212
・各ホップでの端末数:1(2)、2(2)、3(2)、…
この例では、IDは自身のIDである201、ホップ数は0がそれぞれ設定されている。
・ID:211
・ホップ数:1
・隣接端末リスト:201、212、221
・各ホップでの端末数:1(2)、2(2)、3(2)、…
(a3)端末212の経路制御メッセージ
・ID:212
・ホップ数:1
・隣接端末リスト:201、211、222
・各ホップでの端末数:1(2)、2(2)、3(2)、…
この例では、IDは、それぞれ自身のID211、212がそれぞれ設定されている。
・ID:221
・ホップ数:2
・隣接端末リスト:211
・各ホップでの端末数:1(2)、2(2)、3(2)、…
(a5)端末222の経路制御メッセージ
・ID:222
・ホップ数:2
・隣接端末リスト:212、231、232
・各ホップでの端末数:1(2)、2(2)、3(2)、…
(a6)端末231の経路制御メッセージ
・ID:231
・ホップ数:3
・隣接端末リスト:221、222
・各ホップでの端末数:1(2)、2(2)、3(2)、…
(a7)端末232の経路制御メッセージ
・ID:232
・ホップ数:3
・隣接端末リスト:222
・各ホップでの端末数:1(2)、2(2)、3(2)、…
ここで、端末221と231の間では、何らかの原因により端末221の経路制御メッセージを端末231は受信できるが、端末231の経路制御メッセージを端末221は受信できないとする。そのため、端末221の経路制御メッセージの隣接端末リストには231は入っていない。
端末212:201
端末221:211
端末222:212
端末231:222
端末232:222
中継端末になりうる端末が複数ある場合、経路制御メッセージの受信品質などを考慮して、最良のものを選択することができる。また、それ以外の中継端末は、最良の中継端末が利用可能でなくなった場合の代替中継端末として利用することができる。
次に、情報収集メッセージの送信方法について、図3を用いて説明する。
図3では、まずホップ数8の端末が送信する期間で、端末281と282が情報収集メッセージを送信する。メッセージの送信先は、前述の経路制御メッセージで決定した中継端末である端末271である。
・情報(281:8:aaaaaa)
(b2)端末282が送信する情報収集メッセージ
・情報(282:8:bbbbbb)
端末271が端末281および282から情報収集メッセージを受信した後、ホップ数7の送信期間が来ると、つぎのような情報収集メッセージを作成して端末261に送信する。
・情報(271:7:cccccc、281:8:aaaaaa、282:8:bbbbbb)
同様に各端末はホップ数に応じた送信可能期間内に、情報収集メッセージの送信を行う。最終的には、シンクノード201は全端末の報告情報とホップ数を受け取る。
上記(2)の情報収集の過程において、シンクノード201から各端末方向への経路制御も同時に行われる。情報収集メッセージを受信した端末は、そのメッセージの情報に含まれる端末に対して、情報収集メッセージを送信してきた端末を中継端末として記録する。
宛先281:転送先271
宛先282:転送先271
このデータ転送表を使うことにより、シンクノード201と任意の端末間および任意の2端末間で通信を行うことが可能となる。ある端末宛のデータを受信した場合、転送表の宛先に一致するものがあれば、転送先へと転送を行う。なければ、シンクノード方向の中継端末へと転送を行う。
シンクノード201は、情報収集メッセージから、自身からの何ホップ先に何台の端末が存在しているかといった各ホップでの端末数を知ることができる。シンクノード201は、この各ホップでの端末数の情報を経路制御メッセージに入れて送信することにより、全端末は各ホップでの端末数を知ることができる。
最初に、情報収集メッセージの送信スケジュール、すなわち各ホップでの情報収集メッセージの送信可能期間J(h)を計算する。
ただし、ホップ数hが大きくなるほど複数の端末が同時に送信できる確率が増えるため、ホップ数hに応じて例えば以下のように補正する。
ここから、情報収集の周期Tにおいて、全体で余分に配分できる送信時間Jextは、以下のように計算できる。
このJextを各ホップの重みw(h)に応じて配分する。重みw(h)は、以下のように計算する。
w(h)=w'(h)/{w'(1)+w'(2)+…+w'(Hmax)} (式5)
よって、J(h)は、以下のように計算される。
ここで、情報収集の周期Tにおいて、情報収集の開始時刻をt0とすると、各ホップ数h(h=1、…、Hmax-1、Hmax)での情報収集メッセージの送信可能期間J(h)の開始時刻Tj(h)_startと、その送信可能期間J(h)の終了時刻Tj(h)_endは、つぎのようになる。
Tj(Hmax)_end=t0+J(Hmax)
Tj(Hmax-1)_start=Tj(Hmax)_end+g
Tj(Hmax-1)_end=Tj(Hmax-1)_start+J(Hmax-1)
Tj(Hmax-2)_start=Tj(Hmax-1)_end+g
Tj(Hmax-2)_end=Tj(Hmax-2)_start+J(Hmax-2)
…
Tj(1)_start=Tj(2)_end+g
Tj(1)_end=Tj(1)_start+J(1) (式6)
となる。
次に、経路制御メッセージの送信スケジュール、すなわち各ホップでの経路制御メッセージの送信可能期間R(h)と、干渉回避期間Iとの計算を行う。
ホップ数hが大きくなるほど複数の端末が同時に送信できる確率が増えるため、ホップ数hに応じて、Rmin(h)を例えば以下のように補正する。ここでは、補正したRmin(h)をRmin'(h)とする。
このRmin'(h)を元に、情報収集の周期Tにおいて、その開始時刻t0から経路制御メッセージの送信可能期間を設定してゆく。すなわち、情報収集の周期Tの開始時刻をt0とすると、以下のようになる。ここで、Tr(h)_startは、各ホップ数h(h=0、1、…、Hmax)での経路制御メッセージの送信可能期間R(h)の開始時刻、Tr(h)_endは、その送信可能期間R(h)の終了時刻を表す。
Tr(0)_end=t0+Rmin'(0)
Tr(1)_start=Tr(0)_end+g
Tr(1)_end=Tr(1)_start+Rmin'(1)
…
Tr(Hmax)_start=Tr(Hmax-1)_end+g
Tr(Hmax)_end=Tr(Hmax)_start+Rmin'(Hmax) (式9)
ここで、図5のように、ホップ数hでの経路制御メッセージの送信可能期間R(h)の開始時刻Tr(h)_startからその終了時刻Tr(h)_end+ガードタイムgまでの期間が、ホップ数h+2での情報収集メッセージの送信可能期間J(h+2)の開始時刻Tj(h+2)_startからその終了時刻Tj(h+2)_endまでの期間と重なった場合(図5中の重複期間a参照)、ホップ数h+1において、情報収集メッセージと経路制御メッセージの送信が衝突する。
このRext1を各ホップの重みy(h)に応じて配分する。各ホップの重みy(h)を以下のように計算する。
y(h)=y'(h)/{y'(0)+y'(1)+…+y'(Hcol-1)} (式11)
最終的にホップ数h(0~Hcol-1)での経路制御メッセージの送信可能期間R(h)(R(0)~R(Hcol-1))は、以下のように計算する。
次に、ホップ数Hcolでの経路制御メッセージの送信可能期間R(Hcol)からホップ数Hmaxでの経路制御メッセージの送信可能期間R(Hmax)を、ホップ数Hcol-1での情報収集メッセージの送信可能期間J(Hcol-1)からホップ数1での情報収集メッセージの送信可能期間J(1)の間で割り当てる。
このRext2を各ホップの重みy(h)に応じて配分する。各ホップの重みy(h)を以下のように計算する。
y(h)=y'(h)/{y'(Hcol)+y'(Hcol+1)+…+y'(Hmax)} (式14)
最終的にホップ数h(Hcol~Hmax)での経路制御メッセージの送信可能期間R(h)(R(Hcol)~R(Hmax))は、以下のように計算する。
上記のとおり計算したホップ毎の情報収集メッセージおよび経路制御メッセージの送信可能期間J(h)、R(h)に従い、各端末は自身のホップ数hに応じた送信可能期間J(h)、R(h)内で情報収集メッセージおよび経路制御メッセージを送信する。
シンクノード201は、ルーティング制御部302、情報収集部305および無線通信部304を備えている(その他、既知の時計機能(非図示)等も内蔵する)。
端末211は、送信期間制御部311、ルーティング制御部312、情報送信部313および無線通信部314を備えている(その他、既知の時計機能(非図示)等も内蔵する)。
21m1~21m8、211、212、221、222、231、232、261、271、281、282 端末
101~108 ホップ数1~8
302 ルーティング制御部(シンクノード)
304 情報収集部
305 無線通信部(シンクノード)
311 送信期間制御部
312 ルーティング制御部(端末)
313 情報送信部
314 無線通信部(端末)
Claims (10)
- 無線マルチホップネットワークにおいて定期的に情報収集を行うシステムの端末であって、
前記無線マルチホップネットワークを構成するシンクノードからのホップ数およびホップ毎の端末数に基づいて、前記シンクノードへの経路を構築するためのホップ毎の経路制御メッセージの送信可能期間と、前記シンクノードへ向けて収集情報を伝達するためのホップ毎の情報収集メッセージの送信可能期間とを計算し、計算した両送信可能期間に基づいて前記経路制御メッセージが前記情報収集メッセージと衝突する期間を計算し、計算した前記衝突する期間を避けて前記経路制御メッセージを送信するように前記経路制御メッセージの送信可能期間を再計算する送信期間制御部と、
自身のホップ数に応じた前記経路制御メッセージの送信可能期間内に前記経路制御メッセージを作成して送信するルーティング制御部と、
自身のホップ数に応じた前記情報収集メッセージの送信可能期間内に前記情報収集メッセージを作成して送信する情報送信部とを有することを特徴とする端末。 - 前記ホップ毎の端末数は、前記シンクノードが作成する経路制御メッセージに入れて送信され、
前記送信期間制御部は、前記経路制御メッセージから、前記ホップ毎の端末数を取得することを特徴とする請求項1に記載の端末。 - 前記送信期間制御部は、前記ホップ毎の端末数に応じて重みづけされたホップ毎の経路制御メッセージおよび情報収集メッセージの送信可能期間を計算することを特徴とする請求項1又は2に記載の端末。
- 前記情報送信部は、前記情報収集メッセージに自身のホップ数を入れて送信することを特徴とする請求項1に記載の端末。
- 前記ホップ毎の端末数として、前記シンクノードにより実際の最大ホップ数よりも大きいホップ数に架空の端末数が設定されることを特徴とする請求項2に記載の端末。
- 無線マルチホップネットワークにおいて定期的に情報収集を行うシステムのシンクノードであって、
前記無線マルチホップネットワークを構成する端末から前記シンクノードへ向けて送信される、収集情報を伝達するための情報収集メッセージを受け取る情報収集部と、
前記情報収集メッセージから、前記シンクノードからのホップ毎の端末数を取得し、取得したホップ毎の端末数を、前記シンクノードへの経路を構築するための経路制御メッセージに入れて送信するルーティング制御部とを有することを特徴とするシンクノード。 - 無線マルチホップネットワークにおいて定期的に情報収集を行うシステムのシンクノードであって、
前記無線マルチホップネットワークを構成する端末から前記シンクノードへ向けて送信される、収集情報を伝達するための情報収集メッセージを受け取る情報収集部と、
前記情報収集メッセージから、前記シンクノードからのホップ毎の端末数を取得し、取得したホップ毎の端末数に基づいて、前記端末から前記シンクノードへの経路を構築するためのホップ毎の経路制御メッセージの送信可能期間と、前記シンクノードへ向けて収集情報を伝達するためのホップ毎の情報収集メッセージの送信可能期間とを計算し、計算した両送信可能期間に基づいて前記経路制御メッセージが前記情報収集メッセージと衝突する期間を計算し、計算した前記衝突する期間を避けて前記経路制御メッセージを送信するように前記経路制御メッセージの送信可能期間を再計算する送信期間制御部と、
計算した前記ホップ毎の情報収集メッセージおよび経路制御メッセージの送信可能期間を自身の経路制御メッセージに入れて送信するルーティング制御部とを有することを特徴とするシンクノード。 - 前記送信期間制御部は、前記ホップ毎の端末数に応じて重みづけされたホップ毎の経路制御メッセージおよび情報収集メッセージの送信可能期間を計算し、
前記ルーティング制御部は、計算した前記ホップ毎の経路制御メッセージおよび情報収集メッセージの送信可能期間を前記経路制御メッセージに入れて前記端末に通知することを特徴とする請求項7に記載のシンクノード。 - 無線マルチホップネットワークにおいて定期的に情報収集を行うシステムであって、
前記無線マルチホップネットワークを構成するシンクノードおよび端末を有し、
前記シンクノードは、
前記端末から前記シンクノードへ向けて送信される、収集情報を伝達するための情報収集メッセージを保持する情報収集部と、
前記情報収集メッセージから、前記シンクノードからのホップ毎の端末数を取得し、取得したホップ毎の端末数を、前記シンクノードへの経路を構築するための経路制御メッセージに入れて送信するルーティング制御部とを有し、
前記端末は、
前記シンクノードからのホップ数およびホップ毎の端末数に基づいて、ホップ毎の経路制御メッセージおよび情報収集メッセージの送信可能期間を計算し、計算した両送信可能期間に基づいて前記経路制御メッセージが前記情報収集メッセージと衝突する期間を計算し、計算した前記衝突する期間を避けて前記経路制御メッセージを送信するように前記経路制御メッセージの送信可能期間を再計算する送信期間制御部と、
自身のホップ数に応じた前記経路制御メッセージの送信可能期間内に前記経路制御メッセージを作成して送信するルーティング制御部と、
自身のホップ数に応じた前記情報収集メッセージの送信可能期間内に前記情報収集メッセージを作成して送信する情報送信部とを有することを特徴とする情報収集システム。 - 無線マルチホップネットワークにおいて定期的に情報収集を行うシステムの端末の通信方法であって、
前記無線マルチホップネットワークを構成するシンクノードからのホップ数およびホップ毎の端末数に基づいて、前記シンクノードへの経路を構築するためのホップ毎の経路制御メッセージの送信可能期間と、前記シンクノードへ向けて収集情報を伝達するためのホップ毎の情報収集メッセージの送信可能期間とを計算し、
計算した両送信可能期間に基づいて前記経路制御メッセージが前記情報収集メッセージと衝突する期間を計算し、
計算した前記衝突する期間を避けて前記経路制御メッセージを送信するように前記経路制御メッセージの送信可能期間を再計算し、
自身のホップ数に応じた前記経路制御メッセージの送信可能期間内に前記経路制御メッセージを作成して送信し、
自身のホップ数に応じた前記情報収集メッセージの送信可能期間内に前記情報収集メッセージを作成して送信することを特徴とする端末の通信方法。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/823,175 US20130182621A1 (en) | 2010-11-30 | 2011-09-15 | Information collection system, terminal and sink node using wireless multihop network, and communication method for the same |
JP2012546721A JP5867411B2 (ja) | 2010-11-30 | 2011-09-15 | 無線マルチホップネットワークを用いた情報収集システム、端末、シンクノード、およびこれらの通信方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2010266935 | 2010-11-30 | ||
JP2010-266935 | 2010-11-30 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012073578A1 true WO2012073578A1 (ja) | 2012-06-07 |
Family
ID=46171534
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2011/071118 WO2012073578A1 (ja) | 2010-11-30 | 2011-09-15 | 無線マルチホップネットワークを用いた情報収集システム、端末、シンクノード、およびこれらの通信方法 |
Country Status (3)
Country | Link |
---|---|
US (1) | US20130182621A1 (ja) |
JP (1) | JP5867411B2 (ja) |
WO (1) | WO2012073578A1 (ja) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2014013560A1 (ja) * | 2012-07-18 | 2014-01-23 | 株式会社日立製作所 | 無線通信システム、無線通信基地局および無線通信端末 |
WO2015034223A1 (ko) * | 2013-09-06 | 2015-03-12 | (주)누리텔레콤 | 무선 센서 네트워크에서의 데이터 전송 방법 및 이를 위한 무선 센서 노드 |
WO2016093256A1 (ja) * | 2014-12-11 | 2016-06-16 | 株式会社テイエルブイ | 対象情報管理システム、通信中継装置、及び、通信中継プログラム |
JP2016187076A (ja) * | 2015-03-27 | 2016-10-27 | 住友電気工業株式会社 | 通信データ処理装置、通信装置、通信システム、通信制御方法および通信制御プログラム |
JP2018082430A (ja) * | 2016-11-18 | 2018-05-24 | 株式会社東芝 | マルチホップネットワーク中でのルーティングおよびスケジューリングのためのデバイスおよび方法 |
WO2020170374A1 (ja) * | 2019-02-20 | 2020-08-27 | 三菱電機株式会社 | 無線局、データ集約局、無線システム、無線局の伝送制御方法およびデータ集約局の伝送制御方法 |
JP2023008426A (ja) * | 2021-07-06 | 2023-01-19 | 三菱電機システムサービス株式会社 | 子局装置および親局装置 |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9504090B2 (en) * | 2013-01-17 | 2016-11-22 | Lg Electronics Inc. | Method and apparatus for group communication in proximity-based service |
CN113489797B (zh) * | 2021-07-07 | 2024-04-05 | 国网冀北电力有限公司 | 虚拟电厂数据收集、信息传输方法、装置及设备 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006237854A (ja) * | 2005-02-23 | 2006-09-07 | Nec Corp | ネットワーク再構成方法、プログラム、情報記録媒体、ノード、基地局、マルチホップネットワークシステム |
JP2006287565A (ja) * | 2005-03-31 | 2006-10-19 | Kddi Corp | ワイヤレスセンサネットワークにおけるデータ送信方法 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3539338B2 (ja) * | 2000-03-23 | 2004-07-07 | 日本電気株式会社 | 優先データ転送方法 |
US7554998B2 (en) * | 2005-01-11 | 2009-06-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Interference-based routing in a wireless mesh network |
JP4545619B2 (ja) * | 2005-03-15 | 2010-09-15 | 富士通株式会社 | ネットワークシステム、レイヤ3通信装置、レイヤ2通信装置および経路選択方法 |
JP4888396B2 (ja) * | 2007-03-05 | 2012-02-29 | ソニー株式会社 | 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム |
-
2011
- 2011-09-15 US US13/823,175 patent/US20130182621A1/en not_active Abandoned
- 2011-09-15 JP JP2012546721A patent/JP5867411B2/ja active Active
- 2011-09-15 WO PCT/JP2011/071118 patent/WO2012073578A1/ja active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006237854A (ja) * | 2005-02-23 | 2006-09-07 | Nec Corp | ネットワーク再構成方法、プログラム、情報記録媒体、ノード、基地局、マルチホップネットワークシステム |
JP2006287565A (ja) * | 2005-03-31 | 2006-10-19 | Kddi Corp | ワイヤレスセンサネットワークにおけるデータ送信方法 |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2014013560A1 (ja) * | 2012-07-18 | 2014-01-23 | 株式会社日立製作所 | 無線通信システム、無線通信基地局および無線通信端末 |
WO2015034223A1 (ko) * | 2013-09-06 | 2015-03-12 | (주)누리텔레콤 | 무선 센서 네트워크에서의 데이터 전송 방법 및 이를 위한 무선 센서 노드 |
WO2016093256A1 (ja) * | 2014-12-11 | 2016-06-16 | 株式会社テイエルブイ | 対象情報管理システム、通信中継装置、及び、通信中継プログラム |
JPWO2016093256A1 (ja) * | 2014-12-11 | 2017-07-13 | 株式会社テイエルブイ | 対象情報管理システム、通信中継装置、及び、通信中継プログラム |
JP2016187076A (ja) * | 2015-03-27 | 2016-10-27 | 住友電気工業株式会社 | 通信データ処理装置、通信装置、通信システム、通信制御方法および通信制御プログラム |
JP2018082430A (ja) * | 2016-11-18 | 2018-05-24 | 株式会社東芝 | マルチホップネットワーク中でのルーティングおよびスケジューリングのためのデバイスおよび方法 |
US10448326B2 (en) | 2016-11-18 | 2019-10-15 | Kabushiki Kaisha Toshiba | Method and device for routing and scheduling in a multi-hop network |
WO2020170374A1 (ja) * | 2019-02-20 | 2020-08-27 | 三菱電機株式会社 | 無線局、データ集約局、無線システム、無線局の伝送制御方法およびデータ集約局の伝送制御方法 |
JP2023008426A (ja) * | 2021-07-06 | 2023-01-19 | 三菱電機システムサービス株式会社 | 子局装置および親局装置 |
JP7292332B2 (ja) | 2021-07-06 | 2023-06-16 | 三菱電機システムサービス株式会社 | 子局装置および親局装置 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2012073578A1 (ja) | 2014-05-19 |
US20130182621A1 (en) | 2013-07-18 |
JP5867411B2 (ja) | 2016-02-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5867411B2 (ja) | 無線マルチホップネットワークを用いた情報収集システム、端末、シンクノード、およびこれらの通信方法 | |
US7889713B2 (en) | Transmission of management messages for relay networks | |
ES2292847T3 (es) | Metodo de encaminamiento por saltos multiples para redes wlan distribuidas. | |
US7155256B2 (en) | Radio communication network system | |
Xie et al. | A network layer protocol for UANs to address propagation delay induced performance limitations | |
US7822009B2 (en) | Distributed medium access protocol for wireless mesh networks | |
EP2460385B1 (en) | Low latency mesh network | |
TWI249306B (en) | Channel assignment method in mobile ad-hoc networks | |
Wang et al. | Distributed MAC protocol supporting physical-layer network coding | |
EP2769510B1 (en) | Peer-to-peer communications in ami with source-tree routing | |
JP2005501466A (ja) | 近傍情報及び公示伝送時間を利用する無衝突伝送スケジューリングのためのシステム及び方法 | |
JP2012095023A (ja) | マルチホップネットワークシステム、サーバおよび経路通知方法 | |
JP4918900B2 (ja) | 無線マルチホップネットワーク、ノード、マルチキャスト経路制御方法及びプログラム | |
JP2008172784A (ja) | 移動体アドホックネットワークでのデータパスの動的リンク管理 | |
WO2009130906A1 (ja) | 通信装置及び通信方法 | |
JP5353576B2 (ja) | 無線通信装置及び無線通信プログラム | |
JP4993185B2 (ja) | 無線通信システム | |
KR101200792B1 (ko) | Mac 유니캐스트와 중계 노드를 이용한 네트워크 브로드캐스트 방법 | |
CN105072586A (zh) | 嵌入式无线自组织网络中对广播消息的转发的管理方法 | |
JP2008312059A (ja) | アドホックネットワーク構成方法及びノード装置 | |
Ahn et al. | A multipoint relay selection method for reliable broadcast in ad hoc networks | |
JP5935077B2 (ja) | マルチホップ通信システム、およびマルチホップ通信方法 | |
Yackoski et al. | Managing end-to-end delay for VoIP calls in multi-hop wireless mesh networks | |
KR101293159B1 (ko) | 무선 애드혹 네트워크에서의 브로트캐스트 패킷 전송 방법 및 장치, 및 브로드캐스트 패킷 송수신 시스템 | |
Bano et al. | Probabilistic broadcasting Protocol in ad hoc network and its advancement: a Review |
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: 11844058 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13823175 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 2012546721 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: 11844058 Country of ref document: EP Kind code of ref document: A1 |