2016. 4th Issue

Table of contents 

Full issue    (22 MB)

The full papers are available only for subscribers - authentication required!  / marked as  



Run Zhang, Yong-Bin Wang, Jin-Yao Yan and Shuang Feng
A Highly Secure Image Watermarking Authentication Algorithm Based on MECDH and AECDSA  
This paper proposes a highly secure DSWT (Discrete Stationary Wavelet Transform) domain image watermarking and digital signature algorithm. The algorithm is based on MECDH (Modified Elliptic Curve Diffie-Hellman) key exchange protocol with more secure elliptic curves and SHA-512 AECDSA (Advanced Elliptic Curve Digital Signature Algorithm), both of which are derived from ECC (Elliptic Curves Cryptography) [1] with with ECDLP known to be very difficult to solve. Meanwhile, the algorithm run on MIRACL (Multiprecision Integer and Rational Arithmetic C/C++ Library) becomes stronger. Theoretical analyses and experimental results show that the proposed algorithm is more secure and practical to protect copyrights of multimedia digital works.

Szilvia Lestyán
Privacy Preserving Data Aggregation over Multi-hop Networks  
We present a novel privacy-preserving data aggregation protocol in wireless networks composed of short-range devices. These devices provide a collaborative service and conduct privacy-preserving computations to obtain the aggregated result of their secret inputs. Our solution uses secure multi-party primitives as well as a new distributed perturbation technique to guarantee strong differential privacy against untrustworthy aggregators.


D. Cymbalak, F. Jakab, M. Michalko, O. Kainz and R. Vapenik
Multi-Camera Broadcasting Model with Automation of Optimal Scene Switching  
Manuscript deals with introduction of model for automatic selection of the scene with the best position of the object of interest in a multi-camera live broadcasts. The novel metric for evaluation of object appearance in multi-camera scenes was proposed and designed following the deep analysis of relevant broadcasting technologies and object tracking methods. Evaluation of object appearance in scene comprises not only from the location and size of the object of interest in the actual frame but also from streaming transmission parameters and the subjective rating from the broadcast recipients. The proposed metrics serve as the basis for the establishment of a system for selecting the best scene with switching in the real-time. Model has been experimentally deployed in two alternative implementations using common and mobile devices. Results were compared with human based broadcast direction. Based on this comparison, the ability to respond to changes in the scene and also to capture the object of interest in the stream was observed. The resulting application of model should be adapted in different fields such as broadcast of conferences, sport events or security systems.
Zdeněk Říha, Dušan Klinec and Vashek Matyáš
Android APK on-the-fly tampering  
The Android operating system is widely deployed and relied upon by both providers and users of various applications. These applications get frequently downloaded from other sources than just Google Play. This makes Android and its application treatment a popular target for attackers. We first present an automated offline attack injecting a previously prepared code to a previously unseen Android application instal- lation file (APK) in an automatic manner. Moreover, we present a novel transparent on-the-fly extension of our attack when a proxy server performs code injection during a new APK download.



IEEE AFRICON 2017 – 2017, Cape Town, South Africa

IEEE SISY 2017 – 2017, Subotica, Serbia

IEEE ConTEL 2017 – 2017, Zagreb, Croatia

IEEE SENSORS 2017 – 2017, Glasgow, Scotland, UK

IEEE GLOBECOM 2017 – 2017, Singapore

IEEE PIMRC 2017 – 2017, Montreal, Canada




Guidelines for our Authors


2016. 3rd Issue

Table of contents 

Full issue   (9 MB)



Chengjie Li, Lidong Zhu and Zhen Zhang
Non-orthogonal Frequency Hopping Signal Underdetermined Blind Source Separation in Time-Frequency Domain 
In this paper, a novel Matching Optimization Algorithm (MOA-algorithm) based on underdetermined blind source separation is proposed for non-orthogonal frequency hopping signal (that is, inner products are not always equal to zero in the same time-frequency point). Compared to traditional methods, the separation method is formulated as matching optimization. In our method, we accomplish the underdetermined blind source separation by computing the Short Time Fourier Transform (STFT) of each observation to get the signal time- frequency distribution, then we formulate the separation problem as matching optimization. In matching optimization, a new cost function is designed to improve the complete separation, and we make negative gradient direction as the steepest descent direction, to verify the proposed method on several simulations. The experimental results demonstrate the effectiveness of the proposed method.

