Optimizing time schedule of key updates in ISA100.11a
Wireless Industrial Sensor Networks (WISN) has many challenges like low-resources, harsh environmental conditions, QoS, integration with other wireless technologies and security. In particular, security is the most important to protect the information of critical infrastructure. ISA100.11a is an ind...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 439 |
---|---|
container_issue | |
container_start_page | 434 |
container_title | |
container_volume | |
creator | Hayeon Jung Dong Yeop Hwang Baig, W. A. Ki Hyung Kim Seung Wha Yoo |
description | Wireless Industrial Sensor Networks (WISN) has many challenges like low-resources, harsh environmental conditions, QoS, integration with other wireless technologies and security. In particular, security is the most important to protect the information of critical infrastructure. ISA100.11a is an industrial standard of WISN, includes key update protocol in its standard in order to protect key exposal. In this paper, we analyze the key update problems of ISA100.11a and investigate the way of calculating optimal key update interval for efficiency. Finally we suggest the algorithm that is for organizing time schedule of key updates using calculated interval and evaluate the performance of proposed algorithm by simulations. |
doi_str_mv | 10.1109/ICUFN.2012.6261744 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6261744</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6261744</ieee_id><sourcerecordid>6261744</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-5fc7e4ac1f819b7cd1f664d9ee440034eb1f88f1ccb64dc7ec9cf169bf825b013</originalsourceid><addsrcrecordid>eNpVT8tOwzAQNAIkqpIfgIt_IMHrt49VRGmkih4o5yp21mBoS9Skh_L1GNELc9mdndFoh5A7YBUAcw9N_Tp_rjgDXmmuwUh5QQpnLEhtBAhj2eU_bsQVmXDQqrSK2xtSDMMHy8gObviEqFU_pl36Tvs3mhekQ3jH7rhF-hXpJ57ose_aEQea9rR5mQH7_aO9Jdex3Q5YnOeUrOeP63pRLldPTT1blsmxsVQxGJRtgGjBeRM6iFrLziFKyZiQ6LNiI4Tg8zl7gwsRtPPRcuUZiCm5_4tNiLjpD2nXHk6bc2_xAzVKSCs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimizing time schedule of key updates in ISA100.11a</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hayeon Jung ; Dong Yeop Hwang ; Baig, W. A. ; Ki Hyung Kim ; Seung Wha Yoo</creator><creatorcontrib>Hayeon Jung ; Dong Yeop Hwang ; Baig, W. A. ; Ki Hyung Kim ; Seung Wha Yoo</creatorcontrib><description>Wireless Industrial Sensor Networks (WISN) has many challenges like low-resources, harsh environmental conditions, QoS, integration with other wireless technologies and security. In particular, security is the most important to protect the information of critical infrastructure. ISA100.11a is an industrial standard of WISN, includes key update protocol in its standard in order to protect key exposal. In this paper, we analyze the key update problems of ISA100.11a and investigate the way of calculating optimal key update interval for efficiency. Finally we suggest the algorithm that is for organizing time schedule of key updates using calculated interval and evaluate the performance of proposed algorithm by simulations.</description><identifier>ISSN: 2165-8528</identifier><identifier>ISBN: 9781467313773</identifier><identifier>ISBN: 1467313777</identifier><identifier>EISBN: 9781467313780</identifier><identifier>EISBN: 9781467313766</identifier><identifier>EISBN: 1467313769</identifier><identifier>EISBN: 1467313785</identifier><identifier>DOI: 10.1109/ICUFN.2012.6261744</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; ISA100.11a ; key refresh interval ; Key update ; Protocols ; Schedules ; Scheduling ; Security ; Time scheduling ; Wireless sensor networks ; WISN</subject><ispartof>2012 Fourth International Conference on Ubiquitous and Future Networks (ICUFN), 2012, p.434-439</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6261744$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6261744$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hayeon Jung</creatorcontrib><creatorcontrib>Dong Yeop Hwang</creatorcontrib><creatorcontrib>Baig, W. A.</creatorcontrib><creatorcontrib>Ki Hyung Kim</creatorcontrib><creatorcontrib>Seung Wha Yoo</creatorcontrib><title>Optimizing time schedule of key updates in ISA100.11a</title><title>2012 Fourth International Conference on Ubiquitous and Future Networks (ICUFN)</title><addtitle>ICUFN</addtitle><description>Wireless Industrial Sensor Networks (WISN) has many challenges like low-resources, harsh environmental conditions, QoS, integration with other wireless technologies and security. In particular, security is the most important to protect the information of critical infrastructure. ISA100.11a is an industrial standard of WISN, includes key update protocol in its standard in order to protect key exposal. In this paper, we analyze the key update problems of ISA100.11a and investigate the way of calculating optimal key update interval for efficiency. Finally we suggest the algorithm that is for organizing time schedule of key updates using calculated interval and evaluate the performance of proposed algorithm by simulations.</description><subject>Algorithm design and analysis</subject><subject>ISA100.11a</subject><subject>key refresh interval</subject><subject>Key update</subject><subject>Protocols</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Security</subject><subject>Time scheduling</subject><subject>Wireless sensor networks</subject><subject>WISN</subject><issn>2165-8528</issn><isbn>9781467313773</isbn><isbn>1467313777</isbn><isbn>9781467313780</isbn><isbn>9781467313766</isbn><isbn>1467313769</isbn><isbn>1467313785</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVT8tOwzAQNAIkqpIfgIt_IMHrt49VRGmkih4o5yp21mBoS9Skh_L1GNELc9mdndFoh5A7YBUAcw9N_Tp_rjgDXmmuwUh5QQpnLEhtBAhj2eU_bsQVmXDQqrSK2xtSDMMHy8gObviEqFU_pl36Tvs3mhekQ3jH7rhF-hXpJ57ose_aEQea9rR5mQH7_aO9Jdex3Q5YnOeUrOeP63pRLldPTT1blsmxsVQxGJRtgGjBeRM6iFrLziFKyZiQ6LNiI4Tg8zl7gwsRtPPRcuUZiCm5_4tNiLjpD2nXHk6bc2_xAzVKSCs</recordid><startdate>201207</startdate><enddate>201207</enddate><creator>Hayeon Jung</creator><creator>Dong Yeop Hwang</creator><creator>Baig, W. A.</creator><creator>Ki Hyung Kim</creator><creator>Seung Wha Yoo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201207</creationdate><title>Optimizing time schedule of key updates in ISA100.11a</title><author>Hayeon Jung ; Dong Yeop Hwang ; Baig, W. A. ; Ki Hyung Kim ; Seung Wha Yoo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-5fc7e4ac1f819b7cd1f664d9ee440034eb1f88f1ccb64dc7ec9cf169bf825b013</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>ISA100.11a</topic><topic>key refresh interval</topic><topic>Key update</topic><topic>Protocols</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Security</topic><topic>Time scheduling</topic><topic>Wireless sensor networks</topic><topic>WISN</topic><toplevel>online_resources</toplevel><creatorcontrib>Hayeon Jung</creatorcontrib><creatorcontrib>Dong Yeop Hwang</creatorcontrib><creatorcontrib>Baig, W. A.</creatorcontrib><creatorcontrib>Ki Hyung Kim</creatorcontrib><creatorcontrib>Seung Wha Yoo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hayeon Jung</au><au>Dong Yeop Hwang</au><au>Baig, W. A.</au><au>Ki Hyung Kim</au><au>Seung Wha Yoo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimizing time schedule of key updates in ISA100.11a</atitle><btitle>2012 Fourth International Conference on Ubiquitous and Future Networks (ICUFN)</btitle><stitle>ICUFN</stitle><date>2012-07</date><risdate>2012</risdate><spage>434</spage><epage>439</epage><pages>434-439</pages><issn>2165-8528</issn><isbn>9781467313773</isbn><isbn>1467313777</isbn><eisbn>9781467313780</eisbn><eisbn>9781467313766</eisbn><eisbn>1467313769</eisbn><eisbn>1467313785</eisbn><abstract>Wireless Industrial Sensor Networks (WISN) has many challenges like low-resources, harsh environmental conditions, QoS, integration with other wireless technologies and security. In particular, security is the most important to protect the information of critical infrastructure. ISA100.11a is an industrial standard of WISN, includes key update protocol in its standard in order to protect key exposal. In this paper, we analyze the key update problems of ISA100.11a and investigate the way of calculating optimal key update interval for efficiency. Finally we suggest the algorithm that is for organizing time schedule of key updates using calculated interval and evaluate the performance of proposed algorithm by simulations.</abstract><pub>IEEE</pub><doi>10.1109/ICUFN.2012.6261744</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2165-8528 |
ispartof | 2012 Fourth International Conference on Ubiquitous and Future Networks (ICUFN), 2012, p.434-439 |
issn | 2165-8528 |
language | eng |
recordid | cdi_ieee_primary_6261744 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis ISA100.11a key refresh interval Key update Protocols Schedules Scheduling Security Time scheduling Wireless sensor networks WISN |
title | Optimizing time schedule of key updates in ISA100.11a |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T13%3A16%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimizing%20time%20schedule%20of%20key%20updates%20in%20ISA100.11a&rft.btitle=2012%20Fourth%20International%20Conference%20on%20Ubiquitous%20and%20Future%20Networks%20(ICUFN)&rft.au=Hayeon%20Jung&rft.date=2012-07&rft.spage=434&rft.epage=439&rft.pages=434-439&rft.issn=2165-8528&rft.isbn=9781467313773&rft.isbn_list=1467313777&rft_id=info:doi/10.1109/ICUFN.2012.6261744&rft_dat=%3Cieee_6IE%3E6261744%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467313780&rft.eisbn_list=9781467313766&rft.eisbn_list=1467313769&rft.eisbn_list=1467313785&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6261744&rfr_iscdi=true |