hello I want build a function that calculate the neighbours node for each node ...of course I genrete a node randomly with 3 dimensions

hello I want build a function that calculate the neighbours node for each node ...of course I genrete a node randomly with 3 dimensions

[Geoff Hayes]

Maha - how will you be determining if a node is a neighbour or not? What algorithm are you using?

[maha ismail]

Geoff - i need to know the neibours node for each node>>> the algorithim that i used is standard gossip algorthim

and i need another thin>>i want to all the neighbours for each node and find the nearest one in 2-dimention the alogrithim now is geograghic gossip

[Geoff Hayes]

Have you implemented the gossip algorithm in MATLAB?

[maha ismail]

yes I try to implement gossip algorithms in matlab...

[maha ismail]

i need both standard gossip and geographic gossip algorithms but I dont have the implementation of them in matlab..I just try to implement it by myself but I couldn't

[Geoff Hayes]

Why didn't it work? Please indicate what problems you were experiencing with the code that you wrote. Attach the m file to your question (or comment) using the paperclip button.

[maha ismail]

it didn't work because I can't write it correctly or I have few information in matlab programming. .

[maha ismail]

the alogrithim is for 5 random node each nod hae intial value. each node have neighbours but at each time one node comminicate with randomaly neighbour node

[maha ismail]

the pairs cacluate the averaging of themselves and save it as new value x=[1 2 3 4 5] as intial value for 5 node> at each comminication x(t+1)=w(t)*x(t) where w(t) amatrix with ones diagnol and 0.5 in (i,i) (j,j) (i,j) (j,i) where i is the node and j is a randomaly neighbours for i

[maha ismail]

this the my false code