Section 20.8. Exercises

20.8. Exercises

1.	Assume that the maximum line of sight for each node in the sensor network shown in Figure 20.9 is exactly 1 mile. The normalized maximum energy at each node is 20. Assume that 1 mile is scaled down to 1 inch on this map, measured between two centers of circles. Apply the cost function presented in Equation (20.15) for the best-energy path . Apply the cost function for the shortest path shown in the figure.
2.	Computer simulation project . Consider a field of 100 x 100 square meter, on which 50 sensor nodes are randomly distributed. Apply DEEP, and use a mathematical tool, such as Mathlab, to simulate the clustering process each at the size of five sensor nodes. Use randomly one of the four available levels of energy to each node. Sketch all clusters and the locations on cluster heads. Show on the same chart how cluster heads are connected to regular nodes.
3.	Computer simulation project . Continue the project from exercise 2, and now assume that an event is detected by a sensor at the closest cluster to one of the field's corners. Sketch the intercluster routing to a base station situated at the opposite corner from the event cluster.
4.	Computer simulation project . Continue the project from exercise 3, now using LEACH.