mobile advanced networks spring 2010 lab session mobile communication department eurecom 1©navid...

Mobile Advanced NetworksSpring 2010

Lab Session

Mobile Communication DepartmentEurecom

1©Navid Nikaein 2010

Key points of this lab session• Simulation of topology control (TC) algorithms for

wireless sensor networks• A network simulator will be presented• You will be required to implement a TC for

wireless sensor networks • You may organize yourselves in groups of at most

3 students• You will need to provide a report of at least two

pages comparing the three TC control algorithms– Kneighbour, fixed range and the one you will

implement

©Navid Nikaein 2010 2

Fast review: Wireless sensor networks and Topology Control


Wireless Sensor Networks


Wireless Sensor Networks• No infrastructure• Multi-hop topology• Nodes communicate via wireless radio interface• Nodes have finite energy resources• Applications generate low-rate data traffic• Main aim

– prolong life span of Sensor Networks• How ?

– propose solutions that increases the capacity and promote energy conservation

• Topology Control and Clustering


Wireless Sensor Networks


WSNs Challenges • High density and Large number of nodes • Low computational power

– Current mote processors run at < 10 MIPS– 4 KB of memory not enough to store significant data

• Poor communication bandwidth– Current radios achieve about 10 Kbps per mote

• Limited energy budget– 2 AA motes provide about 2850 mAh– Coin-cell Li-Ion batteries provide around 800 mAh– Solar cells can generate around 5 mA/cm2 in direct sunlight– Must use low duty cycle operation to extend lifetime beyond a

few days


Topology Control


Recall of Topology Control Algorithm

• Wireless sensor networks can NOT be regarded as a reliable communication system when it may partition

• Dilemma of adjusting the transmission power of individual nodes– Lowering the transmission power to increase the

capacity (throughput) due to larger spatial reuse– Increase the transmission power to avoid

network partitioning


Topology Control Strategies• Max-degree topology:

– Adjust the number of links (neighbors) for each node in a range of [k min, k max]

– If more that k max , then reduce the P tx

– If less than k min, then raise the P tx

• K-Nearest-neighbor-topology:– Connect to at least k nearest neighbors – There is an edge iff one of the nodes to other k-nearest

neighbor• Number of neighbors could be larger that K

• Fixed Range:– Connect to all in the range


Connectivity Graph


WCDS

Nearest Neighbor (k=4)

Fixed Range (r=75)

Other Results and Experimentations


TC Pedestrians

Avg. Degree

Pedestrians + VehicularAvg. Degree

Pedestrians

%Disconnected

Pedestrians + Vehicular%Disconnected

Pedestrians

Avg. Path Size

Pedestrians + VehicularAvg. Path Size

Pedestrians

Max. Path Size

Pedestrians + VehicularMax. Path Size

Fixed Range 100m

75.14 82.14 0.20 0.22 1.12 1.13 2.88 2.94

IDS – 1 Relay 2.90 3.38 10.22 19.25 2.23 2.13 4.18 3.97

Nearest-neighbor 3

3.25 2.29 6.78 48.03 5.32 4.4 10.51 8.85

Nearest-neighbor 4

4.27 3.01 2.03 37.62 4.16 3.86 7.91 7.56

Nearest-neighbor 6

6.09 4.66 0.41 20.77 3.23 3.36 6.13 6.43

Nearest-neighbor 8

7.97 6.49 0.22 8.64 3.08 1.12 5.33 5.89

Nearest-neighbor 10

9.74 8.21 0.21 3.84 2.89 1.13 2.88 2.94

Java programming over eclipse


Java and eclipse

• Objected oriented language• An infinity of documentation, examples, tutorials,

libraries, etc…

• The simulator is built in Java• Eclipse is one IDE to program

– Independent of Java– Free and open source


To Start• Get the simulator from:

– /homes/camara/htdocs/files/madvnet or– http://www.eurecom.fr/~camara/files/madvnet/

• Unzip it in a directory– Normally ~/workspace/sinalgo-0.75.3_AdvancedNet

• Open Eclipse– File>New>Project>Java Project– Set Project name as

