Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
From MaRDI portal
Publication:5502792
DOI10.1007/978-3-540-85093-9_6zbMath1162.68315OpenAlexW1514009804MaRDI QIDQ5502792
Tuvi Etzion, Maura B. Paterson, Simon R. Blackburn, Keith M. Martin
Publication date: 9 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_6
Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25)
Related Items (5)
Problems on Two-Dimensional Synchronization Patterns ⋮ On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks ⋮ ON THE DISJOINTNESS OF ALGEBRAICALLY CONSTRUCTED COSTAS ARRAYS ⋮ Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks
Cites Work
- Unnamed Item
- Algebraic constructions for Costas arrays
- An Application-Oriented Framework for Wireless Sensor Network Key Establishment
- Constructions and properties of Costas arrays
- Public-key cryptography using paraunitary matrices
- Selected Areas in Cryptography
- Information Security
- Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
This page was built for publication: Efficient Key Predistribution for Grid-Based Wireless Sensor Networks