homeMovGen-rel1.0.cc File Reference

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <unistd.h>
#include <string.h>
#include <fstream>
#include <istream>
#include <iostream>
#include <cstdlib>
#include <ios>
#include "socialNet.h"
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include <gsl/gsl_vector.h>
#include <gsl/gsl_blas.h>
#include <gsl/gsl_multifit_nlin.h>

Defines
#define	RAND_INT(l, h) (((double)(random() * ((double)(h)-(l)+1.0))) + (l))
Functions
double	getRandomDouble ()
void	setSeed (unsigned int init)
double	generateRandomDouble (double min, double max)
int	generateRandomInteger (int min, int max)
void	header ()
void	usage ()
void	generateXMLHeader (FILE *outputFileXML, double sideLength_WholeAreaX, double sideLength_WholeAreaY, double transmissionRange, int numberOfNodes)
void	generateXMLSetNodePosition (FILE *outputFileXML, int node, double x, double y, double sideLength_WholeAreaX, double sideLength_WholeAreaY)
void	generateXMLSetNewGoal (FILE *outputFileXML, int node, double time, double newGoalX, double newGoalY, double velocity, double sideLength_WholeAreaX, double sideLength_WholeAreaY)
int	main (int argc, char *argv[])

Define Documentation

#define RAND_INT	(	l,
		h		)	(((double)(random() * ((double)(h)-(l)+1.0))) + (l))

Function Documentation

double generateRandomDouble	(	double	min,
		double	max
	)

00104                                                      {
00105         //double number=getRandomDouble() * (max-min+1.0) + min;
00106         double number=getRandomDouble()*(max-min)+min;  
00107         
00108         //double number=min+((max-min)*getRandomDouble()/RAND_MAX);
00109         return number;
00110 }

int generateRandomInteger	(	int	min,
		int	max
	)

00113                                             {
00114         
00115         int number=(int)floor(generateRandomDouble((double)min,(double)max)+1);
00116         //printf("%s %d\n","The random generated integer number is",number);
00117 
00118         return number;
00119 }

void generateXMLHeader	(	FILE *	outputFileXML,
		double	sideLength_WholeAreaX,
		double	sideLength_WholeAreaY,
		double	transmissionRange,
		int	numberOfNodes
	)

00167                                                                                                                                                      {
00168         
00169         fprintf(outputFileXML,"<?xml version=\"1.0\"?>\n");
00170         fprintf(outputFileXML,"<simulation xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n");
00171         fprintf(outputFileXML,"xsi:noNamespaceSchemaLocation=\"http://www.i-u.de/schools/hellbrueck/ansim/xml/simulation.xsd\">\n");
00172         fprintf(outputFileXML,"\t<parameter>\n");
00173         fprintf(outputFileXML,"\t\t<area_shape>rectangle</area_shape>\n");
00174         fprintf(outputFileXML,"\t\t<xsize>%f</xsize>\n",sideLength_WholeAreaX);
00175         fprintf(outputFileXML,"\t\t<ysize>%f</ysize>\n",sideLength_WholeAreaY);
00176         fprintf(outputFileXML,"\t\t<extension_factor>1</extension_factor>\n");
00177         fprintf(outputFileXML,"\t\t<numberOfNodes>%d</numberOfNodes>\n",numberOfNodes);
00178         fprintf(outputFileXML,"\t\t<range>%f</range>\n",transmissionRange);
00179         fprintf(outputFileXML,"\t\t<mobility_model>socialFoundedMM</mobility_model>\n");
00180         fprintf(outputFileXML,"\t</parameter>\n");
00181                         
00182 }

void generateXMLSetNewGoal	(	FILE *	outputFileXML,
		int	node,
		double	time,
		double	newGoalX,
		double	newGoalY,
		double	velocity,
		double	sideLength_WholeAreaX,
		double	sideLength_WholeAreaY
	)

00198                                                                                                                                                                                       {
00199         fprintf(outputFileXML,"\t\t<position_change>\n");
00200         fprintf(outputFileXML,"\t\t\t<node_id>%d</node_id>\n",node);
00201         fprintf(outputFileXML,"\t\t\t<start_time>%f</start_time>\n",time);
00202         fprintf(outputFileXML,"\t\t\t<destination>\n");
00203         fprintf(outputFileXML,"\t\t\t\t<xpos>%f</xpos>\n",newGoalX-sideLength_WholeAreaX/2.0);
00204         fprintf(outputFileXML,"\t\t\t\t<ypos>%f</ypos>\n",newGoalY-sideLength_WholeAreaY/2.0);
00205         fprintf(outputFileXML,"\t\t\t</destination>\n");
00206         fprintf(outputFileXML,"\t\t\t<velocity>%f</velocity>\n",velocity);
00207         fprintf(outputFileXML,"\t\t</position_change>\n");
00208 }

void generateXMLSetNodePosition	(	FILE *	outputFileXML,
		int	node,
		double	x,
		double	y,
		double	sideLength_WholeAreaX,
		double	sideLength_WholeAreaY
	)

00186                                                                                                                                               {
00187         fprintf(outputFileXML,"\t\t<node>\n");
00188         fprintf(outputFileXML,"\t\t\t<node_id>%d</node_id>\n",node);
00189         fprintf(outputFileXML,"\t\t\t<position>\n");
00190         fprintf(outputFileXML,"\t\t\t\t<xpos>%f</xpos>\n",x-sideLength_WholeAreaX/2.0);
00191         fprintf(outputFileXML,"\t\t\t\t<ypos>%f</ypos>\n",y-sideLength_WholeAreaY/2.0);
00192         fprintf(outputFileXML,"\t\t\t</position>\n");
00193         fprintf(outputFileXML,"\t\t</node>\n");
00194 }

double getRandomDouble ( )

00078                           {
00079 
00080 /* input parameters*/
00081 
00082 /* static int a = 1588635695, m = 4294967291U, q = 2, r = 1117695901; */
00083 
00084 static unsigned int a = 1223106847, m = 4294967291U, q = 3, r = 625646750;
00085 
00086 /* static unsigned int a = 279470273, m = 4294967291U, q = 15, r = 102913196;*/
00087 /* static unsigned int a = 1583458089, m = 2147483647, q = 1, r = 564025558; */
00088 /* static unsigned int a = 784588716, m = 2147483647, q = 2, r = 578306215;  */
00089 /* static unsigned int a = 16807, m = 2147483647, q = 127773, r = 2836;      */
00090 /* static unsigned int a = 950706376, m = 2147483647, q = 2, r = 246070895;  */
00091 
00092    SEED = a*(SEED % q) - r*(SEED / q);
00093    return ((double)SEED / (double)m);
00094 }

