Indexed by:
Abstract:
Through building the neighbor list, we propose effective pairwise key storage and update methods. The structure of the neighbor list is simple and can save the storage space for the node. By using the pseudo random function and the elliptic curve digital signature algorithm, we establish the pairwise keys decentralized completely and solve the new node joining problem. Analysis shows that neighbor-list based pairwise key management scheme is energy efficient. © 2009 Springer-Verlag.
Keyword:
Reprint Author's Address:
Source :
ISSN: 0302-9743
Year: 2009
Volume: 5820 LNCS
Page: 522-528
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 4
Affiliated Colleges: