GeoDTN: Geographic Routing in Disruption Tolerant Networks

Link, Jó Ágila Bitsch; Schmitz, Daniel; Wehrle, Klaus

doi:10.1109/glocom.2011.6134040

Cited by 34 publications

(18 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…GeoDTN [20] addresses geographic routing in DTNs. It is based on a routing heuristic that relies on a mobility model which is determined by leveraging the past geographic movement patterns of surrounding nodes.…”

Section: Georoutingmentioning

confidence: 99%

Query-response geocast for vehicular crowd sensing

Timpner

Wolf

2016

Ad Hoc Networks

View full text Add to dashboard Cite

Section: Georoutingmentioning

confidence: 99%

Query-response geocast for vehicular crowd sensing

Timpner

Wolf

2016

Ad Hoc Networks

View full text Add to dashboard Cite

“…This protocol is quite similar to our proposed scheme but the forwarding decision is only made by a stationary source and not the intermediate vehicles. The protocols in [7][8][9] are proposed for city environments and all of these protocols follow different rules for selecting the next neighbor vehicle. All these DTN protocols consider a fixed destination that will receive the intended data packets.…”

Section: Related Workmentioning

confidence: 99%

“…In [4][5][6][7][8][9], the authors have proposed different protocols for DTNs in VANET. All of these protocols employ the store-carry-forward mechanism but they use different approaches for selecting the next intermediate vehicle to deliver the packet to its destination when a current vehicle meets with a set of intermediate neighbor vehicles.…”

Section: Introductionmentioning

confidence: 99%

Minimum delay routing protocol for DTN-enabled VANETs

Khan

Kum

Nam

et al. 2012

2012 18th Asia-Pacific Conference on Communications (APCC)

View full text Add to dashboard Cite

In vehicular ad hoc networks, the end-to-end path between the source and destination vehicle is not guaranteed due to frequent network partitioning caused by fast moving vehicles. For such sparse networks, Delay Tolerant Networks are proposed where a packet is carried by an intermediate vehicle until it meets with another vehicle or destination. This approach introduces variable amounts of delays in the networks. Therefore, an intelligent decision is required to select the next intermediate vehicle that can deliver a packet to the destination as soon as possible without any further delays. In this paper, we introduce a minimum delay routing protocol that utilizes the neighbor vehicles' velocity and distance from destination information to calculate the delivery delay for intermediate vehicles. The performance of the proposed scheme is compared with FFRDV. Using an ns-2 simulation, we have verified that our scheme shows better performance and reduces end-to-end delay and average inter-meeting time by 70% as compared to FFRDV.

show abstract

“…Routing in DTNs has been widely studied in recent years [4], [9]- [14]. These methods can generally be classified into two groups: probabilistic routing methods [9]- [12] and geographical routing methods [4], [13], [14]. In the former group, RAPID [9] and MaxContribution [10] predict a node's future encountering probability with the destination based on previous encountering records and forward packets to nodes with higher probability of meeting their destinations.…”

Section: Introductionmentioning

confidence: 99%

DSearching: Distributed searching of mobile nodes in DTNs with floating mobility information

Chen

Shen

2014

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

In delay tolerant networks (DTNs), enabling a node to search and find an interested mobile node is an important function in many applications. However, the movement of nodes in DTNs makes the problem formidable. Current methods in disconnected networks mainly rely on fixed stations and infrastructurebased communication to collect node position information, which is difficult to implement in DTNs. In this paper, we present DSearching, a distributed mobile node searching scheme for DTNs that requires no infrastructure except the GPS on mobile nodes. In DSearching, the entire DTN area is split into subareas, and each node summarizes its mobility information as both transient sub-area visiting record and long-term movement pattern among sub-areas. Each node distributes its transient visiting record for a newly entered sub-area to nodes that are likely to stay in the sub-area that it just moves out, so that the information flows in the network for the locator to trace it along its actual movement path. Each node also stores different parts of its long-term mobility pattern to long-staying nodes in different sub-areas for the locator to trace it when visiting records are absent. Considering that nodes in DTNs usually have limited resources, DSearching constrains the communication and storage cost in the information distribution process. Extensive trace-driven experiments with real traces demonstrate the high efficiency and high effectiveness of DSearching.

show abstract

GeoDTN: Geographic Routing in Disruption Tolerant Networks

Cited by 34 publications

References 9 publications

Query-response geocast for vehicular crowd sensing

Query-response geocast for vehicular crowd sensing

Minimum delay routing protocol for DTN-enabled VANETs

DSearching: Distributed searching of mobile nodes in DTNs with floating mobility information

Contact Info

Product

Resources

About