48,788 research outputs found
Improving Routing Efficiency through Intermediate Target Based Geographic Routing
The greedy strategy of geographical routing may cause the local minimum
problem when there is a hole in the routing area. It depends on other
strategies such as perimeter routing to find a detour path, which can be long
and result in inefficiency of the routing protocol. In this paper, we propose a
new approach called Intermediate Target based Geographic Routing (ITGR) to
solve the long detour path problem. The basic idea is to use previous
experience to determine the destination areas that are shaded by the holes. The
novelty of the approach is that a single forwarding path can be used to
determine a shaded area that may cover many destination nodes. We design an
efficient method for the source to find out whether a destination node belongs
to a shaded area. The source then selects an intermediate node as the tentative
target and greedily forwards packets to it, which in turn forwards the packet
to the final destination by greedy routing. ITGR can combine multiple shaded
areas to improve the efficiency of representation and routing. We perform
simulations and demonstrate that ITGR significantly reduces the routing path
length, compared with existing geographic routing protocols
The Four Principles of Geographic Routing
Geographic routing consists in using the position information of nodes to
assist in the routing process, and has been a widely studied subject in sensor
networks. One of the outstanding challenges facing geographic routing has been
its applicability. Authors either make some broad assumptions on an idealized
version of wireless networks which are often unverifiable, or they use costly
methods to planarize the communication graph.
The overarching questions that drive us are the following. When, and how
should we use geographic routing? Is there a criterion to tell whether a
communication network is fit for geographic routing? When exactly does
geographic routing make sense?
In this paper we formulate the four principles that define geographic routing
and explore their topological consequences. Given a localized communication
network, we then define and compute its geographic eccentricity, which measures
its fitness for geographic routing. Finally we propose a distributed algorithm
that either enables geographic routing on the network or proves that its
geographic eccentricity is too high.Comment: This manuscript on geographic routing incoporates team feedback and
expanded experiment
A Cross-Layer Design Based on Geographic Information for Cooperative Wireless Networks
Most of geographic routing approaches in wireless ad hoc and sensor networks
do not take into consideration the medium access control (MAC) and physical
layers when designing a routing protocol. In this paper, we focus on a
cross-layer framework design that exploits the synergies between network, MAC,
and physical layers. In the proposed CoopGeo, we use a beaconless forwarding
scheme where the next hop is selected through a contention process based on the
geographic position of nodes. We optimize this Network-MAC layer interaction
using a cooperative relaying technique with a relay selection scheme also based
on geographic information in order to improve the system performance in terms
of reliability.Comment: in 2010 IEEE 71st Vehicular Technology Conference, 201
Geographic Centroid Routing for Vehicular Networks
A number of geolocation-based Delay Tolerant Networking (DTN) routing
protocols have been shown to perform well in selected simulation and mobility
scenarios. However, the suitability of these mechanisms for vehicular networks
utilizing widely-available inexpensive Global Positioning System (GPS) hardware
has not been evaluated. We propose a novel geolocation-based routing primitive
(Centroid Routing) that is resilient to the measurement errors commonly present
in low-cost GPS devices. Using this notion of Centroids, we construct two novel
routing protocols and evaluate their performance with respect to positional
errors as well as traditional DTN routing metrics. We show that they outperform
existing approaches by a significant margin.Comment: 6 page
Ripple effect : an improved geographic routing with local connectivity information
One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity status at each node before making routing decision. We present a protocol, Density Ripple Exchange (DRE), that maintains local density information at each node, and a new geographic routing algorithm, Geographic Ripple Routing (GRR), that achieves better routing performance in both hop stretch and transmission stretch than existing geographic routing algorithms by exploiting available connectivity information. Our simulations demonstrate that we increased the performance for GRR over Greedy Perimeter Stateless Routing (GPSR) by about 15%. The cost of this improved performance is a small amount of additional local connectivity information required for our algorithm.<br /
- …