Connect public, paid and private patent data with Google Patents Public Datasets

Unified routing scheme for ad-hoc internetworking

Download PDF

Info

Publication number
US20020049561A1
US20020049561A1 US09960065 US96006501A US2002049561A1 US 20020049561 A1 US20020049561 A1 US 20020049561A1 US 09960065 US09960065 US 09960065 US 96006501 A US96006501 A US 96006501A US 2002049561 A1 US2002049561 A1 US 2002049561A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
node
routing
ir
link
network
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.)
Abandoned
Application number
US09960065
Inventor
J. Garcia-Luna-Aceves
David Beyer
Thane Frivold
Original Assignee
Garcia-Luna-Aceves J. Joaquin
Beyer David A.
Frivold Thane J.
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

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/54Organization of routing tables
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/08Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248Connectivity information update
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/28Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
    • Y02D70/00
    • Y02D70/142
    • Y02D70/22
    • Y02D70/30
    • Y02D70/324
    • Y02D70/34

Abstract

The invention provides a method and apparatus for determining cost metrics for routing in a computer network. The cost metrics may include a measure of the quality of a wireless communication link within the computer network. Such a metric may be used in determining which links of the network to utilize. For example, one may examine local routing information maintained by a first node of a computer network to determine whether alternate paths exist to a neighbor node of the first node, using a sequence of one or more links other than a candidate link through the computer network and compute a link quality of the candidate link. Then, if no alternate path exists to the neighbor node, or the link quality of the candidate link exceeds a defined threshold value, the candidate link may be accepted. If one or more alternate paths do exist to the neighbor node, then by comparing link qualities of the links along each of the alternate paths with the link quality of the candidate link one may decide to accept the candidate link if the link quality of the candidate link compares favorably with the link qualities of the links on the alternate paths. The metrics may also include an indication of the type of power available to the node, the power state of the node, or an indication of whether the node is an anchor for the computer network.

