{"title":"Enhancing Security with Intrusion Detection Methods in Multihop MANETs","authors":"G. Rajasekar, T. Parameswaran","doi":"10.18000/IJISAC.50151","DOIUrl":"https://doi.org/10.18000/IJISAC.50151","url":null,"abstract":"1G.M. Rajasekar , 2Mr.T.Parameswaran 1&2 Dept. of CSE, Anna University Regional Centre, Coimbatore, India. 1. graja03@yahoo.com 2. tparameshse@gmail.com Abstract— MANET plays a major role in next generation wireless networking technology. Information exchange in a mobile network without any infrastructure support, such networks are called Adhoc networks. This plays a major platform and used in important applications. A Mobile Adhoc Network is a mobile multihop wireless network, which is capable of autonomous operation. Because of the open medium and wide distribution of nodes make MANET harm to malicious attackers. It is crucial to develop efficient intrusion detection mechanisms to protect MANET from attacks. We present a various types of attacks in the network layer and Intrusion Detection mechanisms are used for protecting multihop MANET. To overcome the attacks, enhancing security method called Hybrid Cryptography and a comparison of various types of attacks with different IDs mechanisms is made. We classify, a single type of attack can be achieved by point detection algorithm (PDA) and range of attacks can be achieved by intrusion detection systems (IDs). Our survey is based on various types of attacks on multihop MANET and investigation of problems caused through malicious nodes by various types of Active and Passive group.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042307","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}
{"title":"A CHANNEL ANALYSIS IN NETWORK SECURITY - USING A COVERT APPROACH","authors":"Raman Kumar, H. Verma","doi":"10.18000/IJISAC.50027","DOIUrl":"https://doi.org/10.18000/IJISAC.50027","url":null,"abstract":"Due to rapid development in the field of communication technologies, security has become the major issue in transformation level data and off-line data. It has further increased the need for online security and authentication for secure information exchange using covert channel and a modified model for data security with data hiding. The objective of this work is to implement a model for network security, using covert channels as a secure environment and covert protocol as a new standard for communication between multi parties but without disclosing the client’s details. The most important services to secure communication system are authentication, integrity and confidentiality. In this paper, we also propose a model for construction of secure network computation. Our construction is in the standard model and does not require random oracles. In order to achieve this goal, we introduce a number of new techniques.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124062891","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}
{"title":"AN INTELLIGENT WAY FOR POWER OPLIMIZATION IS WIRELESS SENSOR NETWORK","authors":"D. Karthik, S. Nagarajan","doi":"10.18000/ijisac.50107","DOIUrl":"https://doi.org/10.18000/ijisac.50107","url":null,"abstract":"","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127753678","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}
{"title":"BI-OBJECTIVE FAULT TOLERANT MODEL FOR WORKFLOW TASK SCHEDULING ON GRIDS","authors":"S. Sridevi, .P GoldaJeyasheeli","doi":"10.18000/IJISAC.50078","DOIUrl":"https://doi.org/10.18000/IJISAC.50078","url":null,"abstract":"The spur of Grid computing is to aggregate the power of widely dispersed resources, and provide non-trivial services to users. In attempts to utilize a diverse set of resources in grids proficiently, scheduling has been made. The primary intention of scheduling is the minimization of application completion time; however, they may lead to the usage of excess and redundant resources. Our algorithm performs the scheduling b y accounting for both completion time and resource usage. Since the performance of grid resources changes dynamically and the accurate estimation of their performance is very difficult, our algorithm incorporates rescheduling to deal with unforeseen performance fluctuations effectively. Also, fault tolerance is an essential part of the grid. In Grid environments, execution failures can occur for various reasons such as network breakdown, failure or non-availability of required resources. Fault tolerance can be achieved in grids by Over provisioning and Check pointing techniques. Since, over provisioning violates the resource usage control, check pointing strategy is implemented in our proposed method.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130829173","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}
{"title":"PRIVATE SEARCHING ON STREAMING DATA BASED ON HOMOMORPHIC ENCRYPTION","authors":"V. Rajalakshmi, Sahaya Auro Stina, S. Santhiya","doi":"10.18000/IJISAC.50162","DOIUrl":"https://doi.org/10.18000/IJISAC.50162","url":null,"abstract":"Theoretical In this paper the issue ought to be taking into account the completely homomorphic encryption to under lying nobility’s system. In the current system quantity of time essential words ought to be utilized. It does not consider magic word recurrence. The main disadvantage of existing system is memoryless. To conquer this arrangement in the proposed work consider magic word recurrence in light of straightforward completely homomorphic encryption. The information can get to just by the client secretly. In this paper information ought to be semantically secure.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132353994","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}
{"title":"COMPUTATIONAL INTELLIGENCE FOR EVALUATION OF ATTACKS IN THE NETWORK","authors":"J. Visumathi, Shunmuganathan K.L","doi":"10.18000/IJISAC.50082","DOIUrl":"https://doi.org/10.18000/IJISAC.50082","url":null,"abstract":"Intrusion detection system(IDS) has recently emerged as an important component for enhancing information system security. Intrusion detection technology is an effective approach to dealing with the problems of network security. In this paper, we present a data mining-based network intrusion detection framework in real time (NIDS). This framework is a distributed architecture consisting of sensor, data preprocessor, extractors of features and detectors. To improve efficiency, our approach adopts a novel FP-tree structure and FP-growth mining method to extract features based on FP-tree without candidate generation. FP-growth is just accord with the system of real- time and updating data frequently as NIDS. We employ DARPA intrusion detection evaluation data set to train and test the feasibility of our proposed method. Experimental results show that the performance is efficient and satisfactory. Finally, the development trend of intrusion detection technology and its currently existing problems are briefly concluded.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132824139","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}
{"title":"THE LATEST TRENDS IN ORGANIZED RETAILING IN INDIA","authors":".L SureshMallya, Prabhu N.R.V","doi":"10.18000/ijisac.50081","DOIUrl":"https://doi.org/10.18000/ijisac.50081","url":null,"abstract":"As we all know that Information Technology is playing a major role for India’s current 9.2 GDP growth. Organized retailing in India is one more example for its open economy. India has been rated as one of the most attractive emerging markets for retail for last two years. It directly impacts only a small minority of Indian population while organized retail affects every single Indian and every sector of Indian society. Organized retailing is growing about 18-20 per cent per annum and new formats are emerging to deliver value to the consumer. The paper throws light on the slow evolution of retail market over the years in India and its contribution for economic growth. Mall is the latest format in the organized retailing; a significant development has occurred in last couple of years due to change in consumer profile and spending Behaviour. In 2003 there were 25 operational malls in the country and the number is forecasted to rise to a 220 by 2006 and 600 by 2010. The likely positive impact of this revolution in different sectors is enumerated. The central idea of this paper is on how this retail boom would help the markets in India.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133145946","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}
{"title":"AN ANALYSIS OF STABILITY OF TRENDS IN MUTUAL FUNDS USING FRACTAL DIMENSION INDEX (FDI) COMPUTED FROM HURST EXPONENTS","authors":"E. Priyadarshini, A. Babu","doi":"10.18000/IJISAC.50076","DOIUrl":"https://doi.org/10.18000/IJISAC.50076","url":null,"abstract":"The general belief is that the NAV’s of the mutual funds take a random and unpredictable path and that it is impossible to outperform the market without assuming additional risk. However, it is possible to outperform the market by carefully selecting entry and exit points for equity investments. Chaos is a nonlinear, dynamic system that appears to be random but is actually a higher form of order. All chaotic systems have a quantifying measurement known as a fractal dimension. The fractal dimension index (FDI) is a tool that applies the principles of chaos theory and fractals. With FDI one can determine the persistence or anti-persistence of any equity or commodity. In this paper we study the data from mutual funds by computing the fractal dimension index. The fractal dimension index is computed from the Hurst exponent, which is computed from Rescaled Range R/S.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848369","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}
{"title":"SOFTWARE EFFORT ESTIMATION USING GENETIC ALGORITHM","authors":"B. MariKumar, P. Latha, E. Praynlin","doi":"10.18000/IJISAC.50142","DOIUrl":"https://doi.org/10.18000/IJISAC.50142","url":null,"abstract":"Mari Kumar B1, Dr. Latha P2, Praynlin E3 1,3Government College of Engineering, Tirunelveli, India 2 Department of Computer Science and Engineering, Anna University 1marikumar106@gmail.com, 2plathamuthuraj@gmail.com, 3praynlin25@gmail.com Abstract A feed forward back propagation neural network is most commonly used to the form of artificial neural network. This algorithm being a correct procedure, it accurate result in the neural network. The estimate of this method as the training of Neural Network is compared with that of genetic algorithm, that the form of based on estimate the software effort estimation. The comparison of two methods is used to accuracy of the software effort estimation.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809738","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}
O. E. Oguike, M. Agu, Echezona, Olayemi Mikail Olaniyi, Arulogun O T Omidiora, A. C. O. Azubogu, C. Ohaneme, S. Ufoaroh, S. U. Nnebe, V. Ramesh, P Subbaiah, Senanu R. Okuboyejo, S. Akor, A. Adewumi, Chiemeke S C Osaghae, Ikhu-Omoregbe N A, Ayo C K, Azeta A A, S. Echezona, F. Aranuwa, O. Oriola, Agu, O. O. Ayannuga, O. N. Lawal, M. Agu, Akanbi Caleb, Olufisoye Adetunji, Abigail Bola, A. Makolo, Dele Oluwade, Osofisan Adenike, K. Clement, Dzidonu, Chiemeke, R. Boateng, Ayo, W. Obiozor, Bloomsburg, J. Effah, Mr Colin Thakur, M. Adegoke, M. Bells, O. Longe, Phd, Universitry Academic, Vi Foreward, L. Olumide, Babatope Phd, M. Afr, J. Comp, Icts
{"title":"Mobility scenario-based Performance Evaluation of Preemptive DSR Protocol for MANET","authors":"O. E. Oguike, M. Agu, Echezona, Olayemi Mikail Olaniyi, Arulogun O T Omidiora, A. C. O. Azubogu, C. Ohaneme, S. Ufoaroh, S. U. Nnebe, V. Ramesh, P Subbaiah, Senanu R. Okuboyejo, S. Akor, A. Adewumi, Chiemeke S C Osaghae, Ikhu-Omoregbe N A, Ayo C K, Azeta A A, S. Echezona, F. Aranuwa, O. Oriola, Agu, O. O. Ayannuga, O. N. Lawal, M. Agu, Akanbi Caleb, Olufisoye Adetunji, Abigail Bola, A. Makolo, Dele Oluwade, Osofisan Adenike, K. Clement, Dzidonu, Chiemeke, R. Boateng, Ayo, W. Obiozor, Bloomsburg, J. Effah, Mr Colin Thakur, M. Adegoke, M. Bells, O. Longe, Phd, Universitry Academic, Vi Foreward, L. Olumide, Babatope Phd, M. Afr, J. Comp, Icts","doi":"10.18000/IJISAC.50123","DOIUrl":"https://doi.org/10.18000/IJISAC.50123","url":null,"abstract":"Ad hoc wireless networks are characterized by multi-hop wireless connectivity, infrastructure less environment and frequently changing topology. To analyze the performance of routing protocols in MANETs in the real world, a scenario based simulation analysis is required since there is a lack of necessary infrastructure for their deployment. Most of the earlier work done in this field have assumed the Random Waypoint model, which fails to capture the realistic movement of the nodes. In this paper, we describe a set of experiments conducted to analyze the performance of the Preemptive DSR routing protocol in a battlefield scenario. BonnMotion Software(Java based) is used to create and analyses mobility scenarios. Initially an explanation of the experimental metrics and the setup is described, followed by the scenarios used for our simulations. The results give an idea of how the Preemptive DSR protocol behaves in the given scenario and helps identify the metrics for optimal performance of the protocol.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127959837","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号
