Secrecy Transfer for Sensor Networks: From Random Graphs to Secure Random Geometric Graphs
By:
References
- Bollobás, B.. Random Graphs, 2nd ed. Cambridge University Press, (2001).
- Penrose, M.. Random Geometric Graphs. Oxford studies in probability. Oxford University Press, Oxford, (2003).
- Anderson, R. M. and May, R. M. Susceptible-infectious-recovered epidemic model with dynamic partnerships. Journal of Mathematical Biology, vol. 33, pp. 661–675, (1995).
- Bettstetter, C. On the minimum node degree and connectivity of a wireless multihop network. Proceedings of the third ACM International Symposium on Mobile ad hoc Networking and Computing (MobiHoc 02). ACM, (2002), pp. 80–91.
- Gupta, P. and Kumar, P. The capacity of wireless networks. IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388–404, March (2000).
- Pietro, R. D., Mancini, L., Mei, A., Panconesi, A. and Radhakrishnan, J. Redoubtable sensor networks. ACM Transactions on Information Systems Security, vol. 11, no. 3, pp. 13–22, (2008).
- Eschenauer, L. and Gligor, V. A key management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS’02, (2002), pp. 41–47.
- Liu, Z., Ma, J., Pei, Q., Pang, L., and Park, Y. H. Key infection, secrecy transfer, and key evolution for sensor networks. IEEE Transactions on Wireless Communications, vol. 9, no. 8, pp. 2643–2653, August (2010).
- Anderson, R., Chan, H., and Perrig, A. Key infection: Smart trust for smart dust, ICNP’04, Berlin, Germany, (2004), pp. 24–31.
- Bollobás, B. A probability proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, vol. 1(1980), pp. 311–316, (1980).
- Newman, M. E. J. The structure and function of complex networks. SIAM Review, vol. 45, pp. 167–256, (2003).
- Freris, N. M., Kowshik, H., and Kumar, P. R. Fundamentals of large sensor networks: Connectivity, capacity, clocks, and computation. Proceedings of the IEEE, vol. 98, no. 11, pp. 1828–1846, November (2010).
- Giruka, V. C., Singhal, M., Royalty, J., and Varansi, S. Security in wireless sensor networks. Journal of Wireless Communications and Mobile Computing, vol. 8, pp. 1–24, (2008).
- Liu, Z., Ma, J., Huang, Q., and Moon, S. J. Asymmetric key predistribution scheme for sensor networks. IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1366–1372, March (2009).
- Bloom, B. H. Space/time trade-offs in hash coding with allowable errors. Communications of ACM, vol. 13, no. 7, pp. 422–426, 1970.
- De, P., Liu, Y., and Das, S. K. Deployment-aware modeling of node compromise spread in wireless sensor networks using epidemic theory. ACM Transactions on Sensor Networks., vol. 5, no. 3, pp. 23:1–23:33, 2009.
DOI: https://doi.org/10.21307/ijssis-2017-529 | Journal eISSN: 1178-5608
Language: English
Page range: 77 - 94
Submitted on: Oct 2, 2012
Accepted on: Jan 6, 2013
Published on: Feb 20, 2013
Published by: Professor Subhas Chandra Mukhopadhyay
In partnership with: Paradigm Publishing Services
Publication frequency: 1 times per year
Keywords:
Related subjects:
© 2013 Zhihong Liu, Jianfeng Ma, Yong Zeng, published by Professor Subhas Chandra Mukhopadhyay
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.