Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{828560, author = {Švenda, Petr and Sekanina, Lukáš and Matyáš, Václav}, address = {New York, NY, USA}, booktitle = {Proceedings of the second ACM conference on Wireless network security}, keywords = {Evolutionary algorithms; key establishment; secrecy amplification protocols; wireless sensor networks}, howpublished = {tištěná verze "print"}, language = {eng}, location = {New York, NY, USA}, isbn = {978-1-60558-460-7}, pages = {225-236}, publisher = {ACM}, title = {Evolutionary Design of Secrecy Amplification Protocols for Wireless Sensor Networks}, year = {2009} }
TY - JOUR ID - 828560 AU - Švenda, Petr - Sekanina, Lukáš - Matyáš, Václav PY - 2009 TI - Evolutionary Design of Secrecy Amplification Protocols for Wireless Sensor Networks PB - ACM CY - New York, NY, USA SN - 9781605584607 KW - Evolutionary algorithms KW - key establishment KW - secrecy amplification protocols KW - wireless sensor networks N2 - We propose a new method for automatic generation of secrecy amplification protocols for wireless sensor networks, utilizing evolutionary algorithms. We were able to rediscover all published protocols for secrecy amplification we are aware of, and found a new protocol that outperforms the existing ones. An alternative construction of secrecy amplification protocols with a comparable fraction of secure links to that of the original ``node-oriented'' approach was also designed. This new construction exhibits only linear (instead of exponential) increase of necessary messages when the number of communication neighbours grows. This efficient protocol can significantly reduce the sensor battery power consumption because of the decreased message transmission rate. We used a combination of linear genetic programming and a network simulator in this work. ER -
ŠVENDA, Petr, Lukáš SEKANINA a Václav MATYÁŠ. Evolutionary Design of Secrecy Amplification Protocols for Wireless Sensor Networks. In \textit{Proceedings of the second ACM conference on Wireless network security}. New York, NY, USA: ACM, 2009, s.~225-236, 268 s. ISBN~978-1-60558-460-7.
|