Geographic routing

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

Mobile agents for adaptive routing

Abstract: This paper introduces AntNet, a new routing algorithm for telecommunication networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet in a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial traffic distributions. AntNet showed both very good performances and robustness under all the experimental conditions with respect to its competitors.

Joint On-Demand Routing and Spectrum Assignment in Cognitive Radio Networks

Abstract: In cognitive radio networks, nodes can work on different frequency bands. Existing routing proposals help nodes select frequency bands without considering the effect of band switching and intra-band backoff. In this paper, We propose a joint interaction between on-demand routing and spectrum scheduling. A node analytical model is proposed to describe the scheduling-based channel assignment progress, which relief the inter-flow interference and frequent switching delay. We also use an on-demand interaction to derive a cumulative delay based routing protocol. Simulation results show that, comparing to other approaches, our protocol provides better adaptability to the multi- flow environment and derives paths with much lower cumulative delay.

VAPR: Void-Aware Pressure Routing for Underwater Sensor Networks

Abstract: Underwater mobile sensor networks have recently been proposed as a way to explore and observe the ocean, providing 4D (space and time) monitoring of underwater environments. We consider a specialized geographic routing problem called pressure routing that directs a packet to any sonobuoy on the surface based on depth information available from on-board pressure gauges. The main challenge of pressure routing in sparse underwater networks has been the efficient handling of 3D voids. In this respect, it was recently proven that the greedy stateless perimeter routing method, very popular in 2D networks, cannot be extended to void recovery in 3D networks. Available heuristics for 3D void recovery require expensive flooding. In this paper, we propose a Void-Aware Pressure Routing (VAPR) protocol that uses sequence number, hop count and depth information embedded in periodic beacons to set up next-hop direction and to build a directional trail to the closest sonobuoy. Using this trail, opportunistic directional forwarding can be efficiently performed even in the presence of voids. The contribution of this paper is twofold: a robust soft-state routing protocol that supports opportunistic directional forwarding; and a new framework to attain loop freedom in static and mobile underwater networks to guarantee packet delivery. Extensive simulation results show that VAPR outperforms existing solutions.

A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution

Abstract: Due to the nonuniform node distribution, the energy consumption among nodes are more imbalanced in cluster-based wireless sensor networks. Based on this problem, in this paper, a cluster-based routing protocol for wireless sensor networks with nonuniform node distribution is proposed, which includes an energy-aware clustering algorithm EADC and a cluster-based routing algorithm. EADC uses competition range to construct clusters of even sizes. At the same time, the routing algorithm increases forwarding tasks of the nodes in scarcely covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes as their next hops, and finally, achieves load balance among cluster heads. Theoretical analysis and simulation results show that our protocol can balance the energy consumption among nodes and increase the network lifetime significantly.

Multipath source routing in wireless ad hoc networks

Abstract: We propose a new multipath routing protocol for ad hoc wireless networks-multipath source routing (MSR), which is based on DSR (dynamic source routing). MSR extends DSR's route discovery and route maintenance mechanism to deal with multipath routing. Based on the measurement of RTT, we propose a scheme to distribute load between multiple paths. The simulation results show that our approach improves the throughput of TCP and UDP and the packet delivery ratio, and reduces the end-to-end delay and the queue size, while adding little overhead. As a result, MSR decreases the network congestion quite well.