A Comparative Analysis of Multi-Criteria Decision-Making Methods for Resource Selection in Mobile Crowd Computing

In mobile crowd computing (MCC), smart mobile devices (SMDs) are utilized as computing resources. To achieve satisfactory performance and quality of service, selecting the most suitable resources (SMDs) is crucial. The selection is generally made based on the computing capability of an SMD, which is defined by its various fixed and variable resource parameters. As the selection is made on different criteria of varying significance, the resource selection problem can be duly represented as an MCDM problem. However, for the real-time implementation of MCC and considering its dynamicity, the resource selection algorithm should be time-efficient. In this paper, we aim to find out a suitable MCDM method for resource selection in such a dynamic and time-constraint environment. For this, we present a comparative analysis of various MCDM methods under asymmetric conditions with varying selection criteria and alternative sets. Various datasets of different sizes are used for evaluation. We execute each program on a Windows-based laptop and also on an Android-based smartphone to assess average runtimes. Besides time complexity analysis, we perform sensitivity analysis and ranking order comparison to check the correctness, stability, and reliability of the rankings generated by each method.

Mitochondrial genome of Chinese grass shrimp, Palaemonetes sinensis and comparison with other Palaemoninae species

The mitogenome of Chinese grass shrimp, Palaemonetes sinensis, was determined through Illumina sequencing, and the basic characteristics and gene arrangement were analyzed. The mitogenome of P. sinensis was 15955 bp in length, consisting of 13 protein-coding genes (PCGs), 22 tRNA genes, 2 rRNA genes and one control region, with tightly packed. 33 of these genes were encoded on the heavy strand, and the remainders encoded on the light strand. The composition of P. sinensis mitogenome presented a strong A + T bias, which account for 66.7%. All PCGs were initiated by a canonical ATN codon, except nad5, which was initiated by GTG. The termination codons of the PCGs were TAA, TAG and T–. The secondary structures of 22 tRNAs of P. sinensis had the typical clover structure, except of trnS1 owing to the lack of dihydroxyuridine (DHU) arm. Gene order comparison of P. sinensis and previously-sequenced Palaemoninae revealed a unique translocation between trnT and trnP in Macrobrachium. The phylogenetic analyses showed that three Exopalaemon species formed a monophyletic group and then clustered with two Palaemon species and P. sinensis successively whereas Macrobrachium clustered with Palaemon capensis in the other clade.

A Novel Secure Scheme for Supporting Complex SQL Queries over Encrypted Databases in Cloud Computing

With the advance of database-as-a-service (DaaS) and cloud computing, increasingly more data owners are motivated to outsource their data to cloud database for great convenience and economic savings. Many encryption schemes have been proposed to process SQL queries over encrypted data in the database. In order to obtain the desired data, the SQL queries contain some statements to describe the requirement, e.g., arithmetic and comparison operators (+, -, ×, <, >, and =). However, to support different operators (+, -, ×, <, >, and =) in SQL queries over encrypted data, multiple encryption schemes need to be combined and adjusted to work together. Moreover, repeated encryptions will reduce the efficiency of execution. This paper presents a practical and secure homomorphic order-preserving encryption (FHOPE) scheme, which allows cloud server to perform complex SQL queries that contain different operators (such as addition, multiplication, order comparison, and equality checks) over encrypted data without repeated encryption. These operators are data interoperable, so they can be combined to formulate complex SQL queries. We conduct security analysis and efficiency evaluation of the proposed scheme FHOPE. The experiment results show that, compared with the existing approaches, the FHOPE scheme incurs less overhead on computation and communication. It is suitable for large batch complex SQL queries over encrypted data in cloud environment.