Asymptotically optimal geometric mobile ad-hoc routing

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

doi:10.1145/570811.570814

Cited by 77 publications

(111 citation statements)

References 0 publications

Supporting

Mentioning

111

Contrasting

Order By: Relevance

“…However, the trajectory based forwarding (TBF) scheme, proposed by Niculescu and Nath [13], already provides the connection between the macroscopic and microscopic levels. Another closely related concept is the so-called geometric routing (or geographic routing) paradigm [14][15][16], where each packet carries the information (directly or indirectly) about the location of the destination node. Typically the nodes along the path simply forward the packet in a greedy manner to the neighbor which is closest to the destination.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the optimality of field-line routing in massively dense wireless multi-hop networks

Hyytiä

Virtamo²

2009

Performance Evaluation

View full text Add to dashboard Cite

A B S T R A C TWe consider the load balancing problem in large wireless multi-hop networks by applying the continuum approximation. The task is to find routes, geometric curves, such that the maximal traffic load in the network is minimized. In finite fixed networks, multi-path routes generally yield a lower congestion and thus allow higher throughput. In contrast, we show that in dense wireless multi-hop networks, the optimal load balancing can be achieved by a destination based single-path routing referred to as field-line routing. This is because any routing can be transformed to the corresponding field-line routing with the same or better performance, by using as paths, the field lines of the so-called destination flow associated with the original routing. The concepts are illustrated with two examples. In the case of a unit disk with unit traffic, the maximal load of 0.389 of a multi-path routing system is reduced to 0.343 by using the field-line routing. Similar improvements are also demonstrated for the unit square.

show abstract

Section: Related Workmentioning

confidence: 99%

“…. , n. The scalar flux for the corresponding multi-path system with random path selection with probabilities α i according to (14) is simply Φ(r) = i α i ·Φ i (r). In particular, if {r ∈ A : Φ i (r) = Φ opt , ∀ i = 1, .…”

Section: Uniqueness Of the Optimal Solutionmentioning

confidence: 99%

On the optimality of field-line routing in massively dense wireless multi-hop networks

Hyytiä

Virtamo²

2009

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…Location-based routing techniques have been extensively studied in literature [1][2][3][4][5][6][7]. In these techniques, every node in a network knows its geographic location and the locations of all its neighbors.…”

Section: A Location-based Routingmentioning

confidence: 99%

Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

Lian

Naik

Chen

2006

Proceedings of the 2006 IEEE International Conference on Network Protocols

View full text Add to dashboard Cite

show abstract

“…There are various single-path strategies, e.g. [8,5,9]. Position-based strategies have been mainly analyzed in a worst case setting, i.e.…”

Section: Related Workmentioning

confidence: 99%

Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio

Rührup

Schindelhauer

2005

Algorithms – ESA 2005

View full text Add to dashboard Cite

Abstract. We consider the problem of routing a message in a mesh network with faulty nodes. The number and positions of faulty nodes is unknown. It is known that a flooding strategy like expanding ring search can route a message in the minimum number of steps h while it causes a traffic (i.e. the total number of messages) of O(h 2 ). For optimizing traffic a single-path strategy is optimal producing traffic O(p + h), where p is the perimeter length of the barriers formed by the faulty nodes. Therefore, we define the comparative traffic ratio as a quotient over p + h and the competitive time ratio as a quotient over h. Optimal algorithms with constant ratios are known for time and traffic, but not for both. We are interested in optimizing both parameters and define the combined comparative ratio as the maximum of competitive time ratio and comparative traffic ratio. Single-path strategies using the right-hand rule for traversing barriers as well as multi-path strategies like expanding ring search have a combined comparative ratio of Θ(h). It is an open question whether there exists an online routing strategy optimizing time and traffic for meshes with an unknown set of faulty nodes. We present an online strategy for routing with faulty nodes providing sub-linear combined comparative ratio of h O "q log log h log h " .

show abstract

Asymptotically optimal geometric mobile ad-hoc routing

Cited by 77 publications

References 0 publications

On the optimality of field-line routing in massively dense wireless multi-hop networks

On the optimality of field-line routing in massively dense wireless multi-hop networks

Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio

Contact Info

Product

Resources

About