This research paper investigates the integration of blockchain technology to enhance the security of Android mobile app data storage. Blockchain holds the potential to significantly improve data security and reliability, yet faces notable challenges such as scalability, performance, cost, and complexity. In this study, we begin by providing a thorough review of prior research and identifying critical research gaps in the field. Android’s dominant position in the mobile market justifies our focus on this platform. Additionally, we delve into the historical evolution of blockchain and its relevance to modern mobile app security in a dedicated section. Our examination of encryption techniques and the effectiveness of blockchain in securing mobile app data storage yields important insights. We discuss the advantages of blockchain over traditional encryption methods and their practical implications. The central contribution of this paper is the Blockchain-based Secure Android Data Storage (BSADS) framework, now consisting of six comprehensive layers. We address challenges related to data storage costs, scalability, performance, and mobile-specific constraints, proposing technical optimization strategies to overcome these obstacles effectively. To maintain transparency and provide a holistic perspective, we acknowledge the limitations of our study. Furthermore, we outline future directions, stressing the importance of leveraging lightweight nodes, tackling scalability issues, integrating emerging technologies, and enhancing user experiences while adhering to regulatory requirements.
Recently, many Computational-Intelligence algorithms have been proposed for solving continuous problem. The Differential Search Algorithm (DSA), a computational-intelligence based algorithm inspired by the migration movements of superorganisms, is developed to solve continuous problems. However, DSA proposed for solving problems with continuous search space proposed for solving should be modified for solving binary structured problems. When the DSA is intended for use in binary problems, continuous variables need to be converted into binary format due to solution space structure of this type of problem. In this study, the DSA is modified to solve binary optimization problems by using a conversion approach from continuous values to binary values. The new algorithm has been designated as the binary DSA or BDSA for short. First, when finding donors with the BDSA, four search methods (Bijective, Surjective, Elitist1 and Elitist2) with different iteration numbers are used and tested on 15 UFLP benchmark problems. The Elitist2 approach, which provides the best solution of the four methods, is used in the BDSA, and the results are compared with Continuous Particle Swarm Optimization (CPSO), Continuous Artificial Bee Colony (ABCbin), Improved Binary Particle Swarm Optimization (IBPSO), Binary Artificial Bee Colony (binABC) and Discrete Artificial Bee Colony (DisABC) algorithms using UFLP benchmark problems. Results from the tests and comparisons show that the BDSA is fast, effective and robust for binary optimization.
10 January 2012 in Neural Computing and Applications