Worst-Case optimal and average-case efficient geometric ad-hoc routing

Kühn, Fabian; Wattenhofer, Roger; Zollinger, Aaron

doi:10.1145/778445.778447

Cited by 81 publications

(70 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In addition to the greedy geometric routing schemes referenced above, there is a hybrid scheme, for example, as outlined by Karp and Kung [24], which combines a greedy routing strategy with face routing [5]. Similar hybrid schemes were subsequently studied by several other researchers (e.g., see [15,29,30,31]). An alternative hybrid augmented greedy scheme is introduced by Carlsson and Eager [9].…”

Section: Additional Related Prior Workmentioning

confidence: 99%

Succinct Greedy Geometric Routing in the Euclidean Plane

Goodrich

Strash

2009

Algorithms and Computation

View full text Add to dashboard Cite

In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy geometric routing schemes exist for the Euclidean metric in R 2 , for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits, where n is the number of vertices in the graph. Moreover, our embedding strategy introduces a coordinate system for R 2 that supports distance comparisons using our succinct coordinates. Thus, our scheme can be used to significantly reduce bandwidth, space, and header size over other recently discovered greedy geometric routing implementations for R 2 .

show abstract

Section: Additional Related Prior Workmentioning

confidence: 99%

Succinct Greedy Geometric Routing in the Euclidean Plane

Goodrich

Strash

2009

Algorithms and Computation

View full text Add to dashboard Cite

show abstract

“…They use these coordinates to calculate the distances between the destinations of a message and their neighboring vertices; each message is routed greedily, to a neighbor that is closer to the message's destination. Not every geographic network has the property that this strategy will correctly route all messages to their destinations, so a number of techniques have been developed to assist such greedy routing schemes when they fail [4,11,[18][19][20]. In a paradigm introduced by Rao et al [29], virtual coordinates can also be introduced to overcome the shortcomings of real-world coordinates and allow simple greedy forwarding to function without the assistance of fallback algorithms.…”

Section: Previous Related Workmentioning

confidence: 99%

Category-based routing in social networks: Membership dimension and the small-world phenomenon

Eppstein

Goodrich

Löffler

et al. 2013

Theoretical Computer Science

View full text Add to dashboard Cite

A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman sociology major at Harvard"). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad-hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon.

show abstract

“…GOAFR [19] is an extension of GFG algorithm which employs bounding ellipses of doubling size until destination is found in one of ellipses. The packet does not leave current ellipse and the size of current ellipse doubles whenever it is detected that network bounded by current ellipse is disconnected from the destination (this is detected by packet returning to the same node after traversing a face and is not able to change face toward destination or apply greedy advance).…”

Section: Existing Localized Routing Algorithm Which Guarantees Deliverymentioning

confidence: 99%

“…The packet does not leave current ellipse and the size of current ellipse doubles whenever it is detected that network bounded by current ellipse is disconnected from the destination (this is detected by packet returning to the same node after traversing a face and is not able to change face toward destination or apply greedy advance). It is proven in Reference [19] to be worst-case optimal and shown that is efficient in average case.…”

Section: Existing Localized Routing Algorithm Which Guarantees Deliverymentioning

confidence: 99%

Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks

Stojmenović

Datta

2004

Wireless Communications

View full text Add to dashboard Cite

In a localized routing algorithm, each node currently holding a message makes forwarding decision solely based on the position information about itself, its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. This paper proposes localized routing algorithms, aimed at minimizing total power for routing a message or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and/or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. Another improvement is to restrict the routing to nodes in a dominating set. These improvements require two-hop knowledge at each node. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with the corresponding shortest weighted path algorithms and localized algorithms that use fixed transmission power at each node. Significant energy savings are obtained, and feasibility of applying power and cost-aware localized schemes is demonstrated.

show abstract

Worst-Case optimal and average-case efficient geometric ad-hoc routing

Cited by 81 publications

References 13 publications

Succinct Greedy Geometric Routing in the Euclidean Plane

Succinct Greedy Geometric Routing in the Euclidean Plane

Category-based routing in social networks: Membership dimension and the small-world phenomenon

Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks

Contact Info

Product

Resources

About