Home

User Manual - Thomas Kunz

1. 5 12 a xj 5 1 25 E ell 2 1245 08H m 1 5 11 4 06 Jn 4 iu 046 oaf 0 0 5 10 15 20 0 5 40 4 x 0 10 15 2 25 30 35 40 45 0 Elapsed Time Diameter m vs Time 550 T T T T 500 450 400 Diameter rn w w eh e a a a a N e Y wen e 2 25 Elapsed Time Statistics Calculated This section will explain what each of the statistics created through the program mean and how they ZA T ners D T 25 T T 22 No T of Network Components vs Time T zT zT ES T Y S co T of Network Components c T 1 1 1 1 L 10 15 20 25 30 36 40 45 50 Elapsed Time Average Path Length m 4 50 Average Path Length m vs Time T T T T T 10 15 20 25 30 35 40 45 50 Elapsed Time A iR rN antt dm d 43 0 4 A A 4 4 4 100 150 200 250 0 350 400 pause piay 43 were calculated This section was originally written by Hussain Saeed and Jordan Edgecombe The average number of node neighbours is What it means Two nodes are considered neighbours if they directly connect with each other or in other words if they share an edge with each other How it was calculated In NS2 and Opnet an edge is made when two nodes coordinates are within the transmission range from one another and in Core it
2. The network diameter in meters What it means The longest shortest distance along the edges between any two nodes regardless of whether or not they are directly connected to each other How it is calculated While the dijikstra shortest path function found the shortest distance along the edges between any two nodes an if statement was created that said that if the shortest path was greater than the previous longest shortest path originally set at O meters 17 then that would become the new longest shortest path along edges After every path was calculated the last path to become the new longest shortest path was then seen to be the greatest and was then output The network diameter in hops What it means The largest minimum number of edges that exists between any two nodes How it is calculated The same way as calculated in meters except that instead of the edge weights being the actual distances between the nodes coordinates all of the edge weights are set to 1 Total number of components What it means A component is a set of nodes that are all reachable to one another through a path of edges How it is calculated This statistic is calculated simply through Boost Graph Library s connected_components function Node s with the highest betweeness centrality What it means This statistic shows the nodes that have highest amounts of shortest paths from one node to another passing through them How it is calcula
3. LOCO ONG O TOETA EEA OANE 7 DVD E EE SCS P E E E N A N E M HM O E ET ET 8 O O E EE E AERE EANA NE ATA EE ANETA 9 NIUE T EAA A 10 Full 10 11 SCS CCE EIEEE ET VEETEE EEIE ei Sue duo Ua OmU E E EEEE ETTE 13 WER VDE NSE e cU 13 Roy 9 1 GRO We 11 17 O a em Pt ea AET eg es ee ee EAO 13 ANIMATION Ge GRAPHS 15 SUS CS CALCULATED X 16 THE AVERAGE NUMBER OF NODE NEIGHBOURS IS en sese sese sse eese ese 16 THE NODE S WITH THE MOST NEIGHBOURS IS ARE ss p E IRE R AN R CARI RR AS 17 THE NUMBER OF NODES THAT THE NODE S WITH THE MOST NODE NEIGHBOURS HAVE IS eene entente nnns 17 THE AVERAGE PATH LENGTH FOR ALL SOURCE DESTINATION PAIRS IN METERS cesseeeenn nene nennen mener 17 THE AVERAGE PATH LENGTH FOR ALL SOURCE DESTINATION PAIRS IN nennen nennen enne nnns 17 THE NETWORK DIAMETER IN METERS A E MP PDA M PAPA M PME 17 THE NETWORK DIAMETER IN NE 18 TOTAL NUMBER OF COMPONENTS onem endo D GNU UI
4. Coverage in What it means It is the percent of the defined area that has been passed through by a node at any point in time How it is calculated The area is divided into a virtual grid represented by a two dimensional array During each cycle each node increases the array value corresponding to its location by 1 The coverage percent is determined by determining how many parts of the array have a value greater than O then dividing that by the total parts and multiplying by 100 The final array is outputted at the bottom giving a general impression of where the nodes are concentrated as well as allowing for depictions through MATLAB surface graphs A separate output surface graph gives a format that can be copied into MATLAB as an array for easy visualization of the node distribution Neighbourhood Instability What it means It is the approximate rate at which the nodes create and break links How it is calculated The instability is calculated for each node by determining how many links were created and broken with that node divided by the number of neighbours it has at that point in time The output is given in 10 cycle periods starting with the 0 9 period A final value giving the average instability of all nodes over the entire period is listed at the bottom A separate output average instability gives the average of the nodes at each point in time Clustering Coefficient What it means It is the ratio of radio links among
5. verydense located in the c drive for simplicity c verydense Fata E JE JE JE DE DE JE JE DE E DE JE JE JE JE DE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J FE Static Statistics Enter file path to folder you wish to use Enter EXIT to exit to main menu nae e e e e e e e X X K K K K K K XK JE JE JE JE JE JE JE JE JE JE JE JE JE 66666 gt gt verydense The transmission range of the network must then be chosen For this example it will be 250 6666 Static Statistics Enter transmisson range of the network Enter EXIT to exit to main menu KX KX K K K K XK KX K K K K K K XK 3366060660606 0660660660669 0606 0606 0606 066066 066 06606 0606 06 06 0606 066 06 Finally the program will ask if the user wishes create graphViz visualization along with the statistics For this example the answer will be yes JE DE DE JE JE JE E DE DE JE DE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J Static Statistics Do you wish to make a graphUiz Visualization Yes No X KX K K K K K XK lt X KX K K K K K K lt Enter EXIT to exit to main menu 6666606060606 6 66 6 6 66 6 tatata gt gt yes The program will then create statistics for all the scenarios and output them within their own folders The user may choose to create a summary and spreadsheet for thes
6. drive for simplicity c HighMobility Location Generator Enter file path to folder you wish to use Enter EXIT to exit to menu x x x x x x Xx KX K K K K K K XK E JE JE JE JE JE JE JE JE JE DE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J JE JE J FE gt gt HighMobility The program will then ask for the transmission range and refresh rate In this example the transmission range will be 250 and the refresh rate will be 1 The program will then ask for the run time that the Statistics will be generated for For this example it will be run for 150 seconds LITITITITIT TITPIT ITTIT TTTIT ITPAT IAZ TI T IBPTPAITPTIPT IBPTPTPTPITPATPITPATPATITPPTPTPTIPTITITITTIIT x Location Generator x x Please enter the desired run time x x Warning Run times greater than 250 000 x x may cause program to crash x Enter EXIT to exit to menu x FS tat ate tate tata tat OX 3 OX COGO XXX OX 9 XCOXOX XO XO OXCXCOXOX CX XX gt gt 100 The program will then run through all the txt files because NS2 file type within the folder and generate statistics on them It will automatically create a graphViz visualization for each scenario at the run time Statistics Summary Next from the title screen choose option 4 Statistics Summary The program will then ask you if you re
7. folder located in Examples Dynamic NS2 HighMobility Scenario summary verydense Static Statistics From the title page choose option 3 Static Statistics This will bring the user to the Static Statistics menu where it will require the file type that file s will be For this example it is NS2 E JE JE E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J Static Statistics File types supported OPNET single file CORE single file x x x NS2 single file amp multiple files x x Enter EXIT to exit to main menu x x DE E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE 3 File Type gt gt The program will then ask if it will run for a single or multiple files For this example it will be multiple 2 13 3XOCOXOXOXOXO XX XXX eta tata tetatatatatatatatatatetatatatatatatatatatatatatatatatatatatas Static Statistics Choose an options 1 Single file 2 Multiple files Enter EXIT to exit to main menu E HE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J J J The path to the files must then be given For this example it will be
8. is made when the two nodes share the same WLAN With Boost Graph Library a vertex iterator can be made that can loop through every unique node in the network For each node Boost Graph Library can then use an edge iterator to see how many other nodes it is directly connected to Each connection is then 16 recorded in a counter variable and eventually this variable gets divided by the total number of nodes to get the average number of node neighbours The node s with the most neighbours is are What it means The nodes that share the most connections with other nodes in the network How was it calculated While the vertex iterator loops through every single node the ones that have the most node neighbours are picked out and stored in a specific array Then after the vertex iterator is done this array just gets outputted The number of nodes that the node s with the most node neighbours have is What it means The nodes with the most node neighbours have this number of connections How it is calculated While the array for the nodes with the most neighbours is being created another array is made to store the number of neighbours that the nodes with the most connections have One element of this array then gets simply outputted for this statistic The average path length for all source destination pairs in meters What it means This is the average shortest distance along the edges between any two nodes regardless of whether or not t
9. neighbours and the number of neighbours How it is calculated The clustering coefficient is calculated for each node by determining how many links there are between neighbours of the node divided by the number of neighbours it has at that point in time A final value giving the average coefficient of all nodes over the entire period is listed at the bottom A separate output average clustering gives the average of the nodes at each point in time The Wikipedia page http en wikipedia org wiki Clustering coefficient provides a decent summary of how exactly this is determined Degree of Randomness Predictability What it means It is a value indicating the transition probability between states How it is calculated The area is divided into a virtual grid similar to coverage but less segments each part of which has a separate subgrid surrounding it represented by a 4D array Whenever a node moves it records the starting and ending grid location and increments values in the corresponding main grid starting and subgrid ending At the end it tallies up the grid values and determines the chance of a node going from any given grid segment to another one then uses the equation 0 1 0 where piis the probability to stay at the starting location i and Qj is the probability to transition from state i to state The values for each segment of the main grid are summed up and averaged giving the final output 19 Issu
10. only the average clustering coefficient and neighbourhood instability are graphed instead of the per node results Building the Program Required Software Visual Studios 2012 http msdn microsoft com library dd831853 aspx Boost Graph Library 1 54 0 http www boost org doc libs 1 54 O libs graph doc index html GraphViz 2 30 1 http www graphviz org Download ph MATLAB R2013a http www mathworks com help matlab index html Microsoft Office Excel 2007 http office microsoft com en ca excel Setup At current stage of program is only compatible with windows built using Microsoft Visual Studios 2012 e In Visual Studio s File menu select New gt Project Then in the new window that pops up under Visual C select Win32 Console Application Delete the premade source and header files right click gt exclude from project and add the necessary source and header files to the project This includes Main cpp Dynamic Statistics cpp Location Generator cpp Static Statistics cpp SoreadsheetCreator cpp stdafx cpp stdafx h convert h targetver h e Apply all the required settings The Property pages can be opened by selecting View Property Manager then clicking the wrench symbol in the upper left corner Visual Studios Settings The following are the setting that must be configures in Visual Studious 2012 in order to run the program Configuration Manager Configuration Release Solution Con
11. running the summary for dynamic scenarios or static scenario For this example it will be dynamic 2 6060606 06 06060606 06 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 Statistics for Dynamic amp Static Networks Options Static Statistics Summary Dynamic Statistics Summary Exit X KX K K K K K K K SED SEP XK X KX K K K K K SED SED SED SEP XK 363606 06066 06 6 6 The user must then specify the directory the files are located For this example it is same directory as before c HighMobility 11 E JE DE HE JE JE DE E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J Statistics Summary Enter the path to the files Enter EXIT to exit to main menu X X K K K K K XK Fat at ata tat at atatatatat ata tatatatat atta tatatatatatatatatatatatatatatatatatatatatatatatatatatal It will then ask for the file type the scenarios are For this example they are NS2 tat ate tata 3069069606966 6960606060606 0660606606696 066 060606 060606 066 06 0606 06606 066 Statistics Summary Choose the file type 2 Enter EXIT to exit to main menu X X XXXXXXXXXX X X XXXXXXXXXX E HE HE DE JE DE DE JE JE JE DE DE DE JE JE JE JE JE JE JE JE JE JE JE J
12. the user must specify a folder location for the program to look through After locating the file s specified the program will create an output folder for the scenario s The name of the folder has the format scenario file output The program then reads in the scenario and generates each nodes location every second until the node becomes static retaining the longest run time needed for the network to become static This information is the written to a file in a specific format Dynamic Statistics Dynamic Statistics reads the user specified output file from the Location Generator and creates statistics for the user chosen run time in intervals of the given refresh rate Using the Boost Graph Library the following statistics are created e Average number of neighbors each node has e The nodes that have the most neighbors e The average distance between nodes e number of components The network diameter e The nodes with the highest betweeness centrality e number of links changed e coverage of the combined nodes over time e The network instability e The clustering coefficients e The degree of randomness predictability The statistics are then written to their own separate files within the output folder It also gives the option to create a graphViz visualization of the network at any given multiple of the refresh rate Static Statistics The Static Statistics portion of the program originally writte
13. 6 6 36 36 6 RRR 6 RMR RRR 1 1 1 1 1 1 1 1 1 1 1 13 1 1 1 1 1 1 1 1 1 RM Location Generator Location Generator Enter the x axis limit Enter the y axis limit Enter EXIT to exit to menu Enter EXIT to exit to menu X X K K K K K XK X KX K K K K K XK X X K KX K K XK OX Xx a MED Se MED ae lt MMMM 96 96 96 96 MRR 6 6 6 MRM MMMM RMR MMMM RM MMMM RM 6 6 6 6 6 6 6 6 9696696060606 66666 666 666666666666 66666666666 XXX gt gt 5000 gt gt 5000 The program will then run through the location generation for the specific file and output it to its own output folder Once the location generation is complete exit this section and go back to the title screen Next choose option 2 Dynamic Statistics The user must then enter the path and name of the output folder and file generated in the last step For this example the user must input topology output topology out txt JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE E JE JE JE JE J FE Dynamic Statistics Please enter the path to the output file Enter EXIT to exit to main menu X X K K KX K K XK KX KX K K K K K XK 9969606969696 0606660660666 6 6 gt gt topology output topology_out txt The program will then prompt the user to enter the run time that the statistics will be generated for For this example the run time should be 1800 066 66 6060606666
14. 66 6 6 6 66 6 6 666606 Dynamic Statistics Please enter the desired run time Warning Run times greater than 250 000 may cause program to crash lt enter 0 to run until static gt Enter EXIT to exit to main menu X KX KX K K KX K K K OK XK XOOCOOXOGOXOO CX COGO X XXX XX Network will be static in 104264 seconds gt gt 1800 The program will then ask if the user wants to create a graphViz visualization of the scenario If the user chooses yes the user must enter the time at which the visualization will be created The time of the visualization must be less than the run time a multiple of the refresh rate and greater than O For this example a visualization will be created at time 1000 X X JE JE JE JE JE JE JE JE JE E JE JE OX JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J JE X 3333363066 06066 06 0666 0666 6066 60666 06066 60666 0666 06066 6 066 6 066 6 Dynamic Statistics Dynamic Statistics Do you wish to make a graphUiz Visualization Yes No When should the visualization be created Enter EXIT to exit to main menu E11 14141111111 111111142141114111141111113414343413413 311112 X KX K K K K K K lt X KX K K K K K K XK E JE JE JE JE JE JE DE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J FE JE J J run time 1800 refresh Interva
15. 6666066 6666066 666066 066 ta Location Generator Enter the name of the file Enter EXIT to exit to menu X X XXXXXX x x x 3363666 0606696 0606606 06606 06 06606 06 06606 06066 06 06 606 06 066 06 06 6606 06 66 6 6 The user must then enter the transmission range and refresh rate of the scenario be used when creating the statistics In this example the transmission range will be 1000 and the refresh rate will be 1 xx E RRM RMR MMMM RRR RRR RRR RRR RMR MRM RM E DE MRR RMR RRR RRR 3 06 06 06 06 06 06 06 06 06 06 6 6 6 06 06 06 6 6 6 6 66 666 Location Generator Location Generator Enter the refresh rate of the statistics Enter transmisson range of the network lt in seconds gt Enter EXIT to exit to menu X KX K K K K K lt X KX K K K K K XK Enter EXIT to exit to menu Xx KX K KX K K K XK XK KX K K K K K XK XK 3 3X 3 969696666696 0606 06 06 6 XX 6 6 The program will then require the values of the and axis for the network to be used the Matlab section of the program only for Opnet scenarios In this example both axis will be 5000 pata t tata tata tata t eta tata t ata tat
16. E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE 6 FE File Type gt gt ns2 The program then requires the user to indicate what sequence the program will look for in order to recognize that the file will be included in the summary For this example the sequence will be Scenario as all the files in the folder have the name format Scenario txt 6666666606666 6 6 6 6 Statistics Summary Enter the sequence you wish to match for Enter EXIT to exit to main menu X X K KX K K K 4 X XK K K K K K XK HE JE E JE JE JE JE JE JE E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE FE gt gt Scenario The program then prompts for the run time it will run the summary for The run time must be less than or equal to the run time of all the individual scenarios In this case it will run for 150 seconds 969606 06 6 6 Statistics Summary Enter the run time for the statistics Enter EXIT to exit to main menu KX KX K K K K K XK X X KX K K K K XK 06 06 06 06 06 The program will then create summary statistics from all the files that match the sequence The summary Statistics will be outputted within t
17. S C s Ene ON NIME 18 NODE S WITH THE HIGHEST BETWEENESS CENTRALITY 18 LINKS ADDED LINKS BROKEN 18 Mi senio c 18 18 NEIGHBOURHOOD INSTABILITY MT 18 CLUSTERING C OEFICIENT eR 18 DEGREE OF RANDOMNESS PREDICTABILITY ccscccesccecccscccsccesceucecceeucecuceesceeuseusseusseccesseceeeceseceusceusceusseesseeceeeceueceusess 18 OS OR DELP a 20 About Statistics for Dynamic amp Static Networks is a program written and compiled in C The program creates statistics from dynamic and static network simulations of NS2 Opnet and Core formats using the Boost Graph Library The program also uses MATLAB GraphViz and Excel to help visualize organize and interpret the statistics Title Screen Each aspect of the program is access through the title screen contained in main cpp The title screen allows user to choose which of the various components of the program to run Location Generator Location Generator can interpret NS2 Opnet and Core dynamic network simulations It gives the user the choice to generate an output file for single or multiple files at a time In the case of multiple files
18. Statistics for Dynamic amp Static Networks User Manual Supervising Professor Thomas Kunz An ongoing project with contributions by Evan Bottomley Cristopher Briglio Jordan Edgecombe Dynamic Statistics for NS2 Networks version 1 and Hussain Saeed Statistics of Static Networks Version 3 Carleton University Summer 2014 Table of Contents is n 3 3 LOCATON ENERA TOR MEER TL 3 DYNAMIC PATIS PCS seeser otis cena esmutant E AE i usur Noir IIa Ge nev Lar Dr Ed En cH E A 3 TS ST SUC 4 TATTA ONCE LL E 4 PRE D AET T erc pa s 4 guess gere NU THROUGH M c 5 nec M 5 BUILDING M 5 R OUR cassecanrccsa 5 SETUP m 5 VISUAL STUDIOS SETTINGS 6 KUNNING THE PROGRAM 6 TOPO M E E 7
19. e scenarios If so the user must follow the exact same procedure as with HighMobility except that the user must choose static instead of dynamic when creating these files The output can be found in the example folder located in Examples Static NS2 verydense 14 Note This section only explains the very basics needed to run each section of the program and only specifies the requirements that the user must input in order to run See Documentation file for more specific requirements Animation amp Graphs If the user chooses option 6 from the title screen the following will be displayed s for Dynamic amp Static Networks Options Location Generator Dynamic Statistics 3 Static Statistics Statistics Summaru Spreadsheet Creator 1 Statistics in MATLAB 7 Full Statistical Run Through Matlab not yet implemented Open within Matlab to use this component of the program Press any key to continue The user must open animations graphs m within matlab to use this portion of the program Once the user has opened animations_graphs m within MATLAB the user must run it by typing into the command window animations_graphs The program will then ask for the path to the output file created in Location Generator Once specified the program will ask for the run time of the animation Please enter the path to the output files gt gt Lestscen output testscen out txt The netwo
20. es or Help See the Documentation file for more specific information on the different aspects of the program 20
21. ettings button located next to the layout button which looks like the layout button but with a blue box in it It can also be found within Graph gt Settings Once clicked it will bring up a menu name Dialog Make sure its Layout Engine is dot the Scope e is graph and specify your desired output file type then click OK GVEdit For Graphviz ver 1 01 e e B HAs graphViz 50 dot a Graph G 0 pos 233 737 212 168 Dialog 2 3 pos 123 34 363 639 4 pos 74 6274 286 8071 0 1 Layout Engine dot 0 2 0 3 Output file Type png 0 4 te Output File testscen output graphViz_50 png 1 4 2 3 2 4 Scope graph Name Damping Add o Value Help Output Console working on C Users Christopher Desktop proj eT D e Then click the Layout button two more times The visualization has now been output in the format that you specified HighMobility Full Statistical Run Through After starting the program choose option 7 from the title screen This will bring you through the Full Statistical Run Through version of the program Once at the Location Generator menu choose the proper file type which in this case is NS2 Then specify whether the program will run for one or multiple 10 files for this example it will be multiple 2 Then indicate the directory that contains all the scenarios For this example that will be the HighMobility folder located in c
22. figurations Release Property Pages Configuration Properties General Character Set Not Set Property Pages Configuration Properties C C Precompiled Headers Not Using make sure Configuration is set to All Configurations Add Boost library boost 1 54 O folder to Additional Included Directories found in Property Pages Configuration Properties C C General Additional Included Directories e After this you simply build the project and start the program Running The Program The following is a run through of the program using these example files e Examples Dynamic Opnet topology xml Single dynamic scenario e Examples Dynamic NS2 HighMobility Multiple dynamic scenarios Examples Static 52 verydense Multiple static scenarios With the following examples the user should learn to run any aspect of the program Different aspects of the program that are being shown may have been altered or changed since these pictures were taken as the program was further worked on Also these pictures may not depict the program running for these specific examples please follow the written instructions to get the same results as the examples and not what the visuals show topology xml Location Generation After starting the program choose option 1 Location Generator from the title screen s for Dynamic amp Static Networks x Options Location Generator Dynamic Statistics 3 Static Statistic
23. heir own folder contained within the user specified directory For this example it will be HighMobilityNScenario summary 12 Spreadsheet Once the summary has been created choose option 5 Spreadsheet Creator from the main menu The program will ask if the spreadsheet will be created for dynamic or static scenarios For this example it will be dynamic 2 The program will then ask for the directory that the files are located which is the same as before c HighMobility Sata tat ata tata t ata tata tata tatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatas Spreadsheet Creator Enter the path to the files NS2 FILES SUPPORTED ONLY Enter EXIT to exit to main menu X X XXXXXXX 6960696960696 0606 0606060666 6 6 6 6 6 6 gt gt HighMobility The program will then ask for the sequence used to create the summary files Scenario 6336969606969 6960696066 06696 066 066 96 0606 06606 0606 06 6 06 6 06 06 06 06 606 0606 06606 66 Spreadsheet Creator Enter the sequence you wish to match for 0330606060606 0606960606066 06066 066096066 066060606 066 096 0606 0606 06606 0606 0660666 gt gt Scenario The program will then create an xml spreadsheet for all the files used the summary and output to the summary folder The file outputted for this example Scenario spreadsheet xml can be found in the example
24. hey are directly connected to each other To imagine what shortest distance along the edges means let s say node 1 and node 3 are not connected and that the path between them that goes through node 2 is shorter in distance than every other possible node path between them So let s imagine that node 1 is connected to node 2 by an edge that is 200 meters long and node 3 is connected to node 2 by an edge that is 150 meters long This program will say the distance between nodes 1 and 3 is 350 meters no matter what the straight line distance between them truly is How it is calculated When the program reads through the input file it takes in the x and y coordinates for every node Using these coordinates the distances between directly connected nodes are then calculated and are saved as edge weights Then using a Boost Graph Library function called dijikstra shortest path and the vertex iterator again the distance along the edges between any two nodes is calculated and added to a total sum variable This variable is then divided by the total number of all possible edges to get the average The average path length for all source destination pairs in hops What it means This is the average minimum number of edges that exists between any two nodes How it is calculated The same way as was calculated in meters except that instead of the edge weights being the actual distances between the nodes coordinates all of the edge weights are set to 1
25. l 1 gt gt yes gt gt 1000 The Statistics for this scenario have now been created The output can be found in the example folder located in Examples Dynamic Opnet topology output GraphViz Visualization GVEdit For Graphviz ver 1 01 Once the GraphViz visualization has been Open ern created the user must now use a separate we program to create a photo of it Within GraphViz E the gvedit exe application can be used to read tecen Pace and output the visualizations To start you must Libraries locate and open this application found in oe graphviz 2 30 1 release bin gvedit exe s d al running have the program open the file by going to file open Once the application has open DS the file graphViz 1000 dot the user must then Output Console ax have it output the visualization as a picture There are a few ways to do this although the easiest seems to be the following e Hit the Layout button this button is located near the top left and has the shape of a man running It can also be found within Graph gt Layout Within the Output Console at the bottom of the screen it should say working On GVEdit For Graphviz 1 01 of m Sm File Edit Window Graph Help eH ip 24 eee ee Layout 9 Viz 50 x Graph 0 pos Layout the active graph Next hit the S
26. n by Hassain Saeed reads in static network scenarios of NS2 Opnet and Core formats It then generates basic statistics for these files which include e Average number of neighbors each node has e The nodes that have the most neighbors e The average distance between nodes number of components e The network diameter e The nodes with the highest betweeness centrality The statistics are then written to their own separate files within an output folder It also gives the option to create a graphViz visualization of the network Statistical Summary The Statistical Summary part of the program creates averaged statistics from multiple scenarios The program works by reading the statistics generated from Dynamic Statistics or Static Statistics for several specific files and creates a summary of these statistics in a separate folder The following statistics are summarised e average number of neighbors each node has e the average distance between nodes e the number of components the network diameter e the number of links changed e the percent coverage of the area e the average neighbourhood instability e the average clustering coefficient Links summary isn t included for static scenario summaries Spreadsheet Creator The Spreadsheet Creator uses the statistics created in Dynamic Statistics or Static Statistics as well as Statistical Summary part of the program to create a spreadsheet that can be opened in Microsoft Office E
27. rk will mot be static until 52 seconds Please enter desired animation runtime enter 0 to run until static The program will then create animation of the scenario along with various graphs visualizing the various Statistics in respect to time These can then be saved in a variety of formats The following are the graphs created for testscen txt with an animation than ran to 52 seconds that can be found in Examples Dynamic NS2 testscen output Matlab output 15 of Links Broken vs Time T T Ug zT ES Y Average of Node Neighbours vs Time T E r T n 25 38 j 5 r L 2r a c 3 E 8 5 a 232 Saks ll s d 5 T 5 1 28 lt 05 4 2 4 4 4 4 4 4 1 0 1 d L 1 L L SM 10 15 20 25 30 35 40 45 50 0 5 10 15 20 25 30 35 40 45 Elapsed Time Elapsed Time of Most Node Neighbours vs Time Diameter Hops vs 4 G HN T 39 4 5 37 T E 35 2 1 2 35 i 3 5 m 4 2 34 amp 18 4 E x 33 4 3 2 31 1 il 1 1 1 1 1 1 3 1 2 4 4 2 a oe d J 0 5 10 15 20 25 30 35 40 45 5D 0 5 10 15 20 25 30 35 40 45 50 Elapsed Time Elapsed Time Average Path Length Hops vs Time of Links Created vs Time Y M Y T Y ap mi 145 1 18 14t 4 16 135 14
28. s Statistics Summary 5 Spreadsheet Creator View Statistics in MATLAB 7 Full Statistical Run Through After coming to the Location Generator main menu the user must choose the proper file type which in this example is OPNET XOOOOXOGOOGOXGOCOCOOOXGOGOOX GOOXOXOOXGOGOOX GOOOXOOXOOGOOOXOOOXOOOX XX Location Generator File types supported OPNET single file amp multiple files CORE single file amp multiple files x x x x x x NS2 single file amp multiple files x Enter EXIT to exit to main menu XOOOOXGOGOOGOXGOCOCOXGOOGOGOOGOGOOCOX OO XOXGOGOOGXGOOOXOXOOXOOX X XOXOXXOXXX File Type gt gt The user must then specify whether the location generation will be for one or multiple files in this example there is one file 1 9606066969606 0606 XXX CX XXX XXX Location Generator Choose an options 1 Single file 2 Multiple files Enter EXIT to exit to menu JE JE JE DE JE JE E JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE JE J J XXX When running for one file the user must enter the name of the given file he she wishes to run the program In this example the file is topology xml 3 3 3 3 amp 3 3X 3X 3X 3 3 3 2X 3X 3X 3 3 3 0 3C 0C 066066066 06
29. ted Using a vertex iterator again and the Boost Graph Library function known as brandes_betweeness_centrality the betweeness centrality is calculated for every node in the network Then the nodes with the greatest values get put into a separate array which then gets outputted Links Added Links Broken What it means This statistic shows the number of links added broken at every second of the simulation How it is calculated Using Pythagorean Theorem the distance between each pair of nodes is calculated If this distance is less than or equal to the transmission range then a link exists between the pair An array of 15 O s tracks where these links exist If a link is added then the array has that point ex if node and node 1 are connected array O 1 1 and array 1 0 1 If a link is broken then a 0 is placed at that point If an entry goes from 1 to 0 then broken links is increased by 1 and if an entry goes from 0 to 1 then added links is increased by 1 Link Changes What it means It is the amount of times a link gets broken or created for each node throughout the simulation How it is calculated This is simply calculated by having an array keeps track of every link change per node by adding 1 every time a link has been added or created for that node while another integer increments itself by two s every time a link is created or broken by two because if a link is always broken or created for two nodes 18
30. xcel The spread sheet brings together the specific data from all the scenarios in a visually friendly way It relies on the files txt output from Statistical Summary in order to identify what files to include The spreadsheet includes the following data for dynamic scenarios e Average links created and broken per second e Total links created and broken in desired run time e Number of connected components at initial and final time e Average number of neighbours at initial and final time e Average path length in hops at initial and final time e Network diameter in hops at initial and final time For static scenarios e Number of connected components e Average number of neighbours e Average path length in hops e Network diameter in hops This portion of the program only works 52 scenarios with file names with the format Scenario H txt Full Statistical Run Through This portion of the program simply runs the user through the Location Generator then automatically created statistics for the file s using Dynamic Statistics without having the user give the desired file to run the statistics on Animation Graphs Animation Graphs is a program created in MATLAB that uses the statistics created in Dynamic Statistics for a particular scenario to create an animation of the nodes and their trajectories over time on an x y plain for the user desired run time as well as several graphs illustrating all the statistics Note that

User Manual - Thomas Kunz

Contents

Download Pdf Manuals

Related Search

Related Contents