Expansion properties of (secure) wireless networks
Article No.: 21, Pages 1 - 9
Abstract
We show that some topologies arising naturally in the context of wireless networking are low-degree, expander graphs.
References
[1]
Crescenzi, P., Nocentini, C., Pietracaprina, A., and Pucci, G. 2009. On the connectivity of bluetooth-based d hoc networks. Concurr. Comput. Pract. Exper. 21, 7, 875--887.
[2]
Di Pietro, R., Mancini, L. V., Mei, A., Panconesi, A., and Radhakrishnan, J. 2004. Connectivity properties of secure wireless sensor networks. In Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'04). ACM, New York, 53--58.
[3]
Di Pietro, R., Mancini, L. V., Mei, A., Panconesi, A., and Radhakrishnan, J. 2008. Redoubtable sensor networks. ACM Trans. Inf. Syst. Secur. 11, 3, 1--22.
[4]
Dubhashi, D., Häggström, O., Mambrini, G., Panconesi, A., and Petrioli, C. 2007. Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop bluetooth networks. Wirel. Netw. 13, 1, 107--125.
[5]
Dubhashi, D., Johansson, C., Häggström, O., Panconesi, A., and Sozio, M. 2005. Irrigating ad hoc networks in constant time. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05). ACM, New York, 106--115.
[6]
Dubhashi, D. P. and Panconesi, A. 2009. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge, UK.
[7]
Eschenauer, L. and Gligor, V. D. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS'02). ACM, New York, 41--47.
[8]
Ferraguto, F., Mambrini, G., Panconesi, A., and Petrioli, C. 2004. A new approach to device discovery and scatternet formation in bluetooth networks. In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 12 (WMAN04). IEEE, 221b.
[9]
Mei, A., Panconesi, A., and Radhakrishnan, J. 2008. Unassailable sensor networks. In Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks (SecureComm'08). ACM, New York, 1--10.
[10]
Mitzenmacher, M. and Upfal, E. 2005. Probability and Computing. Cambridge University Press, Cambridge, UK.
[11]
Pettarin, A., Pietracaprina, A., and Pucci, G. 2009. On the expansion and diameter of bluetooth-like topologies. In Proceedings of the European Symposium on Algorithms (ESA). 528--539.
[12]
Whitaker, R. M., Hodge, L., and Chlamtac, I. 2005. Bluetooth scatternet formation: A survey. Ad Hoc Netw. 3, 4, 403--450.
Index Terms
- Expansion properties of (secure) wireless networks
Recommendations
Expansion properties of (secure) wireless networks
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesWe show that some topologies arising naturally in the context of wireless networking are low-degree, expander graphs.
On-demand multicast routing protocol in multihop wireless mobile networks
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge ...
Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks
Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2012 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2012
Accepted: 01 December 2009
Received: 01 June 2009
Published in TALG Volume 8, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 287Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in