Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129080
H. Hisamatsu, G. Hasegawa, M. Murata
Power-saving is one of the important issues in wireless sensor networks and many studies on power-saving in wireless sensor networks have been done. However, most of these studies have focused on saving power in gathering the information. In this paper, we tackle the issue of the energy-efficient information dissemination in wireless sensor networks. We propose method of disseminating information while optimizing electric power consumption in wireless sensor networks. Our new dissemination method employs flooding and uses the receiver signal strength to determine the broadcast timing. In our method, the node farthest from the sending node will rebroadcast the message first and a broadcast is canceled when a node scheduled to broadcast receives a duplicate of the scheduled message from other nodes. We evaluate our proposed method by simulation. As a result, it is found that the electric power consumption of the proposal method in the entire network is one-third that of the flooding method at the maximum. Furthermore, we show that the farther the transmitting distance of the wireless radio wave becomes, the more efficiently our method can disseminate information to the network.
{"title":"Energy-efficient information dissemination based on received signal strength in wireless sensor networks","authors":"H. Hisamatsu, G. Hasegawa, M. Murata","doi":"10.1109/CQR.2015.7129080","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129080","url":null,"abstract":"Power-saving is one of the important issues in wireless sensor networks and many studies on power-saving in wireless sensor networks have been done. However, most of these studies have focused on saving power in gathering the information. In this paper, we tackle the issue of the energy-efficient information dissemination in wireless sensor networks. We propose method of disseminating information while optimizing electric power consumption in wireless sensor networks. Our new dissemination method employs flooding and uses the receiver signal strength to determine the broadcast timing. In our method, the node farthest from the sending node will rebroadcast the message first and a broadcast is canceled when a node scheduled to broadcast receives a duplicate of the scheduled message from other nodes. We evaluate our proposed method by simulation. As a result, it is found that the electric power consumption of the proposal method in the entire network is one-third that of the flooding method at the maximum. Furthermore, we show that the farther the transmitting distance of the wireless radio wave becomes, the more efficiently our method can disseminate information to the network.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134089157","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129082
Masaki Suzuki, M. Watari, S. Ano, M. Tsuru
Recent widespread use of smartphones and rich multimedia contents has brought a considerable increase in mobile traffic. Therefore, the characteristics of smartphone traffic need to be considered when designing mobile core networks. Smartphone traffic is categorized by whether it is generated from user interaction (foreground (FG) traffic) or not (background (BG) traffic), and such traffic types can be managed differently to efficiently maintain the communication quality in the case of network congestion. However, it is difficult to distinguish such traffic types and their characteristics solely by IP addresses/port numbers. In addition, the increase in HTTPS traffic makes application-level packet inspection difficult. In this paper, we propose a traffic classification method on a mobile core network. The proposed method captures packets on the mobile core network, constructs TCP flows, and labels each flow by considering the regularity of BG traffic and the randomness of FG traffic using a Support Vector Machine (SVM) classifier with selected feature indexes obtained from the TCP/IP layer. Also, we attempt to restrict the indexes that can be obtained in the observation of the initial part of each TCP flow in order to reduce the calculation cost. The proposed method is evaluated in terms of the classification accuracy using experimental data through the Wi-Fi connections of smartphones. The full-index classifier using 40 indexes classifies FG and BG traffic with 97.2% accuracy and the shortcut-index classifier using restricted 36 indexes also indicates 94.4% accuracy.
{"title":"Traffic classification on mobile core network considering regularity of background traffic","authors":"Masaki Suzuki, M. Watari, S. Ano, M. Tsuru","doi":"10.1109/CQR.2015.7129082","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129082","url":null,"abstract":"Recent widespread use of smartphones and rich multimedia contents has brought a considerable increase in mobile traffic. Therefore, the characteristics of smartphone traffic need to be considered when designing mobile core networks. Smartphone traffic is categorized by whether it is generated from user interaction (foreground (FG) traffic) or not (background (BG) traffic), and such traffic types can be managed differently to efficiently maintain the communication quality in the case of network congestion. However, it is difficult to distinguish such traffic types and their characteristics solely by IP addresses/port numbers. In addition, the increase in HTTPS traffic makes application-level packet inspection difficult. In this paper, we propose a traffic classification method on a mobile core network. The proposed method captures packets on the mobile core network, constructs TCP flows, and labels each flow by considering the regularity of BG traffic and the randomness of FG traffic using a Support Vector Machine (SVM) classifier with selected feature indexes obtained from the TCP/IP layer. Also, we attempt to restrict the indexes that can be obtained in the observation of the initial part of each TCP flow in order to reduce the calculation cost. The proposed method is evaluated in terms of the classification accuracy using experimental data through the Wi-Fi connections of smartphones. The full-index classifier using 40 indexes classifies FG and BG traffic with 97.2% accuracy and the shortcut-index classifier using restricted 36 indexes also indicates 94.4% accuracy.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122007018","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129087
Yueqing Zhang, Arthur Clouet, Oluseyi S. Awotayo, C. Davids, V. Gurbani
Measuring and comparing performance of an Internet multimedia signaling protocol across varying vendor implementations is a challenging task. Tests to measure the performance of the protocol as it is exhibited on a vendor device and conditions of the laboratory setup to run the tests have to be normalized such that no special favour is accorded to a particular vendor implementation. In this paper, we describe a performance benchmark to measure the performance of a device that includes a Session Initiation Protocol (SIP) proxy function. This benchmark is currently being standardized by the Internet Engineering Task Force (IETF). We implemented the algorithm that has been proposed in the IETF to measure the performance of a SIP server. We provide the test results of running the benchmark on Asterisk, the popular open source SIP private branch exchange (PBX).
{"title":"Benchmarking the session initiation protocol (SIP)","authors":"Yueqing Zhang, Arthur Clouet, Oluseyi S. Awotayo, C. Davids, V. Gurbani","doi":"10.1109/CQR.2015.7129087","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129087","url":null,"abstract":"Measuring and comparing performance of an Internet multimedia signaling protocol across varying vendor implementations is a challenging task. Tests to measure the performance of the protocol as it is exhibited on a vendor device and conditions of the laboratory setup to run the tests have to be normalized such that no special favour is accorded to a particular vendor implementation. In this paper, we describe a performance benchmark to measure the performance of a device that includes a Session Initiation Protocol (SIP) proxy function. This benchmark is currently being standardized by the Internet Engineering Task Force (IETF). We implemented the algorithm that has been proposed in the IETF to measure the performance of a SIP server. We provide the test results of running the benchmark on Asterisk, the popular open source SIP private branch exchange (PBX).","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121954479","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129081
M. Olama, M. Matalgah, M. Bobrek
Traditional encryption techniques require packet overhead, produce processing time delay, and suffer from severe quality of service deterioration due to fades and interference in wireless channels. These issues reduce the effective transmission data rate (throughput) considerably in wireless communications, where data rate with limited bandwidth is the main constraint. In this paper, performance evaluation analyses are conducted for an integrated signaling-encryption mechanism that is secure and enables improved throughput and probability of bit-error in wireless channels. This mechanism eliminates the drawbacks stated herein by encrypting only a small portion of an entire transmitted frame, while the rest is not subject to traditional encryption but goes through a signaling process (designed transformation) with the plaintext of the portion selected for encryption. We also propose to incorporate error correction coding solely on the small encrypted portion of the data to drastically improve the overall bit-error rate performance while not noticeably increasing the required bit-rate. We focus on validating the signaling-encryption mechanism utilizing Hamming and convolutional error correction coding by conducting an end-to-end system-level simulation-based study. The average probability of bit-error and throughput of the encryption mechanism are evaluated over standard Gaussian and Rayleigh fading-type channels and compared to the ones of the conventional advanced encryption standard (AES).
{"title":"An integrated signaling-encryption mechanism to reduce error propagation in wireless communications: performance analyses","authors":"M. Olama, M. Matalgah, M. Bobrek","doi":"10.1109/CQR.2015.7129081","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129081","url":null,"abstract":"Traditional encryption techniques require packet overhead, produce processing time delay, and suffer from severe quality of service deterioration due to fades and interference in wireless channels. These issues reduce the effective transmission data rate (throughput) considerably in wireless communications, where data rate with limited bandwidth is the main constraint. In this paper, performance evaluation analyses are conducted for an integrated signaling-encryption mechanism that is secure and enables improved throughput and probability of bit-error in wireless channels. This mechanism eliminates the drawbacks stated herein by encrypting only a small portion of an entire transmitted frame, while the rest is not subject to traditional encryption but goes through a signaling process (designed transformation) with the plaintext of the portion selected for encryption. We also propose to incorporate error correction coding solely on the small encrypted portion of the data to drastically improve the overall bit-error rate performance while not noticeably increasing the required bit-rate. We focus on validating the signaling-encryption mechanism utilizing Hamming and convolutional error correction coding by conducting an end-to-end system-level simulation-based study. The average probability of bit-error and throughput of the encryption mechanism are evaluated over standard Gaussian and Rayleigh fading-type channels and compared to the ones of the conventional advanced encryption standard (AES).","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116208074","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129083
D. Papadimitriou, D. Careglio
Facing computational complexity when modeling network reliability by means of parametric models and corresponding statistical methods, in the present study, we apply nonparametric statistical methods, such as the Kaplan-Meier survival probability estimator and the mean cumulative function, to characterize the dynamic properties (in particular, the stability properties) of the Internet routing paths and their relationship with the corresponding forwarding path(s). Providing systematic methodology for quantifying these properties aims at enabling reliability assessment of the Internet connectivity (also referred to as reachability in computer networking). The motivation for studying the dynamic properties (in particular, the stability properties) of the Internet routing paths and their relationship to forwarding paths stems from three main reasons. The first translates the fact that transient but frequent changes in the spatio-temporal properties of routing paths may affect the performance and operating conditions of the corresponding forwarding paths; hence, their reliability. The second reason is that frequent instabilities when observed for the same (subset of) path(s) that can be attributed to a spatially localized portion(s) of the Internet may reveal that the underlying physical topology is more prone to failures; hence, showing limited reliability. The third results from the increasing operational need to provide for a longer term estimation of the Internet routing-forwarding system performance and operating conditions using well-proven statistical analysis accounting for recurrence of events and correlation between instability events.
{"title":"Nonparametric statistical methods to analyze the internet connectivity reliability","authors":"D. Papadimitriou, D. Careglio","doi":"10.1109/CQR.2015.7129083","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129083","url":null,"abstract":"Facing computational complexity when modeling network reliability by means of parametric models and corresponding statistical methods, in the present study, we apply nonparametric statistical methods, such as the Kaplan-Meier survival probability estimator and the mean cumulative function, to characterize the dynamic properties (in particular, the stability properties) of the Internet routing paths and their relationship with the corresponding forwarding path(s). Providing systematic methodology for quantifying these properties aims at enabling reliability assessment of the Internet connectivity (also referred to as reachability in computer networking). The motivation for studying the dynamic properties (in particular, the stability properties) of the Internet routing paths and their relationship to forwarding paths stems from three main reasons. The first translates the fact that transient but frequent changes in the spatio-temporal properties of routing paths may affect the performance and operating conditions of the corresponding forwarding paths; hence, their reliability. The second reason is that frequent instabilities when observed for the same (subset of) path(s) that can be attributed to a spatially localized portion(s) of the Internet may reveal that the underlying physical topology is more prone to failures; hence, showing limited reliability. The third results from the increasing operational need to provide for a longer term estimation of the Internet routing-forwarding system performance and operating conditions using well-proven statistical analysis accounting for recurrence of events and correlation between instability events.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129630834","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129079
Zhipeng Jiang, Wei Zhang, Suixiang Gao, Lei Zhou
LTE is an all IP network. The scheduling in its downlink channels is a key problem. Although many algorithms have been designed and analyzed, the QoS for the users in poor channel conditions are not enough to be ensured sometimes. We design a method to enhance the capacity of the system, which is a modifying strategy available for most existing algorithms. Our intuition is to allocate more resources to the users in poorer channel conditions without declining the QoS of the users in better channel. Simulations show that our strategy can satisfy the QoS for more users.
{"title":"An improving strategy for LTE downlink scheduling algorithms based on QoS requirement","authors":"Zhipeng Jiang, Wei Zhang, Suixiang Gao, Lei Zhou","doi":"10.1109/CQR.2015.7129079","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129079","url":null,"abstract":"LTE is an all IP network. The scheduling in its downlink channels is a key problem. Although many algorithms have been designed and analyzed, the QoS for the users in poor channel conditions are not enough to be ensured sometimes. We design a method to enhance the capacity of the system, which is a modifying strategy available for most existing algorithms. Our intuition is to allocate more resources to the users in poorer channel conditions without declining the QoS of the users in better channel. Simulations show that our strategy can satisfy the QoS for more users.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124658609","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129085
Yusaku Hayamizu, M. Yamamoto
In content oriented application, such as P2P, a user does not care about where content is obtained and a content file can be downloaded from anywhere it is obtained. In some P2P systems, e.g. BitTorrent, a content file is divided into small parts, chunks, and each chunk is downloaded from anywhere. In this many-to-one communication style, one TCP session is set up for each pair of a sender and a receiver. If these sessions go through the same bottleneck link, many-to-one communication might obtain unfairly large throughput. In this paper, we propose a new receiver-driven congestion control for this many-to-one communications. Our proposed congestion control detects bottleneck-sharing flows and clusters them. Window coupling technique is applied for these clustered flows, which enables these flows to obtain fair aggregated throughput. Our simulation results show that our proposed receiver-driven congestion control fairly shares a bottleneck link with regular TCP.
{"title":"Receiver-driven congestion control for content oriented application with multiple sources","authors":"Yusaku Hayamizu, M. Yamamoto","doi":"10.1109/CQR.2015.7129085","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129085","url":null,"abstract":"In content oriented application, such as P2P, a user does not care about where content is obtained and a content file can be downloaded from anywhere it is obtained. In some P2P systems, e.g. BitTorrent, a content file is divided into small parts, chunks, and each chunk is downloaded from anywhere. In this many-to-one communication style, one TCP session is set up for each pair of a sender and a receiver. If these sessions go through the same bottleneck link, many-to-one communication might obtain unfairly large throughput. In this paper, we propose a new receiver-driven congestion control for this many-to-one communications. Our proposed congestion control detects bottleneck-sharing flows and clusters them. Window coupling technique is applied for these clustered flows, which enables these flows to obtain fair aggregated throughput. Our simulation results show that our proposed receiver-driven congestion control fairly shares a bottleneck link with regular TCP.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122470","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129086
Fumiki Uzawa, T. Koyama, K. Mitsuyama, N. Iai, K. Aoki, T. Hiraguri
Hybrid automatic repeat request (HARQ) can make efficient and reliable transmission possible for radio communications. However, in the HARQ scheme, packet control information (PCI), such as HARQ block identifiers (HARQ block ids) in selective repeat ARQ (SR-ARQ), are required and the reduction of PCI overhead is an issue. In particular, type-II HARQ handles a large amount of PCI because it includes the HARQ block ids and sub-block ids. The sub-block id identifies the set of parity bits in the HARQ block of the corresponding sub-block, and is used to combine the sub-blocks. This report proposes a method of PCI reduction suitable for type-II HARQ with SR-ARQ. The method can inform the HARQ block id and sub-block id of each HARQ block by sending only the information on how many HARQ blocks are contained in each 1st, 2nd, 3rd, and 4th transmission group. The estimated size of reduced PCI and simulation results of our TDD communication system confirms that the proposed method greatly reduces PCI and improves data throughput compared to a conventional method.
{"title":"PCI reduction method suitable for type-II HARQ with SR-ARQ","authors":"Fumiki Uzawa, T. Koyama, K. Mitsuyama, N. Iai, K. Aoki, T. Hiraguri","doi":"10.1109/CQR.2015.7129086","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129086","url":null,"abstract":"Hybrid automatic repeat request (HARQ) can make efficient and reliable transmission possible for radio communications. However, in the HARQ scheme, packet control information (PCI), such as HARQ block identifiers (HARQ block ids) in selective repeat ARQ (SR-ARQ), are required and the reduction of PCI overhead is an issue. In particular, type-II HARQ handles a large amount of PCI because it includes the HARQ block ids and sub-block ids. The sub-block id identifies the set of parity bits in the HARQ block of the corresponding sub-block, and is used to combine the sub-blocks. This report proposes a method of PCI reduction suitable for type-II HARQ with SR-ARQ. The method can inform the HARQ block id and sub-block id of each HARQ block by sending only the information on how many HARQ blocks are contained in each 1st, 2nd, 3rd, and 4th transmission group. The estimated size of reduced PCI and simulation results of our TDD communication system confirms that the proposed method greatly reduces PCI and improves data throughput compared to a conventional method.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115637504","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}
Pub Date : 2015-05-11DOI: 10.1109/CQR.2015.7129084
Bo Chen, Nishant Pattanaik, A. Goulart, K. Butler-Purry, D. Kundur
To understand security vulnerabilities of communication protocols used in power systems, a real-time framework can be developed to conduct vulnerability studies. The framework should implement protection mechanisms against vulnerabilities and study their effectiveness. In this paper, a realtime cyber-physical framework or test bed is presented. It integrates a real-time power system simulator and a communication system simulator to study the cyber and physical system vulnerabilities in smart power grids. The power system simulation is implemented using the Real-Time Digital Simulator (RTDS®) power grid simulator, with LabVIEW and PXI modules that simulate the supervisory control and data acquisition (SCADA) system and intelligent electronic devices (IEDs). The communication system simulation is implemented using Opnet's System-in-the-Loop (SITL) simulator and open source Linux tools and servers. Results of two cyber-attacks on the Modbus/TCP protocol are discussed and improvements to the test bed for protocol attack detection and mitigation are proposed.
{"title":"Implementing attacks for modbus/TCP protocol in a real-time cyber physical system test bed","authors":"Bo Chen, Nishant Pattanaik, A. Goulart, K. Butler-Purry, D. Kundur","doi":"10.1109/CQR.2015.7129084","DOIUrl":"https://doi.org/10.1109/CQR.2015.7129084","url":null,"abstract":"To understand security vulnerabilities of communication protocols used in power systems, a real-time framework can be developed to conduct vulnerability studies. The framework should implement protection mechanisms against vulnerabilities and study their effectiveness. In this paper, a realtime cyber-physical framework or test bed is presented. It integrates a real-time power system simulator and a communication system simulator to study the cyber and physical system vulnerabilities in smart power grids. The power system simulation is implemented using the Real-Time Digital Simulator (RTDS®) power grid simulator, with LabVIEW and PXI modules that simulate the supervisory control and data acquisition (SCADA) system and intelligent electronic devices (IEDs). The communication system simulation is implemented using Opnet's System-in-the-Loop (SITL) simulator and open source Linux tools and servers. Results of two cyber-attacks on the Modbus/TCP protocol are discussed and improvements to the test bed for protocol attack detection and mitigation are proposed.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060288","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
扫码关注我们
求助内容：
应助结果提醒方式：