A method for re-routing communications based on link quality includes establishing a first wireless communication link with a mobile station. The first wireless communication link is included in a first communication path used for communications between the mobile station and a destination device. The method also includes monitoring, from the mobile station, the link quality of the first wireless link and determining, at the mobile station, that the link quality of the first communication link has decreased below a low link quality threshold. The method further includes routing, using a router at the mobile station, communications between the mobile station and the destination device to a second communication path that includes a second wireless communication link to the mobile station. The second communication path is selected by the router based on one or more metrics.

System and method for re-routing communications based on wireless communication link quality

Local mobility within a subnet is supported by classifying wireless base stations, and the routers used to forward packets to those base stations, within defined domains. Domains are defined to incorporate a subnet having a plurality of base stations. Base stations are used by mobile devices to attach to the wired portion of a packet-based network, such as the Internet, and exchange packets thereover with a correspondent node. Packets sent from the correspondent node to the mobile device have a packet destination address corresponding to the mobile device. The mobile device retains this address for the duration of time it is powered up and attached to the Internet via any base station within a given domain. Host-based routing is utilized to update routing table entries corresponding to the mobile device at routers incorporated within a single domain. The routing table entries are established and updated via path setup schemes to convey packets destined for the mobile device along the proper established path through the domain routers and base stations, regardless of the domain base station through which the mobile device is attached. Path setup schemes utilize power up, refresh, and handoff path setup messages to maintain the proper relationship between router interfaces and packet addresses for routing table entries.

Two phase local mobility scheme for wireless access to packet based networks

Growth of a distributed communication system is facilitated through dynamic addition of routing elements. A new routing element may be added to a network of routing elements by first establishing a connection between the new routing element and an existing routing element in the network. The connection may be either wireless or wireline. At least one address is assigned to the new routing element. Each assigned address comes from a pool of addresses maintained at the existing routing element. At least one pool of addresses is issued to the new routing element, permitting the new routing element to dynamically add yet another new routing element to the network of routing elements.

System and method for dynamic distributed communication

Method for selecting a route within a wireless ad-hoc routing protocol using a QoS metric. The method begins by dynamically defining a routing zone that encompasses at least two of the network nodes. A communications link is established between the source node and a destination node. If the destination node is within the routing zone of the source node, the route is determined by a proactive routing protocol. If, however, the destination node is outside the routing zone, the route is determined using a reactive routing protocol. A QoS metric for each route is calculated by combining the individual QoS metrics for each hop within the particular route. Finally, the route with the best QoS metric is selected to use as the communications link between the source node and the destination node.

Wireless routing protocol for ad-hoc networks

One or more labeled routing trees (LRTS) are produced at a router of a computer network according to a shortest path determination made over a partial topology graph of the network, which graph is produced according to knowledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to which the identifiers pertain, and node parameters of a tail of the link to which the local link identifiers pertain. The routing state update messages may be transmitted within the network: (i) in response to a new destination node being detected by an existing node within the network, (ii) in response to a destination becoming unreachable by a collection of the existing nodes, (iii) in response to the change in the cost of a path to at least one destination exceeding a threshold and/or (iv) in situations where a routing loop may be encountered among two or more of the nodes of the network (e.g., at times when a path implied in the LRT of the router leads to a loop).

/pdf/system-for-communicating-labeled-routing-trees-to-establish-4yzxeu5dzi.pdf

System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are introduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.

Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

A wireless telecommunications network is disclosed in which all of the facilities (e.g., wireless switching centers, base stations, etc.) are mobile, and, therefore, are capable of being moved while the system provides wireless telecommunications service to one or more wireless terminals. In particular, the present invention is advantageous in that any or all of the various facilities can move relative to each other without the need to suspend the provision of service. An illustrative embodiment of the present invention comprises: a plurality of base stations in a hierarchical network, wherein: each of the base stations comprises the identity of its filial base stations, if any, and wirelessly communicates with its filial base stations; and each of the base stations comprises the identity of its lineal base stations, if any.

James Igor Pelech

Papers

Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

Wireless telecommunications network whose facilities are mobile and whose topology is dynamic