Abstract
Connectivity of Wireless Ad hoc Networks (WANETs) has received considerable attention in the past several years. In WANETs, achieving a secure connectivity is more challenging since all the communications should operate on secure links. In this paper, we investigate the characterization of the critical density λ c for Poisson random geometric graphs which is the central problem of secure connectivity. By combining the continuum percolation theory with the clustering coefficient method, we derive a tighter lower bound on λ c which provides fundamental understanding on the secure connectivity of WANETs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 38(4), 393–4221 (2002)
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: Proc. of IEEE Conference on Decision and Control, pp. 1106–1110 (December 1998)
Dousse, O., Mannersalo, P., Thiran, P.: Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms. In: Proc. of ACM MobiHoc 2004 (May 2004)
Kong, Z., Yeh, E.M.: Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links. In: Proc. of IEEE INFOCOM 2008 (April 2008)
Lu, D., Huang, X., Li, P., Fan, J.: Connectivity of Large-scale Cognitive Radio Ad hoc Networks. In: Proc. of IEEE INFOCOM 2012, pp. 1260–1268. IEEE Press, Orlando (2012)
Sun, L., Wang, W.: Understanding the Tempo-spatial Limits of Information Dissemination in Multi-channel Cognitive Radio Networks. In: Proc. of IEEE INFOCOM 2012, pp. 1278–1286. IEEE Press, Orlando (2012)
Quintanilla, J., Torquato, S., Ziff, R.M.: Efficient Measurement of the Percolation Threshold for Fully Penetrable Discs. Physics A 86, 399–407 (2000)
Balister, P., Bollobas, B., Walters, M.: Continuum Percolation with Steps in the Square or the Disc. Random Structures Algorithms 26, 392–403 (2005)
Kong, Z., Yeh, E.M.: Analytical Lower Bounds on the Critical Density in Continuum Percolation. In: Proc. of the Workshop on Spatial Stochastic Models in Wireless Networks (April 2007)
Zhang, C., Song, Y., Fang, Y., Zhang, Y.: On the Price of Security in Large-Scale Wireless Ad Hoc Networks. IEEE/ACM Transaction on Networking 19(2), 319–331 (2011)
Penrose, M.: Random Geometric Graphs. Oxford University Press, New York (2003)
Meester, R., Roy, R.: Continuum Percolation. Cambridge University Press, New York (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lu, D., Zhang, G., Liu, H. (2014). On Exploring the Secure Connectivity of Wireless Ad Hoc Networks. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-09265-2_42
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09264-5
Online ISBN: 978-3-319-09265-2
eBook Packages: Computer ScienceComputer Science (R0)