Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514196
P. Gupta, M. Goyal, P. Kumar
Load balancing algorithm is used to distribute the load among various nodes in the distributed system to improve the resource utilization and request response time of the system. These algorithms are mainly used to overcome the situation where a node is heavily loaded and other nodes are idle and because of which the request fails. Many load balancing algorithms are being proposed in distributed and grid environment, but they do not take into consideration the trust and the reliability of the datacenter. In this paper, a suitable trust model is proposed based on the existing model that is suitable for trust value management for the cloud IaaS parameters. Based on the above achieved trust values, a suitable load balancing algorithm is proposed for better distribution of load which further enhance the QOS of services being provided to the users.
{"title":"Trust and reliability based load balancing algorithm for cloud IaaS","authors":"P. Gupta, M. Goyal, P. Kumar","doi":"10.1109/IADCC.2013.6514196","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514196","url":null,"abstract":"Load balancing algorithm is used to distribute the load among various nodes in the distributed system to improve the resource utilization and request response time of the system. These algorithms are mainly used to overcome the situation where a node is heavily loaded and other nodes are idle and because of which the request fails. Many load balancing algorithms are being proposed in distributed and grid environment, but they do not take into consideration the trust and the reliability of the datacenter. In this paper, a suitable trust model is proposed based on the existing model that is suitable for trust value management for the cloud IaaS parameters. Based on the above achieved trust values, a suitable load balancing algorithm is proposed for better distribution of load which further enhance the QOS of services being provided to the users.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123287460","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-05-13DOI: 10.1109/IADCC.2013.6514446
J. Singh
The implementation of basic logic functions based on current-mode techniques is proposed in this paper. By expanding the logic function in power series expression, using adder, sub-tractor and multipliers realization of the basic logic functions are simplified. To illustrate the proposed technique, a CMOS circuit for simultaneous realization of the basic logic functions NOT, AND, OR, NAND and XOR is considered. In this paper digital logic gates are realized at low voltage using analog current-mode techniques. The circuit can be operated with ± 3.1V supplies. PSPICE simulation and experimental results show good agreement with the theoretical predictions.
{"title":"A translinear-based implementation of digital logic gates using only CMOS in current-mode","authors":"J. Singh","doi":"10.1109/IADCC.2013.6514446","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514446","url":null,"abstract":"The implementation of basic logic functions based on current-mode techniques is proposed in this paper. By expanding the logic function in power series expression, using adder, sub-tractor and multipliers realization of the basic logic functions are simplified. To illustrate the proposed technique, a CMOS circuit for simultaneous realization of the basic logic functions NOT, AND, OR, NAND and XOR is considered. In this paper digital logic gates are realized at low voltage using analog current-mode techniques. The circuit can be operated with ± 3.1V supplies. PSPICE simulation and experimental results show good agreement with the theoretical predictions.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123844648","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-05-13DOI: 10.1109/IADCC.2013.6514450
V. Awasthi, K. Raj
Signed digit (SD) number systems provide the possibility of constant-time addition, where interdigit carry propagation is eliminated. In this paper, two classes of parallel adder are surveyed with an asynchronous adder based on their delay, area and power characteristics. With the development of high speed processors, a tradeoff is always required between area and execution time to yield the most suitable implementation with low power consumption. In this paper, we proposed an optimum high speed fast adder algorithm by using signed and hybrid signed digit algorithms. This modified parallel hybrid signed digit (MPHSD) adder has high speed and less area as compare to conventional adders like ripple carry adder and carry lookahead adder. The MPHSD adder require few more configuration logic blocks (CLB's) because of redundant logic to optimize execution time with area and power. A relative merits and demerits is also evaluated by performing a detailed analysis in terms of its cost and performance.
{"title":"Development of optimum addition algorithm using modified parallel hybrid signed digit (MPHSD) technique","authors":"V. Awasthi, K. Raj","doi":"10.1109/IADCC.2013.6514450","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514450","url":null,"abstract":"Signed digit (SD) number systems provide the possibility of constant-time addition, where interdigit carry propagation is eliminated. In this paper, two classes of parallel adder are surveyed with an asynchronous adder based on their delay, area and power characteristics. With the development of high speed processors, a tradeoff is always required between area and execution time to yield the most suitable implementation with low power consumption. In this paper, we proposed an optimum high speed fast adder algorithm by using signed and hybrid signed digit algorithms. This modified parallel hybrid signed digit (MPHSD) adder has high speed and less area as compare to conventional adders like ripple carry adder and carry lookahead adder. The MPHSD adder require few more configuration logic blocks (CLB's) because of redundant logic to optimize execution time with area and power. A relative merits and demerits is also evaluated by performing a detailed analysis in terms of its cost and performance.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127563427","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-05-13DOI: 10.1109/IADCC.2013.6514311
R. Goel, N. Srivastava, H. Chandola, B. Rohilla, S. Srivastava, R. Goudar
With the advancement of time, technology is in its booming phase. In the present era, data whether accessed over internet or the data used by any application needs to be searched effectively and then presented to the naive i.e. end user. Searching plays a vital role in fetching the data. The search by specialization and generalization are in wide practice. The linking and associations between entities are elusive. The result of searching over the entities may engender to obtain multifarious relationships between the entities. So, it is important to make a note of all the important and meaningful relations. There arises a possibility of relationship between two entities which consist of several intermediate entities. So, to distill out the essential paths, user may specify one or more intermediate entities. Learning, optimizing and analyzing existing examples aggrandizes the research scope. Backward search, Bi-Directional search, Bi-Directional breadth first search are such existing examples where relevant path is extracted between source and destination entities. In this paper, we are proposing a qualified bi-directional BFS algorithm to discover the relevant path between the two entities which passes through the intermediate node as specified by the user. Unlike the typical searching methodologies where the all the possible paths between the two entities are discovered and then later, the paths which are relevant to user are filtered out and ranked according to user's requirement, the qualified bi-directional BFS algorithm reduces the time in finding the resultant relevant path between the two entities as it considers only those nodes which contains user specified intermediate node. When the system will be developed and after its empirical evaluation, our proposed algorithm will ameliorate the searching and will also be time efficient.
{"title":"Effective Searching Methodology for finding relevant Paths between nodes using Qualified Bi-Directional BFS algorithm on Graph database","authors":"R. Goel, N. Srivastava, H. Chandola, B. Rohilla, S. Srivastava, R. Goudar","doi":"10.1109/IADCC.2013.6514311","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514311","url":null,"abstract":"With the advancement of time, technology is in its booming phase. In the present era, data whether accessed over internet or the data used by any application needs to be searched effectively and then presented to the naive i.e. end user. Searching plays a vital role in fetching the data. The search by specialization and generalization are in wide practice. The linking and associations between entities are elusive. The result of searching over the entities may engender to obtain multifarious relationships between the entities. So, it is important to make a note of all the important and meaningful relations. There arises a possibility of relationship between two entities which consist of several intermediate entities. So, to distill out the essential paths, user may specify one or more intermediate entities. Learning, optimizing and analyzing existing examples aggrandizes the research scope. Backward search, Bi-Directional search, Bi-Directional breadth first search are such existing examples where relevant path is extracted between source and destination entities. In this paper, we are proposing a qualified bi-directional BFS algorithm to discover the relevant path between the two entities which passes through the intermediate node as specified by the user. Unlike the typical searching methodologies where the all the possible paths between the two entities are discovered and then later, the paths which are relevant to user are filtered out and ranked according to user's requirement, the qualified bi-directional BFS algorithm reduces the time in finding the resultant relevant path between the two entities as it considers only those nodes which contains user specified intermediate node. When the system will be developed and after its empirical evaluation, our proposed algorithm will ameliorate the searching and will also be time efficient.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168017","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-05-13DOI: 10.1109/IADCC.2013.6514329
Lohit Singh, Dilip Kumar Sharma
There is large amount of information available on web, which is hidden from users. This is because such information is not able to be accessed or indexed by traditional search engines. These search engines are only able to crawl information by following hypertext links. The forms which require login or any authorization process can be ignored by them. Hidden web refers to that deepest part of the Web which is not available for traditional Web crawlers. Obtaining the content from Hidden web is a challenging task. Today many web sites are containing pages that are dynamic in nature. This dynamic nature of web pages creates a problem for retrieving information for traditional web crawlers. The effort done to solve the given problem is discussed in brief. Then, a comparative study among the earlier defined architecture, considering various parameters, is also shown. By analyzing above methods a framework is proposed which uses an intelligent agent technology for accessing the hidden web.
{"title":"An approach for accessing data from hidden web using intelligent agent technology","authors":"Lohit Singh, Dilip Kumar Sharma","doi":"10.1109/IADCC.2013.6514329","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514329","url":null,"abstract":"There is large amount of information available on web, which is hidden from users. This is because such information is not able to be accessed or indexed by traditional search engines. These search engines are only able to crawl information by following hypertext links. The forms which require login or any authorization process can be ignored by them. Hidden web refers to that deepest part of the Web which is not available for traditional Web crawlers. Obtaining the content from Hidden web is a challenging task. Today many web sites are containing pages that are dynamic in nature. This dynamic nature of web pages creates a problem for retrieving information for traditional web crawlers. The effort done to solve the given problem is discussed in brief. Then, a comparative study among the earlier defined architecture, considering various parameters, is also shown. By analyzing above methods a framework is proposed which uses an intelligent agent technology for accessing the hidden web.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793568","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-05-13DOI: 10.1109/IADCC.2013.6514279
Bahubali K. Shiragapur, U. Wali, S. Bidwai
Orthogonal Frequency Division Multiplexing (OFDM) is proven technology in modern wireless communication because of its high data rate, more immunity to delay spread. In this paper, we proposed probabilistic threshold Selective Mapping Technique which has low PAPR. The simulation result shows that modified technique has better PAPR reduction performance.
{"title":"Novel techniques to reduce PAPR in OFDM systems using threshold SLM","authors":"Bahubali K. Shiragapur, U. Wali, S. Bidwai","doi":"10.1109/IADCC.2013.6514279","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514279","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is proven technology in modern wireless communication because of its high data rate, more immunity to delay spread. In this paper, we proposed probabilistic threshold Selective Mapping Technique which has low PAPR. The simulation result shows that modified technique has better PAPR reduction performance.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132798967","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-05-13DOI: 10.1109/IADCC.2013.6514420
S. Jagannatha, S. Reddy, T. Kumar, K. R. Kanth
Distributed databases have become necessity in the organizations, as applications are require data locally rather than remote locations. It is important to place data where the applications are required to process data. Data fragmentation and placement becomes a critical performance issue in Distributed Database design that has to be placed at different sites based on the usage of data. The performance of the application would become assessed and improved if it is properly fragment and allocate data during early design stages. In this paper, we proposed an algorithm by performing vertical fragmentation technique for the Distributed Database design for assessing the performance during early design stages. We simulated the algorithm with the case study. We used the proposed algorithm, Attribute Usage Matrix, and Random Number Generation technique for generating the values of Request Query, Arrival of Request, and Query generation. The Simulation results which helps the DBA to assess the performance of the proposed Distributed Database Design. The tool which helps the DBA to select the optimum design.
{"title":"Simulation and analysis of performance prediction in Distributed Database design using OO approach","authors":"S. Jagannatha, S. Reddy, T. Kumar, K. R. Kanth","doi":"10.1109/IADCC.2013.6514420","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514420","url":null,"abstract":"Distributed databases have become necessity in the organizations, as applications are require data locally rather than remote locations. It is important to place data where the applications are required to process data. Data fragmentation and placement becomes a critical performance issue in Distributed Database design that has to be placed at different sites based on the usage of data. The performance of the application would become assessed and improved if it is properly fragment and allocate data during early design stages. In this paper, we proposed an algorithm by performing vertical fragmentation technique for the Distributed Database design for assessing the performance during early design stages. We simulated the algorithm with the case study. We used the proposed algorithm, Attribute Usage Matrix, and Random Number Generation technique for generating the values of Request Query, Arrival of Request, and Query generation. The Simulation results which helps the DBA to assess the performance of the proposed Distributed Database Design. The tool which helps the DBA to select the optimum design.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134154619","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-05-13DOI: 10.1109/IADCC.2013.6514425
K. Rajaram, C. Babu, K. S. Murali Krishnan
The Business Process Management Notation (BPMN) is a standard for business process modeling which provides notation for expressing complex business process semantics in the form of a workflow. The workflow represents an abstraction of real work as a sequence of connected steps. When multiple organizations are involved in offering a service to the consumers, workflow can be used to define the execution order of the processes. Whenever, a workflow involves a composition of multiple services offered by different organizations, the behaviour of any given service may affect other services and the overall reliability of the workflow. A transactional workflow is considered reliable, if its execution satisfies the Failure Atomicity Requirements (FAR). For example, failure of a payment service requires undoing the order processing service that has been completed already. Thus, it is necessary to represent behavioural dependencies among the constituent services of the workflow and generate its FAR which is useful for checking the reliability of the workflow. However, existing workflow generation tools and methodologies do not model the transactional workflows which depict the transactional dependencies among the services involved in the workflows. Towards fulfilling this need, the present work proposes a pattern based modeling approach to construct transactional workflows. This approach involves the identification of FAR of each service in the workflow.
{"title":"TxFlowGen: Generation of Failure Atomic transactional workflows for B2B applications","authors":"K. Rajaram, C. Babu, K. S. Murali Krishnan","doi":"10.1109/IADCC.2013.6514425","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514425","url":null,"abstract":"The Business Process Management Notation (BPMN) is a standard for business process modeling which provides notation for expressing complex business process semantics in the form of a workflow. The workflow represents an abstraction of real work as a sequence of connected steps. When multiple organizations are involved in offering a service to the consumers, workflow can be used to define the execution order of the processes. Whenever, a workflow involves a composition of multiple services offered by different organizations, the behaviour of any given service may affect other services and the overall reliability of the workflow. A transactional workflow is considered reliable, if its execution satisfies the Failure Atomicity Requirements (FAR). For example, failure of a payment service requires undoing the order processing service that has been completed already. Thus, it is necessary to represent behavioural dependencies among the constituent services of the workflow and generate its FAR which is useful for checking the reliability of the workflow. However, existing workflow generation tools and methodologies do not model the transactional workflows which depict the transactional dependencies among the services involved in the workflows. Towards fulfilling this need, the present work proposes a pattern based modeling approach to construct transactional workflows. This approach involves the identification of FAR of each service in the workflow.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133079848","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-05-13DOI: 10.1109/IADCC.2013.6514435
Prateek Khurana, Aprna Tripathi, D. S. Kushwaha
Software maintenance is the most demanding and effort-consuming phase in software development. It has been recognized as being a tedious step in software development process. Two basic activities in software maintenance are the understanding of the system and the assessment of the potential effects of a change. A change to a system, however small, can lead to several accidental effects, which are often not obvious and easy to identify. The main purpose of impact analysis is not only to find the impact set in terms of coding elements but also in terms of effort and resources required for implementing the change so that analysts could analyze the impact of the requested change in terms of budget. The objective of this paper is to find the impact set of the change requested by user or client. By using the impact set we estimate the regression test effort. We illustrate our results with a case study. As the results of this work, we get the impact set having impact element as class names with respect to the requested change, the test suite and the effort required for regression testing after the implementation of the requested change.
{"title":"Change impact analysis and its regression test effort estimation","authors":"Prateek Khurana, Aprna Tripathi, D. S. Kushwaha","doi":"10.1109/IADCC.2013.6514435","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514435","url":null,"abstract":"Software maintenance is the most demanding and effort-consuming phase in software development. It has been recognized as being a tedious step in software development process. Two basic activities in software maintenance are the understanding of the system and the assessment of the potential effects of a change. A change to a system, however small, can lead to several accidental effects, which are often not obvious and easy to identify. The main purpose of impact analysis is not only to find the impact set in terms of coding elements but also in terms of effort and resources required for implementing the change so that analysts could analyze the impact of the requested change in terms of budget. The objective of this paper is to find the impact set of the change requested by user or client. By using the impact set we estimate the regression test effort. We illustrate our results with a case study. As the results of this work, we get the impact set having impact element as class names with respect to the requested change, the test suite and the effort required for regression testing after the implementation of the requested change.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133531675","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-05-13DOI: 10.1109/IADCC.2013.6514283
A. K. Pinnaka, D. Tharashasank, V. S. K. Reddy
Like any other wireless communication settings, mobile ad-hoc network inherits potential dangerous vulnerabilities in network security. A proactive security defense such as intrusion detection system has become a recent research topic in this area. Many intrusion detection models are proposed by the researchers and most of them are promising. How-ever, the problem in mobile ad-hoc environment is that communication and power resources are very limited. Thus, any additional features which need to be implemented in this environment must be as efficient as possible. This paper presents a comparison study between the co-operative detection model and the aggregative detection model to evaluate the efficiency of resource usage. We use a sample case study of disaster recovery operations system to have a real scenario of mobile ad-hoc practice. An experiment is conducted using that scenario under different treatments. The contribution of our work is to suggest an intrusion detection model that is efficient but still reliable to use.
{"title":"Cost performance analysis of intrusion detection system in mobile wireless ad-hoc network","authors":"A. K. Pinnaka, D. Tharashasank, V. S. K. Reddy","doi":"10.1109/IADCC.2013.6514283","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514283","url":null,"abstract":"Like any other wireless communication settings, mobile ad-hoc network inherits potential dangerous vulnerabilities in network security. A proactive security defense such as intrusion detection system has become a recent research topic in this area. Many intrusion detection models are proposed by the researchers and most of them are promising. How-ever, the problem in mobile ad-hoc environment is that communication and power resources are very limited. Thus, any additional features which need to be implemented in this environment must be as efficient as possible. This paper presents a comparison study between the co-operative detection model and the aggregative detection model to evaluate the efficiency of resource usage. We use a sample case study of disaster recovery operations system to have a real scenario of mobile ad-hoc practice. An experiment is conducted using that scenario under different treatments. The contribution of our work is to suggest an intrusion detection model that is efficient but still reliable to use.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133850814","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
扫码关注我们
求助内容：
应助结果提醒方式：