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
01 Jan 2001
221 citations
••
TL;DR: A hierarchical cluster and route procedure for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities and preserves the consistency among parent and child cluster solutions obtained at consecutive levels is described.
Abstract: We describe a hierarchical cluster and route procedure (HOGCR) for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities. The HOGCR is a multi-level clustering algorithm that groups demand nodes into smaller clusters at each planning level, enabling the optimal solution of cluster routing problems. The routing problems are represented as capacitated network flow models that are solved optimally and independently by CPLEX on a parallel computing platform. The HOGCR preserves the consistency among parent and child cluster solutions obtained at consecutive levels. We assess the performance of the algorithm by using large scale scenarios and find satisfactory results.
221 citations
•
13 Mar 2001
TL;DR: In this article, the authors propose a hop-by-hop approach to route packets of data between a data source node and a data destination node in an ad hoc, wireless network, such as a Bluetooth scatternet.
Abstract: Apparatus, and an associated method, by which to route packets of data between a data source node (18-1) and a data destination node (18-6) in an ad hoc, wireless network, such as a Bluetooth scatternet (10). Data routing tables (26, 28, 32) are provided to each node, and header information extracted from a packet header (36) is used by such tables (26, 28, 32). Routing of a packet of data is effectuated in a hop-by-hop manner to effectuate the communication of the packet from the data source node (18-1) to the data destination node (18-6).
220 citations
••
TL;DR: This work proposes and analyzes an alternative gossiping scheme that exploits geographic information and demonstrates substantial gains over previously proposed gossip protocols by utilizing geographic routing combined with a simple resampling method.
Abstract: Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste of energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of n and radicn, respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy e using O((n1.5radiclogn) logisin-1) radio transmissions, which yields a radicn/ log n factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.
219 citations
•
20 Apr 1999TL;DR: In this paper, a method for relaying, at a node (10) within a wireless network, received message data appended with route identifier and route update message, including updating a route table, was proposed.
Abstract: A method for relaying, at a node (10) within a wireless network, received message data appended with route identifier and route update message, including updating a route table based on route update message appended to received message data (34), selecting a neighboring node based on the route table (44), replacing the route identifier and the route update message based on the updated route table (48), transmitting the message data appended with the replaced route identifier and the replaced update message to the selected neighboring node (50).
218 citations