Geographic routing

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

Least-Cost Opportunistic Routing

Abstract: In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the packet further. If no candidate receives the packet, then the current sender re-transmits. If multiple candidates receive the packet, then the link layer chooses a single receiver to be the relay. This choice could be made at random, or it could be driven by information coming from the routing layer, for example to use the best receiver as the relay. This paper addresses the least-cost opportunistic routing (LCOR) problem: how to assign and prioritize the set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. We solve this problem with a distributed algorithm that provably computes the optimal assignment of candidate relays that each node should allow to reach a particular destination. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff, and as a result make choices which are not always optimal.

A Reactive Location Service for Mobile Ad Hoc Networks

Abstract: We present and analyze a reactive location service RLS for mobile ad hoc networks. RLS provides a mobile node in a wireless ad-hoc network with the means to inquire the current geographical position of another node on-demand and can be used as a building block for location-based routing. We provide a comparison of RLS to an ideal omniscient location service as well as to the complex Grid Location Service (GLS). In addition, we compare the performance of greedy location-based routing in combination with RLS to the performance of a non-location-based ad hoc routing approach, namely Dynamic Source Routing (DSR). DSR was chosen for the comparison since RLS can be considered an adaptation of DSR\'s route discovery mechanisms to the location-based domain. We also introduce and study possible optimizations for RLS, in particular caching, random re-broadcast jitter, and re-broadcast suppression. The quantitative results of our NS-2 simulation study show a very good perform! ance of RLS combined with greedy routing, outperforming GLS and DSR for scenarios with high mobility and high node density.

GEDAR: Geographic and opportunistic routing protocol with Depth Adjustment for mobile underwater sensor networks

Abstract: Efficient protocols for data packet delivery in mobile underwater sensor networks (UWSNs) are crucial to the effective use of this new powerful technology for monitoring lakes, rivers, seas, and oceans. However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. In this work, we present a feasible solution for improving the data packet delivery ratio in mobile UWSN. The GEographic and opportunistic routing with Depth Adjustment-based topology control for communication Recovery (GEDAR) over void regions uses the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology. Simulation results shown that GEDAR outperforms the baseline solutions in terms of packet delivery ratio, latency and energy per message.

System and method for dynamically routing communications

Abstract: A system and method for routing an incoming call to a subscriber-selected destination number in accordance with dynamic data concerning the subscriber provided by an address book, a calendar and a presence server. A routing system routes the incoming call in accordance with a subscriber-defined routing rule associated with the originating number of the incoming call, as determined from the address book. The routing rule may specify that the incoming call be routed to a destination number associated with the current date and time, as indicated by the calendar. The routing rule may specify, alternatively or in addition thereto, that the incoming call be routed to a destination number associated with a presence-enabled service on which the subscriber is currently active. The subscriber or caller may also be alternatively notified of the routing of the incoming call.

A scalable quorum-based location service in ad hoc and sensor networks

Abstract: Location service provides position of mobile destination to source node so that position-based routing can be applied. Previous location service protocols suffer from partial flooding overhead, and/or location failure in group movement scenarios. To overcome those deficiencies, we propose a quorum-based location service. The basic idea is that destination node registers its location along a 'column' to form an update quorum. Source node makes a query along a 'row' to form a search quorum. The destination location is detected at the intersection between the update and search quorums. The overhead of each routing task, including location service, is O(√n), where n is the number of nodes in the network. Four strategies are proposed to adjust the quorum system and improve it's performance. To guarantee the success of location retrieval, both search and update quorums are extended by face routing which traverses outer boundary of the network. The simulation results show that our proposed location service has high success rate and good scalability.