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: This work builds upon recent results on the effect of node mobility on the performance of available routing strategies and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution.
69 citations
03 Nov 2010
TL;DR: This work describes GDSTR-3D, a new 3D geographic routing algorithm that uses 2-hop neighbor information in greedy forwarding and 2D convex hulls to aggregate node location information and is compared to existing algorithms, including CLDP/GPSR, GDSTR, AODV, VRR and S4.
Abstract: Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant body of work on geographic routing algorithms for two-dimensional (2D) networks, geographic routing for practical three-dimensional (3D) sensor networks is relatively unexplored. We show that existing 2D geographic routing algorithms like CLDP/GPSR and GDSTR perform poorly in practical 3D sensor network deployments and describe GDSTR-3D, a new 3D geographic routing algorithm that uses 2-hop neighbor information in greedy forwarding and 2D convex hulls to aggregate node location information. We compare GDSTR-3D to existing algorithms, including CLDP/GPSR, GDSTR, AODV, VRR and S4, both in a real wireless sensor testbed and with TOSSIM simulations to show that GDSTR-3D is highly scalable, requires only a modest amount of storage and achieves routing stretch close to 1.
69 citations
21 May 2007
TL;DR: The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost and demonstrated that the two- hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius.
Abstract: The hop distance strategy in wireless sensor networks (WSNs) has a major impact on energy consumption of each sensor mote. Long-hop routing minimizes reception cost. However, a substantial power demand is incurred for long distance transmission. Since the transceiver is the major source of power consumption in the node, optimizing the routing for hop length can extend significantly the lifetime of the network. This paper explores when multi-hop routing is more energy efficient than direct transmission to the sink and the conditions for which the two-hop strategy is optimal. Experimental evidence is provided in to support of these conclusions. The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost. They also demonstrated that the two- hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius. Our results may be used in existing routing protocols to select optimal relays or to determine whether it is better to send packets directly to the base station or through intermediate nodes.
69 citations
11 Dec 2006
TL;DR: This paper presents an analytical evaluation of the throughput and proposes a position-based algorithm to iteratively find a path between a source and a destination and demonstrates how interference can significantly degrade the nominal network capacity and void the benefits of multipath routing.
Abstract: Spreading traffic over multiple paths has been shown to enhance network performance compared to single path routing. However, the route coupling effect specific to wireless environments (consequent to the shared transmission medium) can significantly reduce the benefits of such an approach. In this paper, we focus on the 2-path routing problem in a non-mobile and non energy-constrained network. We evaluate the network performance and the effect of interference in a single source-destination pair scenario and for multiple source-destinations pairs. In the former case, we provide an analytical evaluation of the throughput and propose a position-based algorithm to iteratively find a path between a source and a destination. In the latter case, we demonstrate how interference can significantly degrade the nominal network capacity and void the benefits of multipath routing.
69 citations
01 Jan 2004
TL;DR: It turns out that, with the assistance of some tunable heuristics, flooding is not necessarily inferior to sophisticated point-to-point forwarding schemes, at least for some classes of wireless applications.
Abstract: We show how flooding can be adopted as a reliable and efficient routing scheme in ad-hoc wireless mobile networks. It turns out that, with the assistance of some tunable heuristics, flooding is not necessarily inferior to sophisticated point-to-point forwarding schemes, at least for some classes of wireless applications. We discuss a reactive broadcast-based ad-hoc routing protocol in which flooding exhibits a tendency to converge to a narrow strip of nodes along the shortest path between source and destination. The width of this strip can be adjusted automatically or by the user, e.g., in response to varying node density and mobility patterns. Finally, we point out a certain deficiency inherent in the IEEE 802.11 family of collision avoidance schemes and show how to fix it to provide better service to broadcast-based routing schemes represented by our variant of controlled flooding.
69 citations