CRAWDAD metadata: vt/maniac (v. 2008-11-01)
The dataset comprises of routing and topology traces collected
during the Mobile Ad hoc Networks Interoperability And
Cooperation (MANIAC) Challenge, held on November 25-26th 2007
in conjunction with IEEE Globecom 2007.
[xml metadata]
Note: This metadata was prepared by the CRAWDAD team and verified by the data set (or tool) authors. We have made every effort to ensure its accuracy, but urge all users to consider the metadata and data carefully and be sure that their use in research is consistent with the nature and limitations of the data. We welcome any corrections. This metadata was prepared based on the following reference(s):
CRAWDAD metadata structure[what is CRAWDAD metadata]
- [Data]
- [Dataset]
vt/maniac (v. 2008-11-01) [what's new]
- [Traceset] vt/maniac/2007 (v. 2008-11-01) [what's new]
- [Trace] vt/maniac/2007/routing (v. 2008-11-01) [what's new] [download 476KB gz from: US UK] [download 496KB gz from: US UK] [download 416KB gz from: US UK]
- [Trace] vt/maniac/2007/topology (v. 2008-11-01) [what's new] [download 188KB gz from: US UK]
- [Traceset] vt/maniac/2007 (v. 2008-11-01) [what's new]
- [Dataset]
vt/maniac (v. 2008-11-01) [what's new]
- [Tools]
- [Authors]
- [Author] Amr Hilal
- [Author] Jawwad N Chattha
- [Author] Vivek Srivastava
- [Author] Michael S Thompson
- [Author] Allen B MacKenzie
- [Author] Luiz A DaSilva
- [Author] Pallavi Saraswati
- [Papers]
[Dataset] vt/maniac (v. 2008-11-01) | top |
| version | v. 2008-11-01 |
| changes | the initial version |
| bibtex |
@MISC{vt-maniac-2008-11-01,
author = {Amr Hilal and Jawwad N Chattha and Vivek Srivastava and Michael S Thompson and Allen B MacKenzie and Luiz A DaSilva and Pallavi Saraswati},
title = {{CRAWDAD} data set vt/maniac (v. 2008-11-01)},
howpublished = {Downloaded from http://crawdad.cs.dartmouth.edu/vt/maniac},
month = nov,
year = 2008
}
|
| metadata last modified | 2008-12-18 |
| summary | The dataset comprises of routing and topology traces collected during the Mobile Ad hoc Networks Interoperability And Cooperation (MANIAC) Challenge, held on November 25-26th 2007 in conjunction with IEEE Globecom 2007. |
| release date | 2008-11-01 |
| measurement start | 2007-11-25 |
| measurement end | 2007-11-26 |
| authors | Amr Hilal Jawwad N Chattha Vivek Srivastava Michael S Thompson Allen B MacKenzie Luiz A DaSilva Pallavi Saraswati |
| web site | http://www.maniacchallenge.org/dataset.html |
| wiki | go to the wiki page for this data set |
| keyword | 802.11, MANET |
| measurement purposes | Network Performance Analysis Routing Protocol Energy-efficient Wireless Network |
| network type | 802.11 ad-hoc |
| environment | The dataset comprises of routing and topology traces collected during the Mobile Ad hoc Networks Interoperability And Cooperation (MANIAC) Challenge, held on November 25-26th 2007 in conjunction with IEEE Globecom 2007. The MANIAC Challenge is an NSF-funded competition to better understand cooperation and interoperability in ad hoc networks. Competing teams of students/researchers come together to form an ad hoc network. It has been held once in 2007 and the next challenge is in 2009 |
| network | In the MANIAC Challenge 2007, the organizers generated traffic destined to each team. Teams were judged based on how much of the traffic destined to them made it through the network, how little energy they consumed in forwarding traffic and a subjective evaluation of the quality of their solution's design. |
| collection | In the MANIAC Challenge competition, an adhoc network comprising of nodes from all participating teams was formed and data was logged during three runs of the competition. The data included traces for the routing tables generated at each node for each time instant during the tests, and topology traces generated from the route logs to record topology changes at each time instant. |
| tracesets included | vt/maniac/2007 (v. 2008-11-01) |
[Traceset] vt/maniac/2007 (v. 2008-11-01) | top |
| version | v. 2008-11-01 |
| changes | the initial version. |
| bibtex |
@MISC{vt-maniac-2007-2008-11-01,
author = {Amr Hilal and Jawwad N Chattha and Vivek Srivastava and Michael S Thompson and Allen B MacKenzie and Luiz A DaSilva and Pallavi Saraswati},
title = {{CRAWDAD} trace set vt/maniac/2007 (v. 2008-11-01)},
howpublished = {Downloaded from http://crawdad.cs.dartmouth.edu/vt/maniac/2007},
month = nov,
year = 2008
}
|
| metadata last modified | 2008-12-18 |
| summary | The data comprises of routing and topology traces collected during the Mobile Ad hoc Networks Interoperability And Cooperation (MANIAC) Challenge, held on November 25-26th 2007 in conjunction with IEEE Globecom 2007. |
| release date | 2008-11-01 |
| measurement start | 2007-11-25 |
| measurement end | 2007-11-26 |
| measurement purposes | Network Performance Analysis Routing Protocol Energy-efficient Wireless Network |
| methodology | The MANIAC Challenge is an NSF-funded competition to better
understand cooperation and interoperability in ad hoc networks.
Competing teams of students/researchers come together
to form an ad hoc network. The organizers generated traffic
destined to each team. Teams were judged based on how much of
the traffic destined to them made it through the network,
how little energy they consumed in forwarding traffic and a subjective
evaluation of the quality of their solution's design.
To get their traffic across the network, each team relied on
other teams' willingness to forward traffic for them. We
developed a software and an API to allow the teams to program their nodes
and override forwarding decisions made by the routing protocol.
We also developed network monitoring and management software
to keep track in real-time of topology changes and traffic loads
experienced by each node during the competition.
In the MANIAC challenge, traffic was sent to participant nodes
from reference nodes in the network. Teams were given the tools
to monitor and manipulate traffic flowing around and through them,
respectively. As teams participated and forwarded, they consumed
resources (lose points), but as traffic affiliated with them reached
its destination, they received points. The overall goal of
the competition was to have the most points at the end of the competition.
More details about the MANIAC Challenge, including conference
papers analyzing the data collected, can be found at
www.maniacchallenge.org.
The data included traces for the routing tables generated at each
node for each time instant during the tests, and topology traces
generated from the route logs to record topology changes at each
time instant.
Each of the three runs of the competition lasted around 20 minutes.
A total of 16 network nodes participated in the tests with IP addresses
of the form 10.10.0.x, where x (the fourth octet) is in the set
{21, 22, 24, 25, 40-51}. |
| parent data | vt/maniac (v. 2008-11-01) |
| traces included | vt/maniac/2007/routing (v. 2008-11-01) vt/maniac/2007/topology (v. 2008-11-01) |
[Trace] vt/maniac/2007/routing (v. 2008-11-01) | top |
| version | v. 2008-11-01 |
| changes | the initial version |
| bibtex |
@MISC{vt-maniac-2007-routing-2008-11-01,
author = {Amr Hilal and Jawwad N Chattha and Vivek Srivastava and Michael S Thompson and Allen B MacKenzie and Luiz A DaSilva and Pallavi Saraswati},
title = {{CRAWDAD} trace vt/maniac/2007/routing (v. 2008-11-01)},
howpublished = {Downloaded from http://crawdad.cs.dartmouth.edu/vt/maniac/2007/routing},
month = nov,
year = 2008
}
|
| metadata last modified | 2008-12-18 |
| summary | The routing tables at each node that participated in each test during MANIAC 2007. |
| derived | false |
| release date | 2008-11-01 |
| measurement start | 2007-11-25 |
| measurement end | 2007-11-26 |
| configuration | The routing logs contain snapshots of the routing tables at each node that participated in each test at each time instant. The routing logs for each test are collected together. |
| format | In each test, a separate file is assigned for each node (the file name includes the node number which is the 4th octet of the node's IP address, expressed in decimal). Each entry in the route logs starts with the time instant at which the routing table was generated, followed by the routing table itself, as in this example: 10:48:29 Kernel IP routing table Destination Gateway Genmask Flags Metric Ref Use Iface 10.10.0.48 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.49 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.50 0.0.0.0 255.255.255.255 UH 1 0 0 eth0 10.10.0.51 10.10.0.50 255.255.255.255 UGH 2 0 0 eth0 10.10.0.22 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.40 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.25 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.24 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.41 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.42 0.0.0.0 255.255.255.255 UH 1 0 0 eth0 10.10.0.43 0.0.0.0 255.255.255.255 UH 1 0 0 eth0 10.10.0.46 0.0.0.0 255.255.255.255 UH 1 0 0 eth0 10.10.0.47 10.10.0.43 255.255.255.255 UGH 2 0 0 eth0 10.10.0.0 0.0.0.0 255.255.255.0 U 0 0 0 eth0 127.0.0.0 0.0.0.0 255.0.0.0 U 0 0 0 lo |
| note | Because the logging process was started before the competition actually started, you will find the routing logs spanning a time period larger than the actual 20 minutes of the competition runs. The topology files that were generated from these logs were adjusted to reflect the approximate start and end times of the tests. |
| download url | Download (476KB gz) (MD5 Hash: 05ac6d2b44f4d82e9444899a1ecbbe69) from US UK |
| download url | Download (496KB gz) (MD5 Hash: b698c1ef6c7e2a99feaf175fac66d62c) from US UK |
| download url | Download (416KB gz) (MD5 Hash: e4791b04595a1d0dc1eb921137f88ba8) from US UK |
| parent data | vt/maniac/2007 (v. 2008-11-01) |
[Trace] vt/maniac/2007/topology (v. 2008-11-01) | top |
| version | v. 2008-11-01 |
| changes | the initial version |
| bibtex |
@MISC{vt-maniac-2007-topology-2008-11-01,
author = {Amr Hilal and Jawwad N Chattha and Vivek Srivastava and Michael S Thompson and Allen B MacKenzie and Luiz A DaSilva and Pallavi Saraswati},
title = {{CRAWDAD} trace vt/maniac/2007/topology (v. 2008-11-01)},
howpublished = {Downloaded from http://crawdad.cs.dartmouth.edu/vt/maniac/2007/topology},
month = nov,
year = 2008
}
|
| metadata last modified | 2008-12-18 |
| summary | Trace of network topology and connectivity changed over the duration of the tests during MANIAC 2007. |
| derived | false |
| release date | 2008-11-01 |
| measurement start | 2007-11-25 |
| measurement end | 2007-11-26 |
| configuration | The topology files show how the network topology and connectivity changed over the duration of the tests. |
| format | We generated a separate topology file for each test, each providing
a snapshot of the network topology at each time instant. A sample
entry in a topology file is as follows:
09:51:21
21 22 24 25 40 41 42 43 44 45 46 47 48 49 50 51
21,1 0,0 48,4 49,3 0,0 49,3 49,3 48,2 48,3 48,2 49,2 0,1 48,2 0,1 0,1 48,2 48,3
22,1 45,3 0,0 45,2 0,0 51,2 45,2 45,2 0,1 0,1 0,1 45,2 45,2 45,2 45,3 45,2 0,1
24,1 0,0 43,2 0,0 0,0 45,2 0,1 43,2 0,1 47,2 0,1 43,2 0,1 45,2 43,2 45,2 45,3
25,1 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0
40,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0
41,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0
42,1 0,0 0,0 0,1 0,0 0,1 0,1 0,0 0,1 0,1 0,1 0,1 0,1 0,1 50,2 0,1 0,1
43,1 50,2 0,1 0,1 0,0 0,1 0,1 0,1 0,0 0,1 0,1 45,2 0,1 0,1 45,2 0,1 0,1
44,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0
45,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0 0,0
46,1 0,1 45,2 45,2 0,0 45,2 45,2 0,1 48,3 49,2 0,1 0,0 45,2 0,1 0,1 0,1 50,2
47,1 0,0 0,0 0,1 0,0 0,1 0,1 0,1 0,1 0,1 0,1 42,2 0,0 0,1 50,2 0,1 0,1
48,1 0,1 45,2 45,2 0,0 51,2 45,2 0,1 0,1 0,1 0,1 0,1 45,2 0,0 0,1 0,1 0,1
49,1 0,1 45,2 45,2 0,0 45,2 45,2 48,2 0,0 0,1 0,1 0,1 45,2 0,1 0,0 0,1 50,2
50,1 0,1 45,2 45,2 0,0 0,1 45,2 0,1 0,1 0,1 0,1 0,1 0,1 0,1 0,1 0,0 0,1
51,1 48,2 0,1 45,2 0,0 0,1 45,2 0,1 0,1 0,1 0,1 45,2 0,1 0,1 45,2 48,2 0,0
An entry in a topology file starts with the time instant at which
topology the snapshot was taken. A table showing the connections
between each pair of nodes in the network follows, where the row
represents the source node and the column represents the destination node.
Column and row headers contain the node identifiers for destination
and source, respectively (as before, nodes are identified
by the fourth octet of their IP address, expressed in decimal). Row
headers also contain a flag next to the node identifier. This flag,
which can have a value of 0 or 1, indicates whether this node
logged a routing table at that particular time instant.
The reason we introduced this flag is to distinguish between the
case of a node that logged an empty routing table (flag value of 1)
and a node that did not log a routing table at all (flag value of 0) at
a particular time instant, where in both cases all the entries in the
row corresponding to that node will have the value of 0,0.
A general entry in the table that describes the route from node x
(the row) to node y (the column) is in the format (gw, hops). The
first field, gw, represents the gateway that node x uses to reach
node y, while the hops entry represents the number of hops in the
route.
An entry that has a value 0,0 indicates that node x had no route
to node y at that particular time instant. An entry that has a value
0,1 indicates that node x can reach node y directly (with no
gateway and in 1 hop) at that particular time instant. An entry that
has a value of a,b means that node x can reach node y through
gateway a and in b hops.
Note that routes between nodes x and y can be asymmetric. In
other words, it is not necessary that node y reaches node x using
the same route that x used to reach y. You may find, in some cases,
that node x could reach node y in 3 hops while node y could reach
node x in 2 hops or even had no route to node x. |
| download url | Download (188KB gz) (MD5 Hash: 2c3b675a95ff52848a2d673dc358997c) from US UK |
| parent data | vt/maniac/2007 (v. 2008-11-01) |
[Author] Amr Hilal | top |
| amr.hilal@vt.edu | |
| institution | Virginia Tech |
| department | ECE Department |
| position | PhD student |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Jawwad N Chattha | top |
| chattha@vt.edu | |
| institution | Virginia Tech |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Vivek Srivastava | top |
| vivs@vt.edu | |
| institution | Virginia Tech |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Michael S Thompson | top |
| michael.thompson@bucknell.edu | |
| institution | Bucknell University |
| department | Dept. of Electrical Engineering |
| position | Assistant Professor of Electrical Engineering |
| phone | +1 570-577-3853 |
| fax | +1 570-577-1449 |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Allen B MacKenzie | top |
| mackenab@vt.edu | |
| institution | Virginia Tech |
| department | Wireless @ Virginia Tech, Bradley Department of Electrical and Computer Engineering |
| position | Assistant Professor |
| address | 302 Whittemore Hall (0111); Blacksburg, VA 24061 |
| phone | +1 540-231-3565 |
| fax | +1 540-231-3362 |
| web site | http://www.ece.vt.edu/mackenab/ |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Luiz A DaSilva | top |
| ldasilva@vt.edu | |
| institution | Virginia Tech |
| department | Wireless @ Virginia Tech, Bradley Department of Electrical and Computer Engineering |
| position | Associate Professor |
| phone | +1 703-538-8302 |
| related data/tools | vt/maniac (v. 2008-11-01) |
[Author] Pallavi Saraswati | top |
| pallavi05@vt.edu | |
| institution | Virginia Tech |
| department | ECE Department |
| position | Graduate student |
| related data/tools | vt/maniac (v. 2008-11-01) |


