On Exploring the Secure Connectivity of Wireless Ad Hoc Networks
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.
KeywordsWireless Ad hoc Networks Connectivity Security Critical Density
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 3.Dousse, O., Mannersalo, P., Thiran, P.: Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms. In: Proc. of ACM MobiHoc 2004 (May 2004)Google Scholar
- 4.Kong, Z., Yeh, E.M.: Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links. In: Proc. of IEEE INFOCOM 2008 (April 2008)Google Scholar
- 9.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)Google Scholar