{"title":"Selecting the Best Set of Features for Efficient Intrusion Detection in 802.11 Networks","authors":"M. Guennoun, A. Lbekkouri, K. El-Khatib","doi":"10.1109/ICTTA.2008.4530270","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530270","url":null,"abstract":"Intrusion Detection Systems (IDS) are a major line of defense for protecting network resources from illegal penetrations. A common approach in intrusion detection models, specifically in anomaly detection models, is to use classifiers as detectors. Selecting the best set of features is very central to ensure the performance, speed of learning, accuracy, reliability of these detectors and to remove noise from the set of features used to construct the classifiers. In most current systems, the features used for training and testing the intrusion detection systems are basic information related to TCP/IP header, with no considerable attention to the features associated with lower level protocol frames. The resulting detectors were efficient and accurate in detecting network attacks at the network and transport layers, but unfortunately, not capable of detecting 802.11 specific attacks such as de-authentication attack or MAC layer DoS attacks. In this paper, we propose a hybrid model that efficiently selects the optimal set of features in order to detect 802.11 specific intrusions. Our model of feature selection uses the information gain ratio measure as a mean to compute the relevance of each feature and the k-means classifier to select the optimal set of MAC layer features that can improve the accuracy of intrusion detection systems while reducing the learning time of their learning algorithm.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122649159","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 GA Based Real-Time Resource Scheduling Algorithm","authors":"Yiran Gao, C. Phillips, Liwen He","doi":"10.1109/ICTTA.2008.4530199","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530199","url":null,"abstract":"This paper presents a new dynamic virtual private network (VPN) architecture based on a new coordinating component called the dynamic VPN manager (DVM). The DVM manages available network resources and allocates these resources to the users' applications. To achieve this a resource scheduling algorithm is designed to assign the network resources in the dynamic environments. Simulations are carried to study the proposed algorithm's performance. The results show that the scheme is feasible and performs well in dynamic network scenarios, where no knowledge of future events exist, compared with static algorithms which are given complete knowledge of all job arrivals.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122589177","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}
H. Berbia, Faissal El Bouanani, M. Belkasmi, R. Romadi
{"title":"An Enhanced Genetic Algorithm Based Decoder for Linear Codes","authors":"H. Berbia, Faissal El Bouanani, M. Belkasmi, R. Romadi","doi":"10.1109/ICTTA.2008.4530229","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530229","url":null,"abstract":"This paper introduces a new decoder based on genetic algorithms and neural networks for binary linear codes. The search space, in contrast to our previous algorithms which was limited to the codeword space, now covers the whole binary vector space.The neural network is used to favor feasible solution namely codewords. Previous genetic algorithm based decoders [2] require a lot of computing resources when used with large codes. The new decoder eludes a great number of coding operations by using the neural network. This reduces greatly the complexity of the decoder while maintaining comparable performances.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054640","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 Evolution of Small and Medium Enterprise in Digital Business Ecosystem; Accelerating The Evolution and The Need for Web 2.0 and Visualization","authors":"M. Salam, A.L. Steenkamp, F. Khoury","doi":"10.1109/ICTTA.2008.4529983","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4529983","url":null,"abstract":"The pursuit of digital business ecosystem (DBE) means to digitally socialize, collaborate, negotiate, operate and automatically orchestrate business services in an open and self organizing environment. The essence of this paper is to suggest a stage based evolution of Small and Medium Enterprises (SME) added to a list of interrelated techniques and concepts that would accelerate DBE environments evolution. DBE Distributed Knowledge Base (DKB) and Web 2.0, via its breakthrough capabilities (i.e. attractiveness of voluntarily participation, Open API, service mashup [13], social networks, knowledge sharing and more), are the backbone of the suggested techniques.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263197","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":"Developing A Route Navigation System Using Genetic Algorithm","authors":"Sanaa Al-halabi, Sokyna M. Al-Qatawneh, V. Samawi","doi":"10.1109/ICTTA.2008.4529965","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4529965","url":null,"abstract":"Rout planning system is one of the interesting problems for a car navigation system. There could be many possible routes for a driver when a set of origin-destination pair is given. This paper addresses the problem of selecting route to a given start and destination on an actual map under user defined environment (static environment). The proposed solution using genetic algorithm (GA) with variable length chromosomes, i.e. chromosomes size could be dynamic due to path length (number of cities between source and destination). The population size of routes is generated with respect to the chromosome size. Two selection methods are used and compared: tournament selection method and a new suggested selection method based on selecting the best next neighbor. Number of crossover points (1-point and 2- point partitions), and different mutation points (1- point and 2-point partitions) used and tested to study and evaluate the effect and the behavior of these operators on the rout navigation system. Experiments showed that using the suggested route navigation system is quite efficient in calculating an optimal route incase the chromosome length equals the total number of cities in the map (i.e. the database), while when the chromosome size is less than the total number of cities, semi-optimal route is found.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114457396","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":"Efficient Ternary Galois Field Circuit Design Through Carbon Nanotube Technology","authors":"P. Keshavarzian, K. Navi, M. Rafsanjani","doi":"10.1109/ICTTA.2008.4530267","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530267","url":null,"abstract":"Into an era of nanotechnology, molecular devices are becoming promising alternatives to the existing silicon technology. Carbon nanotube field effect transistors (CNFETs) are being extensively studied as possible successors to Silicon MOSFETs. Research has started in the earnest to understand the device physics of CNFETs as well as to explore possible circuit applications. Implementable CNTFET circuits have operational characteristics to approach the advantage of using MVL in voltage mode. In this paper through using of CNTFET characteristics, we present new CNTFET circuit design to implement Efficient ternary Galois Field.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122004758","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":"Simulation of a New Constraint Based Routing Algorithm for Multi-Protocol Label Switching Networks","authors":"M.Z. Al-Ani, F. Al-Naima, S. Amin","doi":"10.1109/ICTTA.2008.4530216","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530216","url":null,"abstract":"This paper presents modeling and simulation for constraint-based routing (CBR) algorithm for multi protocol label switching (MPLS) network which is designed for mapping among any layer-2 protocols and any layer-3 protocols of the OSI model. The MPLS network has the capability of routing with some specific constraints for supporting desired quality of service (QoS). The most important constraint is the demand bandwidth. The efficient routing algorithm should have low percentage of call-setup request blocking, high network utilization and low calculation complexity. There are many previously proposed algorithms such as minimum hop algorithm, widest shortest path algorithm and minimum interference routing algorithm. In this paper, a new algorithm is proposed which is based on the weight calculation of an amount of paths routed over each link in the network. The simulation results show that the proposed algorithm performs better in terms of network utilization, low blocking percentage and low complexity.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122036623","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":"Electroencephalogram Fractral Dimension as a Measure of Depth of Anesthesia","authors":"E. Negahbani, R. Amirfattahi, B. Ahmadi","doi":"10.1109/ICTTA.2008.4530055","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530055","url":null,"abstract":"This paper proposes a combined method including adaptive segmentation and Higuchi fractal dimension (HFD) of electroencephalograms (EEG) to monitor depth of anesthesia (DOA). The EEG data was captured in both ICU and operating room and different anesthetic drugs, including propofol and isoflurane were used. Due to the non- stationary nature of EEG signal, adaptive segmentation methods seem to have better results. The HFD of a single channel EEG was computed through adaptive windowing methods consist of adaptive variance and auto correlation function (ACF) based methods. We have compared the results of fixed and adaptive windowing in different methods of calculating HFD in order to estimate DOA. Prediction probability (P^) was used as a measure of correlation between the predictors and BIS index to evaluate our proposed methods. The results show that HFD increases with increasing BIS index. In ICU, all of the methods reveal better performance than in other groups. In both ICU and operating room, the results indicate no obvious superiority in calculating HFD through adaptive segmentation.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122111470","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. Zein, Y. Kermarrec, Mohamed kawtharany, Eric Le Pors
{"title":"Service composition based on facilitator federation","authors":"O. Zein, Y. Kermarrec, Mohamed kawtharany, Eric Le Pors","doi":"10.1109/ICTTA.2008.4530299","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530299","url":null,"abstract":"In this paper, we present our approach of facilitator federation that allows automatic service composition in distributed systems. We propose a facilitator based on ontologies and knowledge representation that allows clients to discover services without direct interactions with their providers. We extend the functionality of the facilitator to be a composition engine and we show how several facilitators can interact to compose services and to satisfy the client's requests. Our approach can be used in peer-to-peer networks.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128213172","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}
M. Esmaeildoust, H. Mousavi, M. Abbaspour, A. Zakerolhosseini, M. Zamani
{"title":"Hardware Implementation for frequent episode discovery in event sequences","authors":"M. Esmaeildoust, H. Mousavi, M. Abbaspour, A. Zakerolhosseini, M. Zamani","doi":"10.1109/ICTTA.2008.4530370","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530370","url":null,"abstract":"Frequent episode discovery in alerts generated by intrusion detection systems has useful information for administrators. In this paper we consider the process of discovering frequent episodes in event sequences. Counting the frequencies of a set of candidate episodes is the most computationally intensive part of this process. We investigate the frequency counting algorithms and present the hardware implementation for speeding up this part. Our hardware implementation of frequency counts offers a speed-up for finding the frequent of an episode.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647531","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}