void header ( )

00123               {
00124     printf("%s","\nMobility Patterns Generator for OMNET++ simulator\n");
00125     printf("%s","Home Cell Community Based Mobility Model\n");
00126     printf("%s","Based on the Community Based Mobility Model of Mirco Musolesi\n");
00127     printf("%s","Version 1.2 January 2012\n");
00128     printf("%s","Copyright (C) Nikolaos Vastardis University of Essex\n");
00129     printf("%s","              nvasta@essex.ac.uk\n");
00130 }

int main	(	int	argc,
		char *	argv[]
	)

00212 00213 00214 00215 00216 00217 00218 00219 00220 00221 00222 00223 00224 00225 00226 00227 00228 00229 00230 00231 00232 00233 00234 00235 00236 00237 00238 00239 00240 00241 00242 00243 00244 00245 00246 00247 00248 00249 00250 00251 00252 00253 00254 00255 00256 00257 00258 00259 00260 00261 00262 00263 00264 00265 00266 00267 00268 00269 00270 00271 00272 00273 00274 00275 00276 00277 00278 00279 00280 00281 00282 00283 00284 00285 00286 00287 00288 00289 00290 00291 00292 00293 00294 00295 00296 00297 00298 00299 00300 00301 00302 00303 00304 00305 00306 00307 00308 00309 00310 00311 00312 00313 00314 00315 00316 00317 00318 00319 00320 00321 00322 00323 00324 00325 00326 00327 00328 00329 00330 00331 00332 00333 00334 00335 00336 00337 00338 00339 00340 00341 00342 00343 00344 00345 00346 00347 00348 00349 00350 00351 00352 00353 00354 00355 00356 00357 00358 00359 00360 00361 00362 00363 00364 00365 00366 00367 00368 00369 00370 00371 00372 00373 00374 00375 00376 00377 00378 00379 00380 00381 00382 00383 00384 00385 00386 00387 00388 00389 00390 00391 00392 00393 00394 00395 00396 00397 00398 00399 00400 00401 00402 00403 00404 00405 00406 00407 00408 00409 00410 00411 00412 00413 00414 00415 00416 00417 00418 00419 00420 00421 00422 00423 00424 00425 00426 00427 00428 00429 00430 00431 00432 00433 00434 00435 00436 00437 00438 00439 00440 00441 00442 00443 00444 00445 00446 00447 00448 00449 00450 00451 00452 00453 00454 00455 00456 00457 00458 00459 00460 00461 00462 00463 00464 00465 00466 00467         }; 00468 00469 00470 00471 00472 00473 00474 00475         }; 00476 00477 00478 00479 00480 00481 00482 00483 00484 00485 00486 00487 00488 00489 00490 00491 00492 00493 00494 00495 00496 00497 00498 00499 00500 00501 00502 00503 00504 00505         } 00506 00507 00508 00509 00510 00511 00512 00513 00514 00515 00516 00517 00518 00519 00520 00521 00522 00523 00524 00525 00526 00527         }; 00528 00529 00530 00531 00532 00533 00534 00535 00536 00537 00538 00539 00540 00541 00542 00543 00544 00545 00546 00547 00548 00549 00550 00551 00552 00553 00554 00555 00556 00557 00558 00559 00560 00561 00562 00563 00564 00565 00566 00567 00568 00569 00570 00571 00572 00573 00574 00575 00576 00577 00578 00579 00580 00581 00582 00583 00584         } 00585 00586 00587 00588 00589 00590 00591 00592 00593         } 00594 00595 00596 00597 00598 00599 00600         } 00601 00602 00603 00604 00605 00606 00607 00608 00609 00610 00611 00612 00613 00614 00615 00616 00617 00618 00619 00620         } 00621 00622 00623 00624 00625 00626 00627 00628 00629 00630 00631 00632 00633 00634 00635 00636 00637 00638 00639 00640 00641 00642 00643 00644 00645 00646 00647 00648 00649 00650 00651 00652 00653 00654 00655 00656 00657 00658 00659 00660 00661 00662 00663 00664 00665 00666 00667 00668 00669 00670 00671 00672 00673 00674 00675 00676 00677 00678 00679 00680 00681 00682 00683 00684 00685 00686 00687 00688 00689 00690 00691 00692 00693 00694 00695 00696 00697 00698 00699 00700 00701 00702 00703 00704 00705 00706 00707 00708 00709 00710 00711 00712 00713 00714 00715 00716 00717 00718 00719 00720 00721 00722 00723 00724 00725 00726 00727 00728 00729 00730 00731 00732 00733 00734 00735 00736 00737 00738 00739 00740 00741 00742 00743 00744 00745 00746 00747 00748 00749 00750 00751 00752 00753 00754 00755 00756 00757 00758 00759 00760 00761 00762 00763 00764 00765 00766 00767 00768 00769 00770 00771 00772 00773 00774 00775 00776 00777 00778 00779 00780 00781 00782 00783 00784 00785 00786 00787 00788 00789 00790 00791 00792 00793 00794 00795 00796 00797 00798 00799 00800 00801 00802 00803 00804 00805 00806 00807 00808 00809 00810 00811 00812 00813 00814 00815 00816 00817 00818 00819 00820 00821 00822 00823 00824 00825 00826 00827 00828 00829 00830 00831 00832 00833 00834 00835 00836 00837 00838 00839 00840 00841 00842 00843 00844 00845 00846 00847 00848 00849 00850 00851 00852 00853 00854 00855 00856 00857 00858 00859 00860 00861 00862 00863 00864 00865 00866 00867 00868 00869 00870 00871 00872 00873 00874 00875 00876 00877 00878 00879 00880 00881 00882 00883 00884 00885 00886 00887 00888 00889 00890 00891 00892 00893 00894 00895 00896 00897 00898 00899 00900 00901 00902 00903 00904 00905 00906 00907 00908 00909 00910 00911 00912 00913 00914 00915 00916 00917 00918 00919 00920 00921 00922 00923 00924 00925 00926 00927 00928 00929 00930 00931 00932 00933 00934 00935 00936 00937 00938 00939 00940 00941 00942 00943 00944 00945 00946 00947 00948 00949 00950 00951 00952 00953 00954 00955 00956 00957 00958 00959 00960 00961 00962 00963 00964 00965 00966 00967 00968 00969 00970 00971 00972 00973 00974 00975 00976 00977 00978 00979 00980 00981 00982 00983 00984 00985 00986 00987 00988 00989 00990 00991 00992 00993 00994 00995 00996 00997 00998 00999 01000 01001 01002 01003 01004 01005 01006 01007 01008 01009 01010 01011 01012 01013 01014 01015 01016 01017 01018 01019 01020 01021 01022 01023 01024 01025 01026 01027 01028 01029 01030 01031 01032 01033 01034 01035 01036 01037 01038 01039 01040 01041 01042 01043 01044 01045 01046 01047 01048 01049 01050 01051 01052 01053 01054 01055 01056 01057 01058 01059 01060 01061 01062 01063 01064 01065 01066 01067 01068 01069 01070 01071 01072 01073 01074 01075 01076 01077 01078 01079 01080 01081 01082 01083 01084 01085 01086 01087 01088 01089 01090 01091 01092 01093 01094 01095 01096 01097 01098 01099 01100 01101 01102 01103 01104 01105 01106 01107 01108 01109 01110 01111 01112 01113 01114 01115 01116 01117 01118 01119 01120 01121 01122 01123 01124 01125 01126 01127 01128 01129 01130 01131 01132 01133 01134 01135 01136 01137 01138 01139 01140 01141 01142 01143 01144 01145 01146 01147 01148 01149 01150 01151 01152 01153 01154 01155 01156 01157 01158 01159 01160 01161 01162 01163 01164 01165 01166 01167 01168 01169 01170 01171 01172 01173 01174 01175 01176 01177 01178 01179 01180 01181 01182 01183 01184 01185 01186 01187 01188 01189 01190 01191 01192 01193 01194 01195 01196 01197 01198 01199 01200 01201 01202 01203 01204 01205 01206 01207 01208 01209 01210 01211 01212 01213 01214 01215 01216 01217 01218 01219 01220 01221 01222 01223 01224 01225 01226 01227 01228 01229 01230 01231 01232 01233 01234 01235 01236         } 01237 01238 01239 01240 01241 01242 01243 01244 01245 01246 01247 01248 01249 01250 01251 01252 01253 01254 01255 01256         } 01257 01258 01259 01260 01261 01262 01263 01264 01265         } 01266 01267 01268 01269         else 01270 01271 01272 01273 01274 01275 01276 01277 01278 }

