Geographic routing

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

A scalable routing protocol for ad hoc networks

Abstract: Ad hoc networks, which do not rely on any infrastructure such as access points or base station, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. So ad hoc networks have attractive applications in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. Nowadays, more and more wireless devices are used, which can form large ad hoc networks. It is important to design scalable routing protocol for ad hoc networks. In this paper we present anchor based routing protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines table based routing strategy with geographic routing strategy. Simulation results shows that it is efficient and scale well to large network.

Adaptive opportunistic routing for wireless ad hoc networks

Abstract: A distributed adaptive opportunistic routing scheme for multihop wireless ad hoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per-packet reward criterion. The proposed routing scheme jointly addresses the issues of learning and routing in an opportunistic context, where the network structure is characterized by the transmission success probabilities. In particular, this learning framework leads to a stochastic routing scheme that optimally "explores" and "exploits" the opportunities in the network.

SDN-Based Routing for Efficient Message Propagation in VANET

Abstract: Vehicular Ad hoc Network (VANET) is an intermittently connected mobile network in which message propagation is quite challenging. Conventional routing protocols proposed for VANET are usually in greedy or optimum fashion. Geographical forwarding only uses local information to make the routing decision which may lead to long packet delay, while link-based forwarding has better performance but requires much more overheads. To disseminate message efficiently in VANET, a routing protocol which has both short delivery delay time and low routing overhead is required. In this paper, we proposed a SDN-based routing framework for efficiently message propagation in VANET. Software-Defined Networking (SDN) is an emerging technology that decouples the control plane from the data forwarding plane in switches and collects all the control planes into a central controller. In SDN-based routing framework, the central controller gathers network information from switches and computes optimal routing paths for switches based on the global network information. Since switches don’t need to exchange routing information with each other, the routing overhead is much lower. This paper is the first to propose a SDN-based routing framework for efficiently message propagation in VANET. A new algorithm is developed to find the global optimal route from the source to the destination in VANET with dynamic network density. We demonstrate, through the simulation results, that our proposed framework significantly outperforms the related protocols in terms of both delivery delay time and routing overhead.

Lazy cross-link removal for geographic routing

Abstract: Geographic techniques promise highly scalable any-to-any routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, distributed graph planarization. Arguing that such planarization techniques have high overhead, researchers have more recently pursued a thread in which they propose precomputation of routing structures (e.g., hull trees and grids) to achieve low-overhead geographic routing.In this paper we introduce a third approach, LCR, that does not involve any precomputation of distributed routing structures, nor full a priori planarization. Instead, LCR removes non-planarities lazily only when they interfere with correct geographic routing. Lazy removal of link crossings results in an order of magnitude or more lower overhead than any previously proposed approach.

System and method for providing dynamic location information

Abstract: A system and method for providing the dynamic geographic location of a computing device to location aware applications. This system and method enables the location aware applications to enhance the user experience by taking the dynamic geographic location of a user into account in its operations. Location providers associated with the computing device provide dynamic geographic data associated with the geographic location of the user. The dynamic geographic data is converted to a common format that is recognized by the location aware applications. The location aware applications incorporate the dynamic location in presenting information to the user.