The Trustworthy Healthcare Cloud Storage Auditing Scheme (TCSHAS) represents a progressive solution for resolving trust-related issues linked to third-party auditors (TPAs) within traditional healthcare cloud storage audit systems. As the healthcare industry increasingly relies on cloud storage, concerns surrounding security and privacy have grown, motivating the development of a unique incentive mechanism. This mechanism leverages the non-tamperable and traceable features of blockchain technology to encourage TPAs to uphold honesty and reliability. By organizing TPAs as a group of nodes on the blockchain, a system of mutual surveillance is established, enabling diligent monitoring and penalization of any malicious actions. TCSHAS encompasses a comprehensive system model that incorporates smart contracts to manage transaction-related matters, including dispute resolution. Performance evaluations have confirmed its efficiency and suitability for real-world healthcare applications. Our experiments demonstrate that TCSHAS performs well in terms of gas consumption and exhibits scalability as the number of participant’s increases. Compared with other common smart contracts, TCSHAS maintains a balanced level of complexity, incorporates strong security measures, offers comprehensive auditing capabilities, and remains flexible. To further enhance our research, we can explore ways to optimize TCSHAS scalability and performance, such as through shading, as the volume of healthcare data continues to grow. In addition, we can investigate the integration of advanced privacy technologies or AI-based auditing. These advancements will reinforce the role of TCSHAS in establishing trust and security in healthcare cloud storage audits, making it highly relevant in real-world healthcare settings. Ultimately, TCSHAS contributes to improving trust and security in healthcare cloud storage auditing, ensuring responsible management of sensitive healthcare data.
Any given Euclidean space can be partitioned into non-overlapping regions using Voronoi diagram and the Delaunay triangulation connects sites using nearest-neighbor fashion. Realistically in this context, all the edge servers are scattered over the Earth surface and can be clustered using Voronoi diagram. Now nearest edge server selection by Delaunay triangulation over the Voronoi diagram is our prime target. Due to the large demand of Internet content coming from burst crowd, performance of the Cloud-oriented content delivery networks is drastically reduced. To improve the said performance degradation, nearest edge server selection is a primary goal of cloud service provider (like Akamai Technologies, Amazon CloudFront, Mirror Image Internet etc.). Empirically all the time load of the nearest edge server is not eligible for responding the user request. Therefore load balancing is also important criteria for selecting suitable edge server. In this paper, we have presented Fuzzy Based Least Response Time (FLRT) dynamic load balancing algorithm and which is effective for crisps input from different heterogeneous system. Thus, FLRT is a novel paradigm which can select nearest neighbor edge server from user's current location where response time and load of the edge server is lowest.
1 April 2020 in International Journal of Natural Computing Research
As ubiquitous as it is, the Internet has spawned a slew of products that have forever changed the way one thinks of society and politics. This article proposes a model to predict chances of a political party winning based on data collected from Twitter microblogging website, because it is the most popular microblogging platform in the world. Using unsupervised topic modeling and the NRC Emotion Lexicon, the authors demonstrate how it is possible to predict results by analyzing eight types of emotions expressed by users on Twitter. To prove the results based on empirical analysis, the authors examine the Twitter messages posted during 14th Gujarat Legislative Assembly election, 2017. Implementing two unsupervised clustering methods of K-means and Latent Dirichlet Allocation, this research shows how the proposed model is able to examine and summarize observations based on underlying semantic structures of messages posted on Twitter. These two well-known unsupervised clustering methods provide a firm base for the proposed model to enable streamlining of decision-making processes objectively. Request access from your librarian to read this article's full text.