Pub Date : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866759
A. A. Sahrab, I. Marghescu
Multiple-Input Multiple-Output (MIMO) systems offer considerable increase in data throughput and link range without additional bandwidth or transmit power by using several antennas at transmitter and receiver to improve wireless communication system performance. At the same time, Orthogonal Frequency Division Multiplexing (OFDM) has becoming a very popular multi-carrier modulation technique for transmission of signals over wireless channels. OFDM eliminate Inter-Symbol-Interference (ISI) and allows the bandwidth of subcarriers to overlap without Inter Carrier Interference (ICI). A MIMO-OFDM modulation technique can achieve reliable high data rate transmission over broadband wireless channels. This paper deals with the analysis of a MIMO-OFDM system by using a MATLAB program. The performance of the system is evaluated on the basis of Bit Error Rate (BER) and Minimum Mean Square Error (MMSE) level.
{"title":"MIMO-OFDM: Maximum diversity using maximum likelihood detector","authors":"A. A. Sahrab, I. Marghescu","doi":"10.1109/ICCOMM.2014.6866759","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866759","url":null,"abstract":"Multiple-Input Multiple-Output (MIMO) systems offer considerable increase in data throughput and link range without additional bandwidth or transmit power by using several antennas at transmitter and receiver to improve wireless communication system performance. At the same time, Orthogonal Frequency Division Multiplexing (OFDM) has becoming a very popular multi-carrier modulation technique for transmission of signals over wireless channels. OFDM eliminate Inter-Symbol-Interference (ISI) and allows the bandwidth of subcarriers to overlap without Inter Carrier Interference (ICI). A MIMO-OFDM modulation technique can achieve reliable high data rate transmission over broadband wireless channels. This paper deals with the analysis of a MIMO-OFDM system by using a MATLAB program. The performance of the system is evaluated on the basis of Bit Error Rate (BER) and Minimum Mean Square Error (MMSE) level.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928619","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866688
O. Avadanei, M. Banciu, L. Nedelcu
The aim of the paper is to identify the modes that can be excited by a wide microstrip line, in a cylindrical DRA situated symmetrically above it, to study the radiating performances of these modes and to present their radiating patterns. We managed to identify thirteen high-order modes; among these modes, four of them: HEM112, TMme311, TEme112, and TEme121 have high transmission performances.
{"title":"High-order modes in high permittivity cylindrical dielectric resonator antenna excited by a wide microstrip line","authors":"O. Avadanei, M. Banciu, L. Nedelcu","doi":"10.1109/ICCOMM.2014.6866688","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866688","url":null,"abstract":"The aim of the paper is to identify the modes that can be excited by a wide microstrip line, in a cylindrical DRA situated symmetrically above it, to study the radiating performances of these modes and to present their radiating patterns. We managed to identify thirteen high-order modes; among these modes, four of them: HEM112, TMme311, TEme112, and TEme121 have high transmission performances.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122438655","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866686
E. Popovici, Liviu A. Stancu, Ovidiu G. Guta, Stefan Arseni, O. Fratu
In this paper we propose several solutions to combine the use of two algorithms for patterns recognition and user validation, both intended to be used in the same time to improve the overall performance of the validation process in a continuous authentication system based on keystroke dynamics. The first one is based on a Multi Layer Perceptron (MLP) Neural Network and the second one relies on a trust algorithm that uses the Bhattacharyya coefficient. For both we present some new evaluation result and conclusions.
{"title":"Combined use of pattern recognition algorithms for keystroke-based continuous authentication system","authors":"E. Popovici, Liviu A. Stancu, Ovidiu G. Guta, Stefan Arseni, O. Fratu","doi":"10.1109/ICCOMM.2014.6866686","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866686","url":null,"abstract":"In this paper we propose several solutions to combine the use of two algorithms for patterns recognition and user validation, both intended to be used in the same time to improve the overall performance of the validation process in a continuous authentication system based on keystroke dynamics. The first one is based on a Multi Layer Perceptron (MLP) Neural Network and the second one relies on a trust algorithm that uses the Bhattacharyya coefficient. For both we present some new evaluation result and conclusions.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114984831","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866717
M. U. Farooq, N. Tapus
In this article, Ad hoc On-demand Distance Vector (AODV) routing protocol is modified to introduce a multiclass on-demand routing mechanism for ad hoc networks. The proposed protocol supports two distinct traffic classes, realtime traffic and non-realtime traffic. The anticipated protocol also takes into account the heterogeneity of the network while making the routing decisions, i.e. the yielded routes may comprise of dissimilar link layers. These modifications are implemented and evaluated on an actual ad hoc network testbed comprising of eight mobile nodes.
{"title":"Multiclass On-demand routing in heterogeneous ad hoc networks","authors":"M. U. Farooq, N. Tapus","doi":"10.1109/ICCOMM.2014.6866717","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866717","url":null,"abstract":"In this article, Ad hoc On-demand Distance Vector (AODV) routing protocol is modified to introduce a multiclass on-demand routing mechanism for ad hoc networks. The proposed protocol supports two distinct traffic classes, realtime traffic and non-realtime traffic. The anticipated protocol also takes into account the heterogeneity of the network while making the routing decisions, i.e. the yielded routes may comprise of dissimilar link layers. These modifications are implemented and evaluated on an actual ad hoc network testbed comprising of eight mobile nodes.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116562324","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866755
Cezar Plesca, Luciana Morogan
Robust image hashing seeks to transform a given input image into a shorter hashed version using a key-dependent non-invertible transform. These hashes find extensive applications in content authentication, image indexing for database search and watermarking. Modern robust hashing algorithms consist of feature extraction, a randomization stage to introduce non-invertibility, followed by quantization and binary encoding to produce a binary hash. This paper describes a novel algorithm for generating an image hash based on Log-Polar transform features. The Log-Polar transform is a part of the Fourier-Mellin transformation, often used in image recognition and registration techniques due to its invariant properties to geometric operations. First, we show that the proposed perceptual hash is resistant to content-preserving operations like compression, noise addition, moderate geometric and filtering. Second, we illustrate the discriminative capability of our hash in order to rapidly distinguish between two perceptually different images. Third, we study the security of our method for image authentication purposes. Finally, we show that the proposed hashing method can provide both excellent security and robustness.
{"title":"Efficient and robust perceptual hashing using log-polar image representation","authors":"Cezar Plesca, Luciana Morogan","doi":"10.1109/ICCOMM.2014.6866755","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866755","url":null,"abstract":"Robust image hashing seeks to transform a given input image into a shorter hashed version using a key-dependent non-invertible transform. These hashes find extensive applications in content authentication, image indexing for database search and watermarking. Modern robust hashing algorithms consist of feature extraction, a randomization stage to introduce non-invertibility, followed by quantization and binary encoding to produce a binary hash. This paper describes a novel algorithm for generating an image hash based on Log-Polar transform features. The Log-Polar transform is a part of the Fourier-Mellin transformation, often used in image recognition and registration techniques due to its invariant properties to geometric operations. First, we show that the proposed perceptual hash is resistant to content-preserving operations like compression, noise addition, moderate geometric and filtering. Second, we illustrate the discriminative capability of our hash in order to rapidly distinguish between two perceptually different images. Third, we study the security of our method for image authentication purposes. Finally, we show that the proposed hashing method can provide both excellent security and robustness.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116712630","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866678
Poussy A. Amr, Nashwa Abdelbaki
IPv4 address exhaustion pushed IETF to create IPv6, the improved substitute of IPv4. The Internet complexity and its enormous size prolong the transition from IPv4 to IPv6 process. This means that both versions will necessarily co-exist. Meanwhile, tunneling appears as a solution trend. The tunneling is a transition technique that is considered temporary till all ISPs would support IPv6. At this paper, we compare the routing convergence of two tunnel types, 6to4 and Manually Configured versus the conventional IPv4 and IPv6 protocols. We analyze the network resources consumed during cold start phase. Bandwidths occupied by routing traffic and convergence duration are measured. Finally we propose tunnel recommendations for different range of network resources.
{"title":"Convergence study of IPv6 tunneling techniques","authors":"Poussy A. Amr, Nashwa Abdelbaki","doi":"10.1109/ICCOMM.2014.6866678","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866678","url":null,"abstract":"IPv4 address exhaustion pushed IETF to create IPv6, the improved substitute of IPv4. The Internet complexity and its enormous size prolong the transition from IPv4 to IPv6 process. This means that both versions will necessarily co-exist. Meanwhile, tunneling appears as a solution trend. The tunneling is a transition technique that is considered temporary till all ISPs would support IPv6. At this paper, we compare the routing convergence of two tunnel types, 6to4 and Manually Configured versus the conventional IPv4 and IPv6 protocols. We analyze the network resources consumed during cold start phase. Bandwidths occupied by routing traffic and convergence duration are measured. Finally we propose tunnel recommendations for different range of network resources.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123525754","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866665
Dalia Battikh, S. E. Assad, B. Bakhache, O. Déforges, Mohamad Khalil
Hiding information in a cover image can be regarded as introducing some stego-noise. These alterations may produce some form of degradation or some unusual characteristics and can then be exploited for the sake of detecting the hidden message. In this paper, we analyze the security of a chaos-based steganographic method, namely the Chaotic Edge adaptive Least Significant Bit Matching Revisited (Chaotic EA-LSBMR). We focus on the universal image steganalysis method which uses the higher-order statistics as features taken from the wavelet multiresolution approach. A Fisher Linear Discriminant classifier is used to classify cover and stego images.
{"title":"Steganalysis of a chaos-based steganographic method","authors":"Dalia Battikh, S. E. Assad, B. Bakhache, O. Déforges, Mohamad Khalil","doi":"10.1109/ICCOMM.2014.6866665","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866665","url":null,"abstract":"Hiding information in a cover image can be regarded as introducing some stego-noise. These alterations may produce some form of degradation or some unusual characteristics and can then be exploited for the sake of detecting the hidden message. In this paper, we analyze the security of a chaos-based steganographic method, namely the Chaotic Edge adaptive Least Significant Bit Matching Revisited (Chaotic EA-LSBMR). We focus on the universal image steganalysis method which uses the higher-order statistics as features taken from the wavelet multiresolution approach. A Fisher Linear Discriminant classifier is used to classify cover and stego images.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123682199","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866707
Adrian Pauna, I. Bica
The wide spread of cyber-attacks made the need of gathering as much information as possible about them, a real demand in nowadays global context. The honeypot systems have become a powerful tool on the way to accomplish that. Researchers have already focused on the development of various honeypot systems but the fact that their administration is time consuming made clear the need of self-adaptive honeypot system capable of learning from their interaction with attackers. This paper presents a self-adaptive honeypot system we are developing that tries to overlap some of the disadvantaged that existing systems have. The proposed honeypot is a medium interaction system developed using Python and it emulates a SSH (Secure Shell) server. The system is capable of interacting with the attackers by means of reinforcement learning algorithms.
{"title":"RASSH - Reinforced adaptive SSH honeypot","authors":"Adrian Pauna, I. Bica","doi":"10.1109/ICCOMM.2014.6866707","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866707","url":null,"abstract":"The wide spread of cyber-attacks made the need of gathering as much information as possible about them, a real demand in nowadays global context. The honeypot systems have become a powerful tool on the way to accomplish that. Researchers have already focused on the development of various honeypot systems but the fact that their administration is time consuming made clear the need of self-adaptive honeypot system capable of learning from their interaction with attackers. This paper presents a self-adaptive honeypot system we are developing that tries to overlap some of the disadvantaged that existing systems have. The proposed honeypot is a medium interaction system developed using Python and it emulates a SSH (Secure Shell) server. The system is capable of interacting with the attackers by means of reinforcement learning algorithms.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125456434","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866764
C. Costache, F. Sandu, T. Balan, A. Nedelcu, A. Covei
Industrial communications are influenced by the emerging Cloud trend, being more and more service-oriented. The access model to on-demand provisioned infrastructure is generic considered hereby as driven by VISA (Virtual Instrumentation Software Architecture) and being an extension of the “Measurement-as-a-Service”. Aggregation of the industrial instrumentation into the Cloud is based on the business execution logic. This paper describes a method for exposing as web services the VISA instruments, and proposes an architecture, based on BPEL (Business Process Execution Language) and ESB (Enterprise Service Bus), to integrate, at business level, the Cloud provisioned elements based on the models of virtual instrumentation extended as IaaS (Infrastructure-as-a-Service).
{"title":"Business integration of industrial communications with Cloud computing","authors":"C. Costache, F. Sandu, T. Balan, A. Nedelcu, A. Covei","doi":"10.1109/ICCOMM.2014.6866764","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866764","url":null,"abstract":"Industrial communications are influenced by the emerging Cloud trend, being more and more service-oriented. The access model to on-demand provisioned infrastructure is generic considered hereby as driven by VISA (Virtual Instrumentation Software Architecture) and being an extension of the “Measurement-as-a-Service”. Aggregation of the industrial instrumentation into the Cloud is based on the business execution logic. This paper describes a method for exposing as web services the VISA instruments, and proposes an architecture, based on BPEL (Business Process Execution Language) and ESB (Enterprise Service Bus), to integrate, at business level, the Cloud provisioned elements based on the models of virtual instrumentation extended as IaaS (Infrastructure-as-a-Service).","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130504950","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 : 2014-05-29DOI: 10.1109/ICCOMM.2014.6866702
T. Costachioiu, R. Constantinescu, M. Datcu
In this paper we focus on the extraction and analysis of long-term satellite image time series, and on applications in urban development monitoring. A Satellite Image Time Series (SITS) comprised of more than 100 data sets, covering a time span of over 25 years is extracted from the current Landsat data archives, Then we create stacks of intra-annual images, which are analyzed by applying a series of direct multidate classifications in order to extract the annual built-up surface. The evolution of the built-up areas is then compared against population dynamics for the studied area.
{"title":"Multitemporal Satellite Image Time Series analysis of urban development in Bucharest and Ilfov areas","authors":"T. Costachioiu, R. Constantinescu, M. Datcu","doi":"10.1109/ICCOMM.2014.6866702","DOIUrl":"https://doi.org/10.1109/ICCOMM.2014.6866702","url":null,"abstract":"In this paper we focus on the extraction and analysis of long-term satellite image time series, and on applications in urban development monitoring. A Satellite Image Time Series (SITS) comprised of more than 100 data sets, covering a time span of over 25 years is extracted from the current Landsat data archives, Then we create stacks of intra-annual images, which are analyzed by applying a series of direct multidate classifications in order to extract the annual built-up surface. The evolution of the built-up areas is then compared against population dynamics for the studied area.","PeriodicalId":366043,"journal":{"name":"2014 10th International Conference on Communications (COMM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124807725","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
扫码关注我们
求助内容：
应助结果提醒方式：