📄 antgenerator.cc
字号:
// -*- C++ -*-
// Copyright (C) 2003 Leherstuh f黵 Betrieb System/ Verteilte System,
// Universitaet Dortmund
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// Author: Muddassar Farooq
// Informatik III, Universitaet Dortmund
// Germany
//-------------------------------------------------------------
// file: antGenerator.cpp
// (part of AntNet Routing Simulation)
//-------------------------------------------------------------
#include <stdio.h>
#include "antGenerator.h"
#include "Messages_m.h"
#include "ant.h"
Define_Module( antGenerator );
antGenerator::antGenerator(const char *name, cModule *parentmodule, unsigned stacksize)
: cSimpleModule(name, parentmodule,stacksize)
{
dataPacketSentToDestination = NULL;
antsGeneratedForEachDestination = NULL;
antGenerationProbability = NULL;
}
void antGenerator::activity()
{
int myAddress = par("address");
numStations = par("numStations");
cPar& sleepTime = par("sleepTimeAtStart");
cPar& interArrivalTime = par("iaTime");
int messageLength = par("messageLength");
double converganceTime = par("converganceTime");
int antID = 0;
totalPacketsSent = 0.0;
debug = true;
logResults = par("logResults");
dataPacketSentToDestination = new double[numStations];
antGenerationProbability = new float[numStations];
antsGeneratedForEachDestination = new double[numStations];
for(int i = 0; i < numStations; i++)
{
dataPacketSentToDestination[i] = 0.0;
antGenerationProbability[i] = 0.0;
antsGeneratedForEachDestination[i] = 0.0;
}
const char *statModulePath = par("statModulePath");
cModule *tmp1 = simulation.moduleByPath(statModulePath);
sPtr= check_and_cast<statistics *> (tmp1);
launchNewAnts = new cMessage("launchNewAnts");
wait( sleepTime );
simtime_t antGenInterval = (double) interArrivalTime;
scheduleAt( simTime() + antGenInterval, launchNewAnts);
char msgname[70];
for(;;)
{
cMessage *msg = receive();
if( simTime () < 1500)
{
if(dynamic_cast<samplePacket *> (msg) != NULL)
{
samplePacket *dPacket = (samplePacket*) msg;
int destination = dPacket->getDestAddress();
dataPacketSentToDestination[destination] += 1.0; // fsd
totalPacketsSent += 1.0; // sum of fsd
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -