WO2006088066A1 - 無線通信装置、通信経路制御装置、通信経路制御方法及び通信システム - Google Patents
無線通信装置、通信経路制御装置、通信経路制御方法及び通信システム Download PDFInfo
- Publication number
- WO2006088066A1 WO2006088066A1 PCT/JP2006/302670 JP2006302670W WO2006088066A1 WO 2006088066 A1 WO2006088066 A1 WO 2006088066A1 JP 2006302670 W JP2006302670 W JP 2006302670W WO 2006088066 A1 WO2006088066 A1 WO 2006088066A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- wireless
- request frame
- interfaces
- communication
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
Classifications
-
- 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
- H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- 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
-
- 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/26—Route discovery packet
-
- 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/52—Multiprotocol routers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W92/00—Interfaces specially adapted for wireless communication networks
- H04W92/02—Inter-networking arrangements
Definitions
- the present invention relates to an ad hoc network in which a plurality of wireless communication devices are interconnected by a wireless line and autonomously establish a communication path, and in particular, a wireless communication device having a plurality of wireless interfaces
- the present invention relates to a wireless communication apparatus, a communication path control apparatus, a communication path control method, and a communication system that enable effective use of radio resources by autonomously switching between.
- a wireless ad hoc network is a technology that does not have a specific centralized control station and wireless communication devices exchange information from an equal standpoint to autonomously secure a communication path and configure the network. Routing in ad hoc networks can be broadly divided into two methods. One is a distance vector type and the other is a link state type.
- the present invention is a distance vector type represented by AODV (Ad hoc On-Demand Distance Vect or Routing), DSR (Dynamic Source Routing) and STP (Spanning Tree Protocol). References 1, 2, and 3).
- FIG. 1 shows a path control method in a conventional distance vector type algorithm.
- the distance vector algorithm consists of a source node advertising a request frame and a destination node transmitting a route confirmation frame as a response signal of the request frame.
- the intermediate node that has received the request frame stores the distance (communication cost) described in the request frame, and transfers only the frame in which the smaller communication cost is described. By repeating this operation, the destination node can know the route that minimizes the communication cost from the source node.
- the destination node storing the optimum route transmits a route confirmation frame in the reverse order of the stored route. The route through which this route confirmation frame passes is the optimal route from the source node to the destination node.
- Patent Document 1 proposes applying the concept of a spanning tree used in a wired network to a wireless network. Furthermore, a mechanism has been proposed that avoids relay loops and avoids unnecessary relays when building a spanning tree in a wireless network (see, for example, Patent Documents 2 and 3).
- the radio communication device has a single radio interface. Therefore, further improvements are required when multiple wireless interfaces are maintained.
- Patent Document 1 JP 2000-69046
- Patent Document 2 JP 2000-78147 A
- Patent Document 3 JP 2003-188811
- Non-Patent Document 1 IETF RFC3561: AODV routing
- Non-Patent Document 4 Dynamic Load-Aware Routing in Ad hoc Network, Proc. ICC 2001, June, 2001
- Non-Patent Document 5 Characteristic evaluation of ad hoc routing protocol considering link lifetime and node load, IEICE Transactions, Vol.85-B, No.12, 2002
- Non-Patent Document 6 Ad hoc routing protocol that switches indicators based on link and node costs, IEICE Technical Report, NS2003-80, 2003
- Non-Patent Document 7 A Multi-Radio Unification Protocol for IEEE802.il Wireless Network, Microsoft, 2003
- the conventional technology has a problem that it is not possible to avoid load concentration on a node while efficiently using a plurality of wireless interfaces.
- the present invention has been made in view of the above-described prior art, and an object thereof is to achieve effective utilization of radio resources by optimal route selection in consideration of a plurality of radio interfaces. .
- the object of the present invention is a wireless communication apparatus that communicates via a plurality of wireless interfaces in a wireless ad hoc network, and when a request frame is received by one of the plurality of wireless interfaces, A data transmitter / receiver that transmits the request frame via at least two of the plurality of wireless interfaces, and a wireless interface that performs communication from the plurality of wireless interfaces based on the request frame And a wireless communication device having a routing unit for selecting.
- the routing unit may select a wireless interface that performs strong communication among the plurality of wireless interfaces based on the arrival order of the request frames.
- the routing unit may select a radio interface for performing power communication among the plurality of radio interfaces based on the arrival order of the request frames and the communication cost.
- the routing unit selects a radio interface that performs strong communication among the plurality of radio interfaces based on the communication cost of the request frame received within a certain period from the arrival time of the request frame. May be.
- delay can be suppressed to a certain period, and effective utilization of radio resources can be achieved by optimal route selection considering a plurality of radio interfaces.
- a plurality of transmission buffers for storing each of the plurality of wireless interfaces, and a measuring unit for measuring the total amount of data stored in the transmission buffer for each of the plurality of wireless interfaces.
- the transmission / reception unit selects a radio interface to transmit the request frame based on the total amount of data measured by the measurement unit. You may send the request frame.
- a request frame can be transmitted from a wireless interface with a small amount of data stored in the transmission buffer, and the wireless interface usage rate can be made uniform. As a result, it is possible to effectively use radio resources by selecting an optimum route considering a plurality of radio interfaces.
- the data transmission / reception unit receives a request frame at one of the plurality of radio interfaces, a difference between the measurement values of the total data measured by the measurement unit between the radio interfaces is less than a threshold value.
- at least two radio interface powers of the plurality of radio interfaces transmit the request frame, and at least one of the differences between the radio interfaces in the total data amount measurement value measured by the measurement unit is greater than or equal to a threshold value
- the request frame may also be transmitted by the wireless interface having the smaller total data amount.
- a request frame is transmitted according to the difference in the amount of data stored in the transmission buffer.
- the uniformity of the radio interface within one node is maintained, and at the same time, the uniformity of frequency usage with surrounding nodes is maintained. Can be maintained. As a result, it is possible to effectively use radio resources.
- the wireless communication device may function as an access point that manages a subordinate terminal, and the data transmitting / receiving unit receives the frame from the subordinate terminal and receives the request on behalf of the subordinate terminal. You can send a frame.
- the data transmission / reception unit may return a response signal of the request frame instead of the subordinate terminal.
- the wireless communication device further includes an affiliated terminal management unit that manages affiliated terminal information to which a subordinate terminal belongs, and the data transmitting / receiving unit includes a new terminal belonging to the wireless communication device.
- the affiliation terminal management unit receives a frame notifying the affiliation of the new terminal by another wireless communication device, the affiliation of the terminal is Terminal information power may be deleted.
- the routing unit may select a radio interface for performing force communication among the plurality of radio interfaces for each set of a source address and a destination address.
- the wireless interface to be used can be changed for each set of the source address and the destination address, and the effect of load distribution for each wireless interface can be improved. As a result, it is possible to effectively use radio resources by selecting an optimum route in consideration of multiple radio interfaces.
- the data transmitting / receiving unit may periodically transmit a request frame based on a set time set in the routing unit.
- the wireless interface by periodically transmitting a request frame, the wireless interface can be switched, and the effect of load distribution for each wireless interface can be improved. As a result, it is possible to effectively use radio resources by selecting an optimum route considering a plurality of radio interfaces.
- the routing unit selects a radio interface based on the request frame, the routing unit refers to the routing table and confirms whether there is a radio interface used last time for the route to the destination. If it exists, the communication cost for the previously used wireless interface is weighted, and the wireless interface for power communication is selected from the plurality of wireless interfaces based on the weighted communication cost described above. Even so.
- the wireless interface used last time can be easily selected, the change of the communication interface can be reduced, and the system can be stabilized. As a result, it is possible to select an optimum route considering a plurality of radio interfaces.
- FIG. 1 is a diagram showing a path control method in a conventional distance vector algorithm.
- FIG. 2 is a diagram showing an arrangement example of wireless communication devices constituting a wireless ad hoc network to which the present invention is applied.
- FIG. 3 is a block diagram of a wireless communication device according to the first embodiment of the present invention.
- FIG. 4 is a diagram showing an example of a routing table managed by the wireless communication device (node 2) according to the first embodiment of the present invention.
- FIG. 5 is a diagram showing a wireless ad hoc network to which the routing method according to the first embodiment of the present invention is applied.
- FIG. 6 is a diagram showing information set in the routing table of the wireless communication device (node 2) according to the first embodiment of the present invention.
- FIG. 7 is a block diagram of a wireless communication device according to a second embodiment of the present invention.
- FIG. 8A is a diagram showing a wireless ad hoc network configured according to the routing method in the second embodiment of the present invention (when the difference in transmission buffer amount is small! /)
- FIG. 8B is a wireless ad hoc configured according to the routing method in the second embodiment of the present invention. Diagram showing network (if transmission buffer amount difference is large! /)
- FIG. 9 is a block diagram of a wireless communication device according to third and fourth embodiments of the present invention.
- FIG. 10 is a diagram showing an example of a routing table managed by the wireless communication device according to the fifth embodiment of the present invention.
- FIG. 11 is a diagram showing a wireless ad hoc network configured according to the routing control method in the fifth embodiment of the present invention.
- FIG. 12 is a diagram showing an example of a routing table managed by the wireless communication device (node 1) according to the fifth embodiment of the present invention.
- FIG. 14 is a diagram showing route selection when hysteresis is applied according to the seventh embodiment of the present invention.
- FIG. 15A A diagram showing the frame configuration when using request frames and route confirmation frames in IEEE802 wireless LAN (frame configuration for route control)
- FIG. 15B Diagram showing the frame structure when request frames and route confirmation frames are used in IEEE802 wireless LAN (IEEE802.il Action Frame)
- FIG. 15C Diagram showing the frame structure when request frames and path confirmation frames are used in IEEE802 wireless LAN (IEEE802.2LLC)
- FIG. 17 is a diagram showing a frame configuration of a path control payload of a path confirmation frame.
- the wireless LAN medium access control (MAC) layer and physical (PHY) layer are used as a wireless interface. Also good. Also, the power of using two wireless interfaces, IEEE802.11a and IEEE802.llg. More than two wireless interfaces may be used.
- FIG. 2 is a diagram showing an arrangement example of wireless communication devices constituting a wireless ad hoc network to which the present invention is applied.
- Nodes node 1 to node 7 as wireless communication devices are connected to each other by two wireless interfaces (IEEE802.11a and 802.llg) to form a wireless ad hoc network.
- IEEE802.11a and 802.llg two wireless interfaces
- each node can be effectively congested or congested from a plurality of radio interfaces, and can effectively use radio resources by using the radio interfaces. A method for avoiding this congestion will be described later.
- FIG. 3 is a block diagram of the wireless communication device 10 according to the first embodiment of the present invention.
- the wireless communication device 10 includes a plurality of wireless interfaces 101 and 103, a data transmission / reception unit 105, a routing unit 107, and an upper protocol unit 109.
- the data transmission / reception unit 105 and the routing unit 107 may be combined to form the communication path control device 121.
- Data frames received from the radio interfaces 101 and 103 are transferred to the data transmission / reception unit 105, and are classified into routing data used for a routing protocol and user data generated by a higher-level application. routine
- the routing data is transferred to the routing unit 107.
- the data passed to the routing unit 107 is processed according to the route control method described later.
- a routing table including information on multiple wireless interfaces is generated as shown in FIG.
- FIG. 4 is a diagram illustrating an example of a routing table managed by the wireless communication device 10.
- the user system data confirms its destination, and the data addressed to its own node is passed to the upper protocol unit 111.
- Data passed to the upper protocol unit 111 is processed by various upper applications.
- the data addressed to the other node is sent to a predetermined radio interface by setting the frame destination by referring to the routing table of the routing unit 107.
- nodes 1 to 4 are configured as the wireless communication device 10 of FIG.
- FIG. 5 shows a case where user data is generated from node 1 (source) to node 4 (destination).
- Each node has a plurality of radio interfaces, and the communication cost with adjacent nodes is calculated for each radio interface based on the received power of frames exchanged periodically.
- the communication cost increases as the communication distance increases.
- node 1 to node 3 have a communication cost of 10
- node 3 force node 4 has a communication cost of 20.
- communication costs may change if the wireless environment is different. For example, the communication cost of 802.l lg to node 1 power node 2 is 10, whereas the communication cost of 802.11a from node 1 power to node 2 is 12.
- node 1 When node 1 receives user system data from terminal 1, node 1 checks whether there is a route to destination node 4 by referring to the routing table. If the address of node 4 exists in the destination address of the routing table, it can be seen that node 1 holds the route to node 4. When node 1 communicates with node 4 for the first time, basically node 1 should maintain a route to node 4.
- node 1 When node 1 does not hold a route to the destination node, node 1 broadcasts a request frame destined for node 4 to the peripheral nodes (node 2 and node 3).
- this request frame the source address, destination address, request frame A unique ID and a communication cost value from the request frame transmission source are included.
- This request frame is transmitted to both the 802.11a and 802.1lg wireless interfaces held by the node 1 through the data transmission / reception unit of the node 1, and is transmitted from both of the wireless interfaces.
- the node 2 that has received the request frame confirms whether or not the same frame has been previously received by confirming the request ID. If the received request frame is the first frame received, node 2 writes the values shown in Fig. 6 into the routing table. As a result, the routing table shown in FIG. 4 is constructed.
- FIG. 6 shows information set in the routing table of node 2 as an example.
- the destination address indicates the node 4 that is the destination of the request frame.
- node 1 which is the destination of the route confirmation frame is set as the destination address.
- the next node address indicates node 4 as the address of the next node and 11a as the radio interface.
- the sending interface shows node 2 as the address on the sending side and 11a as the radio interface.
- the communication cost value and request ID are set in the routing table. Furthermore, the setting time of the routing table is written.
- node 2 When node 2 has previously received a frame having the same request ID, node 2 calculates the cost of the last one hop to the communication cost described in the request frame, and Calculate communication costs up to 2. The calculated communication cost up to node 2 is compared with the communication cost described in the routing table. As a result of comparison, if the communication cost up to node 2 is higher than the communication cost described in the routing table, node 2 discards the request frame. On the other hand, if it is smaller, node 2 rewrites the contents of the routing table according to the contents of the received request frame. As a result, the contents of the routing table shown in Fig. 4 are updated.
- node 2 when node 2 first receives a request frame with a communication cost value of 0 from the wireless interface of node 1 to 802.11a, node 2 adds 12 as the cost for the last hop. . As a result, the communication cost to node 2 is 12, and that value is written to the routing table. If Node 2 then receives the same request frame from Node 1 on the 802.l lg radio interface, Node 2 will receive the last one hop. Add 10 as the cost of minutes. As a result, the communication cost to node 2 is 10. Since this communication cost is lower than the communication cost described in the routing table, node 2 updates the contents of the routing table. In this way, low-cost radio interface information is written to the routing table.
- node 2 When node 2 rewrites the routing table, node 2 checks whether the destination address of the request frame is its own node. In this case, since the destination is the node 4 and an address different from that of the node 2 is set in the request frame, the node 2 needs to retransmit the request frame.
- Node 2 updates the value of the communication cost in the contents of the request frame (adds the cost for the last one hop and rewrites it to the communication cost up to Node 2), and receives the frame. Transmit from all wireless interfaces regardless of the interface.
- Node 3 performs the same processing as node 2. However, in the case of node 3, the communication cost between node 3 and node 1 is the same for both the wireless interfaces of 802.11l and 802.11a. In this case, the routing table is not updated when a request frame having a late arrival time is received. As a result, the wireless interface with the quick arrival time of the request frame is selected.
- the node 4 that has received the request frame from the node 2 or the node 3 performs the same processing as described above. However, since node 4 is the destination node of the request frame, the request frame is not retransmitted. Instead, node 4 sends a route confirmation frame.
- This route confirmation frame includes a source address, a destination address, and a route confirmation ID.
- node 4 When node 4 as the destination node finally receives the request frame, the route to the request transmission source (node 1) is confirmed in the routing table. Node 4 transmits a route confirmation frame to node 2 (or node 3) by using the route described in the routing table and the described radio interface.
- the lowest communication cost of the request frame received by node 4 via node 2 is 10 802.llg communication cost from node 1 to node 2, as shown in FIG. And the communication cost 10 in 802.11a from node 2 to node 4 is 20.
- the lowest communication cost of the request frame received by node 4 via node 3 is The communication cost 10 from node 3 to node 3 and the communication cost 20 from node 3 to node 4 are 30. Therefore, the node 4 transmits a route confirmation frame via the node 2.
- the node 2 that has received the route confirmation frame writes the route to the route confirmation frame transmission source in the routing table.
- the route confirmation ID is written in the location of the request ID in the routing table shown in Fig. 4.
- Receiving the route confirmation frame node 2 confirms whether or not the destination of the route confirmation frame is its own node, and if not, retransmits the frame according to the routing table.
- the route confirmation frame arrives at node 1 and the processing ends, a communication route between node 1 and node 4 is established. Until this communication path is established, the data frame of user data is held in a buffer provided separately in the routing unit. After the communication path is established, the data frame is transferred to the transmitting radio interface.
- the wireless communication device transmits a request frame from another wireless interface regardless of the wireless interface that has received the request frame.
- the request frame is stagnated in the wireless communication device, causing a delay in the reception of the request frame by the peripheral nodes.
- a request frame with a wireless communication device or wireless interface that is not congested can be received earlier than a congested frame.
- congestion can be avoided by selecting the transmission source wireless interface of the request frame that has arrived first as the communication path.
- effective utilization of radio resources can be achieved by optimal route selection considering multiple radio interfaces.
- the route can be selected if the communication cost value is small.
- the value of the communication cost is determined from the request frames that arrived within the certain period. A small route may be selected.
- effective use of radio resources can be achieved by optimal route selection considering communication costs in consideration of multiple radio interfaces.
- the arrival time of the request frame that first arrives at the destination node is recorded, and only request frames within the threshold time from the arrival time are accepted. It may be configured. As a result, the delay can be kept within a certain value, and at the same time, the radio resource can be effectively utilized by selecting the optimum route in consideration of a plurality of radio interfaces.
- FIG. 7 is a block diagram of the radio communication device 20 according to the second embodiment of the present invention.
- the radio communication device 20 holds a plurality of transmission buffers 211 and 213 for each radio interface, and further includes a measurement unit 215 that measures the data amount of frames accumulated in the transmission buffer. Note that the data transmission / reception unit 205, the routing unit 207, and the measurement unit 215 may be combined to form the communication path control device 221. In the second embodiment, it is assumed that a plurality of transmission buffers are used according to the quality of service (QoS).
- QoS quality of service
- the plurality of transmission buffers are defined in IEEE802. 8 02.
- the priority control in lie is realized by the expected value of the transmission waiting time set for each transmission buffer. That is, the higher the priority of the buffer, the shorter the waiting time expected value is set, so that transmission is performed quickly with a smaller waiting time.
- a routing frame is transmitted using a buffer having a relatively high priority because of the necessity of rapid path setting. At this time, even if a large amount of data is stored in the low-priority buffer, the request frame transmission time will not be significantly affected.
- the total data amount accumulated in the transmission buffers 211 and 213 is measured for each radio interface by the measurement unit 215, and the request frame is transmitted even by the radio interface power having a small total data amount.
- a wireless interface with a small amount of data can be used as a communication path.
- FIGS. 8A and 8B A path control method according to the second embodiment of the present invention will be described with reference to FIGS. 8A and 8B. 8A and 8B are shown when the node 1 configured as the wireless communication device 20 of FIG. 7 transmits a request frame to the node 2 and the node 3.
- each node monitors the total value of the data amount of the transmission buffer for each radio interface in the measurement unit 215.
- the total value of the buffer indicates the total amount of data in the transmission buffer for each priority.
- node 1 When node 1 receives user system data from terminal 1 and transmits a request frame to the destination node, node 1 compares the total amount of data monitored for each radio interface. Node 1 transmits the request frame using the radio interface with a small total value.
- the request frame may be transmitted according to the difference between the total values. If the difference between the total values is equal to or smaller than a predetermined threshold value, a re- gest frame is transmitted from all the radio interfaces (for example, 802.11a and 802.11lg) according to the routing control method of the first embodiment. If the difference between the totals is greater than a predetermined threshold, the node
- a request frame is transmitted from a wireless interface with a small data accumulation amount in a transmission buffer. This will make the wireless interface usage rate uniform. As a result, it is possible to effectively use radio resources by optimal route selection considering a plurality of radio interfaces.
- a request frame can be transmitted according to the difference in the data accumulation amount. That is, when the difference is large, the request frame is transmitted from the wireless interface with a small data storage amount. On the other hand, when the difference is small, a plurality of wireless interface power request frames of the wireless communication device are transmitted. By selecting the transmission of the request frame, the uniformity of the radio interface within one node can be maintained, and at the same time, the uniformity of frequency utilization with surrounding nodes can be maintained. As a result, it is possible to effectively use radio resources.
- the wireless communication apparatus is an access point that does not have a path control function and manages a terminal will be described below as a third embodiment.
- the term “access point” means any communication device having a relay function regardless of whether it is a fixed type or a mobile type.
- terminal means V or any terminal device that does not have a relay function.
- FIG. 9 shows the device configuration of the wireless communication device 30 of the third embodiment.
- the wireless communication device 30 includes a plurality of wireless interfaces 301 and 303, a data transmission / reception unit 305, a routing unit 307, and an upper protocol unit 309, like the wireless communication device 10 of FIG.
- the wireless communication device 30 further has an affiliated terminal management unit 317 that manages terminal affiliated information of subordinate wired communication devices.
- the data transmission / reception unit 305, the routing unit 307, and the measurement unit 317 may be combined to form the communication path control device 321.
- the access point needs to perform route control on behalf of the subordinate terminal. In other words, the access point always manages the address of the terminal under its control.
- terminal affiliation information is always managed so that useless frames are not transmitted over the air.
- the affiliated terminal management unit 317 manages the subordinate terminal in accordance with the IEEE 802.11 standard.
- the affiliation information of this terminal is sent to the routing unit, so that it is possible to deal with a terminal having no route control function.
- the access point checks whether or not the destination exists in the routing table. If the destination does not exist in the routing table, the request frame is transmitted using the route control method of the first embodiment or the second embodiment.
- the access point that receives the request frame compares the information of the terminal belonging to the own node with the destination address. As a result of the comparison, when the destination is a terminal under its own node, the access point transmits a route confirmation frame on behalf of the terminal. This frame When the S request source access point receives it, a communication path is established.
- the access point when the access point receives a V or frame whose route from the subordinate terminal to the destination is unknown, the request frame is transmitted on behalf of the subordinate terminal.
- the access point that received the request frame sends a route confirmation frame as a response signal of the request frame on behalf of the request destination terminal when it is under its control.
- the terminal does not have an ad hoc route control function, it is possible to secure a route to the destination terminal in terms of the source terminal power.
- the wireless communication apparatus is an access point that manages a terminal that does not have a path control function and the terminal moves between access points.
- the terminal does not have a path control function! / And the terminal cannot autonomously establish a communication path, the communication path is disconnected when such a terminal moves between access points. Therefore, it is desirable to quickly restore the communication path when the terminal moves.
- the access point advertises the terminal information to the entire network.
- the access point that has received the advertisement frame manages the advertised terminal address in its own node and confirms in the affiliation terminal management unit 317 whether or not it is described in the affiliation terminal information.
- the access point that has received the advertisement frame refers to the routing table and confirms whether or not the advertised terminal address exists in the routing table. If it exists in the routing table, it is clear that the communication path with the advertised terminal needs to be restored. Therefore, the access point reconstructs the communication path by sending the request frame again. In this way, it is possible to keep the communication path disconnection time short.
- a new terminal belongs to the access point.
- the access point broadcasts a frame notifying its affiliation.
- the terminal information is discarded from the information managing the subordinate terminal.
- a wireless communication apparatus that is communicating with a new terminal or a moved terminal can quickly spread a communication path by transmitting a request frame again. In this way, it is possible to cope with the movement of the terminal. As a result, even when the terminal moves in the network, it is possible to effectively use radio resources by selecting the optimum route considering a plurality of radio interfaces.
- the wireless communication device is an access point connected to a terminal connected to a wireless interface other than IEEE 802.11 (here, a wired interface) will be described below as a fourth embodiment. To do.
- the wireless communication device of the fourth embodiment has the same device configuration as the wireless communication device 30 of FIG. Unlike the third embodiment, when a wired communication device is connected, the wireless communication device can manage the wired communication device simply by the affiliated terminal management unit 3 17 operating according to the IEEE 802.11 standard. What! /
- the access point when the access point receives a data frame via the wired interface, the access point writes the transmission source address of the data frame to the terminal affiliation information of the affiliation terminal management unit 317.
- the access point By adding in this way, it is possible to perform route control for terminals that have once transmitted a data frame and received by the access point in the same way as terminals managed according to the IEEE 802.11 standard. become.
- the access point transmits a data frame from the wired interface.
- the original address is monitored, and when there is a transmission from an unknown wired communication device, the access point records that the wired communication device is under control.
- the access point can transmit a request frame and a route confirmation frame on behalf of the proxy.
- effective utilization of wireless resources can be achieved by optimal route selection considering a plurality of wireless interfaces.
- FIG. 10 is a diagram showing an example of a routing table managed by the radio communication apparatus according to the fifth embodiment of the present invention, in which a transmission source address is added to the routing table of FIG.
- Each wireless communication device when receiving a data frame, confirms the transmission source address using only the destination address of the frame header. If the two match, data is transmitted according to the routing table. If either the destination address of the frame header or the source address is different, the route is re-searched by setting a route in the routing table by sending a separate request frame.
- routing table means route information managed by the routing unit. Since the routing unit transmits a frame based on the destination address, the routing table includes at least the destination address. Furthermore, as shown in FIG. 4, the routing table may include a next node address, a transmission interface, a communication cost value, and a request ID. Further, the routing table may include the source address as in the fifth embodiment, or may include the set time as in the sixth embodiment described later. Since the routing table is written based on the request frame, like the routing table, the request frame also includes at least the destination address. Further, the request frame may include a transmission source address, a request, and a communication cost value.
- FIG. 11 is a diagram showing a wireless ad hoc network configured according to the path control method in the fifth embodiment of the present invention.
- Nodes 1 to 4 that communicate via a plurality of wireless interfaces are configured according to the device configuration of the first embodiment, for example, and further include a source address in the routing table of the routing unit.
- the nodes 1 to 4 are connected to each other through a plurality of wireless interfaces (802.11a and 802.llg) to form a wireless ad hoc network.
- a description will be given of data transmission from terminal 1 and terminal 2 connected to node 1 to terminal 3 connected to node 4.
- node 1 when data is transmitted from the terminal 1 to the terminal 3, the node 1 confirms whether or not the route to the destination terminal 3 is retained. When this confirmation is made, node 1 also refers to the information of terminal 1 that is the source address in addition to the destination address, and determines whether there is a route from terminal 1 to terminal 3. If the route does not exist, node 1 sends request frames from multiple radio interfaces.
- the routing table in node 1 is configured in the same way as the routing control method of the first embodiment, and information as shown in FIG. 12 is written in the routing table.
- FIG. 12 is a diagram showing an example of a routing table managed by the wireless communication apparatus (node 1) according to the fifth embodiment of the present invention.
- This fifth embodiment is different from the first embodiment in that the information of the terminal 1 is written in the routing table as a source address. Based on this routing table, node 1 sends data from terminal 1 to node 2 over an 802.l lg radio interface. In addition, node 2 transmits to node 4 through the radio interface of 8 02.11a, and finally data is transmitted to terminal 3.
- each node checks the source address, and if the pair of the source address and the destination address does not match, Send a request frame.
- 802.11 lg is selected between node 1 and node 2
- 802.11a is selected between node 2 and node 4.
- the communication cost of the wireless interface of 802.l lg to node 1 node 2 is 13. Therefore, for transmission from terminal 2 to terminal 3, 802.11a is selected between node 1 and node 2, and 802.l lg is selected between node 2 and node 4.
- The reconfiguring the route from terminal 2 to terminal 3 in this way, the radio interface for transmission from terminal 1 to terminal 3 and the radio interface for transmission from terminal 2 to terminal 3 are separated. Becomes possible.
- the radio interface used for each set of the source address and the destination address can be changed by managing the source address with the routing table. It is possible to secure a route while keeping the frequency of use of multiple wireless interfaces constant. That is, it becomes possible to improve the load distribution effect for each radio interface. As a result, it is possible to effectively use radio resources by optimal route selection considering a plurality of radio interfaces.
- the routing unit can write the time set in the routing table to the set time in the routing table.
- the optimal route may change according to changes in the configuration of each node and changes in communication status. Therefore, it is preferable to construct a route by sending a request frame again even if it is a known route when the set time force for which the route has been set has also passed a certain time.
- each node is configured according to the apparatus configuration of the first embodiment, for example. Furthermore, the set time is included in the routing table of the routing unit. Each node transmits a request frame again when it receives a data packet to the corresponding destination (or a pair of destination and transmission source) after a predetermined period of time has elapsed from the set time described in the routing table. .
- the radio interface by periodically transmitting the request frame, and to improve the load distribution effect for each radio interface. Become. As a result, it is possible to effectively use radio resources by optimal route selection considering a plurality of radio interfaces.
- the data frame may be held in a buffer provided separately in the routing unit until the communication is established after the request frame is transmitted, or the old route is set. If the time is sufficiently new, a data frame may be transmitted in parallel with the request frame using the wireless interface of the old route that has already established a communication route with the destination node.
- the communication cost between nodes is equal, and the case or the difference in the communication cost is small.
- a communication path is calculated by periodically transmitting a request frame, a different wireless interface may be selected every time the communication path is calculated. Frequent changes in the radio interface are not desirable in terms of system stability. For this reason, it is possible to reduce changes in the radio interface used in the communication path by applying hysteresis to the path selection so that the old path can be easily selected.
- FIG. 13 is a diagram showing route selection when hysteresis is not applied.
- the communication costs of the two radio interfaces differ greatly, so the radio interface (802.l lg) with the lower communication cost is always selected.
- the wireless interface used for the communication path is Probably selected.
- the new route may select a different radio interface than the old route, and in some cases, a different radio interface is selected each time the communication route is calculated, making the system unstable.
- the routing unit in FIG. 3 refers to the routing table to check whether the old route radio interface exists. If there is a wireless interface used in the old route, the communication cost for the wireless interface used in the old route is weighted to 1 or less. By comparing the communication costs of the radio interfaces using the communication costs weighted in this way, a radio interface that can communicate with each other out of a plurality of radio interfaces is selected.
- FIG. 14 shows route selection when hysteresis is applied according to the seventh embodiment of the present invention.
- the routing table is referred to when the route is selected, and the communication cost of the radio interface used in the old route is multiplied by a weight of 1 or less.
- the weight is multiplied by 0.8. In this way, even if the wireless interface used in the old route between the node 2 and the node 3 is on the new route, it is easy to be selected.
- the communication cost of the radio interface between two nodes is equal, or if there is a difference between the communication costs, in this case, the old route will continue to be easily selected, and the system will be stable.
- a control ID indicating the frame type is assigned after the header as a frame configuration for path control indicating the request frame and the path confirmation frame, and then It is possible to use a frame configuration in which a path control payload is added to the. It represents a request frame or a route confirmation frame using the header and Control ID.
- the destination address, the next node address, the transmission interface, the communication cost value, the request ID, the set time, and the like shown in the above embodiment are set. Like the destination address, a part of the above payload is set in the header and may not be set in the payload.
- the 802.11 header corresponds to the header of Fig. 15A
- Category / Action corresponds to the Control ID of Fig. 15A.
- Category and Action at the beginning of the next 802.11 payload, set the identifier (mesh) that is an action related to the mesh network to Category, and set the identifier indicating the type of request frame Z path confirmation frame to Action. Set. With this setting, the routing payload can be specified.
- the 802.11 header corresponds to the header of FIG. 15A, and the LLC / SNA P header and ID correspond to the Control ID of FIG. 15A.
- Type data.
- the following LLC / SNAP header has a field indicating the organization code called OUI.
- An identifier (mesh) indicating a mesh network is set in this OUI, and the subsequent payment method is distinguished.
- OUI mesh
- an ID is set at the head of the next payload, and an identifier indicating the type of request frame / path confirmation frame is set. With this setting, the routing payload can be specified.
- the routing payload since the routing payload can be specified, information can be set in the routing payload according to a predetermined frame configuration. Can be deciphered.
- Examples of the frame configuration of the path control payload include the configurations of FIG. 16 and FIG. FIG. 16 is a diagram showing a frame configuration of the request frame path control payload.
- the request frame includes a transmission source address, a destination address, a unique ID of the request frame, and a communication cost value from the request frame transmission source.
- the RREQ ID in Fig. 16 corresponds to the request ID
- the Metric corresponds to the communication cost value
- the Source Address corresponds to the source address
- the Destination Address # l corresponds to the destination address.
- FIG. 17 is a diagram showing a frame configuration of the path control payload of the path confirmation frame corresponding to FIG. As described above, by using the frame configurations shown in FIGS. 15 to 17, the above embodiment can be realized in the IEEE802.11 wireless system.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP20060713811 EP1850538B1 (en) | 2005-02-16 | 2006-02-15 | Radio communication device, communication route control device, communication route control method, and communication system |
| CN200680004969XA CN101120555B (zh) | 2005-02-16 | 2006-02-15 | 无线通信装置、通信路径控制装置、通信路径控制方法及通信系统 |
| US11/816,332 US7948891B2 (en) | 2005-02-16 | 2006-02-15 | Wireless communication apparatus, communication routing control apparatus, communication routing control method and communication system |
Applications Claiming Priority (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2005-039173 | 2005-02-16 | ||
| JP2005039173 | 2005-02-16 | ||
| JP2005098577 | 2005-03-30 | ||
| JP2005-098577 | 2005-03-30 | ||
| JP2006-019461 | 2006-01-27 | ||
| JP2006019461A JP4762735B2 (ja) | 2005-02-16 | 2006-01-27 | 無線通信装置、通信経路制御装置、通信経路制御方法及び通信システム |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2006088066A1 true WO2006088066A1 (ja) | 2006-08-24 |
Family
ID=36916470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2006/302670 Ceased WO2006088066A1 (ja) | 2005-02-16 | 2006-02-15 | 無線通信装置、通信経路制御装置、通信経路制御方法及び通信システム |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US7948891B2 (ja) |
| EP (1) | EP1850538B1 (ja) |
| JP (1) | JP4762735B2 (ja) |
| KR (1) | KR100900307B1 (ja) |
| CN (1) | CN101120555B (ja) |
| WO (1) | WO2006088066A1 (ja) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2015186074A (ja) * | 2014-03-25 | 2015-10-22 | 日本電信電話株式会社 | 無線ネットワーク構築装置、無線ネットワークシステム、および、無線ネットワーク構築方法 |
Families Citing this family (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8340106B2 (en) | 2006-03-13 | 2012-12-25 | Microsoft Corporation | Connecting multi-hop mesh networks using MAC bridge |
| JP2008061227A (ja) * | 2006-08-02 | 2008-03-13 | Advanced Telecommunication Research Institute International | 無線装置、それを備えた無線通信ネットワークおよび無線装置におけるチャネル検出方法 |
| KR101307803B1 (ko) * | 2006-12-13 | 2013-09-12 | 삼성전자주식회사 | 네트워크 트래픽 분산 방법 및 이를 이용하는 네트워크시스템 |
| JP4863863B2 (ja) * | 2006-12-22 | 2012-01-25 | 三菱電機株式会社 | 中継器、通信ネットワークシステム |
| CN101669326B (zh) | 2007-02-27 | 2014-11-12 | 安移通网络公司 | 利用路径距离因数在网状网中进行射频管理的方法和系统 |
| JP2009033730A (ja) * | 2007-06-26 | 2009-02-12 | Ricoh Co Ltd | 無線通信装置、無線通信方法および無線通信プログラム |
| CN101940036B (zh) * | 2007-12-28 | 2014-01-01 | 意大利电信股份公司 | 包含蜂窝网络和局域网的混合通信网络的管理 |
| JP5066455B2 (ja) * | 2008-01-28 | 2012-11-07 | Kddi株式会社 | 無線通信経路決定装置および無線通信経路決定方法 |
| JP2010050903A (ja) * | 2008-08-25 | 2010-03-04 | Fujitsu Ltd | 伝送装置 |
| JP5711446B2 (ja) * | 2009-01-13 | 2015-04-30 | 株式会社ナカヨ | 無線端末装置 |
| FR2942925A1 (fr) * | 2009-03-03 | 2010-09-10 | Thomson Licensing | Methode de calibration d'un terminal a antenne multisectorielle et terminal d'un reseau maille |
| GB2473849B (en) * | 2009-09-25 | 2015-06-17 | Ge Aviat Systems Ltd | Module communication |
| JP5514520B2 (ja) * | 2009-11-25 | 2014-06-04 | 株式会社メガチップス | 通信システムおよび通信装置 |
| JP5255579B2 (ja) * | 2010-02-09 | 2013-08-07 | 日立オートモティブシステムズ株式会社 | 車内データ中継装置、車両制御システム |
| JP5438614B2 (ja) * | 2010-07-15 | 2014-03-12 | 大阪瓦斯株式会社 | ネットワークの再構築方法及びネットワークシステム |
| JP5750973B2 (ja) * | 2011-03-29 | 2015-07-22 | 富士通株式会社 | 通信方法および通信装置 |
| JP5662859B2 (ja) * | 2011-03-29 | 2015-02-04 | Kddi株式会社 | ネットワークにおけるデータ圧縮の効果を考慮したパス設定方法 |
| US9106567B2 (en) * | 2011-12-21 | 2015-08-11 | Silver Spring Networks, Inc. | System and method for setting a path to an access point across a wireless mesh network |
| US10642897B2 (en) * | 2012-03-23 | 2020-05-05 | Sap Se | Distance in contextual network graph |
| EP2699040B1 (en) | 2012-08-06 | 2015-04-08 | Itron, Inc. | Multi-media multi-modulation and multi-data rate mesh network |
| FR3005546B1 (fr) * | 2013-05-13 | 2015-05-29 | Commissariat Energie Atomique | Procede et dispositif de selection d'interface de communication |
| JP6259622B2 (ja) * | 2013-09-26 | 2018-01-10 | 関西電力株式会社 | 通信装置、無線ネットワークシステム、無線ネットワーク制御方法、及び、無線ネットワーク制御プログラム |
| US10015720B2 (en) | 2014-03-14 | 2018-07-03 | GoTenna, Inc. | System and method for digital communication between computing devices |
| CN103957162B (zh) * | 2014-05-14 | 2017-02-15 | 常熟理工学院 | 一种无线网络的路由通信实现方法 |
| EP3291507B1 (en) * | 2015-04-27 | 2023-12-13 | Sony Group Corporation | Information processing device, communication system, information processing method and program |
| US20170245195A1 (en) * | 2016-02-22 | 2017-08-24 | Mediatek Inc. | Method for controlling network interfaces of electronic device and associated processing circuit |
| WO2018034604A1 (en) * | 2016-08-18 | 2018-02-22 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and wireless device for handling transmission of data |
| JP6913957B2 (ja) | 2019-03-29 | 2021-08-04 | 国立研究開発法人情報通信研究機構 | 無線通信システム、及び無線通信方法 |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004153529A (ja) * | 2002-10-30 | 2004-05-27 | Toshiba Corp | 中継装置及び通信システム |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2947351B1 (ja) | 1998-08-26 | 1999-09-13 | 日本電信電話株式会社 | 学習型無線パケット転送方法および該方法を用いた無線基地局 |
| JP3010157B1 (ja) | 1998-08-28 | 2000-02-14 | 日本電信電話株式会社 | 無線パケット転送方法および該方法を用いた無線基地局 |
| US6757270B1 (en) * | 1999-06-11 | 2004-06-29 | Lucent Technologies Inc. | Low back haul reactivation delay for high-speed packet data services in CDMA systems |
| US6625164B1 (en) * | 1999-07-14 | 2003-09-23 | Qualcomm, Incorporated | Selectively framing and unframing PPP packets depending on negotiated options on the Um and Rm interfaces |
| JP3869712B2 (ja) | 2001-12-14 | 2007-01-17 | 株式会社日立国際電気 | 無線ブリッジ |
| EP1496719B1 (en) * | 2003-07-10 | 2011-01-26 | Alcatel Lucent | Bandwidth and power saving in a multimode mobile radio telecommunication terminal by selective monitoring of a plurality of radio interfaces |
| GB0317372D0 (en) * | 2003-07-25 | 2003-08-27 | Royal Holloway University Of L | Routing protocol for ad hoc networks |
| US7480248B2 (en) * | 2003-08-22 | 2009-01-20 | Samsung Electronics Co., Ltd. | Apparatus and method for determining aggregated link costs in a mobile ad hoc network |
| KR100605896B1 (ko) * | 2003-10-07 | 2006-08-01 | 삼성전자주식회사 | 모바일 애드 혹 네트워크에서 부분 경로 탐색을 이용하여 라우트 경로를 설정하는 방법 및 이동통신 단말기 |
| US7414977B2 (en) * | 2003-11-25 | 2008-08-19 | Mitsubishi Electric Research Laboratories, Inc. | Power and delay sensitive ad-hoc communication networks |
-
2006
- 2006-01-27 JP JP2006019461A patent/JP4762735B2/ja not_active Expired - Fee Related
- 2006-02-15 WO PCT/JP2006/302670 patent/WO2006088066A1/ja not_active Ceased
- 2006-02-15 US US11/816,332 patent/US7948891B2/en not_active Expired - Fee Related
- 2006-02-15 EP EP20060713811 patent/EP1850538B1/en not_active Not-in-force
- 2006-02-15 CN CN200680004969XA patent/CN101120555B/zh not_active Expired - Fee Related
- 2006-02-15 KR KR20077018588A patent/KR100900307B1/ko not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004153529A (ja) * | 2002-10-30 | 2004-05-27 | Toshiba Corp | 中継装置及び通信システム |
Non-Patent Citations (1)
| Title |
|---|
| OHTA K. ET AL.: "Ubiquitous Internet Access via Ad hoc Network", INFORMATION PROCESSING SOCIETY OF JAPAN KENKYU HOKOKU, 2002-MBL-20-30, 8 March 2002 (2002-03-08), pages 219 - 224, XP003004504 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2015186074A (ja) * | 2014-03-25 | 2015-10-22 | 日本電信電話株式会社 | 無線ネットワーク構築装置、無線ネットワークシステム、および、無線ネットワーク構築方法 |
Also Published As
| Publication number | Publication date |
|---|---|
| US20090052374A1 (en) | 2009-02-26 |
| KR20070097573A (ko) | 2007-10-04 |
| CN101120555B (zh) | 2011-12-14 |
| JP4762735B2 (ja) | 2011-08-31 |
| EP1850538A4 (en) | 2010-08-04 |
| EP1850538B1 (en) | 2012-02-15 |
| KR100900307B1 (ko) | 2009-06-02 |
| JP2006311495A (ja) | 2006-11-09 |
| CN101120555A (zh) | 2008-02-06 |
| US7948891B2 (en) | 2011-05-24 |
| EP1850538A1 (en) | 2007-10-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4762735B2 (ja) | 無線通信装置、通信経路制御装置、通信経路制御方法及び通信システム | |
| JP5276686B2 (ja) | 無線基地局、およびパケット転送経路最適化方法 | |
| CN1860748B (zh) | 无线通信装置及路径搜索方法 | |
| US5987011A (en) | Routing method for Ad-Hoc mobile networks | |
| EP1966961B1 (en) | Method and system for improving a wireless communication route | |
| JP4098772B2 (ja) | 移動体アドホック・ネットワークにおける許可制御 | |
| JP4025774B2 (ja) | 移動体アドホック・ネットワークにおけるサービス品質ルーティング | |
| EP1502459B1 (en) | Scouting channels in a mobile ad hoc network | |
| EP1502200B1 (en) | Tracking traffic in a mobile ad hoc network | |
| EP2296326B1 (en) | Route selection in wireless networks | |
| JP4679616B2 (ja) | 無線lan中継装置、無線lan中継方法およびコンピュータプログラム | |
| JP2005524336A (ja) | 移動体アドホック・ネットワークにおけるトラヒックのポリシー処理 | |
| WO2007053141A1 (en) | Method for determining a route in a wireless mesh network using a metric based on radio and traffic load | |
| US7881250B2 (en) | Packet communication system | |
| JP2007129542A (ja) | 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム | |
| JP5720793B2 (ja) | データ転送方法およびそれを用いるノード装置 | |
| Guo et al. | Resource aware routing protocol in heterogeneous wireless machine-to-machine networks | |
| JPWO2007102208A1 (ja) | マルチホップ無線ネットワークシステム | |
| JP4830879B2 (ja) | 無線データ通信システム | |
| CN1922832B (zh) | 分组传送系统、无线基站以及分组传送路径最佳化方法 | |
| Agarwal et al. | Enhanced AODV routing protocol for ad hoc networks | |
| JP2008524959A (ja) | 多層wlanにおける無線バックホールの方法 | |
| JP2007201781A (ja) | 無線パケット通信システム及び無線パケット通信方法 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| WWE | Wipo information: entry into national phase |
Ref document number: 2006713811 Country of ref document: EP |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 1020077018588 Country of ref document: KR |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 200680004969.X Country of ref document: CN Ref document number: 11816332 Country of ref document: US |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| WWP | Wipo information: published in national office |
Ref document number: 2006713811 Country of ref document: EP |