EP1897295B1 - Auffindung eines gerichteten, azyklischen graphen und verteilung von netzpräfixinformationen in bezug auf einen clusterkopf in einem mobilen ad-hoc-netz - Google Patents

Auffindung eines gerichteten, azyklischen graphen und verteilung von netzpräfixinformationen in bezug auf einen clusterkopf in einem mobilen ad-hoc-netz Download PDF

Info

Publication number
EP1897295B1
EP1897295B1 EP06774066A EP06774066A EP1897295B1 EP 1897295 B1 EP1897295 B1 EP 1897295B1 EP 06774066 A EP06774066 A EP 06774066A EP 06774066 A EP06774066 A EP 06774066A EP 1897295 B1 EP1897295 B1 EP 1897295B1
Authority
EP
European Patent Office
Prior art keywords
router
mobile router
reachable
attachment
mobile
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP06774066A
Other languages
English (en)
French (fr)
Other versions
EP1897295A1 (de
Inventor
Pascal Thubert
Patrick Wetterwald
Vincent Jean Ribiere
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cisco Technology Inc
Original Assignee
Cisco Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cisco Technology Inc filed Critical Cisco Technology Inc
Priority to EP10163840A priority Critical patent/EP2217024A3/de
Publication of EP1897295A1 publication Critical patent/EP1897295A1/de
Application granted granted Critical
Publication of EP1897295B1 publication Critical patent/EP1897295B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • 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/04—Interdomain routing, e.g. hierarchical 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/48—Routing tree calculation
    • 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/54—Organization of routing tables

Definitions

  • the present invention relates to routing protocols for establishment of an ad hoc mobile network by mobile routers, where the routing protocols are optimized for minimal overhead for accommodating rapid topology changes in the ad hoc mobile network.
  • IP Internet Protocol
  • IETF Internet Engineering Task Force
  • IP Internet Protocol
  • NEMO Network Mobility
  • a mobile network may be composed by one or more IP subnets and is connected to the global Internet via one or more Mobile Routers (MR).
  • the mobile router has at least two network interfaces: an egress interface toward the wide area network, and an ingress interface from within the mobile network.
  • Mobile network nodes may include local fixed nodes (LFN) (nodes unable to change their point of attachment while maintaining ongoing sessions), local mobile nodes (LMN) (mobile nodes that belong to the mobile network and able to change their point of attachment within the mobile network or outside the mobile network), and visiting mobile nodes (VMN) (mobile nodes that not belong to the mobile network and that can change their point of attachment from outside the mobile network to inside the mobile network).
  • LDN local fixed nodes
  • LDN local mobile nodes
  • VSN visiting mobile nodes
  • Each of the nodes may be either a host or a router.
  • a mobile router is a router configured for establishing a communication link between the mobile network and an attachment router.
  • an objective of NEMO is providing mobile nodes with protocols for establishing connectivity with a wide area network, such as the Internet.
  • the mobile router thus serves as a gateway to route packets between the mobile network and the Internet.
  • the IETF has a Mobile Ad-hoc Networks (MANET) Working Group that is working to develop standardized MANET routing specification(s) for adoption by the IETF.
  • MANET Mobile Ad-hoc Networks
  • the "mobile ad hoc network” (MANET) is an autonomous system of mobile routers (and associated hosts) connected by wireless links--the union of which form an arbitrary graph. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably.
  • Such a network may operate in a standalone fashion, or may be connected to the larger Internet.
  • the MANET system is particularly suited to low-power radio networks that may exhibit an unstable topology, where wireless propagation characteristics and signal quality between a wireless transmission source and a receiver can be difficult to model and quantify.
  • the device address is tied to the device, not a topological location, as there is no fixed network infrastructure. When the addressed device moves, therefore, the motion changes the routing infrastructure.
  • the fundamental behavior of a MANET is that a routing node carries with it an address or address prefix, and when it moves, it moves the actual address; when this happens, routing must be recalculated in accordance with the new topology. For example, each mobile router retains its address prefix; hence, neighboring mobile routers in a MANET may have distinct address prefixes.
  • MANET protocols can be divided into the following types: stateful (proactive); and stateless (reactive).
  • Proactive MANET protocols distribute routing information throughout the MANET network, enabling the routers within the MANET network to store route information before a data packet needs to be routed; hence, a router determines how to forward a packet based on accessing routing information from an internal table.
  • proactive protocols suffer the disadvantage of requiring update messages to update obsolete route entries: the necessity for update messages increases with a corresponding desire for an improvement in route optimization.
  • Proactive MANET protocols can be subdivided into two subtypes, or "families”: Optimized Routing Approach (ORA), and Least Overhead Routing Approach (LORA).
  • ORA Optimized Routing Approach
  • LORA Least Overhead Routing Approach
  • the ORA type protocols are similar to routing protocols used in the Internet, in that they stress maintaining the best states to maintain the shortest path routes, at the expense of requiring more control messages to exchange routes.
  • An example of an ORA type routing protocol is Open Shortest Path First (OSPF) (as specified by the IETF Request for Comments (RFC) 2178), or Intermediate System-to-Intermediate System (IS-IS) protocol (specified by the International Organization for Standardization document ISO 10589).
  • OSPF Open Shortest Path First
  • RRC Request for Comments
  • IS-IS Intermediate System-to-Intermediate System
  • OSPF and IS-IS protocols suffer from the disadvantage that they may require up to a minute to converge (i.e., complete protocol communications necessary to establish a connection) and hence may not be able to converge quickly enough for a mobile router that is moving from one location to another. For example, in the case of two vehicles passing each other, each having a mobile router, there may exist approximately ten seconds for the mobile routers to establish a connection; hence, routing protocols requiring up to a minute to converge would be unable to establish a connection. Also note that OSPF requires link-state advertisements (LSAs) to be refreshed as they expire after 3600 sec, resulting in substantial burdens in distributing the LSAs.
  • LSAs link-state advertisements
  • Reactive protocols were developed to address the slow convergence of ORA type proactive protocols, where routing information is acquired only when needed. Examples of reactive protocols are described in an Internet Draft by Perkins et al., "Ad hoc On-Demand Distance Vector (AODV) Routing (draft-ietf-manet-aodv. 13), February 17, 2003 , and an Internet Draft by Johnson et al., "The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) ⁇ draft-ietf-manet-dsr-09.txt>", April 15, 2003 . Reactive protocols require less bandwidth than proactive protocols, but the latency for many applications will increase substantially, resulting in long delays.
  • AODV On-Demand Distance Vector Routing
  • the LORA family of proactive protocols attempts to provide a compromise between the fully stateful (ORA family) protocols and the fully stateless (reactive) protocols.
  • One example of a LORA-type protocol is described in an Internet Draft by Garcia-Luna-Aceves, et al., "Source Tree Adaptive Routing (STAR) protocol ⁇ draft-ietf-manet-star.00.txt>", October 22, 1999 .
  • STAR Source Tree Adaptive Routing
  • the disclosed STAR protocol suffers from disadvantages of requiring routing messages to establish a stable topology within the MANET network.
  • the STAR protocol requires a router to transmit the parameters of its source routing tree, including each link that the router needs to reach every known destination (and address range) in the ad hoc network or Internet.
  • the STAR router attempts to conserve transmission bandwidth and energy by sending changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions, the necessity of transmitting such parameters for each and every link still imposes substantial messaging requirements that affects bandwidth availability and network convergence times.
  • WO-A2-2005/010214 discloses a method for wireless communication in a mesh network. Connectivity assessments are performed to evaluate the quality of communications between devices in the network and primary and secondary communication relationships may be formed to provide for system redundancy.
  • a neighbor advertisement message received from an ingress interface away from a clusterhead is used by the attached mobile router to identify specified network prefixes that are reachable via the source of the neighbor advertisement message.
  • the attached mobile router outputs on its default upstream interface a second neighbor advertisement message that specifies the network prefix used by the attached mobile router, and the specified network prefixes from the neighbor advertisement message received on the ingress interface.
  • Link reversal routing has been suggested as a technique for providing multiple communications links between nodes in an ad hoc mobile network, where link reversal routing algorithms build a directed acyclic graph (DAG) for each possible destination: a directed graph is acyclic if it contains no cycle or loop, and the DAG maps to a given destination based on the destination having only incoming links: all other nodes that have incoming links also must have outgoing links.
  • DAG directed acyclic graph
  • TORA Temporally-Ordered Routing Algorithm
  • each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network.
  • the mobile router in response to attaching to the multiple parents, selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead.
  • Each mobile router also is configured for sending to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries.
  • the mobile routers automatically can form a directed acyclic graph relative to the clusterhead, and can propagate reachable prefixes to each of their respective parents, enabling all the mobile routers and the clusterhead to distribute routing information with minimal overhead.
  • One aspect of the present invention provides a method in a mobile router configured for establishing communications within an ad hoc network.
  • the method includes establishing concurrent attachments to respective attachment routers based on having received respective advertisement messages specifying respective parent depths relative to a clusterhead of the ad hoc network.
  • the method also includes selecting an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, and advertising reachability to the clusterhead based on outputting a router advertisement message specifying said selected advertised depth relative to the clusterhead.
  • Attaching to a plurality of attachment routers enables the mobile router to establish stable connectivity within the ad hoc mobile network, ensuring connectivity if the link to one of the attachment routers is lost; multiple attachments also enables the mobile router to distribute traffic via the respective attachment routers for load balancing. Further, the selection of an advertised depth enables the mobile router to position itself within the mobile network topology as desired, for example enabling mobile routers configured as backbone routers to position themselves closer to the clusterhead, whereas mobile routers configured as distribution routers can position themselves further from the clusterhead and closer to end nodes at the periphery of the ad hoc network. Hence, multiple unequal-cost paths can be directed toward the clusterhead, enabling the mobile routers to establish a directed acyclic graph toward the clusterhead, providing a more stable network topology within the ad hoc network.
  • An additional feature of this aspect includes sending, by the mobile router to each of the attachment routers and in response to having established each corresponding attachment, a neighbor advertisement message specifying at least one reachable prefix advertised by the mobile router in the router advertisement message, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables validation of the corresponding at least one reachable prefix relative to any stored router entries in the attachment routers.
  • mobile routers can distribute routing information toward the clusterhead via multiple paths in the ad hoc network, enabling the attachment routers and the clusterhead to identify the most recent routing information for reaching the reachable prefixes.
  • Another aspect of the present invention provides a mobile router according to independent claim 11.
  • Another aspect of the present invention provides an ad hoc network having a plurality of mobile routers.
  • the plurality of mobile routers have organized into a directed acyclic graph directed toward a clusterhead, one of the mobile routers serving as the clusterhead and the directed acyclic graph having attached mobile routers having attached to attachment routers.
  • Each mobile router includes an attachment resource and a router advertisement resource.
  • the attachment resource is configured for selectively establishing concurrent attachments, as an attached mobile router, to selected ones of the attachment routers based on the mobile router having received respective advertisement messages from the selected ones of the attachment routers, the advertisement messages specifying respective parent depths relative to a clusterhead of the ad hoc network.
  • the router advertisement resource is configured for advertising reachability to the clusterhead based on outputting a router advertisement message specifying an advertised depth relative to the clusterhead, the router advertisement resource configured for selecting the advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths.
  • Figure 1A is a diagram illustrating an ad hoc network having mobile routers 12 arranged according to a tree topology 10, as described in the U.S. Patent Publication No. US 2004/0032852 and the above-incorporated application 10/856,809 .
  • the tree topology 10 require that each mobile router 12 can connect to only one attachment router (e.g., the clusterhead "A") at any time.
  • the ad hoc network of Figure 1A has the advantage of rapid convergence based on minimal overhead, however a loss of connectivity between any two mobile routers 12, for example between routers A and "D” due to disruption in a link 14, requires a reconfiguration of the tree-based ad hoc mobile network 10 in order to enable the mobile routers "D", "E", and "F” to restore connectivity with the clusterhead "A".
  • the disclosed embodiment is considered an improvement over the tree-based ad hoc network 10, in that mobile routers 16 (e.g., 16a, 16b, 16c, 16d, 16e, and 16f) can establish concurrent attachments with multiple attachment routers using available links 18, enabling the mobile routers 16b, 16c, 16d, 16e, and 16f to establish a directed acyclic graph 20, relative to the clusterhead 16a, that provides stable connectivity based on utilizing multiple links 18 in the ad hoc network.
  • mobile routers 16 e.g., 16a, 16b, 16c, 16d, 16e, and 16f
  • the mobile router "B"16b can reach the clusterhead "A" 16a by attaching directly to the clusterhead 16a via link 18a, or by attaching to the mobile router "C” 16c via link 18b, where the mobile router "C” 16c has attached to the clusterhead 16a via link 18d.
  • the mobile router "D” 16d has multiple concurrent attachments toward the clusterhead 16a via links 18c and 18e
  • mobile router "F” 16f also has multiple concurrent attachments toward the clusterhead via links 18g, 18h, and 18i.
  • a loss of a single link (e.g., 18c) by a mobile router is inconsequential if the mobile router has at least a second link (e.g., 18e) with another attachment router that can be used for communications toward the clusterhead.
  • a mobile router 16 enables load sharing of network traffic toward the clusterhead between a mobile router and multiple attachment routers.
  • the use of multiple unequal-cost paths enables a more stable network topology within the ad hoc network, even if individual links may be lost in the layer 2 mesh network.
  • a description of the establishment of the directed acyclic graph (DAG) 20 by the mobile routers 16 is described below with respect to Figures 2-4 .
  • the disclosed embodiment provides an improvement over the neighbor discovery messages described in the above-incorporated application 10/856,809 by enabling the neighbor discovery messages to be sent from mobile routers 16b, 16c, 16d, 16e, and 16f via the multiple attachment routers toward the clusterhead 16a.
  • Each mobile router 16 identifies an adjacently-reachable mobile router as an attached mobile router (i.e., a child router), or an attachment mobile router (i.e., a parent router); consequently, each mobile router 16 is able to determine whether an advertised network prefix is reachable via a parent router or a child router, enabling each router in the path to route a packet accordingly.
  • the attachment routers are able to obtain the neighbor discovery messages via all available paths 18, enabling the construction of a reverse graph 22, illustrated in Figure 1C , that enables the clusterhead 16a to reach mobile routers (e.g., 16f) that are furthest from the clusterhead.
  • a reverse graph 22 illustrated in Figure 1C .
  • FIG. 2 is a diagram illustrating one of the mobile routers 16 (e.g., 16d), according to an embodiment of the present invention.
  • the mobile router 16 includes an attachment resource 24, a neighbor advertisement resource 26, a neighbor discovery resource 28, a router advertisement resource 30, a routing table 32, and a routing resource 34.
  • Figure 2 also provides a logical illustration of egress ports 36 used by the mobile router for attaching to attachment routers based on received router advertisement messages 68 (e.g., 68a, 68b), and transmitting neighbor discovery messages 70 (e.g., 70e and 70f); the mobile router 16 also logically includes ingress ports 38 used by the mobile router 16 for communicating with attached routers by sending router advertisement messages 68c and receiving neighbor discovery messages 70 (e.g., 70b and 70d).
  • received router advertisement messages 68 e.g., 68a, 68b
  • neighbor discovery messages 70 e.g., 70e and 70f
  • logical refers to a mapping by the mobile router 16 between a network address (e.g., "D::10") and a physical layer connection between a source node and destination node (e.g., physical output port, wireless link identifier, etc.) illustrated in the Figures by the double letter designation for source node to destination node (e.g., "D-E" for a link 18f connecting mobile routers 16d and 16e).
  • the attachment resource 24 is configured for receiving router advertisement messages (e.g., 68a, 68b) and selectively attaching with at least one attachment router.
  • the router advertisement resource 30 in each mobile router is configured for outputting an unsolicited router advertisement message 68 that specifies a prescribed address prefix used by the router outputting the router advertisement message; for example, the mobile routers 16a, 16b, 16c, 16d, 16e, and 16f will send out router advertisement messages 68 specifying their respective hexadecimal address prefixes "A::/64", "B::/64", “C::/64", "D::/64", "E::/64", and "F::/64".
  • the attachment resource 24 of any mobile router that wishes to attach to any one of the mobile routers 16a, 16b, 16c, 16d, 16e, and 16f will select a corresponding attachment address within the address prefix advertised by the attachment router.
  • the attachment resource 24 of Figure 2 may select the attachment address "A::14" in response to the router advertisement message 68a advertising the address prefix "A::/64" in order to attach to the mobile router 16a, and the attachment address "C::11" in order to attach to the mobile router 16c in response to the router advertisement message 68b advertising the address prefix "C::/64".
  • the attachment resource 24 completes the attachment to the corresponding attachment router by adding egress routing table entries 40d and 40e, also referred to as default route adjacency entries, to the routing table 32.
  • each default route adjacency entry 40d and 40e in the routing table 32 specifies a default route toward the clusterhead 16a based on a corresponding adjacency established with a next-hop router (16a for entry 40d, and 16c for entry 40e).
  • each default route adjacency entry 40d and 40e does not specify the number of hops to the corresponding parent router because it is a next-hop router; rather, the entries 40d and 40e specify the number of hops to the clusterhead.
  • Figure 3 is a diagram illustrating the method by the attachment resource 24 and the router advertisement resource 30 for attaching to multiple attachment routers based on received router advertisement messages (e.g., 68a, 68b), and advertising router advertisement messages (e.g., 68c), according to an embodiment of the present invention.
  • the steps described in Figure 3 (and Figure 6 , described below) can be implemented as executable code stored on a computer readable medium (e.g., a hard disk drive, a floppy drive, a random access memory, a read only memory, an EPROM, a compact disk, etc.), or propagated via a computer readable medium (e.g., a transmission wire, an optical fiber, a wireless transmission medium utilizing an electromagnetic carrier wave, etc.).
  • a computer readable medium e.g., a hard disk drive, a floppy drive, a random access memory, a read only memory, an EPROM, a compact disk, etc.
  • propagated via a computer readable medium e.g
  • step 42 the attachment resource 24 does not detect any router advertisement messages 68 within a prescribed time interval, and if the mobile router has an existing attachment router in step 44, the attachment resource 24 checks for any expired default route adjacency entries 40 in the routing table 32, and deletes any expired entries in step 48 accordingly. If in step 44 the attachment resource 24 determines that it is a stand-alone mobile router due to the absence of any attachment router (e.g., no default route adjacency entry 40 in the routing table 32), the attachment resource 24 notifies in step 46 the router advertisement resource 30 to set itself as a destination for its own directed acyclic graph, and to advertise its own selected depth.
  • the router advertisement resource 30 will advertise the prefix utilized by the mobile router (e.g., "D::/64" for mobile router 16d), plus the selected depth. Additional details relating to router advertisement messages can be obtained from the above-incorporated applications (U.S. Patent Publication No. US 2004/0032852 and the above-incorporated application 10/856,809 ).
  • the attachment resource 24 determines in step 50 whether the specified depth in the router advertisement message (e.g., 68a, 68b) is determined to be within a prescribed acceptable range for the mobile router 16.
  • a given mobile router 16 may be optimized for prescribed operations; for example, a wireless backbone router may be optimized to operate as a relay in a mesh network, and hence may be configured for a depth range of 2 to 5 hops, whereas distribution routers may be optimized for operating at 5 to 9 hops from the clusterhead and closer to the end nodes of the network. If in step 50 the attachment resource 24 determiners that the advertised depth is outside the acceptable range of the mobile router, the attachment resource 24 discards the router advertisement message in step 52.
  • the attachment resource 24 attaches to the parent router (i.e., the attachment router) by storing in step 53 the default route adjacency entry 40 (e.g., 40e).
  • each default route adjacency entry 40 includes a path identifier 60, namely the attachment address, for reaching the corresponding attachment router (identified by its address prefix 62), an optional link identifier 64 that enables the mobile router to map each attachment address 60 to a corresponding data link 18 for the corresponding attachment router (identified by the corresponding address prefix 62); each default route adjacency entry 40 also specifies the corresponding cost 66 specifying the number of hops required to reach the clusterhead 16a.
  • the neighbor advertisement resource 26 sends in step 54 an updated neighbor advertisement message 70, described below, to each parent router (i.e., attachment router) specified in the default route adjacency entries 40 of the routing table 32.
  • the router advertisement resource 30 also selects in step 56 an advertisement depth (i.e., a depth to be advertised by the mobile router 16) based on adding a selected nonzero increment value to the maximum depth value specified among the default route adjacency entries 40d and 40e: as illustrated in Figure 4 , the router advertisement resource 30 for the mobile router 16d selects the maximum depth value of "2 hops" from the default route adjacency entry 40e, and adds a nonzero increment (e.g., 1 or more) for the selected depth in step 56.
  • an advertisement depth i.e., a depth to be advertised by the mobile router 16
  • the advertisement resource 30 then advertises to other mobile routers 16 by outputting in step 58 a router advertisement message 68c specifying that the clusterhead is reachable via the router prefix "D::/64" 62 at an advertised cost 66 of 3 hops, as illustrated by entries 40f and 40h indicating that the mobile router 16d advertises 3 hops to the clusterhead.
  • the attachment resource 24 mobile router will establish concurrent attachments to respective attachment routers based on the respective advertisement messages (e.g., 68a, 68b) specifying the respective parent depths relative to the clusterhead.
  • the router advertisement resource 30 of each mobile router 16 is configured for advertising reachability to the clusterhead 16a based on specifying within the router advertisement message 68c an advertised depth relative to the clusternead.
  • the "advertised depth” does not necessarily need to be the actual depth of the mobile router relative to the clusterhead, but rather can be greater than the actual depth of the mobile router in order to enable the mobile router to advertise a preferred position within the network topology.
  • each of the mobile routers 16 upon having created at least one default route adjacency entry (40a and 40b in mobile router 16b, 40c in mobile router 16c, 40d and 40e in mobile router 16d, 40f in mobile router 16e, and 40g, 40h, and 40i in mobile router 16f), provides a path toward the clusterhead, such that each mobile router 16 provides a distributed entry 40 that enables formation of the directed acyclic graph 20 of Figure 1B without any central management entity.
  • the directed acyclic graph is formed based on the distributed and independent implementation of the above routing protocols by each of the mobile routers 16, where each mobile router 16 needs to store only the corresponding components 40 in formation of the DAG 20.
  • Figure 5 is a diagram illustrating distribution of neighbor advertisement messages 70 by the mobile routers 16 toward the clusterhead 16a, according to an embodiment of the present invention.
  • each of the attached mobile routers 16b, 16c, 16d, 16e, and 16f identify themselves to their attachment routers by sending neighbor advertisement messages 70 via their egress interfaces 36 and that specify a network-in-node option that a given network prefix 72 (i.e., a "reachable prefix") is reachable via a specified attachment address 74 at an advertised cost 76 (e.g., number of hops).
  • Each neighbor advertisement message 70 also includes, for each specified prefix 72, a corresponding sequence identifier 78 that enables the parent router to validate whether the corresponding attachment address 74 and advertised cost 76 are valid entries relative to prior stored entries in the attachment router.
  • a neighbor advertisement message can be received from different sources, creating the possibility that aged information can be propagated toward the clusterhead 16a.
  • sequence identifier 78 ensures that the parent routers can distinguish between new information and aged information in the neighbor advertisement messages 70.
  • each parent router determines whether a received neighbor advertisement message 70 specifies a new entry or an aged entry based on the sequence identifier 78.
  • received neighbor advertisement messages 70 specifying aged sequence identifiers 78 can be discarded as aged information being propagated by a subtree; however, new sequence identifiers 78 enable the parent router to create a new ingress table entry 80, illustrated in Figures 2 and 7 , that specifies the new routing information, and propagate the new routing information toward the clusterhead in a new neighbor advertisement message 70.
  • the routing resource 34 in each of the mobile routers 16 is configured for routing any packet specifying an unknown destination to its attachment routers; hence, the packet is routed toward the clusterhead 16a until a mobile router can identify the destination address relative to an identified network prefix 72.
  • the disclosed embodiment provides an efficient proactive routing protocol for ad hoc networks that minimizes the necessity of bandwidth and processing requirements to accommodate rapid topology changes by providing rapid convergence.
  • the disclosed embodiment provides a LORA type routing protocol even more efficient than the above-described STAR protocol, while accommodating multiple concurrent attachments by mobile routers to multiple parents, as illustrated by the DAG 20.
  • Figure 6 is a diagram illustrating the method by the neighbor discovery resource 28 in each of the mobile routers 16 of selectively adding ingress table entries 80 to the routing table 32, and the neighbor advertisement resource 26 in each of the mobile routers 16 of outputting the neighbor advertisement message 70 to each of its parent routers based on the contents of the ingress table entries 80, according to an embodiment of the present invention.
  • the method begins in step 82, where the neighbor discovery resource 28 parses a received neighbor advertisement message 70 having been received from a child router (i.e., an attached mobile router) to determine whether the message 70 specifies a new neighbor prefix. For example, assume the neighbor discovery resource 28 of the mobile router 16d receives and parses the neighbor advertisement message 70b of Figure 5 from the attached mobile router 16f.
  • the neighbor discovery resource 28 adds in step 84 a new ingress table entry 80b, illustrated in Figures 2 and 7 , specifying that the reachable prefix "F::/64" 72 specified in the neighbor advertisement message 70b is reachable via the attachment address "D::11" 74 at an advertised cost 76 of 1 hop, and corresponding to the sequence identifier 78 having a value of "10" for the prefix "F::/64".
  • the entry 80b also specifies that the attachment address "D::11" 74 is accessed via link identifier "D-F" 86.
  • each update of the routing table 32 causes the neighbor advertisement resource 26 to send a new neighbor advertisement message 70; hence, the neighbor advertisement resource 26 sends in step 86 an updated neighbor advertisement message 70 to each parent router, specifying each of the reachable prefixes 72 in the ingress table entries 80 and the default prefix (e.g., "D::/64"), their incremented costs 76, and their respective prefixes 78.
  • the default prefix e.g., "D::/64"
  • step 82 the mobile router 16d receives the neighbor discovery message 70d, which specifies the prefix "E::/64" used by the mobile router 16e, but also the prefix "F::/64" based on the mobile router 16e having received the neighbor advertisement message 70c.
  • all the neighbor advertisement messages 70a, 70b, and 70c from the neighbor advertisement resource 26 of the mobile router 16f each specify the same sequence number "10", indicating that each of the neighbor advertisement messages 70a, 70b, and 70c were generated at the same time (i.e., based on the same event).
  • the neighbor discovery resource 28 of the mobile router 16d in response to detecting the neighbor advertisement message 70d, updates the routing table for the prefix "E::/64" as described above with respect to step 84 by adding an ingress table entry 80a.
  • the neighbor discovery resource 28 in the mobile router 16d determines in step 90 whether a newer sequence number is specified (note that any advertisements specifying older sequence numbers are obsolete and therefore discarded). Assuming a new sequence number 78 was specified for an existing prefix 72, if the neighbor discovery resource 28 determines in step 94 that the message 70 specifying the new sequence number 78 also has the best cost relative to any stored entries 80, the neighbor discovery resource 28 deletes the aged entries 80 for reaching the specified prefix via the corresponding child identifier 74 in step 96, and updates the appropriate ingress routing table 80 in step 84 to include the new reachability information.
  • the neighbor discovery resource 28 waits in step 98 a short interval (e.g., 50 milliseconds) in an attempt to collect additional neighbor advertisement messages 70 from the child routers.
  • This wait interval in step 98 ensures that any new neighbor advertisement messages 70 that need to be generated in response to a topology change among the child routers in the subtree have sufficient time to be received by the neighbor discovery resource 28 in the parent router.
  • the neighbor discovery resource 28 determines in step 100 the best advertised cost for reaching a given prefix 72 via a given child router 74, and adds the best advertised cost as a table entry 80.
  • the neighbor discovery resource 28 also deletes in step 100 any entry 80 that still specifies an aged sequence number.
  • the neighbor discovery resource 28 determines in step 92 whether the neighbor advertisement message 70d specifies a better cost 76 than a prior stored cost in an ingress table entry 80 for reaching the specified prefix via the corresponding attached router (i.e., child router); in other words, a parent router may receive more than one neighbor advertisement message 70 from a given child router for the same prefix: normally the newest neighbor advertisement message 70 (as identified by the sequence number 78) has the best metric, which is stored as an ingress table entry 80 as the cost 76 of reaching the specified prefix 72 via the corresponding child router 74.
  • the child router for the specified prefix may specify an improved cost using the same sequence number 78, for example in the case of an intervening router, between the child router and the originating router that utilizes the specified prefix, moving within the directed acyclic graph 20 to a position which is closer to the parent router.
  • the neighbor discovery resource 28 since the neighbor discovery resource 28 would determine that the neighbor advertisement message in step 92 would specify a better cost than the stored cost for the identified prefix via the child router, the neighbor discovery resource 28 would overwrite the corresponding child router entry 80 to specify that the specified prefix is reachable via the specified child router at the improved cost.
  • the neighbor discovery resource 28 is able to accommodate changes in its subnetwork topology that are not detected by the mobile router having originated the first neighbor advertisement message 70.
  • the neighbor discovery resource 28 determines that the neighbor advertisement message 70 specifies the same sequence number (e.g., "10") 78 for a given prefix (e.g., "F::/64") 72, but specifies a different child router (e.g., "D::10") 74, as illustrated by the mobile router 16d of Figure 5 receiving the neighbor advertisement message 70d, the neighbor discovery resource 28 updates in step 102 the routing table 32 by adding an ingress table entry 80c, illustrated in Figure 7 .
  • the same sequence number e.g., "10”
  • a given prefix e.g., "F::/64
  • a different child router e.g., "D::10”
  • An updated neighbor advertisement message 70e is thus output by the neighbor advertisement resource 26 in step 88: the neighbor advertisement message 70e specifies the reachable prefixes 72, namely the native prefix "D::/64", and the reachable prefixes stored in the ingress table entries 80 (e.g., "E::/64" and "F::/64"); the neighbor advertisement resource 26 in step 88 also determines the best costs (i.e., minimum costs) from the ingress table entries 80 (e.g., 1 hop for "E::/64" and 1 hop for "F::/64"), and increments the minimum costs by one to obtain a new advertised cost for the neighbor advertisement message 70e. Also note that the neighbor advertisement resource 26 preserves the sequence number 78 for each corresponding prefix 72, enabling parent routers (e.g., 16c) to validate the routing information that may be received via alternative paths (e.g., neighbor advertisement message 70a).
  • the neighbor advertisement message 70e specifies the reachable prefixes 72, namely the native prefix "
  • each of the mobile routers 16 selectively adds or updates an ingress routing table entry 80 in response to received neighbor advertisement messages 70 based on the sequence number 78 and the associated costs 76, and also in response generates a new neighbor advertisement message 70 that includes the best costs for the reachable prefixes specified in the ingress router table entries 80, incremented by one to accommodate for the next hop.
  • each of the parent routers toward the clusterhead are able to obtain routing information for all of the prefixes that are reachable via the attached routers: the mobile router 16d is able to create ingress table entries 80a and 80c for the respective prefixes "E::/64" and “F::/64" 72 in response to the message 70d, plus a second entry 80b for the prefix "F::/64" 72 in response to the message 70b; and the mobile router 16c is able to create ingress table entries 80 for the prefix "B::/64" 72 from message 70h and prefixes "D::/64", "E::/64", and "F::/64" from message 70e, plus a second entry 80 for the prefix "F::/64" based on the message 70a.
  • the clusterhead 16a is able to create ingress table entries 80 for the prefixes "B::/64", “C::/64”, “D::/64”, “E::/64”, and “F::/64" 72 from message 70i, plus a second entry 80 for the prefix "B::/64" based on the message 70g, plus additional second entries 80 for prefixes "D::/64", “E::/64", and "F::/64" 72 from message 70f.
  • each of the attachment routers 16a, 16b, 16c, 16d, and 16e are able to obtain routing information for the reachable prefix "F::/64" of the furthest child router 16f, plus any intervening prefixes "B::/64", “C::/64", “D::/64", “E::/64", and "F::/64".
  • each of the attachment routers can utilize available multiple paths, consistent with the DAG 20 of Figure 1B , enabling data from the clusterhead 16a to the end child routers 16b or 16f to be transferred via the ad hoc network according to the reverse graph 22 of Figure 1C .
  • mobile routers can operate independently to form a directed acyclic graph toward a clusterhead within a mobile ad hoc network, without the necessity of centralized topology management or additional network-management messages other than unsolicited router advertisement messages by attachment routers (i.e., parent routers) and neighbor advertisement messages by attached routers (i.e., child routers).
  • attachment routers i.e., parent routers
  • neighbor advertisement messages i.e., child routers
  • the distribution of routing information throughout the directed acyclic graph enables a mobile router to determine whether a given packet should be routed on an identified ingress port or an identified egress port, eliminating the necessity of broadcasting packets to neighboring nodes that will only drop the packet; hence, unnecessary packet traffic in the ad hoc network is further minimized. Rather, load balancing can be applied to distribute data traffic across multiple links. While the disclosed embodiment has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Claims (21)

  1. Verfahren in einem mobilen Router (16f), der zum Herstellen von Kommunikationen innerhalb eines Ad-Hoc-Netzes konfiguriert ist, wobei das Verfahren Folgendes umfasst:
    Herstellen (53) von gleichzeitigen Anschlüssen (18g, h, i) zu jeweiligen Anschlussroutern (16c, d, e) basierend darauf, dass jeweilige Bekanntmachungsnachrichten empfangen worden sind, die jeweilige Vater-Tiefen relativ zu einem Clusterkopf (16a) des Ad-Hoc-Netzes spezifizieren;
    Auswählen einer bekannt gemachten Tiefe relativ zu dem Clusterkopf (16a) basierend auf dem Addieren eines vorgeschriebenen Inkrements zu einer maximalen Tiefe der Vater-Tiefen (56); und
    Bekanntmachen der Erreichbarkeit gegenüber dem Clusterkopf (58) basierend auf dem Ausgeben einer Routerbekanntmachungsnachricht, die die ausgewählte bekannt gemachte Tiefe relativ zu dem Clusterkopf spezifiziert.
  2. Verfahren nach Anspruch 1, wobei das Herstellen das Hinzufügen (53) zu einer Routing-Tabelle (32) eines ersten Routing-Tabellen-Eintrags (40a) für jeden Anschlussrouter umfasst und der eine entsprechende Kennung (60) für das Erreichen des entsprechenden Anschlussrouters spezifiziert und der die entsprechende Vater-Tiefe spezifiziert.
  3. Verfahren nach Anspruch 2, wobei jede Kennung (60) eine entsprechende ausgewählte Anschlussadresse ist, die von dem mobilen Router (16f) für den Anschluss an den entsprechenden Anschlussrouter (16c) verwendet wird, wobei die Anschlussadresse innerhalb eines Bereiches eines entsprechenden Adresspräfixes (62) in der entsprechenden Bekanntmachungsnachricht (68c) bekannt gemacht worden ist.
  4. Verfahren nach Anspruch 3, wobei jede Kennung (60) von dem mobilen Router (16f) zu einer entsprechenden Datenverbindung (18h) zu dem entsprechenden Anschlussrouter (16c) gemappt wird.
  5. Verfahren nach Anspruch 2, das des Weiteren Folgendes umfasst:
    Senden zu jedem der Anschlussrouter (16c, d, e) und in Reaktion darauf, dass jeder entsprechende Anschluss hergestellt worden ist, einer ersten Nachbarbekanntmachungsnachricht (70a), die ein erstes erreichbares Präfix (72), das von dem mobilen Router (16f) in der Routerbekanntmachungsnachricht (68c) bekannt gemacht worden ist,
    entsprechende Kosten (76) für das Erreichen des ersten erreichbaren Präfixes und eine entsprechende Sequenzkennung (78) spezifiziert, die eine Validierung des entsprechenden ersten erreichbaren Präfixes (72) relativ zu jeglichen gespeicherten Routereinträgen in den Anschlussroutern ermöglicht.
  6. Verfahren nach Anspruch 5, das des Weiteren Folgendes umfasst:
    Empfangen einer zweiten Nachbarbekanntmachungsnachricht (70b) von einem angeschlossenen mobilen Router (16f), der sich an den mobilen Router angeschlossen hat, wobei die zweite Nachbarbekanntmachungsnachricht (70b) wenigstens ein zweites erreichbares Präfix (72), das über den angeschlossenen mobilen Router (16f) erreichbar ist, entsprechende bekannt gemachte Kosten (76) für das Erreichen des wenigstens einen zweiten erreichbaren Präfixes über den angeschlossenen mobilen Router (16f) und eine entsprechende bekannt gemachte Sequenzkennung (78) spezifiziert; und
    selektives Hinzufügen des wenigstens einen zweiten erreichbaren Präfixes (72), der entsprechenden bekannt gemachten Kosten (76) und der entsprechenden bekannt gemachten Sequenzkennung zu der Routing-Tabelle (32) basierend auf wenigstens einem der Folgenden:
    Feststellen, dass die bekannt gemachte Sequenzkennung (78), die die zweite Nachbarbekanntmachungsnachricht (70b) identifiziert, nicht eine ältere Bekanntmachung des wenigstens einen zweiten erreichbaren Präfixes (72) relativ zu jeglichen entsprechenden gespeicherten Sequenzkennungen spezifiziert, die in der Routing-Tabelle (32) für das wenigstens eine zweite erreichbare Präfix gespeichert sind, und
    Feststellen, dass die bekannt gemachten Kosten (76) geringer als jegliche entsprechende gespeicherte Kosten sind, die in der Routing-Tabelle für das wenigstens eine zweite erreichbare Präfix (72) gespeichert sind;
    wobei das Senden Folgendes umfasst:
    Inkrementieren eines Minimums der gespeicherten Kosten, die der Sequenzkennung (78) entsprechen, die eine letzte Bekanntmachung des wenigstens einen zweiten erreichbaren Präfixes identifiziert, und
    Hinzufügen des wenigstens einen zweiten erreichbaren Präfixes (72), des Inkrements des Minimums der entsprechenden gespeicherten Kosten, und der entsprechenden Sequenzkennung (78) zu der ersten Nachbarbekanntmachungsnachricht (70a).
  7. Verfahren nach Anspruch 6, das des Weiteren Folgendes umfasst:
    Empfangen einer dritten Nachbarbekanntmachungsnachricht von einem zweiten angeschlossenen mobilen Router, der sich an den mobilen Router angeschlossen hat, wobei die dritte Nachbarbekanntmachungsnachricht das wenigstens eine zweite erreichbare Präfix (72), das über den zweiten angeschlossenen mobilen Router erreichbar ist, entsprechende bekannt gemachte Kosten (76) für das Erreichen des wenigstens einen zweiten erreichbaren Präfixes (72) über den zweiten angeschlossenen mobilen Router und eine entsprechende bekannt gemachte Sequenzkennung (78) spezifiziert;
    selektives Aktualisieren der Routing-Tabelle (32), um zu spezifizieren, dass das wenigstens eine zweite erreichbare Präfix (72) über den zweiten angeschlossenen mobilen Router zu den entsprechenden bekannt gemachten Kosten (76) relativ zu der entsprechenden bekannt gemachten Sequenzkennung (78) erreichbar ist;
    Ausgeben einer aktualisierten ersten Nachbarbekanntmachungsnachricht (70a), die spezifiziert, dass das wenigstens eine zweite erreichbare Präfix (72) über den mobilen Router bei dem Inkrement des Minimums der entsprechenden gespeicherten Kosten relativ zu der entsprechenden bekannt gemachten Sequenzkennung (78) erreichbar ist.
  8. Verfahren nach Anspruch 5, wobei das Senden des Weiteren das Hinzufügen zu der ersten Nachbarbekanntmachungsnachricht (70a) von erreichbaren Präfixen (72) umfasst, die über angeschlossene mobile Router (16c, d, e) erreichbar sind, die sich an den mobilen Router (16f) angeschlossen haben, wobei die erste Nachbarbekanntmachungsnachricht für jedes erreichbare Präfix entsprechende Kosten (76) für das Erreichen des entsprechenden erreichbaren Präfixes über den mobilen Router (16f) und eine entsprechende Sequenzkennung (78) spezifiziert, die von wenigstens einem der angeschlossenen mobilen Routern bekannt gemacht worden sind.
  9. Verfahren nach Anspruch 1, wobei das Herstellen das Auswählen jedes einzelnen der Anschlussrouter basierend auf der entsprechenden bekannt gemachten Tiefe umfasst, von der festgestellt wurde, dass sie innerhalb eines vorgeschriebenen akzeptablen Bereichs (50) liegt.
  10. Verfahren nach Anspruch 1, das des Weiteren das Senden zu jedem der Anschlussrouter einer Nachbarbekanntmachungsnachricht (70a) umfasst, die wenigstens ein erreichbares Präfix (72), das durch den mobilen Router (16f) erreichbar ist, entsprechende Kosten (76) für das Erreichen des wenigstens einen erreichbaren Präfixes durch den mobilen Router und eine entsprechende Sequenzkennung (78) spezifiziert, die eine Validierung des entsprechenden wenigstens einen erreichbaren Präfixes (72) relativ zu jeglichen gespeicherten Routereinträgen in den Anschlussroutern ermöglicht.
  11. Mobiler Router (16d), der zum Herstellen von Kommunikationen innerhalb eines Ad-Hoc-Netzes konfiguriert ist, wobei der mobile Router Folgendes umfasst:
    eine Einrichtung zum Herstellen von gleichzeitigen Anschlüssen (24) zu jeweiligen Anschlussroutern basierend darauf, dass jeweilige Bekanntmachungsnachrichten (68a) empfangen worden sind, die jeweilige Vater-Tiefen relativ zu einem Clusterkopf des Ad-Hoc-Netzes spezifizieren; und
    eine Einrichtung zum Bekanntmachen der Erreichbarkeit (30) gegenüber dem Clusterkopf basierend auf dem Ausgeben einer Routerbekanntmachungsnachricht (68c), die eine bekannt gemachte Tiefe relativ zu dem Clusterkopf spezifiziert, wobei die Einrichtung zum Bekanntmachen (30) zum Auswählen der bekannt gemachten Tiefe relativ zu dem Clusterkopf basierend auf dem Addieren eines vorgeschriebenen Inkrements zu einer maximalen Tiefe der Vater-Tiefen konfiguriert ist.
  12. Mobiler Router nach Anspruch 11, der des Weiteren eine Routing-Tabelle (32) umfasst, die für das Speichern von Routing-Tabellen-Einträgen konfiguriert ist, wobei die Einrichtung zum Herstellen von gleichzeitigen Anschlüssen (24) eine Einrichtung zum Hinzufügen zu der Routing-Tabelle eines ersten Routing-Tabellen-Eintrags (40e) für jeden Anschlussrouter umfasst, der eine entsprechende Kennung (60) für das Erreichen des entsprechenden Anschlussrouters spezifiziert und der die entsprechende Vater-Tiefe (66) spezifiziert.
  13. Mobiler Router nach Anspruch 12, wobei jede Kennung (60) eine entsprechende ausgewählte Anschlussadresse ist, die von dem mobilen Router für den Anschluss an den entsprechenden Anschlussrouter verwendet wird, wobei die Anschlussadresse innerhalb eines Bereichs eines entsprechenden Adresspräfixes (62) in der entsprechenden Bekanntmachungsnachricht bekannt gemacht worden ist.
  14. Mobiler Router nach Anspruch 13, wobei der mobile Router für das Mapping jeder Kennung (60) zu einer entsprechenden Datenverbindung (18i) zu dem entsprechenden Anschlussrouter (16f) konfiguriert ist.
  15. Mobiler Router nach Anspruch 12, der des Weiteren Folgendes umfasst:
    eine Nachbarbekanntmachungsressource (26), die für das Senden zu jedem der Anschlussrouter und in Reaktion darauf, dass die Einrichtung zum Herstellen von gleichzeitigen Anschlüssen (24) jeden entsprechenden Anschluss eingerichtet hat, einer ersten Nachbarbekanntmachungsnachricht konfiguriert ist, die ein erstes erreichbares Präfix (72), das von dem mobilen Router in der Routerbekanntmachungsnachricht (68c) bekannt gemacht worden ist, entsprechende Kosten (76) für das Erreichen des ersten erreichbaren Präfixes und eine entsprechende Sequenzkennung (78) spezifiziert, die eine Validierung des entsprechenden ersten erreichbaren Präfixes relativ zu jeglichen gespeicherten Routereinträgen in den Anschlussroutern ermöglicht.
  16. Mobiler Router nach Anspruch 15, der des Weiteren Folgendes umfasst:
    eine Nachbarfindungsressource (28), die für das Parsing einer zweiten Nachbarbekanntmachungsnachricht konfiguriert ist, die von einem angeschlossenen mobilen Router empfangen worden ist, der sich an den mobilen Router (16d) angeschlossen hat, wobei die zweite Nachbarbekanntmachungsnachricht wenigstens ein zweites erreichbares Präfix (72), das über den angeschlossenen mobilen Router erreichbar ist, entsprechende bekannt gemachte Kosten (76) für das Erreichen des wenigstens einen zweiten erreichbaren Präfixes über den angeschlossenen mobilen Router und eine entsprechende bekannt gemachte Sequenzkennung (78) spezifiziert;
    wobei die Nachbarfindungsressource (28) eine Einrichtung zum selektiven Hinzufügen des wenigstens einen zweiten erreichbaren Präfixes (72), der entsprechenden bekannt gemachten Kosten (76) und der entsprechenden bekannt gemachten Sequenzkennung (78) zu der Routing-Tabelle umfasst,
    wobei wenigstens eine der Folgenden verwendet wird:
    eine Einrichtung zum Feststellen, dass die bekannt gemachte Sequenzkennung (78), die die zweite Nachbarbekanntmachungsnachricht identifiziert, nicht eine ältere Bekanntmachung des wenigstens einen zweiten erreichbaren Präfixes (72) relativ zu jeglichen entsprechenden gespeicherten Sequenzkennungen spezifiziert, die in der Routing-Tabelle (32) für das wenigstens eine zweite erreichbare Präfix gespeichert sind, und
    eine Einrichtung zum Feststellen, dass die bekannt gemachten Kosten (76) geringer als jegliche entsprechende gespeicherte Kosten sind, die in der Routing-Tabelle für das wenigstens eine zweite erreichbare Präfix gespeichert sind;
    wobei die Nachbarbekanntmachungsressource für das Senden der ersten Nachbarbekanntmachungsnachricht konfiguriert ist, wobei Folgendes verwendet wird:
    einer Einrichtung zum Inkrementieren eines Minimums der gespeicherten Kosten, die der Sequenzkennung (78) entsprechen, die eine letzte Bekanntmachung des wenigstens einen zweiten erreichbaren Präfixes identifiziert, und
    eine Einrichtung zum Hinzufügen des wenigstens einen zweiten erreichbaren Präfixes, des Inkrements des Minimums der entsprechenden gespeicherten Kosten und der entsprechenden Sequenzkennung zu der ersten Nachbarbekanntmachungsnachricht.
  17. Mobiler Router nach Anspruch 16, wobei:
    die Nachbarfindungsressource (28) für das Parsing einer dritten Nachbarbekanntmachungsnachricht konfiguriert ist, die von einem zweiten angeschlossenen mobilen Router empfangen wird, der sich an den mobilen Router (16d) angeschlossen hat, wobei die dritte Nachbarbekanntmachungsnachricht das wenigstens eine zweite erreichbare Präfix, das über den zweiten angeschlossenen mobilen Router erreichbar ist, entsprechende bekannt gemachte Kosten (76) für das Erreichen des wenigstens einen zweiten erreichbaren Präfixes über den zweiten angeschlossenen mobilen Router und eine entsprechende bekannt gemachte Sequenzkennung (78) spezifiziert;
    die Nachbarfindungsressource (28) für das selektive Aktualisieren der Routing-Tabelle (32) konfiguriert ist, um zu spezifizieren, dass das wenigstens eine zweite erreichbare Präfix über den zweiten angeschlossenen mobilen Router zu den entsprechenden bekannt gemachten Kosten relativ zu der entsprechenden bekannt gemachten Sequenzkennung erreichbar ist;
    die Nachbarfindungsressource (26), die für das Ausgeben einer aktualisierten ersten Nachbarbekanntmachungsnachricht (70c) konfiguriert ist, spezifiziert, dass das wenigstens eine zweite erreichbare Präfix über den mobilen Router bei dem Inkrement des Minimums der entsprechenden gespeicherten Kosten relativ zu der entsprechenden bekannt gemachten Sequenzkennung erreichbar ist.
  18. Mobiler Router nach Anspruch 15, wobei die Nachbarbekanntmachungsressource (26) für das Hinzufügen zu der ersten Nachbarbekanntmachungsnachricht von erreichbaren Präfixen (72) konfiguriert ist, die über angeschlossene mobile Router erreichbar sind, die sich an den mobilen Router (16d) angeschlossen haben, wobei die erste Nachbarbekanntmachungsnachricht für jedes erreichbare Präfix entsprechende Kosten (76) für das Erreichen des entsprechenden erreichbaren Präfixes über den mobilen Router und eine entsprechende Sequenzkennung (78) spezifiziert, die von wenigstens einem der angeschlossenen mobilen Routern bekannt gemacht worden sind.
  19. Mobiler Router nach Anspruch 11, wobei das Herstellen das Auswählen (50) jedes einzelnen der Anschlussrouter basierend auf der entsprechenden bekannt gemachten Tiefe umfasst, von der festgestellt wurde, dass sie innerhalb eines vorgeschriebenen akzeptablen Bereichs liegt.
  20. Mobiler Router nach Anspruch 11, der des Weiteren eine Nachbarbekanntmachungsressource (26) umfasst, die für das Senden zu jedem der Anschlussrouter einer Nachbarbekanntmachungsnachricht konfiguriert ist, die wenigstens ein erreichbares Präfix (72), das durch den mobilen Router erreichbar ist, entsprechende Kosten (76) für das Erreichen des wenigstens einen erreichbaren Präfixes durch den mobilen Router und eine entsprechende Sequenzkennung (78) spezifiziert, die eine Validierung des entsprechenden wenigstens einen erreichbaren Präfixes relativ zu jedem der gespeicherten Routereinträgen in den Anschlussroutern ermöglicht.
  21. Ad-Hoc-Netz, das Folgendes umfasst:
    eine Vielzahl von mobilen Routern (16a-f), die zu einem gerichteten azyklischen Graphen organisiert sind, der auf einen Clusterkopf (16a) gerichtet ist, wobei einer der mobilen Router als der Clusterkopf dient, wobei der gerichtete azyklische Graph angeschlossene mobile Router aufweist, die sich an Anschlussrouter angeschlossen haben, wobei jeder mobile Router einen mobilen Router nach einem der Ansprüche 11 bis 20 umfasst.