“sinalgo-0.75.3_AdvancedNet”– You can finish the project


Java Programming (1)

• The basic unit are classes• The instantiation of a class

is called object• Packages are used to

organize the classes– In java it is represented into

distinct directories


package transport.enginepowered;public class car { protected Color color ; private int nDors; public car (Color color, int dors){ this.color = color; this. nDors = nDors; }

Color getColor() { return speed; }

int getNDors() { return nDors; }}

Java Programming (2)• Public methods/variables may be

accessed from any other class• Private, protected and package

not– Package: any class from the same

package has access– Private: is specific of the class, but

the subclasses, children, have access

– Protected: not even the subclass classes may access

• Inheritance is an important concept, enables reuse


package transport.enginepowered;public class Pickup extends car { private int capacity; public car (Color color, int capacity){ super(color, 2); this.color = color; this. nDors = nDors; }

int getCapacity() { return nDors; }}

Sinalgo – Network Simulator


Sinalgo – Network Simulator

• Developed by the Distributed Computing Group of ETH Zurich

• Main Characteristics– Developed to validate network and higher layers protocols– Easy to learn– Dispose of a series of useful examples– Java

• Easy to program and extend– Intuitive graphical interface

• 2D and 3D visualization – May be used in batch


Simulator overview

• Discreate simulator, based on rounds– The events are discrete and sinchronous

• Models, such as mobility, distribution and transmission are applied to the Nodes

• Timers are in charge of activate the nodes in specific periods of time– The timers must be created and scheduled

• Nodes send and receive messages, activated by timers or messages reception

Models Timers

Nodes

Messages

Applied

Applied

Activate

Send/receive

Mobile Advanced Networks project• We implemented a new project, advancednet, to help in the

implementation of topology control algorithms


Advanced Networks project

• Two topology control methods are implemented as a title of example– Nearest k neighbor– Fixed range

• To implement a new algorithm– Extend BasicNode– If a new message is required, one should extend

Basic Message


Nearest Neighbor (k=4)

Fixed Range (r=75)

Main components

• For each one of the modules one can use the already implemented classes, extend the existing ones or create a completely new class– Models: define the behavior of the node regarding: mobility, distribution,

connectivity... – Node: define the behavior of the node itself. E.g., what it should do

when receive a message of a defined type– Messages: transference of data from one node to the other, respecting

the connectivity model– Timer: trigered at a defined time to perform a specific task. E.g., send a

hello message

Models Timers

Nodes

Messages

Applied

Applied

Activate

Send/receive

daniel

see later

Step by step example (1)

• Runing the project– Open eclipse– Run class sinalgo.Run– Select the advancednet

project– Change the config

if you need to• Save config

– Press OK

Step by step example (2)• Add nodes

– Select the nodes characteristics– Number of Nodes: The number

of nodes of this kind will be present

– Distribution: The way nodes will be spread over the area

– Node Implementation: Which node will be used

– Connectivity Model: The kind of interface will be used

– Interference Model: The characteristic of the medium

– Mobility Model: How the nodes will move around

– Reliability Model: How trustful the communication is

• Press OK



• The nodes will be spread over the area with their initial state

• Run– You may choose to

run the simulation for a specific number of steps or “run forever”

• Stop


Step by step example (4)• Classes

– projects.advancednet.nodes.nodeImplementations.BasicNode• Basic node operations: drawing, power control, basic message control

– projects.advancednet.nodes.nodeImplementations. MobileNodeNearestNeighbour

• Exteds the BasicNode class to perform the k- nearest neighbor topology control

– projects.advancednet.nodes.timers.ConnectionTimerNearesNeighbour

• Controls the periodical hello message required by the protocol

– projects.advancednet.nodes.messages.BasicMessage

• Basic message data, if you create a new message you should extend this class



• MobileNodeNearestNeighbour– public void init() : called just once to initialize the

node– public void preStep() : called for initializations before

a round– public void postStep() : called after a round– public void handleInputMessages(Inbox inbox) :

Called every time the node receives a message• The received messages are stored in the inbox• The reception of each kind of message should receive a

specific treatment


