Barun Saha's blog on AI and Networks

Opportunistic Mobile Networks: Advances and Applications is our forthcoming textbook to be published by Springer in 2016. This book is a result of our years of experience in research and development in this domain. #TheOMNBook, if you may say, deals with fundamental challenges in OMNs as well as contemporary research issues. These include, but not limited to, routing, mobility, cooperation, heterogeneity, and emotions. An entire chapter is dedicated to protocol development and testing using the ONE simulator. #TheOMNBook is shaped in a way to cater both beginning and advanced level readers. Contextual examples are provided to ensure better understanding of related topics. The chapters come with plenty of hands-on exercises. Several illustrations and other visual elements are used to make reading the book a pleasant experience. Whether you are a seasoned researcher looking for novel cross-dimensional ideas or a beginner to this field, give #TheOMNBook a try! Learn more about our...

At times, users have reported of runtime exceptions while running a simulation that uses PRoPHET. The error signature looks like the following. Exception in thread "main" java.lang. IllegalArgumentException : Comparison method violates its general contract! at java.util. TimSort .mergeHi( Unknown Source) at java.util.TimSort.mergeAt( Unknown Source) at java.util.TimSort. mergeCollapse(Unknown Source) at java.util.TimSort.sort(Unknown Source) at java.util.Arrays.sort(Unknown Source) at java.util.ArrayList.sort( Unknown Source) at java.util.Collections.sort( Unknown Source) It may be noted that the default sorting algorithm has changed since Java 7 — rather than Merge sort, Tim sort is now used by default. However, it seems like it is possible to override the default sorting algorithm in Java using the following argument to the JVM. -Djava.util.Arrays.useLegacyMergeSort=true The execution command in the one.sh (or one.bat) file should be up...

One of the frequently asked questions in the community is how to specify which particular nodes would act as source(s) and destination(s) of the messages created in the ONE simulator. The simulator, in fact, provides a pair of settings (shown below in bold face) aimed for this particular purpose. Let us consider that there are $n + 1$ nodes in an OMN.  Further, let the nodes with addresses from $x$ to $y$, both inclusive, would create messages. The nodes in the range $w$ to $z$, both inclusive, would be the destinations of those messages, where $0 \le x \le y \le n$, and $0 \le w \le z \le n$. Then, the corresponding simulation scenario can be configured as follows. ## Message creation parameters # How many event generators Events.nrof = 1 # Class of the first event generator Events1.class = MessageEventGenerator # (Following settings are specific for the MessageEventGenerator class) # Creation interval in seconds (one new message every 25 to 35 seconds) Events1.interval ...

The DTN blog recently reached a milestone — it crossed 50,000 page views! The journey of this blog — and that of mine with the ONE simulator — started in 2011. Back in those days, old-timers would recall, there were not much resources available on the ONE simulator. After spending some time with it, I was finally able to gain some understanding about its functionality and work flow. I realized that a short how-to document might benefit others. What started as a humble effort to provide a quick tutorial on the ONE simulator soon became a popular resource in the community over the years. I'm thankful to all the users of the ONE mailing list who continuously kept me motivated to enrich this blog. I took this opportunity to prepare an infographic on the usage of the DTN blog based on the statistics provided by Blogger. It has not been possible to include all statistics in the infographic. A few interesting observations are noted below. Undoubtedly, the ONE tutorial is the mos...

The ONE Knowledge Base is having some temporary issues. The search facility is not working currently. Will update soon after it is resolved. Any inconvenience caused is regretted. Update 10 January 2015: The issue has been fixed. Archives till December 2014 are now available for searching.