P2P content sharing in spontaneous multi-hop wireless networks

Sbai, Mohamed Ali; Salhi, Emna; Barakat, Chadi

doi:10.1109/comsnets.2010.5432005

Cited by 15 publications

(17 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With regard to content selection and sharing, several systems have been proposed [23], [13], [12], [22], [24], [25], [26], since data dissemination in opportunistic networks has been the subject of several studies in the latest years [27], [28], [29]. Most of these solutions aim at constructing and maintaining an overlay network.…”

Section: Related Workmentioning

confidence: 98%

“…Several solutions have been proposed to adapt BitTorrent to opportunistic and ad hoc networks. BitHoc uses a neighbor-location based piece selection mechanism, forcing nodes to download pieces only from nearby neighbors [11], [12]. Gaddam et al consider random first piece with rarest piece and strict priority as the best performing strategy against pure random and pure rarest-first strategies [13].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

EPICS: Fair Opportunistic Multi-Content Dissemination

Belblidia

Sammarco

Costa

et al. 2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Achieving efficient content dissemination in mobile opportunistic networks becomes a big challenge when content sizes are large and require more capacity than what contact opportunities between nodes may offer. Content fragmentation solves only part of the problem, as nodes still need to decide which fragment to send when a contact happens. To address this problem, we propose EPICS, a protocol designed to quickly exchange large contents in opportunistic networks. Using grey relational analysis, EPICS is able to balance the distribution of contents that have different sizes and creation times, providing fairer delay distribution and faster dissemination. We implemented and evaluated EPICS through real experimentation using Android devices. Results show that EPICS significantly reduces content dissemination delays when compared to classic approaches.

show abstract

Section: Related Workmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

EPICS: Fair Opportunistic Multi-Content Dissemination

Belblidia

Sammarco

Costa

et al. 2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Several solutions have been proposed to adapt BitTorrent to opportunistic and Ad Hoc networks [15], [16], [17]. Most of these adaptations, however, aim at constructing and maintaining an overlay network that enables multi-hop message routing.…”

Section: Related Workmentioning

confidence: 99%

PACS: Chopping and shuffling large contents for faster opportunistic dissemination

Belblidia

Amorim

Costa

et al. 2011

2011 Eighth International Conference on Wireless on-Demand Network Systems and Services

View full text Add to dashboard Cite

Abstract-A common assumption in intermittently-connected (or opportunistic) mobile networks is that any contact has enough capacity to transfer the required amount of data. Although such an assumption is reasonable for analytical purposes and when contents are small, it does not hold anymore when nodes produce contents that are larger than the capacity of a contact. In such a case, nodes must slice data and send fragments separately, which allows better use of short contacts and progressive dissemination of large contents data pieces. The question here is to design the best strategy for deciding which piece(s) to transmit whenever nodes meet. In this paper, we present the design and evaluation of PACS (Prevalence-Aware Content Spreading), a completely distributed algorithm that selects pieces to transfer based on their popularity. We evaluate the performance of PACS using both synthetic and real traces from intermittently-connected networks. When compared with sequential and randomized solutions, we show that PACS significantly outperforms these approaches both in terms of latency to achieve full dissemination and ratio of effective contacts. Moreover, PACS achieves performance levels that are extremely close to a centralized version based on an oracle.

show abstract

“…1: plain AODV, VNAODV on top of the VNLayer, VNAODV þ on top of the VNLayer þ, OLSR (Clausen et al, 2003) and ARA (Guenes et al, 2002). AODV, OLSR and ARA are the most representative examples of routing algorithms used for P2P distribution of contents in MANETs, along with DSDV (Perkins and Bhagwat, 1994) (an antecedent of OLSR) and Bee (Wedde and Farooq, 2005) (conceptually similar to ARA) (Gurumurthy, 2009;Tang et al, 2005;Sbai et al, 2010;Hwang and Hoh, 2009;Dhurandher et al, 2009;Castro et al, 2010;Barbeau, 2012;Wang et al, 2014).…”

Section: Introductionmentioning

confidence: 98%