Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

Inter-computer message routing system with each computer having separate routinng automata for each dimension of the network

Abstract: In a multicomputer, concurrent computing system having a plurality of computing nodes, this is a method and apparatus for routing message packets between the nodes. The method comprises providing a routing circuit at each node and interconnecting the routing circuits to define communications paths interconnecting the nodes along which message packets can be routed; at each routing circuit, forming routes to other nodes as a sequence of direction changing and relative address indicators for each node between the starting node and each destination node; receiving a message packet to be transmitted to another node and an associated destination node designator therefor; retrieving the route to the destination node from a memory map; adding the route to the destination node to the beginning of the message packet as part of a header; transmitting the message packet to the routing circuit of the next adjacent node on the route to the destination node; and at each intermediate node, receiving the message packet; reading the header; directing the message packet to one of two outputs thereof as a function of routing directions in the header, updating the header to reflect passage through the routing circuit; and at the destination node, stripping remaining portions of the header from the message packet; storing the message packet; and, informing the node that the message packet has arrived.

QoS routing in ad hoc wireless networks

Abstract: The emergence of nomadic applications have generated a lot of interest in wireless network infrastructures which support multimedia services. We propose a bandwidth routing algorithm for multimedia support in a multihop wireless network. This network can be interconnected to wired networks (e.g. ATM or the Internet) or stand alone. Our bandwidth routing includes bandwidth calculation and reservation schemes. Under such a routing algorithm, we can derive a route to satisfy the bandwidth requirement for the QoS constraint. At a source node, the bandwidth information can be used to decide to accept a new call or not immediately. This is specially important to carry out a fast handoff when interconnecting to an ATM backbone infrastructure. It enables an efficient call admission control. The simulation results show that the bandwidth routing algorithm is very useful in extending the ATM virtual circuit service to the wireless network. Different types of QoS traffic can be integrated in such a dynamic radio network with high performance.

Hierarchical location service for mobile ad-hoc networks

Abstract: Position-based routing has proven to be a scalable and efficient way for packet routing in mobile ad-hoc networks To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with This task is typically accomplished by a location service In this paper, we propose a novel location service called HLS (Hierarchical Location Service) HLS divides the area covered by the network into a hierarchy of regions The top level region covers the complete network A region is subdivided into several regions of the next lower level until the lowest level is reached We call a lowest level region a cell For a given node A, one specific cell is selected on each level of the hierarchy by means of hash function As A changes its position it transmits position updates to these responsible cells If another node wants to determine the position of A it uses the same hash function to determine the cells that may hold information about the position of A It then proceeds to query the nodes in these cells in the order of the hierarchy until it receives a reply containing the current position of A Because of its hierarchical approach HLS is highly scalable and particularly well suited for networks where communication partners tend to be close to each other Due to the inherent scaling limitations of ad-hoc networks it is very likely that most ad hoc networks will display this property Furthermore HLS is very robust to node mobility and node failures since it uses regions to select location servers and not a chain of mobile nodes as it is the case, eg, for the well known Grid Location Service (GLS) We demonstrate these traits by providing extensive simulation data on the behaviour of HLS in a wide range of scenarios and by using GLS as a benchmark

Spatially aware packet routing for mobile ad hoc inter-vehicle radio networks

Abstract: Inter-vehicle communication can become an important building block for ITS telematics applications like safety and warning functions. Mobile ad hoc networks (MANETs) can serve as a local wireless network for exchanging information between cars for cooperative driver assistance applications. For the routing of data packets in such large-scale MANETs consisting of vehicles on the road, geographic multi-hop packet forwarding is a promising approach. However, a main drawback is that it performs poorly in networks with many topology holes. In this paper, we propose a spatially aware packet routing approach to predict permanent topology holes caused by spatial constraints and avoid them beforehand. This approach is generic and can be used in combination with any existing geographic forwarding protocol as an extension. Our simulations demonstrate that spatial awareness can significantly improve geographic forwarding performance in situations with many permanent topology holes, like in dynamic vehicle networks.