Transaction of the Japan Society for Simulation Technology
Online ISSN : 1883-5058
Print ISSN : 1883-5031
Paper
A Consideration on Applying a Covering Problem in Network Theory to Information Floating
Atsushi KashiwabaraShun MatsumotoHiroshi TamuraKeisuke NakanoMasakazu Sengoku
Author information
JOURNALS FREE ACCESS

Volume 9 (2017) Issue 4 Pages 73-78

Details
Download PDF (1732K) Contact us
Abstract

  Epidemic routing can deliver messages in the case where there is never a connected path from source to destination. By using Epidemic routing repeatedly, the technique called Information Floating can maintain information in specific area. Information Floating is more effective when there are many mobile nodes. We consider effect of public space on information floating. A public space is a social space and mobile nodes are easy to gather in the space. If we can identify a place that is not a public space but where information tends to stay, it will maintain more information. We introduce to use a covering problem to identify this place. A covering problem is one of location problems that find the best place on road networks, communication networks, etc. In this paper, we identify where to put the fixed stations with information by applying a covering problem, and we show its effectiveness in computer simulation.

Information related to the author
© 2017 Japan Society for Simulation Technology
Next article

Recently visited articles
feedback
Top