// Place global declarations here.
const int N=5+1; //Number of nodes +1
const int M=15+1; //Maximum sequence number +1
const int QLength=40;
const int time_between_hello=1500; //Hello interval
const int time_between_tc=4500; //TC interval
const int time_sending=500;
const int time_spread=500;
const int TTL=N;
const int id_1=1; // is used for adding or droping a link between node 1 and 3
const int id_2=2;
const int id_3=3;
typedef int[0,N-1] IP; //Set of all ip numbers
typedef int[0,M-1] SQN;// Set of all sequence numbers
typedef int[0,3] MSGTYPE;//Set of all types of messages
int[0,QLength-1] nodebuffersize[N];
//for test_case generate.
// send packet from oip1 to dip1
const int OIP1=1;
const int DIP1=3;
const int DIP2=2;
// type of messages
const MSGTYPE NONE=0;
const MSGTYPE PACKET=1;
const MSGTYPE HELLO=2;
const MSGTYPE TC=3;
bool idle[N]={1,1,1,1,1,1};
meta bool topology[N][N]={
{0,0,0,0,0,0},
{0,0,1,0,0,1},
{0,1,0,1,1,0},
{0,0,1,0,0,0},
{0,0,1,0,0,1},
{0,1,0,0,1,0}
};
bool isconnected(IP i, IP j){
return(topology[i][j]==1);
}
bool emptybuffers(){
for(i: int[1,N-1]){
if(nodebuffersize[i]>0||!idle[i]){
return false;
}
}
return true;
}
//channels
broadcast chan htc[N],urg[N], hur[N];
urgent chan imsg[N];
chan pkt[N][N];
chan packet[N][N]; /// get rid of this, replace by pkt/
urgent broadcast chan tau[N];
chan priority urg[5] < hur[5]< tau[5] < imsg[5] < htc[5] < urg[4] < hur[4] < tau[4] < imsg[4] < htc[4] < urg[3]< hur[3] < tau[3] < imsg[3] < htc[3] < urg[2]< hur[2] < tau[2] < imsg[2] < htc[2] < urg[1]< hur[1] < tau[1] < imsg[1] < htc[1];
typedef struct { //HELLO and TC messages
MSGTYPE msgtype; //type of message (packet, Hello, TC)
IP oip; //originator address or ip
IP dip;
bool onehop[N];
int ttltc;
int hops; //hops from originator
IP sip; //Sender IP
SQN osn; //message(TC) sequence number
bool mpr[N]; //used for mprs in Hello messages and mprselectors in TC messages
} MSG;
MSG msgglobal;
typedef struct { //Routing table entry
IP dip;
int hops; //Number of hops to destination
IP nhopip; // Next hop ip
SQN dsn; // Sequence number of originator of TC ;
} rtentry;
Testerclock clk;
void drop (IP i,IP j){
topology[i][j]=0;
topology[j][i]=0;
}
drop_linkdeliverytest2OLSRconst IP ip// Place local declarations here.
rtentry rt[N]; //routing table of node ip
SQN sn=1; // local sequence number
MSG msglocal; //message currently handled
int delivered=0; // indicates that a packet has been deliered at this node
bool isMPR; // node is classified as MPR
bool mprselector[N]; //is used in TC msgs and helps those nodes which do not transmit TC to find the route to other nodes.
//bool flag_hello=0; // this flag is used when overlapping TC and Hello. For instance when t_hello=1500 and t_tc=4500
bool flag_fwd=0; // if a TC is recieved from the queue and at the same time, hello or tc must be sent, this flag is set to 1 which shows the tc to be forwarded is not still forwarded.
bool flag_pkt=0;
int a;
bool flag_reset[N];
bool flag_sn=0;
//////////////////
//timers
//////////////////
clock t_send; //time for sending a message
clock t_hello; //time passed since the last hello message
//also used for init
clock t_tc; //time passed since the last hello message
clock t_reset_rt [N];
clock t_reset_rt_topo[N];
//////////////////
//functions
//////////////////
//delete local message - happens whenever a messages has been handled successfully
void deletemsg(){
msglocal.msgtype=NONE;
}
// HELLO messages
//////////////////
//create new Hello message
void createhello(){
MSG msg;
msg.msgtype= HELLO;
msg.oip= ip;
for(i:int[1,N-1]){
if (rt[i].hops==1){
msg.onehop[i] = 1;
}
else {
msg.onehop[i]= 0;
if (rt[i].hops==2){
msg.mpr[rt[i].nhopip]=1;
}
}
}
msgglobal= msg;
}
//update data as consequence of a received hello message
void updatehello(){
rt[msglocal.oip].dip=msglocal.oip;
rt[msglocal.oip].hops= 1;
rt[msglocal.oip].nhopip=msglocal.oip;
rt[msglocal.oip].dsn=rt[msglocal.oip].dsn;
}
//////////////////
// TC messages
//////////////////
//create new TC message
void createtc(IP oip, SQN osn, int ttltc, int hops, IP sip, bool mprselector[N]){
MSG msg;
msg.msgtype= TC;
msg.oip= oip;
msg.osn= osn; // originator of TC SQN
msg.ttltc= ttltc;
msg.hops= hops;
msg.sip= sip;
msg.mpr = mprselector;
msgglobal= msg;
}
//update routing table when receiving a TC msg
void updatetc(){
if(rt[msglocal.oip].hops==1|| rt[msglocal.oip].hops==2){
rt[msglocal.oip].dsn=msglocal.osn;
}
else{
if(rt[msglocal.oip].hops!=1&& rt[msglocal.oip].hops!=2){
rt[msglocal.oip].dip=msglocal.oip;
rt[msglocal.oip].hops= msglocal.hops+1;
rt[msglocal.oip].nhopip= msglocal.sip;
rt[msglocal.oip].dsn=msglocal.osn;
}
}
}
//////////////////
///functions below to be sorted and annotated
void updatetwohop(){ //When receiving a Hello msg, every node updates its rounting table for onehop neighbors of the originator
// (twohop neighbors)
for(i:int[1,N-1]){
if(msglocal.onehop[i]==1 && i!=ip && rt[i].hops!=1){
rt[i].dip=i;
rt[i].hops= 2;
rt[i].nhopip= msglocal.oip;
}
}
}
void setmpr(){ // Allows MPR nodes to know that they are MPRs and shows which nodes have selected this node as MPR.
if (msglocal.mpr[ip] == 1){
// isMPR=1;
mprselector[msglocal.oip]=1;
}
else{
if(msglocal.mpr[ip] == 0){
mprselector[msglocal.oip]=0;
}
}
}
void reset_mpr(){ // removing the node from MPR status
for(i:int[1,N-1]){
if (mprselector[i]==1){
isMPR=1;
}
}
}
void updatemprselector(){ // When a node is not a MPR, it does not broadcast TC msgs. So, other nodes will not be aware of that
// node. Using this funcion allows nodes to know about the mprselector of MPRs.
for(i:int[1,N-1]){
if (msglocal.mpr[i]==1 && rt[i].hops!=1 && rt[i].hops!=2 && i!=ip){
rt[i].dip=i;
rt[i].hops=msglocal.hops+2;
rt[i].nhopip=msglocal.sip;
rt[i].dsn=rt[i].dsn;
}
}
}
/*void reset_rt_hello() { // assignes 0 to all variables in rt (shows expiration)
for(i:int[1,N-1]){
for(j:int[1,N-1]){
if (flag_reset[i]==1 && rt[j].nhopip==i){
rt[j].dip=0;
rt[j].hops=0;
rt[j].nhopip=0;
rt[j].dsn=0;
mprselector[i]=0;
flag_reset[i]=0;
}}
}
}
*/
void reset_rt(){
for(i:int[1,N-1]){
if (flag_reset[i]==1){
rt[i].dip=0;
rt[i].hops=0;
rt[i].nhopip=0;
// rt[i].dsn=0;
flag_reset[i]=0;
}
}
}
void reset_clock_two_hop(){
for(i:int[1,N-1]){
if (msglocal.onehop[i]==1 && i!=ip && rt[i].hops!=1 && rt[i].nhopip==msglocal.oip){
t_reset_rt[i]=0;
}}
}
void reset_clock_mprselectors(){
for(i:int[1,N-1]){
if (msglocal.mpr[i]==1 && i!=ip ){
t_reset_rt_topo[i]=0;
}
}
}
void reset_flag_sn(){
for(i:int[1,N-1]){
if (rt[i].dsn==M-1){
flag_sn=1;
}
}
}
Forward_PACKETsend_HELLOforward_TCQueueconst IP ipMSG msglocal[QLength]; //last local copies of incoming messages
void addmsg(MSG msg){
//if(nodebuffersize[ip]<=QLength-1){
msglocal[nodebuffersize[ip]]=msg;
nodebuffersize[ip]++;
}
//else{msg.msgtype=NONE;}
//}
void deletemsg(){
MSG empty_msg;
for(i: int[1,QLength-1]){
msglocal[i-1]=msglocal[i];
}
msglocal[QLength-1]=empty_msg;
nodebuffersize[ip]--;
}
MSGTYPE nextmsg(){
return msglocal[0].msgtype;
}
void create_add_packet(IP oip, IP dip){
MSG msg;
msg.msgtype= PACKET;
msg.oip=oip;
msg.dip=dip;
addmsg(msg);
}
// Place template instantiations here.
a1=OLSR(1);
a2=OLSR(2);
a3=OLSR(3);
a4=OLSR(4);
a5=OLSR(5);
//a6=OLSR(6);
//a7=OLSR(7);
a1q=Queue(1);
a2q=Queue(2);
a3q=Queue(3);
a4q=Queue(4);
a5q=Queue(5);
//a6q=Queue(6);
//a7q=Queue(7);
// List one or more processes to be composed into a system.
system
a1,a1q,
a2,a2q,
a3,a3q,
a4,a4q,
a5,a5q,
//a6,a6q,
//a7,a7q,
Tester;
//a1q,a2q,a3q,a4q, Tester < ,a2,a3,a4;
//Tester < a5,a5q < a4,a4q < a3, a3q < a2,a2q < a1,a1q;