{"title":"Optimized audio watermarking scheme with swarm intelligence","authors":"Mustapha Hemis, B. Boudraa, T. Merazi-Meksen","doi":"10.1109/NTIC.2015.7368753","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368753","url":null,"abstract":"This paper presents a digital audio watermarking scheme that can embed imperceptible and robust watermark image into the audio signal. The watermarking process is performed in discrete wavelet domain by applying the QR factorization on 2-D blocks of low frequency part. The watermark bits are inserted in each block by quantizing the coefficients of resulting R matrices. A particle swarm optimization technique is designed to find an optimal quantization step which allows to obtain the highest possible robustness without losing the transparency of the watermark. A series of experiments has been carried out by using different host audio signals under different attacks. Results show that the audio quality is maintained and the watermark remains robust despite various signal processing attacks. In comparison with some recent audio watermarking algorithms, our method presents competitive results in terms of imperceptibility and robustness.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133195181","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":"Handling network merging and partitioning in MANETs","authors":"M. Mutanga, Paul Tarwireyi, M. Adigun","doi":"10.1109/NTIC.2015.7368737","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368737","url":null,"abstract":"In wireless ad-hoc networks, nodes require IP addresses to communicate. The configuration of IP addresses in wireless adhoc networks is accomplished by using distributed algorithms rather than a centralized mechanism such as DHCP. Due to the unpredictable nature of wireless adhoc networks, independently configured networks may come into contact and duplicate IP address may occur. So many approaches have been proposed to handle this problem. After a network merger is detected, the first task is to detect address conflicts and then take corrective action, i.e. some nodes need to acquire new addresses. Even though a number of solutions have been proposed to address this problem, the ability to respond to network dynamics is still a challenge. In this paper, we propose a solution that addressed both the partitioning and the merging of networks. Our network partitioning solution can distinguish between temporary and permanent network partitioning. Simulations were carried out in NS2 and results presented.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124308474","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}
Abdessamed Derder, S. Moussaoui, Abdelwahab Boualouache
{"title":"Target tracking in VANETs using V2V communication with packet load enhancement","authors":"Abdessamed Derder, S. Moussaoui, Abdelwahab Boualouache","doi":"10.1109/NTIC.2015.7368738","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368738","url":null,"abstract":"The vehicular networks represent an innovative and a promising research area. They contribute in the realization of ITS (intelligent transportation systems) to improve road safety and to provide various services and applications for both drivers and passengers. Several applications require knowledge of vehicle's positions such as target tracking. In a previous work, an approach for tracking exploiting V2I and V2V communication has been proposed. However, during the tracking process, a considerable number of messages are generated, which may have negative impacts on VANETs. To overcome this problem, we propose in this paper an improvement for the basic approach. The aim is to reduce the packet load in the network. We conducted a simulative study to compare between the enhanced approach and basic one.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131792719","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":"Trace file analyzer for ad hoc routing protocols simulation with NS2","authors":"Saloua Chettibi, Yacine Labeni, Abdelouahed Boulkour","doi":"10.1109/NTIC.2015.7368739","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368739","url":null,"abstract":"Studying ad hoc routing protocols goes through three fundamental steps, namely: simulation, performance analysis and finally results interpretation. Undoubtedly, NS2 is widely used in ad hoc networks simulation. However, the analysis of generated simulation trace-files often requires the use of different software tools and programing languages. This makes the post simulation phase difficult and inefficient. The main objective of this work is to build an analyzer of simulation tracefiles which calculates several performance metrics and synthesizes them into charts and text files.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"28 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133008654","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":"SWS: A Smart Walk mechanism for resources search in unstructured mobile P2P networks","authors":"M. Seddiki, Mahfoud Benchaiba","doi":"10.1109/NTIC.2015.7368747","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368747","url":null,"abstract":"In this paper, we propose SWS: a Smart Walk mechanism for resources Search in unstructured mobile P2P networks. SWS is a smart version of the conventional Random Walk used for resource search in unstructured P2P networks. The advantage of SWS is the awareness of both the overlay and mobile underlay constraints during the resources search process. The search query is forwarded from peer to peer following three smart conditions concerning each candidate neighbor which are: its physical distance from the current peer, its remaining energy and its ability (which will be defined later). Simulation results show that our mechanism offers good performances comparing to other existing search mechanisms.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123361087","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}
Mohamed Belaoued, S. Mazouzi, S. Noureddine, B. Salah
{"title":"Using Chi-Square test and heuristic search for detecting metamorphic malware","authors":"Mohamed Belaoued, S. Mazouzi, S. Noureddine, B. Salah","doi":"10.1109/NTIC.2015.7368758","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368758","url":null,"abstract":"In this paper, we introduce our method for metamorphic malware detection (i.e. malware variants), which is based on the analysis of the PE (Portable Executable) Header information (PEH). We propose an efficient hybrid Filter-Wrapper feature reduction and selection method that uses a combination of Chi-Square test (KHI2) and the Greedy Hill Climbing search algorithm (GHC). The KHI2 is first applied to reduce the number obtained PEH by removing the irrelevant ones and then the GHC is used to select the most relevant feature subset that will have a high contribution in the decision process. This will improve the accuracy and considerably reducing the processing time. We conducted a set of experimentations on a dataset composed of 10 different malware families, and a set of benign programs. The obtained results were very satisfactory since we were able to achieve more than 97% of accuracy using only 1% of the initially extracted features.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122870997","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":"Similarity measures for Content-Based Dermoscopic Image Retrieval: A comparative study","authors":"Khadidja Belattar, S. Mostefai","doi":"10.1109/NTIC.2015.7368761","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368761","url":null,"abstract":"Similarity measures play crucial role in Content-Based Dermoscopic Image Retrieval (CBDIR). This paper analyses and compares images based respectively on twelve distances namely: Minkowski, Euclidean, Standardized Euclidean, Mahalanobis, Manhattan, Chebychev, Cosine, Canberra, Relative Deviation, Bray-Curtis, Square Chord and Square Chi-Squared measures for CBDIR. Two dermatologists were asked to diagnose 176 skin lesion images in order to classify them. Eight common classes of pigmented skin lesions have been identified, including: Melanoma, Nevus/Mole (ML), Lentigo (Len), Basal Cell Carcinoma (BCC), Seborrhoeic Keratosis (SK), Actinic Keratosis (AK), Angioma (AG) and Dermatofibroma (DF). Color and texture features have been extracted from the segmented skin lesions. Then a series of CBDIR experiments were conducted on the image database. The results indicate that the CBDIR performance is significantly improved by using Canberra and Bray-Curtis distances compared to conventional measures.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210720","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}
Abdelwahab Boualouache, O. Nouali, S. Moussaoui, Abdessamed Derder
{"title":"A BLE-based data collection system for IoT","authors":"Abdelwahab Boualouache, O. Nouali, S. Moussaoui, Abdessamed Derder","doi":"10.1109/NTIC.2015.7368748","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368748","url":null,"abstract":"The data collection is an important phase in the internet of things (IoT). The efficient way to collect data from the IoT environment is one of the challenges for the future of IoT. In this paper, we first design a data collection system for IoT. This system is based Bluetooth Low Energy (BLE) technology to forward the collected data from the data collector to the data gateways and proposes the use of smart phones as data collectors. We also propose a first prototype of this system. This prototype was developed with the help of two well-known open technologies, Arduino (Bluno) and Android. Finally, we evaluate the performances of the proposed system through performing a set of experiments on the developed prototype. The experiments show the feasibility and the applicability of the system especially where distance between the data collector and the data gateway is blow 6 meters. They also demonstrate the energy efficiency of the system.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124997542","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":"Block design multichannel MAC protocol for WSNs","authors":"Ahlem Hannachi, A. Bachir","doi":"10.1109/NTIC.2015.7368745","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368745","url":null,"abstract":"In this paper, we aim at reducing the problems related to the use of a single channel by designing a multichannel protocol that allows interference mitigation, delay and collision reduction, as well as throughput improvement while still reducing idle listening through a receiver-based scheduling of communication slots. We design our protocol in a fully distributed way so that failure of nodes or links could be recovered by local message exchange. To achieve these features, we make use of combinatorial block design theory. Block Design is a system of subsets of a finite set which satisfies certain conditions related to the frequency of appearance of pairs of elements of the set in the subsets of the system. Our proposed solution increases the throughput, and completely eliminates the deafness problem without causing a large overhead. To validate our solution on large scale networks, we developed our proposal on ns3, which has improved features over traditional simulators. Simulation results show that our Latin Square based channel assignment significantly reduces collisions and end to end delay thereby making it suitable for most sensor network applications.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127091781","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":"ARTT taxonomy and cyber-attack Framewok","authors":"Mohamed Amine Douad, Y. Dahmani","doi":"10.1109/NTIC.2015.7368742","DOIUrl":"https://doi.org/10.1109/NTIC.2015.7368742","url":null,"abstract":"The security of computer systems has become essential especially in front of the critical issues of cyber-attacks that can result in the compromise of these systems because any act on a system intends to harm one of the security properties (Confidentiality, Integrity and availability). Studying computer attacks is also essential to design models of attacks aiming to protect against these attacks by modeling the last ones. The development of taxonomies leads to characterize and classify the attacks which lead to understand them. In computer's security taxonomy, we can have two broad categories: cyber-attack's taxonomy and cyber-security taxonomy. In this paper, we propose taxonomy for cyber-attacks according to an attacker vision and the aspect of achieving an attack. This taxonomy is based on 4 dimensions: Attack vector, Result, Type and Target. To generalize our approach, we have used the framework of the Discrete EVent system Specification DEVS. This framework depicts the overall vision of cyber-attacks. To partially validate our work, a simulation is done on a case study of buffer overflow. A DEVS model is described and a simulation is done via this formalism. This case study aims to reinforce our proposal.","PeriodicalId":164080,"journal":{"name":"2015 First International Conference on New Technologies of Information and Communication (NTIC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133439889","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}