Specific configuration entries• <GeometricNodeCollection rMax="250"/>• <UDG rMax="250"/>• <MessageTransmission ConstantTime="1"/>• <Node defaultSize="10"/>

• <Connection>• <StartIntervall distribution="Uniform" min="1" max="5"/>• <RefreshRate value="5"/> • <Size value="15"/> • </Connection>

• <MobileNode> • <Size value="4"/>• <SlowEntrance value="false"/> • <enableLog value="true"/> • <drawRange value="false"/> • </MobileNode>

• <LossyDelivery DropRate="0.01"/> • <StopWhenNoChange value="false"/> • <GennerateMap value="false"/> 

• <Kneighbourhood k="3"/> 

• <RandomDirection> • <NodeSpeed distribution="Gaussian" mean="2" variance="4" />• <WaitingTime distribution="Poisson" lambda="10" />• <MoveTime distribution="Uniform" min="5" max="20" />• </RandomDirection>

• <Presentation delayPresentation="false" delayTimeMS="200"/> 

• <Energy> • <ControlEnergy value="true"/> • <Random value="true" />• <DecrementTx value ="0.02" /> • <DecrementRx value="0.01" /> • <Max value="100" /> • <Min value="10"/> • </Energy>•

Running the simulations and evaluating the results

• runExperiments.sh– Shell script to run the experiments in batch– It is prepared to run for the k-Neighbour algorithm

• For the report you should change/add your own implementation• LogAnalysis.sh

– Gets the results of the log directory, compile, threats and generate gnuplot programs

– The logs will be generated in “logs/advancedNet”• If you need any modification you should change

projects.advancednet.LogAnalysis class• To generate the images

– cd logs/advancedNet– chmod 755 generatePlots.sh– ./generatePlots.sh


Log file • A condensed log is generated by

projects.advancednet.CustomGlobal• Format

• projects.advancednet.LogAnalysis– Grabs the logs, from the specified directory and generates the

data files and gnuplot programs• If you want to grab more information or analyze your own If you want to grab more information or analyze your own

algorithm these files should be modified accordinglyalgorithm these files should be modified accordingly©Navid Nikaein 2010 31

DumpNetworkEndStatus;100;200.0;6390;true;18600;406741;2;2;92;6.804347826086956;4.14;6.235;5.745;11.54;0.69;-0.0199999999995982732;1;3;92;6.108695652173913;2.795;6.94;5.425;10.075;0.0;9.4800000000002883;1;3;92;6.032608695652174;2.835;6.235;6.44;12.175;0.0;1.7200000000004034;1;3;92;7.619565217391305;2.975;6.94;7.2;12.045;0.095;6.58000000000035

DumpNetworkEndStatus; #nodes; #rounds;realtime;used fixed seed; seed;# of sent messagesnodeId;state;connectedNodes;pathSize;nodeDegree;pathSize;maxPath;oneConnections;remainingEnergy

Available primitives for new TC implementations

• double energy =getEnergy();– Returns the available energy at the node

• Position p = getPosition();– Returns the present position of the node

• setRange(double range);– Sets a new communication range, if using the

VariableRange connectivity model• send(Message m, Node target);

– Sends a message to a defined node, if the connectivity model allows it, I.e. if it is in the range

• broadcast(Message m);– Sends a message to all the nodes in the region


Sinalgo – Step by step exampleFixed Range implementation


More information

• Eclipse tutorial– http://eclipsetutorial.sourceforge.net/workbench.html

• Java tutorial– http://java.sun.com/docs/books/tutorial/

• Sinalgo tutorial– http://disco.ethz.ch/projects/sinalgo/tutorial/tuti.html

• Bash scripting– http://www.linuxconfig.org/Bash_scripting_Tutorial

• Gnuplot– http://www.linuxconfig.org/Bash_scripting_Tutorial


mobile advanced networks spring 2010 lab session mobile communication department eurecom 1©navid...

Documents

range navid nikaein

clustering navid nikaein

experimentationsnavid

daysnavid nikaein

implementnavid nikaein

topology controlnavid

kfixed range

wireless radio interfacenodes