Simple Distributed Community Detection for The One Simulator

In the implementation of the Simple algorithm [Distributed Community Detection in Delay Tolerant Networks Pan Hui, Eiko Yoneki, Shu-yan Chan and Jon Crowcroft Sigcomm Workshop MobiArch '07, August, Kyoto, Japan] by PJ Dillon for The One Simulator, updates to communities are only recalculated when connections between devices end. Furthermore devices are always added to a local community whenever the familiar threshold is satisfied and community similarity is always checked regardless of encounter time. We believe this implementation would not work well in cases where nodes are connected for long periods of time and have therefore created a new version available to download here:

The new version does not work with the Decision Engine Router either , for simplification of updating nodes every simulator tick. The code is quick and dirty and as a result has many old comments and debug methods left in but if you are familiar with Simple you should be able to work it out.

  1. SimpleRouter.java
  2. SimpleRouterPromote.java Simple plus devices being added to local communities who are "most familiar".


 

This entry was posted in ONE Simulator, Simulation, Social Data Analysis. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>