Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285829
B. Bilel, Nikaein Navid
Most of the existing packet-level simulation tools are designed to perform experiments modeling small to medium scale networks. The main reason of this limitation is the amount of available computation power and memory in CPU-based simulation environments. To enable efficient packet-level simulation for large scale scenarios, we introduce a CPU-GPU co-simulation framework where synchronization and experiment design are performed in CPU and node's logical processes are executed in parallel in GPU according to the master/worker model. The framework is developed using the Compute-Unified Device Architecture (CUDA) API and denoted as Cunetsim, CUDA network simulator. In this work, we study the node mobility and connectivity as they are among the most time consuming task when large scale networks are simulated. Simulation results show that Cunetsim runtime remains stable and that it achieves significantly lower runtime than existing approaches when computing mobility and connectivity with no degradation in the accuracy of the results. Further, the connectivity is achieved up to 870 times faster than Sinalgo, which presents the best performances know until now.
{"title":"Cunetsim: A GPU based simulation testbed for large scale mobile networks","authors":"B. Bilel, Nikaein Navid","doi":"10.1109/ICCITECHNOL.2012.6285829","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285829","url":null,"abstract":"Most of the existing packet-level simulation tools are designed to perform experiments modeling small to medium scale networks. The main reason of this limitation is the amount of available computation power and memory in CPU-based simulation environments. To enable efficient packet-level simulation for large scale scenarios, we introduce a CPU-GPU co-simulation framework where synchronization and experiment design are performed in CPU and node's logical processes are executed in parallel in GPU according to the master/worker model. The framework is developed using the Compute-Unified Device Architecture (CUDA) API and denoted as Cunetsim, CUDA network simulator. In this work, we study the node mobility and connectivity as they are among the most time consuming task when large scale networks are simulated. Simulation results show that Cunetsim runtime remains stable and that it achieves significantly lower runtime than existing approaches when computing mobility and connectivity with no degradation in the accuracy of the results. Further, the connectivity is achieved up to 870 times faster than Sinalgo, which presents the best performances know until now.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126623383","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285799
M. Lahby, L. Cherkaoui, A. Adib
The fourth generation (4G) of wireless communications are growing rapidly and are integrating a multitude of radio access technologies (RAT'S). The most important issue of the mobile terminal which is equipped with multiple interfaces is how to select dynamically the best access network in terms of quality of service. To cope with this issue we propose a new technique for network selection decision. This technique combines two multi attribute decision making (MADM) methods such as analytic network process (ANP) to find the differentiate weights of available networks by considering each criterion, and the grey relational analysis (GRA) method to rank the alternatives. To show the effectiveness of our technique we present the simulation results of two traffic classes namely background and streaming.
{"title":"New multi access selection method using differentiated weight of access interface","authors":"M. Lahby, L. Cherkaoui, A. Adib","doi":"10.1109/ICCITECHNOL.2012.6285799","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285799","url":null,"abstract":"The fourth generation (4G) of wireless communications are growing rapidly and are integrating a multitude of radio access technologies (RAT'S). The most important issue of the mobile terminal which is equipped with multiple interfaces is how to select dynamically the best access network in terms of quality of service. To cope with this issue we propose a new technique for network selection decision. This technique combines two multi attribute decision making (MADM) methods such as analytic network process (ANP) to find the differentiate weights of available networks by considering each criterion, and the grey relational analysis (GRA) method to rank the alternatives. To show the effectiveness of our technique we present the simulation results of two traffic classes namely background and streaming.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122470723","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285806
Wentao Fan, N. Bouguila
In this paper, a component splitting and local model selection method is proposed to address the mission of learning and selecting generalized Dirichlet (GD) mixture model with feature selection in an incremental variational way. Under the proposed principled variational framework, we simultaneously estimate, in a closed-form, all the involved parameters and determine the complexity (i.e. both model and features selection) of the GD mixture. The effectiveness of the proposed approach is evaluated using synthetic data as well as real a challenging application involving image categorization.
{"title":"A variational component splitting approach for finite generalized Dirichlet mixture models","authors":"Wentao Fan, N. Bouguila","doi":"10.1109/ICCITECHNOL.2012.6285806","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285806","url":null,"abstract":"In this paper, a component splitting and local model selection method is proposed to address the mission of learning and selecting generalized Dirichlet (GD) mixture model with feature selection in an incremental variational way. Under the proposed principled variational framework, we simultaneously estimate, in a closed-form, all the involved parameters and determine the complexity (i.e. both model and features selection) of the GD mixture. The effectiveness of the proposed approach is evaluated using synthetic data as well as real a challenging application involving image categorization.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520367","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285834
A. Najjar, E. Zagrouba
We propose a flower segmentation schema which overcomes some limits of previous works. Indeed, it does not involve any interaction with the user, or make assumptions based on the domain knowledge. To achieve segmentation, we used OTSU thresholding on Lab color space. The thresholding was performed, separately, on the three component L, a and b, and the best result is selected relatively to the ground truth. The experimentation of the proposed method, performed using the dataset from the Oxford flower collection, make better the results, while consuming less CPU time, than the method proposed by Nilsback and Zisserman[5].
{"title":"Flower image segmentation based on color analysis and a supervised evaluation","authors":"A. Najjar, E. Zagrouba","doi":"10.1109/ICCITECHNOL.2012.6285834","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285834","url":null,"abstract":"We propose a flower segmentation schema which overcomes some limits of previous works. Indeed, it does not involve any interaction with the user, or make assumptions based on the domain knowledge. To achieve segmentation, we used OTSU thresholding on Lab color space. The thresholding was performed, separately, on the three component L, a and b, and the best result is selected relatively to the ground truth. The experimentation of the proposed method, performed using the dataset from the Oxford flower collection, make better the results, while consuming less CPU time, than the method proposed by Nilsback and Zisserman[5].","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130921537","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285784
Besma Hammami, H. Fathallah, H. Rezig
In this paper we present a theoretical simulation that evaluate the performance of direct-sequence optical code-division multiple-access (DS-OCDMA) system, using a novel periodic optical encoder applied to fiber-to-the-X (FTTX) passive optical network (PONs). We investigate the performances in terms of signal to noise ratio (SNR) and bit error rate (BER) in the presence of multiple access interference (MAI) and an additive white Gaussian noise (AWGN). Three groups of parameters were considered in this work: the number of users, the parameters related to the encoder and the parameters of the receiver.
{"title":"Performance analysis of DS-OCDMA using novel multi-level periodic codes","authors":"Besma Hammami, H. Fathallah, H. Rezig","doi":"10.1109/ICCITECHNOL.2012.6285784","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285784","url":null,"abstract":"In this paper we present a theoretical simulation that evaluate the performance of direct-sequence optical code-division multiple-access (DS-OCDMA) system, using a novel periodic optical encoder applied to fiber-to-the-X (FTTX) passive optical network (PONs). We investigate the performances in terms of signal to noise ratio (SNR) and bit error rate (BER) in the presence of multiple access interference (MAI) and an additive white Gaussian noise (AWGN). Three groups of parameters were considered in this work: the number of users, the parameters related to the encoder and the parameters of the receiver.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133363096","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285827
E. D. N. Ndih, S. Cherkaoui
In this paper, we present a PNC-based MAC protocol for VANETs (VPNC-MAC) which makes use of the PNC to ensure efficiency and reliability of periodic beacon transmissions in VANETs. The VPNC-MAC protocol basically consists on two phases: a setup phase and the heartbeat packet exchange phase. During the setup stage, VPNC-MAC uses a location-based OFDMA signaling technique to guarantee a quick and non bandwidth consuming setup. In addition, the packet exchange phase in VPNC-MAC contains two periods of variable and adjustable length. The fist period is a guaranteed time slot period, called the VPNC-MAC session, in which the nodes exchange their packets using PNC. The second period is a contention period reserved to nodes unable to transmit during the VPNC-MAC session. The simulation results shows that the VPNC-MAC protocol outperforms the optimal CSMA (ideal TDMA) in terms of capacity of transmissions supported within a fixed duration, and overall packet reception rate.
{"title":"Reliable broadcasting in VANETs using Physical-Layer Network Coding","authors":"E. D. N. Ndih, S. Cherkaoui","doi":"10.1109/ICCITECHNOL.2012.6285827","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285827","url":null,"abstract":"In this paper, we present a PNC-based MAC protocol for VANETs (VPNC-MAC) which makes use of the PNC to ensure efficiency and reliability of periodic beacon transmissions in VANETs. The VPNC-MAC protocol basically consists on two phases: a setup phase and the heartbeat packet exchange phase. During the setup stage, VPNC-MAC uses a location-based OFDMA signaling technique to guarantee a quick and non bandwidth consuming setup. In addition, the packet exchange phase in VPNC-MAC contains two periods of variable and adjustable length. The fist period is a guaranteed time slot period, called the VPNC-MAC session, in which the nodes exchange their packets using PNC. The second period is a contention period reserved to nodes unable to transmit during the VPNC-MAC session. The simulation results shows that the VPNC-MAC protocol outperforms the optimal CSMA (ideal TDMA) in terms of capacity of transmissions supported within a fixed duration, and overall packet reception rate.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127617554","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285800
Chérifa Boucetta, H. Idoudi, L. Saïdane
The main goal of wireless sensor networks is to monitor a target field and transmit surveillance data to a sink. Therefore, connectivity of the sensor network and full coverage of the monitored area are the most relevant concerns to reach these goals. In order to maintain the connectivity, we propose in this paper an hierarchical model for the wireless sensor networks deployment which consists of dividing sensors in sets of equivalent nodes. We study the effectiveness of the model under different deployment strategies: random, circular and Poisson point process distributions. We investigate the impact of deployment strategies on (i) coverage (ii) connectivity ratio and (iii) the shortest path to sink.
{"title":"Hierarchical modeling of redundancy and paths in wireless sensor networks","authors":"Chérifa Boucetta, H. Idoudi, L. Saïdane","doi":"10.1109/ICCITECHNOL.2012.6285800","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285800","url":null,"abstract":"The main goal of wireless sensor networks is to monitor a target field and transmit surveillance data to a sink. Therefore, connectivity of the sensor network and full coverage of the monitored area are the most relevant concerns to reach these goals. In order to maintain the connectivity, we propose in this paper an hierarchical model for the wireless sensor networks deployment which consists of dividing sensors in sets of equivalent nodes. We study the effectiveness of the model under different deployment strategies: random, circular and Poisson point process distributions. We investigate the impact of deployment strategies on (i) coverage (ii) connectivity ratio and (iii) the shortest path to sink.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127802416","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285811
H. Klabi, K. Mellouli, Sehl Mellouli, Monia Rekik
The purpose of this research is to integrate the trust dimension in the negotiation process. Based on an extensive literature review, we address a combinatory formula that computes trust towards a target agent in a negotiation. This formula includes three elements which are the direct reputation of the target agent, the indirect reputation of the target agent, and the difference of beliefs between the two negotiating agents. These elements are computed through five parameters: the negotiation field, the arrangement weight, the arrangement time, the reliability degree, and the importance degree of the target negotiating agent. The proposed model is applied in the case study of a combinatorial auction between one shipper and a set of carriers. Results show that, compared to bid prices and reputation models, our model lead lower costs in determining the winning carriers.
{"title":"A trust model for a multi-agent negotiation","authors":"H. Klabi, K. Mellouli, Sehl Mellouli, Monia Rekik","doi":"10.1109/ICCITECHNOL.2012.6285811","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285811","url":null,"abstract":"The purpose of this research is to integrate the trust dimension in the negotiation process. Based on an extensive literature review, we address a combinatory formula that computes trust towards a target agent in a negotiation. This formula includes three elements which are the direct reputation of the target agent, the indirect reputation of the target agent, and the difference of beliefs between the two negotiating agents. These elements are computed through five parameters: the negotiation field, the arrangement weight, the arrangement time, the reliability degree, and the importance degree of the target negotiating agent. The proposed model is applied in the case study of a combinatorial auction between one shipper and a set of carriers. Results show that, compared to bid prices and reputation models, our model lead lower costs in determining the winning carriers.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072102","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285805
Ahlem Harchay, L. Cheniti-Belcadhi, R. Braham
Mobile learning occurs along the advent of mobile technologies with the potential to revolutionize methods and approaches of e-Learning. It has changed the way students use for learning and assessing. This type of learning implements the concept of learning anytime and anywhere where learner operates a set of mobile technologies. In this paper, we focus on assessment in a mobile environment. We present an approach to ensure personalized assessment in mobile environment where the management of the context is an important aspect. The assessment activity is offered in a PLE (Personal Learning Environment). Subsequently, we give details of context modeling approach, and propose a formal description of the assessment context.
{"title":"Towards a formal description of mobile personalized assessment","authors":"Ahlem Harchay, L. Cheniti-Belcadhi, R. Braham","doi":"10.1109/ICCITECHNOL.2012.6285805","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285805","url":null,"abstract":"Mobile learning occurs along the advent of mobile technologies with the potential to revolutionize methods and approaches of e-Learning. It has changed the way students use for learning and assessing. This type of learning implements the concept of learning anytime and anywhere where learner operates a set of mobile technologies. In this paper, we focus on assessment in a mobile environment. We present an approach to ensure personalized assessment in mobile environment where the management of the context is an important aspect. The assessment activity is offered in a PLE (Personal Learning Environment). Subsequently, we give details of context modeling approach, and propose a formal description of the assessment context.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125799391","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 : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285774
N. Benhadjyoussef, H. Mestiri, Mohsen Machhout, R. Tourki
Physical implementations of cryptographic algorithms may let relatively side channel information. By analyzing this information leakage, the confidential data, like the cryptographic keys, can be revealed. The correlation power analysis(CPA) is a well-known attack of the cryptographic device. This paper conduces a successful CPA of the Advanced Encryption Standard AES implemented on the Xilinx FPGA with the Side-channel Attack Standard Evaluation Board (SASEBO). The experimental results show that the choice of the power model and the number of power traces can further improve the performance of CPA attack in extracting the correct key.
{"title":"Implementation of CPA analysis against AES design on FPGA","authors":"N. Benhadjyoussef, H. Mestiri, Mohsen Machhout, R. Tourki","doi":"10.1109/ICCITECHNOL.2012.6285774","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285774","url":null,"abstract":"Physical implementations of cryptographic algorithms may let relatively side channel information. By analyzing this information leakage, the confidential data, like the cryptographic keys, can be revealed. The correlation power analysis(CPA) is a well-known attack of the cryptographic device. This paper conduces a successful CPA of the Advanced Encryption Standard AES implemented on the Xilinx FPGA with the Side-channel Attack Standard Evaluation Board (SASEBO). The experimental results show that the choice of the power model and the number of power traces can further improve the performance of CPA attack in extracting the correct key.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123378958","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
扫码关注我们
求助内容：
应助结果提醒方式：