Description

  • [0001]
    This application is a divisional of U.S. patent application Ser. No. 09/221,228, filed Dec. 23, 1998.
  • STATEMENT OF GOVERNMENT LICENSE RIGHTS
  • [0002] The United States Government has a paid-up license in portions of this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of Contract No.: DAAH01-97-C-R124, awarded by the U.S. Army Missile Command.
  • FIELD OF THE INVENTION
  • [0003]
    The present invention relates to routing protocols in networks and, more particularly, to routing protocols for ad-hoc networks, in which both routers and hosts may be mobile, and in which routers may be connected to both hosts and networks.
  • BACKGROUND
  • [0004]
    Packet-radio technology has the potential of becoming a major component of the global information infrastructure, at least in part because it requires no wiring and need not require third-party service providers or the configuration of forwarding tables. However, the routing approaches that have been proposed or implemented to date for the Internet or ad-hoc networks (i.e., those networks which do not have a preconceived topology) do not allow for non-technical users to install and operate such networks (or any multi-hop packet-radio networks) as seamless extensions of the Internet.
  • [0005]
    In traditional Internet routing approaches, bridges or routers are used to forward data packets using media access control (MAC)- or network-level addresses, respectively. Performing routing at the link level using transparent bridges has the advantage that limited configuration is required for the bridges and hosts used in the internetwork; furthermore, the frames forwarded by bridges can encapsulate any type of network-level protocol (e.g., Internet protocol (IP) and Internet packet exchange (IPX)). The disadvantage of using transparent bridges for network interconnection is that both data and control packets (frames) are sent over a spanning tree to avoid looping of packets, which means that data packets are sent over paths longer than the shortest paths and the available bandwidth is underutilized. Furthermore, in an ad-hoc network, maintaining a spanning tree may incur excessive overhead depending on mobility. On the other hand, performing routing at the network level facilitates aggregation of routing updates, and permits data packets to be sent over the shortest paths using the available links efficiently. The disadvantages of this approach are that routers have to be configured with appropriate addressing information before they can start forwarding packets, network-level addresses have to be carefully allocated, and the router must understand which network-level protocol is being routed (e.g., IP or IPX).
  • [0006]
    All routing protocols proposed and implemented to date for either ad-hoc networks or the Internet fall into two major categories: table-driven and on-demand routing protocols. In a table-driven routing protocol, a router maintains a routing-table entry for each destination in the network and runs a routing-table update algorithm to maintain up-to-date entries. Table-driven routing protocols have been proposed based on topology broadcast or the dissemination of vectors of distances. In an on-demand routing protocol, a router maintains routing-table entries for only those destinations with which it needs to communicate. A typical on-demand routing protocol requires a router to use a flood search method to determine the shortest paths to destinations for which it does not currently have a routing-table entry.
  • [0007]
    Each type of protocol has its advantages and disadvantages. For example, a table-driven routing protocol supports datagram traffic very efficiently and can detect network partitions very quickly; however, each router must exchange routing information for all the destinations in the network or internetwork, which may be taxing on the battery life of tetherless wireless routers. By contrast, an on-demand routing protocol does not require routers to send updates regarding those destinations with which they do not communicate; however, routers need to search for an unknown destination before they are able to forward data to it. Consequently, on-demand routing approaches are typically not well suited for datagram traffic. On-demand routing also incurs much more control traffic than table-driven routing protocols when the network or internetwork becomes partitioned or routers fail, due to the resulting repeated generation of flood search packets, which only discover that the destinations are unreachable.
  • [0008]
    Routing in ad-hoc networks is typically accomplished by treating the entire ad-hoc network as an opaque sub-network using a routing protocol within the sub-network to forward data packets from one end of the sub-network to the other. In such methods, the ad-hoc network simply looks like a link (or set of links) to the IP layer. Although this approach is appealing at first glance, it does not avoid any of the address assignment, router configuration, and management issues associated with Internet routing. Thus, what is needed is a new approach for routing within ad-hoc networks.
  • SUMMARY OF THE INVENTION
  • [0009]
    In one embodiment, routing table update messages that include both network-level addresses and other (e.g., link-level, possibly MAC-level) addresses of nodes of a computer network are exchanged among the nodes of the computer network. The update messages may exchanged in response to an indication that a new node has been added to the computer network or that one of the nodes has been dropped from the computer network (e.g., that communication with the node has been lost). Further, a routing table maintained by a first one of the nodes of the computer network may be updated in response to receiving one or more of the update messages.
  • [0010]
    The routing table is preferably updated by selecting a next node to a destination node of the computer network only if every intermediate node in a path from the next node to the destination node satisfies a set of nodal conditions required by the first node for its path to the destination node and the next node offers the shortest distance to the destination node and to every intermediate node along the path from the next node to the destination node. The shortest distance to the destination node may be determined according to one or more link-state and/or node-state metrics regarding communication links and nodes along the path to the destination node. Also, the nodal characteristics of the nodes of the computer system may be exchanged between neighbor nodes, prior to updating the routing table. Preferred paths to one or more destination nodes may be computed according to these nodal characteristics, for example using a Dijkstra shortest-path algorithm.
  • [0011]
    In some cases, the exchange of routing table update messages may involve exchanging node distance and node predecessor information among the nodes of the computer network. Such information may be included in the update messages and individual entries in each update message may be processed in order at a receiving node of the computer network. Transmitting nodes of the computer network preferably order the individual entries in the update messages according to distances to destination nodes. Further, for each entry of one of the update messages, one of the receiving nodes may determine whether an implicit path to one of the destination nodes defined by the node distance and node predecessor information is free of loops. In yet further cases, a routing table entry for a destination node that was established according to path information provided by a first neighbor node, at a first of the nodes of the computer network may be updated according to information included within at least one of the update messages received from a second neighbor node.
  • [0012]
    In a further embodiment, routing tables for a computer network may be updated by disseminating routing table update information regarding nodes of the computer network that are well known throughout the network. In such cases, the update information includes both network-level and link-level addresses for the well-known nodes. Moreover, further updating may be accomplished by transmitting routing table update information regarding nodes that are not well known throughout the computer network in response to search queries regarding such nodes. In some cases, the search queries are flooded throughout the computer network on a best-effort basis. New search queries may be treated as network-level queries and retransmitted search queries treated as host-level search queries.
  • [0013]
    Upon receipt of one of the search queries, a first node of the computer network may search a query cache to determine whether it has already processed that search query. In addition, the first node may determine whether that search query is a host-level search query or not.
  • [0014]
    If the first node determines that the search query is a host-level query, the first node may respond to the search query if it has not already done so and if it is able to provide path information to a destination specified in the search query. Alternatively, if the first node has not already responded to the search query but does not have the path information to the destination, the first node may transmit a local request for the path information to local hosts associated with the first node. In those cases where the first node receives a local response to the local request, the first node transmits the path information from the local response in response to the search query. Otherwise, the first node transmits the search query to neighbor nodes of the computer network if there are any. On the other hand, if the first node determines that the search query is not a host-level query, the first node either transmits a response to the search query if the first node has path information to a destination specified in the search query or forwards the search query to neighbor nodes of the computer network, if any.
  • [0015]
    The routing table update information regarding nodes that are not well known throughout the computer network may be provided as search query response messages by one or more nodes of the computer network having path information relating to the nodes that are the subject of the search queries. In such cases, one of the nodes having the path information adds a path entry for itself to the path information before providing an associated search query response message. The path entry includes a network-level and a link-level address of the node having the path information and may further include a network-level and a link-level address of a node from which the node having the path information received the search query.
  • [0016]
    Preferably, at least one of the nodes of the computer network maintains a table of the search queries it has transmitted. Such a table of search queries may include an indication of whether a particular search query is a network-level search query or a host-level search query.
  • [0017]
    Note, however, that network-level search queries may be retransmitted as host-level search queries within the computer network if no responses are received to network-level searches.
  • [0018]
    In yet another embodiment, a routing table in a computer network may be updated by specifying a path from an origin of a search query to a destination in the computer network that is the subject of the search query, the path including both network-level and link-level addresses of the destination. The path is relayed between nodes of the computer network, from a first node that produces the path to the origin of the search query. However, any one node of the computer network relays the path only if it is included in the path between the origin of the search request and the destination. Relaying nodes of the computer network that receive the path, may update respective routing tables to include the path but only retain the path in their routing tables if the path is associated with a node that is well known throughout the computer network. Otherwise, the path is removed from their respective routing tables after a specified period of time.
  • [0019]
    Still another embodiment provides routing table having a network-level address of a destination node of a computer network and a link-level address of the destination node. The network-level address and link-level address are preferably included in a single entry of the routing table regarding the destination node. The network-level address is preferably an Internet protocol (IP) address, while the link-level address is preferably a medium access control (MAC) address.
  • [0020]
    The single entry in the routing table may further include path information (e.g., distance and/or predecessor information) regarding the destination node. Such distance information may be based on link-state information and/or node-state information of a path within the computer network. In some cases, the path is a shortest path between the destination and a node that maintains the routing table. The predecessor information refers to a node of the computer network that is the second-to-last hop from the node that maintains the routing table to the destination along the path.
  • [0021]
    Generally, the routing table is maintained by a router, which may also have a distance table that is configured to store routing tree information received by the router from neighbor nodes of the computer network. The router may further have a message retransmission list that is configured to include information regarding routing table update messages transmitted by the router to the neighbor nodes.
  • [0022]
    Still additional embodiments provide various cost metrics for a computer network. Among these are measures of interference over time to neighbor nodes of a first node of the computer network per data bit transmitted on a communication link used by the first node. Such a metric may be estimated using the RF transmit power used by the first node for the communication link, the link data rate and the RF-path loss on the communication link, which is determined by a neighbor node comparison of the RF transmit power to a received signal strength at the neighbor node.
  • [0023]
    Another cost metric may be a measure of node energy consumed per data bit for transmissions over a communication link within the computer network. Here, node energy is computed so as to account for all power not used by a node in a non-transmitting state.
  • [0024]
    A further cost metric may be a measure of the quality of a wireless communication link within the computer network. Such a metric may find use in determining which links of the network to utilize. For example, one may examine local routing information maintained by a first node of a computer network to determine whether alternate paths exist to a neighbor node of the first node, using a sequence of one or more links other than a candidate link through the computer network and compute a link quality of the candidate link. Then, if no alternate path exists to the neighbor node, or the link quality of the candidate link exceeds a defined threshold value, the candidate link may be accepted. If one or more alternate paths do exist to the neighbor node, then by comparing link qualities of the links along each of the alternate paths with the link quality of the candidate link one may decide to accept the candidate link if the link quality of the candidate link compares favorably with the link qualities of the links on the alternate paths.
  • [0025]
    Such a favorable comparison may be one wherein the link quality of the candidate link is equal to or better than a link quality of a worst one of the link qualities of the links on the alternate paths, or one wherein the link quality of the candidate link is equal to or better than a path quality function of the links along the alternate paths. For example, if the link quality of any link in the computer network is equal to the probability of success for each packet transmitted over that link. Then the path quality function of the links along the alternate paths comprises the products of the link qualities for each of the links on the alternate paths.
  • [0026]
    Metrics for individual nodes of a computer network may also be used. For example, metrics, which are an indication of the type of power available to the node, the power state of the node, or an indication of whether the node is an anchor for the computer network.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0027]
    The present invention is illustrated by way of example, and not limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which:
  • [0028]
    [0028]FIG. 1 illustrates an ad-hoc network that includes a number of sub-networks and an interconnection to the Internet through a router maintained by an Internet service Provider (ISP);
  • [0029]
    [0029]FIG. 2A illustrates another example of an ad-hoc network topology, including node IP-level and MAC-level addresses;
  • [0030]
    [0030]FIG. 2B illustrates a routing tree communicated by one of the nodes of the ad-hoc network illustrated in FIG. 2A in accordance with one embodiment of the present invention;
  • [0031]
    [0031]FIG. 3 illustrates an example of a routing table that may be maintained by an Internet Radio (IR) according to one embodiment of the present invention;
  • [0032]
    [0032]FIG. 4 illustrates an example of a distance table that may be maintained by an IR according to one embodiment of the present invention;
  • [0033]
    [0033]FIG. 5 illustrates an example of a message retransmission list that may be maintained by an IR according to one embodiment of the present invention;
  • [0034]
    [0034]FIG. 6 illustrates an example of a routing-table update message according to one embodiment of the present invention;
  • [0035]
    [0035]FIG. 7 illustrates an example of a search query according to one embodiment of the present invention;
  • [0036]
    [0036]FIG. 8 illustrates an example of a search query response according to one embodiment of the present invention;
  • [0037]
    [0037]FIG. 9 illustrates a network having a topology useful for understanding the routing table update mechanisms found in an embodiment of the present invention; and
  • [0038]
    [0038]FIG. 10 illustrates an example of a query sent table maintained by a node of an ad-hoc network in accordance with one embodiment of the present invention.
  • DETAILED DESCRIPTION
  • [0039]
    Presented below is an Ad-hoc Internet Routing (AIR) protocol that provides a unified scheme for ad-hoc internetworking. Because supporting traffic to and from the Internet is likely to be a key requirement of ad-hoc networks, the hosts and networks attached to the packet radios with which the ad-hoc network is built (which will be referred to as Internet Radios or IRs) need Internet addresses. These Internet addresses are needed even if the IRs support routing at the sub-network level or link level within the ad-hoc network. Assigning Internet addresses to IRs also provides benefits from the standpoint of network management, because it enables the use of standard and emerging network management products based on the simple network management protocol (SNMP).
  • [0040]
    AIR enables ad-hoc internets by supporting routing at the IP layer rather than below it. Thus, AIR advances the state of the art in routing in ad-hoc networks in a number of ways. For example, AIR uses both medium-access control (MAC) addresses and Internet addresses while providing shortest paths to known destinations. For some embodiments, the shortest (or preferred) path calculations may be made on the basis of link-cost metrics and/or node-cost metrics. Further, AIR permits an IR to act as the proxy destination node for all the hosts attached to the IR, or to act as an intermediary between senders and receivers of Address Resolution Protocol (ARP) requests. These address-mapping services allow the hosts attached to the IRs to perceive the ad-hoc internet as a single broadcast LAN. Also, AIR updates routing-table entries using both source- and destination-based routing-table update mechanisms.
  • [0041]
    AIR is discussed in greater detail below, with reference to certain illustrated embodiments. However, upon review of this specification, those of ordinary skill in the art will recognize that AIR may find application in a variety of systems. Therefore, in the following description the illustrated embodiments should be regarded as exemplary only and should not be deemed to be limiting in scope.
  • [0042]
    Overview of AIR Protocol
  • [0043]
    AIR is well suited for an ad-hoc internet that provides a seamless extension of the IP Internet to the ad-hoc wireless environment. In contrast to the IP Internet, mobility of hosts and routers, and changes to link- and/or node-costs are the rule, rather than the exception, in an ad-hoc internet. FIG. 1 illustrates aspects of an exemplary ad-hoc network that will assist in understanding the remaining discussion.
  • [0044]
    Ad-hoc network 10 may be considered as a number of sub-networks 12 a, 12 b, 12 c, which provide an extension of the Internet 14 through a number of IRs 16 a-16 i. Each IR 16 a-16 i may be a packet radio with an assigned IP address. In general, the IRs 16 a-16 i operate over a single channel using spread spectrum wireless communication techniques common in the art. For example, the IRs 16 a-16 i may operate in one of the unregulated UHF frequency bands, thereby obviating the need for operating licenses. At each IRs 16 a-16 i, AIR may run on top of a User Datagram Protocol (UDP), similar to the Routing Information Protocol (RIP). As the figure illustrates, an IR is essentially a wireless IP router; with the exceptions that: AIR substitutes for traditional internet routing protocols like RIP or the open shortest path first (OSPF) protocol, the AIR routing protocol interacts through shared tables with the link-layer protocols in order to reduce control traffic needed to maintain routing tables, and the AIR channel access protocols are designed for the broadcast radio links 24 a-24 j of ad-hoc network 10.
  • [0045]
    Coupling of ad-hoc network 10 to the Internet 14 is achieved through a router 18, which may be operated by an Internet Service Provider (ISP). As shown, a single ISP may operate a LAN 20 to which multiple IRs are connected. In such a scheme, IRs 16 a and 16 b may act as “AirHeads”, providing gateway service to Internet 14 via router 18. Some IRs, e.g., lRs 16 d and 16 e of FIG. 1, may be associated with hosts, 22 a, 22 b and 22 c that can be accessed by any Internet user through ad-hoc network 10.
  • [0046]
    AIR is based on a routing-table updating approach as introduced in the Wireless Internet Routing Protocol (WIRP) described by J. J. Garcia-Luna-Aceves et al., “Wireless Internet gateways,” Proc. IEEE MILCOM 97, Monterey, Calif., Nov. 2-5, 1997, pp. 1271-76; and S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Proc. IEEE INFOCOM 97, Kobe, Japan, Apr. 1997. However, AIR extends WIRP in a number of ways. First, AIR allows IRs to use both MAC-level (i.e., link level) and Internet (i.e., IP) addresses in the routing tables. Second, AIR uses both table-driven and on-demand mechanisms to update routing-table entries. Third, AIR supports proxy ARP services to the hosts attached to IRs. Fourth, AIR uses both link metrics and node characteristics to compute paths to destinations.
  • [0047]
    Another difference between AIR and WIRP is that AIR uses the services provided by a dedicated neighbor management protocol, which maintains the status of an IR's connectivity with its neighbors. In contrast, WIRP implements its own mechanisms to ascertain the connectivity of an IR with its neighbors.
  • [0048]
    Each IR communicates a hierarchical routing tree to its neighbors in an incremental fashion. The hierarchical routing tree reported by an IR consists of all the preferred paths by the IR to each network, IR, and host with which the IR needs to communicate or to which it needs to forward traffic according to requests received from neighbor IRs. An entire remote IP network is simply a node in the routing tree. FIG. 2A shows a simple network topology and FIG. 2B shows the routing tree that IR (or node) n3 notifies incrementally to its neighbors.
  • [0049]
    The way in which an IR disseminates routing information about a given destination is determined by the value of a dissemination-type flag in the routing table. Changes to routing-table entries corresponding to IP networks or nodes where servers are located are typically disseminated throughout the ad-hoc internet, while changes to routing-table entries corresponding to individual IRs and hosts are disseminated on demand. FIG. 2B illustrates this point. Note that the routing tree notified by node n3 does not include node n0, because n0 is not a node that must be known throughout the ad-hoc internet and node n3 does not need to communicate with or forward data through n0. It is also important to note that the addresses used to identify nodes in the ad-hoc internet are both IP addresses and MAC-level addresses.
  • [0050]
    IRs exchange their hierarchical routing trees incrementally by communicating only the distance and second-to-last hop (predecessor) to each destination. In the case of destinations within or directly attached to an IR's own IP network, the second-to-last hop consists of an IR (i.e., a host-level IP Address). In the case of a remote IP network known to the IR and not directly attached to the IR's own IP network, the predecessor consists of another IP network. Hence, internet routing in AIR does not require an IR to store more routing-table entries than an Internet routing protocol like RIPv2 would, for example. An IR communicates updates to its routing tree by means of routing-table updates sent as a result of connectivity changes, periodically, or in response to on-demand search queries. AIR permits IRs to search for paths to known IP addresses obtained through a name server, or to search for the actual location of an IP host that moves from one IR to another and remains quiet. Connectivity changes are communicated to AIR by the neighbor protocol implemented in the IR.
  • [0051]
    Routing information is exchanged among neighboring IRs by means of update messages, search queries, and replies to such queries. Update messages are used to update routing-table entries that must be known by all IRs in the ad-hoc internet. Search queries are used to update routing-table entries on a demand basis.
  • [0052]
    From the standpoint of host-level involvement, it is not efficient to require that all hosts in a large ad-hoc internet receive an ARP request whenever any given host sends such a request. Although IRs permit hosts to operate as if they were attached to a common LAN, IRs have much more routing information than do traditional transparent bridges. In particular, they know about both MAC and IP-level addresses of destinations. Accordingly, as long as IRs know which hosts are currently attached to them, they need not ask hosts to answer ARP requests, because the IRs attached to the destination hosts can answer for them. In some cases hosts that are already configured may relocate and remain silent after moving from one IR to another. In such cases, there may be no IR that can provide the correct mapping of IP to MAC address and the ARP request may have to be answered by the hosts themselves.
  • [0053]
    Two classes of search queries may be defined in AIR: IR-level searches and host-level searches. In an IR-level search, an IR receiving the query processes the query without forwarding any request to its attached hosts, if it has any. In a host-level search, an IR receiving the query processes the query as in the case of an IR-level search and also sends an ARP request to its attached hosts. IR-level searches are likely to suffice most of the time, because IRs know their attached hosts as soon as the hosts send ARP requests to the associated IRs. Accordingly, IRs may attempt IR-level searches before attempting host-level searches.
  • [0054]
    AIR can be functionally divided into three main components: the proxy and indirect ARP mechanisms, the routing-table update algorithm, and the reliable exchange of updates. Each of these functional components is addressed in the following sections.
  • [0055]
    II. Information Maintained in AIR
  • [0056]
    For the purposes of routing, each IR maintains a routing table, a distance table, and a message retransmission list. As shown in FIG. 3, the entry for a destination j in IR i's routing table includes the destination's IP address, its MAC address, or both, the distance to the destination (Dij), the successor (Sij), and the predecessor (Pij) along the preferred path (e.g., the shortest path) to the destination. The predecessor to a destination is the second-to-last hop along the preferred path.
  • [0057]
    The routing table also maintains two markers used to update the routing-table entries, a path traversal tag and a dissemination-type flag. The path-traversal tag for a destination j specifies whether the entry corresponds to a simple path (tag=correct), a loop (tag=error) or a destination that has not been marked (tag=null). This tag is used to reduce the number of routing table entries that need to be processed after each input event impacting the routing table. Also for destination j, the dissemination-type flag determines how the IR maintains the entry and how it disseminates updates to the entry. If the value of the flag is set (e.g., to one), the destination is well known in the ad-hoc internet. In such cases, the IR recognizes that it must keep an entry for the destination at all times, and that it must report changes to the distance or predecessor to the destination. If the value of the dissemination-type flag is not set (i.e., is zero), the IR does not report changes to the distance or predecessor information for that destination in update messages to its neighbors; rather, the IR keeps the entry for a finite amount of time given by an age field that is managed locally.
  • [0058]
    The routing table of a given IR contains an entry for a subset of all the destinations in the ad-hoc internet. The IR maintains routing-table entries for only those destinations with which it has to communicate or to which it has to relay information.
  • [0059]
    As illustrated in FIG. 4, the distance table of an IR maintains the routing-tree information reported by each of its neighbor IRs. Each entry reported by a neighbor IR in an update message or a search query consists of a set of addresses for the destination (typically a MAC address, an IP address, or both), the distance to the destination, and the predecessor in the path to the destination. More generally, the set of addresses may include a network-level address and another address, for example a link-level address (e.g., addresses defined by the IEEE 802 family of standards for computer networks) or a sub-network address, where appropriate.
  • [0060]
    An underlying neighbor protocol may be used to update the routing table indicating changes in connectivity with neighbors. When the neighbor protocol detects a new neighbor or loss of connectivity with a neighbor, it updates an entry for the IR or host in the routing table and notifies AIR of the need to update the distance table and predecessor information in the routing table. The neighbor protocol may also provide an IR with information about the cost of a link with a neighbor IR in both directions.
  • [0061]
    As illustrated in FIG. 5, a Message Retransmission List (MRL) may be used to specify one or more retransmission entries. For example, a given MRL entry may specify: the update message that is being sent to neighbor IRs, a retransmission counter that is decremented every time the IR retransmits the same update message ( in one embodiment, each update message may be sent a maximum number of times, for example four times), and an ACK-required flag for each neighbor IR specifying whether or not the neighbor has acknowledged the update message. An IR uses the MRL to ensure that updates are sent reliably to its neighbors.
  • [0062]
    III. Information Exchanged in AIR
  • [0063]
    A routing-table update message generally includes the identifier of the sending IR (typically its IP address), a sequence number assigned by the sending IR, and an update list of one or more entries. The update message may be formatted as a packet as shown in FIG. 6. Appropriate header and/or trailer information may be included for addressing and/or error correction purposes, etc.
  • [0064]
    An update entry specifies whether the entry is an update to the routing table of the sending IR or an acknowledgment (ACK) to an update message. An update entry preferably specifies at least one address for a destination, a predecessor for the destination, and a dissemination-type flag that indicates the way in which the receiving IR should notify its own neighbors about changes in its distance or predecessor to that destination. An ACK entry should specify the sequence number and the source of the update message being acknowledged. The dissemination flag of an update entry is usually set, because an IR need only send update messages to its neighbor IRs concerning those destinations that must be widely known in the ad-hoc network.
  • [0065]
    As shown in FIG. 7, a search query generally specifies the MAC and IP address of the sending IR, a sequence number, and the forward path traversed by the query from its originating IR to the IR forwarding the query. This forward path may be specified using entries that are the same as the update entries in update messages. The dissemination-type flag of a forward-path entry may or may not be set, depending on whether the intermediate hop corresponds to an IR or network that must be known by other IRs or not.
  • [0066]
    As illustrated in FIG. 8, a response to a search query may specify the MAC and IP address of the sending IR, the sequence number of the query being answered, and the complete path from the IR that originated the query to the destination. Note that the IR responding to a query has to notify a complete path to a destination only if it includes intermediate hops that are not known throughout the ad-hoc internet. However, in one embodiment of AIR, complete paths are used in order to simplify the protocol. Each hop in the path specified in a response to a search query is specified in terms of: the address(es) of the intermediate hop(s), the predecessor and distance to the hop(s), and the dissemination-type flag for the hop(s) (which may be set or not). The distance and predecessor information for each hop specified in the response may be obtained directly from the responding IR's routing table.
  • [0067]
    Because update messages are used to update routing information for well-known destinations, update entries always correspond to destinations that are known throughout the ad-hoc internet. In contrast, the entries of a reply to a search query may correspond to either well-known destinations or destinations that IRs receiving the reply need not mention to their neighbor IRs, except the neighbor that requested the information. In one embodiment of AIR, dissemination-type flags are included in update entries. Further, an IR may order the routing information it sends in update messages, search queries, or replies to such queries based on its distance to the destination.
  • [0068]
    IV. Proxy ARP and Indirect ARP Mechanisms
  • [0069]
    Returning now to FIG. 1, it should be noted that AIR allows hosts, e.g., 22 a, 22 b and 22 c, in the ad-hoc network 10 to operate as if they were all attached to a common local-area network (LAN). For example, hosts 22 a and 22 b attached to IR 16 d through a LAN or a serial (or other) interface 26, view IR 16 d as the destination, unless the destination is attached to the same LAN 26 or the hosts 22 a and 22 b are configured with the MAC address of destinations (i.e., as if they were physically attached to LAN 26). IR 16 d is then capable of determining the correct paths to the true destinations (specified in terms of IP or MAC addresses) by means of the routing-table update mechanisms described below.
  • [0070]
    For a host to communicate with another host using end-to-end protocols running on top of the Internet Protocol (IP), the source host must first obtain the Internet address (IP address) of the destination host. This is accomplished by means of a directory service (e.g., the Domain Name System or DNS), which maps domain names to IP addresses. If the source and destination hosts share a common LAN, the source host needs also to find the MAC address of the destination host. The MAC addresses serve as the name of the hosts inside a LAN and permit the network interfaces with which hosts attach to the LAN to provide a host with only those packets addressed to it. For example, in Ethernet LANs the mapping of a destination's IP address to its MAC address is supported by the ARP.
  • [0071]
    Because an ad-hoc internet typically has multiple hops, when an attached source host (e.g., host 22 a in FIG. 1) sends an ARP request for a destination host (e.g., host 22 c) that is not directly attached to a common IR, the IR (e.g., 16 d) connected to the source host acts like a destination and answers the ARP request. That is, it provides a proxy ARP service to all the hosts attached to it through a LAN or serial (or other) interface (e.g., LAN 26). The IR (e.g., 16 d) then finds the shortest (e.g., as measured by an appropriate metric or set of metrics) path to the destination host (e.g., 22 c) in collaboration with other IRs (e.g., IR 16 e in this example) using the routing-table updating mechanisms, which are completely transparent to its attached hosts. Accordingly, an IR serves as the default router for all the hosts that attach to it through a common LAN or serial interface.
  • [0072]
    The mechanisms used by an IR to learn the MAC address of a destination are described within the context of routing-table updating. The IR responds to an ARP request from a host as soon as it obtains the next hop to the intended destination. The steps taken by an IR to obtain a path to a destination are transparent to the host sending an ARP request, because the allowed delays in getting an ARP response are typically longer than the time it takes to obtain a path to an intended destination if it can be reached in an ad-hoc internet.
  • [0073]
    An IR also provides what may be defined as indirect ARP service to its attached hosts. This service consists of forwarding an ARP request from an attached host towards the MAC address specified by the host. To illustrate, consider that, in some cases, hosts attached to an IR through a LAN may be configured with a default router other than the IR(s) directly attached to the LAN. This may occur after a host is relocated or IRs are used to bridge two or more segments of a LAN. To permit a configured host to continue operating when its default router is not the IR(s) attached to the host's LAN segment, an IR is able to listen to frames (packets) sent to MAC addresses other than its own. If the IR has a routing-table entry for the MAC address, it can forward the packet accordingly. If the IR does not have a routing table entry for the MAC address, and the node with such an address has not been heard in the attached LAN, the IR may send a search query in order to find a path to the intended MAC address.
  • [0074]
    V. Routing-Table Updating
  • [0075]
    Routing-table updates are important because they serve as the means by which routers (which generally use “path finding” algorithms to determine preferred paths—typically shortest paths) ensure that they are using truly preferred paths to destinations. To illustrate, consider the network topology shown in FIG. 9. In traditional approaches, a router i sets its next node to destination j to equal neighbor k only if the distances to j, and to every node in the path from k to j, through node k constitute the smallest distances for such destination j and for such intermediate nodes (e.g., p) in the path from k to j known at i among all the neighbors of node i. For AIR, however, a router i selects its next node to a destination j to equal neighbor k only if the following conditions are satisfied:
  • [0076]
    Every intermediate node in the path from k to j, reported incrementally by k to i and stored at i, satisfy the nodal condition required by i for its path to j, and
  • [0077]
    For all of router i's neighbors, neighbor k offers the smallest distance to j and to every intermediate node along the path from k to j, which is reported incrementally by k to i and stored at i.
  • [0078]
    Furthermore, AIR extends the methodologies used in prior schemes for link-state routing. In such schemes, a router i may communicate to its neighbors the characteristics of the links (e.g., 30 a and 30 b) to each of its neighbors. A router that receives a link-state update from a neighbor may then propagate the update to its own neighbors (e.g., if the link-state update is more recent than the information maintained at the node) in one of two ways. The router may forward the update to all its neighbors other than the one sending the update, or the router may forward the update to all its neighbors if the link in the update is used by router i to reach at least one destination. A router then computes its preferred paths to destinations based on the updated information by running a shortest-path algorithm.
  • [0079]
    In AIR, however, in addition to the link-state updates, a router i communicates to its neighbors its own nodal characteristics (i.e., the node-state metrics of node i). A router that receives a node-state update from a neighbor propagates the update to its neighbors if the node-state update is more recent than the information maintained at the node. Routers then compute preferred paths to destinations running a shortest-path algorithm (e.g., Dijsktra's or Bellman-Ford's algorithm) modified to eliminate from the computation those nodes that do not satisfy router i's required value of nodal characteristics. The shortest-path algorithm may be implemented in a distributed manner over a hierarchical graph representing the connectivity of IRs (i.e., the nodes of the ad-hoc internet) and the IP networks they connect. Examples of nodal characteristics (or metrics) that may be communicated among nodes (and, hence used in shortest path computations) are presented below.
  • [0080]
    To expand on the above discussion then, an IR updates its routing table based on AIR control messages received from other IRs or messages sent by the neighbor protocol. The control messages that can cause an IR to modify its routing table are update messages or search queries from other IRs. As previously stated, the routing information contained in both update entries and query entries generally include the address (MAC address, IP address, or both), and the distance and predecessor to the destination along a preferred path. Because every IR reports to its neighbors the second-to-last hop in the shortest path to the destination, the complete path to any destination (called the implicit path to the destination) is known by the IR's neighbors, whether the destination is well-known in the ad-hoc internet or not.
  • [0081]
    When an IR receives an update message from a neighbor, it processes each update entry and ACK entry in order. Similarly, when an IR receives a reply to a search query, it processes each hop of the reported path one at a time and in the order in which the sender specifies them. Because IRs send routing information ordered according to their distances to destinations, it follows that an IR can safely execute the following path-traversal mechanism to determine if using a neighbor IR to reach a destination would result in a loop.
  • [0082]
    VI. Processing Update Messages
  • [0083]
    When an IR processes an update message from one of its neighbors, it processes each update entry reported by its neighbor IR in the order in which it was sent in its neighbor's update message. For each update entry in the message, the IR checks whether the implicit path reported by a neighbor IR to a given destination is free of loops, and checks the consistency of predecessor information reported by all its neighbors.
  • [0084]
    When an IR processes an update or reply entry reported by neighbor k regarding destination j, the IR updates the path information from neighbor k that it maintains in its distance table with the new path information reported by the neighbor. In addition, the IR determines if the path reported by any other neighbor n to the same destination includes neighbor k. If that is the case, then the IR substitutes the old path information reported by neighbor n regarding the subpath from k to destination j with the path information reported by neighbor k regarding its path to destination j.
  • [0085]
    As discussed above, to ensure that the implicit paths stored in an IR's routing table are loop free, the IR chooses a neighbor n as its successor (next hop) towards a destination if, and only if, (1) the distance to the destination through that neighbor is the smallest attainable distance to the destination through any neighbor, and (2) the distance to each intermediate hop in the path from the IR to the destination through neighbor n is the smallest attainable distance to that destination through any neighbor.
  • [0086]
    To determine the second condition above, the IR traverses the implicit path reported by its neighbor through the predecessor information. If a given intermediate hop along the path to a destination satisfies the second condition for loop freedom, the IR then checks if the same condition is true for the predecessor specified for that destination by its neighbor n. Hence, the IR carries out a path traversal from the destination back to itself to ensure that its neighbor n provides the shortest path to the destination and every intermediate hop in the path to the destination. The path-traversal tag is used to limit the processing required for an IR to accomplish this path traversal. More specifically, the tag allows the IR to stop the path traversal as soon as it reaches an intermediate hop that has a tag value equal to correct, which indicates that the path from itself to that hop through the same neighbor has been checked successfully before; or a value equal to error, which indicates that a loop has already been discovered along the proposed path to the destination.
  • [0087]
    VII. Processing Search Queries
  • [0088]
    Search queries are flooded throughout the ad-hoc internet on a best-effort basis in order for an IR to find a destination that is not known by all IRs of the ad-hoc internet. Because IRs need not keep a routing-table entry for every possible source of a search query, IRs cannot decide when to forward a query based on their shortest paths to the origins of the queries. Accordingly, IRs relaying queries should maintain a cache of the search queries that they have forwarded recently. The minimum information a relay IR requires to discard copies of the same query arriving from multiple neighbors then becomes the address of the origin of the query and the sequence number assigned by the origin to the query.
  • [0089]
    When an IR receives a search query, it first determines if the query is IR-level or host-level, and whether it has already processed the query by consulting its query cache. In the case of an IR-level query that is new, the IR either forwards the query if it does not know the route to the MAC or IP address specified in the query, or replies to the query if it has a current path to the destination.
  • [0090]
    In the case of a host-level query that is new, the IR replies to the query if it can provide a path and an address mapping for the destination. If the IR does not have the information, it first sends an ARP request locally (e.g., across a local LAN such as LAN 26 in FIG. 1) and replies to the query if it obtains a positive response from an attached host; otherwise, the IR forwards the query to other IRs, if it has any other neighbors.
  • [0091]
    When an IR forwards a search query, it adds a path entry for itself to the forward path information contained in the query. This path entry includes: the IP or MAC address of the IR; its predecessor, which consists of the IP or MAC address of the IR from which the query was received; the distance from the origin of the query to the IR; and the dissemination-type flag for the IR forwarding the query. The IR computes the distance from the origin of the query to itself by adding the cost of the incident link from its neighbor to the distance reported in the forward path of the query for the neighbor that forwarded the query.
  • [0092]
    When an IR knows a path to the destination requested in a search query, it sends a reply to it specifying the complete path from the origin of the query to the destination. This path is simply the concatenation of the forward path specified in the query being answered and the path from the IR answering the query to the intended destination.
  • [0093]
    To permit search queries to be IR-level or host-level in a way that is completely transparent to the hosts of an ad-hoc internet, one embodiment of the AIR protocol treats new ARP requests as IR-level queries and retransmitted ARP requests as host-level queries, and uses a counter to limit the number of host-level queries sent for the same IP address during a time interval of a few seconds. In addition to consuming bandwidth, sending too many host-level requests would impact the hosts of an ad-hoc internet negatively after network partitions and/or IR or host failures.
  • [0094]
    When a host sends a new ARP request to its attached IR, the IR originates an IR-level query and keeps a copy of the query in a query-sent table for a query-timeout interval. As shown in FIG. 10, an entry in the query-sent table includes the IP address of the intended destination, a query-type flag stating whether the entry corresponds to an IR- or host-level query, and a counter. The query-timeout interval is long enough for replies to the query to come back to the originating IR if there are other IRs with a path and address mapping to the requested destination, but is smaller than the ARP request timeout at the requesting host.
  • [0095]
    If the query-timeout expires for an entry in the query-sent table, the IR increments the counter of the entry in its query-sent table, retransmits the IR-level query, and restarts its query-timeout timer. If no reply is received to the retransmitted IR-level query, the IR changes the value of the query-type flag (e.g., to one) to reflect the fact that the next retransmission of the query must be a host-level query. The query-timeout is set to equal an ARP request timeout to allow the attached host to retransmit its ARP request. The IR does not retransmit a search query for the same address unless it receives an ARP request from its attached host. If the IR receives an ARP request for an IP address whose entry in the query-sent table has a query-type flag set to one, the IR sends a host-level query, increments the counter for the entry, and starts a query-timeout timer with a value long enough for the remote host to reply to the query.
  • [0096]
    An entry remains in the query-sent table of an IR for a long timeout period that should be larger than the ARP request timeout at the attached hosts, so that the attached host can retransmit an ARP request if necessary. In one embodiment of AIR, a host-level query is retransmitted only twice, after which an IR simply drops ARP requests from an attached host. This limits the traffic due to flooding of search queries over the ad-hoc internet due to ARP requests and also limits the number of remote ARP requests reaching the hosts.
  • [0097]
    VIII. Processing Replies to Search Queries
  • [0098]
    Replies specify complete paths from origins of queries to destinations, because relay IRs do not maintain an accurate account of the queries that they have forwarded; the cache maintained at each IR is only meant to reduce the possibility of an IR forwarding the same query multiple times. Accordingly, an IR must decide how to process a reply it receives from a neighbor based entirely on the information contained in the reply and not the contents of the cache it keeps for queries. More specifically, an IR receiving a reply for a query forwards the reply towards the origin of the query if it is listed in the forward path from the origin to the destination specified in the reply.
  • [0099]
    In addition to forwarding replies to the proper IRs when applicable, IRs also use replies to update their routing tables. An IR receiving a reply treats each path entry with the dissemination-type flag set in the path specified in the reply as an unreliable update entry. More precisely, if a path entry in a reply refers to a well-known destination, the IR updates its distance and routing tables as if the entry were an update entry, prepares its own routing-table update if needed, but does not send an acknowledgment. In addition, an IR treats each path entry with the dissemination-type flag reset as a temporal routing-table entry. The IR adds the routing information to its routing table, and keeps the information for a period of time.
  • [0100]
    As the replies from IRs travel back to the origin of the query, the originating IR starts obtaining one or more paths to the intended destination. In one embodiment of AIR, the IR originating a search query does not keep any state regarding the search queries that are still pending replies. The sequence number assigned to a search query is used only to limit the number of replicas of the same query that relay IRs forward. This design assumes that the hosts attached to the IRs will be the ones requesting the transmission of more queries if they do not obtain any reply from their attached IRs after a timeout. In practice, the timeouts used in hosts are much longer than the time needed for queries and their replies to traverse an ad-hoc internet.
  • [0101]
    An IR originating a search query may receive as many replies as there are IRs in the ad-hoc internet that know about the destination and are reached by the query through paths of IRs that do not know about the destination. In one embodiment of AIR, IRs maintain routing-table entries for either well-known destinations that every IR must know, or on-demand destinations that IRs know only temporarily through the replies to queries for those destinations. Therefore, it is anticipated that the most replies an originating IR will receive equals the number of neighbor IRs that a destination IR has, if the destination is an IR or a network, or as many replies as IRs are attached to a host, if the destination is a specific host. In most cases, on-demand routing will serve host-specific routes. When an IR that originated a search query receives the first reply to the query, it should erase the entry for the query in its query sent table.
  • [0102]
    IRs maintain on-demand routing information for a finite period of time, and add routing-table entries to their routing tables with information they receive in replies to search queries, without notifying their neighbors of such changes to their routing tables. An IR keeps a routing-table entry with a zero value of the dissemination-type flag for a finite time period equal to a maximum entry age, which in one embodiment may be set to approximately 3 minutes or another appropriate time. The IR may reset the age of the entry (e.g., by updating an associated age field, which may be part of each routing table entry as shown in FIG. 3) each time it forwards a packet for the destination or receives a new reply with information about the destination.
  • [0103]
    IX. Reliable and Unreliable Distribution of Routing Information
  • [0104]
    The reliable transmission of update messages is implemented by multicasting update messages, and then acknowledging these with messages carrying both updates and acknowledgments to one or more other update messages.
  • [0105]
    After receiving an update message free of errors, a node is required to acknowledge it. An update message may be retransmitted if acknowledgments are missing after a finite timeout equal to the update interval. An IR keeps track of which neighbor IRs have not acknowledged an update message by means of its MRL. Each retransmission of an update message may specify the subset of neighbors that need to acknowledge the message.
  • [0106]
    In some cases, the information contained in an update message may be obviated by a subsequent update message. In one embodiment of AIR, old update messages are therefore discarded, and all the up-to-date path information contained in the old update messages are included in the new update message, together with the new information the new update message must convey to all neighbor IRs. In other schemes, the new update message may include information regarding which portions of old update message to discard, etc. An IR may receive an acknowledgment to an update message that has been replaced by a more recent update message; in such a case, the IR simply ignores the information in the acknowledgment.
  • [0107]
    In contrast to the way in which update messages are exchanged, in one embodiment of AIR search queries and their replies are sent unreliably among IRs. The IRs originating search queries retransmit such queries only once, and it is up to the hosts to persist in finding destinations for which there are no routing table entries at each IR. As noted above, however, AIR preferably limits the number of search queries allowed over the ad-hoc internet for a given remote destination.
  • [0108]
    X. Simple Network Configuration Through AIR
  • [0109]
    With traditional Internet routing protocols, a router has to be configured with the IP addresses and masks of the attached LANs, as well as its own address and mask. Further, hosts attached to routers through a serial link or a LAN have to be configured with their IP address and mask and the IP addresses of their default routers. This amount of configuration information is required in existing Internet routing solutions because Internet routing protocols require IP addresses to accomplish routing. Therefore, Internet routers cannot start forwarding data to destinations until they are assigned their proper IP addresses and they can only send data towards IP destinations; which means that hosts must be properly configured with IP addresses before routers can start forwarding data to them.
  • [0110]
    AIR simplifies the configuration of hosts and IRs in the ad-hoc internet because it permits IRs to use both MAC and IP addresses to establish paths to destinations. AIR thus enables the implementation of a simple Dynamic IR Configuration Protocol (DICP) and permits IRs to start forwarding data for hosts immediately after they are turned on.
  • [0111]
    As mentioned above, in the ad-hoc internet each IR registers with an AirHead, i.e., an IR that interconnects the ad-hoc internet to the rest of the Internet, such as IR 16 a in FIG. 1. An AirHead is configured with an IP address, LAN sub-networks for attached LANs, and a default router address for the wired segment to which it attaches to interconnect to the rest of the Internet. The AirHead then receives an IP sub-network for the ad-hoc internet it serves.
  • [0112]
    The AirHead (e.g., IR 16 a) may use a standard Internet routing protocol (e.g., RIP or OSPF) over the wired LAN (e.g., LAN 20) connecting to its default router (e.g., router 18) to advertise its sub-network (e.g., 12 a and/or 12 b) to the default router. The AirHead is the only IR that needs to be configured in this traditional approach, because it is the only IR that must use standard Internet routing mechanisms to interconnect to the rest of the Internet.
  • [0113]
    Other IRs (e.g., 16 c) may obtain an IP address and domain name from their associated AirHead (e.g., 16 a), and may serve DHCP (Dynamic Host Configuration Protocol) packets from attached hosts (e.g., 22 a and/or 22 b). The DICP provides mutual authentication between new IRs and AirHeads, which can be accomplished by a packet-limited dialogue between the IR and AirHead to exchange certificates and public keys, and authenticate identities. To save address space or permit installation before a global IP network assignment is obtained, AirHeads can use a private IP address space to assign IP addresses to IRs and hosts. This, of course, makes the hosts and IRs in the ad-hoc internet invisible to the rest of the Internet; accordingly, the AirHead must provide the translation of private IP addresses to the IP address space allocated to the ad-hoc internet it serves. Importantly, however, the operation of AIR does not change with the type of IP addresses (public or private) used in an ad-hoc internet. With the services provided by AirHeads and the DICP, and given that AIR uses both MAC and IP addresses for routing, IRs can start operating after they are turned on. Immediately after startup, the IRs can start sending search queries in response to ARP requests.
  • [0114]
    XI. AIR Routing Metrics
  • [0115]
    As indicated above, most network routing protocols operate on “metrics” to determine the best path or paths for data traffic to take between source and destination nodes. These metrics are most often “link-state” metrics, which give an indication of the desirability (or inversely, the “cost”) of routing traffic over a particular link. The simplest link metric is to give each link a cost of “1”, which will cause the routing algorithm to choose paths that take the shortest number of links (or “hops”). Another common link metric is the delay across the link, averaged over some recent history and typically including both queuing and transmission delay. This will result in the routing algorithm choosing paths of minimum delay. Less common is the use of “node-state” metrics, which gives an indication of the cost to route packets through a particular node. To effectively route traffic in the self-configuring, multi-hop wireless network environment of an ad-hoc network, the AIR protocol combines traditional link-state metrics with new types of both link- and node-state metrics. Of course, these routing metrics may find use in other types of networks as well.
  • [0116]
    The link-state metrics used by AIR include LinkNetImpact, LinkEnergy and LinkQuality, each of which is described in detail below.
  • [0117]
    LinkNetImpact is a metric that provides the cost in interference over time to an IR's neighbors per data bit and may be measured in,
  • (normalized-number-of-nonintended-receiving-nodes) * (secs per bit).
  • [0118]
    The normalized number of nonintended nodes gives an indication of the number of other nodes in the network, other than the intended receivernode(s) for this link, which would be interfered with by a transmission over this link. For example, in the ad-hoc network 10 shown in FIG. 1, when IR 16 e transmits over a path including link 24 c to reach Internet 14 through IRs 16 d, 16 c and 16 a, that transmission may have the unintended effect of interfering with receptions by IR 16 f (and potentially other transmissions and receptions by IRs in the sub-network 12 b).
  • [0119]
    Because some nodes may be closer to the transmitter than others, this “normalized” number of neighbors may be computed in a number of ways. For example, (1) by including only those nonintended nodes that would receive the transmission at an RF power above a certain threshold power level; (2) by summing the interference levels of all nonintended nodes with the interference level at each node equal to the received RF power level of transmissions over this link by each of these nodes; or (3) a combination of methods (1) and (2).
  • [0120]
    To estimate the LinkNetImpact for use of a particular link, nodes may tag each (or selected) transmissions with the RF transmit-power used for that transmission. Any individual node may then measure the received signal strength of tagged transmissions made by its nearby nodes, and compute the difference between the transmit power (tagged in the packet) and the received signal strength. This difference will estimate (depending on measurement accuracy) the RF path-loss from the transmitting node. Periodically then (depending on rate of node mobility or other environmental dynamics), the node may relay the computed RF path-loss from each of its nearby nodes back to its neighbors. Given the path-loss to each of its nearby nodes, and given the transmitted power and link-date-rate (bits per sec) used for a link to a particular neighbor node, the transmitting node can compute the LinkNetImpact for use of this link.
  • [0121]
    Note that transmit power and link-date-rate, used for a node's different links, may vary from link to link. These will, in general, be set by link management protocols according to the data-rate and transmit power that give reasonably reliable use of that link. In fact, the link manager may provide the routing algorithm (e.g., AIR) with multiple choices of links to the same neighbor that tradeoff lower transmit power (with lower LinkNetImpact) for LinkQuality for instance.
  • [0122]
    LinkNetImpact differs from prior schemes (e.g., Jim Stevens, Rockwell; Michael Pursley, Univ. of Illinois) where network “interference” was used as a link metric for routing algorithms, in that a measure of the link utilization (e.g., in secs per bit) was not included in such schemes.
  • [0123]
    LinkEnergy is a metric that provides the node energy consumed per data bit for transmissions over a selected link and its use recognizes that for mobile, portable, or unattended wireless nodes that may be solar- or battery-powered, the power used for transmissions over each link can be a significant consideration. The units for this metric are
  • Energy (in Joules or Watts * secs)/bit.
  • [0124]
    This metric may include all additional power not normally consumed for the node in its quiescent state (when not actively transmitting). This will include the power to transmit over the selected link, adjusting for the RF transmit power setting used for the link, and may or may not include the power required to put the node in an active state (if necessary). Given such a link metric, the routing algorithm can choose paths that minimize the total energy per bit communicated through the network, or may use this metric in combination with others to achieve a combined routing optimization.
  • [0125]
    In the past (e.g., Theresa Meng, Stanford), algorithms for minimum energy routing have been introduced but such schemes did not consider the speed of the links (which may be adaptive or selectable).
  • [0126]
    LinkQuality is a metric that provides a combined indication of the desirability of a link in terms of other basic metrics such as LinkReliability, LinkMaxTransmissionUnit (LinkMTU) size, LinkEnergy, and LinkRcvSignalStrength. Although many of these basic metrics may be used elsewhere as sole determining metric criteria, the combination and the way that the metric is used in AIR is unique. Such a metric may be passed as part of a routing table update message (e.g., as part of the distance information described above). Thus, the metric may be used for routing decisions. The metric may also be used in determining whether to add a node as a neighbor at all, e.g., depending upon whether the corresponding link exhibits a better LinkQuality than an existing path to the target node.
  • [0127]
    In the self-configuring, multi-hop wireless environments common to ad-hoc networks, links to neighbors must be automatically selected by the nodes. This is in stark contrast to typical routing algorithms where the links to neighbor nodes are fixed, or in cellular wireless networks and conventional wireless LANs where selection of links is drastically simplified by the limitation that each mobile system is limited to one or more links with pre-determined “base-station” nodes.
  • [0128]
    There are a number of reasons why it may desirable to limit the list of actively used links to neighbor nodes. Each active link used by a node consumes memory resources within that node for such purposes as packet queues and maintaining link statistics. Each active link used by a node often requires additional fields in control packets in the MAC, Link, and/or Routing protocols, translating to additional network overhead traffic. In addition, by limiting a node's active links to only the closest nearby nodes, overall network efficiency is often increased due to the fewer number of nodes interfered with by transmissions (see LinkNetImpact metric above).
  • [0129]
    In AIR, a LinkQuality metric may be computed for each link being used by a node, based on some combination of traditional metrics (see above for some examples; in other cases, combinations of LinkNetImpact and/or LinkEnergy together and/or with the reliability of the link may be used as well). This metric may then communicated throughout the network as part of AIR's update packets. An important aspect of the use of this metric is making the decisions on which links to keep. Specifically, in making a decision on whether or not to add or delete a particular candidate link to a neighbor from it's actively used neighbor links, a node will:
  • [0130]
    examine the node's local routing information to determine whether alternate paths exist to the neighbor, using a sequence of one or more other links through the network,
  • [0131]
    compute the LinkQuality of the candidate link (using probing or other methods to compute the basic metrics required for the LinkQuality metric), and
  • [0132]
    if no alternate path exists to this neighbor node, accept the candidate link into this node's list of active links.
  • [0133]
    If one or more alternate path(s) do exist to the neighbor node, then compare the LinkQualities of the links along each of the alternate path(s) with the LinkQuality of the candidate link. If the LinkQuality of the candidate link compares favorably with the links on the alternate path(s), then accept the candidate link.
  • [0134]
    In alternative situations, after examining the local routing information and performing any comparisons, if the LinkQuality is determined to be above a defined threshold value, then the candidate link may be accepted.
  • [0135]
    Depending on the metrics used to compute the LinkQuality, favorable comparison may mean that the candidate link's LinkQuality is equal to or better than the link with the worst LinkQuality along the alternate path. Alternatively, favorable results may mean that the candidate link's LinkQuality is equal to or better than some other PathQuality function of the links along the alternate path. For example, if LinkQuality was simply equal to the probability of success for each packet transmitted over the link, then the following PathQuality function may be appropriate to use for comparison purposes:
  • PathQuality=[LinkQuality(i)],
  • [0136]
    where LinkQuality(i) is the LinkQuality over the ith link along the alternate path. Thus, the function computes the probability that a packet with one transmission attempt over each link on the alternate path will successfully reach the destination (neighbor node).
  • [0137]
    If the number of active neighbor links for each node is limited, then steps 3, 4, and 5 above, can be modified to add a new candidate link and reject an existing link (if necessary to meet the limitation on the number active links to neighbors). This may be achieved by comparing the LinkQuality and alternate path(s) of the new link with the LinkQualities, and alternate paths(s) of the existing links. For example, each existing link's LinkQuality can be increased (or weighted) by some value (to favor existing links), and then these can be compared with the LinkQuality of the candidate link. The link with the worst LinkQuality value (as weighted, if appropriate) may be deleted (or simply not accepted in the case of the candidate link). Excluding existing links that have no alternate path, or only poor alternate paths (e.g., as measured according to the PathQuality function discussed above) can further extend this method.
  • [0138]
    In prior schemes (e.g., Beyer, Shacham; BBN), algorithms for selecting neighbor links were presented which limit the number of active links for each node. However, these schemes did not make use of link-state information available from a link-state routing protocol such as AIR.
  • [0139]
    Node-state metrics that may be used by AIR (e.g., as part of routing table update messages) include NodePowerType, NodePowerState and NodeAnchorFlag. These measures are discussed in turn.
  • [0140]
    NodePowerType is a metric that indicates the type of power available to a node. For example, values may include Unlimited-Power, Battery-Power (with the power-capacity of the battery as an optional argument), and/or Solar-Power. This metric can be included in the update packets of the routing protocol and used by the routing algorithm to steer packets towards power-capable nodes when allowed by network or traffic stream performance goals.
  • [0141]
    NodePowerState indicates the current state (e.g., “up”, “standby”, “down”) and/or power schedule of a node (i.e., the power-conservation state of a node). For example, values may include Powered-Up, Powered-Standby, and Powered-Down. This metric may be included in the update packets of the routing protocol and used by the routing algorithm to steer packets towards nodes that are in more active states. This allows packets to follow paths of lower delays (because nodes that are in relatively inactive states are typically sensing the channel less often, and thus, forwarding through these nodes will take longer). Further, the scheme allows nodes that are powered-down to remain in that state rather than waking them up to forward packets.
  • [0142]
    NodeAnchorFlag is a metric that may be used to assist the user with network installation and/or maintenance. In a self-configuring, multi-hop network, a node's connectivity with the rest of the network cannot be determined simply by deciding whether it has links with one or more nodes (as is the case for cellular or wireless LAN networks, where each node is required to have a direct link with a “base-station” node). Therefore, AIR includes this metric, which indicates whether or not a node has been selected by the user to serve as an “anchor” for the network. By passing the state of this metric to the other nodes in the network, each node is able to provide an indication to the user as to whether or not it has a path (possibly over multiple hops) to one or more network anchors. For instance, this state may be displayed on an LED or other display, indicating whether or not a node is currently “anchored,” thus facilitating network installation.
  • [0143]
    Thus, if a single anchor node is selected by the user, then as long as each other node has a path (over one or more hops) to the anchor node (i.e., each network node is anchored), the user can be sure that each node also has connectivity with every other node in the network. Also, by designating the node(s) with connectivity to the Internet as the network anchor(s), then all anchored nodes will also have connectivity to the Internet. An anchor then may be thought of a node that has or provides connectivity to a server or a service for the computer network or a node that monitors connectivity, e.g., to the Internet or some other resource, for the computer network.
  • [0144]
    Thus a unified routing scheme for ad-hoc internetworking has been described. Although the foregoing description and accompanying figures discuss and illustrate specific embodiments, it should be appreciated that the present invention is to be measured only in terms of the claims that follow.

