Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726466
S. Pushpavalli, K. Gandhi
One of the main applications of Wireless Sensor Networks (WSN) is monitoring environmental parameters. The urban areas are covered by Sensor Nodes (SN), which collect data and forward to Mobile Sink (MS). MS travels in variable trajectory and collect data from SN within the range. The existing approaches single hop data transfer from SN that is within the range of MS or the node close to MS are heavily used and hence, their energy is consumed faster. To minimize the overall network overhead, balanced energy expenditure, and prolong network lifetime, we present a model. This is done by selecting a better path of MS such that balancing traffic load in network. Then cluster structure is built and it forwards the data to assigned Cluster Head (CH). CH performs filtering and forwards the filtered data to an end node with sufficient energy, located close to MS. Stochastic programming is used to analyze energy consumption and effectiveness is compared against other methods.
{"title":"Stochastic analysis of data collection using Mobile Sink with fixed and variable trajectories","authors":"S. Pushpavalli, K. Gandhi","doi":"10.1109/ICCCNT.2013.6726466","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726466","url":null,"abstract":"One of the main applications of Wireless Sensor Networks (WSN) is monitoring environmental parameters. The urban areas are covered by Sensor Nodes (SN), which collect data and forward to Mobile Sink (MS). MS travels in variable trajectory and collect data from SN within the range. The existing approaches single hop data transfer from SN that is within the range of MS or the node close to MS are heavily used and hence, their energy is consumed faster. To minimize the overall network overhead, balanced energy expenditure, and prolong network lifetime, we present a model. This is done by selecting a better path of MS such that balancing traffic load in network. Then cluster structure is built and it forwards the data to assigned Cluster Head (CH). CH performs filtering and forwards the filtered data to an end node with sufficient energy, located close to MS. Stochastic programming is used to analyze energy consumption and effectiveness is compared against other methods.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80228438","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726614
Neha Gupta, Anurag Jain, Harsh Kumar Singh
This paper provides on introduction on key strategy for wireless sensor network. Many key Strategy are focus on proposed pair wise based on key strategy technique. Key management Mechanism Provide a security over a Wireless sensor network. Many Scheme are focus on proposing new pair wise based key management strategy. The key management mechanism combines trusted-server and key pre-distribution scheme which meets the security requirement of WSN. Some features of key management strategy we need a lot of energy to communicate a node with each other and increase a network size over a network through a insert a new node. Many Scheme provide a various protocol over a network. The key management Scheme contain a static and dynamic key management Strategy. We use a particular Protocol to select and analysis a accurate performance of sensor network. We use a AODV (ADHOC on demand distance vector routing protocol) Protocol use a network model. AODV Protocol basically use a network layer.
{"title":"A efficient key strategy for prolonging network lifetime in wireless network","authors":"Neha Gupta, Anurag Jain, Harsh Kumar Singh","doi":"10.1109/ICCCNT.2013.6726614","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726614","url":null,"abstract":"This paper provides on introduction on key strategy for wireless sensor network. Many key Strategy are focus on proposed pair wise based on key strategy technique. Key management Mechanism Provide a security over a Wireless sensor network. Many Scheme are focus on proposing new pair wise based key management strategy. The key management mechanism combines trusted-server and key pre-distribution scheme which meets the security requirement of WSN. Some features of key management strategy we need a lot of energy to communicate a node with each other and increase a network size over a network through a insert a new node. Many Scheme provide a various protocol over a network. The key management Scheme contain a static and dynamic key management Strategy. We use a particular Protocol to select and analysis a accurate performance of sensor network. We use a AODV (ADHOC on demand distance vector routing protocol) Protocol use a network model. AODV Protocol basically use a network layer.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80383616","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726468
Pratixa I Mistry, C. Paunwala
Fingerprint is most popular biometric because it can easily used and its features are highly reliable. Many fingerprint matching algorithm have been reported in literatures and in all most algorithms minutiae matching is used. In this paper modified fusion algorithm is proposed. It uses one technique of structure with Delaunay triangle's based, formed by minutiae, and for matched candidate triangle local ridge texture information is extracted using Local Binary Pattern (LBP). Here triangle matching score is given a full weightage and minutiae matching score is given weightage as per requirement. The experimental results show that proposed algorithm is effective and reliable. Algorithm is tested on a DB1 Database of FVC 2004 competition.
{"title":"Fusion fingerprint minutiae matching system for personal identification","authors":"Pratixa I Mistry, C. Paunwala","doi":"10.1109/ICCCNT.2013.6726468","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726468","url":null,"abstract":"Fingerprint is most popular biometric because it can easily used and its features are highly reliable. Many fingerprint matching algorithm have been reported in literatures and in all most algorithms minutiae matching is used. In this paper modified fusion algorithm is proposed. It uses one technique of structure with Delaunay triangle's based, formed by minutiae, and for matched candidate triangle local ridge texture information is extracted using Local Binary Pattern (LBP). Here triangle matching score is given a full weightage and minutiae matching score is given weightage as per requirement. The experimental results show that proposed algorithm is effective and reliable. Algorithm is tested on a DB1 Database of FVC 2004 competition.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79173234","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726778
Uvaraj Subramaniam, Srinivasan Alavandar
The key problems in designing of VLSI circuits are high power consumption, larger area utilization and delay which affect the speed of the computation and also results in power dissipation. In general speed and power are the essential factors in VLSI design. For solving the issues, a new architecture has been proposed. In the proposed system, the two high speed multipliers, Modified booth multiplier (MBM) and the Wallace tree multiplier are hybridized with Carry Look Ahead adder (CLA) and formed a hybridized multiplier which delivers high speed computation with low power consumption. MBM is proposed to reduce the partial products whereas Wallace tree multiplier is accompanied for fast addition and CLA is used for final accumulation. This hybrid multiplier produces better results in terms of speed and power than the conventional designs. The simulation results prove that the hybrid architecture is superior to other multipliers. It is done by using Xilinx tool and it is implemented using FPGA (Field Programmable Gate Array).
{"title":"Low power and high speed computation using hybridized multiplier","authors":"Uvaraj Subramaniam, Srinivasan Alavandar","doi":"10.1109/ICCCNT.2013.6726778","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726778","url":null,"abstract":"The key problems in designing of VLSI circuits are high power consumption, larger area utilization and delay which affect the speed of the computation and also results in power dissipation. In general speed and power are the essential factors in VLSI design. For solving the issues, a new architecture has been proposed. In the proposed system, the two high speed multipliers, Modified booth multiplier (MBM) and the Wallace tree multiplier are hybridized with Carry Look Ahead adder (CLA) and formed a hybridized multiplier which delivers high speed computation with low power consumption. MBM is proposed to reduce the partial products whereas Wallace tree multiplier is accompanied for fast addition and CLA is used for final accumulation. This hybrid multiplier produces better results in terms of speed and power than the conventional designs. The simulation results prove that the hybrid architecture is superior to other multipliers. It is done by using Xilinx tool and it is implemented using FPGA (Field Programmable Gate Array).","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81693711","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726668
Shrikant S. Tangade, S. Manvi
Vehicular Ad hoc NETwork (VANET) is an emerging paradigm in networking. It is a new form of Mobile Ad hoc NETwork (MANET). VANET enables vehicle to vehicle (V2V) communication with the goal of providing road safety and reduce traffic congestion. However, dishonest (malicious) peers (vehicles) in a VANET many send out false information to maximize their own utility. Now a day, VANET has been taken more attention of researchers and automotive industries due to life saving factor. In this paper, we first discuss the applications and unique characteristics of VANETs that distinguish them from MANETs. We also discuss about different attacks and security issues in VANET. We then survey existing trust models in VANETs, and point out their key issues. Based on these studies, we suggest desired properties towards effective trust management in VANETs.
{"title":"A survey on attacks, security and trust management solutions in VANETs","authors":"Shrikant S. Tangade, S. Manvi","doi":"10.1109/ICCCNT.2013.6726668","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726668","url":null,"abstract":"Vehicular Ad hoc NETwork (VANET) is an emerging paradigm in networking. It is a new form of Mobile Ad hoc NETwork (MANET). VANET enables vehicle to vehicle (V2V) communication with the goal of providing road safety and reduce traffic congestion. However, dishonest (malicious) peers (vehicles) in a VANET many send out false information to maximize their own utility. Now a day, VANET has been taken more attention of researchers and automotive industries due to life saving factor. In this paper, we first discuss the applications and unique characteristics of VANETs that distinguish them from MANETs. We also discuss about different attacks and security issues in VANET. We then survey existing trust models in VANETs, and point out their key issues. Based on these studies, we suggest desired properties towards effective trust management in VANETs.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84927337","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726576
P. R. Vincent, E. Sathiyamoorthy
Security is a measure of protecting data during its transmission over a network. In the secured transmission scheme, the message will be encrypted using encryption algorithms which convert it into ciphertext where keys are playing the vital role in encryption and decryption process. Keys will be either secret one or public key. Since public key cryptosystem gain its momentum from its evolution, sharing of public key is equally an important task like secret key sharing. There are various traditional public key sharing techniques are there, still the importance of sharing of public key lies in how fast the keys will be shared. Even though compromising the public key will not do much damage to the whole system as the key will not be used for the decryption process to get back the original plain text, still it is required to share it securely. Because of the slower execution time, other symmetric encryption techniques are preferred over asymmetric techniques in web applications. In cyber world, execution time is the real challenge before the researchers. Our aim here is to bring an effective public key sharing algorithm with lesser execution time.
{"title":"A novel and efficient key sharing technique for web applications","authors":"P. R. Vincent, E. Sathiyamoorthy","doi":"10.1109/ICCCNT.2013.6726576","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726576","url":null,"abstract":"Security is a measure of protecting data during its transmission over a network. In the secured transmission scheme, the message will be encrypted using encryption algorithms which convert it into ciphertext where keys are playing the vital role in encryption and decryption process. Keys will be either secret one or public key. Since public key cryptosystem gain its momentum from its evolution, sharing of public key is equally an important task like secret key sharing. There are various traditional public key sharing techniques are there, still the importance of sharing of public key lies in how fast the keys will be shared. Even though compromising the public key will not do much damage to the whole system as the key will not be used for the decryption process to get back the original plain text, still it is required to share it securely. Because of the slower execution time, other symmetric encryption techniques are preferred over asymmetric techniques in web applications. In cyber world, execution time is the real challenge before the researchers. Our aim here is to bring an effective public key sharing algorithm with lesser execution time.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85123946","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726804
S. Nivetha, R. Asokan, N. Senthilkumaran
Quality of Service support in routing for Mobile Ad hoc Networks (MANETs) is a challenging process because of the limitation on available resources and the dynamic topology. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. A fundamental problem in QoS routing is to find a path between a source and destination that satisfies two or more end-to-end QoS constraints/metrics. Considering more than two metrics involves more computational complexity and it is proved to be NP-complete problem. Stochastic optimization techniques are better solutions for these kinds of problems. A routing model can be chosen either as proactive or reactive. Purely proactive protocols are not optimal for rapidly changing topologies and purely reactive protocols are often inappropriate for relatively static networks. In addition, reactive protocols also suffer with additional delay for real-time traffic. In such scenarios, hybrid routing is proven to improve on purely reactive-routing or purely proactive-routing if most traffic is localized. In order to achieve routing efficiency in such environment, a hybrid routing strategy is proposed which combines the advantages of both proactive and reactive mechanisms. In this paper, a novel QoS routing strategy called Swarm-based Hybrid Routing Protocol (SHRP) based on ant colony optimization is proposed to support the three metrics such as end-to-end delay, bandwidth and hop count. To evaluate the performance of SHRP, a series of simulations are carried out with the simulator QualNet. The simulation results of SHRP are compared with the hybrid routing protocols ZRP and HOPNET. Through the simulation results, it has been showed that SHRP fabricates better performance than ZRP and HOPNET in terms of packet delivery ratio, throughput, end-to-end delay, bandwidth and hopcount.
{"title":"A swarm-based hybrid routing protocol to support multiple Quality of Service (QoS) metrics in mobile ad hoc networks","authors":"S. Nivetha, R. Asokan, N. Senthilkumaran","doi":"10.1109/ICCCNT.2013.6726804","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726804","url":null,"abstract":"Quality of Service support in routing for Mobile Ad hoc Networks (MANETs) is a challenging process because of the limitation on available resources and the dynamic topology. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. A fundamental problem in QoS routing is to find a path between a source and destination that satisfies two or more end-to-end QoS constraints/metrics. Considering more than two metrics involves more computational complexity and it is proved to be NP-complete problem. Stochastic optimization techniques are better solutions for these kinds of problems. A routing model can be chosen either as proactive or reactive. Purely proactive protocols are not optimal for rapidly changing topologies and purely reactive protocols are often inappropriate for relatively static networks. In addition, reactive protocols also suffer with additional delay for real-time traffic. In such scenarios, hybrid routing is proven to improve on purely reactive-routing or purely proactive-routing if most traffic is localized. In order to achieve routing efficiency in such environment, a hybrid routing strategy is proposed which combines the advantages of both proactive and reactive mechanisms. In this paper, a novel QoS routing strategy called Swarm-based Hybrid Routing Protocol (SHRP) based on ant colony optimization is proposed to support the three metrics such as end-to-end delay, bandwidth and hop count. To evaluate the performance of SHRP, a series of simulations are carried out with the simulator QualNet. The simulation results of SHRP are compared with the hybrid routing protocols ZRP and HOPNET. Through the simulation results, it has been showed that SHRP fabricates better performance than ZRP and HOPNET in terms of packet delivery ratio, throughput, end-to-end delay, bandwidth and hopcount.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85463390","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726696
Vahid Haghighatdoost, S. Khorsandi
Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding the received packets is modeled as a queue system and according to the load of a node the required resources (e.g. buffer-size and average service rate).
{"title":"Analysis of required resources for a node using queue system in an ad hoc network","authors":"Vahid Haghighatdoost, S. Khorsandi","doi":"10.1109/ICCCNT.2013.6726696","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726696","url":null,"abstract":"Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding the received packets is modeled as a queue system and according to the load of a node the required resources (e.g. buffer-size and average service rate).","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76897605","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726472
M. Venkateswaran, M. Backialakshmi
Viper Snake algorithm is useful for tracking the target of fighter flight, missiles in radar display system and it is useful for airborne early warning system and attacking system. This algorithm make a radar as intelligent system for tracking the target as a long range and detect the enemy aircraft or missile and set the target position. This attacking the own missile have hit the enemy target and it will inform to base system.
{"title":"Viper Snake intelligent algorithm using missile tracking and attacking system","authors":"M. Venkateswaran, M. Backialakshmi","doi":"10.1109/ICCCNT.2013.6726472","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726472","url":null,"abstract":"Viper Snake algorithm is useful for tracking the target of fighter flight, missiles in radar display system and it is useful for airborne early warning system and attacking system. This algorithm make a radar as intelligent system for tracking the target as a long range and detect the enemy aircraft or missile and set the target position. This attacking the own missile have hit the enemy target and it will inform to base system.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80894577","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 : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726619
T. C. Pramod, N. Sunitha
Supervisory Control and Data Acquisition System (SCADA) is an emerging application for industrial automation. It is being widely used in critical infrastructure for monitoring and controlling the activities. The collaborative environment and interconnectivity of SCADA system needs communications and transmission of sensed real time data like status of machines, breaks and leakages in the system across various devices in the industrial plant. Such real time data provoke security breaches to SCADA systems and results in compromise of availability, integrity, confidentiality and trust relationship between the devices of SCADA systems. As the numbers of deliberate cyber attacks on these systems are increasing, providing a scheme to identify malicious activities and defend the attacks; thereby create secure environment for SCADA systems is an essential task. By considering constraints and efficiency requirements for such networks, we are proposing a scheme that uses Log to identify some malicious activities through continuous monitoring. In Log, we have only prioritized some parameters that help us to detect some vulnerable activities and at node level by using cooperative monitoring the nodes itself takes care of some attacks. In this new approach Log analysis for the identification of malicious activities is made using cluster based architecture. This work also considers the constraints of the SCADA system thereby providing an elegant identification of malicious activities for the current SCADA system.
{"title":"An approach to detect malicious activities in SCADA systems","authors":"T. C. Pramod, N. Sunitha","doi":"10.1109/ICCCNT.2013.6726619","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726619","url":null,"abstract":"Supervisory Control and Data Acquisition System (SCADA) is an emerging application for industrial automation. It is being widely used in critical infrastructure for monitoring and controlling the activities. The collaborative environment and interconnectivity of SCADA system needs communications and transmission of sensed real time data like status of machines, breaks and leakages in the system across various devices in the industrial plant. Such real time data provoke security breaches to SCADA systems and results in compromise of availability, integrity, confidentiality and trust relationship between the devices of SCADA systems. As the numbers of deliberate cyber attacks on these systems are increasing, providing a scheme to identify malicious activities and defend the attacks; thereby create secure environment for SCADA systems is an essential task. By considering constraints and efficiency requirements for such networks, we are proposing a scheme that uses Log to identify some malicious activities through continuous monitoring. In Log, we have only prioritized some parameters that help us to detect some vulnerable activities and at node level by using cooperative monitoring the nodes itself takes care of some attacks. In this new approach Log analysis for the identification of malicious activities is made using cluster based architecture. This work also considers the constraints of the SCADA system thereby providing an elegant identification of malicious activities for the current SCADA system.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80921408","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
扫码关注我们
求助内容：
应助结果提醒方式：