Skip to main content

The ONE Knowledge Base

The Opportunistic Network Environment (ONE) simulator has become largely popular and widely used in research on DTNs and Opportunistic Networks. The simulator has an associated friendly community, where users can ask questions and get their doubts clarified. Indeed, the community is vibrant and its members are useful. However, there are two issues with this community.

First, the archives of the community's mailing list are not public. This is unlike many other similar lists hosted using Mailman, which are public and, therefore, can be searched using Google. Hence, time and again people have asked the question -- how to search the email archives?

The second issue is largely due to the first. Due to the lack of searching facility over the archives, often same question tend to be asked by the new users repeatedly. People here are patient enough to reply to them. But such necessity could be entirely discounted had there been a facility to search the archives. In particular, it would be useful to point to the users the specific emails matching one or more user provided search keyword(s).

Enter the ONE Knowledge Base (ONE KB) to the rescue!

The ONE KB is an online platform meant for searching the email archives of the community's mailing list. This will, therefore, enable the users of the ONE simulator to search using suitable keywords if their query has already been answered earlier.

Similar to other search engines, the ONE KB presents a list of matching documents (emails in this context) based on the input keyword(s). A user can click on these individual items to view the corresponding email in detail. As of today, the archives from November 2007 to April 2014 have been indexed. So, next time you have a question, give the ONE KB a try :)

However, please note that this is no alternative to actual mailing list pointed above.


  1. hi,
    i have two questions:
    1.By changing node selfish degree how to calculate no.of selfish nodes? much selfish node can detect using this function(/**
    * Returns if the nodes wants to cooperate or not
    public boolean wantToCooperate() {

    if (this.selfishdegree <= 0)
    return true;

    Calendar cal = Calendar.getInstance();
    Random n = new Random(cal.getTimeInMillis());
    int rn = (n.nextInt(100)+1);
    if (rn > this.selfishdegree)
    return true;
    return false;
    please answers me of these questions.
    Atul Sharma
    (DCRUST Murthal)

    1. Hi Atul,

      Perhaps it would be helpful if you contact the author of the above code :)

    2. hey acually they don't reply my email that's why i ask these queries to you if possible please help its really urgent

  2. Docuspace provides clean and simple design eliminates frustration and promotes productivity so you can setup and use our platform with as little friction as possible. You don't need to be an IT genius to set up and configure our platform; you can get it up and running in a matter of minutes.


Post a Comment

Popular posts from this blog

Text Highlighting in Latex

While preparing a manuscript with Latex, it is often useful to highlight the changes made in the current revision with a different color. This can be achieved using the \ textcolor command provided by Latex. For example, \textcolor {red}{Hello World} would display the string "Hello World" in red color. However, the final/published copy of the manuscript does not contain any highlighted text. Therefore, if a large volume of changes were made, it becomes tiresome at the end to find and remove all the individual portions of highlighted text. This can be circumvented by defining a utility command to switch highlighting on and off as desired. In the following, we define a new Latex command, highlighttext , for this purpose. The command takes only a single argument—the text to be highlighted.     \usepackage {color}    % For highlighting changes in this version with red color   \newcommand { \highlighttext }[1] { \textcolor {red}{#1}}   % Remove all text highlighting

Commonly Used Metrics for Performance Evaluation

The following metrics are commonly used when evaluating scenarios related to DTN protocols. Delivery ratio of the messages, Average message delivery latency Overhead ratio (of the underlying routing mechanism) Suppose that $M$ be the set of all messages created in the network and $M_d$ be the set of all messages delivered. Then, the delivery ratio is computed as $|M_d| / |M|$. Now let the $i^{th}$ delivered message was created at time $c_i$ and delivered at time $d_i$. Then the average message delivery latency is computed as $(\sum_{i = 1}^{|M_d|} (d_i - c_i)) / |M_d|$. Note that, in Statistics, mean, median and mode are all the measures of average. But "loosely speaking", unless otherwise specified, we refer to the "mean" value when we say "average." Nevertheless, the MessageStatsReport in the ONE simulator provides a measure of both the mean and median values wherever appropriate. One may refer the above metric as "end-to-end delay.

The ONE KB has a new home

The ONE Knowledge Base is now hosted at If you are unaware, the ONE KB allows you to search the old email archives of the simulator's community. Therefore, if you have any question related to simulation, you may query the existing database at the above link. Chances are good that your question might already have been answered previously. If not, you can still post an email to the community's mailing list. Have you tried the ONE KB already? How was your experience? Was it helpful? Let me know in the comments!