1. Efficient distribution of An infrastructure Cluster network under constraints Ben Gurion University, Communication System Engineering Department, Faculty of Engineering 2006 Presenting: Daniel Goldenstein Ohad Harel Supervisors: Dr. Michael Segal Mr. Amit Dvir

2. US Army to Deploy RFID “Listening Rocks” (Washington Times, May 27th, 2005) The Soldier’s perspective The devices are no larger than a golf ball Use of tiny silicon chips and radio frequency identification (RFID) So sensitive that it can detect the sound of a human footfall at 20ft to 30ft The Network Engineer’s perspective The “rocks” form an ad-hoc network. The main concern is how to choose the ‘best’ sites to set up certain facilities to serve the other sites.

3. Problem Definition A center of a graph is a vertex C such that the maximum distance from C to any other vertex is minimized. A median of a graph is a vertex M such that the maximum sum of distances from M to all other vertices is minimized. The tradeoff is between response speed (Center) and total communication cost (Median), and it is handeled in Centdian tree, which is a combination of the two. K and L parameters represent the tree’s diameter and number of leaves in the path.

4. The Project’s Flow Study of the existing algorithms which offer a solution to the problem Simulating the algorithms, one for each approach, using OMNET++ simulator and C++ programming language Gathering statistics, derived from the simulations

5. Simulating Tree Center algorithm in an ad-hoc network (K=3, L=8)

6. Statistics gathered from the tree center simulation The total Path Weight is 581 The total Distance from the path is 1026 The Farthest Leaf from the path is 15 and it's distance is 161 The Diameter of the path is 400

7. Simulating Tree Core algorithm in an ad-hoc network (K=3, L=8)

8. The total Path Weight is 409 The total Distance from the path is 560 The Farthest Leaf from the path is 21 and it's distance is 102 The Diameter is 270 Statistics gathered from the tree core simulation

9. Simulating Tree Centdian algorithm in an ad-hoc network (K=3, L=8, λ = 0.25)

10. The total Path Weight is 561 The total Distance from the path is 770 The Farthest Leaf from the path is 9 and it's distance is 181 The Diameter is 377 Statistics gathered from the tree centdian simulation

11. Open Cluster Ad-Hoc Network Issues Maintaining the selected path according to ad-hoc changes – a node’s failure, a node’s movement, etc. Finding trees under the constraint of Multicast leaves Finding trees under the constraint of the Cluster’s weight