Loading...

Scalable performance analysis of epidemic routing considering skewed location visiting preferences

Rashidi, L ; Sharif University of Technology | 2019

594 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/MASCOTS.2019.00029
  3. Publisher: IEEE Computer Society , 2019
  4. Abstract:
  5. This paper investigates the performance of epidemic routing, in mobile social networks (MSNs), which makes use of the store-carry-forward paradigm for communication. Real-life mobility traces show that people have skewed location visiting preferences, with some places visited frequently and some others infrequently. In order to model epidemic routing in MSNs, we first analyze the time taken for a node to meet the first node belonging to a set of nodes restricted to move in a specific subarea. Afterwards, a monolithic stochastic reward net (SRN) is proposed to evaluate the delivery delay and the average number of transmissions under epidemic routing by considering skewed location visiting preferences. This monolithic model is not scalable enough, in terms of the number of nodes and frequently visited locations. In order to achieve higher scalability, the folding technique is applied to the monolithic SRN and an approximate folded SRN is proposed to evaluate the performance of epidemic routing. Discrete-event simulation is applied to cross-validate the proposed models. Results indicate that the monolithic model has higher accuracy in predicting the performance of epidemic routing. The approximate folded model also achieves a good accuracy and can be solved for a network with a large number of nodes/frequently visited locations. This model is more accurate than the ordinary differential equation approach. © 2019 IEEE
  6. Keywords:
  7. Performance analysis ; Routing ; Delay tolerant networks ; Discrete event simulation ; Epidemiology ; Location ; Ordinary differential equations ; Social networking (online) ; Stochastic systems ; Folding technique ; Mobile social network (MSNs) ; Mobile social networks ; Scalable performance ; Stochastic reward nets ; Store-carry-forward paradigms ; Network routing
  8. Source: 27th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 2019, 22 October 2019 through 25 October 2019 ; Volume 2019-October , 2019 , Pages 201-213 ; 15267539 (ISSN); 9781728149509 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/8843121