Adyton by npapanik

Adyton is an event-driven network simulator, written in C++, for Opportunistic Networks (a.k.a. Delay-Tolerant Networks) that is capable of processing contact traces. The Adyton simulator includes a plethora of routing protocols and real-world contact traces. It also provides several congestion control mechanisms and buffer management policies.

Adyton was developed by Nikolaos Papanikos and Dimitrios-Georgios Akestoridis during their graduate studies in the Department of Computer Science and Engineering at University of Ioannina, Greece under the supervision of Prof. Evangelos Papapetrou.

For more information about installing and configuring Adyton check our wiki@github.

Adyton was a restricted area within Ancient Greek temples, where oracles and priests gave their oracular responses.

Features

Supported Contact Traces¹

Supported Routing Protocols

Supported Congestion Control Mechanisms²

Supported Scheduling Policies²

Supported Dropping Policies

Drop Front
Drop Tail
Drop Oldest
Drop Youngest
Drop Front - Avoid Source Packets
Drop Tail - Avoid Source Packets
Drop Oldest - Avoid Source Packets
Drop Youngest - Avoid Source Packets

Supported Deletion Mechanisms³

Just TTL
No Duplicates - Delete Replicas
No Duplicates - Keep Replicating
Vaccine
Cataclysm

1: Due to copyright restrictions, most contact traces cannot be directly included in Adyton. Instead, Adyton provides automated tools for processing and downloading them from the corresponding online sources. Further details about these tools can be found in the utils/trace-processing directory. For any questions or special requests please contact us.

2: Currently all congestion control mechanisms and some scheduling policies are supported only by single-copy routing protocols. Their use in multi-copy protocols is still experimental.

3: Deletion mechanisms are used only in the case of multi-copy routing protocols where multiple packet replicas exist throughout the network.

How to cite Adyton

When you write a paper that involves the use of Adyton, we would appreciate it if you can cite our tool using the following entry.

N. Papanikos, D.-G. Akestoridis, E. Papapetrou, "Adyton: A network simulator for opportunistic networks", 2015. [Online]. Available: https://github.com/npapanik/Adyton.
BibTeX entry:

@misc{Adyton,
author = {Papanikos, Nikolaos and Akestoridis, Dimitrios-Georgios and Papapetrou, Evangelos},
title = {Adyton: A Network Simulator for Opportunistic Networks},
howpublished = {[Online]. Available: https://github.com/npapanik/Adyton},
year = {2015}
}

Publications

Adyton has been used in the following publications:

D.-G. Akestoridis, N. Papanikos, and E. Papapetrou, "Exploiting Social Preferences for Congestion Control in Opportunistic Networks", in Proceedings of the 10th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2014, pp. 413-418. DOI: 10.1109/WiMOB.2014.6962204.
N. Papanikos, and E. Papapetrou, "Coordinating Replication Decisions in Multi-copy Routing for Opportunistic Networks", in Proceedings of the 10th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2014, pp. 8-13. DOI: 10.1109/WiMOB.2014.6962142.

License

Adyton is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

Adyton is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with Adyton. If not, see http://www.gnu.org/licenses/.

Authors and Contributors

Nikolaos Papanikos (@npapanik)
Dimitrios-Georgios Akestoridis (@akestoridis)
Evangelos Papapetrou