On Stochastic Confidence of Information Spread in Opportunistic Networks

被引:1
|
作者
Kim, Yoora [1 ]
Lee, Kyunghan [2 ]
Shroff, Ness B. [3 ,4 ]
机构
[1] Univ Ulsan, Dept Math, Ulsan, South Korea
[2] UNIST, Sch Elect & Comp Engn, Ulsan, South Korea
[3] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
[4] Ohio State Univ, Dept Comp Sci & Engn, Columbus, OH 43210 USA
基金
新加坡国家研究基金会; 美国国家科学基金会;
关键词
Information spread; CTMC analysis; spread time analysis; spread time distribution; KRYLOV SUBSPACE APPROXIMATIONS; MATRIX;
D O I
10.1109/TMC.2015.2431711
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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., alpha) of the agents, i.e., so-called average alpha-completion time E(T-alpha). We claim that understanding stochastic confidence on the time T-alpha 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(alpha,beta) that denotes the time required to guarantee alpha completion (i.e., penetration) with probability beta. Also, we develop a new framework characterizing G(alpha,beta) 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.
引用
收藏
页码:909 / 923
页数:15
相关论文
共 50 条
  • [31] Nonextensive information entropy for stochastic networks
    Wilk, G
    Wlodarczyk, Z
    ACTA PHYSICA POLONICA B, 2004, 35 (02): : 871 - 879
  • [32] Distributed Stochastic Optimization in Opportunistic Networks: The Case of Optimal Relay Selection
    Picu, Andreea
    Spyropoulos, Thrasyvoulos
    PROCEEDINGS OF THE 5TH ACM WORKSHOP ON CHALLENGED NETWORKS (CHANTS '10), 2010, : 21 - 28
  • [33] Approximate Stochastic Dynamic Programming for Opportunistic Fair Scheduling in Wireless Networks
    Zhang, Zhi
    Moola, Sudhir
    Chong, Edwin K. P.
    47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 1404 - 1409
  • [34] Ensuring Persistent Content in Opportunistic Networks via Stochastic Stability Analysis
    Pajevic, Ljubica
    Fodor, Viktoria
    Karlsson, Gunnar
    ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS, 2018, 3 (04)
  • [35] Information Propagation through Opportunistic Communication in Mobile Social Networks
    Yahui Wu
    Su Deng
    Hongbin Huang
    Mobile Networks and Applications, 2012, 17 : 773 - 781
  • [36] Information Transmission Probability and Cache Management Method in Opportunistic Networks
    Wu, Jia
    Chen, Zhigang
    Zhao, Ming
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
  • [37] Opportunistic Geographical Information Dissemination via Public Transportation Networks
    Ma, Guoqing
    Zhao, Gang
    Huang, Minhuan
    Wang, Dongxia
    2008 INTERNATIONAL SEMINAR ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, PROCEEDINGS, 2008, : 586 - 589
  • [38] Relevant opportunistic information extraction and scheduling in heterogeneous sensor networks
    Gulrez, T
    Challa, S
    Yaqub, T
    Katupitiya, J
    IEEE CAMSAP 2005: FIRST INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING, 2005, : 161 - 164
  • [39] Information Theory Based Opportunistic Sensing in Radar Sensor Networks
    Maherin, Ishrat
    Liang, Qilian
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2014, 2014, 8491 : 706 - 717
  • [40] Information Propagation through Opportunistic Communication in Mobile Social Networks
    Wu, Yahui
    Deng, Su
    Huang, Hongbin
    MOBILE NETWORKS & APPLICATIONS, 2012, 17 (06): : 773 - 781