메뉴 건너뛰기




Volumn 5, Issue , 2006, Pages 2262-2267

Expander graph based key distribution mechanisms in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; RANDOM PROCESSES; WIRELESS SENSOR NETWORKS;

EID: 42449162962     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2006.255107     Document Type: Conference Paper
Times cited : (36)

References (22)
  • 2
    • 33646839571 scopus 로고    scopus 로고
    • Combinatorial design of key distribution mechanisms for wireless sensor networks
    • September
    • S. Camtepe and B. Yener, "Combinatorial design of key distribution mechanisms for wireless sensor networks," in 9th European Symposium on Research Computer Security, September 2004.
    • (2004) 9th European Symposium on Research Computer Security
    • Camtepe, S.1    Yener, B.2
  • 3
    • 0000893265 scopus 로고
    • An optimal class of symmetric key generation systems
    • R. Blom, "An optimal class of symmetric key generation systems," in Eurocrypt 84, 1985.
    • (1985) Eurocrypt , vol.84
    • Blom, R.1
  • 8
    • 8344262333 scopus 로고    scopus 로고
    • A key management scheme for wireless sensor networks using deployment knowledge
    • March
    • W Du, J. Deng, Y. Han, S. Chen, and P. Varshney, "A key management scheme for wireless sensor networks using deployment knowledge," in IEEE Infocom'04, March 2004.
    • (2004) IEEE Infocom'04
    • Du, W.1    Deng, J.2    Han, Y.3    Chen, S.4    Varshney, P.5
  • 14
    • 1042289031 scopus 로고    scopus 로고
    • The number of neighbors needed for connectivity of wireless networks
    • F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, vol. 10, pp. 169-181, 2004.
    • (2004) Wireless Networks , vol.10 , pp. 169-181
    • Xue, F.1    Kumar, P.R.2
  • 17
    • 38349062544 scopus 로고    scopus 로고
    • Expanders, eigenvalues and all that
    • N. Linial, "Expanders, eigenvalues and all that," NIPS 2004 Talk, 2004.
    • (2004) NIPS 2004 Talk
    • Linial, N.1
  • 18
    • 38349059087 scopus 로고
    • Design of scalable expander interconnection networks,
    • Ph.D. dissertation, Rensselaer Polytechnic Institute, Troy, New York 12180, USA
    • R. Govindaraju, "Design of scalable expander interconnection networks," Ph.D. dissertation, Rensselaer Polytechnic Institute, Troy, New York 12180, USA, 1994.
    • (1994)
    • Govindaraju, R.1
  • 19
    • 0019697885 scopus 로고    scopus 로고
    • M. Blum, R. Karp, O. Vornberger, C. Papadimitriou, and M. Yannakakis, The complexity of testing whether a graph is a superconcentrator, Information Processing Letters, 13, no. 4,5, pp. 164-167, 1981.
    • M. Blum, R. Karp, O. Vornberger, C. Papadimitriou, and M. Yannakakis, "The complexity of testing whether a graph is a superconcentrator," Information Processing Letters, vol. 13, no. 4,5, pp. 164-167, 1981.
  • 21
    • 11944253901 scopus 로고    scopus 로고
    • 2nd ed. Cambridge University Press
    • B. Bollobas, Random Graphs, 2nd ed. Cambridge University Press, 2001.
    • (2001) Random Graphs
    • Bollobas, B.1
  • 22
    • 42549168618 scopus 로고    scopus 로고
    • P. Gupta and P. R. Kumar, Critical power for asymptotic connectivity in wireless networks, Stochastic Analysis, Control, Optimization and Applications, A in Honor of WH. Fleming, 10, pp. 547-566, 1998.
    • P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications, A Volume in Honor of WH. Fleming, vol. 10, pp. 547-566, 1998.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.