Routing & Middleware:Experiments

Eleonora Borgia, Franca Delmastro, and Luciana Pelusi

Pervasive Computing & Networking Lab. (PerLab)

IIT-CNR Pisa

Current works and results

Ad Hoc Framework (HUT) OLSR AODV (waiting for v.0.8)

Data transfer application on OLSR

FreePastry on OLSR Distributed Messaging service

Up

Indoor scenario

Lifts

Offices

Technical characteristics: 5 IBM laptops Wireless cards:

D-Link Air DWL-650 Linux kernel 2.6.3

Network topology: 5 nodes Max distance =

3 hops

OLSR open issues... Cost updates?? (non-sense values in some cases) Each node has a kernel route towards itself with

cost >= 1 The IP_mainAddress has to be set to one of the

active interfaces There is not check if Originator_Address =

IP_mainAddress Too large time values for topology changes

notification (more than 60 sec) Correct data collection of topology changes from

OLSR Problems with OLSR and CCRS interactions Problems with CCRS and kernel RT interactions

Up

First exp: OLSR – 4 nodes

Lifts

Offices

A, B start at t=0 C start at t=30 s D start at t=60 s B stop at t=90 s Finish time t=150 s

AB

C

D

CCRS updating problems: A has no route towards D

(also before B stopping) D does not realize that B

disappears, even at the end.

Up

Second exp: OLSR – 4 nodes

Lifts

Offices

A, B start at t=0 C start at t=30 s D start at t=60 s C stop at t=90 s Finish time t=150 s

A B

C

D

Up

Second exp: problems

Lifts

OfficesA B

C

D

D kernel routing table before C stopping

If D A is unidirectional, why it’s added to kernel RT??

If it is not, why D doesn’t update B route with the new one with minimum cost??

Only after C stopping, D updates B route with (D - A - B) !

Why D-C-A-B and not D-C-B ??? (D receives C neighbors included B)

C - 0

B C 2

A C 1

A - 0

Up

Third exp: 5 nodes

Lifts

Offices

A, B, C start at t=0 D start at t=30 s E start at t=60 s C stop at t=120 s Finish time t=180 s

A B

C

D

E

CCRS updating problems: B has no route towards D D has no route towards E E has no route towards D

Applications on OLSR

Data transfer application between 2 nodes on 3 nodes network (client-server protocol realized in C) problems

establishing multi-hop.... Application problem FreePastry Distributed Messaging application

realized in Java First of all we have to resolve our problems with

multihop!!! Then at least 5 nodes providing the service and the

routing are needed to analyze middleware multi-hop