class="fragment">00211 { //---------------------------- //Definitions of the constants //---------------------------- //number of hosts int numHosts=100; //connection threshold double connectionThreshold=0.1; //length of the sides of the area double sideLength_WholeAreaX=2000.0; double sideLength_WholeAreaY=2000.0; //radius of the transmission area double radius=200.0; //number of rows int numberOfRows=20; //number of columns int numberOfColumns=20; //simulationTime double totalSimulationTime=1000.0; //refreshTime double stepInterval=1.0; //low bound speed of the host double minHostSpeed=1.0; double maxHostSpeed=10.00; //reconfiguration interval //it defines the interval between two reconfigurations double reconfigurationInterval=10000.0; //rewiring probability double rewiringProb=0.1; //numberOfGroups int numberOfGroups=10; //simulation time double simTime=0.0; //number of travellers int numberOfTravellers=0; //speed of the travellers double travellerSpeed=20.0; //verbose on/off bool verbose=false; //generateXML on/off bool generateXML=false; string xmlFile="socMov.xml"; //girvan Newman clustering algorithm on off bool girvanNewmanOn=true; //colocation traces on/off bool colocationTracesOn=false; //communities traces on/off bool communitiesTracesOn=false; //deterministic on/off bool deterministicOn=true; //drift float drift; //debug variables bool firstTime=true; double timeFirstReconfiguration; //adjacency matric input bool read_adjacency=false; string inputFile; //adjacency matric output bool output_adjacency=false; //double pause time MAX int pauseMAX=0; //***********************/ // Retrieving input values // **********************/ char ch; int inputSeed; while ((ch = getopt (argc, argv, "hx:n:s:S:p:l:d:X:Y:c:C:R:G:r:T:t:w:v:g:a:d:A:b:i:P:o:"))!=EOF) switch(ch) { case 'h': //shows helps header(); usage(); exit(1); case 'x': //generate XML file using ANSim format generateXML=true; //If there is file name following if(optarg[0]!='-') { xmlFile.assign(optarg); xmlFile.append(".xml"); } else --optind; break; case 'n': //sets the number of hosts numHosts=atoi(optarg); break; case 's': //sets lower bound of the speed of the hosts minHostSpeed=(double)atof(optarg); break; case 'S': //sets upper bound of the speed of the hosts maxHostSpeed=(double)atof(optarg); break; case 'p': //sets the connection threshold connectionThreshold=(double)atof(optarg); break; case 'X': //sets the side length of the whole area (x coordinates) sideLength_WholeAreaX=(double)atof(optarg); break; case 'Y': //sets the side length of the whole area (y coordinates) sideLength_WholeAreaY=(double)atof(optarg); break; case 'R': //sets the number of rows numberOfRows=atoi(optarg); break; case 'C': //sets the number of columns numberOfColumns=atoi(optarg); break; case 'T': //sets the transmission range (radius) radius=(double)atof(optarg); break; case 't': //sets total simulation time totalSimulationTime=(double)atof(optarg); break; case 'r': //sets the reconfiguration interval reconfigurationInterval=(double)atof(optarg); break; case 'w': //sets the rewiring probability rewiringProb=(double)atof(optarg); break; case 'G': //sets the number of groups of the social network numberOfGroups=atoi(optarg); break; case 'g': //sets the seed of the random number generator inputSeed=atoi(optarg); setSeed(inputSeed); break; case 'c': //sets the number of carriers/travellers numberOfTravellers=atoi(optarg); break; case 'v': //sets the speed of the travellers travellerSpeed=(double)atof(optarg); break; case 'a': //sets the Girvan/Newman algorithm on/off if (strcmp(optarg,"on")==0) girvanNewmanOn=true; else girvanNewmanOn=false; break; case 'A': //sets colocation traces on/off if (strcmp(optarg,"on")==0) colocationTracesOn=true; else colocationTracesOn=false; break; case 'b': //sets communities on/off if (strcmp(optarg,"on")==0) communitiesTracesOn=true; else communitiesTracesOn=false; break; case 'd': //sets deterministic on/off if (strcmp(optarg,"on")==0) deterministicOn=true; else deterministicOn=false; break; case 'i': //sets adjecency input on/off read_adjacency=true; inputFile.assign(optarg); break; case 'o': //output the adjacency matrix in the given text file if (strcmp(optarg,"on")==0) output_adjacency=true; break; case 'P': pauseMAX=atoi(optarg); break; case '?': //Invalid option cerr << "Invalid option will be discarted!" << endl; break; case ':': //fprintf(stderr,"Option -%c requires an operand\n", optopt); usage(); exit(1); default: break; } int commute=0; int setgoal=0; bool isConnected[numHosts][numHosts]; struct hostsItem{ double currentX; double currentY; double relativeX; double relativeY; double goalRelativeX; double goalRelativeY; double goalCurrentX; double goalCurrentY; int cellIdX; int cellIdY; int initialCellIdX; int initialCellIdY; double speed; double absSpeed; double af; bool isATraveller; int **numberOfFriends; double pausetime; hostsItem hosts[numHosts]; struct cellsItem{ double minX; double minY; int numberOfHosts; cellsItem cells[numberOfRows][numberOfColumns]; double sideLengthX; double sideLengthY; //cell attractivity float CA[numberOfRows][numberOfColumns]; //Variables used for the generation of the mobility scenario using the results of complex networks theory and in particular the Girvan-Newman algorithm //interaction->adjacency threshold double threshold=connectionThreshold; int numberOfMembers[numHosts]; int optNumberOfMembers[numHosts]; int **adjacency; int **tempadjacency; double **interaction; int **groups; int **optGroups; // **********************************/ // Sanity Checks // **********************************/ // Chech the number of hosts if(numHosts<numberOfGroups){ cerr << "ERROR: The number of Groups was set higher than the number of Hosts! Exiting..." << endl; exit(-1); // **********************************/ //output streamle.c_str(),"wt"))==NULL) fprintf(stderr,"Cannot open %s\n",xmlFile.c_str()); std::ofstream out1; //input fileName char resultsFileName[]="results.txt"; //double last values registered double lastValues[numHosts][numHosts]; //array [hostId,communitiesId] int communities[numHosts][2]; //probability of moving to the cell [c][r] float a[numberOfRows][numberOfColumns]; struct probRange { float min; float max; probRange p[numberOfRows][numberOfColumns]; //probability space distribution in the range [0..1] // **********************************/ // Initialisation of the output files // **********************************/ //Creation of the output file XML FILE* outputFileXML; generateXML=true; if (generateXML==true) if ((outputFileXML=fopen(xmlFile.c_str(),"wt"))==NULL) fprintf(stderr,"Cannot open %s\n",xmlFile.c_str()); //Creation of the colocation statistics files FILE* outputColocFiles[numHosts]; if (colocationTracesOn==true) for (int i=0;i<numHosts;i++) { static char fileName[10]; static char prefix[]=".idat"; sprintf(fileName,"%d%s",i,prefix); if ((outputColocFiles[i]=fopen(fileName,"wt"))==NULL) fprintf(stderr,"Cannot open %s\n",fileName); }//end for //Creation of the communities statistics files FILE* outputCommunitiesFile; FILE* outputAdjacency; //Erasing file output adjacency file system("echo > adjacency.idat"); // ***************************/ // Initialisation of the model //****************************/ sideLengthX=sideLength_WholeAreaX/((double)numberOfRows); sideLengthY=sideLength_WholeAreaY/((double)numberOfColumns); for (int i=0;i<numberOfRows;i++) for (int j=0;j<numberOfColumns;j++) { cells[i][j].minX=((double)i)*sideLengthX; cells[i][j].minY=((double)j)*sideLengthY; cells[i][j].numberOfHosts=0; } //setup of the links for (int i=0;i<numHosts;i++) { for (int l=0;l<numHosts;l++) { isConnected[i][l]=false; lastValues[i][l]=0.0; //nodeModule1->setIsInReach(l,false); } //initialization of the travellers for (int i=0; i<numberOfTravellers; i++) { hosts[i].isATraveller=true; //definition of the initial speeds of the travellers hosts[i].speed=travellerSpeed; for (int i=numberOfTravellers; i<numHosts; i++) { hosts[i].isATraveller=false; hosts[i].speed=generateRandomDouble(minHostSpeed,maxHostSpeed); double numberOfReconfigurations=0.0; double nextReconfigurationTime=0.0; int initialNumberOfGroups=numberOfGroups; //Update of the positions adjacency=initialise_int_array(numHosts); interaction=initialise_double_array(numHosts); groups=initialise_int_array(numHosts); optGroups=initialise_int_array(numHosts); int optNumberOfGroups=0; double node_betw[numHosts]; double** betw=initialise_double_array(numHosts); //Initialize the number of friends for each host for (int k=0;k<numHosts;k++) { hosts[k].numberOfFriends=initialise_int_square_array(numberOfColumns, numberOfRows); for (simTime=0.0; simTime<totalSimulationTime;simTime=simTime+stepInterval) { //reconfiguration mechanism if (simTime==nextReconfigurationTime) { for (int i=0;i<numberOfRows;i++) { for (int j=0;j<numberOfColumns;j++) { cells[i][j].numberOfHosts=0; //Initialize the number of friend in each square for every host for (int k=0;k<numHosts;k++) hosts[k].numberOfFriends[i][j]=0; } } //start correction adjacency=initialise_int_array(numHosts); tempadjacency=initialise_int_array(numHosts); interaction=initialise_double_array(numHosts); //print_double_array(interaction,numHosts); groups=initialise_int_array(numHosts); optGroups=initialise_int_array(numHosts); optNumberOfGroups=0; //end correction numberOfReconfigurations=numberOfReconfigurations+1.0; nextReconfigurationTime=reconfigurationInterval*numberOfReconfigurations; bool splitted=true; double previousModth=0.0; double modth=0.0; double optModth=0.0; if (girvanNewmanOn==true) { if(read_adjacency==false) { initialise_weight_array_ingroups(interaction,numHosts,initialNumberOfGroups,rewiringProb,threshold,generateRandomDouble(0,inputSeed)); generate_adjacency(interaction,adjacency,threshold,numHosts); } else { if(!readAdjacency(inputFile, interaction,adjacency,numHosts,threshold)) exit(-1); } //Creating a temporal copy of the adjacency matrix for (int i=0;i<numHosts; i++) { for (int j=0;j<numHosts; j++) { tempadjacency[i][j]=adjacency[i][j]; } } //clustering using the Girvan-Newman algorithm do { //Initialize numberOfMembers matrix for (int i=0;i<numHosts; i++) numberOfMembers[i]=0; for (int i=0;i<numHosts; i++) { for (int j=0;j<numHosts;j++) { betw[i][j]=0; } } //Calculating the edge betweenness of the current graph calculate_edge_betweenness(betw,tempadjacency,numHosts); //Find the initial number of Groups numberOfGroups=getGroups(tempadjacency, groups ,numberOfMembers,numHosts); //Save the previous modularity for the comparison previousModth=modth; //Split the network according to the modularity modth=splitNetwork_edge_Threshold(adjacency, tempadjacency, betw, numHosts, modth); //Check for the optimum solution if(optModth<modth || optNumberOfGroups==0) { optModth=modth; //Reinitialize numberOfMembers matrix for (int i=0;i<numHosts; i++) numberOfMembers[i]=0; //Find the number of Groups after the split optNumberOfGroups=getGroups(tempadjacency, groups ,numberOfMembers,numHosts); //Copy groups matrix for(int m=0;m<numHosts;m++) { optNumberOfMembers[m]=numberOfMembers[m]; for(int n=0;n<numHosts;n++) if (m<optNumberOfGroups && n<optNumberOfMembers[m]){ optGroups[m][n]=groups[m][n]; } } } //Print results is asked if (verbose==true && modth!=-1) { //Reinitialize numberOfMembers matrix for (int i=0;i<numHosts; i++) numberOfMembers[i]=0; //Find the number of Groups after the split numberOfGroups=getGroups(tempadjacency, groups ,numberOfMembers,numHosts); cout<<"\nModth is equal to "<<modth<<endl; printGroups(numberOfGroups, groups, numberOfMembers, numHosts); } } while ( (previousModth<=2*modth) && (modth>-1) ); //Printing results cout<<endl<<"---------Communities Detected---------"<<endl; cout << "Optimal Modularity: " << optModth << endl; cout << "Optimal number of groups: " << optNumberOfGroups << endl; printGroups(optNumberOfGroups, optGroups, optNumberOfMembers, numHosts); cout<<"--------------------------------------"<<endl; //Copy results in the used variables //Find the number of Groups after the split numberOfGroups=optNumberOfGroups; //Copy groups matrix for(int m=0;m<numHosts;m++) { numberOfMembers[m]=optNumberOfMembers[m]; for(int n=0;n<numHosts;n++) if (m<optNumberOfGroups && n<optNumberOfMembers[m]){ groups[m][n]=optGroups[m][n]; } } }//end if (girvanNewmanOn==true) else if(girvanNewmanOn==false) { //communities based on the initial number of caves in the Caveman model //i.e., w=0 if(read_adjacency==true) { cout << endl << "!!!!!!!!!Adjacency input file given but Girvan Newman algorithm is turned off!!!!!!!!!" << endl; cout << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!Creating random network...!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!" << endl << endl; sleep(2); } initialise_weight_array_ingroups(interaction,numHosts,initialNumberOfGroups,0,threshold,inputSeed); generate_adjacency(interaction,adjacency,threshold,numHosts); for (int i=0;i<numHosts; i++) numberOfMembers[i]=0; numberOfGroups=getGroups(adjacency, groups ,numberOfMembers,numHosts); if (verbose==true) printGroups(numberOfGroups, groups, numberOfMembers, numHosts); initialise_weight_array_ingroups(interaction,numHosts,initialNumberOfGroups,rewiringProb,threshold,inputSeed); generate_adjacency(interaction,adjacency,threshold,numHosts); //print_double_array(interaction, numHosts); }//end else //Calculate node betweenness calculate_node_betweenness(node_betw, adjacency, numHosts); calculate_edge_betweenness(betw,adjacency,numHosts); //Choose initial cells for the hosts, randomly for each community int pointer=0; for (int i=0;i<numberOfGroups;i++) { int cellIdX=generateRandomInteger(0,numberOfRows); int cellIdY=generateRandomInteger(0,numberOfColumns); //Check this cell hasn't been used before for (int k=0;k<pointer;k++) { if(hosts[communities[k][0]].cellIdX==cellIdX && hosts[communities[k][0]].cellIdY==cellIdY) { cellIdX=generateRandomInteger(0,numberOfRows); cellIdY=generateRandomInteger(0,numberOfColumns); k=0; } } for (int j=0;j<numberOfMembers[i];j++) { int hostId=groups[i][j]; hosts[hostId-1].cellIdX=cellIdX; hosts[hostId-1].cellIdY=cellIdY; hosts[hostId-1].initialCellIdX=cellIdX; hosts[hostId-1].initialCellIdY=cellIdY; communities[pointer][0]=hostId; communities[pointer][1]=i+1; pointer++; //increment the number of the hosts in that cell cells[cellIdX-1][cellIdY-1].numberOfHosts+=1; } } //Output the adjacency file if (output_adjacency==true) { //Opening and writing into file if ((outputAdjacency=fopen("adjacency.idat","a+"))==NULL) fprintf(stderr,"Cannot open adjacency.idat\n"); for (int i=0;i<numHosts;i++) { for (int j=0;j<numHosts;j++) { fprintf(outputAdjacency, "%d ", adjacency[i][j]); }//end for (int j=0 fprintf(outputAdjacency,"\n"); }// end for (int i=0 fprintf(outputAdjacency,"\n"); fclose(outputAdjacency); }//end communitiesTracesOn //Set initial number of friends in each square for every host and initialize pause time to -1 (invalid) for (int i=0;i<numHosts;i++) { //Also initialize pause time hosts[i].pausetime=-1; for (int j=0;j<numHosts;j++) { //If the two nodes are friends if(adjacency[i][j]==1 && i!=j) { //Increase the number of friends in the specific square of the grid hosts[i].numberOfFriends[hosts[j].cellIdX-1][hosts[j].cellIdY-1]++; } } } if (communitiesTracesOn==true) { if ((outputCommunitiesFile=fopen("communities.idat","wt"))==NULL) fprintf(stderr,"Cannot open communities.idat\n"); int temp1=0; int temp2=0; for (int i=0;i<numHosts;i++) { for (int j=0;j<numHosts-1;j++) { if (communities[j][0]>communities[j+1][0]) { temp1=communities[j+1][0]; temp2=communities[j+1][1]; communities[j+1][0]=communities[j][0]; communities[j+1][1]=communities[j][1]; communities[j][0]=temp1; communities[j][1]=temp2; } }//end for (int j=0 }// end for (int i=0 for (int i=0;i<numHosts;i++) { fprintf(outputCommunitiesFile, "%d%s", communities[i][0]," "); fprintf(outputCommunitiesFile, "%d%s", communities[i][1],"\n"); } fclose(outputCommunitiesFile); }//end communitiesTracesOn if (firstTime==true) { //definition of the initial position of the hosts for (int k=0;k<numHosts;k++) { hosts[k].currentX=cells[hosts[k].cellIdX-1][hosts[k].cellIdY-1].minX+generateRandomDouble(0.0,sideLengthX); hosts[k].currentY=cells[hosts[k].cellIdX-1][hosts[k].cellIdY-1].minY+generateRandomDouble(0.0,sideLengthY); } timeFirstReconfiguration=simTime; firstTime=false; // ************************ // Generation of the traces // ************************ printf("%s","#Mobility Patterns Generator for OMNET++ simulator\n"); printf("%s","#Based on the Enhanced Home Community Based Mobility Model\n"); printf("%s","#Copyright (C) Nikolaos Vastardis, University of Essex\n"); printf("%s","# nvasta@essex.ac.uk\n"); printf("%s","#Version 1.0 May 2011\n"); printf("%s","set god_ [God instance]\n"); //Generating initial positions of the hosts for (int i=0;i<numHosts;i++) { printf("%s%d%s%f%s","$node_(",i,") set X_ ",hosts[i].currentX,"\n"); printf("%s%d%s%f%s","$node_(",i,") set Y_ ",hosts[i].currentY,"\n"); printf("%s%d%s%f%s","$node_(",i,") set Z_ ",0.0,"\n"); } //Generating initial positions of the hosts - XML code if (generateXML==true) { generateXMLHeader(outputFileXML, sideLength_WholeAreaX, sideLength_WholeAreaY, radius, numHosts); fprintf(outputFileXML,"\t<node_settings>\n"); for (int i=0;i<numHosts;i++) { generateXMLSetNodePosition(outputFileXML, i, hosts[i].currentX, hosts[i].currentY,sideLength_WholeAreaX,sideLength_WholeAreaY); } fprintf(outputFileXML,"\t</node_settings>\n"); fprintf(outputFileXML,"\t<mobility>\n"); }//end generation XML code }//end if (firstTime==true) //definition of the initial goals for (int k=0;k<numHosts;k++) { hosts[k].goalCurrentX=cells[hosts[k].cellIdX-1][hosts[k].cellIdY-1].minX+generateRandomDouble(0.0,sideLengthX); hosts[k].goalCurrentY=cells[hosts[k].cellIdX-1][hosts[k].cellIdY-1].minY+generateRandomDouble(0.0,sideLengthY); } //generation of the traces - setting of the goals for (int i=0;i<numHosts;i++) { hosts[i].absSpeed=hosts[i].speed; //printf("%s %f %s%d%s %f %f %f%s","$ns_ at",simTime,"\"$node_(",i,") setdest",hosts[i].goalCurrentX,hosts[i].goalCurrentY,(hosts[i].absSpeed)/stepInterval,"\"\n"); if (generateXML==true) generateXMLSetNewGoal(outputFileXML,i,simTime,hosts[i].goalCurrentX,hosts[i].goalCurrentY,hosts[i].absSpeed/stepInterval,sideLength_WholeAreaX,sideLength_WholeAreaY); } //end for (int i=0;i<numHosts;i++) }//end reconfiguration mechanism // !!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!! // !!!!!!!!!!!!!!!!!! No specific speed for x and y axis !!!!!!!!!!!!!!!!!! // !!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!! for (int i=0;i<numHosts;i++) { if((hosts[i].currentX>hosts[i].goalCurrentX+hosts[i].speed)|| (hosts[i].currentX<hosts[i].goalCurrentX-hosts[i].speed)|| (hosts[i].currentY>hosts[i].goalCurrentY+hosts[i].speed)|| (hosts[i].currentY<hosts[i].goalCurrentY-hosts[i].speed)) { //move towards the goal if (hosts[i].currentX<(hosts[i].goalCurrentX-hosts[i].speed)) hosts[i].currentX=hosts[i].currentX+hosts[i].speed; if (hosts[i].currentX>(hosts[i].goalCurrentX+hosts[i].speed)) hosts[i].currentX=(hosts[i].currentX)-hosts[i].speed; if (hosts[i].currentY<(hosts[i].goalCurrentY-hosts[i].speed)) hosts[i].currentY=(hosts[i].currentY)+hosts[i].speed; if (hosts[i].currentY>(hosts[i].goalCurrentY+hosts[i].speed)) hosts[i].currentY=(hosts[i].currentY)-hosts[i].speed; } //If node just finished a movement in his home square, pause for some seconds else if(pauseMAX>0 && hosts[i].pausetime==-1 /*&& hosts[i].cellIdX==hosts[i].initialCellIdX && hosts[i].cellIdY==hosts[i].initialCellIdY*/) { hosts[i].pausetime=simTime+generateRandomInteger(0,pauseMAX); hosts[i].absSpeed=0; //Print the info for the pausing node //printf("%s %f %s%d%s %f %f %f%s","$ns_ at",simTime,"\"$node_(",i,") setdest",hosts[i].goalCurrentX,hosts[i].goalCurrentY,(hosts[i].absSpeed)/stepInterval,"\"\n"); if (generateXML==true) generateXMLSetNewGoal(outputFileXML,i,simTime,hosts[i].goalCurrentX,hosts[i].goalCurrentY,hosts[i].absSpeed/stepInterval,sideLength_WholeAreaX,sideLength_WholeAreaY); } else if(hosts[i].pausetime<=simTime){ hosts[i].pausetime=-1; int selectedGoalCellX=0; int selectedGoalCellY=0; int previousGoalCellX=hosts[i].cellIdX; int previousGoalCellY=hosts[i].cellIdY; if (deterministicOn==true) { //Algorithm of the selection of the new cell for (int c=0;c<numberOfRows;c++) for (int r=0;r<numberOfColumns;r++) CA[c][r]=0; //find current node's community int comId=-1; for(int c=0;c<numHosts;c++){ if(communities[c][0]==i+1) comId=communities[c][1]; } //Add interaction of each node to the present while the initial cell exerts attraction with all the initial nodes for (int n=0;n<numHosts;n++) { //For all nodes but the present one if (n!=i) { //Check the communities of all nodes for(int c=0;c<numHosts;c++) { if(communities[c][0]-1==n) { //If the checked node belongs to the same community as the currently choosing target add their //interaction to the initial square of the current node if (communities[c][1]==comId) CA[hosts[n].initialCellIdX-1][hosts[n].initialCellIdY-1]+=interaction[i][n]; //Else add it to the square it currently resides else CA[hosts[n].cellIdX-1][hosts[n].cellIdY-1]+=interaction[i][n]; } } } } for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { if (cells[c][r].numberOfHosts!=0) { CA[c][r]=CA[c][r]/(double)(cells[c][r].numberOfHosts); } else CA[c][r]=0; } } int selectedGoalCellX2=0; int selectedGoalCellY2=0; double CAMax1=0; double CAMax2=0; for (int c=0;c<numberOfRows;c++) for (int r=0;r<numberOfColumns;r++) if (CA[c][r]>CAMax1) { //set the second best selectedGoalCellX2=selectedGoalCellX; selectedGoalCellY2=selectedGoalCellY; CAMax2=CAMax1; selectedGoalCellX=c+1; selectedGoalCellY=r+1; CAMax1=CA[c][r]; } else if (CA[c][r]>CAMax2) { selectedGoalCellX2=c+1; selectedGoalCellY2=r+1; CAMax2=CA[c][r]; } setgoal++; if ((previousGoalCellX!=selectedGoalCellX)||(previousGoalCellY!=selectedGoalCellY)) { cout << "Host "<< i+1 << " is moving from cell " << previousGoalCellX << "-" << previousGoalCellY; cout << " to cell " << selectedGoalCellX << "-" << selectedGoalCellY << endl; } if ((previousGoalCellX==selectedGoalCellX)&&(previousGoalCellY==selectedGoalCellY)) { if (hosts[i].isATraveller==true) { if (selectedGoalCellX!=0) { selectedGoalCellX=selectedGoalCellX2; selectedGoalCellY=selectedGoalCellY2; } } } }//end deterministic else {//probabilistic //Algorithm of the selection of the new cell for (int c=0;c<numberOfRows;c++) for (int r=0;r<numberOfColumns;r++) CA[c][r]=0.0; //find current node's community int comId=-1; for(int c=0;c<numHosts;c++){ if(communities[c][0]==i+1) comId=communities[c][1]; } //Add interaction of each node to the present while the initial cell exerts attraction with all the initial nodes for (int n=0;n<numHosts;n++) { //For all nodes but the present one if (n!=i) { //Check the communities of all nodes for(int c=0;c<numHosts;c++) { if(communities[c][0]-1==n) { //If the checked node belongs to the same community as the currently choosing target add their //interaction to the initial square of the current node if (communities[c][1]==comId) CA[hosts[n].initialCellIdX-1][hosts[n].initialCellIdY-1]+=interaction[i][n]; //Else add it to the square it currently resides else CA[hosts[n].cellIdX-1][hosts[n].cellIdY-1]+=interaction[i][n]; } } } } for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { if (cells[c][r].numberOfHosts!=0) { CA[c][r]=CA[c][r]/(double)(cells[c][r].numberOfHosts); } else CA[c][r]=0; } } //Denonmiantor for the normalization of the values float denNorm=0.00; //used for simulations //drift=0.01; drift=0; for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { denNorm=denNorm+CA[c][r]+drift; //printf ("%f ",CA[c][r]); } //cout << endl; } for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { if (CA[c][r]==0) a[c][r]=drift/denNorm; else a[c][r]=(CA[c][r]+drift)/(+denNorm); } } float current=0.0; for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { p[c][r].min=current; p[c][r].max=p[c][r].min+a[c][r]; current=p[c][r].max; } } //float infiniteDice= (float) random() / (float) 0x7fffffff;; float infiniteDice = (float) generateRandomDouble(0.0,1.0); //printf ("%f %s",infiniteDice,"\n"); for (int c=0;c<numberOfRows;c++) { for (int r=0;r<numberOfColumns;r++) { if ((infiniteDice>p[c][r].min)&&(infiniteDice<=p[c][r].max)) { selectedGoalCellX=c+1; selectedGoalCellY=r+1; setgoal++; } } } }//end probabilistic //Since the goal square changed change the number of friends for this node's friends if ((previousGoalCellX!=selectedGoalCellX)||(previousGoalCellY!=selectedGoalCellY)) { for (int n=0;n<numHosts;n++) { //If the two nodes are friends if(adjacency[i][n]==1 && i!=n) { //Increase the number of friends in the specific square of the grid hosts[n].numberOfFriends[previousGoalCellX-1][previousGoalCellY-1]-=1; hosts[n].numberOfFriends[selectedGoalCellX-1][selectedGoalCellY-1]+=1; } } commute++; } //Re-definition of the number of hosts in each cell cells[previousGoalCellX-1][previousGoalCellY-1].numberOfHosts-=1; cells[selectedGoalCellX-1][selectedGoalCellY-1].numberOfHosts+=1; double newGoalRelativeX=generateRandomDouble(0,sideLengthX); double newGoalRelativeY=generateRandomDouble(0,sideLengthY); //refresh of the information hosts[i].cellIdX=selectedGoalCellX; hosts[i].cellIdY=selectedGoalCellY; hosts[i].goalCurrentX=cells[selectedGoalCellX-1][selectedGoalCellY-1].minX+newGoalRelativeX; hosts[i].goalCurrentY=cells[selectedGoalCellX-1][selectedGoalCellY-1].minY+newGoalRelativeY; hosts[i].speed=generateRandomDouble(minHostSpeed,maxHostSpeed); hosts[i].absSpeed=hosts[i].speed; //printf("%s %f %s%d%s %f %f %f%s","$ns_ at",simTime,"\"$node_(",i,") setdest",hosts[i].goalCurrentX,hosts[i].goalCurrentY,(hosts[i].absSpeed)/stepInterval,"\"\n"); if (generateXML==true) generateXMLSetNewGoal(outputFileXML,i,simTime,hosts[i].goalCurrentX,hosts[i].goalCurrentY,hosts[i].absSpeed/stepInterval,sideLength_WholeAreaX,sideLength_WholeAreaY); } }// end for (int i=0;i<numHosts;i++) { for (int i=0;i<numHosts;i++) { //update connectivity for (int j=0;j<numHosts;j++) { //I am connected with me so the following condition must hold...:) if (i!=j) { //calculation of the current distance double currentDistance=sqrt((hosts[i].currentX-hosts[j].currentX)*(hosts[i].currentX-hosts[j].currentX)+(hosts[i].currentY-hosts[j].currentY)*(hosts[i].currentY-hosts[j].currentY)); //if currentDistance<=radius then the hosts are connected if (currentDistance<radius) { //if the hosts has been previously disconnected, then they must be connected if (isConnected[i][j]==false) { isConnected[i][j]=true; lastValues[i][j]=simTime; } } //else they are disconnected else { if (isConnected[i][j]==true) { if (simTime!=0) { //if the hosts has been previously connected, then they must be disconnected if (colocationTracesOn) fprintf(outputColocFiles[i],"%d %ld %ld\n",j+1,(long)lastValues[i][j],(long)simTime); isConnected[i][j]=false; } } }//end else }//end if (i!=j) } } //Print the colocation traces for the nodes who were connected when simulation finished for (int i=0;i<numHosts;i++) { //update connectivity for (int j=0;j<numHosts;j++) { //I am connected with me so the following condition must hold...:) if (i!=j) { if (isConnected[i][j]==true) { if (simTime!=0) { //if the hosts has been previously connected, then they must be disconnected if (colocationTracesOn) fprintf(outputColocFiles[i],"%d %ld %ld\n",j+1,(long)lastValues[i][j],(long)simTime); isConnected[i][j]=false; } } }//end if (i!=j) } //generation of the XML file - generation of the last lines if (generateXML==true) { fprintf(outputFileXML,"\t</mobility>\n"); fprintf(outputFileXML,"\t<statistics>\n"); fprintf(outputFileXML,"\t\t<stoptime>%f</stoptime>\n",simTime); fprintf(outputFileXML,"\t</statistics>\n"); fprintf(outputFileXML,"</simulation>\n"); if(setgoal!=0) cout << "Percentage of commute nodes: "<< (double)commute/(double)setgoal << endl; cout << "Percentage of commute nodes: 0" << endl; cout << "Random Seed: " << inputSeed << endl; // close output file and outputFileXML if (generateXML==true) fclose (outputFileXML);

void setSeed ( unsigned int init )

00098                                    {
00099         if (init != 0.0) SEED = init;
00100 }

void usage ( )

00134              {
00135         printf("%s","Usage: movGen [-options] \n");
00136         printf("%s","Input parameters:\n");
00137         printf("%s","-h                           shows help\n");
00138         printf("%s","-x <output_XML_file>         generates XML\n");
00139     printf("%s","-n <numberOfHosts>           sets the number of hosts\n");
00140         printf("%s","-t <totalSimulationTime>     sets the total simulation time\n");
00141         printf("%s","-r <reconfigurationInterval> sets the reconfiguration interval\n");
00142         printf("%s","-s <lowerBoundSpeedHost>     sets lower bound of the speed of the hosts (in m/s)\n");
00143         printf("%s","-S <upperBoundSpeedHost>     sets upper bound of the speed of the hosts (in m/s)\n");
00144         printf("%s","-p <connectionThreshold>     sets the connection threshold\n");
00145         printf("%s","-X <sideLengthXcoordinates>  sets the side length of the the simulation area - x coordinates\n");
00146         printf("%s","-Y <sideLengthYcoordinates>  sets the side length of the the simulation area - y coordinates\n");
00147         printf("%s","-R <numberOfRows>            sets the number of rows\n");
00148         printf("%s","-C <numberOfColumns>         sets the number of columns\n");
00149         printf("%s","-T <transmissionRange>       sets the transmission range (in m)\n");
00150         printf("%s","-w <rewiring probability>    sets the rewiring probability\n");
00151         printf("%s","-G <numberOfGroups>          sets the initial number of groups for the Caveman model\n");
00152         printf("%s","-g <seedRNG>                 sets the seed of the Random Number Generator\n");
00153         printf("%s","-c <numberOfTravellers>      sets the number of travellers\n");
00154         printf("%s","-v <travellersSpeed>         sets the speed of the travellers\n");
00155         printf("%s","-a <on/off>                  sets the Girvan-Newman algorithm on/off\n");
00156         printf("%s","-d <on/off>                  sets the deterministic selection of the nodes on/off. If true the selection is deterministic, if false is probabilistic\n");
00157         printf("%s","-i <on/off>                  sets the the name of the input adjacency file\n");
00158         printf("%s","-o <on/off>                  sets the output adjacency file generation on/off\n");
00159         printf("%s","-P <on/off>                  sets the maximum pause time durationmake"
00160                         "\n");
00161         printf("%s","-A <on/off>                  sets the colocation traces on/off\n");
00162         printf("%s","-b <on/off>                  sets the communities traces on/off\n");
00163 }

homeMovGen-rel1.0.cc File Reference

Defines

Functions

Define Documentation

Function Documentation