Providing Probabilistic Guarantees on the Time of Information Spread in Opportunistic Networks

被引:0
作者
Kim, Yoora [1 ]
Lee, Kyunghan [2 ]
Shroff, Ness B. [1 ,3 ]
Rhee, Injong [4 ]
机构
[1] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
[2] UNIST, Sch Elect & Comp Engn, Ulsan, South Korea
[3] Ohio State Univ, Dept Comp Sci & Engn, Columbus, OH 43210 USA
[4] N Carolina State Univ, Dept Comp Sci, Raleigh, NC 27695 USA
来源
2013 PROCEEDINGS IEEE INFOCOM | 2013年
基金
美国国家科学基金会;
关键词
EPIDEMIC;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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., alpha) of the agents, i.e., the so-called average completion time E(T-alpha). We claim that providing probabilistic guarantee on the time for the spread T-alpha 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(alpha,beta) that denotes the time required to guarantee a completion with probability beta, and develop a new framework to characterize the distribution of T-alpha 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.
引用
收藏
页码:2067 / 2075
页数:9
相关论文
共 24 条
  • [1] AALEN OO, 1995, SCAND J STAT, V22, P447
  • [2] Andersson H., 2012, STOCHASTIC EPIDEMIC, V151
  • [3] [Anonymous], MOBIHOC 09
  • [4] [Anonymous], 2006, P IEEE INFOCOM
  • [5] Bremaud Pierre., 2008, Markov Chains
  • [6] Conan V., 2007, PROC ACM AUTONOMICS
  • [7] Optimal and Scalable Distribution of Content Updates over a Mobile Social Network
    Ioannidis, Stratis
    Chaintreau, Augustin
    Massoulie, Laurent
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1422 - +
  • [8] Information Propagation Speed in Mobile and Delay Tolerant Networks
    Jacquet, Philippe
    Mans, Bernard
    Rodolakis, Georgios
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) : 5001 - 5015
  • [9] Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet
    Juang, P
    Oki, H
    Wang, Y
    Martonosi, M
    Peh, LS
    Rubenstein, D
    [J]. ACM SIGPLAN NOTICES, 2002, 37 (10) : 96 - 107
  • [10] Small but slow world: How network topology and burstiness slow down spreading
    Karsai, M.
    Kivela, M.
    Pan, R. K.
    Kaski, K.
    Kertesz, J.
    Barabasi, A. -L.
    Saramaki, J.
    [J]. PHYSICAL REVIEW E, 2011, 83 (02):