Analysis of relay protocols for throwbox-equipped DTNs

Ibrahim, Mouhamad; Nain, Philippe; Carreras, Iacopo

doi:10.1109/wiopt.2009.5291625

Cited by 30 publications

(20 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each home supports a virtual box [25] which has a priority to spread the messages. The mobile nodes including the source dump all copies to the home firstly (homing phase), then the home sprays …”

Section: Oppo: Preliminariesmentioning

confidence: 99%

OPPO: An optimal copy allocation scheme in mobile opportunistic networks

Yuan

Wang

2016

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Mobile Opportunistic Networks (MONs) use the store-carry-and-forward scheme to transmit packets, so as to deal with the intermittently connected links. This new communication paradigm makes them very different from the traditional multi-hop wireless networks. To improve the delivery performance, some smart forwarding schemes have been proposed by injecting multiple copies of packets into the temporal network. Unfortunately, these schemes allocate data copies following the aggregate contact information, i.e., information obtained by considering the samples from all pairs. They ignore the individual contact feature of nodes. We show that the aggregate contact can be very different from the contact of individual pairs, therefore, using the former to guide copy allocation is not correct in general, although it works well in some cases. In this paper, we propose OPPO, an optimal copy allocation scheme in MONs. OPPO exploits the transient contact ratio of nodes to spray data copies. Theoretical analysis proves that OPPO achieves the optimal delivery delay, and experimental results verify it simultaneously improves the packet delivery ratio compared to the SprayWait and HS, two state-of-the-art works.

show abstract

Section: Oppo: Preliminariesmentioning

confidence: 99%

OPPO: An optimal copy allocation scheme in mobile opportunistic networks

Yuan

Wang

2016

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

show abstract

“…Based on this social characteristic, a home-aware community model was proposed in which mobile users with a common interest form, by themselves, a community where the frequently visited location is their common home. Similarly to [106], the authors assume that each home supports a real or virtual throwbox [107], i.e., a local device that can temporarily store and transmit messages.…”

Section: Caormentioning

confidence: 99%

Betweenness centrality in Delay Tolerant Networks: A survey

et al. 2015

View full text Add to dashboard Cite

“…Nodes can communicate with each other when they visit the same small square. Each home is equipped with a virtual throwbox [15] for virtual storage. In each evaluation, we randomly generate 10, 000 messages, whose sources and destinations are assigned uniformly random among the n nodes.…”

Section: B Simulation Settings and Metricsmentioning

confidence: 99%

“…In contrast, the existing works on throwboxes mainly focus on the capacity and delivery delay of the Epidemic algorithm when adding throwboxes into MSNs [15], [18]. Moreover, these throwboxes are randomly placed, and usually they are physical storage devices.…”

Section: Related Workmentioning

confidence: 99%

“…Many mobility models [10]- [14] capture this characteristic of skewed location visiting preferences from several real MSN traces. Besides, we assume that each home supports a virtual throwbox [15], a mechanism that can store a message at a local storage device, or at another node currently at the same home. A message holder is either a mobile node or a home that has message copies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Homing spread: Community home-based multi-copy routing in mobile social networks

Xiao

Huang

2013

2013 Proceedings IEEE INFOCOM

118

View full text Add to dashboard Cite

Abstract-A mobile social network (MSN) is a special delay tolerant network (DTN) composed of mobile nodes with social characteristics. Mobile nodes in MSNs generally visit community homes frequently, while other locations are visited less frequently. We propose a novel zero-knowledge MSN routing algorithm, homing spread (HS). The community homes have a higher priority to spread messages into the network. Theoretical analysis shows that the proposed algorithm can spread a given number of message copies in an optimal way when the inter-meeting times between any two nodes and between a node and a community home follow exponential distributions. We also calculate the expected delivery delay of HS. In addition, extensive simulations are conducted. Results show that community homes are important factors in efficient message spreading. By using homes to spread messages faster, HS achieves a better performance than existing zero-knowledge MSN routing algorithms, including Epidemic, with a given number of copies, and Spray&Wait.

show abstract

Analysis of relay protocols for throwbox-equipped DTNs

Cited by 30 publications

References 16 publications

OPPO: An optimal copy allocation scheme in mobile opportunistic networks

OPPO: An optimal copy allocation scheme in mobile opportunistic networks

Betweenness centrality in Delay Tolerant Networks: A survey

Homing spread: Community home-based multi-copy routing in mobile social networks

Contact Info

Product

Resources

About