|| S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proceeding of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, 1999, pp. 151-162.|
 D. Kim and N. F. Maxemchuk, “A comparison of flooding and random routing in mobile ad hoc network,” in Proceeding of Third New York Metro Area Networking Workshop, 2003.
 B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in Proceeding of IEEE International Conference on Communications, 1997, pp. 376-380.
 A. Durresi, V. Paruchuri, R. Kannan, S.S. Iyengar, “Optimized Broadcast Protocol for Sensor Networks,“ IEEE Transactions on Computers, Vol. 54, 2005, pp. 1013 – 1024.
 V. Paruchuri, Arjan Durresi, Durga S. Dash, Raj Jain, “Optimal Flooding Protocol for Routing in Ad-Hoc Networks,” Technical report, Ohio State University, CS Department, 2002.
 W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” in Proceeding of the 1st ACM international symposium on Mobile ad hoc networking & computing, 2000, pp. 129 - 130.
 B. Williams and T. Camp, “Comparison of broadcasting techniques for mobile ad hoc networks,” in Proceeding of the 3rd ACM international symposium on Mobile ad hoc networking & computing, 2002, pp. 194-205.
 M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman San Francisco, 1979.
 M. V. Marathe, H. Breu, H. B. Iii, S. S. Ravi, and D. J. Rosenkrantz, “Simple heuristics for unit disk graphs,” Networks, Vol. 25, pp. 59-68, 1995.
S. Guha, “Approximation algorithms for connected dominating sets,” Algorithmica, vol. 20, Issue 4, pp. 374-387, Apr. 1998.
 J. Wu and H. Li, “On calculating connected dominating set for efficient routing in ad hoc wireless networks,” in Proceeding of the 3rd international Workshop on Discrete Algorithms and Methods For Mobile Computing and Communications, 1999, pp. 7-14.
 F. Dai and J. Wu, “Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning,” IEEE Trans. Parallel and Distributed Systems, vol. 15, 2004, pp. 1027-1040.
 J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” in Proceeding of IEEE INFOCOM, 2003, pp. 2240-2250.
 K. S. Prabh and T. Abdelzaher. “On scheduling and real-time capacity of hexagonal wireless sensor networks,” in Proceeding of the 19th Euromicro Conference on Re-al-Time Systems, 2007, pp. 136-145.
 K.S. Prabh, C. Deshmukh, and S. Sachan, “A distributed algorithm for hexagonal topology formation in wireless sensor networks,” in Proceedings of the IEEE Conference on Emerging Technologies & Factory Automation, 2009, pp.1-7.
 Arjan Duresi and Vamsi Paruchuri, “Adaptive backbone protocol for heterogeneous wireless networks,” Journal of Telecommunication Systems, Special Issue – Advances in Modeling and Evaluation of Communication Systems, vol. 38, 2008, pp. 83-97.
 Vamsi Paruchuri, Arjan Durresi, “Broadcast Protocol for Energy-Constrained Net-works,” IEEE Transaction on Broadcasting, Vol. 53, 2007, pp. 112-119.
 D. G. Zill, S. Wright, and W. S. Wright, Calculus: Early Transcendentals, Jones & Bartlett Learning, Massachusetts, 2009.
 R. Kershner, “The number of circles covering a set,” American Journal of Mathematics, vol. 61, 1939, pp. 665-671.
 Vamsi Paruchuri, “Adaptive scalable protocols for heterogeneous wireless networks,” PhD dissertation, Louisiana State University, 2006.
 Matlab, The MathWorks, Inc., http://www.mathworks.com.
 The network simulator ns-2. http://www.isi.edu/nsnam/ns/
 O. Younis and S. Fahmy, “HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Transactions on Mobile Computing, vol. 4, 2004, pp. 366-379.
 S. M. N. Alam and J. H. Zygmunt, “Coverage and connectivity in three-dimensional networks,” in Proceeding of Mobicom 2006. Los Angeles, CA, 2006.
 J. Carle, J.F. Myoupo, and D. Seme, “A Basis for 3-D Cellular Networks,” in Proceeding of the 15th International Conference on Information Networking, 2001.
 C. Decayeux and D. Seme, “A new model for 3D cellular mobile networks,” Workshop on Parallel and Distributed Computing, Third International Symposium on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, 2004.
 A. Durresi, V. Paruchuri, L. Barolli, and R. Jain, “Air to air communication protocol,” IEEE Aerospace Conference, 2006.
 K. Hatzis, G. Pentaris, P. Spirakis, B. Tampakas, and R. Tan, “Fundamental distributed protocols in mobile networks”, chapter in Principle of Distributed Computing, 1999.
 W. Heinzelman, A. Chandrakasan, H. Balakrishnan, and C. MIT, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, pp. 660-670, 2002.
 V. Paruchuri, A. Durresi, L. Barolli, and M. Takizawa, “Three Dimensional Broadcast Protocol for Wireless Networks,” in Proceeding of International Conference on Parallel Processing, 2007.
 M. K. Watfa and S. Commuri, “Optimal 3-dimensional sensor deployment strategy,” in Proceedings of IEEE Consumer Communications and Networking Conference, 2006.
 Eric W. Weisstein, “Sphere-Sphere Intersection,” from MathWorld -- A Wolfram Web Resource. http://mathworld.wolfram.com/Sphere-SphereIntersection.html
 Aristotle. On the Heaven, Vol. 3, Chapter 8, 350 BC.
 Hilbert D, Cohn-Vossen S. Geometry and the Imagination. Chelsea: New York, 1999.
 M. Krizek “Super convergence phenomena on three-dimensional meshes.” International Journal of Numerical Analysis and Modeling 2005; 2(1): 43–56.
 X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, “Deploying wireless sensors to achieve both coverage and connectivity,” in Proc. ACM MobiHoc, 2006, pp. 131–142.
 Z. Yun, X. Bai, D. Xuan, T-H Lai and W. Jia, “Optimal Deployment Patterns for Full Coverage and k-Connectivity (k<=6) Wireless Sensor Networks,” IEEE/ACM Transactions on Networking, Vol 18, No. 3, June 2010, pp. 934-947.
 S.Kumar, T.H. Lai, and J. Balogh, “On k-coverage in a mostly sleeping sensor network,” in Proceeding of ACM MobiCom, 2004, pp. 144–158.
 S. Kumar, T. H. Lai, and A. Arora, “Barrier coverage with wireless sensors,” in Proceeding of ACM MobiCom, 2005, pp. 284–298.
 R. Iyengar, K. Kar, and S. Banerjee, “Low-coordination topologies for redundancy in sensor networks,” in Proceeding of ACM MobiHoc, 2005, pp. 332–342.