The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing

Tournoux, P; Leguay, Jérémie; Benbadis, Farid; Conan, Vania; Amorim, Marcelo Dias de; Whitbeck, John

doi:10.1109/infcom.2009.5062024

Cited by 143 publications

(164 citation statements)

References 13 publications

Supporting

Mentioning

162

Contrasting

Order By: Relevance

“…To make these results statistically reliable, we only considered corresponding tuples with instance counts higher than a threshold and looked at the [15], the results get closer for some thresholds. Consequently, these results show that CIT metric can provide more accurate prediction than SIT metric for different environments.…”

Section: Discussionmentioning

confidence: 99%

“…Several experiments in different environments (office [14], conference [30], city [28], skating tour [15]) with different objects (human [12], bus [13]) and with variable number of attendants were performed. From the analysis of the data sets collected during these experiments, significant results about the aggregate and pairwise mobility characteristics of real objects were obtained and different kinds of algorithms using different metrics developed for efficient routing of messages in DTNs.…”

Section: Conditional Intermeeting Timementioning

confidence: 99%

“…Even though the previous studies modeled the node relations (i.e., intermeeting times) using different distributions (exponential [7] [31], log-normal [15]) and developed their routing metrics accordingly, they assumed that the meetings of a node with other nodes is independent of each other. The future meetings of two nodes are predicted looking at the meetings of only these two nodes in the past.…”

Section: Conditional Intermeeting Timementioning

confidence: 99%

“…First, the future meetings of nodes can be predicted from their past relations using some distribution functions (e.g. log-normal [14] [15]). Second, most of the previous routing protocols assume that meetings of a node with other nodes are independent from each other.…”

Section: Introductionmentioning

confidence: 99%

“…Different than our initial work [37], we also present statistical results from four different data sets (RollerNet [15], Cambridge [28], Haggle [30], MIT [36]) which contain the contact traces of real objects logged during real life experiments.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Utilizing correlated node mobility for efficient DTN routing

Bulut

Geyik

Szymanski

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly not known. Therefore, effective forwarding based on limited knowledge of contact behavior of nodes is challenging. Most of the previous studies assumed that mobility of a node is independent from mobility of other nodes and looked at only the pairwise node relations to decide routing. In contrast, in this paper, we analyze the temporal correlation between the meetings of each node with other nodes and utilize this correlation for efficient routing. We introduce a new metric called conditional intermeeting time (CIT), which computes the average intermeeting time between two nodes relative to a meeting with a third node. Then, we modify existing DTN routing protocols using the proposed metric to improve their performance. Extensive simulations based on real and synthetic DTN traces show that the modified algorithms perform better than the original ones.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Conditional Intermeeting Timementioning

confidence: 99%

Section: Conditional Intermeeting Timementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Utilizing correlated node mobility for efficient DTN routing

Bulut

Geyik

Szymanski

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

show abstract

Elastic Mobile Device Clouds

et al. 2017

View full text Add to dashboard Cite

Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems

Li¹,

Yang

Fan

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

Summary This paper investigates the selfish load balancing problem in mobile distributed crowdsourcing networks. Conventional methods heavily relied on cooperation among users to achieve balanced resource utilization in a platform‐centric view. In achieving fairly low communication and computational overhead, this work leverages the d‐choice method based on Ball and Bin theory for effective balancing under limited information and the Proportional Allocation scheme for selfish load balancing, maintaining good load balancing property among selfish users. Even with limited information, the balancing performance could be improved significantly. Moreover, theoretical analysis has been presented in convergence property. Extensive evaluations have been made to show that Chance‐Choice outperforms several existing algorithms. Typically, comparing with Proportional Allocation scheme, it could decrease the load gap between the maximum and the minimal in system by 50% to 80% and reduce the overhead complexity from O(n) to O(1) comparing with the Max‐weight Best Response algorithm, where n denotes the number of mobile users in a crowdsourcing system. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing

Cited by 143 publications

References 13 publications

Utilizing correlated node mobility for efficient DTN routing

Utilizing correlated node mobility for efficient DTN routing

Elastic Mobile Device Clouds

Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems

Contact Info

Product

Resources

About