Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165208
C. Valliyammai, S. Thamarai Selvi, M. Dinesh Kumar, C. Sakthivel, M. Sunil
Grid resources having heterogeneous architecture being geographically distributed and interconnected via unreliable network media are at the risk of failure which proves the need for an efficient fault monitoring framework. The traditional network fault monitoring systems based on the centralized client/server architecture have limited efficiency and scalability, as the complexity of the network increases, but the mobile agents with specific functions can be dispatched to network nodes and accomplish the assigned tasks. The mobile agent based model provides efficiency and flexibility in network fault monitoring, since dispatched agents avoid unnecessary traffic overheads due to frequent data transmissions between the compute nodes and the head node in a cluster and this model can be used in clusters of any size. The proposed system involves monitoring network related faults in a Grid environment. The network related faults covered in this system are link failure, network traffic overloads and resulting packet losses. Both the link failure and the packet loss due to congestions in the network, prevents the corresponding application from proceeding further which results in delay in job completion. Overload in network traffic which occurs due to congestions caused by packet flow exceeding the maximum network throughput will further result in packet losses and delays in network flow which increase the job completion time. Detecting these network failures can help in better utilization of the resources and timely notification to the user in a Grid environment.
{"title":"Network fault monitoring in Grid","authors":"C. Valliyammai, S. Thamarai Selvi, M. Dinesh Kumar, C. Sakthivel, M. Sunil","doi":"10.1109/ICOAC.2011.6165208","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165208","url":null,"abstract":"Grid resources having heterogeneous architecture being geographically distributed and interconnected via unreliable network media are at the risk of failure which proves the need for an efficient fault monitoring framework. The traditional network fault monitoring systems based on the centralized client/server architecture have limited efficiency and scalability, as the complexity of the network increases, but the mobile agents with specific functions can be dispatched to network nodes and accomplish the assigned tasks. The mobile agent based model provides efficiency and flexibility in network fault monitoring, since dispatched agents avoid unnecessary traffic overheads due to frequent data transmissions between the compute nodes and the head node in a cluster and this model can be used in clusters of any size. The proposed system involves monitoring network related faults in a Grid environment. The network related faults covered in this system are link failure, network traffic overloads and resulting packet losses. Both the link failure and the packet loss due to congestions in the network, prevents the corresponding application from proceeding further which results in delay in job completion. Overload in network traffic which occurs due to congestions caused by packet flow exceeding the maximum network throughput will further result in packet losses and delays in network flow which increase the job completion time. Detecting these network failures can help in better utilization of the resources and timely notification to the user in a Grid environment.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131479571","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165213
R. Ashok, A. Lakshmi, G. D. V. Rani, Madarapu Naresh Kumar
With the rapid progress in the network based applications, the threat of attackers and security threats has grown exponentially. Misleading of data shows many financial losses in all kind of network based environments. Day by day new vulnerabilities are detected in networking and computer products that lead to new emerging problems. One of the new prevention techniques for network threats is Intrusion Detection System (IDS). Feature selection is the major challenging issues in IDS in order to reduce the useless and redundant features among the attributes (e.g. attributes in KDD cup'99, an Intrusion Detection Data Set). In this paper, we aim to reduce feature vector space by calculating distance relation between features with Information Measure (IM) by evaluating the relation between feature and class to enhance the feature selection. Here we incorporate the Information Measure (IM) method with k-means Cluster Triangular Area Based Support Vector Machine (CTSVM) and SVM (Support Vector Machine) classifier to detect intrusion attacks. By dealing with both continuous and discrete attributes, our proposed method extracts best features with high Detection Rate (DR) and False Positive Rate (FPR).
{"title":"Optimized feature selection with k-means clustered triangle SVM for Intrusion Detection","authors":"R. Ashok, A. Lakshmi, G. D. V. Rani, Madarapu Naresh Kumar","doi":"10.1109/ICOAC.2011.6165213","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165213","url":null,"abstract":"With the rapid progress in the network based applications, the threat of attackers and security threats has grown exponentially. Misleading of data shows many financial losses in all kind of network based environments. Day by day new vulnerabilities are detected in networking and computer products that lead to new emerging problems. One of the new prevention techniques for network threats is Intrusion Detection System (IDS). Feature selection is the major challenging issues in IDS in order to reduce the useless and redundant features among the attributes (e.g. attributes in KDD cup'99, an Intrusion Detection Data Set). In this paper, we aim to reduce feature vector space by calculating distance relation between features with Information Measure (IM) by evaluating the relation between feature and class to enhance the feature selection. Here we incorporate the Information Measure (IM) method with k-means Cluster Triangular Area Based Support Vector Machine (CTSVM) and SVM (Support Vector Machine) classifier to detect intrusion attacks. By dealing with both continuous and discrete attributes, our proposed method extracts best features with high Detection Rate (DR) and False Positive Rate (FPR).","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349742","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165198
K. Selvakumar, S. Sendhilkumar
The exponential growth of the Web in last decade makes the largest publically available data source in the world. It integrates text, graphics, audio, video and hypertext. Web users approaches many searching techniques to access the enormous information available on the World Wide Web (WWW). Web search is a process to find information from the pile of documents, Web pages and Web sources. Search engines are playing vital role in Web search process. But the Web users and their essential content may vary among one another. Moreover the users are struggling for obtaining the most significant information while processing their desire content. The main objective of this paper is to provide a comparative analysis of the Web search concepts using Web mining techniques. This paper also highlights the Fuzzy Neural Networks approach in the history for enhancing Web search.
{"title":"Challenges and recent trends in personalized Web search: A survey","authors":"K. Selvakumar, S. Sendhilkumar","doi":"10.1109/ICOAC.2011.6165198","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165198","url":null,"abstract":"The exponential growth of the Web in last decade makes the largest publically available data source in the world. It integrates text, graphics, audio, video and hypertext. Web users approaches many searching techniques to access the enormous information available on the World Wide Web (WWW). Web search is a process to find information from the pile of documents, Web pages and Web sources. Search engines are playing vital role in Web search process. But the Web users and their essential content may vary among one another. Moreover the users are struggling for obtaining the most significant information while processing their desire content. The main objective of this paper is to provide a comparative analysis of the Web search concepts using Web mining techniques. This paper also highlights the Fuzzy Neural Networks approach in the history for enhancing Web search.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132880715","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165229
P. Balamuralidhar, Subrat Kar
Ubiquitous sensing applications often involve the sensor based data collection with a large coverage in space in and time. From a return on investment perspective the value of information needs to be attractive with the cost of infrastructure to acquire it. The role of participative sensing and human centric sensing has been widely explored for collecting and analyzing data for use in social science, environmental and health applications. The wide availability of smart phones integrated with variety of sensors is becoming platform for people to document a neighborhood, gather evidence, study behaviors and is accelerating the pace of exploration in new application areas. Many of the current applications involve the monitoring of public spaces involving the participation of citizen in general. Participative surveillance is an application that can bring substantial social benefit. There are many challenges in effectively deploying such applications. It includes the privacy issues, trustworthiness of the data, human factors that affect the quality of sensing, variability of devices, enrolling and motivating participants, and a sustainable business model. Further it should be supported with a sound framework for deployment where the participant has control over data, transparency in data handling and intuitive user interface supporting multi-modal interactions. This presentation will discuss the above aspects with a few illustrative use case scenarios.
{"title":"Keynote speaker I: Ubiquitous sensing","authors":"P. Balamuralidhar, Subrat Kar","doi":"10.1109/ICOAC.2011.6165229","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165229","url":null,"abstract":"Ubiquitous sensing applications often involve the sensor based data collection with a large coverage in space in and time. From a return on investment perspective the value of information needs to be attractive with the cost of infrastructure to acquire it. The role of participative sensing and human centric sensing has been widely explored for collecting and analyzing data for use in social science, environmental and health applications. The wide availability of smart phones integrated with variety of sensors is becoming platform for people to document a neighborhood, gather evidence, study behaviors and is accelerating the pace of exploration in new application areas. Many of the current applications involve the monitoring of public spaces involving the participation of citizen in general. Participative surveillance is an application that can bring substantial social benefit. There are many challenges in effectively deploying such applications. It includes the privacy issues, trustworthiness of the data, human factors that affect the quality of sensing, variability of devices, enrolling and motivating participants, and a sustainable business model. Further it should be supported with a sound framework for deployment where the participant has control over data, transparency in data handling and intuitive user interface supporting multi-modal interactions. This presentation will discuss the above aspects with a few illustrative use case scenarios.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114042597","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165187
K. Senthilkumar, R. Ramadoss
The number of electronic control units (ECUs) in modern vehicles has continuously increased in last few decades. In addition, advanced functionalities antilock braking systems, adaptive cruise control and climate control put higher computational demand on ECUs, which further increases the design complexity of automotive control systems. Multicore processors having multiple processing units are integrated on a single chip, have emerged to be the main computing controllers not only for high-end servers but also for embedded control systems. Using multicore processors, more centralized architecture designs can be adopted for automotive control systems. The recent initiative on AUTOmotive Open System ARchitecture (AUTOSAR) has established several standards for automotive software and hardware designs, which include guidelines for designing centralized architecture with multicore ECUs for automotive control systems. With AUTOSAR, it is expected that computational control tasks of different functions can share one ECU or run on any ECU connected with in-vehicle network like CAN and FlexRay. Also, In this paper, we describe some key analytical components that together characterize the hierarchical bus structures composed of FlexRay, CANbus and LINbus. Our analysis shows that the practical constraints imposed by standards such as AUTOSAR can lead to higher levels of schedulable resource utilization. This reduces both the overall component count and cost, while facilitating easy enhancements.
{"title":"Designing multicore ECU architecture in vehicle networks using AUTOSAR","authors":"K. Senthilkumar, R. Ramadoss","doi":"10.1109/ICOAC.2011.6165187","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165187","url":null,"abstract":"The number of electronic control units (ECUs) in modern vehicles has continuously increased in last few decades. In addition, advanced functionalities antilock braking systems, adaptive cruise control and climate control put higher computational demand on ECUs, which further increases the design complexity of automotive control systems. Multicore processors having multiple processing units are integrated on a single chip, have emerged to be the main computing controllers not only for high-end servers but also for embedded control systems. Using multicore processors, more centralized architecture designs can be adopted for automotive control systems. The recent initiative on AUTOmotive Open System ARchitecture (AUTOSAR) has established several standards for automotive software and hardware designs, which include guidelines for designing centralized architecture with multicore ECUs for automotive control systems. With AUTOSAR, it is expected that computational control tasks of different functions can share one ECU or run on any ECU connected with in-vehicle network like CAN and FlexRay. Also, In this paper, we describe some key analytical components that together characterize the hierarchical bus structures composed of FlexRay, CANbus and LINbus. Our analysis shows that the practical constraints imposed by standards such as AUTOSAR can lead to higher levels of schedulable resource utilization. This reduces both the overall component count and cost, while facilitating easy enhancements.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"488 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123561259","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165174
P. Telagarapu, B. Biswal, Vijaya Santhi Guntuku
In this paper, we propose an efficient compression/decompression technology and encryption/decryption technology for a multimedia communication system. In order to reduce the volume of multimedia data over wireless channels, data compression techniques are widely used. Discrete cosine transform (DCT) is one of the major compression Scheme. Hence, we present Dynamic bit-width adaptation scheme in discrete cosine transform (DCT) as an efficient compression technique. We select the appropriate operand bit widths that achieve significant reduction of power consumption. It is essential to protect the confidential image data from unauthorized access for multimedia applications. Hence, in this paper, we present a modification to the Advanced Encryption Standard (MAES) to reflect a high level security and better image encryption. The modification is done by adjusting the Shift Row Transformation.
{"title":"Design and analysis of multimedia communication system","authors":"P. Telagarapu, B. Biswal, Vijaya Santhi Guntuku","doi":"10.1109/ICOAC.2011.6165174","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165174","url":null,"abstract":"In this paper, we propose an efficient compression/decompression technology and encryption/decryption technology for a multimedia communication system. In order to reduce the volume of multimedia data over wireless channels, data compression techniques are widely used. Discrete cosine transform (DCT) is one of the major compression Scheme. Hence, we present Dynamic bit-width adaptation scheme in discrete cosine transform (DCT) as an efficient compression technique. We select the appropriate operand bit widths that achieve significant reduction of power consumption. It is essential to protect the confidential image data from unauthorized access for multimedia applications. Hence, in this paper, we present a modification to the Advanced Encryption Standard (MAES) to reflect a high level security and better image encryption. The modification is done by adjusting the Shift Row Transformation.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120981277","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165175
Prabhavathi M, Rajeshwari R
Target tracking being an important application of Wireless Sensor Networks (WSN), engrossed lot of research across the world among WSN researchers. Node mobility in mobile sensor networks is a challenge that affects several other factors like energy consumption, coverage and connectivity changes etc., asking for a well managed node mobility scheme, balancing the associated trade-offs. In spite of the amount of research that goes in to this field there is a demanding need for works which concentrate on both the tracking quality as well as routing efficiency. The work presents a completely distributed efficient localized target tracking algorithm in a mobile sensor network. This work implements location based clustering and combines the concepts of cluster scheduling and intra cluster node scheduling to achieve reduction in energy consumption and efficiency in tracking. It proposes a new application specific deployment for efficient target detection.
{"title":"Cluster-based mobility management for target tracking in mobile sensor networks","authors":"Prabhavathi M, Rajeshwari R","doi":"10.1109/ICOAC.2011.6165175","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165175","url":null,"abstract":"Target tracking being an important application of Wireless Sensor Networks (WSN), engrossed lot of research across the world among WSN researchers. Node mobility in mobile sensor networks is a challenge that affects several other factors like energy consumption, coverage and connectivity changes etc., asking for a well managed node mobility scheme, balancing the associated trade-offs. In spite of the amount of research that goes in to this field there is a demanding need for works which concentrate on both the tracking quality as well as routing efficiency. The work presents a completely distributed efficient localized target tracking algorithm in a mobile sensor network. This work implements location based clustering and combines the concepts of cluster scheduling and intra cluster node scheduling to achieve reduction in energy consumption and efficiency in tracking. It proposes a new application specific deployment for efficient target detection.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676719","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165184
V. Goswami, P. K. Swain
The forced termination probability is an important measure in the performance evaluation of wireless communication networks. This paper proposes a new handoff queueing scheme that handles the channels reserved for handoff calls depending on the current status of the queue. This mechanism of queuing handoff priority scheme effectively reduces forced termination, at the expense of increased new call blocking probability. An analytical Markov model for the proposed scheme is developed and analyzed. We find that giving priority to handoff calls over new calls would improve the forced termination probability of the system without degrading the number of failed new call attempts. Various performance measures of the proposed scheme such as new call blocking probability, forced termination probability, handoff failure probability, the average waiting times of the queued handoff calls, etc. are described and evaluated. Computational experiences in the form of graphs of the proposed scheme and comparisons with conventional channel reservation schemes are presented.
{"title":"A MAHO based prioritized handoff queueing scheme in cellular networks","authors":"V. Goswami, P. K. Swain","doi":"10.1109/ICOAC.2011.6165184","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165184","url":null,"abstract":"The forced termination probability is an important measure in the performance evaluation of wireless communication networks. This paper proposes a new handoff queueing scheme that handles the channels reserved for handoff calls depending on the current status of the queue. This mechanism of queuing handoff priority scheme effectively reduces forced termination, at the expense of increased new call blocking probability. An analytical Markov model for the proposed scheme is developed and analyzed. We find that giving priority to handoff calls over new calls would improve the forced termination probability of the system without degrading the number of failed new call attempts. Various performance measures of the proposed scheme such as new call blocking probability, forced termination probability, handoff failure probability, the average waiting times of the queued handoff calls, etc. are described and evaluated. Computational experiences in the form of graphs of the proposed scheme and comparisons with conventional channel reservation schemes are presented.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127431040","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165155
B. Vijayalakshmi
The three critical resources in any cluster based Wireless Sensor Networks (WSN) are Sensor Nodes (SN), Cluster Head (CH) and Base Station (BS). The main job of Cluster Head is to send all the aggregated data collected from multiple sensor Nodes to the Base Station. But before sending the data, the Cluster Head must be perfectly sure about the actual identity of Base Station. If any intruder acts as Base Station and receives the aggregated data the entire security of the network is spoiled. To avoid this, the authenticity of the base station needs to be checked by cluster head before sending any data. Many asymmetric authentication techniques like digital signatures are difficult to implement in resource constraint sensor Nodes. A zero-knowledge proof protocol is a powerful cryptographic system that can be applied in many cryptographic applications and operations such as identification, authentication, key exchange and others, but many of the existing zero knowledge proof of identity involves exponential calculations which are not suitable for WSN. To overcome the limitations of the existing techniques, the proposed protocol provides Zero knowledge proof identity using congruence equations. Here, Triplet simultaneous linear congruence equations are used to subdivide a whole secret into three shares. A part of a secret is used as identity of the base station and stored in it. The Base Station won't reveal the part of secret stored in it to the Cluster Head but the Cluster Head confirms the true identity without getting the actual secret from Base Station. In this scheme, the Cluster Heads need to solve only congruence equations which need only limited computation and memory. When the proposed protocol is compared with existing protocols it shows that it provide instant authentication, with minimum memory utilization and withstand many attacks.
{"title":"A zero-knowledge authentication for Wireless Sensor Networks based on congruence","authors":"B. Vijayalakshmi","doi":"10.1109/ICOAC.2011.6165155","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165155","url":null,"abstract":"The three critical resources in any cluster based Wireless Sensor Networks (WSN) are Sensor Nodes (SN), Cluster Head (CH) and Base Station (BS). The main job of Cluster Head is to send all the aggregated data collected from multiple sensor Nodes to the Base Station. But before sending the data, the Cluster Head must be perfectly sure about the actual identity of Base Station. If any intruder acts as Base Station and receives the aggregated data the entire security of the network is spoiled. To avoid this, the authenticity of the base station needs to be checked by cluster head before sending any data. Many asymmetric authentication techniques like digital signatures are difficult to implement in resource constraint sensor Nodes. A zero-knowledge proof protocol is a powerful cryptographic system that can be applied in many cryptographic applications and operations such as identification, authentication, key exchange and others, but many of the existing zero knowledge proof of identity involves exponential calculations which are not suitable for WSN. To overcome the limitations of the existing techniques, the proposed protocol provides Zero knowledge proof identity using congruence equations. Here, Triplet simultaneous linear congruence equations are used to subdivide a whole secret into three shares. A part of a secret is used as identity of the base station and stored in it. The Base Station won't reveal the part of secret stored in it to the Cluster Head but the Cluster Head confirms the true identity without getting the actual secret from Base Station. In this scheme, the Cluster Heads need to solve only congruence equations which need only limited computation and memory. When the proposed protocol is compared with existing protocols it shows that it provide instant authentication, with minimum memory utilization and withstand many attacks.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"88 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126309000","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165158
D. E. Dekson, E. Suresh
This work presents the architecture of an adaptive learning environment to take care of the personal learning needs of the learners. The adaptive content delivery is based on the learning styles of the learners. The system uses the VARK(Visual-Auditory-Reading-Kinesthetic) learning style model. Based on the learning style model different forms of content are delivered to the learners to keep them in the active stage of learning. Apart from this the system also implements an innovative feature called the mind map feature, where learners can represent their own way of learning and remembering concepts and ideas generated during the learning process. As a whole the system takes care of all the personal learning needs of the learner. This system is named as the AIEPAL (Adaptive and Intelligent E-Portfolio Architecture for Learning).
这项工作提出了一个自适应学习环境的架构，以照顾学习者的个人学习需求。自适应的内容传递基于学习者的学习风格。该系统采用VARK(视觉-听觉-阅读-动觉)学习模式。在学习风格模型的基础上，将不同形式的内容传递给学习者，使其处于学习的主动阶段。除此之外，该系统还实现了一个名为思维导图的创新功能，学习者可以在其中表示自己的学习方式和记忆在学习过程中产生的概念和想法。作为一个整体，该系统照顾到学习者的所有个人学习需求。该系统被命名为AIEPAL (Adaptive and Intelligent E-Portfolio Architecture for Learning)。
{"title":"Learner centered Adaptive and Intelligent E-Portfolio Architecture for Learning (AIEPAL)","authors":"D. E. Dekson, E. Suresh","doi":"10.1109/ICOAC.2011.6165158","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165158","url":null,"abstract":"This work presents the architecture of an adaptive learning environment to take care of the personal learning needs of the learners. The adaptive content delivery is based on the learning styles of the learners. The system uses the VARK(Visual-Auditory-Reading-Kinesthetic) learning style model. Based on the learning style model different forms of content are delivered to the learners to keep them in the active stage of learning. Apart from this the system also implements an innovative feature called the mind map feature, where learners can represent their own way of learning and remembering concepts and ideas generated during the learning process. As a whole the system takes care of all the personal learning needs of the learner. This system is named as the AIEPAL (Adaptive and Intelligent E-Portfolio Architecture for Learning).","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116673648","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
扫码关注我们
求助内容：
应助结果提醒方式：