O. Smail, Bernard A. Cousin, Zoulikha Mekkakia Maaza, R. Mekki
{"title":"Energy aware and stable Multipath Routing protocol in clustered wireless ad hoc networks","authors":"O. Smail, Bernard A. Cousin, Zoulikha Mekkakia Maaza, R. Mekki","doi":"10.1109/AICCSA.2014.7073202","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073202","url":null,"abstract":"Ad hoc networks are wireless networks that can operate without infrastructure and without centralized network management; they may contain nodes with limited battery power; hence, energy conservation is a critical requirement in the design of routing protocols for ad hoc networks. Clustering has been proposed as a promising method for simplifying the routing process in mobile ad hoc networks when network size increases. In this paper, we propose an energy-efficient multipath routing protocol, called ES-CMR (Energy aware and Stable Clustered based Multipath Routing protocol), which preserves the residual energy of nodes and increases the network lifetime. To achieve this goal, we use a single objective model to select energy-efficient paths with stable links. Simulation results demonstrate that ES-CMR has better performance in terms of energy consumption, network lifetime, and end-to-end delay.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123979238","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":"CedCom: A high-performance architecture for Big Data applications","authors":"Tanguy Raynaud, R. Haque, H. Aït-Kaci","doi":"10.1109/AICCSA.2014.7073257","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073257","url":null,"abstract":"Distributed architecture is widely used for storing and processing Big Data. Operations on Big Data need first, locating the required data blocks and then, reading them. Data can be located in different types of memories in particular, cache memory, main memory, and secondary memory. Reading data from secondary memory to process Big Data jobs is not an ideal approach especially for high performance applications because, accessing data in secondary devices can be slow for processors. In addition, fetching data from main memory is time consuming due to limited I/O bandwidth. These system level issues are barriers for optimizing performance of Big Data applications. Simply put, for optimizing the application performance, it is not sufficient to have efficient algorithms only, an efficient architecture is needed to provide faster data access by the processors. The need for such an architecture has been documented in the literature, however, the state of the art is still missing an efficient architecture. This paper develops a promising architecture which caches data in main memory. It essentially transforms a main memory into a attraction memory which enables high-speed data access. Also, it enables automatic migration of data blocks and computations across the nodes contained in the clusters. It offers an exchange protocol for fast transfer of data blocks between the different physical nodes and speeds up job processing. The proposed architecture combines the power of Cache-Only Memory Architecture (COMA) and the structural principle of Hadoop.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953689","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}
Walid M. Ibrahim, N. Abuali, A. Taha, H. Hassanein
{"title":"Side localization to increase localization accuracy","authors":"Walid M. Ibrahim, N. Abuali, A. Taha, H. Hassanein","doi":"10.1109/AICCSA.2014.7073284","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073284","url":null,"abstract":"Estimating the location of sensor nodes in wireless sensor networks is a fundamental requirement in a variety of sensing applications. In large scale dense deployments where the area covered by sensor nodes is very large, it is impossible to localize all sensor nodes using single-hop localization techniques. A solution to this problem is to use a multi-hop localization technique to estimate sensor node positions. In some deployments it is required to maintain the anchor nodes at the edge of the simulated area. In previous work, we introduced a new localization scheme that uses distance measurements to localize sensor nodes using a collinear and non-collinear mobile anchor nodes placed at the edge of the sensed area. A Kalman Filter was then used to improve the location accuracy for each node. In this scheme each SN estimated its location from two independent directions then use such information to improve localization accuracy. In this paper, we extend the work to use side localization using hop measurements and fixed anchor node. We also compare the performance of using side localization for both hop and distance measurement. Through simulation we show that side localization using distance and hop measurements outperform DV-Hop and DV-Distance, which are mainstream localization protocols. The weighted mean hop measurement gives higher localization accuracy than using using distance measurement. However, if Kalman Filter is used distance measurement gives better localization accuracy.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127265748","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}
Y. Jararweh, I. Alsmadi, M. Al-Ayyoub, D. Jenerette
{"title":"The analysis of large-scale climate data: Jordan case study","authors":"Y. Jararweh, I. Alsmadi, M. Al-Ayyoub, D. Jenerette","doi":"10.1109/AICCSA.2014.7073211","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073211","url":null,"abstract":"The analysis of large-scale data for the purpose of extracting patterns is applicable to several research fields. In this paper, a dataset of climate related historical data from Jordan is collected. The main focus is to study evolution criteria of weather attributes in Jordan over the evaluated period of time and how it is connected to climate change. Results showed that humidity and dew point weather attributes are going to face a significant increase in the future. Such an increase is expected to have a direct, as well as an indirect impact on human life.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114580869","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}
Haneen Ta'amneh, Ehsan Abu Keshek, M. B. Issa, M. Al-Ayyoub, Y. Jararweh
{"title":"Compression-based arabic text classification","authors":"Haneen Ta'amneh, Ehsan Abu Keshek, M. B. Issa, M. Al-Ayyoub, Y. Jararweh","doi":"10.1109/AICCSA.2014.7073253","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073253","url":null,"abstract":"Text classification (TC) is one of the fundamental problems in text mining. Plenty of works exist on TC with interesting approaches and excellent results; however, most of these works follow a word-based approach for feature extraction. In this work, we are interested in an alternative (byte-based or character-based) approach known as compression-based TC (CTC). CTC has been used for some languages such as English and Portuguese and it is shown to have certain advantages/ disadvantages compared with word-based approaches. This work applies CTC on the Arabic language with the purpose of investigating whether these advantages/disadvantages exists for the Arabic language as well. The results are encouraging as they show the viability of using CTC for Arabic TC.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124499597","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":"Performance evaluation of a parallel dynamic programming algorithm for solving the matrix chain product problem","authors":"Bchira Ben Mabrouk, Hamadi Hasni, Z. Mahjoub","doi":"10.1109/AICCSA.2014.7073186","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073186","url":null,"abstract":"We address in this paper a particular combinatorial optimization problem (COP) namely the matrix chain product problem (MCPP). We particularly consider the parallelization of the dynamic programming algorithm (DPA) for solving the MCPP which is structured in a DO loop nest of depth 3. Our approach is based on a three-phase procedure. The first consists in transforming the DPA into a perfect loop nest (PLN). The second applies a dependency analysis within the initial PLN permitting the determination of the type of each loop (serial or parallel). As to the third phase, it applies on the initial PLN the loop interchange technique in order to increase the parallelism degree. We focus in this paper on an experimental study achieved on a parallel multicore machine that permits to validate our theoretical contribution.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127749221","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":"Fast active contour for object tracking in image sequence","authors":"A. Fekir, Nacéra Benamrane","doi":"10.1109/AICCSA.2014.7073197","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073197","url":null,"abstract":"This paper proposes a segmentation method of 2D image sequence based on active contour or snake. We define energy functional of active contour for detecting object in first frame of sequence. Then, the final snake is used as initial snake in the next frame. Our idea of tracking object is achieved by change of energy functional. Therefore, we substitute balloon energy of first energy functional by new energy. We propose a new formula of this new energy that guarantees fast tracking of movement of snake points. Hence, rapidity of our active contour is based on three notions: proposed initialization, change of energy functional and new motion energy. The efficiency of our approach is shown through some experimental results using three image sequences: synthetic sequence, moving biological cell sequence and echocardiograph image sequence. Its rapidity is justified by runtime comparison with a conventional method.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127945048","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":"P-ETL: Parallel-ETL based on the MapReduce paradigm","authors":"M. Bala, Omar Boussaïd, Z. Alimazighi","doi":"10.1109/AICCSA.2014.7073177","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073177","url":null,"abstract":"Big data is an opportunity in the emergence of novel business applications such as “Big Data Analytics” (BDA). However, these data with non-traditional volumes create a real problem given the capacity constraints of traditional systems. The aim of this paper is to deal with the impact of big data in a decision-support environment and more particularly in the data integration phase. In this context, we developed a platform, called P-ETL (Parallel-ETL) for extracting (E), transforming (T) and loading (L) very large data in a data warehouse (DW). To cope with very large data, ETL processes under our P-ETL platform run on a cluster of computers in parallel way with MapReduce paradigm. The conducted experiment shows mainly that increasing tasks dealing with large data speeds-up the ETL process.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115802237","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":"Cluster validity index based on n-sphere","authors":"Ahmed Ben Said, S. Foufou, M. Abidi","doi":"10.1109/AICCSA.2014.7073191","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073191","url":null,"abstract":"In this paper, we propose a new cluster validity index (CVI) based on geometrical shape. Classic CVIs are based on a combination of separation and compactness measures and may include a measure of overlap between clusters. The proposed CVI combines measures of compactness and over-lap using n-sphere shape. We conducted experiments on several real data sets from the UCI repository and compared the performances of the proposed CVI with widely used CVIs. Results demonstrate that the proposed CVI performs better than the others even when used with complicated data sets.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129492954","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}
Khaled Bakhit, Chantal Chalouhi, Sabine Francis, Sara Mourad, I. Elhajj, A. Kayssi, A. Chehab
{"title":"3G to Wi-Fi offloading on Android","authors":"Khaled Bakhit, Chantal Chalouhi, Sabine Francis, Sara Mourad, I. Elhajj, A. Kayssi, A. Chehab","doi":"10.1109/AICCSA.2014.7073205","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073205","url":null,"abstract":"In this paper, we propose a 3G to Wi-Fi offloading Android-based application. Due to growing demand for a high-speed mobile data connection around the clock, 3G networks begin to face high congestion levels rendering the mobile service providers unable to meet customer expectations. Despite the existence of various solutions, offloading to Wi-Fi proves to be an optimal one as it takes advantage of the resources that Wi-Fi offers in terms of availability and bandwidth. The proposed application measures the download speed of an online page on both Wi-Fi and 3G networks simultaneously. After comparing the results, the device gets switched to the best network. This enables operators to manage their networks more adequately and to improve users experience.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633275","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}