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
TL;DR: Several distributed routing rules are investigated that take advantage of the regular structure of the Manhattan Street Network, and two procedures are described that allow the network to adapt to node or link failures.
Abstract: The Manhattan Street Network is a regular, two-connected network, designed for packet communications in a local or metropolitan area. It operates as a slotted system, similar to conventional loop networks. Unlike loop networks, routing decisions must be made at every node in this network. In this paper, several distributed routing rules are investigated that take advantage of the regular structure of the network. In an operational network, irregularities occur in the structure because of the addressing mechanisms, adding single nodes, and failures. A fractional addressing scheme is described that makes it possible to add new rows or columns to the network without changing the addresses of existing nodes. A technique is described for adding one node at a time to the network, while changing only two existing links. Finally, two procedures are described that allow the network to adapt to node or link failures. The effect that irregularities have on routing mechanisms designed for a regular structure is investigated.
378 citations
02 May 2005
TL;DR: Cross-Link Detection Protocol (CLDP) as discussed by the authors enables provably correct geographic routing on arbitrary connectivity graphs, which is not only correct but practical: it incurs low overhead, exhibits low path stretch, always succeeds in real, static wireless networks, and converges quickly after topology changes.
Abstract: Geographic routing has been widely hailed as the most promising approach to generally scalable wireless routing. However, the correctness of all currently proposed geographic routing algorithms relies on idealized assumptions about radios and their resulting connectivity graphs. We use testbed measurements to show that these idealized assumptions are grossly violated by real radios, and that these violations cause persistent failures in geographic routing, even on static topologies. Having identified this problem, we then fix it by proposing the Cross-Link Detection Protocol (CLDP), which enables provably correct geographic routing on arbitrary connectivity graphs. We confirm in simulation and further testbed measurements that CLDP is not only correct but practical: it incurs low overhead, exhibits low path stretch, always succeeds in real, static wireless networks, and converges quickly after topology changes.
375 citations
TL;DR: An extensive survey of protocols developed according to the principles of swarm intelligence, taking inspiration from the foraging behaviors of ant and bee colonies, and introduces a novel taxonomy for routing protocols in wireless sensor networks.
370 citations
TL;DR: This two-phase architecture makes it possible to search the solution space efficiently, thus producing good solutions without excessive computation, and shows that the TS algorithm achieves significant improvement over a recent effective LRP heuristic.
363 citations
AT&T1
TL;DR: It is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands, according to a diverse collection of ISP networks.
Abstract: Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demandsand configuring the routing protocols. These two components are inter-linked, as it is widely believed that an accurate view of traffic is important for optimizing the configuration of routing protocols and through that, the utilization of the network.This basic premise, however, never seems to have been quantified --How important is accurate knowledge of traffic demands for obtaining good utilization of the network? Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands? Armed with enhanced recent algorithmic tools we explore these questions on a diverse collection of ISP networks. We arrive at a surprising conclusion: it is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands.
359 citations