2010-07-13 12:15:46 +00:00
|
|
|
/*
|
|
|
|
Serval Distributed Numbering Architecture (DNA)
|
|
|
|
Copyright (C) 2010 Paul Gardner-Stephen
|
|
|
|
|
|
|
|
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
2012-02-23 02:15:42 +00:00
|
|
|
#include "serval.h"
|
2010-07-13 12:15:46 +00:00
|
|
|
|
|
|
|
double simulatedBER=0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
We use this function to simulate a lossy link so that we can easily bench-test the
|
|
|
|
retransmission protocols.
|
|
|
|
*/
|
2012-07-03 06:06:51 +00:00
|
|
|
int dropPacketP(size_t packet_len)
|
2010-07-13 12:15:46 +00:00
|
|
|
{
|
2012-07-03 06:06:51 +00:00
|
|
|
size_t i;
|
|
|
|
int b;
|
2010-07-13 12:15:46 +00:00
|
|
|
|
|
|
|
long berThreshold=0x7fffffff*simulatedBER;
|
|
|
|
|
|
|
|
if (!simulatedBER) return 0;
|
|
|
|
|
|
|
|
for(i=0;i<packet_len;i++)
|
|
|
|
for(b=0;b<8;b++)
|
|
|
|
if (random()<=berThreshold) return 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|