Classifying the Geometric Dilution of Precision of GPS satellites utilizing Bayesian decision theory

The errors resulting from satellite configuration geometry can be determined by Geometric Dilution of Precision (GDOP). Considering optimal satellite subset selection, lower GDOP value usually causes better accuracy in GPS positioning. However, GDOP computation based on complicated transformation and inversion of measurement matrices is a time consuming procedure. This paper deals with classification of GPS GDOP utilizing Parzen estimation based Bayesian decision theory. The conditional probability of each class is estimated by Parzen algorithm. Then based on Bayesian decision theory, the class with maximum posterior probability is selected. The experiments on measured dataset demonstrate that the proposed algorithm lead, in mean classification improvement, to 4.08% in comparison with Support Vector Machine (SVM) and 9.83% in comparison with K-Nearest Neighbour (KNN) classifier. Extra work on feature extraction has been performed based on Principle Component Analysis (PCA). The results demonstrate that the feature extraction approach has best performance respect to all classifiers.     

A robust and efficient algorithm for distributed compressed sensing

In this paper we present a new iterative greedy algorithm for distributed compressed sensing (DCS) problem based on the backtracking technique, which can reconstruct several input signals simultaneously by processing column by column of the compressed signals, even when the measurements are contaminated with noise and without any prior information of their sparseness. This makes it a promising candidate for many practical applications when the number of non-zero (significant) coefficients of a signal is not available. Our algorithm can provide a fast runtime while also offers comparably theoretical guarantees as the best optimization-based approach in both the noiseless and noisy regime. Numerical experiments are performed to demonstrate the validity and high performance of the proposed algorithm.     

Wire antennas optimized using genetic algorithm

In this work, wire antennas are designed to jam GSM frequencies using genetic algorithms. These antennas are designed to block communication at 3-band GSM frequencies. They are planned to be mounted on a vehicle and therefore are modeled on a ground plane. Jammer antennas designed in this work are composed of wires, placed on two square dielectric frames, perpendicular to each other. Genetic optimization routines are developed on MATLAB environment for the designs carried out in this work. Electromagnetic simulation program called SuperNEC, which analyses antennas by the method of moments, is used to determine the antenna performances and is called by the developed GA routines. The purpose of the antenna optimization is to obtain low VSWR values and omni-directional radiation pattern near ground at θ = [70° 80° 90°] planes at all GSM frequencies, since the targets will be near ground for this application. Original and interesting antenna designs are obtained as the result of genetic optimization, and are presented in the paper.     

An improved timestamp-based remote user authentication scheme

To protect the remote server from various malicious attacks, many authentication schemes have been proposed. Some schemes have to maintain a password verification table in the remote server for checking the legitimacy of the login users. To overcome potential risks of verification tables, researchers proposed remote user authentication schemes using smartcard, in which the remote server only keeps a secret key for computing the user’s passwords and does not need any verification table for verifying legal user. In 2003 Shen, Lin, and Hwang proposed a timestamp-based password authentication scheme using smartcards in which the remote server does not need to store the passwords or verification table for user authentication. Unfortunately, this scheme is vulnerable to some deadly attacks. In this paper, we analyze few attacks and finally propose an improved timestamp-based remote user authentication scheme. The modified scheme is more efficient and secure than original scheme.     

Filtering directory lookups in CMPs

Coherence protocols consume an important fraction of power to determine which coherence action to perform. Specifically, on CMPs with shared cache and directory-based coherence protocol implemented as a duplicate of local caches tags, we have observed that a big fraction of directory lookups cause a miss, because the block looked up is not allocated in any local cache. To reduce the number of directory lookups and therefore the power consumption, we propose to add a filter before the directory access.We introduce two filter implementations. In the first one, filtering information is explicitly kept in the shared cache for every block. In the second one, filtering information is decoupled from the shared cache organization, so the filter size does not depend on the shared cache size.We evaluate our filters in a CMP with 8 in-order processors with 4 threads each and a memory hierarchy with write-through local caches and a shared cache. We show that, for SPLASH2 benchmarks, the proposed filters reduce the number of directory lookups performed by 60% while power consumption is reduced by ∼28%. For Specweb2005, the number of directory lookups performed is reduced by 68% (44%), while directory power consumption is reduced by 19% (9%) using the first (second) filter implementation.     

The “Always Best Packet Switching” architecture for SIP-based mobile multimedia services

This paper presents a distributed architecture for the provision of seamless and responsive mobile multimedia services. This architecture allows its user applications to use concurrently all the wireless network interface cards (NICs) a mobile terminal is equipped with. In particular, as mobile multimedia services are usually implemented using the UDP protocol, our architecture enables the transmission of each UDP datagram through the “most suitable” (e.g. most responsive, least loaded) NIC among those available at the time a datagram is transmitted. We term this operating mode of our architecture Always Best Packet Switching (ABPS). ABPS enables the use of policies for load balancing and recovery purposes. In essence, the architecture we propose consists of the following two principal components: (i) a fixed proxy server, which acts as a relay for the mobile node and enables communications from/to this node regardless of possible firewalls and NAT systems, and (ii) a proxy client running in the mobile node responsible for maintaining a multi-path tunnel, constructed out of all the node's NICs, with the above mentioned fixed proxy server. We show how the architecture supports multimedia applications based on the SIP and RTP/RTCP protocols, and avoids the typical delays introduced by the two way message/response handshake of the SIP signaling protocol. Experimental results originated from the implementation of a VoIP application on top of the architecture we propose show the effectiveness of our approach.     

State of the art of frameworks and middleware for facilitating mobile and ubiquitous learning development

The emergence of mobile and ubiquitous technologies as important tools to complement formal learning has been accompanied by a growing interest in their educational benefits and applications. Mobile devices can be used to promote learning anywhere and anytime, to foster social learning and knowledge sharing, or to visualize augmented reality applications for learning purposes. However, the development of these applications is difficult for many researchers because it requires understanding many different protocols; dealing with distributed schemas, processes, platforms, and services; learning new programming languages; and interacting with different hardware sensors and drivers. For that reason, the use of frameworks and middleware that encapsulate part of this complexity appears to be fundamental to the further development of mobile learning projects. This study analyzes the state of the art of frameworks and middleware devoted to simplifying the development of mobile and ubiquitous learning applications. The results can be useful to many researchers involved in the development of projects using these technologies by providing an overview of the features implemented in each of these frameworks.     

A more efficient and secure ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem

Recently, Yang and Chang proposed an identity-based remote login scheme using elliptic curve cryptography for the users of mobile devices. We have analyzed the security aspects of the Yang and Chang's scheme and identified some security flaws. Also two improvements of the Yang and Chang's scheme have been proposed recently, however, it has been found that the schemes have similar security flaws as in the Yang and Chang's scheme. In order to remove the security pitfalls of the Yang and Chang and the subsequent schemes, we proposed an enhanced remote user mutual authentication scheme that uses elliptic curve cryptography and identity-based cryptosystem with three-way challenge-response handshake technique. It supports flawless mutual authentication of participants, agreement of session key and the leaked key revocation capability. In addition, the proposed scheme possesses low power consumption, low computation cost and better security attributes. As a result, the proposed scheme seems to be more practical and suitable for mobile users for secure Internet banking, online shopping, online voting, etc.