[Nettopo] 答复: Nettopo Programming interface to simulate Minimum Spanning Tree NNT algorithm

[Shu, Lei]

Dear Vimal,

Sorry for the late response, I didn't check this email box for about 2 weeks.

For using NetTopo, you need to download the source code directly from Sourceforge CVS,
and run NetTopo directly in Eclipse.

If you have further question, please kindly post in the NetTopo at list.deri.org. : -)

Best regards,

Lei Shu

-----Original Message-----
From: Vimal R [mailto:hiraj01 at live.com]
Sent: 2010-7-28 (星期三) 9:29
To: Shu, Lei
Subject: Nettopo Programming interface to simulate Minimum Spanning Tree NNT algorithm
 



-----Original Message-----
From: Vimal R [mailto:hiraj01 at live.com]
Sent: 2010-7-28 (星期三) 9:29
To: Shu, Lei
Subject: Nettopo Programming interface to simulate Minimum Spanning Tree NNT algorithm
 


Hello There,

I am actually doing a research project. I just need to implement my logic in java programming.
I have visited your website and downloaded the program. 

I should be grateful if you could analysize my problem and help me in development of the simulation using java,
or even simulate the algorithm using NeTtopo.

When i double click on NetTopo.jar(executable file), it does not open,even though j3d is installed. Please do guide how to run Nettopo in windows vista.
 
Documents attached:
1.Introduction to Wireless Sensor networks with my proposal.
2.Mathemetical Foundation and logic of nearest neighbour tree to build the MST to implement in codes using a programming language.(with algorithm)
Adobe reader required to view documents above.

Message body

Problem to code.: Date Structure for the node.+ the energy model from sender node to receiver.

(i)build Grid(WSN Field)
with a particular dimension.

(ii)Randomize
the nodes(50 nodes-100nodes) placement in the field.

(iii)Follow the
logic in the attachment(Mathematical Foundation of MST-NNT Algorithm).pdf

(iv)Distance
between nodes.(Maintain in table list)

(v)Nearest
Neighbour Nodes with ID  in the Field.(Maintain in table list)

(vi)Broadcast Activity from the node with a
Specified radius,r.

(vii)Count the
Number of Nearest neighbour.

(vii)Nodes with
dead end to be maintained in the list.

(ix)Find the
best path(From source to destination) from the given nodes based on energy
consumed by the nodes.

Remember each
node uses energy to communicate, to
process(computing power) and no Cycle in the resulting graph.

Please review same and send me your comments.In Summary, i need to write a simulation program to Build an MST(Minimum Spanning tree using Degree NNT(Nearest Neighbour tree) algorithm)

Thank you

regardsvimal




 		 	   		  
Hotmail: Free, trusted and rich email service. Get it now. 		 	   		  
Hotmail: Free, trusted and rich email service. Get it now. 		 	   		  
Your E-mail and More On-the-Go. Get Windows Live Hotmail Free. Sign up now.