Online Routing in Convex Subdivisions

Bose, Prosenjit; Morin, Pat; Brodnik, Andrej; Carlsson, Svante; Demaine, Erik D.; Fleischer, Rudolf; Munro, J. Ian; López-Ortíz, Alejandro

doi:10.1007/3-540-40996-3_5

Cited by 46 publications

(40 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been later suggestions for algorithms with guaranteed message delivery [10,14]; at least in the worst case, however, none of them outperforms the original Face Routing. Yet other geographic routing algorithms have been shown to reach the Wireless Netw (2008) 14:715-729 717 destination in special planar graphs without any or restricted runtime guarantees [8,9,23]. A more detailed overview of geographic routing can be found in [69].…”

Section: Related Workmentioning

confidence: 98%

Ad hoc networks beyond unit disk graphs

2007

View full text Add to dashboard Cite

In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks while at the same time being concise enough to promote strong theoretical results. The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1. We show that-in comparison to the cost known for unit disk graphs-the complexity results of geographic routing in this model contain the additional factor 1/d 2 . We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d ! 1=ffiffi ffi 2 p .

show abstract

Section: Related Workmentioning

confidence: 98%

Ad hoc networks beyond unit disk graphs

2007

View full text Add to dashboard Cite

show abstract

“…In the scheme, a source node forwards its packets to a certain number of relay nodes, which hold these packets until meeting the destinations. Many geographic routing schemes [2,10,11,13,17,20,22,23,29,41] have been proposed in MANETs. In the geographic routing, relying on GPS, a node knows the geographic locations of the destination and its neighbours and forwards a message to the node geographically closest to the destination.…”

Section: Related Workmentioning

confidence: 99%

“…As the faces of planar are continuous from source nodes to destination nodes, the messages will not halt at nodes just because there is no closer neighbour to the destination node. Later on, several other geographic routing mechanisms were proposed for guaranteed message delivery [2,11]. In the mechanisms, the entire network is partitioned into faces that are bounded by polygons made up of edges of the network.…”

Section: Related Workmentioning

confidence: 99%

A direction-based geographic routing scheme for intermittently connected mobile networks

Shen

2013

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

In an intermittently connected mobile network, a complete routing path from a source to a destination cannot be guaranteed most of the time. Therefore, traditional routing methods for mobile ad hoc networks are not applicable in such a network. Current approaches for intermittently connected mobile networks are primarily based on redundant transmission and single-copy opportunistic routing. However, they incur either high overhead due to excessive transmissions, or long delay due to incorrect path choices during forwarding. In this paper, we propose a direction-based geographic (DIG) routing scheme for intermittently connected mobile networks. Relying on geographic location information, the packets are routed in a path approximately to the shortest path from the source node to the destination, which significantly reduces the overhead in redundant transmission and decreases the transmission delay in the single-copy opportunistic routing. Theoretical analysis and trace-driven experimental results show that DIG provides low transmission delay with low overhead in comparison with the schemes in the redundant transmission and single-copy opportunistic routing.

show abstract

“…Subsequent to the work in [10], Hoffmann et al [11] proved that the online searcher's tour is less than 26.5 times as long as the shortest watchman tour. Recently, several papers have also dealt with other online formulations of the traveling salesperson problem and online routing problems (e.g., [2,4,14]). Especially, Diks, Fraigniaud, Kranakis, and Pelc [7], and Fraigniaud, Ilcinkas, and Pelc [8] investigated the relationship between the memory size of a searcher and his/her exploration capability on unknown undirected graphs.…”

Section: Related Workmentioning

confidence: 99%