Geographic routing

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

Computer Networks with Compact Routing Tables

Abstract: The routing problem in computer networks is traditionally solved by providing detailed routing information for all destinations at every node We consider the problem of routing messages with only a small amount of information at every node For example, for every connected N-node network a scheme can be devised such that every message can be routed within O(√N) routing decisions Improving on an observation of Santoro & Khatib [3] for trees we derive a general method of routing messages in arbitrary networks using tables of a size corresponding to the number of links at a node, while utilizing all links in the network

A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks

Abstract: Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms may fail to find a route from a source to a destination in some types of ad-hoc networks and if they find a route, it may be much longer than the shortest path. On the other hand, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. In this paper we propose a new reactive routing algorithm for mobile ad hoc networks, called POSANT (Position based Ant Colony Routing Algorithm), which combines the idea of ant colony optimization with information about the position of nodes. In contrast to the other ant colony optimization based routing algorithms, our simulations show that POSANT has a relatively short route establishment time while using a small number of control messages which makes it a scalable reactive routing algorithm.

Packet routing in dynamically changing networks on chip

Abstract: On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication among modules which are dynamically placed on a reconfigurable device at run-time. Using simulation, we compare the performance of an adaptive Q-routing algorithm to the well known XY-routing strategy. Both algorithms are adapted to support communication on the DyNoC which is equivalent to routing on meshes with obstacles. In our experiments, Q-routing proves its performance under varying network load while using only local information for its routing decisions.

Node Density-Based Adaptive Routing Scheme for Disruption Tolerant Networks

Abstract: Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist in such networks Hence, routing mechanisms that can withstand disruptions need to be designed A store-and-forward approach has been proposed for disruption tolerant networks Recently, several approaches have been proposed for unicast routing in disruption-prone networks eg the 2-hop relay approach, delivery probability based routing, and message ferrying In our earlier paper, we have evaluated a combined multihop and message ferrying approach in disruption tolerant networks In that paper, we assume that a special node is designated to be a message ferry A more flexible approach is to let regular nodes volunteer to be message ferries when network dynamics mandate the presence of such ferries to ensure communications Thus, in this paper, we design a node-density based adaptive routing (NDBAR) scheme that allows regular nodes to volunteer to be message ferries when there are very few nodes around them to ensure the feasibility of continued communications Our simulation results indicate that our NDBAR scheme can achieve the highest delivery ratio in very sparse networks that are prone to frequent disruptions