Dmitrii I. Popov and Sergey M. Smolskiy
Estimation of the Clutter Correlation Coefficient in Radar Systems 
Abstract. Estimation of passive interference (so-called, a clutter), which is caused by the point objects, is considered for radar systems. The initial sequence of sampled correlated readings of the point (in distance) target is used as an initial one causing by the antenna beam scanning in a surveillance radar. Basing on the statistical description of this sequence, the likelihood function is introduced and its properties are discussed. An estimation algorithm of the clutter correlation coefficient is synthesized according to the sample of initial correlated readings using the maximal likelihood approach. A structural scheme is given for the correlation coefficient measuring system. The clutter correlation coefficient estimations obtained are asymptotically effective. On the base of the Cramer-Rao equation, the asymptotic formula for a variance of the correlation coefficient is derived, which determines a dependence of estimation accuracy on the value of the correlation coefficient and a number of averaged readings. The formula derived allows provision of necessary estimation accuracy by means of appropriate choice of the averaged reading number. Statistical modeling of the estimation algorithm is described and performed. Modeling results are given, which characterize a dependence of estimation accuracy of the clutter correlation coefficient upon the averaged readings number. A comparison of theoretical and empirical results for estimation accuracy analysis is performed. Statistical modeling results confirm the asymptotical character of the estimation accuracy of the clutter correlation coefficient.

Örs Szabó and Csaba Simon
Round-Robin Bloom Filters Based Load Balancing of Packet Flows 
SDN gives the possibility to design new solutions for flow based load balancers, needed by the handling of quickly growing Internet data, and end user demands. A key element of this can be the Bloom filters and its probabilistic techniques to reduce information processing and networking costs. We selected a Bloom filter variant optimized for low footprint and designed and implemented a flow based load balancer solution. We identified an issue of such load balancers during their initialization phase in case of plug and play deployments. We propose a solution to alleviate this problem and evaluated its performance.

Zeeshan Ahmad and Yaoliang Song
A Novel DOA Estimation Methodology Utilizing Null Steering Antenna Algorithm 
Past decades have seen significant advances in array signal processing and its applications. Direction of Arrival (DOA) estimation is one the most significant application of antenna arrays. This paper presents a new direction-of-arrival (DOA) estimation methodology, where DOA estimation is realized by the nulling antenna algorithm. The new methodology aims to minimize the computational complexity while maintaining high degree of accuracy and resolution. Unlike the existing MUSIC algorithm, the proposed algorithm eliminates the need of estimating the number of signals and the eigenvalue decomposition of covariance matrix, thereby avoiding  performance deterioration caused by incorrect source number estimation. Both the theoretical analysis and computer simulations show that the proposed method outperforms the conventional techniques in estimating DOA of signals while having less computational complexity and high resolution.



Laurens Hobert, Andreas Festag, Ignacio Llatser, Luciano Altomare, Filippo Visintainer and Andras Kovacs
Enhancements of V2X Communication in Support of Cooperative Autonomous Driving 
Two emerging technologies in the automotive domain are autonomous vehicles and V2X communication. Even though these technologies are usually considered separately, their combination enables two key cooperative features: sensing and maneuvering. Cooperative sensing allows vehicles to exchange information gathered from local sensors. Cooperative maneuvering permits inter-vehicle coordination of maneuvers. These features enable the creation of cooperative autonomous vehicles, which may greatly improve traffic safety, efficiency, and driver comfort. The first generation V2X communication systems with the corresponding standards, such as Release 1 from ETSI, have been designed mainly for driver warning applications in the context of road safety and traffic efficiency, and do not target use cases for autonomous driving. This article presents the design of core functionalities for cooperative autonomous driving and addresses the required evolution communication standards in order to support a selected number of autonomous driving use cases. The article describes the targeted use cases, identifies their communication requirements, and analyzes the current V2X communication standards from ETSI for missing features. The result is a set of specifications for the amendment and extension of the standards in support of cooperative autonomous driving.



IEEE ICC'2017 – 2017, Paris, France

IEEE Communications Society - Join our Community!



Guidelines for our Authors

Technical Co-Sponsors





National Cultural Fund, Hungary

National Civil Fund, Hungary