Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks

Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Wireless Sensor Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

As wireless sensor networks (WSN) have gained popularity due to their broader applications areas, so does the need for effective security mechanisms. Encryption can be used to protect data communication, but severe resource constraints in WSN make necessary key distribution very difficult. This study addresses the problem of key establishment in WSN using a key pre-distribution scheme. In this study, the authors have proposed a symmetric key generation and pre-distribution scheme, using a symmetric matrix and generator matrix of maximum rank distance (MRD) codes. Sensor nodes are divided into groups and some information is stored at each node to enable it to generate link keys. This node division substantially improves the memory required at each node, which is approximately equal to the group size. The proposed scheme also reduces the communication overhead to setup a link key. It requires only two messages to setup a link key between any two nodes. Furthermore this scheme also provides the highest level of network connectivity and scalability. Any two nodes in the network can establish a link key and new nodes can be added at any time without changing any information on previously deployed nodes.

Inspec keywords: matrix algebra; data communication; wireless sensor networks; cryptography

Other keywords: key pre-distribution scheme; matrix-based memory efficient symmetric key generation; sensor nodes; symmetric matrix; generator matrix; data communication; maximum rank distance codes; WSN; wireless sensor networks; encryption

Subjects: Algebra; Wireless sensor networks; Cryptography

References

    1. 1)
    2. 2)
      • Chan, H., Perrig, A., Song, D.: `Random key pre-distribution schemes for sensor networks', IEEE Symp. on Research in Security and Privacy, Carnegie Mellon University, May 2003, PA, USA, p. 197–213.
    3. 3)
    4. 4)
      • Dai, H., Xu, H.: `An efficient key predistribution scheme in wireless sensor networks', Proc. IEEE Fourth Int. Symp. on Wireless Communication Systems, 17–19 October 2007, Trondheim, Norway, p. 31–34.
    5. 5)
      • Mao, Y., Wu, M.: `Coordinated sensor deployment for improving secure communications and sensing coverage', Proc. Third ACM Workshop on Security of Ad Hoc and Sensor Networks, 2005, New York, USA, p. 117–128.
    6. 6)
    7. 7)
      • Eschenauer, L., Gligor, V.: `A key management scheme for distributed sensor networks', Proc. ninth ACM Conf. on Computer and Communication Security (CCS), 2002, New York, USA, p. 41–47.
    8. 8)
      • Yuan, T., Zhang, S., Zhong, Y.: `A matrix-based random key pre-distribution scheme for wireless sensor networks', Proc. Seventh IEEE Int. Conf. on Computer and Information Technology, 16–19 October 2007, Washington, DC, USA, p. 991–996.
    9. 9)
      • Blom, R.: `An optimal class of symmetric key generation system', Advances in Cryptology: Proc. EUROCRYPT 84, 1985, p. 335–338, (LNCS).
    10. 10)
      • Yang, C., Xiao, J.: `Location-based pairwise key establishment and data authentication for wireless sensor networks', Proc. IEEE Workshop on Information Assurance, 21–23 June 2006, New York, USA, p. 247–252.
    11. 11)
      • E. Gabidulin . The theory of codes with maximum rank distance. Probl. Inf. Transm. , 1 , 1 - 12
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2011.0097
Loading

Related content

content/journals/10.1049/iet-wss.2011.0097
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address