EP06774066A 2005-06-28 2006-06-26 Auffindung eines gerichteten, azyklischen graphen und verteilung von netzpräfixinformationen in bezug auf einen clusterkopf in einem mobilen ad-hoc-netz Active EP1897295B1 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP10163840A EP2217024A3 (de) 2005-06-28 2006-06-26 Routerankündigung in einem Ad Hoc Netz

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/167,240 US7860025B2 (en) 2005-06-28 2005-06-28 Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network
PCT/US2006/024913 WO2007002636A1 (en) 2005-06-28 2006-06-26 Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP10163840.1 Division-Into 2010-05-25

Publications (2)

Publication Number Publication Date
EP1897295A1 EP1897295A1 (de) 2008-03-12
EP1897295B1 true EP1897295B1 (de) 2010-08-04

Family

ID=37324578

Family Applications (2)

Application Number Title Priority Date Filing Date
EP10163840A Withdrawn EP2217024A3 (de) 2005-06-28 2006-06-26 Routerankündigung in einem Ad Hoc Netz
EP06774066A Active EP1897295B1 (de) 2005-06-28 2006-06-26 Auffindung eines gerichteten, azyklischen graphen und verteilung von netzpräfixinformationen in bezug auf einen clusterkopf in einem mobilen ad-hoc-netz

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP10163840A Withdrawn EP2217024A3 (de) 2005-06-28 2006-06-26 Routerankündigung in einem Ad Hoc Netz

Country Status (6)

Country Link
US (2) US7860025B2 (de)
EP (2) EP2217024A3 (de)
CN (1) CN101167315B (de)
AT (1) ATE476851T1 (de)
DE (1) DE602006015959D1 (de)
WO (1) WO2007002636A1 (de)

Families Citing this family (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7680951B1 (en) * 2004-06-01 2010-03-16 Massachusetts Institute Of Technology High speed subscribe-and-alert service using content graphs
JP4900891B2 (ja) 2005-04-27 2012-03-21 キヤノン株式会社 通信装置及び通信方法
US7860025B2 (en) * 2005-06-28 2010-12-28 Cisco Technology, Inc. Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network
US7693064B2 (en) * 2005-10-24 2010-04-06 Cisco Technology, Inc. Forwarding packets to a directed acyclic graph destination using link selection based on received link metrics
WO2007053141A1 (en) 2005-11-02 2007-05-10 Thomson Licensing Method for determining a route in a wireless mesh network using a metric based on radio and traffic load
KR100714111B1 (ko) * 2005-12-08 2007-05-02 한국전자통신연구원 ＩＰｖ６ 애니캐스트 서비스 지원을 위한 애니캐스트라우팅 장치 및 방법
CN100534045C (zh) * 2005-12-29 2009-08-26 上海贝尔阿尔卡特股份有限公司 一种在通信网络中实现负荷分配的归属代理装置及其方法
US8457007B2 (en) * 2006-02-24 2013-06-04 Marvell World Trade Ltd. Global switch resource manager
US7593377B2 (en) * 2006-03-29 2009-09-22 Cisco Technology, Inc. Route optimization for a mobile IP network node in a mobile ad hoc network
US9264355B2 (en) * 2006-09-05 2016-02-16 Telefonaktiebolaget L M Ericsson (Publ) Name-address management and routing in communication networks
JP4886463B2 (ja) 2006-10-20 2012-02-29 キヤノン株式会社 通信パラメータ設定方法、通信装置及び通信パラメータを管理する管理装置
US20080107075A1 (en) * 2006-11-07 2008-05-08 Motorola, Inc. System and method to facilitate path selection in a multihop network
US8155007B2 (en) * 2007-01-25 2012-04-10 Cisco Technology, Inc. Path optimization for mesh access points in a wireless mesh network
US8724533B2 (en) * 2007-03-07 2014-05-13 Cisco Technology, Inc. Multicast support by mobile routers in a mobile ad hoc network
US8102775B2 (en) * 2007-03-12 2012-01-24 Cisco Technology, Inc. Joining tree-based networks into an autonomous system using peer connections between the tree-based networks
US8111684B2 (en) 2007-03-30 2012-02-07 Cisco Technology, Inc. Path shortening in a wireless mesh network
US8085686B2 (en) 2007-09-27 2011-12-27 Cisco Technology, Inc. Aggregation and propagation of sensor data within neighbor discovery messages in a tree-based ad hoc network
US8228954B2 (en) * 2007-11-13 2012-07-24 Cisco Technology, Inc. Routing operations using sensor data
US8711729B2 (en) * 2008-01-11 2014-04-29 Cisco Technology, Inc. Host route convergence based on sequence values
US7940668B2 (en) * 2008-03-21 2011-05-10 Cisco Technology, Inc. Method and apparatus to enable an IPe domain through EIGRP
US8396066B1 (en) * 2008-10-07 2013-03-12 BCK Networks, Inc. Routing table for non-uniform random neighbor selection
US7978612B2 (en) * 2008-10-13 2011-07-12 Cisco Technology, Inc. Two-hop relay for reducing distance vector routing information
US7995480B2 (en) * 2008-12-23 2011-08-09 Nokia Corporation Offloading content routing cost from routers
US8799690B2 (en) 2009-06-21 2014-08-05 International Business Machines Corporation Prioritized workload routing in a data center
US9432877B2 (en) * 2009-12-09 2016-08-30 Nec Corporation Information sharing system, communication apparatus, control method and computer program
US20110228696A1 (en) * 2010-03-19 2011-09-22 Navneet Agarwal Dynamic directed acyclic graph (dag) topology reporting
US8363662B2 (en) 2010-03-19 2013-01-29 Cisco Technology, Inc. Alternate down paths for directed acyclic graph (DAG) routing
JP5565032B2 (ja) * 2010-03-29 2014-08-06 ソニー株式会社 無線通信装置、情報配信システム、およびプログラム
US8570962B2 (en) 2010-06-22 2013-10-29 Blackberry Limited Information selection in a wireless communication system
US9385938B2 (en) 2010-06-22 2016-07-05 Blackberry Limited Information distribution in a wireless communication system
US8451744B2 (en) * 2010-08-16 2013-05-28 Cisco Technology, Inc. Partitioning directed acyclic graph (DAG) topologies
GB2484915B (en) * 2010-10-22 2013-10-23 Toshiba Res Europ Ltd Forwarding and routing in sensor networks
US9426035B2 (en) * 2010-12-17 2016-08-23 Cisco Technology, Inc. Data reporting using reporting groups in a computer network
US8503309B2 (en) * 2010-12-17 2013-08-06 Cisco Technology, Inc. Dynamic expelling of child nodes in directed acyclic graphs in a computer network
US8588108B2 (en) 2011-02-21 2013-11-19 Cisco Technology, Inc. Method and apparatus to trigger DAG reoptimization in a sensor network
US8625424B2 (en) * 2011-02-23 2014-01-07 Hp Ventures A/S Method and system for routing information in a network
US9379970B2 (en) * 2011-05-16 2016-06-28 Futurewei Technologies, Inc. Selective content routing and storage protocol for information-centric network
US8891534B2 (en) * 2011-06-20 2014-11-18 Cisco Technology, Inc. Redirecting traffic via tunnels to discovered data aggregators
US8654649B2 (en) 2011-07-27 2014-02-18 Cisco Technology, Inc. Reduced topology routing in shared media communication networks
US9013983B2 (en) 2011-09-12 2015-04-21 Cisco Technology, Inc. Proactive source-based reverse path validation in computer networks
US8862774B2 (en) 2011-09-12 2014-10-14 Cisco Technology, Inc. Dynamic keepalive parameters for reverse path validation in computer networks
CN102377680B (zh) 2011-12-06 2014-03-26 杭州华三通信技术有限公司 路由收敛方法及设备
US9288067B2 (en) * 2012-03-20 2016-03-15 Cisco Technology, Inc. Adjacency server for virtual private networks
US8903929B2 (en) 2012-07-05 2014-12-02 Microsoft Corporation Forgotten attachment detection
US9118539B2 (en) 2012-07-30 2015-08-25 Cisco Technology, Inc. Managing grey zones of unreachable nodes in computer networks
US9246794B2 (en) * 2012-08-03 2016-01-26 Cisco Technology, Inc. Label distribution and route installation in a loop-free routing topology using routing arcs
US9185029B2 (en) 2012-08-17 2015-11-10 Electronics And Telecommunications Research Institute Apparatus and method for processing path management packet
US9258208B2 (en) 2012-10-30 2016-02-09 Cisco Technology, Inc. Multiple path availability between walkable clusters
US8874788B2 (en) * 2012-11-05 2014-10-28 Cisco Technology, Inc. Push-based short-cut requests within a directed acyclic graph
CN104158737B (zh) * 2013-05-15 2017-07-28 华为技术有限公司 一种控制路由信息发布的方法、装置和系统
GB2517477A (en) * 2013-08-22 2015-02-25 Deep Secure Ltd A method of transmitting data structures from one computer to another computer
US9344256B2 (en) 2013-09-18 2016-05-17 Cisco Technology, Inc. Dominating set identification for path computation based on directed acyclic graph membership
US9615307B2 (en) * 2014-01-31 2017-04-04 Futurewei Technologies, Inc. System and method for managing prefixes
US9942909B2 (en) * 2014-02-28 2018-04-10 Futurewei Technologies, Inc. System and method for connection rehoming
WO2015139026A2 (en) 2014-03-14 2015-09-17 Go Tenna Inc. System and method for digital communication between computing devices
US9510347B2 (en) 2014-05-08 2016-11-29 Cisco Technology, Inc. Timeslot distribution in a distributed routing protocol for deterministic wireless networks
CN104320816B (zh) * 2014-09-05 2017-11-24 总装备部工程设计研究总院 单跳网络中基于异步时间片的邻居发现方法
US9479421B2 (en) 2014-09-10 2016-10-25 Cisco Technology, Inc. Dynamic installation of local storing mode paths in a non-storing low-power and lossy network
US9596180B2 (en) 2015-01-06 2017-03-14 Cisco Technology, Inc. Installation of cached downward paths based on upward data traffic in a non-storing low-power and lossy network
US9853883B2 (en) * 2015-05-08 2017-12-26 Cisco Technology, Inc. Device mobility in a mesh network
US10425310B2 (en) 2015-12-23 2019-09-24 Cisco Technology, Inc. Network device mitigation against rogue parent device in a tree-based network
US10796338B2 (en) * 2016-06-01 2020-10-06 Facebook, Inc. Real-time tracking of offline transactions
US10320652B2 (en) 2017-01-09 2019-06-11 Cisco Technology, Inc. Dynamic installation of bypass path by intercepting node in storing mode tree-based network
US10749786B2 (en) 2017-03-01 2020-08-18 Cisco Technology, Inc. Path optimization based on reducing dominating set membership to essential parent devices
US10911314B2 (en) * 2017-10-02 2021-02-02 Servicenow, Inc. Systems and methods for determining entry points for mapping a network
US10944669B1 (en) 2018-02-09 2021-03-09 GoTenna, Inc. System and method for efficient network-wide broadcast in a multi-hop wireless network using packet echos
US10812946B2 (en) 2018-02-22 2020-10-20 Cisco Technology, Inc. Reliable link layer multicast in a low power wide area network
WO2020023909A1 (en) 2018-07-27 2020-01-30 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks
EP3606280B1 (de) * 2018-08-02 2022-10-05 Mitsubishi Electric R&D Centre Europe B.V. Verfahren zur verwaltung eines netzwerks und vorrichtung zur implementierung davon
EP3849135B1 (de) * 2018-09-30 2022-08-24 Huawei Technologies Co., Ltd. Verfahren und vorrichtung zum lastausgleich und zur nachrichtenumordnung in einem netzwerk
US11082344B2 (en) 2019-03-08 2021-08-03 GoTenna, Inc. Method for utilization-based traffic throttling in a wireless mesh network
GB2592065A (en) * 2020-02-16 2021-08-18 Samsung Electronics Co Ltd UE in restricted service area
JP7138154B2 (ja) * 2020-12-15 2022-09-15 本田技研工業株式会社 通信制御装置、移動体、通信制御方法、及びプログラム
US11483684B1 (en) * 2021-05-07 2022-10-25 T-Mobile Usa, Inc. Session recovery from dedicated bearer failure

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5251205A (en) * 1990-09-04 1993-10-05 Digital Equipment Corporation Multiple protocol routing
US5881246A (en) * 1996-06-12 1999-03-09 Bay Networks, Inc. System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router
US7006453B1 (en) * 2000-03-14 2006-02-28 Lucent Technologies Inc. Location based routing for mobile ad-hoc networks
US20020141346A1 (en) * 2000-08-31 2002-10-03 The Regents Of The University Of California Method for approximating minimum delay routing
US7184421B1 (en) 2001-12-21 2007-02-27 Itt Manufacturing Enterprises, Inc. Method and apparatus for on demand multicast and unicast using controlled flood multicast communications
US6870846B2 (en) * 2002-04-29 2005-03-22 Harris Corporation Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)
US7203175B2 (en) * 2002-08-15 2007-04-10 Cisco Technology, Inc. Arrangement for router attachments between roaming mobile routers in a mobile network
US7190678B2 (en) 2002-10-28 2007-03-13 Cisco Technology, Inc. Arrangement for router attachments between roaming mobile routers in a clustered network
GB0230330D0 (en) * 2002-12-31 2003-02-05 British Telecomm Communications routing
US6865184B2 (en) 2003-03-10 2005-03-08 Cisco Technology, Inc. Arrangement for traversing an IPv4 network by IPv6 mobile nodes
US7701858B2 (en) 2003-07-17 2010-04-20 Sensicast Systems Method and apparatus for wireless communication in a mesh network
US7428221B2 (en) 2004-06-01 2008-09-23 Cisco Technology, Inc. Arrangement for providing network prefix information from attached mobile routers to a clusterhead in a tree-based ad hoc mobile network
GB0412847D0 (en) * 2004-06-09 2004-07-14 Nortel Networks Ltd Method of applying the radius restricted routing scheme in a communication network
US7668146B2 (en) * 2004-12-20 2010-02-23 Connectivities Llc Internet-oriented ad-hoc network
US7366111B2 (en) 2005-04-08 2008-04-29 Cisco Technology, Inc. Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
US7567577B2 (en) 2005-06-28 2009-07-28 Cisco Technology, Inc. Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof
US7860025B2 (en) * 2005-06-28 2010-12-28 Cisco Technology, Inc. Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network

