Bibliography

[1] S. Saroiu, P. Gummadi, and S. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," in Proceedings of Multimedia Computing and Networking (MMCN), 2002.

[2] F. Buckley and M. Lewinter, A Friendly Introduction to Graph Theory, 2002.

[3] X. Liu, L. Xiao, A. Kreling, and Y. Liu, "Optimizing Overlay Topology by Reducing Cut Vertices," in Proceedings of ACM NOSSDAV, 2006.

[4] B. Awerbuch, "A New Distributed Depth-First Search Algorithm," Information Processing Letters, vol. 20, pp. 147-150, 1985.

[5]. Andrew Kreling, Yunhao Liu, Xiaomei Liu, Li Xiao. “Optimizing overlay topology by reducing cut vertices.” NOSSDAV, 17, 2006.

[6]. O. Younis, S. Fahmy, and P. Santi, "An architecture for robust sensor network communications," International Journal on Distributed Sensor Networks (IJDSN), Special issue on localized communication and topology protocols for sensor networks, 2005.

[7] W. Zhang, G. Xue, and S. Misra, "Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms," in Proceedings of IEEE INFOCOM, 2007.

[8] T. Q. Qiu, E. Chan, and G. Chen, "Overlay Partition: Iterative Detection and Proactive Recovery," in Proceedings of IEEE ICC,2007.

[9] B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, "Sketchbased Change Detection: Methods, Evaluation, and Applications," in Proceedings of ACM SIGCOMM Internet Measurement Conference (IMC), 2003.

[10] S. Kim and A. L. N. Reddy, "Image-based Anomlay Detection Technique: Algorithm, Implementation and Effectiveness"," IEEE JSAC, 2006.

[11] N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, and J. Wang, "Locating Internet Bottlenecks: Algorithms, Measurements, and Implications," in Proceedings of ACM SIGCOMM, 2004.

[12] D. Dumitriu, E. Knightly, I. Stoica, and W. Zwaenepoel, "Denial of Service Resilience in Peer-to-Peer File Sharing Systems," in Proceedings of ACM SIGMETRICS, 2005.

[13] Carlos, Andre, Reis Pinheiro, “Social Network Analysis in Telecommunications.” John Wiley and Sons, 2011.

[14] Rosales-Hain, R. Ramanathan, “Topology control of multihop wireless networks using transmit power adjustment”. INFOCOM, 2:404 – 413, 2000.

[15] Y. Zhu and Y. Hu, "Making Peer-to-Peer Anonymous Routing Resilient to Failures," in Proceedings of IPDPS, 2007.

[16] T. Q. Qiu, E. Chan, and G. Chen, "Overlay Partition: Iterative Detection and Proactive Recovery," in Proceedings of IEEE ICC, 2007.

[17] J. Mirkovic, G. Prier, and P. Reiher, "Attacking DDoS at the Source," in Proceedings of IEEE ICNP, 2002.

[18] P. Keyani, B. Larson, and M. Senthil, "Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems," in Proceedings of IFIP Workshop on Peer-to-Peer Computing, 2002.

[19] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-like P2P Systems Scalable," in Proceedings of ACM SIGCOMM, 2003.

[20] Yunhao Liu, Baijian Yang, Yuan He, Hao Ren. “On The Reliability of Large-scale Distributed systems - A Topological View.” computer Networks, 53:2140–2152, 2009.

[21] M. Li, W.-C. Lee, and A. Sivasubramaniam, "DPTree: A Balanced Tree Based Indexing Framework For Peer-To-Peer Systems," in Proceedings of IEEE ICNP, 2006.

[22] L. Ramaswamy, B. Gedik, and L. Liu, "A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks," IEEE Transactions on Parallel and Distributed Systems, 2005.

[23]. Nicholas D. Lane, Emiliano Miluzzo, “A Survey of Mobile Phone Sensing,” A Survey of Mobile Phone Sensing 2009

[24]. R. Tarjan, “Depth First Search and Linear Graph Algorithms,” SIAM J. Comp., vol. 1, no. 2, 1972, pp. 146–60.

[25]. D. Goyal and J. Caffery, “Partitioning Avoidance in Mobile Ad Hoc Net-works using Network Survivability Concepts,” Proc. IEEE ISCC, Taormina, Italy, July 2002, pp. 553–58.

[26]. Tracy Camp*, Jeff Boleng, and Vanessa Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing, Volume 2, Issue 5, pages 483–502,August 2002.

[27]. Mathew D. Penrose, “On k-connectivity for a geometric random graph,” Random Structures & Algorithms, Volume 15, Issue 2, pages 145–164,September 1999.

[28].Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan, Chih-Wei Yi, “Power Assignment for k-Connectivity in Wireless Ad Hoc Networks,” Journal of Combinatorial Optimization, March 2005, Volume 9, Issue 2, pp 213-222.

[29]. Suresh Singh, Mike Woo, C. S. Raghavendra, “Power-aware routing in mobile ad hoc networks,” MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking Pages 181-190

[30]. S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, “Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol,” in European Wireless Conference, 2002.

[31]. Penrose, M, “The longest edge of the random minimal spanning tree,” Annals Appl. Probab. 7, 2, 340–361, 1997.

[32]. Penrose, M, “Extremes for the minimal spanning tree on normally distributed points,” Advances Appl. Probab. 30, 628–639, 1998.

[33]. Dette, H. and Henze, N, “The limit distribution of the largest nearest-neighbor link in the unit d-cube,” J. Appl. Probab. 26, 67–80, 1989.

[34]. Holst, L, “On multiple covering of a circle with random arcs,” J. Appl. Probab. 16, 284–290.1980

[35]. Panchapakesan, P. and Manjunath, D, “On the transmission range in dense ad hoc radio networks,” InProceedings of IEEE Signal Processing Communication (SPCOM), 2001.

[36]. Santi, P., Blough, D., and Vainstein, F, “A probabilistic analysis for the range assignment problem in ad hoc networks,” in Proceedings of ACM Mobihoc. 212–220, 2001.

[37]. Kirousis, L., Kranakis, E., Krizanc, D., and Pelc, “Power consumption in packet radio networks,” Theoret. Comput. Sci. 243, 289–305.2000

[38].Clememti, A., Ferreira, A., Penna, P., Perennes, S.,and Sielvestri, R, “Hardness results for the power range assignment problem in packet radio networks,” in Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX). 197–208, 1999.

[39]. Clememti, A., Ferreira, A., Penna, P., Perennes, S.,and Sielvestri, R, “The power range assignment problem in radio networks on the plane,” in Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science (STACS). 651–660.2001

[40]. Clememti, A., Ferreira, A., Penna, P., Perennes, S.,and Sielvestri, R, “The minimum range assignment problem on linear radio networks,” in Proceedings of the 8th European Symposium on Algorithms (ESA). 143–154. 2000

[41]. Rodoplu, V. and Meng, T, “Minimum energy mobile wireless networks,” IEEE J. Select. Areas Comm. 17, 8, 1333–1344, 1999