<< NARVAL_R_AggregationWCDS NARVAL NARVAL_R_AodvNextHop >>

NARVAL >> NARVAL > NARVAL_R_AodvHello

NARVAL_R_AodvHello

Track the neighborhood of a node inside a graph.

Calling Sequence

[n] = NARVAL_R_AodvHello(x,g)

Parameters

x :

node index.

g :

network graph.

n :

list of neighbors.

Description

NARVAL_R_AodvHello tracks the neighborhood n of the node x inside the network graph g such as broadcasting HELLO messages at set intervals in communication networks (WEB). The graph links are assumed to be generated in respect with the radio communication range of each node. If you need to consider a link failure, the easiest solution is to update the network topology by removing the selected links.

Examples

name='network';//definition of the graph
node_number=5;//size
tail=[2 3 3 4 5 5];//tail vector (links)
head=[1 1 2 2 2 4];//head vector (links)
node_x=[100 500 300 700 900];//x-coordinates of nodes
node_y=[500 500 900 100 500];//y-coordinates of nodes
[g]=NARVAL_G_MakeGraph(name,node_number,tail,head,node_x,node_y);//generation of a topology with 3 nodes
w=1;//window index
f1=NARVAL_G_ShowNodesIndex(g,w);//graph visualization
x=2;//node index
[neigh]=NARVAL_R_AODV_Hello(x,g);//application of NARVAL_R_AODV_Hello 
neigh

Dependency

NARVAL_G_NodeNeighbors

Authors

Foued Melakessou

Contact

Dr. Foued Melakessou

Research Associate

Interdisciplinary Centre for Security, Reliability and Trust

Room F106

University of Luxembourg

6, rue Coudenhove Kalergi

L-1359 Luxembourg-Kirchberg

E-mail: foued.melakessou@uni.lu

Tel: (+352) 46 66 44 5346

Home Page


<< NARVAL_R_AggregationWCDS NARVAL NARVAL_R_AodvNextHop >>