Expansion properties of (Secure) wireless networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 281-285

  Panconesi, Alessandro ^a   Radhakrishnan, Jaikumar ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Ad Hoc Networks; Connectivity; Distributed Algorithms; Expanders; Security; Wireless Networks

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; GRAPH THEORY; PROBABILITY; SECURITY OF DATA; WIRELESS TELECOMMUNICATION SYSTEMS;

CONNECTIVITY; DISTRIBUTED ALGORITHMS; WIRELESS NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 8344224439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007959     Document Type: Conference Paper

References (16)

1. S. Asmussen and H. Hering, Branching Processes, Birkhäuser, Boston, 1983.
2. S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee and S. Khuller, Construction of an efficient overlay multicast infrastructure for real-time applications, Proceedings of Infocom 2003
3. R. Di Pietro, A. Mei, A. Panconesi and J. Radhakrishnan, Connectivity properties of secure wireless networks. Manuscript.
4. D. Dubhashi, O. Häggström and A. Panconesi, Connectivity properties of Bluetooth wireless networks. Manuscript, available at www.dsi.uniroma1.it/ale
5. Laurent Eschenauer and Virgil D. Gligor, A key-management scheme for distributed sensor networks. ACM Conference on Computer and Communications Security 2002: 41-47
6. Feng Xue and P. R. Kumar, The number of neighbors needed for connectivity of wireless networks. To appear in Wireless Networks.
7. F. Ferraguto, G. Mambrini, A. Panconesi and C. Petrioli, Blue Pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks, submitted to ACM Winet. Available at: www.di.uniroma1.it/ale
8. F. Ferraguto, G. Mambrini, A. Panconesi and C. Petrioli, A new approach to device discovery and scatternet formation in Bluetooth Networks. Proceedings of the International Workshop on Wireless, Mobile, and Ad Hoc Networks (WMAN04, an IEEE IPDPS 2004 workshop), Santa Fe, aprile 2003.
9. James A. Fill, Edward R. Scheinerman, Karen B. Singer-Cohen, Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Structures and Algorithms 16(2): 156-176 (2000)
10. O. Häggström and R. Meester, Nearest neighbour and hard sphere models in continuum percolation, Random Structures and Algorithms, 9:3, pp. 295-315, 1996.
11. T.E. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.
12. J.Könemann Approximation Algorithms for Minimum-Cost Low-Degree Subgraphs. PhD Thesis in Algorithms, Combinatorics, and Optimization, Carnegie Mellon University, 2003.
13. H. Maehara, The intersection graph of random sets, Discrete Math. 87 (1991) 97-104
14. R. Meester, M. Penrose and A. Sarkar, "The random connection model in high dimensions" ; Statistics and Probability Letters, 35:2, pp. 145-153, 1997.
15. R. Meester and R. Roy, Continuum Percolation, Cambridge University Press, 1996.
16. M. Penrose, "On the spread-out limit for bond and continuum percolation", Annals of Applied Probability 3:1, pp. 253-276, 1993.