Random Generation of bi-directional Graphs in Omnet :: Khyber.ORG

پښتو :: پښتانه :: پښتونخواه :: پښتونوالی

Random Generation of bi-directional Graphs in Omnet, Omar Usman
Published in Khyber.ORG on Wednesday, July 4 2012 (http://www.khyber.org)


New Additions

[an error occurred while processing this directive]

From Archives

Flavours of Pashto Music , Dr. Raj Wali Shah Khattak


Pashtoon is a unique nation. The Pashtoons are a romantic people and extremely love music but don't like musicians. This seems very strange on their part . . . Read More


د امريکا د بیوګرافیو څېړنيز انستيتوت چې د امريکا په (North Caroline)ايالت کې موقعيت لري، د څېړنو پر بنسټ یې يو افغان ډاکټر د يوويشتمې پېړۍ غوره مفکر شخصيت ټاکلی دی او د نړيوال سفير لقب يې ور کړی. دغه افغان ډاکټر چې سيدنصيراحمد نومېږي . . . نور

دمور او پلار حقوق ، ليک: قارى هدايت الله ناصح

دابى امامه نه روايت دے چې يو سړى درسول الله صلى الله عليه وسلم نه تپوس وکړو چې دمور پلا حق څه دے په بچى باندې؟ نو رسول الله صلى الله عليه وسلم وفرمائيل . . . نور

Saving Kohistan's Forests , Rina Saeed Khan

An NGO has worked hard to raise awareness of- the value of forests in Kohistan. The 30,000 inhabitants of Palas are clear about one thing - they must protect their forests from outsiders and control grazing so that new trees can grow. . . . Read More



So what is Attan? In one word it is a dance. But this is the dance of the Pashtuns; a people who according to some have formed the largest tribal society in the world. Since the dance in some cases also serves as a form of tribal identity, the large number of tribes and sub tribes is reflected in diversity in the various forms of Attans in practice. . . . Read More


نبىاکرم(ص) اؤ اصحابو کرامو(رض) ددين په خورؤلو کښې چې څومره تکليفونه اؤ مشقتونه تير کړى دى د هغو تيرؤل خو يؤ خوا، د هغو اراده کؤل هم زمونږ پشان نالائقو ته ګرانه ده. د تاريخ کتابونه ددې واقعاتو نه ډک دى. په هغې عمل کؤل خو جدا خبره ده، . . . نور

Random Generation of bi-directional Graphs in Omnet

Omar Usman

Publishing Date: Wednesday, July 4 2012

The Omnet usman.html manual has code for generation of random topologies. The type of network generated can contain uni-directional, or bi-directional edges. Usually, people working with networks require generation of bi-directional graphs only. What you will see here is a small hack to the Omnet Engine, which can enable you to do that. (Note: I am not an expert on Omnet so most probably there is another simpler way of doing this. If you do, please leave a comment).

The files you need to modify are:

  1. src/sim/distrib.cc
  2. include/distrib.h
  3. src/sim/nedfunctions.cc

Modifications to distrib.cc

You need to create a new function (runiform). What this does is that it retains the random number generated from a previous call to uniform(). The random number is generated every 2-calls.

double runiform(int rng) {
static int r = 0;
static double l = 0;
if(r%2 == 0) l = uniform(0,1);
r++;
return l;
}

Modifications to distrib.h

Just one line to be modified here:

SIM_API double runiform(int rng=0);

Modifications to nedfunctions.cc

The current usman.html manual (July 4, 2012) shows a different way of doing this. The code in the manual is not consistent with what I found in the source (4.2.2). You need to add the following code to where the other continuous random variate generation code is present.

DEF(nedf_runiform,
"quantity runiform(int rng?)",
"random/continuous",
"Retains the value generated from a previous call to uniform()",
{
int rng = argc==2 ? (int)argv[1] : 0;
return cNEDValue(runiform(rng), argv[0].getUnit());
})

Compilation and Usage

If you have already compiled omnet once, you can simply run make and compile the engine again. When complete, fire up your editor and open your .NED file. You can now generate bi-directional graphs using the following code from the manual (which is adopted to this hack):

module RandomGraph {
parameters:
int count;
double connectedness; // 0.0 submodules:
node[count]: Node {
gates:
in[count];
out[count];
}
connections allowunconnected:
for i=0..count-1, for j=0..count-1 {
node[i].out[j] --> node[j].in[i]
if i<j && runiform() > connectedness;
node[j].out[i] --> node[i].in[j]
if i<j && runiform() > connectedness;
}
}

Comments powered by Disqus

Random Generation of bi-directional Graphs in Omnet, Omar Usman
Published in Khyber.ORG on Wednesday, July 4 2012 (http://www.khyber.org)