Geographic routing

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

Inter-domain routing in an n-ary-tree and source-routing based communication framework

Abstract: Systems and techniques for processing and forwarding packets are described. Specifically, some embodiments can include a receiving mechanism, a determining mechanism, a generating mechanism, and a sending mechanism. The receiving mechanism can be configured to receive a first packet that is to be routed from a first node in a first Autonomous System (AS) to a second node in a second AS. The determining mechanism can be configured to determine a set of bits that encodes a route in an n-ary tree that includes the first node and a root node in the first AS. The generating mechanism can be configured to generate, based on the first packet, a second packet that includes the set of bits and an identifier associated with the second AS. The sending mechanism can be configured to send the second packet.

CAM04-4: AS Path Inference by Exploiting Known AS Paths

Abstract: Inferring AS-level end-to-end paths can be a valuable tool for both network operators and researchers. A widely known technique for inferring end-to-end paths is to perform traceroute from sources to destinations. Unfortunately, traceroute requires the access to source machines and is resource consuming. In this paper, we propose two algorithms for AS-level end-to-end path inference. The key idea of our algorithm is to exploit the AS paths appeared in BGP routing tables and infer AS paths based on the ones. In addition, our algorithms infer AS paths on the granularity of destination prefix instead of destination AS. That is, we infer AS paths from any source AS to any destination prefix. This is essential since routing in the Internet is determined based on destination prefixes instead of destination ASs. The validation results show that our algorithm yields accuracy up to 95% for exact match and accuracy up to 97% for path length match. We further extend our algorithm to infer a set of potential AS paths between a source AS and a destination prefix. We find that on average, 86% of inferred AS path sets are accurate in the sense that one of the paths in the set matches the actual AS path. Note that our algorithms require BGP routing tables only and do not require additional data trace or access to either sources or destinations. In addition, we demonstrate that the accuracy of this BGP-based inference approach cannot go beyond 90%.

Energy efficient routing protocol for wireless sensor network

Abstract: Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battlefield Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gateway\cluster head selection, maximum possible distance minimization among nodes and gateways\cluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection.

Optimized Multi-Constrained Quality-of-Service Multipath Routing Approach for Multimedia Sensor Networks

Abstract: Modern multimedia sensor networks impose strict constraints on both the delay and energy consumption when time-critical data must be reported to the sink within a limited bandwidth without any loss. Failure to transmit an event to the sink occurs for many reasons, including inherence limitations of sensors, power consumption, and reliability. We propose a mathematical model for a novel quality-of-service (QoS) routing-determination method. The proposed scheme enables determining the optimal path to provide appropriate shared radio satisfying the QoS for a wide range of real-time intensive media. The mathematical model is based on the Lagrangian relaxation method, to control adaptive switching of hop-by-hop QoS routing protocols. The embedded criteria for each objective function are used to decide which path from source to sink will be selected. Simulation results show that, compared with existing routing protocols, the approach proposed in this paper significantly improves the packet received ratio, energy consumption, and average end-to-end delay of the sensor node.

MobiCCN: Mobility support with greedy routing in Content-Centric Networks

Abstract: Content-Centric Network (CCN) shifts the Internet from point-to-point paradigm to receiver-driven data-centric paradigm. While it tries to solve many problems in the current Internet and opens the door to many novel applications, it also leaves many challenges unanswered, e.g., mobility support and mobile content publishing and dissemination. In this paper, we show how a greedy routing can be implemented in CCN architecture to support mobility. This allows for efficient content publisher mobility and supports seamless handoffs for interactive connections. We present our solution - MobiCCN, and evaluate it thoroughly in realistic network topologies to show it outperforms other popular mobility schemes.