Claims (14)

What is claimed is:
1. A method for determining a cost metric for routing in a computer network comprising a plurality of nodes, the method comprising:
determining a cost metric comprising a measure of quality for transmissions over a communication link used by a first node of the plurality of nodes.
2. The method of claim 1, wherein the step of determining comprising determining a cost metric comprising a packet success rate determined over a plurality of packet transmissions on the communications link.
3. The method of claim 1, wherein the step of determining comprises determining a cost metric comprising a combination of a measure of the reliability of the communication link and a measure of interference over time on the communication link per data bit as caused by transmission from a second node of the plurality of nodes.
4. The method of claim 1, wherein the step of determining comprises determining a cost metric comprising a combination of a measure of the reliability of the communications link and a measure of power consumed per data bit by the first node for transmissions on the communications link.
5. The method of claim 1, further comprising the step of determining whether to include a second node of the plurality of nodes in a routing table for said first node, according to a cost metric for transmission from the first node to the second node on the communication link.
6. The method of claim 1, further comprising transmitting the cost metric from said first node to at least a second node of the plurality of nodes in a routing table update message.
7. The method of claim 1, wherein the step of determining comprises determining a cost metric comprising a measure of node energy consumed per data bit on the communications link and a measure of interference experienced over time on the communications link per data bit as caused by transmissions from a second node of the plurality of nodes.
8. A node capable of operation in a network comprising a plurality of other nodes, wherein the node determines a cost metric for routing, the cost metric comprising a measure of quality for transmissions over a communication link used by the node.
9. The node of claim 8, wherein the cost metric comprises a packet success rate determined over a plurality of packet transmissions on the communications link.
10. The node of claim 8, wherein the cost metric comprises a combination of a measure of the reliability of the communication link and a measure of the interference over time on the communication link per data bit as caused by transmissions from a selected other node of the plurality of other nodes.
11. The node of claim 8, wherein the cost metric comprises a measure of the reliability of the communications link and a measure of power consumed per data bit by the first node for transmissions on the communications link.
12. The node of claim 8, wherein the node further determines whether to include a selected other node of the plurality of other nodes in a routing table for the node, according to a cost metric for transmission from the node to the selected other node on the communications link.
13. The node of claim 8, wherein the node further transmits the cost metric to at least a selected other node of the plurality of other nodes in a routing table update message.
14. The node of claim 8, wherein the cost metric comprise a measure of node energy consumed per data bit on the communication kink and a measure of interference experienced over time on the communications link per data bit as caused by transmissions from a selected other node of the plurality of other nodes.
US09960065 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc internetworking Abandoned US20020049561A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US22122898 true 1998-12-23 1998-12-23
US09960065 US20020049561A1 (en) 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc internetworking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US09960065 US20020049561A1 (en) 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc internetworking

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US22122898 Division 1998-12-23 1998-12-23

