Check course web page homework section for more information, especially regarding paper reviews and cover sheet.

Problems: The numbered exercises are from the textbook. Do your best to give rigorous proofs of all the results.

• Exercise 2.8
• Exercise 2.12
• Exercise 3.3.
• Exercise 3.5.
• Exercise 3.10, parts (1) and (2).

Paper Reviews:

1. R. Guerin, J. Rank, S. Sarkar and E. Vergetis, "Forming Connected Topologies in Bluetooth Adhoc Networks." In Proceedings of ITC'18, Berlin, September 2003. Available at http://www.seas.upenn.edu/~guerin/
2. Y. Moses and B. Shimony, "A New Proof of the GHS Minimum Spanning Tree Algorithm." Proceedings of the International Symposium on Distributed Computing, 2006. Published by Spring in Lecture Notes in Computer Science, vol. 4167. Available at http://www.springerlink.com/content/?k=lncs+4167 if you are behind the TAMU firewall.
3. Azzedine Boukerche and Kaouther Abrougui, An efficient leader election protocol for mobile networks, IWCMC '06: Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing, pp. 1129-1134, 2006. Available at http://portal.acm.org/citation.cfm?id=1143775 if you are behind the TAMU firewall.