Geographic routing

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

Let the tree Bloom: scalable opportunistic routing with ORPL

Abstract: Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns.We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task.

Improved security in geographic ad hoc routing through autonomous position verification

Abstract: Inter-vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to other MANETs, these so called vehicular ad hoc networks (VANETs) have special requirements in terms of node mobility and position-dependent applications, which are well met by geographic routing protocols. Functional research on geographic routing has already reached a considerable level, whereas security aspects have been vastly neglected so far. Since position dissemination is crucial for geographic routing, forged position information has severe impact regarding both performance and security.In order to lessen this problem, we propose a detection mechanism that is capable of recognizing nodes cheating about their position in beacons (periodic position dissemination in most single-path geographic routing protocols, e.g. GPSR). Unlike other proposals described in the literature, our detection does not rely on additional hardware or special nodes, which contradicts the ad hoc approach. Instead, this mechanism uses a number of different independent sensors to quickly give an estimation of the trustworthiness of other nodes' position claims without using dedicated infrastructure or specialized hardware.The simulative evaluation proves that our position verification system successfully discloses nodes disseminating false positions and thereby widely prevents attacks using position cheating.

System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks

Abstract: One or more labeled routing trees (LRTS) are produced at a router of a computer network according to a shortest path determination made over a partial topology graph of the network, which graph is produced according to knowledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to which the identifiers pertain, and node parameters of a tail of the link to which the local link identifiers pertain. The routing state update messages may be transmitted within the network: (i) in response to a new destination node being detected by an existing node within the network, (ii) in response to a destination becoming unreachable by a collection of the existing nodes, (iii) in response to the change in the cost of a path to at least one destination exceeding a threshold and/or (iv) in situations where a routing loop may be encountered among two or more of the nodes of the network (e.g., at times when a path implied in the LRT of the router leads to a loop).

Collaborative Multi-hop Routing in Cognitive Wireless Networks

Abstract: The collaboration of nodes in cognitive wireless networks is a large challenge This paper studies the collaborative multi-hop routing in cognitive networks We propose a new algorithm to construct the collaborative routing in multi-hop cognitive networks Our algorithm takes into account the interference among nodes including primary and secondary users The clustering and collaboration are exploited to improve the performance of collaborative routing in multi-hop cognitive wireless networks with multiple primary and secondary users By analyzing the maximum transmission distance, collaborations, transmission angle control and power control, and channel allocation, we propose a new clustering-based collaborative multi-hop cognitive routing algorithm to attain better network performance Simulation results show that our approach is feasible and effective

Efficient and scalable query routing for unstructured peer-to-peer networks

Abstract: Searching for content in peer-to-peer networks is an interesting and challenging problem. Queries in Gnutella-like unstructured systems that use flooding or random walk to search must visit O(n) nodes in a network of size n, thus consuming significant amounts of bandwidth. In this paper, we propose a query routing protocol that allows low bandwidth consumption during query forwarding using a low cost mechanism to create and maintain information about nearby objects. To achieve this, our protocol maintains a lightweight probabilistic routing table at each node that suggests the location of each object in the network. Following the corresponding routing table entries, a query can reach the destination in a small number of hops with high probability. However, maintaining routing tables in a large and highly dynamic network requires non-traditional mechanisms. We design a novel data structure called an exponentially decaying bloom filter (EDBF) that encodes such probabilistic routing tables in a highly compressed manner, and allows for efficient aggregation and propagation. The search primitives provided by our system can be used to search for single keys or multiple keywords with equal ease. Analytical modeling of our design predicts significant improvements in search efficiency, verified through extensive simulations in which we observed an order of magnitude reduction in query path length over previous proposals.