Publications (1)

Publication Number Publication Date
US20020049561A1 true true US20020049561A1 (en) 2002-04-25

Family

ID=22826935

Family Applications (4)

Application Number Title Priority Date Filing Date
US09960065 Abandoned US20020049561A1 (en) 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc internetworking
US09957756 Abandoned US20020013856A1 (en) 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc Internetworking
US10256169 Abandoned US20030028668A1 (en) 1998-12-23 2002-09-25 Unified routing scheme for ad-hoc internetworking
US10256168 Active 2020-02-23 US7159035B2 (en) 1998-12-23 2002-09-25 Unified routing scheme for ad-hoc internetworking

Family Applications After (3)

Application Number Title Priority Date Filing Date
US09957756 Abandoned US20020013856A1 (en) 1998-12-23 2001-09-21 Unified routing scheme for ad-hoc Internetworking
US10256169 Abandoned US20030028668A1 (en) 1998-12-23 2002-09-25 Unified routing scheme for ad-hoc internetworking
US10256168 Active 2020-02-23 US7159035B2 (en) 1998-12-23 2002-09-25 Unified routing scheme for ad-hoc internetworking

Country Status (5)

Country Link
US (4) US20020049561A1 (en)
JP (1) JP2002534842A (en)
CA (1) CA2356947A1 (en)
EP (1) EP1142227A2 (en)
WO (1) WO2000039967A3 (en)