Also Published As

Publication number Publication date
CN101167315A (zh) 2008-04-23
DE602006015959D1 (de) 2010-09-16
US20060291404A1 (en) 2006-12-28
ATE476851T1 (de) 2010-08-15
US20110080853A1 (en) 2011-04-07
US7860025B2 (en) 2010-12-28
EP1897295A1 (de) 2008-03-12
CN101167315B (zh) 2013-02-13
WO2007002636A1 (en) 2007-01-04
EP2217024A3 (de) 2013-01-16
US8441958B2 (en) 2013-05-14
EP2217024A2 (de) 2010-08-11

Similar Documents

Publication Publication Date Title
EP1897295B1 (de) Auffindung eines gerichteten, azyklischen graphen und verteilung von netzpräfixinformationen in bezug auf einen clusterkopf in einem mobilen ad-hoc-netz
US7366111B2 (en) Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
EP1757032B1 (de) Anordnung zur bereitstellung von netzvorwahlinformationen von angeschlossenen mobilen routern zu einem clusterkopf in einem baumbasierten mobilen ad-hoc-netzwerk
US7593377B2 (en) Route optimization for a mobile IP network node in a mobile ad hoc network
US7693064B2 (en) Forwarding packets to a directed acyclic graph destination using link selection based on received link metrics
EP1969776B1 (de) Aggregation von Ad-hoc-Knoten entsprechend einer Aggregationshierarchie
US7333461B2 (en) Arrangement in a router of a mobile network for generating a local router prefix for anonymous route connections
US7209978B2 (en) Arrangement in a router of a mobile network for optimizing use of messages carrying reverse routing headers
US7649852B2 (en) Arrangement for router attachements between roaming mobile routers in a clustered network
US20060291485A1 (en) Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof
SreeRangaRaju et al. ZRP versus AODV and DSR: a comprehensive study on ZRP performance using QualNet simulator
JP5409419B2 (ja) モバイルルータアドホックネットワーク通信システムのモバイルルータ
KR101029497B1 (ko) 리엑티브 방식의 라우팅 프로토콜을 사용하는 이동 애드혹 네트워크 상에서 경로탐색 과정을 통한 에이알피 프로토콜 대체 방법

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20071011

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
RIN1 Information on inventor provided before grant (corrected)

Inventor name: THUBERT, PASCAL

Inventor name: WETTERWALD, PATRICK

Inventor name: RIBIERE, VINCENT JEAN

17Q First examination report despatched

Effective date: 20080505

DAX Request for extension of the european patent (deleted)
RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 40/24 20090101AFI20090702BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 602006015959

Country of ref document: DE

Date of ref document: 20100916

Kind code of ref document: P

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20100804

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20100804

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101204

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101206

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101104

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101105

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101115

26N No opposition filed

Effective date: 20110506

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006015959

Country of ref document: DE

Effective date: 20110506

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110630

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110630

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110626

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110626

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100804

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 17

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240619

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240618

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240627

Year of fee payment: 19