Key management is considered as the fundamental part of any secure communication. In previous work, we propose RKPH scheme that was improved based on connectivity and resiliency compared to some other schemes. In this paper, we propose ARKPH, a modified scheme of RKPH that decrease impact of node compromise on sensor network security. In this scheme that we name it as alternative shared key replacement, impact of existence of multiple shared key between two nodes is studied. In RKPH, with compromising a secure link, link expire and secure connection between two neighboring node terminate. Expiring secure connections cause that connectivity in network decrease. For decreasing effect of compromising a node on expiring secure connections, we discover another shared key between two nodes that have not compromised yet. This work is done directly or indirectly by cluster head. Simulation results show that expiring secure connections in ARKPH scheme is decreased.
{"title":"Alternative Shared Key Replacement in Heterogeneous Wireless Sensor Networks","authors":"S. Banihashemian, A. G. Bafghi","doi":"10.1109/CNSR.2010.46","DOIUrl":"https://doi.org/10.1109/CNSR.2010.46","url":null,"abstract":"Key management is considered as the fundamental part of any secure communication. In previous work, we propose RKPH scheme that was improved based on connectivity and resiliency compared to some other schemes. In this paper, we propose ARKPH, a modified scheme of RKPH that decrease impact of node compromise on sensor network security. In this scheme that we name it as alternative shared key replacement, impact of existence of multiple shared key between two nodes is studied. In RKPH, with compromising a secure link, link expire and secure connection between two neighboring node terminate. Expiring secure connections cause that connectivity in network decrease. For decreasing effect of compromising a node on expiring secure connections, we discover another shared key between two nodes that have not compromised yet. This work is done directly or indirectly by cluster head. Simulation results show that expiring secure connections in ARKPH scheme is decreased.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125096679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiang Ye, Dianzhang Cui, Zheng Wang, Lei Wang, M. MacGregor
Long-haul traffic accounts for a large percentage of the total data carried on the Internet. Due to the rapid changes of the Internet in terms of access technologies and core network bandwidth, the performance of long-haul transmission in the current Internet environment has not been well understood. In our research, we chose three typical long-haul paths (national, international yet continental, international and intercontinental) and studied their performance under a variety of access rates: dial-up, ADSL, ADSL2, and best-effort. Our results show that as long as the paths are within one continent, the long-haul transmission will be very reliable. However, intercontinental transmission suffers seriously from bandwidth fluctuation and packet retransmission.
{"title":"Long-Haul Transmission Performance in the Internet","authors":"Qiang Ye, Dianzhang Cui, Zheng Wang, Lei Wang, M. MacGregor","doi":"10.1109/CNSR.2010.42","DOIUrl":"https://doi.org/10.1109/CNSR.2010.42","url":null,"abstract":"Long-haul traffic accounts for a large percentage of the total data carried on the Internet. Due to the rapid changes of the Internet in terms of access technologies and core network bandwidth, the performance of long-haul transmission in the current Internet environment has not been well understood. In our research, we chose three typical long-haul paths (national, international yet continental, international and intercontinental) and studied their performance under a variety of access rates: dial-up, ADSL, ADSL2, and best-effort. Our results show that as long as the paths are within one continent, the long-haul transmission will be very reliable. However, intercontinental transmission suffers seriously from bandwidth fluctuation and packet retransmission.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"80 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126061625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Buffered crossbar (CICQ) switches have shown a high potential in scaling Internet routers capacity. However, they require expensive on-chip buffers whose cost grows quadratically with the port count. Additionally, similar to traditional crossbars, point-to-point switching mandates the use of long wires to connect inputs to outputs, resulting in non-negligible delays. In this paper,we propose a CICQ switching architecture where the bufferedcrossbar fabric is designed using a Network on Chip (NoC).Instead of a dedicated buffer for every pair of input-outputports, we use on-chip routers, one for each crosspoint. Our design offers several advantages when compared to traditional CICQs: 1) speedup, because the fabric can operate faster due to the small size of the NoC routers, their distributed arbitration and the short wires connecting them. This is in contrast to single-hopcrossbars that use long wires and centralized arbitration. 2) Load balancing, because flows from different input-output port pairs share the same router buffers, contrary to the internal buffers of traditional CICQs that are dedicated to a single input-output pair. 3) Path diversity, allowing traffic from an input port to follow different paths to its destination output port. This resultsin further load balancing, especially for non-uniform traffic, and provides better fault tolerance in the presence of interconnect failures. We analyzed the performance of our architecture by simulation and presented its performance under wide traffic conditions and switch sizes. We prototyped, in CMOS technology, a 32×32 NoC-based crossbar switch. The implementation results suggest that we can clock the switch at a frequency of 413 MHZ, reaching an aggregate throughput in excess of 10^10 ATM cellsper second.
{"title":"Buffered Crossbar Fabrics Based on Networks on Chip","authors":"L. Mhamdi, K. Goossens, I. V. Senin","doi":"10.1109/CNSR.2010.18","DOIUrl":"https://doi.org/10.1109/CNSR.2010.18","url":null,"abstract":"Buffered crossbar (CICQ) switches have shown a high potential in scaling Internet routers capacity. However, they require expensive on-chip buffers whose cost grows quadratically with the port count. Additionally, similar to traditional crossbars, point-to-point switching mandates the use of long wires to connect inputs to outputs, resulting in non-negligible delays. In this paper,we propose a CICQ switching architecture where the bufferedcrossbar fabric is designed using a Network on Chip (NoC).Instead of a dedicated buffer for every pair of input-outputports, we use on-chip routers, one for each crosspoint. Our design offers several advantages when compared to traditional CICQs: 1) speedup, because the fabric can operate faster due to the small size of the NoC routers, their distributed arbitration and the short wires connecting them. This is in contrast to single-hopcrossbars that use long wires and centralized arbitration. 2) Load balancing, because flows from different input-output port pairs share the same router buffers, contrary to the internal buffers of traditional CICQs that are dedicated to a single input-output pair. 3) Path diversity, allowing traffic from an input port to follow different paths to its destination output port. This resultsin further load balancing, especially for non-uniform traffic, and provides better fault tolerance in the presence of interconnect failures. We analyzed the performance of our architecture by simulation and presented its performance under wide traffic conditions and switch sizes. We prototyped, in CMOS technology, a 32×32 NoC-based crossbar switch. The implementation results suggest that we can clock the switch at a frequency of 413 MHZ, reaching an aggregate throughput in excess of 10^10 ATM cellsper second.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129290139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the past few years the security issues in the supervisory control and data acquisition (SCADA) system have been investigated, and many security mechanisms have been proposed from research communities. The international standard organizations also have published several standard documents for secured SCADA systems. In this paper we explain the technological challenges for the SCADA security and overview the approaches which address these challenges. Then we focus on the security protocol which has been proposed in the SCADA cyber security initiatives and implementation issues when the both security function and the communication function are implemented on the embedded system devices in future power grid including the SCADA network.
{"title":"Challenges and Direction toward Secure Communication in the SCADA System","authors":"Sugwon Hong, Myungho Lee","doi":"10.1109/CNSR.2010.52","DOIUrl":"https://doi.org/10.1109/CNSR.2010.52","url":null,"abstract":"In the past few years the security issues in the supervisory control and data acquisition (SCADA) system have been investigated, and many security mechanisms have been proposed from research communities. The international standard organizations also have published several standard documents for secured SCADA systems. In this paper we explain the technological challenges for the SCADA security and overview the approaches which address these challenges. Then we focus on the security protocol which has been proposed in the SCADA cyber security initiatives and implementation issues when the both security function and the communication function are implemented on the embedded system devices in future power grid including the SCADA network.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For ultra wideband transmitted reference (UWBTR)systems Maximum-likelihood (ML) and generalizedlikelihood ratio test (GLRT) are two major methods toestimate a correlation template in receivers. In this paperthese methods will be generalized for pulse positionmodulation (PPM) and will be compared with pulse amplitudemodulation (PAM). We also improve these methods by using abetter cutoff for ML receivers to achieve about 3dBperformance gain, and presenting a new improved GLRTreceiver which can ameliorate performance of the GLRTreceiver by 1dB when PPM and PAM signals are employed.
{"title":"An Improvement for ML and GLRT Based UWB TR Receivers","authors":"Shahin Nikookhoy, V. Vakili, Ali Jarrahi","doi":"10.1109/CNSR.2010.56","DOIUrl":"https://doi.org/10.1109/CNSR.2010.56","url":null,"abstract":"For ultra wideband transmitted reference (UWBTR)systems Maximum-likelihood (ML) and generalizedlikelihood ratio test (GLRT) are two major methods toestimate a correlation template in receivers. In this paperthese methods will be generalized for pulse positionmodulation (PPM) and will be compared with pulse amplitudemodulation (PAM). We also improve these methods by using abetter cutoff for ML receivers to achieve about 3dBperformance gain, and presenting a new improved GLRTreceiver which can ameliorate performance of the GLRTreceiver by 1dB when PPM and PAM signals are employed.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131621190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The analysis of scalability of wireless sensornetworks is a challenging performance issue. In this paper,we employ an analytical method based on probabilitydensity function Signal-to-Interference-plus-Noise-Ratio(SINR) of links to evaluate the performance of a wirelesssensor network in terms of bit-error-rate (BER). We derivean analytical formula for the average of BER according tothe physical resources allocated to the network andproperties of routing method which is used. We show thatlink BER has a minimum in a specific node density value.This is called optimum density point. The analyticalderivations have been validated using simulation studies.
{"title":"Scalability Analysis of Wireless Sensor Networks Using Analytical Techniques","authors":"Mohammad Reza Sanatkar, A. Mohammadi","doi":"10.1109/CNSR.2010.45","DOIUrl":"https://doi.org/10.1109/CNSR.2010.45","url":null,"abstract":"The analysis of scalability of wireless sensornetworks is a challenging performance issue. In this paper,we employ an analytical method based on probabilitydensity function Signal-to-Interference-plus-Noise-Ratio(SINR) of links to evaluate the performance of a wirelesssensor network in terms of bit-error-rate (BER). We derivean analytical formula for the average of BER according tothe physical resources allocated to the network andproperties of routing method which is used. We show thatlink BER has a minimum in a specific node density value.This is called optimum density point. The analyticalderivations have been validated using simulation studies.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131899760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper investigates code synchronization for a recently proposed code-shifted reference (CSR) impulse radio ultra-wideband (IR-UWB) system. In the CSR scheme every symbol with the code-shifted information bits is conveyed by several frames and during each frame only one pulse is transmitted. By assuming that the start of each frame concerning the receiver's clock is known,two code synchronization algorithms are proposed to estimate the position of the first frame in each symbol and each algorithm works without using a preamble sequence.The performance of the two algorithms are evaluated under IEEE802.15.4a industrial line-of-sight (LOS)scenario. The simulation results reveal that the second algorithm with the partial Euclidean distance minimization outperforms the first algorithm with the direct searching.
{"title":"Non-Data-Aided Code Synchronization for the Code-Shifted Reference Ultra-Wideband (UWB) System","authors":"Chen Wei, H. Nie, Z. Chen","doi":"10.1109/CNSR.2010.69","DOIUrl":"https://doi.org/10.1109/CNSR.2010.69","url":null,"abstract":"This paper investigates code synchronization for a recently proposed code-shifted reference (CSR) impulse radio ultra-wideband (IR-UWB) system. In the CSR scheme every symbol with the code-shifted information bits is conveyed by several frames and during each frame only one pulse is transmitted. By assuming that the start of each frame concerning the receiver's clock is known,two code synchronization algorithms are proposed to estimate the position of the first frame in each symbol and each algorithm works without using a preamble sequence.The performance of the two algorithms are evaluated under IEEE802.15.4a industrial line-of-sight (LOS)scenario. The simulation results reveal that the second algorithm with the partial Euclidean distance minimization outperforms the first algorithm with the direct searching.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114795337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Our main focus in this paper is to determine the most appropriate method for assessing the Quality of Experience (QoE) in the context of Multiple Description Coding (MDC) video streaming, over multiple overlay paths, in video distribution networks (VDN). For this objective, we compare three different types of QoE assessment approaches, subjective approach, objective approach and a hybrid approach that can overcome the limitations of both subjective and objective ones. Results show how the hybrid Pseudo-Subjective Quality Assessment (PSQA) tool can outperform the well-known peak signal to noise ratio (PSNR) as well as the subjective methods for evaluating the perceived video quality in our context of MDC streaming.
{"title":"Hybrid QoE Assessment Is Well-Suited for Multiple Description Coding Video Streaming in Overlay Networks","authors":"Majd Ghareeb, C. Viho","doi":"10.1109/CNSR.2010.15","DOIUrl":"https://doi.org/10.1109/CNSR.2010.15","url":null,"abstract":"Our main focus in this paper is to determine the most appropriate method for assessing the Quality of Experience (QoE) in the context of Multiple Description Coding (MDC) video streaming, over multiple overlay paths, in video distribution networks (VDN). For this objective, we compare three different types of QoE assessment approaches, subjective approach, objective approach and a hybrid approach that can overcome the limitations of both subjective and objective ones. Results show how the hybrid Pseudo-Subjective Quality Assessment (PSQA) tool can outperform the well-known peak signal to noise ratio (PSNR) as well as the subjective methods for evaluating the perceived video quality in our context of MDC streaming.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jinfu Zheng, Charles Elliott, A. Dersingh, R. Liscano, Mikael Eklund
It is common knowledge that EnergyManagement (EM) is a crucial design criterion for wirelesssensor networks and it influences many softwarecomponents of a wireless sensor network. To facilitate theapplication developer, EM algorithms at the physical anddevice level are generally abstracted out by the OperatingSystem, but this is not sufficient. This paper presents thedesign of a wireless sensor network for the acquisition oftemperature values from the EM perspective in particularfrom the application layer perspective. Power measurementson a wireless sensor node show that the energy consumptionis close to the theoretical and manufacturer’s posted energybudget, but the predicted lifespan of the nodes when placedin a network is not achieved. Explanations are given of whythe amounts are not exactly the same.
{"title":"Design of a Wireless Sensor Network from an Energy Management Perspective","authors":"Jinfu Zheng, Charles Elliott, A. Dersingh, R. Liscano, Mikael Eklund","doi":"10.1109/CNSR.2010.53","DOIUrl":"https://doi.org/10.1109/CNSR.2010.53","url":null,"abstract":"It is common knowledge that EnergyManagement (EM) is a crucial design criterion for wirelesssensor networks and it influences many softwarecomponents of a wireless sensor network. To facilitate theapplication developer, EM algorithms at the physical anddevice level are generally abstracted out by the OperatingSystem, but this is not sufficient. This paper presents thedesign of a wireless sensor network for the acquisition oftemperature values from the EM perspective in particularfrom the application layer perspective. Power measurementson a wireless sensor node show that the energy consumptionis close to the theoretical and manufacturer’s posted energybudget, but the predicted lifespan of the nodes when placedin a network is not achieved. Explanations are given of whythe amounts are not exactly the same.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"10 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114995897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A key component of an efficient multipath routing is theoptimal resource allocation strategy that deals with how thetraffic should be distributed amongst the multiple paths. Inthis paper, an intelligent traffic distribution policy thatminimise the maximum delay in a multipath routing scenariois proposed. It would be proved that such delay minimisationcan be achieved through delay synchronization. Based on thisfact, an intelligent algorithm which can minimise thebottleneck path delay by using adaptive traffic sharing isproposed and validated.
{"title":"Maximum Delay Minimization in Multipath Routing","authors":"S. Mostafavi, E. Hamadani, Rahim Tafazzoli","doi":"10.1109/CNSR.2010.49","DOIUrl":"https://doi.org/10.1109/CNSR.2010.49","url":null,"abstract":"A key component of an efficient multipath routing is theoptimal resource allocation strategy that deals with how thetraffic should be distributed amongst the multiple paths. Inthis paper, an intelligent traffic distribution policy thatminimise the maximum delay in a multipath routing scenariois proposed. It would be proved that such delay minimisationcan be achieved through delay synchronization. Based on thisfact, an intelligent algorithm which can minimise thebottleneck path delay by using adaptive traffic sharing isproposed and validated.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122165279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：