Cited By (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030110280A1 (en) * 2001-12-10 2003-06-12 Hinchliffe Alexander James Updating data from a source computer to groups of destination computers
US20030161268A1 (en) * 2002-02-22 2003-08-28 Telefonaktiebolaget Lm Ericsson Cross-layer integrated collision free path routing
US20040032847A1 (en) * 2002-01-10 2004-02-19 Harris Corporation Method and device for establishing communication links and for estimating overall quality of a directional link and reporting to OLSR in a communication system
US20040033778A1 (en) * 2002-08-15 2004-02-19 Benedito Fonseca Method and apparatus for relaying information in an ad-hoc network
WO2004071031A2 (en) * 2003-02-03 2004-08-19 Marconi Communications Gmbh Communications network and method for transmitting data in a communications network
US20040165532A1 (en) * 2002-06-07 2004-08-26 Poor Robert Dunbar Ad hoc wireless network using gradient routing
JP2005064721A (en) * 2003-08-08 2005-03-10 Sony Corp Communication system and method, communication terminal device and control method thereof, and program
JP2005064722A (en) * 2003-08-08 2005-03-10 Sony Corp Communication system and method, communication terminal device and control method thereof, and program
EP1536600A2 (en) * 2003-11-25 2005-06-01 Siemens Aktiengesellschaft Method of operation of a communication channel between at least two communication terminals
US20050185588A1 (en) * 2004-02-11 2005-08-25 Samsung Electronics Co., Ltd. & City University Of New York Cost-based routing using backoff scheme
US20050226195A1 (en) * 2002-06-07 2005-10-13 Paris Matteo N Monitoring network traffic
US20050249186A1 (en) * 2002-06-07 2005-11-10 Kelsey Richard A Routing in an asymmetrical link wireless network
US20050249215A1 (en) * 2004-02-19 2005-11-10 Kelsey Richard A Directing packets in a mesh network
US20050249122A1 (en) * 2002-06-07 2005-11-10 Wheeler Andrew J Monitoring network traffic
US20050249185A1 (en) * 2002-06-07 2005-11-10 Poor Robert D Routing in wireless networks
US20050286419A1 (en) * 2004-06-24 2005-12-29 Meshnetworks, Inc. System and method to improve the performance of an on demand routing protocol in a wireless network
US20060046658A1 (en) * 2002-09-05 2006-03-02 Cruz Rene L Scheduling methods for wireless networks
US20060135205A1 (en) * 2004-12-21 2006-06-22 Metke Anthony R Distributed domain name service
WO2006137764A1 (en) * 2005-06-22 2006-12-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement for route cost determination and selection with link cost interaction.
US20070008927A1 (en) * 2002-07-24 2007-01-11 Herz Frederick S Autoband
US20070025274A1 (en) * 2005-07-29 2007-02-01 Shahriar Rahman Hybrid distance vector protocol for wireless mesh networks
US20070076730A1 (en) * 2005-09-20 2007-04-05 Shahriar Rahman Internetworking support between a LAN and a wireless mesh network
US20070110024A1 (en) * 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US7280545B1 (en) * 2001-12-20 2007-10-09 Nagle Darragh J Complex adaptive routing system and method for a nodal communication network
US20070271172A1 (en) * 2006-04-28 2007-11-22 Andrew Shapiro Display of selected items in visual context in algorithmic trading engine
US20080310377A1 (en) * 2007-06-15 2008-12-18 George Flammer Method and system for providing routing protocols in a frequency hopping spread spectrum network
US20080310311A1 (en) * 2007-06-15 2008-12-18 George Flammer Method and system for providing network and routing protocols for utility services
US20080310340A1 (en) * 2003-08-08 2008-12-18 Sony Corporation Communication System, Communication Method, Communication Terminal Device, Control Method Thereof, and Program
US20090003214A1 (en) * 2007-06-15 2009-01-01 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
US20090034418A1 (en) * 2007-08-01 2009-02-05 Flammer Iii George Method and system of routing in a utility smart-grid network
US20100074194A1 (en) * 2007-02-07 2010-03-25 Thomson Licensing Radio and bandwidth aware routing metric for multi-radio multi-channel mutli-hop wireless networks
US20120033555A1 (en) * 2009-04-16 2012-02-09 Huawei Technologies Co., Ltd. Routing method, apparatus and system
US8515433B2 (en) 2007-06-15 2013-08-20 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
USRE44606E1 (en) 2001-07-24 2013-11-19 Perdiso Co. Limited Liability Company Method and apparatus for establishing ad hoc communications pathways between source and destination nodes in a communications network
US8737406B1 (en) * 2002-08-01 2014-05-27 Cisco Technology, Inc. Method for transmitting IP routes to prioritize convergence
US20150134775A1 (en) * 2011-05-12 2015-05-14 Michael Bahr Methods and devices for handling an extended proxy information item
WO2016097874A1 (en) * 2014-12-19 2016-06-23 Orange Power optimization in heterogenous networks
US20160353380A1 (en) * 2015-05-29 2016-12-01 Apple Inc. Techniques for selecting conducted rf links for mitigating multi-radio coexistence

Families Citing this family (213)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ES2290986T3 (en) 1997-03-12 2008-02-16 Nomadix, Inc. Nomada transmitter or router.
US6584093B1 (en) * 1998-08-25 2003-06-24 Cisco Technology, Inc. Method and apparatus for automatic inter-domain routing of calls
US8266266B2 (en) 1998-12-08 2012-09-11 Nomadix, Inc. Systems and methods for providing dynamic network authorization, authentication and accounting
US8713641B1 (en) 1998-12-08 2014-04-29 Nomadix, Inc. Systems and methods for authorizing, authenticating and accounting users having transparent computer access to a network using a gateway device
US7194554B1 (en) 1998-12-08 2007-03-20 Nomadix, Inc. Systems and methods for providing dynamic network authorization authentication and accounting
US6832253B1 (en) * 1999-04-01 2004-12-14 Cisco Technologies, Inc. Proximity as an aid to caching and secondary serving of data
US6275470B1 (en) * 1999-06-18 2001-08-14 Digital Island, Inc. On-demand overlay routing for computer-based communication networks
US6683865B1 (en) 1999-10-15 2004-01-27 Nokia Wireless Routers, Inc. System for routing and switching in computer networks
US6836463B2 (en) 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
WO2001031885A3 (en) 1999-10-22 2002-01-17 Nomadix Inc Gateway device having an xml interface and associated method
US8019836B2 (en) * 2002-01-02 2011-09-13 Mesh Comm, Llc Wireless communication enabled meter and network
US7031266B1 (en) * 2000-02-25 2006-04-18 Cisco Technology, Inc. Method and system for configuring wireless routers and networks
JP4227737B2 (en) * 2000-08-30 2009-02-18 日本電気株式会社 Wireless network, a relay node and a relay transmission method and a program used therefor
US7310335B1 (en) 2000-09-06 2007-12-18 Nokia Networks Multicast routing in ad-hoc networks
DE10044994A1 (en) * 2000-09-11 2002-03-21 Philips Corp Intellectual Pty Reconfiguring an ad hoc network
US7031288B2 (en) * 2000-09-12 2006-04-18 Sri International Reduced-overhead protocol for discovering new neighbor nodes and detecting the loss of existing neighbor nodes in a network
US7574495B1 (en) 2000-09-13 2009-08-11 Fortinet, Inc. System and method for managing interworking communications protocols
US7272643B1 (en) 2000-09-13 2007-09-18 Fortinet, Inc. System and method for managing and provisioning virtual routers
US7487232B1 (en) * 2000-09-13 2009-02-03 Fortinet, Inc. Switch management system and method
DE10053854A1 (en) * 2000-10-30 2002-05-08 Philips Corp Intellectual Pty Network having a plurality of sub-networks for the determination of the bridge terminal
JP3461493B2 (en) * 2000-11-01 2003-10-27 日本電気株式会社 Network system and a relay station apparatus
US6493377B2 (en) * 2000-12-06 2002-12-10 Linex Technologies, Inc. Distributed network, spread-spectrum system
US7007100B1 (en) * 2000-12-20 2006-02-28 Nortel Networks Limited Method for synchronization of multicast routing table changes with a plurality of multicast routing protocols
US7116640B2 (en) * 2000-12-22 2006-10-03 Mitchell Paul Tasman Architecture and mechanism for forwarding layer interfacing for networks
US7653003B2 (en) * 2002-03-21 2010-01-26 Stine John A Access protocol for wireless ad hoc networks using synchronous collision resolution
US7266085B2 (en) * 2001-03-21 2007-09-04 Stine John A Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination
US7039033B2 (en) 2001-05-07 2006-05-02 Ixi Mobile (Israel) Ltd. System, device and computer readable medium for providing a managed wireless network using short-range radio signals
US7010622B1 (en) * 2001-06-08 2006-03-07 Emc Corporation Scalable communication within a distributed system using dynamic communication trees
US7016334B2 (en) 2001-08-17 2006-03-21 Ixi Mobile ( Israel) Ltd. Device, system, method and computer readable medium for fast recovery of IP address change
US7295532B2 (en) 2001-08-17 2007-11-13 Ixi Mobile (R & D), Ltd. System, device and computer readable medium for providing networking services on a mobile device
US7296075B2 (en) 2001-08-23 2007-11-13 Anoto Ab Method, apparatus and system for connecting a portable unit to a particular server unit from among a plurality of server units
WO2003019867A1 (en) * 2001-08-23 2003-03-06 Anoto Ab Method of connecting a portable unit to a particular server unit
EP1289201A1 (en) * 2001-09-04 2003-03-05 Siemens Aktiengesellschaft Method for routing in a wireless ad-hoc network and netstation for use of the method
US6982982B1 (en) * 2001-10-23 2006-01-03 Meshnetworks, Inc. System and method for providing a congestion optimized address resolution protocol for wireless ad-hoc networks
WO2003037009A1 (en) * 2001-10-23 2003-05-01 Meshnetworks, Inc. System and method for providing a congestion optimized address resolution protocol for wireless ad-hoc networks
CA2466107C (en) * 2001-11-01 2013-01-08 Verisign, Inc. Transactional memory manager
RU2221335C2 (en) * 2001-11-01 2004-01-10 Общество с ограниченной ответственностью "Алгоритм" Method for data transmission in wireless local-area network
CA2414216C (en) * 2001-12-12 2007-05-22 At&T Corp. A secure ip access protocol framework and supporting network architecture
DE60238306D1 (en) 2001-12-28 2010-12-30 Ntt Docomo Inc Packet transmission control method
CA2416228C (en) * 2002-01-15 2010-07-13 Olsonet Communications Corporation Communication nodes for use with a wireless ad-hoc communication network
US20100238935A1 (en) * 2002-02-25 2010-09-23 Olsonet Communications Corporation Method for Routing Ad-Hoc Signals
US8345555B2 (en) * 2002-02-25 2013-01-01 Olsonet Communications Corporation Method for routing ad-hoc signals
US7760645B2 (en) * 2002-02-25 2010-07-20 Olsonet Communications Method for routing ad-hoc signals
US7092391B2 (en) * 2002-02-26 2006-08-15 Skyley Networks, Inc. Multi-hop peer-to-peer telecommunications method in a wireless network, radio terminal telecommunications method, and medium recording a program for causing a processor to implement the radio terminal telecommunications method
US7177295B1 (en) * 2002-03-08 2007-02-13 Scientific Research Corporation Wireless routing protocol for ad-hoc networks
WO2003079709A1 (en) * 2002-03-15 2003-09-25 Meshnetworks, Inc. System and method for auto-configuration and discovery of ip to mac address mapping and gateway presence
US7142524B2 (en) * 2002-05-01 2006-11-28 Meshnetworks, Inc. System and method for using an ad-hoc routing algorithm based on activity detection in an ad-hoc network
US7269657B1 (en) * 2002-05-10 2007-09-11 Rockwell Collins, Inc. Method and system for providing a mobile IP network with non-path dependent intra domain quality of service
US7016306B2 (en) 2002-05-16 2006-03-21 Meshnetworks, Inc. System and method for performing multiple network routing and provisioning in overlapping wireless deployments
US7161904B2 (en) 2002-06-04 2007-01-09 Fortinet, Inc. System and method for hierarchical metering in a virtual router based network switch
US7177311B1 (en) * 2002-06-04 2007-02-13 Fortinet, Inc. System and method for routing traffic through a virtual router-based network switch
US7376125B1 (en) 2002-06-04 2008-05-20 Fortinet, Inc. Service processing switch
US7116665B2 (en) 2002-06-04 2006-10-03 Fortinet, Inc. Methods and systems for a distributed provider edge
US7203192B2 (en) 2002-06-04 2007-04-10 Fortinet, Inc. Network packet steering
US7035207B2 (en) * 2002-06-05 2006-04-25 Eka Systems, Inc System and method for forming, maintaining and dynamic reconfigurable routing in an ad-hoc network
CN1328889C (en) * 2002-06-06 2007-07-25 中兴通讯股份有限公司 Routing method based on link status
KR100657258B1 (en) * 2002-07-02 2006-12-14 삼성전자주식회사 Apparatus and method for linking bluetooth to wireless LAN
US6894985B2 (en) * 2002-08-05 2005-05-17 Harris Corporation Monitoring link quality in a mobile ad hoc network
US7512612B1 (en) 2002-08-08 2009-03-31 Spoke Software Selecting an optimal path through a relationship graph
US7096383B2 (en) 2002-08-29 2006-08-22 Cosine Communications, Inc. System and method for virtual router failover in a network routing system
GB0220660D0 (en) 2002-09-05 2002-10-16 Nokia Corp Signal propogation delay routing
US7356571B2 (en) 2002-10-07 2008-04-08 Ixi Mobile (R&D), Ltd. System, method and processor readable medium for downloading information within a predetermined period of time to a device in a network responsive to price selection
US20040078772A1 (en) * 2002-10-16 2004-04-22 Cosine Communications, Inc. Dynamic route exchange
US7788970B2 (en) * 2002-10-28 2010-09-07 Digital Sun, Inc. Wireless sensor probe
US20040095888A1 (en) * 2002-11-15 2004-05-20 International Business Machines Corporation Apparatus and methods for network connected information handling systems devices
US7512136B2 (en) * 2002-11-15 2009-03-31 The Directv Group, Inc. Apparatus and method for preserving routable IP addresses using ARP proxy
JP3844768B2 (en) * 2002-11-20 2006-11-15 富士通株式会社 Wireless terminal device
US7580394B2 (en) * 2002-11-27 2009-08-25 Nokia Corporation System and method for collision-free transmission scheduling in a network
DE60303763T2 (en) * 2002-12-11 2006-08-17 Nippon Telegraph And Telephone Corp. Method and apparatus for calculating Mehrfachsendungsleitwegen
US7792982B2 (en) * 2003-01-07 2010-09-07 Microsoft Corporation System and method for distributing streaming content through cooperative networking
EP2562980A1 (en) 2003-01-24 2013-02-27 Coco Communications Corp. Method and apparatus for secure communications and resource sharing between anonymous non-trusting parties with no central administration
US7286844B1 (en) * 2003-01-31 2007-10-23 Bbn Technologies Corp. Systems and methods for three dimensional antenna selection and power control in an Ad-Hoc wireless network
US8149707B2 (en) * 2003-02-12 2012-04-03 Rockstar Bidco, LP Minimization of radio resource usage in multi-hop networks with multiple routings
GB0304216D0 (en) * 2003-02-25 2003-03-26 Koninkl Philips Electronics Nv Wireless network
US7995497B2 (en) * 2003-02-27 2011-08-09 Hewlett-Packard Development Company, L.P. Spontaneous topology discovery in a multi-node computer system
EP1608111A4 (en) * 2003-03-13 2010-11-17 Sony Corp Radio ad hoc communication system, terminal, processing method in the terminal, and program causing the terminal to execute the method
WO2004084462A3 (en) * 2003-03-14 2006-09-21 Meshnetworks Inc A system and method for analyzing the precision of geo-location services in a wireless network terminal
US8145743B2 (en) * 2003-04-17 2012-03-27 International Business Machines Corporation Administering devices in dependence upon user metric vectors
US7779114B2 (en) * 2003-04-17 2010-08-17 International Business Machines Corporation Method and system for administering devices with multiple user metric spaces
US20040213198A1 (en) * 2003-04-23 2004-10-28 Hamid Mahmood Routing quality-of-service traffic in a wireless system
US7398322B1 (en) * 2003-05-20 2008-07-08 Sun Microsystems, Inc. System using routing bridges to transparently interconnect multiple network links to form a single virtual network link
US20040249825A1 (en) * 2003-06-05 2004-12-09 International Business Machines Corporation Administering devices with dynamic action lists
US7280483B2 (en) * 2003-06-05 2007-10-09 Meshnetworks, Inc. System and method to improve the network performance of a wireless communications network by finding an optimal route between a source and a destination
US7734809B2 (en) * 2003-06-05 2010-06-08 Meshnetworks, Inc. System and method to maximize channel utilization in a multi-channel wireless communication network
WO2004110082B1 (en) * 2003-06-05 2005-02-03 Meshnetworks Inc System and method for determining location of a device in a wireless communication network
EP1631915A4 (en) * 2003-06-06 2012-04-25 Meshnetworks Inc System and method for characterizing the quality of a link in a wireless network
JP2005012710A (en) * 2003-06-20 2005-01-13 Sony Corp Radio communication method and apparatus
US7437443B2 (en) * 2003-07-02 2008-10-14 International Business Machines Corporation Administering devices with domain state objects
KR100526183B1 (en) 2003-07-15 2005-11-03 삼성전자주식회사 Apparatus and Method for efficient data transmission/reception in Mobile Ad-hoc Network
US20050283753A1 (en) * 2003-08-07 2005-12-22 Denise Ho Alert triggers and event management in a relationship system
US20050053007A1 (en) * 2003-09-09 2005-03-10 Harris Corporation Route selection in mobile ad-hoc networks based on traffic state information
US7085290B2 (en) 2003-09-09 2006-08-01 Harris Corporation Mobile ad hoc network (MANET) providing connectivity enhancement features and related methods
CN1599487A (en) * 2003-09-19 2005-03-23 皇家飞利浦电子股份有限公司 Routing selecting method for radio communication system and mobile terminal executing the method
DE10353851A1 (en) * 2003-11-18 2005-06-16 4G Systeme Gmbh Apparatus and method for creation of ad-hoc networks
US7761569B2 (en) 2004-01-23 2010-07-20 Tiversa, Inc. Method for monitoring and providing information over a peer to peer network
US8156175B2 (en) * 2004-01-23 2012-04-10 Tiversa Inc. System and method for searching for specific types of people or information on a peer-to-peer network
FI20040149A0 (en) * 2004-01-30 2004-01-30 Nokia Corp Obtaining Reijitystiedon
US7660284B1 (en) * 2004-02-02 2010-02-09 Verizon New York Inc. Nevigation within a wireless network
JP4425863B2 (en) 2004-02-18 2010-03-03 株式会社エヌ・ティ・ティ・ドコモ Packet forwarding system and a radio base station
US7414997B2 (en) * 2004-03-12 2008-08-19 Lucent Technologies Inc. GPRS tunneling protocol path integrity protocol
DE102004015894B3 (en) * 2004-03-31 2005-10-06 Siemens Ag A method of communication between a wireless station and a radio base station of a cellular radio communications system, as well as appropriate radio station and base station
US20050221813A1 (en) * 2004-04-05 2005-10-06 Jarno Rajahalme System and method for initiating auxiliary communication interfaces via a primary communication interface
US20070274232A1 (en) * 2004-04-05 2007-11-29 Telefonaktiebolaget Lm Ericsson (Pub) Method, Communication Device and System for Detecting Neighboring Nodes in a Wireless Multihop Network Using Ndp
JP4571666B2 (en) * 2004-04-05 2010-10-27 テレフオンアクチーボラゲット エル エム エリクソン(パブル) Method for address resolution mapping in a wireless multi-hop ad-hoc network, communication devices and systems
JP2005303827A (en) * 2004-04-14 2005-10-27 Ntt Docomo Inc Radio base station, method for controlling communication path and method for transferring packet
US8554889B2 (en) * 2004-04-21 2013-10-08 Microsoft Corporation Method, system and apparatus for managing computer identity
US8131300B2 (en) * 2004-04-28 2012-03-06 Motorola Solutions, Inc. Routing protocol within hybrid-cellular networks
GB0412494D0 (en) * 2004-06-04 2004-07-07 Nokia Corp Adaptive routing
US7995489B2 (en) * 2004-06-14 2011-08-09 The Boeing Company Topology and quality of service management apparatus and methods for communication networks
EP1755238A1 (en) * 2004-06-24 2007-02-21 Matsushita Electric Industrial Co., Ltd. Radio system, radio node device, and path control device
EP1769609A1 (en) * 2004-07-09 2007-04-04 Philips Intellectual Property & Standards GmbH Data transmission in a communication network
US7924726B2 (en) * 2004-07-12 2011-04-12 Cisco Technology, Inc. Arrangement for preventing count-to-infinity in flooding distance vector routing protocols
US8254300B1 (en) * 2004-07-20 2012-08-28 Rockstar Bidco, LP Base station, relay, system and method for packet re-transmission in a multi-hop network
US20060034316A1 (en) * 2004-08-13 2006-02-16 Jeyhan Karaoguz Energy based information transfer methodology
US8315212B2 (en) 2004-08-13 2012-11-20 Broadcom Corporation Energy based communication path selection
WO2006027636A3 (en) * 2004-09-06 2009-04-09 Nokia Corp System and method for initiating auxiliary communication interfaces via a membership-based network
WO2006029126A3 (en) * 2004-09-07 2006-08-03 Charles R Barker Jr System and method for associating different types of nodes with access point nodes in wireless network to route data in the wireless network
KR101024028B1 (en) 2004-09-08 2011-03-22 삼성전자주식회사 Method for address assignment in Ad-hoc network
US7499419B2 (en) 2004-09-24 2009-03-03 Fortinet, Inc. Scalable IP-services enabled multicast forwarding with efficient resource utilization
US7489635B2 (en) * 2004-09-24 2009-02-10 Lockheed Martin Corporation Routing cost based network congestion control for quality of service
US7808904B2 (en) * 2004-11-18 2010-10-05 Fortinet, Inc. Method and apparatus for managing subscriber profiles
EP1829396A4 (en) * 2004-12-03 2010-12-08 Univ Singapore Matching queries in a network
KR100703726B1 (en) * 2004-12-11 2007-04-05 삼성전자주식회사 Method for managing neighbor node and determining routing path in mobile ad hoc network, and network apparatus thereof
KR100636377B1 (en) 2004-12-16 2006-10-19 한국전자통신연구원 Apparatus and method for determining route path to maintain data equity among nodes
US8145201B2 (en) * 2004-12-17 2012-03-27 Raytheon Bbn Technologies Corp. Methods and apparatus for reduced energy communication in an ad hoc network
US20060140123A1 (en) * 2004-12-29 2006-06-29 Intel Corporation Methods and apparatus for distributing link-state information associated with a wireless mesh network
US7554998B2 (en) * 2005-01-11 2009-06-30 Telefonaktiebolaget Lm Ericsson (Publ) Interference-based routing in a wireless mesh network
JP2006287538A (en) * 2005-03-31 2006-10-19 Advanced Telecommunication Research Institute International Wireless device
US7801110B2 (en) * 2005-03-31 2010-09-21 Toshiba America Research, Inc. Efficient detection and/or processing in multi-hop wireless networks
US20060268715A1 (en) * 2005-05-06 2006-11-30 Interdigital Technology Corporation Method and apparatus for transmitting management information in a wireless communication system
KR100703780B1 (en) 2005-05-11 2007-04-06 삼성전자주식회사 Method and apparatus for supporting consistency of routing table's data in wireless network
US20070002740A1 (en) * 2005-06-30 2007-01-04 Scott Evans Biasing of network node prioritization to improve per-hop behavior based on performance necessary for a packet to meet end-to-end QoS goals
US8144671B2 (en) * 2005-07-01 2012-03-27 Twitchell Jr Robert W Communicating via nondeterministic and deterministic network routing
US7535855B2 (en) * 2005-08-09 2009-05-19 Mitsubishi Electric Research Laboratories, Inc. Structured addressing scheme for wireless networks
US7778270B1 (en) * 2005-08-31 2010-08-17 Hrl Laboratories, Llc Code-switching in wireless multi-hop networks
EP1934967B1 (en) * 2005-09-12 2012-02-08 Acuity Brands, Inc. Light management system having networked intelligent luminaire managers, and applications thereof
US20070070983A1 (en) * 2005-09-28 2007-03-29 Bbn Technologies Corp. Methods and apparatus for improved efficiency communication
EP1946282A4 (en) 2005-10-05 2011-12-28 Abl Ip Holding Llc A method and system for remotely monitoring and controlling field devices with a street lamp elevated mesh network
US8068428B2 (en) * 2005-11-09 2011-11-29 Meshnetworks, Inc. System and method for performing topology control in a wireless network
JP2007208955A (en) * 2006-01-04 2007-08-16 Hitachi Ltd Network system
US8458319B2 (en) * 2006-01-11 2013-06-04 Cisco Technology, Inc. System and method for tracking network resources
JP4807701B2 (en) 2006-02-28 2011-11-02 国立大学法人 名古屋工業大学 Mobile terminal apparatus, control method and mobile communication system
US7782785B2 (en) * 2006-03-02 2010-08-24 Samsung Electronics Co., Ltd. Method and apparatus for optimizing a queue based cross layer in a wireless ad-hoc network
DE102006014918A1 (en) * 2006-03-30 2007-10-04 Siemens Ag Network e.g. ad-hoc-network, routing method, involves determining set of path candidates, and discarding path candidate, when Routes metrics of path candidate exceeds/falls below threshold value
US7933890B2 (en) * 2006-03-31 2011-04-26 Google Inc. Propagating useful information among related web pages, such as web pages of a website
JP2007295057A (en) * 2006-04-21 2007-11-08 Kyowa Exeo Corp Terminal
US7958075B1 (en) * 2006-06-29 2011-06-07 At&T Intellectual Property Ii, Lp Compressing rectilinear pictures and minimizing access control lists
US8320244B2 (en) * 2006-06-30 2012-11-27 Qualcomm Incorporated Reservation based MAC protocol
CN102118823B (en) * 2006-07-04 2013-03-06 株式会社日立制作所 Self-organizing network
US8059620B2 (en) * 2006-07-28 2011-11-15 Cisco Technology, Inc. Initiation of routing convergence by a mobile router in a mobile ad hoc network in response to reaching a minimum interval of stable relative proximity between at least one neighbor
US8595348B2 (en) 2006-08-09 2013-11-26 Aol Inc. Content distribution tracking through wireless mesh networks
US8149733B2 (en) * 2006-08-25 2012-04-03 Raytheon Bbn Technologies Corp. Systems and methods for synchronizing communication networks
US7843834B2 (en) * 2006-09-15 2010-11-30 Itron, Inc. Use of minimal propagation delay path to optimize a mesh network
US8787210B2 (en) 2006-09-15 2014-07-22 Itron, Inc. Firmware download with adaptive lost packet recovery
WO2008057509A9 (en) * 2006-11-07 2008-09-04 Tiversa Inc System and method for enhanced experience with a peer to peer network
US7885180B2 (en) * 2006-12-15 2011-02-08 Check Point Software Technologies Inc. Address resolution request mirroring
US8493955B2 (en) 2007-01-05 2013-07-23 Qualcomm Incorporated Interference mitigation mechanism to enable spatial reuse in UWB networks
US8204034B2 (en) * 2007-01-10 2012-06-19 Motorola Solutions, Inc. Method and device for transmitting data packets
US8203971B2 (en) * 2007-01-12 2012-06-19 Samsung Electronics Co., Ltd. Group communication in a mobile ad-hoc network
US8208468B2 (en) * 2007-02-03 2012-06-26 Ajou University Industry—Academic Cooperation Foundation Method for connecting IP-based USN with conventional IP network
US8238355B2 (en) * 2007-02-04 2012-08-07 Ajou University Industry-Academic Cooperation Foundation IP-USN with multiple and communication method
US8161283B2 (en) * 2007-02-28 2012-04-17 Motorola Solutions, Inc. Method and device for establishing a secure route in a wireless network
DE602008006035D1 (en) * 2007-03-09 2011-05-19 Ericsson Telefon Ab L M System method and network node for checking the consistency of node relationship information in the nodes of a strongly connected network
US8437280B2 (en) 2007-03-22 2013-05-07 Tr Technologies Inc. Distributed synchronous batch reconfiguration of a network
CN105321108A (en) * 2007-04-12 2016-02-10 蒂弗萨公司 System and method for creating a list of shared information on a peer-to-peer network
US7895345B2 (en) * 2007-04-13 2011-02-22 Microsoft Corporation Distributed routing table architecture and design
US20090303888A1 (en) * 2007-05-03 2009-12-10 Honeywell International Inc. Method and system for optimizing wireless networks through feedback and adaptation
EP2171666A4 (en) * 2007-06-11 2012-05-09 Tiversa Inc System and method for advertising on a peer-to-peer network
US7769888B2 (en) 2007-06-15 2010-08-03 Silver Spring Networks, Inc. Method and system for providing network and routing protocols for utility services
US8279870B2 (en) * 2007-08-01 2012-10-02 Silver Spring Networks, Inc. Method and system of routing in a utility smart-grid network
US8180352B2 (en) * 2007-08-15 2012-05-15 Oracle America, Inc. Topology controlled discovery for next hop determination
US8200270B2 (en) * 2007-08-20 2012-06-12 Honeywell International Inc. Method for adusting power at a node
US8149716B2 (en) * 2007-08-20 2012-04-03 Raytheon Bbn Technologies Corp. Systems and methods for adaptive routing in mobile ad-hoc networks and disruption tolerant networks
US7899483B2 (en) * 2007-10-08 2011-03-01 Honeywell International Inc. Method and system for performing distributed outer loop power control in wireless communication networks
US20100284330A1 (en) * 2007-10-16 2010-11-11 Yangcheng Huang Radio Telecommunications Network Node and Method of Adjusting Routing Table Up-date Interval
US8184632B1 (en) * 2007-11-01 2012-05-22 Cisco Technology, Inc. System and method for accepting information from routing messages into a list
KR100932914B1 (en) * 2007-12-07 2009-12-21 세종대학교산학협력단 Routing apparatus and method in a wireless sensor network,
US8175043B2 (en) * 2007-12-20 2012-05-08 Verizon Patent And Licensing Inc. Method and system for establishing disparate connection paths from a mobile user device to a base station through a mobile peer-to-peer (PTP) network
KR20090091432A (en) * 2008-02-25 2009-08-28 엘지전자 주식회사 Path selection procedure in mesh network and format of path request frame therefor
US8594976B2 (en) 2008-02-27 2013-11-26 Abl Ip Holding Llc System and method for streetlight monitoring diagnostics
EP2099178A1 (en) 2008-03-03 2009-09-09 Telefonaktiebolaget LM Ericsson (PUBL) A communication unit and a method in a wireless communication network
US8107387B2 (en) * 2008-03-25 2012-01-31 Honeywell International Inc. Method to operate a wireless network having a predictable and stable performance
GB0816449D0 (en) * 2008-09-09 2008-10-15 Vodafone Plc Mobile phone carbon footprint
US8219706B2 (en) * 2008-11-14 2012-07-10 At&T Intellectual Property I, Lp Interdomain network aware peer-to-peer protocol
JP2010154383A (en) * 2008-12-26 2010-07-08 Nec Corp Path switching method, communication system, communication device, and program
US8300551B2 (en) * 2009-01-28 2012-10-30 Google Inc. Ascertaining presence in wireless networks
US8625485B2 (en) * 2009-04-30 2014-01-07 Sung-Ju Lee Data flow routing in a multi-hop wireless network
US20100299447A1 (en) * 2009-05-25 2010-11-25 Nilesh Anant Salvi Data Replication
US8549124B2 (en) * 2009-05-27 2013-10-01 International Business Machines Corporation Network management discovery tool
US9055105B2 (en) * 2009-05-29 2015-06-09 Nokia Technologies Oy Method and apparatus for engaging in a service or activity using an ad-hoc mesh network
US8451862B2 (en) 2009-07-15 2013-05-28 Qualcomm Incorporated Systems and methods for resource allocation serving communication requirements and fairness
US8619756B2 (en) * 2009-07-15 2013-12-31 Qualcomm Incorporated Systems and methods for providing resource allocation meeting communication constraints for multi-hop network data flows
US8189561B2 (en) * 2009-07-24 2012-05-29 Broadcom Corporation Method and system for power-limited switching and/or routing in a network
JP5218323B2 (en) * 2009-08-07 2013-06-26 富士通株式会社 The information processing method and program related to the relay apparatus and the transfer rule
EP2309680B1 (en) * 2009-10-08 2017-07-19 Solarflare Communications Inc Switching API
US8743877B2 (en) * 2009-12-21 2014-06-03 Steven L. Pope Header processing engine
EP2541989A4 (en) * 2010-02-23 2017-01-11 Univ Kyushu Nat Univ Corp Communications system, slave node, route building method, and program
KR101094033B1 (en) * 2010-04-12 2011-12-19 중앙대학교 산학협력단 Apparatus and method for registering node and searching floating ip using distributed network
US9007050B2 (en) 2010-09-17 2015-04-14 The Toro Company Soil moisture sensor with improved enclosure
US9515916B2 (en) * 2010-10-21 2016-12-06 Cisco Technology, Inc. Redirection of requests for target addresses
US8532008B2 (en) * 2011-01-03 2013-09-10 Arnab Das Systems, devices, and methods of managing power consumption in wireless sensor networks
US9124449B2 (en) * 2011-02-01 2015-09-01 Cisco Technology, Inc. Network topologies for energy efficient networks
US8699382B2 (en) 2011-02-01 2014-04-15 Cisco Technology, Inc. Network topologies for energy efficient networks
GB2512507B (en) 2011-10-24 2016-07-13 The Toro Co Soil moisture sensor
US20130171982A1 (en) * 2011-12-28 2013-07-04 Cisco Technology, Inc. Method and apparatus for remote secure access to wireless network
KR20140006165A (en) * 2012-06-27 2014-01-16 한국전자통신연구원 Multi-hop routing and prevention of looping apparatus and method
US9307507B2 (en) * 2012-11-30 2016-04-05 Qualcomm Incorporated Systems and methods of selective scanning for ad-hoc networks
US9819548B2 (en) * 2013-01-25 2017-11-14 Cisco Technology, Inc. Shared information distribution in a computer network
US9756549B2 (en) 2014-03-14 2017-09-05 goTenna Inc. System and method for digital communication between computing devices
US9781814B2 (en) 2014-10-15 2017-10-03 Abl Ip Holding Llc Lighting control with integral dimming
CA2908835C (en) 2014-10-15 2017-04-04 Abl Ip Holding Llc Lighting control with automated activation process
GB2544525B (en) * 2015-11-20 2017-12-06 Bluwireless Tech Limited Wired mesh communications networks
GB2544524B (en) * 2015-11-20 2017-12-06 Bluwireless Tech Limited Wireless mesh communications networks

Family Cites Families (71)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4466060A (en) 1982-02-11 1984-08-14 At&T Bell Telephone Laboratories, Incorporated Message routing in a computer network
US5088032A (en) 1988-01-29 1992-02-11 Cisco Systems, Inc. Method and apparatus for routing communications among computer networks
US4987536A (en) 1988-05-12 1991-01-22 Codex Corporation Communication system for sending an identical routing tree to all connected nodes to establish a shortest route and transmitting messages thereafter
US5115433A (en) * 1989-07-18 1992-05-19 Metricom, Inc. Method and system for routing packets in a packet communication network
US4939726A (en) * 1989-07-18 1990-07-03 Metricom, Inc. Method for routing packets in a packet communication network
US5056109A (en) * 1989-11-07 1991-10-08 Qualcomm, Inc. Method and apparatus for controlling transmission power in a cdma cellular mobile telephone system
US5309437A (en) * 1990-06-29 1994-05-03 Digital Equipment Corporation Bridge-like internet protocol router
US5210753A (en) 1991-10-31 1993-05-11 International Business Machines Corporation Robust scheduling mechanm for efficient band-width usage in muliticell wireless local networks
US5233604A (en) 1992-04-28 1993-08-03 International Business Machines Corporation Methods and apparatus for optimum path selection in packet transmission networks
US5922063A (en) 1992-09-17 1999-07-13 International Business Machines Corporation Automatic hardware message header generator
GB9300942D0 (en) 1993-01-19 1993-03-10 Int Computers Ltd Parallel computer system
DE69330675D1 (en) 1993-06-03 2001-10-04 Ibm Improved package structure for network layer
CA2124974C (en) 1993-06-28 1998-08-25 Kajamalai Gopalaswamy Ramakrishnan Method and apparatus for link metric assignment in shortest path networks
US6088590A (en) * 1993-11-01 2000-07-11 Omnipoint Corporation Method and system for mobile controlled handoff and link maintenance in spread spectrum communication
JPH07131478A (en) 1993-11-05 1995-05-19 Fujitsu Ltd Lan-to-lan communication method and lan-to-lan connecting device
US5515508A (en) 1993-12-17 1996-05-07 Taligent, Inc. Client server system and method of operation including a dynamically configurable protocol stack
US5541914A (en) * 1994-01-19 1996-07-30 Krishnamoorthy; Ashok V. Packet-switched self-routing multistage interconnection network having contention-free fanout, low-loss routing, and fanin buffering to efficiently realize arbitrarily low packet loss
US5509123A (en) 1994-03-22 1996-04-16 Cabletron Systems, Inc. Distributed autonomous object architectures for network layer routing
US5600635A (en) 1994-04-07 1997-02-04 Matsushita Electric Industrial Co., Ltd. Caller personal station equipped with simultaneous call function and multicast communication function and corresponding receiver personal station, and cell station and corresponding receiver personal station
US5822318A (en) * 1994-07-29 1998-10-13 Qualcomm Incorporated Method and apparatus for controlling power in a variable rate communication system
DE4434952A1 (en) 1994-09-29 1996-04-04 Siemens Ag Method and arrangement for addressing subscribers in a group consisting of at least two segments network
US5528593A (en) * 1994-09-30 1996-06-18 Qualcomm Incorporated Method and apparatus for controlling power in a variable rate communication system
ES2165438T3 (en) * 1994-12-19 2002-03-16 Salbu Res & Dev Pty Ltd Radio networks multiple packet jumps.
US5557748A (en) 1995-02-03 1996-09-17 Intel Corporation Dynamic network configuration
US5600644A (en) 1995-03-10 1997-02-04 At&T Method and apparatus for interconnecting LANs
US5572528A (en) 1995-03-20 1996-11-05 Novell, Inc. Mobile networking method and apparatus
US5608721A (en) 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing
US5721819A (en) 1995-05-05 1998-02-24 Silicon Graphics Corporation Programmable, distributed network routing
WO1996038991A3 (en) * 1995-05-31 1997-01-23 Andreas Merker Mobile radiotelehpone for proceeding without interruption between unsynchronised basis stations
US5638371A (en) 1995-06-27 1997-06-10 Nec Usa, Inc. Multiservices medium access control protocol for wireless ATM system
US5774669A (en) * 1995-07-28 1998-06-30 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Scalable hierarchical network management system for displaying network information in three dimensions
US5682382A (en) 1995-09-05 1997-10-28 Massachusetts Institute Of Technology Scalable, self-organizing packet radio network having decentralized channel management providing collision-free packet transfer
US5805593A (en) 1995-09-26 1998-09-08 At&T Corp Routing method for setting up a service between an origination node and a destination node in a connection-communications network
US5699347A (en) 1995-11-17 1997-12-16 Bay Networks, Inc. Method and apparatus for routing packets in networks having connection-oriented subnetworks
JP2723097B2 (en) 1995-12-04 1998-03-09 日本電気株式会社 Qos routing device
US5737318A (en) * 1995-12-27 1998-04-07 Philips Electronics North America Corporation Method for initializing a wireless, packet-hopping network
US5940596A (en) 1996-03-25 1999-08-17 I-Cube, Inc. Clustered address caching system for a network switch
US5652751A (en) 1996-03-26 1997-07-29 Hazeltine Corporation Architecture for mobile radio networks with dynamically changing topology using virtual subnets
US5854899A (en) 1996-05-09 1998-12-29 Bay Networks, Inc. Method and apparatus for managing virtual circuits and routing packets in a network/subnetwork environment
GB2313254C (en) 1996-05-17 2005-03-22 Motorola Ltd Method and apparatus for transmitting data
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
US6259724B1 (en) 1996-10-18 2001-07-10 Telefonaktiebolaget L M Ericsson (Publ) Random access in a mobile telecommunications system
US5905872A (en) 1996-11-05 1999-05-18 At&T Corp. Method of transferring connection management information in world wideweb requests and responses
US6026303A (en) 1996-11-07 2000-02-15 Nec Corporation Method for determining optimal parent terminal and ad hoc network system for the same
US6075974A (en) * 1996-11-20 2000-06-13 Qualcomm Inc. Method and apparatus for adjusting thresholds and measurements of received signals by anticipating power control commands yet to be executed
JP3638742B2 (en) 1996-11-29 2005-04-13 アンリツ株式会社 Router
US5964841A (en) 1997-03-03 1999-10-12 Cisco Technology, Inc. Technique for handling forwarding transients with link state routing protocol
US5914950A (en) * 1997-04-08 1999-06-22 Qualcomm Incorporated Method and apparatus for reverse link rate scheduling
US5918016A (en) 1997-06-10 1999-06-29 Texas Instruments Incorporated System with program for automating protocol assignments when newly connected to varing computer network configurations
JP3202658B2 (en) * 1997-06-20 2001-08-27 日本電気株式会社 Variable rate cdma transmission power control method
US5938736A (en) 1997-06-30 1999-08-17 Sun Microsystems, Inc. Search engine architecture for a high performance multi-layer switch element
US5991299A (en) 1997-09-11 1999-11-23 3Com Corporation High speed header translation processing
US5926463A (en) 1997-10-06 1999-07-20 3Com Corporation Method and apparatus for viewing and managing a configuration of a computer network
JPH11146030A (en) 1997-11-07 1999-05-28 Nec Corp Method for deciding expedient master in radio conference system
US6246669B1 (en) 1997-11-28 2001-06-12 Cisco Technology, Inc. Method and system for optimizing connection set-up operations in a high speed digital network
US6006272A (en) 1998-02-23 1999-12-21 Lucent Technologies Inc. Method for network address translation
US6563798B1 (en) * 1998-06-29 2003-05-13 Cisco Technology, Inc. Dynamically created service class-based routing tables
US6690929B1 (en) * 1998-08-03 2004-02-10 Lucent Technologies Inc. Dynamic quality-of-service and pricing in communication system
US6108314A (en) 1998-08-31 2000-08-22 Motorola, Inc. Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
US6295453B1 (en) * 1998-10-07 2001-09-25 Telefonaktiebolaget Lm Ericsson (Publ) Multi-full rate channel assignment for a cellular telephone system
US6502135B1 (en) * 1998-10-30 2002-12-31 Science Applications International Corporation Agile network protocol for secure communications with assured system availability
JP4287536B2 (en) * 1998-11-06 2009-07-01 パナソニック株式会社 Ofdm transceiver and ofdm reception method
US6275485B1 (en) * 1998-12-03 2001-08-14 Qualcomm Inc. Noise characterization in a wireless communication system
US6301244B1 (en) 1998-12-11 2001-10-09 Nortel Networks Limited QoS-oriented one-to-all route selection method for communication networks
US6424643B1 (en) * 1999-03-08 2002-07-23 Scoreboard, Inc. Method of modeling a CDMA cellular telephone system
US6657949B1 (en) * 1999-07-06 2003-12-02 Cisco Technology, Inc. Efficient request access for OFDM systems
JP2001077724A (en) * 1999-09-07 2001-03-23 Nec Corp Sending power controller and sending power control method
US6754191B1 (en) * 2000-06-22 2004-06-22 Nortel Networks Limited Method and apparatus for supplemental channel soft hand off in CDMA systems
US6760576B2 (en) * 2001-03-27 2004-07-06 Qualcomm Incorporated Method and apparatus for enhanced rate determination in high data rate wireless communication systems
US6754169B2 (en) * 2001-12-13 2004-06-22 Motorola, Inc. Method and system of operation for a variable transmission mode multi-carrier communication system
US6714769B2 (en) * 2002-03-08 2004-03-30 Interdigital Technology Corporation Method and system for implementing smart antennas and diversity techniques

Cited By (80)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE44606E1 (en) 2001-07-24 2013-11-19 Perdiso Co. Limited Liability Company Method and apparatus for establishing ad hoc communications pathways between source and destination nodes in a communications network
US20030110280A1 (en) * 2001-12-10 2003-06-12 Hinchliffe Alexander James Updating data from a source computer to groups of destination computers
US7159036B2 (en) * 2001-12-10 2007-01-02 Mcafee, Inc. Updating data from a source computer to groups of destination computers
US7280545B1 (en) * 2001-12-20 2007-10-09 Nagle Darragh J Complex adaptive routing system and method for a nodal communication network
US20040032847A1 (en) * 2002-01-10 2004-02-19 Harris Corporation Method and device for establishing communication links and for estimating overall quality of a directional link and reporting to OLSR in a communication system
US7027409B2 (en) * 2002-01-10 2006-04-11 Harris Corporation Method and device for establishing communication links and for estimating overall quality of a directional link and reporting to OLSR in a communication system
US20030161268A1 (en) * 2002-02-22 2003-08-28 Telefonaktiebolaget Lm Ericsson Cross-layer integrated collision free path routing
US7339897B2 (en) 2002-02-22 2008-03-04 Telefonaktiebolaget Lm Ericsson (Publ) Cross-layer integrated collision free path routing
US8000288B2 (en) 2002-06-07 2011-08-16 Ember Corporation Monitoring network traffic
US20100172265A1 (en) * 2002-06-07 2010-07-08 Ember Corporation Monitoring Network Traffic
US20040165532A1 (en) * 2002-06-07 2004-08-26 Poor Robert Dunbar Ad hoc wireless network using gradient routing
US20050249122A1 (en) * 2002-06-07 2005-11-10 Wheeler Andrew J Monitoring network traffic
US7782813B2 (en) 2002-06-07 2010-08-24 Ember Corporation Monitoring network traffic
US20050249186A1 (en) * 2002-06-07 2005-11-10 Kelsey Richard A Routing in an asymmetrical link wireless network
US20050226195A1 (en) * 2002-06-07 2005-10-13 Paris Matteo N Monitoring network traffic
US20050249185A1 (en) * 2002-06-07 2005-11-10 Poor Robert D Routing in wireless networks
US7463890B2 (en) * 2002-07-24 2008-12-09 Herz Frederick S M Method and apparatus for establishing ad hoc communications pathways between source and destination nodes in a communications network
US20070008927A1 (en) * 2002-07-24 2007-01-11 Herz Frederick S Autoband
US8737406B1 (en) * 2002-08-01 2014-05-27 Cisco Technology, Inc. Method for transmitting IP routes to prioritize convergence
US20040033778A1 (en) * 2002-08-15 2004-02-19 Benedito Fonseca Method and apparatus for relaying information in an ad-hoc network
US6735417B2 (en) * 2002-08-15 2004-05-11 Motorola, Inc. Method and apparatus for relaying information in an AD-HOC network
WO2004017549A2 (en) 2002-08-15 2004-02-26 Motorola, Inc., A Corporation Of The State Of Delaware Method and apparatus for relaying information in an ad-hoc network
EP1582013A2 (en) * 2002-08-15 2005-10-05 Motorola, Inc., A Corporation of the State of Delaware; Method and apparatus for relaying information in an ad-hoc network
EP1582013A4 (en) * 2002-08-15 2009-09-30 Motorola Inc Method and apparatus for relaying information in an ad-hoc network
WO2004017549A3 (en) * 2002-08-15 2005-08-11 Motorola Inc Method and apparatus for relaying information in an ad-hoc network
US20060046658A1 (en) * 2002-09-05 2006-03-02 Cruz Rene L Scheduling methods for wireless networks
US7633894B2 (en) * 2002-09-05 2009-12-15 The Regents Of The University Of California Scheduling methods for wireless networks
US20070076688A1 (en) * 2003-02-03 2007-04-05 Marconi Communications Gmbh Communications network and method for transmitting data in a communications network
WO2004071031A3 (en) * 2003-02-03 2005-05-19 Marconi Comm Gmbh Communications network and method for transmitting data in a communications network
WO2004071031A2 (en) * 2003-02-03 2004-08-19 Marconi Communications Gmbh Communications network and method for transmitting data in a communications network
WO2004084614A3 (en) * 2003-03-27 2005-03-17 Harris Corp Method and device for establishing communication links and estimating quality and reporting to olsr in a system
JP4605427B2 (en) * 2003-08-08 2011-01-05 ソニー株式会社 Communication system, a communication method, a communication terminal apparatus and a control method and program
US8755294B2 (en) 2003-08-08 2014-06-17 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
JP2005064722A (en) * 2003-08-08 2005-03-10 Sony Corp Communication system and method, communication terminal device and control method thereof, and program
KR101049870B1 (en) 2003-08-08 2011-07-15 소니 주식회사 Communication system and the communication terminal device
JP4605426B2 (en) * 2003-08-08 2011-01-05 ソニー株式会社 Communication terminal apparatus and a control method thereof, a program
US20080310340A1 (en) * 2003-08-08 2008-12-18 Sony Corporation Communication System, Communication Method, Communication Terminal Device, Control Method Thereof, and Program
US8005054B2 (en) 2003-08-08 2011-08-23 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
JP2005064721A (en) * 2003-08-08 2005-03-10 Sony Corp Communication system and method, communication terminal device and control method thereof, and program
US20050141458A1 (en) * 2003-11-25 2005-06-30 Michael Franzen Method for operation of a communication path between at least two communication terminals
EP1536600A3 (en) * 2003-11-25 2005-11-09 Siemens Aktiengesellschaft Method of operation of a communication channel between at least two communication terminals
EP1536600A2 (en) * 2003-11-25 2005-06-01 Siemens Aktiengesellschaft Method of operation of a communication channel between at least two communication terminals
US7443820B2 (en) 2003-11-25 2008-10-28 Siemens Aktiengesellschaft Method for operation of a communication path between at least two communication terminals
DE10354943B4 (en) * 2003-11-25 2008-08-28 Siemens Ag Method for operating a communication link between at least two Kommunikatonsendgeräten
US7450521B2 (en) * 2004-02-11 2008-11-11 Samsung Electronics Co., Ltd. Cost-based routing using backoff scheme
US20050185588A1 (en) * 2004-02-11 2005-08-25 Samsung Electronics Co., Ltd. & City University Of New York Cost-based routing using backoff scheme
US20050249215A1 (en) * 2004-02-19 2005-11-10 Kelsey Richard A Directing packets in a mesh network
US7606176B2 (en) 2004-06-24 2009-10-20 Meshnetworks, Inc. System and method to improve the performance of an on demand routing protocol in a wireless network
US20050286419A1 (en) * 2004-06-24 2005-12-29 Meshnetworks, Inc. System and method to improve the performance of an on demand routing protocol in a wireless network
WO2006012200A2 (en) * 2004-06-24 2006-02-02 Meshnetworks, Inc. System and method to improve the performance of an on demand routing protocol in a wireless network
WO2006012200A3 (en) * 2004-06-24 2006-07-27 William Vann Hasty Jr System and method to improve the performance of an on demand routing protocol in a wireless network
US20060135205A1 (en) * 2004-12-21 2006-06-22 Metke Anthony R Distributed domain name service
US7562148B2 (en) 2004-12-21 2009-07-14 Motorola, Inc. Distributed domain name service
WO2006068747A2 (en) * 2004-12-21 2006-06-29 Motorola, Inc. Distributed domain name service
WO2006068747A3 (en) * 2004-12-21 2006-09-14 Robert D Logalbo Distributed domain name service
WO2006137764A1 (en) * 2005-06-22 2006-12-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement for route cost determination and selection with link cost interaction.
US20090175172A1 (en) * 2005-06-22 2009-07-09 Mikael Prytz Method and Arrangement for Route Cost Determination and Selection with Link Cost Interaction
US9674073B2 (en) 2005-06-22 2017-06-06 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangement for route cost determination and selection with link cost interaction
US7787361B2 (en) * 2005-07-29 2010-08-31 Cisco Technology, Inc. Hybrid distance vector protocol for wireless mesh networks
US20070025274A1 (en) * 2005-07-29 2007-02-01 Shahriar Rahman Hybrid distance vector protocol for wireless mesh networks
US20070076730A1 (en) * 2005-09-20 2007-04-05 Shahriar Rahman Internetworking support between a LAN and a wireless mesh network
US7660318B2 (en) 2005-09-20 2010-02-09 Cisco Technology, Inc. Internetworking support between a LAN and a wireless mesh network
US20070110024A1 (en) * 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US20070271172A1 (en) * 2006-04-28 2007-11-22 Andrew Shapiro Display of selected items in visual context in algorithmic trading engine
US20100074194A1 (en) * 2007-02-07 2010-03-25 Thomson Licensing Radio and bandwidth aware routing metric for multi-radio multi-channel mutli-hop wireless networks
US8432820B2 (en) 2007-02-07 2013-04-30 Thomson Licensing Radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks
US20080310377A1 (en) * 2007-06-15 2008-12-18 George Flammer Method and system for providing routing protocols in a frequency hopping spread spectrum network
US8072951B2 (en) 2007-06-15 2011-12-06 Silver Spring Networks, Inc. Method and system for providing routing protocols in a frequency hopping spread spectrum network
US20080310311A1 (en) * 2007-06-15 2008-12-18 George Flammer Method and system for providing network and routing protocols for utility services
US8130700B2 (en) 2007-06-15 2012-03-06 Silver Spring Networks, Inc. Method and system for providing network and routing protocols for utility services
US20090003214A1 (en) * 2007-06-15 2009-01-01 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
US8515433B2 (en) 2007-06-15 2013-08-20 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
US8233905B2 (en) 2007-06-15 2012-07-31 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
US20090034418A1 (en) * 2007-08-01 2009-02-05 Flammer Iii George Method and system of routing in a utility smart-grid network
US7961740B2 (en) * 2007-08-01 2011-06-14 Silver Spring Networks, Inc. Method and system of routing in a utility smart-grid network
US9210066B2 (en) * 2009-04-16 2015-12-08 Huawei Technologies Co., Ltd. Routing method, apparatus and system
US20120033555A1 (en) * 2009-04-16 2012-02-09 Huawei Technologies Co., Ltd. Routing method, apparatus and system
US20150134775A1 (en) * 2011-05-12 2015-05-14 Michael Bahr Methods and devices for handling an extended proxy information item
WO2016097874A1 (en) * 2014-12-19 2016-06-23 Orange Power optimization in heterogenous networks
US20160353380A1 (en) * 2015-05-29 2016-12-01 Apple Inc. Techniques for selecting conducted rf links for mitigating multi-radio coexistence

Also Published As

Publication number Publication date Type
US7159035B2 (en) 2007-01-02 grant
EP1142227A2 (en) 2001-10-10 application
JP2002534842A (en) 2002-10-15 application
US20030028668A1 (en) 2003-02-06 application
WO2000039967A3 (en) 2001-01-11 application
WO2000039967A2 (en) 2000-07-06 application
US20020013856A1 (en) 2002-01-31 application
US20030037167A1 (en) 2003-02-20 application
CA2356947A1 (en) 2000-07-06 application

Similar Documents

Publication Publication Date Title
Park et al. A highly adaptive distributed routing algorithm for mobile wireless networks
Vaidya Weak duplicate address detection in mobile ad hoc networks
Hong et al. Scalable routing protocols for mobile ad hoc networks
Toh Associativity-based routing for ad hoc mobile networks
US6845091B2 (en) Mobile ad hoc extensions for the internet
US7031288B2 (en) Reduced-overhead protocol for discovering new neighbor nodes and detecting the loss of existing neighbor nodes in a network
Lee et al. A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
Das et al. Ad hoc on-demand distance vector (AODV) routing
Johnson Routing in ad hoc networks of mobile hosts
Ott et al. Integrating DTN and MANET routing
US6977937B1 (en) Radio network routing apparatus
Ramachandran et al. On the design and implementation of infrastructure mesh networks
Aggelou et al. RDMAR: A bandwidth-efficient routing protocol for mobile ad hoc networks
US7061925B2 (en) System and method for decreasing latency in locating routes between nodes in a wireless communication network
US20010040895A1 (en) An IPv6-IPv4 compatibility aggregatable global unicast address format for incremental deployment of IPv6 nodes within IPv4
US20080137580A1 (en) Method, Communication Device and System For Address Resolution Mapping In a Wireless Multihop Ad Hoc Network
US20040117339A1 (en) Arrangement in a router of a mobile network for optimizing use of messages carrying reverse routing headers
Belding-Royer et al. Evolution and future directions of the ad hoc on-demand distance-vector routing protocol
US6704283B1 (en) Traffic routing in small wireless data networks
US20070008949A1 (en) Method for automatic route aggregation in a communication system
US20050169238A1 (en) Obtaining routing information
US7116640B2 (en) Architecture and mechanism for forwarding layer interfacing for networks
US6873603B1 (en) MAC address population protocol
US20050073992A1 (en) Method for setting up route path through route discovery in a mobile ad hoc network using partial route discovery
US20050041591A1 (en) Apparatus and method for determining aggregated link costs in a mobile ad hoc network