File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이경한

Lee, Kyunghan
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace IT -
dc.citation.conferencePlace Turin -
dc.citation.endPage 2075 -
dc.citation.startPage 2067 -
dc.citation.title IEEE International Conference on Computer Communications -
dc.contributor.author Kim, Yoora -
dc.contributor.author Lee, Kyunghan -
dc.contributor.author Shroff, Ness B. -
dc.contributor.author Rhee, Injong -
dc.date.accessioned 2023-12-20T01:07:33Z -
dc.date.available 2023-12-20T01:07:33Z -
dc.date.created 2015-08-07 -
dc.date.issued 2013-04-17 -
dc.description.abstract A variety of mathematical tools have been developed for predicting the spreading patterns in a number of varied environments including infectious diseases, computer viruses, and urgent messages broadcast to mobile agents (e.g., humans, vehicles, and mobile devices). These tools have mainly focused on estimating the average time for the spread to reach a fraction (e.g., α) of the agents, i.e., the so-called average completion time E(Tα). We claim that providing probabilistic guarantee on the time for the spread Tα rather than only its average gives a much better understanding of the spread, and hence could be used to design improved methods to prevent epidemics or devise accelerated methods for distributing data. To demonstrate the benefits, we introduce a new metric Gα,β that denotes the time required to guarantee α completion with probability β, and develop a new framework to characterize the distribution of Tα for various spread parameters such as number of seeds, level of contact rates, and heterogeneity in contact rates. We apply our technique to an experimental mobility trace of taxies in Shanghai and show that our framework enables us to allocate resources (i.e., to control spread parameters) for acceleration of spread in a far more efficient way than the state-of-the-art. -
dc.identifier.bibliographicCitation IEEE International Conference on Computer Communications, pp.2067 - 2075 -
dc.identifier.doi 10.1109/INFCOM.2013.6567008 -
dc.identifier.issn 0743-166X -
dc.identifier.scopusid 2-s2.0-84883056491 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/32837 -
dc.identifier.url http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6567008 -
dc.language 영어 -
dc.publisher IEEE -
dc.title Providing Probabilistic Guarantees on the Time of Information Spread in Opportunistic Networks -
dc.type Conference Paper -
dc.date.conferenceDate 2013-04-14 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.