WO2005015856A1 - 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム - Google Patents
通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム Download PDFInfo
- Publication number
- WO2005015856A1 WO2005015856A1 PCT/JP2004/011651 JP2004011651W WO2005015856A1 WO 2005015856 A1 WO2005015856 A1 WO 2005015856A1 JP 2004011651 W JP2004011651 W JP 2004011651W WO 2005015856 A1 WO2005015856 A1 WO 2005015856A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- route
- communication terminal
- communication
- message
- node
- Prior art date
Links
Classifications
-
- 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/22—Alternate 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
- H04L45/02—Topology update or discovery
- H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
-
- 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 a communication system, a communication method, a communication terminal device, a control method thereof, and a program, and is suitably applied to, for example, an ad hoc network system.
- An ad hoc network is one such network.
- each communication terminal (hereinafter referred to as a node) routes messages by wireless communication, thereby providing mobility, flexibility, and flexibility. It was designed to build a highly economical network.
- ad hoc network routing protocols include an on-demand method in which a communication path to a destination is found immediately before starting communication, and each node irrespective of the presence or absence of communication.
- the communication path up to this point is discovered in advance, and this is stored as a table.
- the table drive method can be broadly divided into two categories.
- hybrid methods that integrate these Formulas have also been proposed.
- AO DV proposed as a typical routing protocol of the on-demand system is proposed in MANET WG (Mobil A dhoc NETwork World Group) of IETF (. Internet Engineering T ask Force). (Ad hoc On-demand D istance Vector) protocol (for example, see Patent Document 1).
- MANET WG Mobil A dhoc NETwork World Group
- IETF Internet Engineering T ask Force
- Ad hoc On-demand D istance Vector for example, see Patent Document 1.
- FIG. 25A shows an ad hoc network system 1 constructed by a plurality of nodes A to E ′ and S ′.
- nodes A ′ to E ′ and S ′ that are within the range where they can communicate with each other are connected by lines.
- the route discovery described below is performed. The process finds a route between the nodes A 'to E and S' to communicate.
- the node S when the node S 'starts communication with the node D and the node S' does not know the communication route to the node D, the node firstly issues a route request message (RREQ: R oute Request) Broadcast 2.
- RREQ R oute Request
- This route request message 2 is composed of "Type,”"Flag,””Reserved,””HopCount,””RREQID,””Destination Ad dress,” and “Destination Sequence Numb.”
- er ",” O riginator Ad dress “and”'O riginator S equence Numl? er Fi one Noredo 3 to 3 9 are force et structure of "field 3 i types of messages (route request to the" Ty pe " If the message "1"), the flag for field 3 2 for various communication control "F 1 ag", "Ho p C ount” field. de 3 4 to the number of hops (initial value is "0" ) ": RREQ ID” field 35 in the route request message to an applied unique ID (hereinafter, referred to as a route request message ID it) is stored respectively Is done.
- the node A 'to E' is received the route request message 2, their on the basis of the "D estination Ad dress" Fi one Noredo 3 of 6 the route request message 2, which is stored in the destination 'of the route request message it is determined whether the route request message 2 destined, the route after having "1" to increase the number of hops stored in the field 3 4 of the "H op C ount" when not addressed to itself Broadcast request message 2.
- the nodes A 'to E' check whether or not the address of the node D 'to which the route request message 2 is transmitted exists in its own route table. Insert various information (entry ') on the reverse route (Reverse Path) to node D' into the route table.
- this routing table is a table to be referred to when data that is destined to the node (here, node D ′) is received thereafter, and as shown in FIG. estination Ad dress ", ID e 'stination S equence Numb er ", from "Ho p C ount", “Ne xt Ho p", “P recursor L ist", field 5 i 5 6 of "the ife T i me.” Be composed.
- Node A 'to E' is also the route table 4 to 'N e X t H op "field 5 4 of the route request message 2 to the route request message 2 contained in the header of Baketsuto stored Stores the address of one of the neighboring nodes A 'to C, E', S that has been forwarded.
- a reverse route to the node D is established, and when data destined to the node D, is transmitted thereafter, the corresponding “Ne xt The data is transferred to the nodes A 'to E' of the address described in the 'field 53' of 'Hop'.
- node A 'to E' stores a list of other nodes A to E using that route communications to field 5 5 in the "P recursor L ist" of the route table 4, "L ife T i me field 5 6 "stores the lifetime of the route. And thus, after this the entry, the "L ife T i me” field 5 of 6 based on the stored survival time survival whether is managed, if survival time is used Rukoto without has elapsed Is deleted from the routing table 4.
- each of the nodes A 1 to E ′ receiving the route request message 2 checks the route request message ID (“RREQ ID” in FIG. 26) of the route request message 2 in order to prevent double reception. If the route request message 2 with the same route request message ID has been received, the route request message 2 is discarded. In some cases, the route request message 2 may reach a plurality of nodes D ′ via different routes, but at this time, the node gives priority to the first one that has arrived, Those that arrive after the second are discarded. As a result, a unique route from node S, which is the source of the route request message, to node D ", which is the destination, can be created in both directions.
- RREQ ID route request message ID
- the node D 'that has received the route request message 2 creates a route response message (RREP: Route Out) (RREP) 6 as shown in FIG. 28, and forwards the route response message 2 to this.
- the call is multicast to the neighboring nodes C and E ′.
- This route response message 6 consists of “Type,” “F1 ag,” “Reserved,” “Prefix S z,” “Ho p Count,” “Destination Ad dress J“ D estination S equence Numb er ",” O riginator Ad dress J and " ⁇ Ifeti me” Finoredo 7 to 7 9 are the force et structure of the type of message Finore de 7 of "T ype"'(the route reply message for the "2"), the flag for the field 7 2 for various communication control "F 1 ag” Finoredo 7 4 subnet address of "P refi XS z" field 7 of the "Ho p C ount” 5 stores the number of hops (the initial value is “0”). ,
- the route reply message 6 "D estination Ad dress J," in the “D estination S equence Numb er” ⁇ Hi "O riginator Ad dress each Fi one Honoré de 7 6-7 8 J, the route request message 2 according respectively O riginator Ad dres sJ, "O riginator S equence Numb er” or ".D estination Ad dress each of J fields 3 8, 3 9, 3 6 data Ru copied.
- this route node receives a response message 6 C ', E, the route reply message 6 "D estination.
- Ad dres sJ Finoredo 3 6 have been addressed to based on the destination of the route reply message 6 described in the Judge whether it is Route Response Message 6 or not.
- nt the number of hops stored in the field 3 4 is increased by“ 1 ”, and the route response message 6 is set as the reverse route when the route request message 2 is transferred (the route table for the node S).
- the nodes A ′ to C ′, E ′, and S ′ check whether or not the address of the node D that is the transmission source of the route response message 6 exists in its own route table 4. If not, the entry of the reverse route to the node D is entered in the route table 4 in the same manner as described above with reference to FIG.
- the routing information is constantly exchanged by the routing protocol, so it is relatively resistant to obstacles.
- the overhead due to constantly transmitting and receiving information is a problem.
- the cycle of updating the routing table is long, there is a problem that sudden failures cannot be handled.
- a route creation method that creates multiple routes has been proposed, but in those route control methods, the route to be used is retained-the intermediate node leaves it to the intermediate node, and the sender Not all routes can be selected. Even if an arbitrary route can be selected from multiple routes, data packets transmitted from the same source will all pass through the same route, and different routes will be used for each attribute of the data bucket. It is not possible to use multiple routes efficiently, such as freely changing routes based on link quality that changes over time. In general, ad-hoc networks (routes that can be deleted are often automatically deleted if they are not used for a long time. Even if multiple routes can be set by a routing protocol, routes that eventually disappear from the routing table without being used). There are many.
- the route discovery process is performed from the time when a certain route has already been disconnected (detected). Since the processing load on the data that cannot be transmitted before the route is established and the time required to establish the alternative route increase, it is an effective obstacle for communication forms such as real-time communication that requires immediacy. This is not a solution.
- the routing information is constantly exchanged between nodes by the routing protocol, and there is a problem that the processing load at the time of exchanging the routing information increases. It is not suitable for communication forms such as real-time communication requiring low power consumption and communication requiring low power consumption. Disclosure of the invention
- the present invention has been made in view of the above points, a highly reliable communication system, A communication method, a communication terminal device, a control method thereof, and a program are proposed.
- the first message transmitted from the first communication terminal and transmitted to the third communication terminal via the second communication terminal and the first message On the other hand, based on the second message transmitted from the third communication terminal and transmitted to the first communication terminal via the second communication terminal, the first to third communication terminals
- the communication creates a route to the third communication terminal, and a communication system, a communication method, and a communication terminal device applied to the communication system for communicating between the first and third communication terminals via the created route.
- the first communication terminal transmits a route request that is a request for a route used for communication with the third 'communication terminal
- 3 communication terminals are the first or second
- routes to the first or third communication terminal are respectively created by receiving messages redundantly, and a route satisfying the route request transmitted from the first communication terminal among the created routes. Is set as a communication path between the first and third communication terminals.
- the first communication terminal can perform the second or third communication. From the plurality of routes created by the terminal, a desired route can be set as a communication route by the second and third communication terminals, and an optimum communication route is accordingly set between the first and third communication terminals. Communication can be performed. .
- the first to third communication terminals are set to the first or third communication terminal.
- the first communication terminal transmits a route request as a request for a route used for communication with a third communication terminal.
- the second and third communication terminals respectively create a plurality of routes to the first or third communication terminal by receiving the first or second message redundantly, respectively.
- the first and Sth communication terminals A communication system, a communication method, a communication terminal device applied to the communication system, a control method thereof, and a communication terminal device capable of performing communication through an optimal communication path between the communication terminals A program mounted on the device can be realized.
- FIG. 1 is a conceptual diagram showing a configuration of an ad hoc network system according to the present embodiment.
- FIG. 2 is a block diagram showing a configuration of a communication function block in each node.
- FIG. 3 is a conceptual diagram showing a configuration of a route request message according to the present embodiment.
- FIG. 4 is a flowchart illustrating the procedure of the route request message receiving process.
- FIG. 5 is a conceptual diagram for explaining a case where a plurality of routes are created from node S to node D.
- FIG. 6 is a conceptual diagram showing a configuration of a route response message according to the present embodiment.
- FIG. 7 is a conceptual diagram showing the configuration of the route table according to the present embodiment.
- FIG. 8 is a flowchart showing a route entry input processing procedure.
- FIG. 9 is a flowchart showing the procedure of the route response message receiving process.
- FIG. 10 is a conceptual diagram showing the state of the routing table in each node.
- FIG. 11 is a flowchart illustrating a communication processing procedure.
- FIG. 12 is a schematic diagram for explaining a route activation bucket.
- Fig. 13 is a flowchart showing the procedure of the route activation packet transmission process. It is. ,
- FIG. 14 is a flowchart showing the procedure of the reception of the route activation packet. '
- FIG. 15 is a schematic diagram showing how different routes are set for each flow ID.
- FIG. 16 is a schematic diagram illustrating a configuration of an ad hoc network system according to the present embodiment.
- FIG. 17 is a schematic diagram used for explaining transmission of a ringing state message.
- FIG. 18 is a schematic diagram showing a communication route and an alternative route.
- FIG. 19 is a schematic diagram illustrating the configuration of a link status notification message.
- FIG. 20 is a flowchart of the status notification process. +
- FIG. 21 is a schematic diagram illustrating a link state table.
- FIG. 22 is a schematic diagram illustrating the configuration of an extended route request message.
- FIG. 23 is a flowchart illustrating the procedure of the route reset request processing.
- FIG. 24 is a flowchart showing the route resetting procedure.
- FIG. 25 is a conceptual diagram for explaining the route creation in the conventional ad hoc network system. .
- FIG. 26 is a conceptual diagram showing the structure of a conventional route request message.
- FIG. 27 is a conceptual diagram showing the configuration of a conventional routing table.
- FIG. 28 is a conceptual diagram showing the structure of a conventional route response message.
- FIG. 29 is a schematic diagram illustrating a communication path established by local repair. BEST MODE FOR CARRYING OUT THE INVENTION
- the node S when transmitting data from the node S to the node D, the node S broadcasts a request message 20 (FIG. 3) destined to the node D. —
- each of the nodes A to A other than the node S receives the route request message 20 transmitted via different routes repeatedly while setting the reverse route, and sequentially broadcasts these. Cast.
- multiple routes from node S to node D are created.
- each of the nodes A to E and S assigns a priority to each created route according to a predetermined reference and manages the route in the route table 30 (FIG. 7). .
- the node D that has received the route request message 20 performs a multicast (ie, multicast) of the route response message 23 (FIG. 6) destined to the node S for each created route.
- a multicast ie, multicast
- Each of the nodes A to C, E, and S other than the node D sends the route response message 23 transmitted in the opposite direction to the route set when the route request message 20 is transferred to the node D in the reverse direction.
- Duplicate reception is performed while setting a route, and these are unicast to each route to the node S set when the route request message 20 is transferred.
- multiple routes from node D to node S are created.
- each of the nodes A to E and S assigns a priority to each of the created routes according to a predetermined reference and manages the routes in the route table 30.
- each of the nodes A to E starts transmission of data from the node S, and when the data is transmitted, the route having the highest priority among the plurality of routes managed in its own route table 30. Select one and send the data to the corresponding nodes A to E. As a result, the data transmitted from node S is It is transmitted to node D via the route that is most suitable for the standard.
- the nodes A to E and S in which the communication failure has occurred are selected from the plurality of routes managed in their own route table 30 and are currently used. The route with the next highest priority is selected, the used route is switched to that route, and data is transmitted to the corresponding nodes A to E.
- the nodes A to E selected for the new route enter their own route table and select the route with the highest priority from among the multiple routes managed by one. And transmits the data to the corresponding nodes A to E, while the subsequent nodes A to E similarly transmit the data sequentially transmitted from the previous nodes A to E to the next hop nodes A to E. Transfer to E sequentially.
- FIG. 2 shows the hardware configuration of the communication function block 11 mounted on each of the nodes A to E and S.
- the communication function block 11 of each of the nodes A to E and S is composed of a CPU (Central Processing Unit) 12 and a ROM (Rad on Only) in which various programs are stored.
- Memory 13 RAM (R and om Access Memory) as work memory of CPU 12, 14
- Communication processing unit 1 that performs wireless communication with other nodes A to E and S 5 and the timer 16 are interconnected via the bus 17 '.
- the CPU 12 executes various processes as described above and below based on the program stored in the ROM 13 and, when necessary, various messages such as the route request message 20 or the route response message 23, and AV. dio Video)
- Various data of the data is transmitted to the other nodes A to E and S via the communication processing unit 15.
- the CPU 12 determines whether the other nodes A to E and S received via the communication processing unit 15 Based on the route request message 20, a route table 30 described later is created and stored in the RAMI 4, while the route to each of the nodes A to E and S registered in the route table 30 is stored. The life of the entry is managed based on the count value of timer 16.
- the route request message 20 loops, and the nodes A to E may receive the same route request message 20 many times.
- the conventional route request message 2 (FIG. 26) is extended to extend the field of the relay node list 21 as shown in FIG. (R e 1 ay No de Add ress #l to #n) 22 is provided, and nodes A to E, which relayed the route request message 20 ', sequentially expand this field 22 and add it to the expanded field 22.
- the self address is described in order.
- the nodes A to E check the route request message ID (RREQ ID), and have received a route request message with the same route request message ID in the past, and If the relay node list 21 has its own address, the route request message 20 is discarded.
- RREQ ID route request message ID
- each of the nodes A to E can appropriately create a plurality of routes to the node S.
- step SP 1 If the CPU 12 obtains a negative result in step SP 1, it proceeds to step SP 5, and if it obtains a positive result, it proceeds to step SP 2 and enters the relay node list 20 of the route request message 20. Judge whether or not your own address exists.
- step SP2 to obtain a positive result in step SP2 means that the nodes A to E have relayed the route request message 20 itself in the past, and thus the CPU then returns to step SP2. Proceeding to 3, the route request message 20 is discarded, and thereafter, the process proceeds to step SP9, where the route request message reception processing procedure RT1 is completed.
- step SP2 means that the Nos. KA to E relay the route request message 20 having the same route request message ID transmitted via another route in the past. However, this means that the route request message 20 itself has never been relayed, and thus, at this time, the CPU 12 proceeds to step SP4 and enters the relay node list 20 of the route request message 20. Add your own dress.
- step SP5 the route request message
- the entry of the reverse route of the route that has passed through 20 is newly inserted into its own route table 30 (FIG. 7) according to the route entry insertion procedure RT2 (FIG. 8) described later as a route to the node S.
- step SP 6 based on the destination of the "D estination Ad dres, s" of Fi one Noredo 3 6 the route request message 20 described in the route request message one di 20 Then, it is determined whether or not the route request message 20 is addressed to itself.
- the CPU 12 obtains a negative result in step SP 6, proceed to Sutetsu flop SP 7, the route request message 20 "Ho p C ount" in field 3 4 "1 has been the number of hops stored in After increasing the number, 'broadcast this route request message 20, and then proceed to step SP9 to end this route request message reception processing procedure RT1.
- step SP6 if the CPU 12 obtains a positive result in step SP6, it proceeds to step SP8, and the route response message 2 to the route request message 20 is sent.
- step SP8 of the route request message reception processing procedure RT1 the CPU 12 responds to the route request message 20 having the same route request message ID as the same ID (hereinafter, referred to as the Is referred to as a route response message ID (RREP ID).
- the route request message 20 having the same route request message ID as the same ID (hereinafter, referred to as the Is referred to as a route response message ID (RREP ID).
- the route response message is normally transmitted by a unicast so as to pass through the reverse route set at the time of transmitting the route request message.
- the route response message 23 is copied by the number of reverse routes and transmitted by multicast.
- the node D sends the route request message 2 which arrives via the first route RU1.
- 0 to node C as a response to
- node E as a response to the route request message 20 arriving via the second route RU 2
- node E as a response to the route request message 20 arriving via the third route RU3.
- the route response message 23 is transmitted by unicast, but at this time, the node E sets the reverse route twice with the destination of the node D as the destination ⁇ (Des: ination address).
- a similar situation occurs at node A and node S.
- the conventional route response message 6 (FIG. 28) is extended to “RREP ID field 24, and when node D receives route request message 20 and returns route response message 23, stores the same route response message ID as the route request message ID in the route request message in this field 21. It has been made to be. '
- the nodes A to C, E, and S that have received the route response message 23 have received the route response message 23 having the same route response message ID in the past, and the reverse route to the node S has already been stored in the route table 30. If the route response message 23 has been registered, the route response message 23 is discarded. Otherwise, the route to the node D that transmitted the route response message 23 according to the route entry insertion procedure RT2 described later with reference to FIG. Into its own routing table 30.
- the ad hoc network system 10 effectively prevents the multiplex setting of the reverse route to the node (node D) that transmitted the route response message 23, which may occur when a plurality of routes are created. Such redundancy is surely prevented. .
- each node A to E and S create a plurality of routes between the node S that is the data transmission source and the node D that is the transmission destination of the data at the start of data communication.
- Each of the nodes A to E and S manages the created route by using a route table 30 shown in FIG.
- the route list 32 has a feel 3 3 to 3 3 5 of the "Ho p C ount” Ne xt Ho p "L ife T i me” ⁇ Pi "L ink Qu a 1 ity", "Ho p C ount field 3 3 to the destination node A ⁇ E that put on the path of "the number of hops to S, the next hop in ⁇ e X t H op J Fi one Noredo 3 3 2 the path of, gamma an if e T i me "field 3 3 3 survival time of 3 to the route (next hop) of the quality of the path to the field 3 3 4" L ink Qu ali 'ty "is stored. And this route list 3 2 is stored in the Fi one Noredo 3 1 3 created each time a new route is found the corresponding route table 30 by "R oute L ist".
- route list 3 2 ": L ife T ime" field 3 3 3 whether survival by the described survival time of being managed, if survival time without corresponding path is used has passed
- the route list 32 is automatically deleted from the route table 30.
- each route list 3 2 is provided with a “NeXtList” field 3 3 5 — to the route with the next priority to the corresponding route and the corresponding route list. Pointa of is described in this field 3 3 5. As a result, when necessary, the route list 32 can be searched according to the priority based on the pointer. '
- the priority of the route is assigned in ascending order of the number of hops. It has been done.
- the CPU 12 of each of the nodes A to E and S executes the process of inserting a new route entry into the route table 30 as described above in accordance with the route entry insertion process RT2 shown in FIG.
- step 1 field 3 6 (Fig. 3) of route request message 20 (Fig. 3) or field 7 6 (Destination Ad dress) of route response message 23 It is determined whether or not the address (Destination Address) of the node S or the node D which is the source node of the route request message 20 or the route response message 23 described in 6) exists. .
- step SP11 Obtaining a negative result in this step SP11 means that the route to node S or node D is still registered in its own route table 30 at the nodes A to E and S.
- the CPU 12 proceeds to step SP12 and executes a normal route entry insertion process.
- “0 rlginator Ad dress” and “O riginator Sequence Number” of the route request message 20 or route response message 23 are respectively associated with “Destination Ad dress” or “Destination Sequence” of the route table.
- copy Rye one Noredo 5 had 5 2 Numb er ", the route request message 2 0 or path” Ho p C ount "the route table 30" M ini mum Ho p C ount of the response message 23 " ⁇ Pi" Copy each of the fields 3 1 and 3 1 2 of the Maximum Hop Coat J. +
- the CPU 12 copies the "hop count" of the route request message 20 or the route response message 23 to the "hop count” field 33 of the route list 32, and copies the route request message. 20 or the address of the adjacent nodes A to E and S that transmitted the route request message 20 included in the header of the bucket in which the route response message 23 is stored.
- the CPU 12 registers the route to the node S or the node D in its own route table 30 by the normal route entry processing in step SP12 in this way, and thereafter proceeds to step SP23. Then, the path entry insertion procedure RT2 is completed. .
- step SP 11 obtaining a positive result in step SP 11 means that the node S or the node that is the source of the route request message 20 or the route response message 23 This means that one or more routes to D have already been registered in its own route table 30, and at this time, the CPU 21 proceeds to step SP13 to search the route table 30. Accordingly, it is determined whether or not there is a corresponding route list 32 in which the adjacent nodes A to E and S that have transmitted the route request message 20 or the route response message 23 have “Next Hop”.
- step SP 13 If the CPU 12 obtains an affirmative result in step SP 13, it proceeds to step SP 21, and if it obtains a negative result, it proceeds to step SP 14, and the number of route lists becomes “D”. Judgment is made as to whether or not it is the maximum number that can be registered for “estination Ad dress”. If the CPU 12 obtains a negative result in step SP 14, it proceeds to step SP 16, and if it obtains a positive result for L, proceeds to step SP 15, corresponding to the “Destination Ad dress”. The oldest route list 32 (ie, the oldest route list after creation) is deleted from the route list 32 to be executed, and the process proceeds to step SP16. '
- step SP 1 6 ⁇ op C ount J field 3 4 of the route request message 20 or the route reply message 23 (FIG. 3), 7 4 number of hops is described in ( Figure 6) There determines greater or not than the corresponding route table 30 "M ai mum Ho p C ount" Finoredo 3 1 2 hop count described in the (maximum number of hops). If the CPU 12 obtains a negative result in step SP 16, the process proceeds to step SP 18. If a positive result is obtained, the process proceeds to step SP 17, and the CPU 12 proceeds to step SP 17.
- step SP 18 the CPU 12 sets the field 3 4 of the “hop count” of the route request message 20 or the route response message 23 (see FIG. The number of hops described in 3) and 7 4 (FIG. 6) is the number of hops (minimum hop number) described in the field 31 of the corresponding “Minimum Hop Count” in the routing table 30. Judge whether it is smaller than. If the CPU 12 obtains a negative result in step SP 18, it proceeds to step SP 20. If it obtains a positive result, it proceeds to step SP 19, and proceeds to step SP 19, where mum Ho p C ount J the number of hops is described in Finoredo 3 1, "Ho p C ount" field 3 4 of the route request message 20 or the route reply message 23 (FIG. 3), 7 4 ( After rewriting the number of hops described in Fig. 6), proceed to step SP20. '
- step SP20 the CPU 12 creates a route list 32 corresponding to the route in the same manner as described above for step SP12, and stores the route list 32 in the route table 30 in the corresponding “R oute List”. Register in field 3 1 3 Also, at this time, the CPU 12 determines the priority of the route list 32 of the same “Destination Address” based on the “Hop Count” of each route list 32, and accordingly, the corresponding route is determined. field 3 3 5 of "N ext L ist" in list 3 2 rewrites as necessary Pointa to the path list 32 corresponding to the path with the next priority.
- step SP 21 updates “: Lifetime” of the newly inserted route list 32 in step SP 20, and then proceeds to step SP 22 to update the route list 32.
- the “Link Quality” is updated according to the quality of the corresponding route detected at that time, and the process further proceeds to step SP23 to terminate the route entry input procedure RT2.
- each of the nodes A to E and S can manage a new route in its own route table 30.
- the node S receives the route response messages 23 for the number of routes set at this time, but the route that the route response message 23 received first has not necessarily had the number of hops. It is not always a low quality route. Therefore, in this ad hoc network system 10, a predetermined time elapses or a predetermined time has elapsed since the first route response message 23 was received after receiving the first route response message 23, which is the source of the route request message 20. Wait for the specified number of route response messages 23 to be received, select the route with the smallest number of hops from among the routes that each received route response message 23 has passed, and route through each route The communication with the node D to which the request message 23 is transmitted is started.
- the node S determines whether the route response message 23 arrived at that time was transmitted from the same node D at the same time. This makes it possible to prevent the wrong route from being selected.
- step SP31 it is determined whether or not a predetermined time has elapsed after receiving the first route response message 23.
- step SP31 When the CPU 12 obtains a negative result in step SP31, it proceeds to step S.P32 and determines whether or not a new route response message 23 has been received. If a negative result is obtained, the process returns to step SP31.
- step SP32 the CPU 12 Proceeding to SP33, it is determined whether or not a predetermined number of route response messages 23 including the route response message 23 received first are received.
- step SP33 If the CPU 12 obtains a negative result in step SP33, it returns to step SP31, and thereafter, returns to step SP31 or SP32 until it obtains a positive result in step SP31 or step SP33.
- SP 33 Repeat the SP 31 loop.
- step S ⁇ 33 the process proceeds to step S ⁇ ⁇ 34 to terminate the route response message reception processing means RT3, and thereafter, is registered in the corresponding “Route List” in the route table 30. It starts transmitting data to the nodes A and B, whose addresses are registered in the “Next Hop” field 33 2 (FIG. 7) of the highest priority route list 32 that has been registered.
- the nodes A to E to which the data has been transmitted search their own routing tables 30 and check the transmission destination node of the data.
- the “Ne xt Hop” field in the route list 32 of the route with the highest priority from the route list 32 corresponding to the route entry (that is, the node D) is detected. 3.
- the data is tuned to nodes A to E registered in 3 2 (FIG. 7).
- the node A transmits the node D to the destination (Destination).
- the node list B has a node list “N ext Hop” and a node list B has a route list 32 “N ext Hop”.
- the route list 32 with node C as “Ne xt Hop” has a smaller number of hops, so the priority is set higher. Therefore, node A receives the data sent from node S Is forwarded to node c by unicast.
- node C uses a route list that sets node D as “Next Hop J” and a route list that sets node E as “Next Hop J” as a route list 32 to which node D is a destination.
- the route list 32 in which the node D is set to “Next Hop” has a smaller number of hops, and thus has a higher priority. Therefore, the node C transfers the data transmitted from the node A to the node D by a unicast.
- the node S sets the route list 32 to the node D as the transmission destination, the route list 32 to the node A as “Next Hop J”, and the node B to the The path list 32 has the same “: Hop Counter” in each of the path lists 32.
- the node S determines the number of hops of the path.
- the optimal route is selected in consideration of predetermined factors other than the above (for example, link quality).
- the transmitting nodes A to C, E, and Between S based on the route table 30 owned by itself, it is used up to that time from among several route lists 32 included in the entry where the destination of the data D is “Destination Address”.
- the node A when a communication failure occurs between the node A and the node C, the node A passes through the node B to which the next priority is added to the route passing through the node C. Is selected, and the data is transferred to the node B described in “Ne xt Hop” of the route list 32.
- each no The CPUs 12 of the nodes A to C, E, and S start data transmission or, when data is transmitted, start this communication processing procedure RT4 in step SP40, and in the following step SP41.
- Yunikiyasuto to "Ne xt Ho p J field 3 3 2 described node A ⁇ E (FIG. 7) of this data has been transmitted in the route list 3 2 highest path priority.
- step SP42 a communication failure occurs between any of the nodes A to E at! / Based on the radio wave condition between the nodes A to ⁇ of the communication partner. Is determined.
- step SP42 If the CPU 12 obtains a negative result in step SP42, it proceeds to step SP43, and transmits data according to the transmission state of data transmitted from the previous nodes A to C, E, and S. It determines whether the communication between the source (Node S) and the destination (Node D) has been completed.
- step SP43 If the CPU 12 obtains a negative result in step SP43, it returns to step SP41, and thereafter returns to step SP41 or SP42—SP43—SP4 1 until it obtains a positive result in step SP42 or step SP43.
- the CPU 12 proceeds to step SP44, and reads “Next List” in the route list 32 used up to that time. Using the pointer stored in the field 3 3 5 (FIG. 7) as a clue, the route list 32 of the route having the next priority is searched, and the route list 32 to be used is switched to the route list 32. After that, return to step SP41.
- the CPU 12 obtains a negative result in step SP43, it returns to step SP41, and thereafter returns to step SP41 or SP42—SP43—SP4 1 until it obtains a positive result in step SP42 or step SP43.
- the CPU 12 finally obtains an affirmative result in step SP42, it proceeds to step SP44, and reads “Next List” in the route list 32 used up to that time. Using the pointer
- step SP43 when the CPU 12 obtains a positive result in step SP43, it proceeds to step SP45 and ends the communication processing procedure RT4.
- the route request message 20 (FIG. 3) relays the route request message 2 (FIG. 26) based on the relay node list 21 provided by extending the conventional route request message 2 (FIG. 26). Multiple routes are created at each of the nodes A to E and S while preventing loops between the nodes A to C and E.
- the route to be used is left to the relay nodes A to C and E that hold the route, and the source of the route request message 20 is determined.
- Node S cannot select a route.
- all data packets transmitted from the same source node S will pass through the same route, so the data attributes (text data, command data, AV data Etc.) It is difficult to efficiently use multiple routes, such as using different routes for each route, or freely changing routes based on link quality that changes with time.
- the node S which is the data transmission source, transmits the data to the node D, which is the data transmission destination.
- the node S While transmitting a packet storing a request for a route to be used as a communication route (hereinafter referred to as a “route activation packet”), each of the nodes A to E receiving the packet transmits the packet from among the created routes.
- a route to be used is set or various settings are made for the route.
- each of the nodes A to E and S creates data from a plurality of routes created respectively. It is possible to selectively use the optimal route according to the request of the source node S.
- FIG. 12 shows the configuration of such a route activation bucket 40.
- the route activation packet 40 has fixed “Type”, “Flag”, “Reserve”, “HopCount”, “Message ID”, “Destination Ad d ress "and” O riginator Ad dress and Fi one Noredo 4 1-4 1-7 "variable” R euired L ink Qu ality "F l ow to be added or removed on demand Ru against the use path ' ID "L Ifetime” and Fi one Noredo 4 1 8-41 and a force that consists of a "R equir eme nts".
- the finale 41 of the ⁇ ype J of the route activation bucket 40 indicates that the bucket is a route activation bucket (RACT) or a route activation response bucket (RAC T- ACK) is stored.
- RACT route activation bucket
- RAC T- ACK route activation response bucket
- the route activation packet 40 is transmitted from the source of the data to the destination, and in principle, a response packet to the route activation, which is a response to the packet, is transmitted from the destination of the data to the source as described later.
- a route can be set in only one direction. 'By using the route activation bucket, 40, it is possible to freely switch between multiple routes created at the start of communication, even during communication. In other words, since the route can be changed even when communication has already started, it can be applied to the case where a node moves in an ad hoc network.
- More Fi one Noredo 41 6 "D estination A ddress J routes Akuti base Activation packet 40, the address of the destination node of the path Akuti base Activation packet 40 is stored," O riginator Ad dr “ess” stores the address of the node that transmitted the route activation packet 40.
- the field of “L ifeti me” in the route activation bucket 40 Stores the lifetime to be set for that route, and is used to extend the lifetime of routes that are inconvenient and are about to be erased.
- the "R equir eme nts" field 4 1 lt is used to describe the free requirements for the route.
- the value of this route request parameter may be set in accordance with the request of the application desiring data transmission at the data transmission source node or in the route activation bucket 40 This is set based on the data transmission state, such as when the retransmission frequency is high or when the bucket loss rate during transmission is high.
- the path quality is defined as a value that abstracts the radio wave condition, error rate, and the like. In other words, when the numerical value is high, it is assumed that the route has good quality and the error rate is low.
- Node S the source of the data, first determines the request for the route
- the environment where satisfactory communication can be performed based on statistical information is investigated in advance, and for complex information such as flow ID, an interface with the application that accepts requests from the application is accepted.
- the request is obtained by preparing the source.
- the node S “R equired Link Qua” in the route activation bucket 40. 1 stores the numerical value of "50" in the field 4 1 5 ity "," stores the Adoresu node D is Fi one Noredo 4 1 6 stator destination of D estination Ad dress "Furthermore,” A route activation packet 40 is generated and transmitted by storing its own address in the fields 4 17 of “0 riginator Ad dress”.
- the other nodes A ⁇ E having received this route Akuti base Activation bucket DOO 40 is a no.
- De to Finoredo 4 1 6 to the address is stored in the destination ( "D estination Ad dress", node D where ) Is checked in its own route table 30 (Fig. 7), and if it does not exist, a route activation error is reported as the source of the route activation bucket 40.
- the nodes A to E search the route list 32. (FIG. 7) to the destination, and determine the route quality (“Link Quint”). quality)) of the route activation packet 40 “R equired Link Quality” 4 1 c Check whether there is a route that exceeds the threshold value (“5 0”) stored in. If the nodes do not exist, the nodes A to E transmit a path activation error to the node S. This route activation error can be substituted by, for example, an ICMP message in the IP layer.
- Node A ⁇ E contrast, if the path having a quality exceeding such threshold also present one, described in field 3 2 2 "N ext H op" route list 3 2 of the route Nodes A to E are set as normal routes when data is transmitted from node S to node D.
- the node D performs the above-described route activation, and then executes the “Type” of the route activation packet 40. ), Change the code stored in the field 41 to the code of the route activation response bucket, and change the code to “Destina”. Change the tion Ad dress Adoresu stored in the field 4 1 6 "to Adoresu node S which is the source of the route ⁇ Tati base Activation bucket DOO 40, or One" O riginator Ad dress] rated in Fi one Noredo 41 7 A route activation response packet 50 is generated by changing the address in the thread to its own address, and the packet is forwarded to the next hop nodes C and E of the activated route. .
- each of the nodes A to C and E performs the activating process of the route to the node D while performing the node S. Are sequentially transmitted to the nodes, and the route activation is completed when the node S receives the route activation response bucket 50. Then, each of the nodes A to E is connected to the node S and the node D.
- communication between devices when data with a flow ID stored in the route activation bucket 40 is transmitted, data is transmitted and received using the route set at this time as a communication route.
- the data transmission source node responds to application requests and the like. To set up a switching path.
- the node S after transmitting the route activation packet 40, the node S cannot receive the route activation response packet 50 from the node D within a predetermined time or receives a route activation error on the way.
- the route activation bucket 40 is retransmitted sequentially while resetting the route request parameters so that the conditions are gradually relaxed until the route activation is performed. Therefore, as shown in this example, the route quality is “50” or more.
- the route quality is “50” or more.
- the nodes A to E which have received the route factor bucket 40, set routes satisfying all the requests stored in the route factor bucket 40 as a communication route between the node S and the node D. And updates the lifetime of the route and associates the flow ID with the route. After that, when transmitting data from node S to node D, the data is sequentially transferred using this route. .
- the data transmission source sets a route of an application request or a desired route quality as a used route, updates the lifetime of the route, or updates the flow ID. This makes it possible to perform detailed route setting, route maintenance, and the like according to data attributes. .
- the CPU 12 receives the request from the user or the activating request for the route specified according to the transmission state of the data packet, and then receives the route request from the node S.
- the activation bucket transmission processing procedure RT5 is started in step SP50, and in the following step SP51, after the path activation packet 40 corresponding to the request under the activation is transmitted, the process proceeds to step SP52. Then, the timer 16 (FIG. 2) is activated based on the transmission.
- step SP53 determines whether or not a predetermined type of circuit activation error has been received. If the CPU 12 obtains an affirmative result in step SP53, it proceeds to step SP54, and determines whether or not the route activation response bucket 50 has been received.
- step SP54 obtaining a positive result in this step SP54 means that the node S has received the route activation reply packet 50, and the route activating in both directions has been successful, and this At this time, the CPU 12 proceeds to step SP55 to start data transmission processing via the activated path, and then proceeds to step SP56 to end this path activation bucket transmission processing procedure RT5. .
- step SP54 means that 'the route activation response bucket 50 has not been received yet, and at this time, the CPU 12 proceeds to step SP57 and sets the preset value. It determines whether or not the time-out period has expired based on the count value of timer 16 (Fig. 2).
- step SP57 If an affirmative result is obtained in step SP57, this means that a time-out has occurred. At this time, the CPU 12 proceeds to step SP58, performs retransmission processing of the route activation bucket 40, and Proceed to step SP59, reset the route request parameters as necessary, and then repeat step S59. Returning to P52, the same processing is repeated thereafter.
- step SP57 means that the time-out has not yet been reached, and at this time, the CPU 12 returns to step SP53, and sequentially proceeds from the determination of the reception of the path activation error in the same manner. Is repeated. If the CPU 12 determines in step SP53 described above that a positive result has been received, that is, that a route activation error has been received, the process proceeds to step SP58, in which retransmission processing of the transaction activation packet 40 is performed. Do.
- the CPU 12 of the node S which is the transmission source of the route activation bucket 40, activates the route to the other nodes A to E according to the user's request or the like.
- the CPUs 12 of the nodes A to E which have received the route activating bucket 40 execute the activating of the route according to the route activating bucket receiving processing procedure RT6 shown in FIG.
- the CPUs 12 of the nodes A to E start the path activating bucket receiving processing procedure RT6 in step SP60, and then proceed to step SP61.
- the destination of this route Akuti base Activation bucket preparative 40 in its route table 30 (FIG. 7) It is determined whether there is a route entry to reach.
- step SP61 If the CPU 12 obtains an affirmative result in step SP61, it proceeds to step SP62, and the next hop matching the route request parameter is included in each route list 32 included in the route entry. It is determined whether or not exists. That is, the CPU 12 determines whether or not there is a route that satisfies all the conditions such as the route quality defined as the route request parameter among the routes to the destination of the route activation bucket 40.
- step SP62 Obtaining a positive result in step SP62 means that the route request parameter and the Means that there is a route that satisfies the conditions specified in step SP6.
- the CPU 12 proceeds to step SP63, sets this next hop (route) as a regular route, and after the necessary settings, such as survival time for, followed by proceeding to Sutetsu flop SP 6 4, the route activation packet 4 0 to "H op C ount" field 4 1 hop count stored in the fourth "1".
- step SP 6 the path Akuti base Sho N'no, "based on the socket 4 0" D estinati- on A ddress "on Fi one Noredo 4 1 6 stored in Adoresu
- step SP66 the 'route activation bucket 40' for the route activation bucket 40 is determined.
- step SP67 the process proceeds to step SP67 to terminate the route activation packet reception processing procedure RT6.
- step SP65 if the CPU 12 obtains a negative result in step SP65, it proceeds to step SP68, in which the nodes A to E of the route activating the route activation bucket 50 are determined. After the transmission (unicast), the process goes to step SP67 to end the route activation bucket reception processing procedure RT6. '
- step SP61 obtaining a negative result in step SP61 described above means that the own route table 30 (Fig. 7) has a route entry to the destination node (node D) of this route activation packet 40.
- the CPU 12 proceeds to step SP69, and after transmitting the path activation error to the node S that is the transmission source of the path activation bucket 40, Proceeding to step SP67, this route activation packet reception processing procedure RT6 is ended. .
- step SP 62 obtaining a negative result in step SP 62 described above means that the route activation bucket 40 registered in the own route table 30 is addressed. This means that there is no next hop (route) satisfying the conditions specified as the route request parameter in the route list 30 included in the route entry to the destination node (node D). Proceeds to step SP69, transmits a path activation error to node S, which is the transmission source of this route activation bucket 4,0, and then proceeds to step SP67 to execute this route Function packet reception processing procedure RT 6 ends.
- route next hop
- the CPU 12 of each of the nodes A to E that has received the route activation bucket 40 in this way activates a route corresponding to the route request parameter included in the route activation bucket 40.
- a plurality of routes are set in each of the nodes A to E and S at the time of starting data communication, and priorities are assigned to the plurality of routes. Communication is performed using the route with the highest priority.
- this ad hoc network system 10 when transmitting / receiving real-time stream data, for example, VoIP or moving image, even if a communication failure occurs between nodes A to E and S, another route is quickly established. And stable communication can be performed.
- real-time stream data for example, VoIP or moving image
- a plurality of routes are set at each of the nodes A to E and S at the start of data communication, and priorities are assigned to the plurality of routes.
- the route having the highest priority among the routes is set. In this case, even if a communication failure occurs between nodes A to E and S, it is possible to quickly switch to another path and perform stable communication, thus ensuring reliability.
- a high ad hoc network system can be realized.
- the node S as a data transmission source sets a route according to an application request or the like.
- Stored request parameters Send a route activation bucket 40.
- each of the nodes A to E receiving the route activation bucket 40 sets a route satisfying the condition as a communication route based on the route request parameters included in the route activation bucket 40. Make the necessary settings for the route.
- this ad hoc network system 10 at the time of starting data communication, from among the plurality of routes created in each of the nodes A to E and S, the request of the data transmission source, the attribute of the data bucket, etc.
- the route can be set freely according to the need, and the optimal route can be made accordingly.
- the node S after setting a plurality of routes in each of the nodes A to E and S at the start of data communication, stores a route request parameter corresponding to an application request or the like.
- the nodes A to E that have transmitted the route activation bucket 40 and set the route satisfying the condition as a communication route based on the route request parameter included in the route activation bucket 40.
- the present invention is applied to the ad hoc network 10 of the AODV protocol and the nodes A to E and S constituting the same.
- the first message and the first message are composed of a plurality of communication terminals, transmitted from the first communication terminal, and transmitted to the third communication terminal via the second communication terminal.
- the first to third communication terminals A route to each of the first and third communication terminals is created, and the communication system that communicates between the first and third communication terminals via the created route and a communication terminal device that constitutes the communication system are widely used. Can be applied.
- the route request message 20 (FIG. 3) and the route response message 23 (FIG. 6) are received in duplicate to create a plurality of routes to the transmission source.
- Each of the nodes A to E having a function of a creation unit, a route management unit for storing and managing the created plurality of routes, and a communication unit for communicating with the other nodes A to E and S.
- the communication function block 11 of S is configured as shown in FIG. 2 has been described, the present invention is not limited to this, and various other configurations can be widely applied.
- the number of hops is applied as a criterion for setting the priority, and a higher priority is set for a route having a smaller number of hops.
- the quality of the route may be used as a criterion.
- various criteria may be widely applied according to the purpose of use, such as, for example, judging the number of hops and the quality of the route in a complex manner. be able to.
- priorities are set for the routes based on items other than the number of hops.
- the priority in each of the nodes A to E and S refer to “Minimum Hop C” in the routing table 30 (FIG. 7). ount "and the fields 3 1 had three 1 second" M aimum H op C ount ", it may be to store the minimum and maximum values of the reference of each path is created.
- the priority of the route is fixedly set according to the number of hops of the route.
- the priority may be dynamically changed based on the quality of the route such as the bucket error rate, and the priority of each route may be reset accordingly.
- the nodes A to E and S are configured to list and manage entries of a plurality of created routes, but the present invention is not limited to this.
- the entries of these multiple paths may be tabulated and managed integrally.
- the entry of each route list 32 includes the number of hops of the route, the next hop, the time to live, the quality of the route, and the pointer to the next route list.
- the present invention is not limited to this, and information other than these may be stored as information relating to the route in addition to or instead of this.
- the format shown in FIG. 3 is applied as the route request message 20, and each of the nodes A to C and E that relayed the route request message 20 becomes the relay node list 21.
- the present invention is not limited to this, and the format of the route request message 2 is as follows. Any other format may be used, and each of the A to C and E relaying the route request message 20 may describe some identification information other than its own address that can identify itself in the network system. good.
- the format as shown in FIG. 6 is applied as the route response message 23, and the address of the transmission source node is described in the field 24 of “RREPID” of the route response message 23.
- the present invention is not limited to this, and the format of the route response message 23 may be any other format, and the source of the route response message 23 may be “RREPIDJ field 24”. Any identification information that can identify itself in the network system other than its own address may be described.
- the path activation where the node S that is the data transmission source stores a request for a path used for communication with the node D that is the transmission destination of the data is stored.
- the bucket 40 and the route activation response bucket 50, which is the response of the node D to the bucket 40, have been described as having a format as shown in FIG. 12, but the present invention is not limited to this. Various other formats can be widely applied.
- the route activation bucket 40 is used.
- the route request parameters to be stored include the route quality, the flow ID to be set for the route, the lifetime to be set for the route, and the case where a request from an application or the like is applied. Not limited to this, various other conditions and items to be set for the route can be applied.
- the node when the own node is a data transmission source, the node functions as a route request transmitting unit that transmits a route request (route request parameter) that is a request for a route such as a route quality.
- route request parameter a route request for a route such as a route quality.
- the source and destination of the data are received by receiving the route request message 20 as the first message and the route response message 23 as the second message in duplicate.
- Route creation means for creating a plurality of routes to each of the nodes, and a route setting means for setting a route satisfying the route request transmitted from the node S as a communication route between the nodes S and D among the plurality of routes.
- the own node If the own node is the destination node of the data, it receives the route activation bucket 40 and responds to it when it receives the route activation bucket 40.
- the communication function block 11 of each of the nodes A to E and S functioning as a response transmission means for transmitting the route activation response bucket 50 is configured as shown in FIG. The present invention is not limited to this, and various other configurations can be widely applied.
- the present invention is not limited to this.
- the present invention may be used. That is, in general, routes in an ad hoc network are often automatically deleted if they are not used for a long time, and even if multiple routes can be set by the routing protocol, they disappear from the route table without being used. Many routes exist. This problem can be solved by periodically activating the route and updating the lifetime of the route. '
- the desired lifetime to be newly set is stored in the field 41 1 ⁇ 0 of the “Lifetime” of the route activation bucket 40, and the route activation bucket described above with reference to FIG. 13 is stored.
- the nodes A to E and S may perform processing in accordance with the transmission processing procedure RT5 and the path activation bucket reception processing procedure RT6 described above with reference to FIG.
- the route activation packet 40 is not transmitted by multicast to the destination node, but is transmitted by multicast to the nodes ⁇ to ⁇ and S of each route in which the route list 32 is registered.
- the destination node only has to respond to the first route activation bucket 40 received. Updating the lifetime of a route regularly in this way makes it possible to use multiple routes effectively.
- the route activation bucket 40 may be used for collecting statistical information of the route. For example, a field for storing the total route quality value is prepared in the route activation packet 40 or the route activation response packet 50, and each node hops through each of the nodes A to C and E. The route quality value is added. Thus, by dividing the total value by the number of hops at the node S that is the source of the route activation packet 40, the average value of the route quality between the nodes at that time can be obtained. Then, the node S may use this average value when multiple routes are opened.
- the present invention is not limited to this, and the present invention is not limited thereto. It can also be applied when bidirectional communication is performed between node S and node D.
- the CPU 12 of each of the nodes A to E and S communicates with the communication route from the node S to the node D and the node D.
- the communication path from the node to the node S may be set separately so that communication can be performed efficiently between the node S and the node D.
- the nodes A to C, E, and S which have received the route activation response bucket 50, have already determined in their own route table 30 the route to the destination node S—. It is checked whether or not normalization (setting) has been performed, and if so, another route may be selected as the route to the source node D.
- reference numeral 60 denotes an ad hoc network system according to the present embodiment, and the ad hoc network system described above with reference to FIG. 25 except that an alternative route is found and established before the route is disconnected.
- the ad hoc network system 60 becomes a transmission source of transmission data such as AV (Audio Video) by the route discovery process described above with reference to FIG. 25.
- AV Audio Video
- a communication path (indicated by a bold line in the figure) that sequentially passes through the nodes A and C is established. Then, the node S transfers the data packet to the node D via the sequential communication path as a transmission data data packet.
- the nodes A to C and E intervening on the communication route are connected to the other upstream nodes S and A to E (for example, if the node A is a node B, Path of communication between C and C) It has been made to detect.
- the node A when the node A detects the state before the disconnection on the route to the node B on the upstream side, the node A transmits a control message for notifying the state before the disconnection (hereinafter referred to as a link). LM is generated and this is broadcast to node S.
- the node S determines whether or not to change the current communication route to the alternative route based on the link state notification message LM broadcast from the node A.
- the node S If the node S decides to change to the alternative route, the node S transmits a control message for controlling to set a route that is in a better state than the disconnection state (hereinafter referred to as an extended route request message). ) Is generated.
- This extended route request message is constructed by extending the above field of the route request message 2 (FIG. 26) with a field indicating the state before the disconnection.
- the node S starts the route discovery process by broadcasting the extended route request message.
- each of the nodes A to C and E receiving the extended route request message inserts the route entry of the reverse route into the route table 4 (FIG. 27) (entry insertion processing). Then, it is determined whether the communication state of the route with the node that has broadcast the extended route request message is better than the contact state before disconnection.
- Each of the nodes A to C and E discards the extended route request message if the judgment result is not good, and if it is good, the same as in the conventional case. Then, the route entry is inserted into the route table 4 (Fig. 27) and the broadcast is performed if the extended route request message is not addressed to itself.
- a route response message 6 (FIG. 28) same as the conventional one described above with reference to FIG. 25 (C) is generated.
- the route response message 6 is sequentially unicast to the node S via the nodes E and B, for example, by the same processing as described above with reference to FIG.
- the node S When the node S receives the route response message, the node S changes the data packet transferred to the node A to the node B at this time. As a result, the transfer route of the data packet is changed from the communication route (S-A-C-D) to the alternative route (S-B) before the route (A-C) in the contact state before disconnection is disconnected. — E— D) In this way, in the ad hoc network system 60, it is possible to switch to the alternative route before the route between the nodes A and C intervening on the communication route is disconnected. It has been made possible.
- the CPU 12 of node A (Fig. 2) first disconnects the path to node C.
- the state before touching is detected, and as the state before touching, the radio wave intensity of the antenna ANT (FIG. 2) connected to the communication processing unit 15 (FIG. 4) is set to a first threshold value (hereinafter, referred to as “the threshold”). This is called an intensity threshold.)
- the threshold This is called an intensity threshold.
- This intensity threshold is set in advance in consideration of the relationship between the limit at which data packets can be communicated and the time required to switch from the communication route to the alternative route.
- [V / m] is set, for example, it is set to 23 [V / m].
- the CPU 12 measures the radio wave intensity of the antenna ANT at a predetermined cycle.For example, every time a data packet is transferred to the node C, the measurement result of the antenna ANT at the time of receiving the data packet is received. (Radio wave intensity value) and the intensity threshold. Then, when the radio field intensity value is equal to or lower than the intensity threshold, the CPU 12 detects the radio field intensity value as a touch state before disconnection.
- the CPU 12 sets the number of data packet retransmission requests to the number of data packet retransmission requests (hereinafter referred to as the packet error rate) as a second threshold value (hereinafter, referred to as a packet error rate) as a touch state before disconnection. This is referred to as an error threshold.)
- the packet error rate the number of data packet retransmission requests
- a packet error rate a second threshold value
- an error threshold This is referred to as an error threshold.
- This error threshold is set in advance in consideration of the relationship between the limit of data packet communication and the time required for switching from the communication route to the alternative route, like the strength threshold, and is set to, for example, 15 ⁇ . You.
- the CPU 12 counts the number of data packets transferred to the node B and the number of times the data packet is requested to be retransmitted from the node B, and measures a bucket error rate based on the count. It has been made to be.
- the CPU 12 compares the bucket error rate at the time of receiving the packet with the error threshold, and the packet error rate is equal to or larger than the Erani threshold. In this case, the bucket error rate is detected as a touch state before cutting.
- the CPU 12 sets the touched state before disconnection to the power level below the intensity threshold.
- a link state notification message LM shown in FIG. 19 is generated based on the detection result.
- the link status notification message LM includes “Message ID”, “ ⁇ riginator Ad dress”, “Source Ad dress”, iL »destination Ad dres s_
- the CPU 12 sends such a link state notification message LM to the node S.
- the node S is notified via the link state notification message LM of which node is in a state of disconnection and how much.
- the CPU 12 limits the number of times the link state notification message LM is transmitted in a unit time (hereinafter referred to as a message notification period) based on the timer 16. I have. ⁇
- the state notification unit 21 sets the communication state in the path between the node S and the node A as the communication state of the data packet due to the increase in the occupancy of the link state notification message LM. It is possible to avoid the situation that the transfer is prevented.
- the CPU 12 can notify the node S of a touch state before disconnection (a radio field intensity value equal to or less than the intensity threshold value or a packet error rate equal to or more than the error threshold value) by executing the status notification process. It has been made.
- the CPU 12 receives the data packet transferred from the node S, starts the state notification processing procedure RT 7 in step SP 70, and transfers it to the upstream node B on the communication path in step SP 71. To do. '
- step SP72 the CPU 12 determines whether or not the radio field intensity value of the antenna ANT is equal to or less than the intensity threshold value, and in subsequent step SP73, determines whether or not the bucket error rate is equal to or greater than the error threshold value. judge.
- step SP72 and step SP73 if a negative result is obtained in any of step SP72 and step SP73, this means that the communication state is not a contact state before disconnection but a good communication state.
- the process moves to step SP80 and ends the status notification processing procedure RT7.
- step SP74 of the message notification period determines whether a message notification period is reached. If a negative result is obtained, a timer for the message notification period is set in step SP75.
- the CPU 12 increases the message ID (Message ID (Fig. 19)) by “1” in step SP76, and then in step SP77, the radio wave intensity value below the intensity threshold or the error threshold corresponding bucket bets error rate "L ink Q uality" Finoredo 7 0 5 (Fig. 1 9), respectively stored in the "R oute S tatus" field 7 0 7 (Fig. 1 9), the next step SP 7 Route table 4 in 8 (FIG. 2 7) 1-2 each remaining field 70 based on such 70 4, 70 6, 70 8 (Fig. 1 9) the corresponding content link state notification by storing each message LM ( (FIG. 19) is generated, and this is tuned to the node S in step SP79. Then, the process proceeds to the next step SP80, and the status notification processing procedure RT7 is completed.
- the radio wave intensity value below the intensity threshold or the error threshold corresponding bucket bets error rate "L ink Q uality" Finoredo 7 0 5 (Fig. 1 9), respectively stored in the "
- step SP74 determines in step SP81 whether the number of transmissions exceeds a predetermined number of transmissions.
- the CPU 12 performs the processing of the above-described steps SP 76 to SP 79 and broadcasts the link state notification message LM to the node S.
- the process moves to SP80 and ends the status notification processing procedure RT7. In this way, the CPU 12 can execute the status notification processing according to the status notification processing procedure RT7.
- the other nodes B, C, and E also perform the status notification process according to the status notification process procedure RT1 in the same manner as the node A. It has been done.
- the upstream paths are not in a state of being touched before disconnection, so the above-described steps SP 70—SP 71—SP 72—SP 73 — Perform the SP 80 loop processing.
- a communication path in a better link state than the touch state before disconnection (a radio field intensity value equal to or lower than the intensity threshold value or a bucket error rate equal to or higher than the error threshold value) is set.
- the route reset request processing of the controlling node S will be described.
- the link state table 71 indicates the node that transmitted the link state notification message LM.
- Each node represents the state before the disconnection of the route on the upstream side of the node for each node, such as “Destination Ad dress”, “O riginator Ad dress”, “Message ID”, “Count”; "L ink Qu ality”, “P acket E rror R ate”, composed of "R oute S tat ir s" and other fields 72-72 8.
- the "C ount" in the field 72 4 are adapted to receive the number of the link state notification message LM is set, after a lapse of the unit time from the point when "1" is set as the initial value, again the initial value Is set to "1".
- C 0 unt field 72 4 link state per unit time is notified to the message LM reception number (hereinafter referred to as the unit time received 'count) is stored.
- the number of receptions per unit time is set to an appropriate value in consideration of the fact that the number of transmissions of the link state notification message LM transmitted in the message notification period at the node A (nodes B to D) is limited. You.
- CPU 1 2 based on the Ru b included in the link state notification message LM received from node A "D estination Ad dress ⁇ Finoredo 70 4 (Fig. 1 9), is a self-addressed link state notification message LM If it is not addressed to itself, the address of the source (node A) of the message stored in the “O riginator Ad dress” field 70 2 (Fig. 19) is stored in the link state table 7 It is determined whether it exists in 1 or not.
- the CPU 12 sends the source address (O-riginator Ad dress) of the link state notification message LM (FIG. 19) received at this time, and the message LM
- the unique ID (Mess' age ID), radio field intensity value (Link Quality), bucket error rate (Packet Error Rate), the presence / absence of the route used (Route Status), etc. It is added to each field 72 ⁇ ⁇ 2 8 corresponding link state table 71 as a new record.
- the CPU 12 sends the “Count” file added as a new record.
- the CPU 12 determines “Link Quality” and “Link Quality” corresponding to the address of the node A in the link state table 71.
- “P acket E rror R ate” because the fields 72 5, 72 6 the value located in the link state notification message sage LM “L ink Qu ality” and fields of "P acket E rror R ate” 70 5, 70 6 and updates the averaged statistical values as have been set value (Fig. 1 9), "1" corresponding to "C ount” field 72 4 to ⁇ Soca ⁇ .
- CPU 1 2 is a single-position time reception count increases this time "C ount” field 72 4 has exceeded a predetermined number, and, corresponding to the "C ount” field 7 2 4 "R oute S If the tatus "field 72 7 represents a communication path used it is determined that it is necessary to perform route re-establishment request.
- the C PU 1 2, each Finoredo 72 5, 7 2 6 has been set to the value (field intensity of this when the link state table 71 of the ⁇ L ink Qu a 1 ity "and” P acket E rror R ate " Value or packet error rate) is determined as the route requirement.
- the CPU 12 generates the extended route request message 73 shown in FIG. 22 based on the route requirement and the route table 4 (FIG. 27).
- the CPU 12 broadcasts such an extended route request message 73.
- a route having a radio field intensity value larger than the radio field intensity value of this message and a route having a bucket error rate smaller than the bucket error rate of this message are respectively set.
- the node sets the route as a reverse route and sets an alternative route.
- the CPU 12 measures the number of times the link state notification message LM is notified per unit time, and broadcasts the extended route request message 73 only when the measurement result exceeds a predetermined number. However, it is possible to avoid switching to the alternative route until the touch state before disconnection returns immediately.
- the CPU 12 also sends an extended route request message 7 that sets a route that is in a better state than the statistical result (average value) of each touched state (radio wave condition, packet error rate) for the number of notifications.
- Broadcast 3 to avoid setting an alternative route that is greater than or equal to the contact state before disconnection due to extreme radio wave conditions and bucket error rates, and set an alternative route with the best possible status It has been made possible.
- the CPU 12 executes the route reconfiguration request processing, so that the link state better than the state before the disconnection (the radio wave intensity value below the intensity threshold or the bucket error rate above the error threshold) is obtained. It can be controlled to set a certain communication path.
- step SP90 when recognizing that the communication route has been established through, for example, the route discovery process, the CPU 12 starts the route reset request processing procedure RT8 from step SP90, and then proceeds to step SP91 in step SP91.
- A) Link status notification message LM is received.
- step 1 add a new record or update the radio field intensity value (Link Quality), packet error rate (Packet Error Rate), and the number of receptions per unit time (Count) of the record that has already been added.
- Link Quality radio field intensity value
- Packet Error Rate packet error rate
- Counter number of receptions per unit time
- step SP93 the CPU 12 determines whether or not the unit time reception count (Count) updated (or added) in step SP92 is equal to or more than a predetermined number, and in subsequent step SP94, It is determined whether or not the route passing through the node (node A) that has issued the link status notification message LM received in SP 91 is the route used (Route Status). 'Here, if a negative result is obtained in either step SP93 or step SP94, this indicates that there is a possibility that the path of the node on the communication path may return to a good state, or it is likely to disconnect. This means that there is no need to switch the communication path to the alternative path because the path of the new node is not on the communication path. At this time, the CPU 92 returns to step SP91 and repeats the above-described processing.
- Count unit time reception count
- step SP93 if an affirmative result is obtained in both step SP93 and step SP9, this indicates that the route of the node on the communication route is unlikely to return to a good state, and the communication route is immediately replaced with an alternative route. In this case, the CPU 12 moves to the next step SP95.
- the CPU 12 generates the extended route request message 73 (FIG. 22) based on the link state table 71 (FIG. 21) in step SP95, and broadcasts this in the subsequent step SP96.
- the process moves to the next step SP97 and ends the route reset request processing procedure RT8.
- the CPU 12 can execute the route reset request processing in accordance with the route reset request processing procedure RT8. (2 to 3) Route reset processing of nodes A to C and E
- the nodes A to A that set a better link state than the touch state before disconnection (a radio field intensity value equal to or lower than the intensity threshold or a packet error rate equal to or higher than the error threshold) are set.
- the route resetting process of C and E will be described.
- the CPUs 12 of the nodes A to C and E are configured to measure the radio field intensity value and the bucket error rate as described above in the state notification processing described above, and to perform the extended route request.
- the measurement result of the radio field intensity value and the packet error rate at the time of receiving the message 73 and the route requirement (“R equired Link”) included in the extended route request message 73 (FIG. 22) are received.
- the upstream route in the node that broadcasts the extended route request message 73 is disconnected. It is in a worse condition than the route (A-C (Fig. 17)) in the previous state. Therefore, in this case, the CPU 12 discards the extended route request message 73.
- the upstream route of the node that broadcasts the extended route request message 73 is in a state of being touched before disconnection.
- the route is better than the route (A-C (Fig. 17)).
- the CPU 12 performs the same entry insertion processing as in the conventional case, inserts the route entry into the route table 2 (FIG. 26), and sends the extended route request message 73 to itself. If not, re-broadcast.
- the CPU 12 executes the route re-establishment processing, so that the link state better than the contact state before disconnection (the radio wave intensity value below the intensity threshold or the bucket failure rate above the error threshold) is obtained. It has been made possible to set.
- the above-described route re-search processing in the CPU 12 is performed in accordance with the route re-search processing procedure RT 10 shown in FIG.
- the CPU 12 when the CPU 12 receives the extended route request message 73, it starts this route re-search processing procedure RT10 in step SP100, and in the subsequent step SP101, prevents the extended type in order to prevent double reception. It is determined whether the route request message 73 (RREQ ID (FIG. 22)) has never been received in the past, and in the following step SP102, it is determined whether there is a communication route satisfying the route request condition. .
- step SP 101 if a positive result is obtained in both step SP 101 and step SP 102, this indicates that the upstream path in the node that broadcasts the extended path request message 73 is in a state before disconnection. This means that the state is better than the path (A-C (FIG. 17)), and the CPU 12 proceeds to the next step SP 103 at this time.
- the CPU 12 performs an entry insertion process in this step SP 103, inserts a route entry based on the extended route request message 73 into the route table 2 (FIG. 26), and expands in the subsequent step SP 104 "D estination Ad dress" Fi one Honoré de 3 6 in the mold route request message 7 3 determines whether the address of the body.
- the CPU 12 multicasts the route response message 6 (FIG. 28) to the node corresponding to the route entry entered in the route table 2 in step SP105.
- the extended type route request message 73 is broadcasted in step SP106, and the process proceeds to the next step SP107 to execute this route re-search processing procedure RT10. finish.
- step SP101 if a negative result is obtained in either step SP101 or step SP102, this indicates that the upstream route of the node that broadcasts the extended route request (A—C (Fig. 1 7)), which means that the CPU 12 discards the extended route request message 73 in step SP108, moves to the next step SP107, and Route re-search processing procedure RT 10 ends.
- the CPU 12 can execute the route re-search processing according to the route re-search processing procedure RT 10.
- the ad-hoc network system 60 has a route (A-B, A_C,..., C-D, from the source node S to the destination node D (FIG. 16) Detects the touch state before disconnection in)) and sends a message with a route other than the route (A-C (Fig. 17)) that corresponds to the touch state before disconnection as a condition for creation.
- the alternative route (S—B—E—D (FIG. 17)) is switched before the route (A—C (FIG. 17)) that has been touched before disconnection is disconnected. This ensures that the data packet transfer state between the node S and the node D can always be ensured. In this case, the ad hoc network system 60 detects such a state before disconnection based on two different communication indices of the radio wave intensity and the bucket error rate.
- the cause of the touch state before disconnection can be detected from two aspects.
- the radio wave condition is good
- the transfer of a data bucket that exceeds the transfer processing capacity of the data bucket is possible.
- the ad hoc network system 60 generates a link status notification message using a route that is in a better state than the detected touch state before disconnection as a creation condition. It generates LM (Fig. 19) and sends out the message LM (Fig. 19).
- this ad hoc network system 60 an alternative route that is hard to be disconnected can be secured, so that the processing load and time for creating the alternative route many times can be avoided, so that the failure can be more effectively performed.
- the state of touch before disconnection on the route from the source node S to the destination node D is detected, and a route other than the route corresponding to the disconnection before touch state is set as a creation condition.
- a route other than the route corresponding to the disconnection before touch state is set as a creation condition.
- the first message is composed of a plurality of communication terminals, is transmitted from the first communication terminal, is transmitted to the third communication terminal via the second communication terminal, and the first message.
- the first to third communication terminals A route to each of the first and third communication terminals is created, and the communication system that communicates between the first and third communication terminals via the created route and a communication terminal device that constitutes the communication system are widely used. Can be applied.
- a state notifying means for detecting a sign of disconnection of communication on a path on the upstream side of data as a pre-disconnection state and notifying the transmission source of the disconnection state, Either one or both of the radio field intensity value below the intensity threshold and the packet error rate above the error threshold are detected, and based on the detection result, a notification is sent via the link status notification message LM shown in Fig. 5.
- the link status notification message LM shown in Fig. 5.
- the state of touch before disconnection is detected based on two types of communication indices, radio wave intensity and bucket error rate.
- the communication may be added to the radio wave intensity and the bucket error rate, and the combination of various communication indices may be appropriately changed according to the communication state. In this way, the touch state before cutting can be detected more accurately.
- a message sending unit that generates a message using a route other than the route corresponding to the touched state before disconnection notified from the second communication terminal as a creation condition, and sends the message.
- CPU 12 has been described as a case where a message is generated in which a route in a better state than the state before disconnection is set as a creation condition.
- the present invention is not limited to this. It is sufficient to generate a message using a route other than the route corresponding to the contact state before disconnection notified by the communication terminal as a creation condition, and transmit the message.
- the creation condition various conditions can be determined according to the communication index described above.
- the extended route request message 73 shown in FIG. 22 is generated, but may be measured by other various measurement methods. Depending on the format, other formats may be used. Further, the extended route request message 73 may be used as a part of a routing protocol, or may be used in combination with a message of an upper layer.
- the present invention can be applied to various network systems in addition to the ad hoc network system:
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
BRPI0413316-1A BRPI0413316A (pt) | 2003-08-08 | 2004-08-06 | sistema de comunicação, dispositivo de terminal de comunicação, método de controle para um dispositivo de terminal de comunicação, programa, e, método de comunicação para um dispositivo de terminal de comunicação |
KR1020067002711A KR101049870B1 (ko) | 2003-08-08 | 2004-08-06 | 통신 시스템 및 통신 단말기 장치 |
US10/567,101 US8005054B2 (en) | 2003-08-08 | 2004-08-06 | Communication system, communication method, communication terminal device, control method thereof, and program |
EP04771626.1A EP1653676B1 (en) | 2003-08-08 | 2004-08-06 | Communication system, communication method and program |
US13/162,322 US8755294B2 (en) | 2003-08-08 | 2011-06-16 | Communication system, communication method, communication terminal device, control method thereof, and program |
Applications Claiming Priority (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003-290470 | 2003-08-08 | ||
JP2003-290468 | 2003-08-08 | ||
JP2003290469A JP4605427B2 (ja) | 2003-08-08 | 2003-08-08 | 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム |
JP2003-290469 | 2003-08-08 | ||
JP2003290468A JP4605426B2 (ja) | 2003-08-08 | 2003-08-08 | 通信端末装置及びその制御方法、プログラム |
JP2003290470A JP4605428B2 (ja) | 2003-08-08 | 2003-08-08 | 通信システム、通信端末装置、通信方法及びプログラム |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/567,101 A-371-Of-International US8005054B2 (en) | 2003-08-08 | 2004-08-06 | Communication system, communication method, communication terminal device, control method thereof, and program |
US13/162,322 Division US8755294B2 (en) | 2003-08-08 | 2011-06-16 | Communication system, communication method, communication terminal device, control method thereof, and program |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005015856A1 true WO2005015856A1 (ja) | 2005-02-17 |
Family
ID=34139380
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2004/011651 WO2005015856A1 (ja) | 2003-08-08 | 2004-08-06 | 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム |
Country Status (5)
Country | Link |
---|---|
US (2) | US8005054B2 (ja) |
EP (1) | EP1653676B1 (ja) |
KR (1) | KR101049870B1 (ja) |
BR (1) | BRPI0413316A (ja) |
WO (1) | WO2005015856A1 (ja) |
Families Citing this family (73)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB0408868D0 (en) | 2004-04-21 | 2004-05-26 | Level 5 Networks Ltd | Checking data integrity |
EP3217285B1 (en) | 2005-03-10 | 2021-04-28 | Xilinx, Inc. | Transmitting data |
GB0506403D0 (en) | 2005-03-30 | 2005-05-04 | Level 5 Networks Ltd | Routing tables |
GB0505300D0 (en) | 2005-03-15 | 2005-04-20 | Level 5 Networks Ltd | Transmitting data |
US8068507B2 (en) | 2005-06-14 | 2011-11-29 | Interdigital Technology Corporation | Method and system for conveying backhaul link information for intelligent selection of a mesh access point |
US7808971B2 (en) * | 2005-07-01 | 2010-10-05 | Miller John L | Routing cache for distributed hash tables |
US20080256168A1 (en) * | 2005-09-29 | 2008-10-16 | Koninklijke Philips Electronics, N.V. | Target Class Addressing of Updates in Ambient Databases |
GB0600417D0 (en) | 2006-01-10 | 2006-02-15 | Level 5 Networks Inc | Virtualisation support |
CN101047660A (zh) * | 2006-03-28 | 2007-10-03 | 朗迅科技公司 | 发送数据的方法 |
DE102006018281B4 (de) * | 2006-04-20 | 2017-12-28 | Merten Gmbh | Verfahren zum Installieren eines Funksystems in einem Gebäude |
US8238259B2 (en) | 2006-07-04 | 2012-08-07 | Hitachi, Ltd. | Method for building ad hoc network |
JP4281768B2 (ja) | 2006-08-15 | 2009-06-17 | ソニー株式会社 | 通信システム、無線通信装置およびその制御方法 |
US8279753B2 (en) * | 2007-01-11 | 2012-10-02 | Oracle International Corporation | Efficient determination of fast routes when voluminous data is to be sent from a single node to many destination nodes via other intermediate nodes |
US8223660B2 (en) * | 2007-04-18 | 2012-07-17 | Rockstar Bidco Lp | Failure notification in a network having serially connected nodes |
DE102007029120B4 (de) * | 2007-06-25 | 2010-06-17 | Siemens Ag | Verfahren zum Betreiben eines drahtlosen, vermaschten Datennetzes mit einer Mehrzahl an Netzknoten |
US8320371B2 (en) * | 2007-10-26 | 2012-11-27 | Cisco Technology, Inc. | Statistics based forwarding information base repopulation |
US20090161578A1 (en) * | 2007-12-21 | 2009-06-25 | Hong Kong Applied Science And Technology Research Institute Co. Ltd. | Data routing method and device thereof |
US9848314B2 (en) | 2008-05-19 | 2017-12-19 | Qualcomm Incorporated | Managing discovery in a wireless peer-to-peer network |
US9198017B2 (en) | 2008-05-19 | 2015-11-24 | Qualcomm Incorporated | Infrastructure assisted discovery in a wireless peer-to-peer network |
JP5282448B2 (ja) * | 2008-05-30 | 2013-09-04 | 富士通株式会社 | 無線通信システム、無線通信装置及びその切断処理方法 |
US9253707B2 (en) * | 2008-06-04 | 2016-02-02 | Koninklijke Philips N.V. | Network interface unit for a node in a wireless multi-hop network, and a method of establishing a network path between nodes in a wireless multi-hop network |
JP4988674B2 (ja) * | 2008-09-08 | 2012-08-01 | 株式会社日立製作所 | ネットワーク監視装置、ネットワーク監視方法、および、ネットワーク監視プログラム |
CN102113404B (zh) * | 2009-01-26 | 2014-08-27 | 松下电器产业株式会社 | 中继装置、控制方法、以及程序 |
CN101969395B (zh) * | 2009-07-28 | 2013-02-27 | 华为技术有限公司 | 节点配置和路径探测方法、系统和网络设备 |
CN101990270B (zh) * | 2009-08-06 | 2014-05-21 | 华为技术有限公司 | 建立按需路由的方法、设备及系统 |
US20110228696A1 (en) * | 2010-03-19 | 2011-09-22 | Navneet Agarwal | Dynamic directed acyclic graph (dag) topology reporting |
JP5408337B2 (ja) | 2010-03-31 | 2014-02-05 | 富士通株式会社 | ノード装置および迂回経路調査方法 |
EP2553870B1 (en) * | 2010-03-31 | 2020-01-22 | Telefonaktiebolaget LM Ericsson (publ) | An operations, administrations and management proxy and a method for handling operations, administrations and management messages |
CN101854306B (zh) * | 2010-06-07 | 2011-12-28 | 西安西电捷通无线网络通信股份有限公司 | 一种交换路由探寻方法及系统 |
US10285112B2 (en) * | 2010-07-08 | 2019-05-07 | Peking University | Data transmission in mobile ad-hoc network |
US9661551B2 (en) * | 2010-07-08 | 2017-05-23 | Peking University | Data transmission in mobile ad-hoc network |
KR20120005613A (ko) * | 2010-07-09 | 2012-01-17 | 삼성전자주식회사 | 무선통신시스템에서 메시지 전송 오버헤드를 줄이기 위한 장치 및 방법 |
US9906448B2 (en) | 2010-12-10 | 2018-02-27 | Nec Corporation | Communication system, control device, node controlling method, and program |
US8514859B2 (en) | 2010-12-14 | 2013-08-20 | At&T Intellectual Property I, L.P. | Methods and apparatus to determine an alternate route in a network |
US9300571B2 (en) | 2011-01-13 | 2016-03-29 | Marvell World Trade Ltd. | Method and apparatus for handling multicast traffic |
FR2979512B1 (fr) * | 2011-08-30 | 2014-04-04 | Bull Sas | Procede d'echange de donnees entre nœuds d'une grappe de serveurs et grappe de serveurs mettant en œuvre ce procede |
JP5812111B2 (ja) * | 2011-12-19 | 2015-11-11 | 富士通株式会社 | 送信制御方法およびノード |
JP5810899B2 (ja) * | 2011-12-26 | 2015-11-11 | 富士通株式会社 | 無線通信装置、無線通信プログラムおよび無線通信方法 |
US8774147B2 (en) | 2012-02-23 | 2014-07-08 | Dahrwin Llc | Asynchronous wireless dynamic ad-hoc network |
US9940118B2 (en) * | 2012-02-23 | 2018-04-10 | Dahrwin Llc | Systems and methods utilizing highly dynamic wireless ad-hoc networks |
JP6140972B2 (ja) * | 2012-10-16 | 2017-06-07 | 京セラ株式会社 | 通信機器及び通信制御方法 |
US9338098B2 (en) * | 2012-12-13 | 2016-05-10 | Cellco Partnership | Dynamic flow management at a firewall based on error messages |
US9781664B2 (en) * | 2012-12-31 | 2017-10-03 | Elwha Llc | Cost-effective mobile connectivity protocols |
US9635605B2 (en) | 2013-03-15 | 2017-04-25 | Elwha Llc | Protocols for facilitating broader access in wireless communications |
US9980114B2 (en) | 2013-03-15 | 2018-05-22 | Elwha Llc | Systems and methods for communication management |
US9832628B2 (en) | 2012-12-31 | 2017-11-28 | Elwha, Llc | Cost-effective mobile connectivity protocols |
US9713013B2 (en) | 2013-03-15 | 2017-07-18 | Elwha Llc | Protocols for providing wireless communications connectivity maps |
US9876762B2 (en) | 2012-12-31 | 2018-01-23 | Elwha Llc | Cost-effective mobile connectivity protocols |
US9451394B2 (en) | 2012-12-31 | 2016-09-20 | Elwha Llc | Cost-effective mobile connectivity protocols |
US9813887B2 (en) | 2013-03-15 | 2017-11-07 | Elwha Llc | Protocols for facilitating broader access in wireless communications responsive to charge authorization statuses |
US9693214B2 (en) | 2013-03-15 | 2017-06-27 | Elwha Llc | Protocols for facilitating broader access in wireless communications |
US9843917B2 (en) | 2013-03-15 | 2017-12-12 | Elwha, Llc | Protocols for facilitating charge-authorized connectivity in wireless communications |
US9866706B2 (en) | 2013-03-15 | 2018-01-09 | Elwha Llc | Protocols for facilitating broader access in wireless communications |
US9706060B2 (en) | 2013-03-15 | 2017-07-11 | Elwha Llc | Protocols for facilitating broader access in wireless communications |
US9807582B2 (en) | 2013-03-15 | 2017-10-31 | Elwha Llc | Protocols for facilitating broader access in wireless communications |
US9596584B2 (en) | 2013-03-15 | 2017-03-14 | Elwha Llc | Protocols for facilitating broader access in wireless communications by conditionally authorizing a charge to an account of a third party |
US9706382B2 (en) | 2013-03-15 | 2017-07-11 | Elwha Llc | Protocols for allocating communication services cost in wireless communications |
JP6098322B2 (ja) | 2013-04-17 | 2017-03-22 | 富士通株式会社 | パケット転送方法、ノード装置およびプログラム |
JP2015046661A (ja) * | 2013-08-27 | 2015-03-12 | ソニー株式会社 | 情報処理装置および情報処理方法 |
JP2015046662A (ja) * | 2013-08-27 | 2015-03-12 | ソニー株式会社 | 情報処理装置および情報処理方法 |
US9699639B2 (en) * | 2013-11-15 | 2017-07-04 | Sony Corporation | Information processing device, information processing method and program |
WO2015139026A2 (en) | 2014-03-14 | 2015-09-17 | Go Tenna Inc. | System and method for digital communication between computing devices |
CN107852366B (zh) * | 2015-06-17 | 2021-04-06 | 瑞典爱立信有限公司 | 减少网状网络中的延时的方法、中继节点和计算机可读存储介质 |
EP3311536B1 (en) | 2015-06-17 | 2021-02-17 | Telefonaktiebolaget LM Ericsson (PUBL) | Path setup in a mesh network |
JP6428702B2 (ja) * | 2016-04-07 | 2018-11-28 | 住友電気工業株式会社 | 管理装置および管理システム |
US10411980B2 (en) | 2016-09-20 | 2019-09-10 | Intel Corporation | Proactive path quality reporting in packet transmission |
JP6542816B2 (ja) * | 2017-01-30 | 2019-07-10 | 古河電気工業株式会社 | ノード装置およびその制御方法 |
CN107766062B (zh) * | 2017-12-08 | 2021-02-09 | 北京小米移动软件有限公司 | 用于安装软件的方法、系统和第一终端 |
CN108989996B (zh) * | 2018-07-03 | 2021-05-25 | 京东方科技集团股份有限公司 | 通信方法及通信装置、电子设备、存储介质 |
WO2020011907A1 (en) | 2018-07-12 | 2020-01-16 | Koninklijke Kpn N.V. | Multi-hop relaying in a mobile communication network |
US11082324B2 (en) | 2018-07-27 | 2021-08-03 | goTenna Inc. | Vine: zero-control routing using data packet inspection for wireless mesh networks |
JP7230729B2 (ja) * | 2019-08-01 | 2023-03-01 | 日本電信電話株式会社 | 経路制御装置、経路制御方法、及びプログラム |
CN112261702B (zh) * | 2020-09-18 | 2022-09-16 | 北京邮电大学 | 基于位置的无线Mesh网络路由选路方法、装置和电子设备 |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS56140744A (en) * | 1980-04-02 | 1981-11-04 | Nippon Telegr & Teleph Corp <Ntt> | Route resetting system |
JPH04369948A (ja) * | 1991-06-19 | 1992-12-22 | Mitsubishi Electric Corp | パケット中継装置 |
JPH1155313A (ja) * | 1997-08-04 | 1999-02-26 | Nippon Telegr & Teleph Corp <Ntt> | 無線基地局の経路指定方法 |
JP3102057B2 (ja) * | 1991-05-17 | 2000-10-23 | オムロン株式会社 | 無線ネットワークシステムおよび送信経路探索方法 |
JP2001136178A (ja) * | 1999-11-08 | 2001-05-18 | Hitachi Ltd | 無線ネットワーク、その経路制御方法および無線通信制御装置 |
JP2003198563A (ja) * | 2001-12-27 | 2003-07-11 | Ntt Comware Corp | 無線通信装置および方法と無線通信プログラムおよび該プログラムを記録したコンピュータ読取り可能な記録媒体 |
JP2003219472A (ja) * | 2002-01-21 | 2003-07-31 | Japan Telecom Co Ltd | 通信システム及び通信方法 |
JP2003258861A (ja) * | 2002-02-27 | 2003-09-12 | Nec Corp | ルーティング経路管理装置、その方法、及びそのプログラム |
JP2003304280A (ja) * | 2002-04-10 | 2003-10-24 | Nec Corp | Wdm網設計装置及びそれに用いるwdm網設計方法並びにそのプログラム |
JP2004023440A (ja) * | 2002-06-17 | 2004-01-22 | Kddi Corp | 経路制御方法及び装置、並びにコンピュータプログラム |
JP2004056787A (ja) * | 2002-06-19 | 2004-02-19 | Harris Corp | 移動アドホックネットワークおよび重み係数を乗じたサービス品質メトリックに基づいて機能を実行するための方法 |
Family Cites Families (42)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS6052143A (ja) | 1983-09-01 | 1985-03-25 | Mitsubishi Electric Corp | パケット交換網におけるパケット伝送方法 |
JPS6253546A (ja) | 1985-09-03 | 1987-03-09 | Fujitsu Ltd | ル−テイングにおけるル−プ防止制御方式 |
JP2766867B2 (ja) | 1989-09-18 | 1998-06-18 | 株式会社岩田レーベル | 自動カット機構を有するロールラベルなどの自動つなぎ装置およびロールラベル |
JPH04131181A (ja) | 1990-09-19 | 1992-05-01 | Toshiba Corp | イオン交換装置 |
JPH04154341A (ja) | 1990-10-18 | 1992-05-27 | Nec Corp | 通信経路管理方式 |
JPH0541689A (ja) | 1991-08-05 | 1993-02-19 | Nippon Telegr & Teleph Corp <Ntt> | セルラー移動通信におけるチヤネル切替方式 |
JPH0645990A (ja) | 1992-03-18 | 1994-02-18 | Nec Corp | 移動端末 |
JPH06232908A (ja) | 1993-02-05 | 1994-08-19 | Fuji Xerox Co Ltd | ルーティング装置 |
JP3165347B2 (ja) | 1995-04-21 | 2001-05-14 | 日本電信電話株式会社 | ハンドオーバ制御方法 |
US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
US6347078B1 (en) * | 1997-09-02 | 2002-02-12 | Lucent Technologies Inc. | Multiple path routing |
US6542469B1 (en) * | 1998-12-10 | 2003-04-01 | Sprint Communications Company, L.P. | Communications network system and method for routing based on disjoint pairs of path |
CA2356947A1 (en) | 1998-12-23 | 2000-07-06 | Nokia Wireless Routers, Inc. | A unified routing scheme for ad-hoc internetworking |
JP2000244601A (ja) | 1999-02-24 | 2000-09-08 | Mitsubishi Electric Corp | データ回線選択方法およびデータ回線選択装置 |
US6535498B1 (en) * | 1999-12-06 | 2003-03-18 | Telefonaktiebolaget Lm Ericsson (Publ) | Route updating in ad-hoc networks |
EP1111874A1 (en) * | 1999-12-20 | 2001-06-27 | Telefonaktiebolaget L M Ericsson | Routing in mobile-IP Ad-Hoc networks |
JP3531584B2 (ja) | 2000-06-02 | 2004-05-31 | 日本電気株式会社 | ハンドオーバ方法 |
JP3782671B2 (ja) | 2001-02-28 | 2006-06-07 | 株式会社エヌ・ティ・ティ・ドコモ | リンクマネージャ及びリンク管理方法 |
US20050129000A1 (en) | 2001-12-28 | 2005-06-16 | T.V.L.N Sivakumar | Routing method for mobile ad-hoc network |
JP2003299150A (ja) | 2002-03-29 | 2003-10-17 | Toshiba Corp | 無線端末装置 |
EP1490867B1 (en) | 2002-03-29 | 2006-10-18 | Fujitsu Limited | Magnetic recording medium and magnetic storage apparatus |
JP2003324443A (ja) | 2002-04-26 | 2003-11-14 | Toshiba Corp | アドホック・ネットワークシステム、アドホック・ネットワーク通信方法及び無線端末装置 |
US6954435B2 (en) * | 2002-04-29 | 2005-10-11 | Harris Corporation | Determining quality of service (QoS) routing for mobile ad hoc networks |
US7616961B2 (en) * | 2002-04-29 | 2009-11-10 | Harris Corporation | Allocating channels in a mobile ad hoc network |
JP4239058B2 (ja) | 2002-05-22 | 2009-03-18 | ソニー株式会社 | 無線通信装置、無線通信装置の制御方法、無線通信装置の制御方法のプログラム及び無線通信装置の制御方法のプログラムを記録した記録媒体 |
US6894985B2 (en) * | 2002-08-05 | 2005-05-17 | Harris Corporation | Monitoring link quality in a mobile ad hoc network |
US7027426B2 (en) * | 2002-08-05 | 2006-04-11 | Harris Corporation | Multi-channel mobile ad hoc network |
US6961310B2 (en) * | 2002-08-08 | 2005-11-01 | Joseph Bibb Cain | Multiple path reactive routing in a mobile ad hoc network |
JP4312155B2 (ja) | 2002-12-19 | 2009-08-12 | 富士通株式会社 | モバイルノード |
JP2004234430A (ja) | 2003-01-31 | 2004-08-19 | Patolis Corp | スクリーニングのための自動めくり方法 |
JP2004282270A (ja) | 2003-03-13 | 2004-10-07 | Sony Corp | 無線アドホック通信システム、端末、その端末における処理方法並びにその方法を端末に実行させるためのプログラム |
JP4131181B2 (ja) | 2003-03-13 | 2008-08-13 | ソニー株式会社 | 無線アドホック通信システム、端末、その端末における処理方法並びにその方法を端末に実行させるためのプログラム |
US7453864B2 (en) * | 2003-04-30 | 2008-11-18 | Harris Corporation | Predictive route maintenance in a mobile ad hoc network |
MXPA04004719A (es) * | 2003-05-19 | 2004-09-06 | Eaton Corp | Red ad-hoc y metodo de enrutar comunicaciones en una red de comunicaciones. |
US20040264372A1 (en) * | 2003-06-27 | 2004-12-30 | Nokia Corporation | Quality of service (QoS) routing for Bluetooth personal area network (PAN) with inter-layer optimization |
JP4605427B2 (ja) | 2003-08-08 | 2011-01-05 | ソニー株式会社 | 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム |
JP4605426B2 (ja) | 2003-08-08 | 2011-01-05 | ソニー株式会社 | 通信端末装置及びその制御方法、プログラム |
JP4605428B2 (ja) | 2003-08-08 | 2011-01-05 | ソニー株式会社 | 通信システム、通信端末装置、通信方法及びプログラム |
JP2005072720A (ja) | 2003-08-20 | 2005-03-17 | Sony Corp | 通信ネットワークシステム、通信経路選択装置及び情報通信方法 |
JP2005101872A (ja) | 2003-09-24 | 2005-04-14 | Sanyo Electric Co Ltd | ネットワーク制御方法、ネットワークシステムおよび無線端末 |
JP2005286989A (ja) | 2004-03-02 | 2005-10-13 | Ntt Docomo Inc | 通信端末及びアドホックネットワーク経路制御方法 |
JP4369948B2 (ja) | 2006-09-20 | 2009-11-25 | シャープ株式会社 | 画像表示装置及び方法、画像処理装置及び方法 |
-
2004
- 2004-08-06 BR BRPI0413316-1A patent/BRPI0413316A/pt not_active IP Right Cessation
- 2004-08-06 EP EP04771626.1A patent/EP1653676B1/en not_active Expired - Fee Related
- 2004-08-06 US US10/567,101 patent/US8005054B2/en not_active Expired - Fee Related
- 2004-08-06 KR KR1020067002711A patent/KR101049870B1/ko not_active IP Right Cessation
- 2004-08-06 WO PCT/JP2004/011651 patent/WO2005015856A1/ja active Application Filing
-
2011
- 2011-06-16 US US13/162,322 patent/US8755294B2/en not_active Expired - Fee Related
Patent Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS56140744A (en) * | 1980-04-02 | 1981-11-04 | Nippon Telegr & Teleph Corp <Ntt> | Route resetting system |
JP3102057B2 (ja) * | 1991-05-17 | 2000-10-23 | オムロン株式会社 | 無線ネットワークシステムおよび送信経路探索方法 |
JPH04369948A (ja) * | 1991-06-19 | 1992-12-22 | Mitsubishi Electric Corp | パケット中継装置 |
JPH1155313A (ja) * | 1997-08-04 | 1999-02-26 | Nippon Telegr & Teleph Corp <Ntt> | 無線基地局の経路指定方法 |
JP2001136178A (ja) * | 1999-11-08 | 2001-05-18 | Hitachi Ltd | 無線ネットワーク、その経路制御方法および無線通信制御装置 |
JP2003198563A (ja) * | 2001-12-27 | 2003-07-11 | Ntt Comware Corp | 無線通信装置および方法と無線通信プログラムおよび該プログラムを記録したコンピュータ読取り可能な記録媒体 |
JP2003219472A (ja) * | 2002-01-21 | 2003-07-31 | Japan Telecom Co Ltd | 通信システム及び通信方法 |
JP2003258861A (ja) * | 2002-02-27 | 2003-09-12 | Nec Corp | ルーティング経路管理装置、その方法、及びそのプログラム |
JP2003304280A (ja) * | 2002-04-10 | 2003-10-24 | Nec Corp | Wdm網設計装置及びそれに用いるwdm網設計方法並びにそのプログラム |
JP2004023440A (ja) * | 2002-06-17 | 2004-01-22 | Kddi Corp | 経路制御方法及び装置、並びにコンピュータプログラム |
JP2004056787A (ja) * | 2002-06-19 | 2004-02-19 | Harris Corp | 移動アドホックネットワークおよび重み係数を乗じたサービス品質メトリックに基づいて機能を実行するための方法 |
Non-Patent Citations (3)
Title |
---|
HASEBE ET AL.: "AODV no multipass tansaku heno kakucho", MULTIMEDIA TSUSHIN TO BUNSAN SHORI WORKSHOP RONBUNSHU, INFORMATION PROCESSING SOCIETY OF JAPAN SYMPOSIUM SERIES, vol. 2001, no. 13, 2001, pages 163 - 168, XP002995646 * |
HASEBE ET AL.: "Fukusu keiro o mochiita antenna message haiso no tameno adhoc routing protocol", INFORMATION PROCESSING SOCIETY OF JAPAN KENKYU HOKOKU, vol. 2002, no. 49, 2002, pages 25 - 32, XP002995645 * |
See also references of EP1653676A4 * |
Also Published As
Publication number | Publication date |
---|---|
US8755294B2 (en) | 2014-06-17 |
KR101049870B1 (ko) | 2011-07-15 |
EP1653676A4 (en) | 2010-04-07 |
EP1653676B1 (en) | 2017-12-27 |
US20080310340A1 (en) | 2008-12-18 |
BRPI0413316A (pt) | 2006-10-10 |
US20110280246A1 (en) | 2011-11-17 |
EP1653676A1 (en) | 2006-05-03 |
US8005054B2 (en) | 2011-08-23 |
KR20060055538A (ko) | 2006-05-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2005015856A1 (ja) | 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム | |
US10250503B2 (en) | Routing method and wireless node for wireless mesh network | |
EP2748987B1 (en) | Dynamic multi-path forwarding for shared-media communication network | |
US8081628B2 (en) | Multicast distribution tree establishment and maintenance in a wireless multi-hop relay communication system | |
US9220050B2 (en) | Mesh network defragmentation | |
JP4605426B2 (ja) | 通信端末装置及びその制御方法、プログラム | |
JP4060316B2 (ja) | 移動体アドホックネットワークにおける複数パスのリアクティブ型ルーティング | |
CN112448877B (zh) | 一种sbfd会话的建立方法、设备及系统 | |
US20060182033A1 (en) | Fast multicast path switching | |
WO2012000234A1 (zh) | 链路间快速切换的方法、装置和系统 | |
JP4100353B2 (ja) | 複数ルータ間調停方法、ルータ優先度計算装置及びルータ装置 | |
JP2004032758A (ja) | VRRP(VirtualRouterRedundancyProtocol)によるルータ・インターフェース・バックアップ実行方法 | |
JP2007129542A (ja) | 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム | |
EP2652905A1 (en) | Increased communication opportunities with low-contact nodes in a computer network | |
JP4605427B2 (ja) | 通信システム、通信方法、通信端末装置及びその制御方法並びにプログラム | |
JP4605428B2 (ja) | 通信システム、通信端末装置、通信方法及びプログラム | |
Garcia-Luna-Aceves et al. | A new approach to on-demand loop-free routing in ad hoc networks | |
CN101232458B (zh) | 一种基于maodv协议的多路径扩展方法 | |
US20160269957A1 (en) | Method for selecting network and electronic device therefor | |
WO2008038390A1 (fr) | système de communication IP mobile | |
CN101610559A (zh) | 一种无线路由确定方法及节点装置 | |
JP4099773B2 (ja) | Ipマルチキャスト配信元切替制御システムおよびそのための方法、切替制御サーバ、ならびに切替制御用プログラムおよび該プログラムを記録した記録媒体 | |
JP2021069114A (ja) | 複数のノードを含むネットワークのための方法、ブルートゥース低エネルギーネットワーク、およびコンピュータプログラム製品 | |
Ghasemi et al. | Classification of multicast routing protocols for Mobile Ad Hoc Networks | |
JP4339168B2 (ja) | マルチキャスト通信システム、ルータおよびホームエージェント |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200480022806.5 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
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: 10567101 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2004771626 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067002711 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2004771626 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020067002711 Country of ref document: KR |
|
ENP | Entry into the national phase |
Ref document number: PI0413316 Country of ref document: BR |