On Stochastic Confidence of Information Spread in Opportunistic Networks
Cited 0 times inCited 0 times in
- On Stochastic Confidence of Information Spread in Opportunistic Networks
- Kim, Yoora; Lee, Kyunghan; Shroff, Ness B.
- Issue Date
- IEEE COMPUTER SOC
- IEEE TRANSACTIONS ON MOBILE COMPUTING, v.15, no.4, pp.909 - 923
- Predicting spreading patterns of information or virus has been a popular research topic for which various mathematical tools have been developed. These tools have mainly focused on estimating the average time of spread to a fraction (e.g.,α) of the agents, i.e., so-called average -completion time E(T). We claim that understanding stochastic confidence on the time T rather than only its average gives more comprehensive knowledge on the spread behavior and wider engineering choices. Obviously, the knowledge also enables us to effectively accelerate or decelerate a spread. To demonstrate the benefits of understanding the distribution of spread time, we introduce a new metric G, that denotes the time required to guarantee completion (i.e., penetration) with probability . Also, we develop a new framework characterizing G, for various spread parameters such as number of seeders, contact rates between agents, and heterogeneity in contact rates. We apply our technique to a large-scale experimental vehicular trace and show that it is possible to allocate resources for acceleration of spread in a far more elaborated way compared to conventional average-based mathematical tools.
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.