Topic
Geographic routing
About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.
Papers published on a yearly basis
Papers
More filters
••
05 Nov 2003TL;DR: This work introduces the novel concept of secure locations to address non-cooperative and malicious behavior in location-aware sensor networks and introduces a scalable trust-based routing protocol (TRANS) to track, update and route around untrusted locations using variants of geographic and trajectory routing.
Abstract: In data-centric sensor networks, where data processing and transfer are oblivious to node IDs, conventional node-based security models are not suitable. We introduce the novel concept of secure locations to address non-cooperative and malicious behavior in location-aware sensor networks. Our architecture also introduces a scalable trust-based routing protocol (TRANS) to track, update and route around untrusted locations using variants of geographic and trajectory routing. As part of our protocol we provide an efficient algorithm for identifying and isolating misbehaving or compromised sensors based on their approximate locations. Our simulations show the efficacy of our approach in malicious node isolation and route infection reduction.
87 citations
•
16 Dec 2010TL;DR: In this article, a mesh routing method for beacon-enabled wireless AD-HOC networks is proposed, which includes: broadcasting, by nodes constituting a wireless ad-hoc network, a beacon message loading neighbor node information on a beacon payload; managing, by a node receiving the broadcasted beacon message, its own neighbor node table by extracting the neighbor nodes information loaded on the beacon payload.
Abstract: There is provided a mesh routing method in beacon-enabled wireless AD-HOC networks that includes: broadcasting, by nodes constituting a wireless AD-HOC network, a beacon message loading neighbor node information on a beacon payload; managing, by a node receiving the broadcasted beacon message, its own neighbor node table by extracting the neighbor node information loaded on the beacon payload; and performing, by a source node attempting to transmit data or commands, mesh routing on the basis of its own neighbor node table.
87 citations
•
09 Dec 1999
TL;DR: A deterministic routing table as mentioned in this paper includes a set of hash circuits and a CAM, and the routing table searches for the longest matching destination address stored in any of the hash circuits, if any, and outputs an output pointer associated with that destination address within a fixed predetermined time.
Abstract: A deterministic routing table includes a set of hash circuits and a CAM. The routing table searches for the longest matching destination address stored in any of the hash circuits and the CAM, if any, and outputs an output pointer associated with that destination address within a fixed predetermined time.
87 citations
••
01 Oct 2013TL;DR: SlickFlow is presented, a resilient source routing approach implemented with OpenFlow that allows fast failure recovery by combining source routing with alternative path information carried in the packet header, and is evaluated on a prototype implementation based on Open vSwitch.
Abstract: Recent proposals on Data Center Networks (DCN) are based on centralized control and a logical network fabric following a well-controlled baseline topology. The architectural split of control and data planes and the new control plane abstractions have been touted as Software-Defined Networking (SDN), where the OpenFlow protocol is one common choice for the standardized programmatic interface to data plane devices. In this context, source routing has been proposed as a way to provide scalability, forwarding flexibility and simplicity in the data plane. One major caveat of source routing is network failure events, which require informing the source node and can take at least on the order of one RTT to the controller. This paper presents SlickFlow, a resilient source routing approach implemented with OpenFlow that allows fast failure recovery by combining source routing with alternative path information carried in the packet header. A primary and alternative paths are compactly encoded as a sequence of segments written in packet header fields. Under the presence of failures along a primary path, packets can be rerouted to alternative paths by the switches themselves without involving the controller. We evaluate SlickFlow on a prototype implementation based on Open vSwitch and demonstrate its effectiveness in a Mininet emulated scenario for fat-tree, BCube, and DCell topologies.
87 citations
••
20 Sep 2006TL;DR: A novel routing scheme, AdaR, is presented that adaptively learns an optimal routing strategy, depending on multiple optimization goals, based on a least squares reinforcement learning technique, which is both data efficient, and insensitive against initial setting, thus ideal for the context of ad-hoc sensor networks.
Abstract: Efficient and robust routing is central to wireless sensor networks (WSN) that feature energy-constrained nodes, unreliable links, and frequent topology change. While most existing routing techniques are designed to reduce routing cost by optimizing one goal, e.g., routing path length, load balance, re-transmission rate, etc, in real scenarios however, these factors affect the routing performance in a complex way, leading to the need of a more sophisticated scheme that makes correct trade-offs. In this paper, we present a novel routing scheme, AdaR that adaptively learns an optimal routing strategy, depending on multiple optimization goals. We base our approach on a least squares reinforcement learning technique, which is both data efficient, and insensitive against initial setting, thus ideal for the context of ad-hoc sensor networks. Experimental results suggest a significant performance gain over a na??ve Q-learning based implementation.
87 citations