Execution Cost Research Articles

Fault tolerant & priority basis task offloading and scheduling model for IoT logistics

The Internet of Things (IoT) has connected millions of devices to the internet for communication and computation purposes. Due to constraints such as limited battery power, processing capabilities, and storage capacity, IoT devices often rely on remote fog nodes for task execution, a practice known as task offloading. The NP-hard nature of offloading and scheduling IoT tasks onto fog nodes poses significant challenges. Current IoT task offloading often relies on single parameters like device MIPS, RAM, or battery power. Similarly, task allocation on fog nodes frequently prioritizes VM MIPS. To address energy consumption and task failures in IoT systems, robust fault tolerance, efficient task offloading, and effective scheduling are crucial. This paper introduces a novel Fault-Tolerant, Priority-Based Task Offloading and Scheduling Model (FP-TOSM) for IoT logistics. Utilizing the Analytic Hierarchy Process (AHP) for multi-criteria decision-making, IoT tasks are prioritized. Tasks below a specified threshold are executed locally, while those within a defined range are offloaded to a fog node. Tasks exceeding this range are delegated to the cloud. The Euclidean formula is used to determine the proximity between the IoT logistics vehicle and fog nodes for offloading decisions. Dynamic re-clustering fault tolerance mechanisms are utilized to manage task failures after offloading. Successful offloaded tasks are allocated to suitable VMs in the cloud and fog nodes. The proposed strategy selects the most suitable VM for offloaded tasks using a multi-criteria decision-making process to reduce energy consumption, SLA violations, and execution costs. The model's performance is evaluated through simulations in iFogSim2. Results demonstrate reductions in energy consumption by up to 5.8 % and 10.4 %, decreases in SLA violations by up to 25.2 %, and a 16.28 % improvement in response time compared to an ACO-based model with a response time of 17.8 %. Additionally, the task failure ratio shows a significant reduction of up to 22.1 %. These findings highlight the effectiveness of FP-TOSM in enhancing efficiency and reliability within fog computing environments.

On Scheduling Mechanisms Beyond the Worst Case

AbstractThe problem of scheduling unrelated machines has been studied since the inception of algorithmic mechanism design (Nisan and Ronen, Algorithmic mechanism design(extended abstract). In: Proceedings of the Thirty First Annual ACM Symposium on Theory of Computing (STOC), pp. 129–140, 1999. It is a resource allocation problem that entails assigning m tasks to n machines for execution. Machines are regarded as strategic agents who may lie about their execution costs so as to minimize their time cost. To address the situation when monetary payment is not an option to compensate the machines’ costs, Koutsoupias (Theory Comput Syst 54:375–387, 2014) devised two truthful mechanisms, K and P respectively, that achieves an approximation ratio of $$\frac{n+1}{2}$$ n + 1 2 and n, for social cost minimization. In addition, no truthful mechanism can achieve an approximation ratio better than $$\frac{n+1}{2}$$ n + 1 2 . Hence, mechanism K is optimal. While the approximation ratio provides a strong worst-case guarantee, it also limits us to a comprehensive understanding of mechanism performance on various inputs. This paper investigates these two scheduling mechanisms beyond the worst case. We first show that mechanism K achieves a smaller social cost than mechanism P on every input. That is, mechanism K is pointwise better than mechanism P. Next, for each task, when machines’ execution costs are independent and identically drawn from a task-specific distribution, we show that the average-case approximation ratio of mechanism K converges to a constant determined by the task-specific distribution. This bound is tight for mechanism K. For a better understanding of this distribution-dependent constant, on the one hand, we estimate its value by plugging in a few common distributions; on the other, we show that this converging bound improves a known bound (Zhang in Algorithmica 83(6):1638–1652, 2021)) which only captures the single-task setting. Last, we find that the average-case approximation ratio of mechanism P converges to the same constant.

Multi‐objective based container placement strategy in CaaS

AbstractIn contrast to a conventional virtual machine (VM), a container is a lightweight virtualization technology. Containers are becoming a prominent technology for cloud services because of their portable, scalable, and flexible deployments, especially in the Internet of Things (IoT), smart devices, and fog and edge computing. It is a type of operating system‐level virtualization in which the kernel allows multiple isolated containers to run independently. Container placement (CP) is a nontrivial problem in Container‐as‐a‐Service (CaaS). CP is mapping to a container over virtual machines (VMs) to execute an application. Designing an efficient CP strategy is complex due to several intertwined challenges. These challenges arise from a diverse spectrum of computing resources, like on‐demand and unpredictable fluctuations of IT resources by multiple tenants. In this article, we propose a modified sum‐based container placement algorithm called a multi‐objective optimization‐based container placement algorithm (MSBCPA). In the proposed algorithm, we have considered two metrics: makespan and monetary costs for optimizing available IT resources. We have conducted comprehensive simulation experiments to validate the effectiveness of the proposed algorithm over the CloudSim 4.0 simulator. The proposed optimization algorithm (MSBCPA) aims to minimize the makespan and the execution monetary costs simultaneously. In the simulation, we found that the execution cost and energy consumption cost reduce by 20% to 30% and achieve the best possible cost‐makespan trade‐offs compared to competing algorithms.

LGTDA: Bandwidth exhaustion attack on Ethereum via dust transactions

Dust attacks typically involve sending a large number of low-value transactions to numerous addresses, aiming to facilitate transaction tracking and undermine privacy, while simultaneously disrupting the market and increasing transaction delays. These transactions not only impact the network but also incur significant costs. This paper introduces a low-cost attack method called LGTDA, which achieves network partitioning through dust attacks. This method hinders block synchronization by consuming node bandwidth, leading to denial of service(DoS) for nodes and eventually causing large-scale network partitioning. In LGTDA, the attacker does not need to have real control over the nodes in the network, nor is there a requirement for the number of peer connections to the nodes; the attack can even be initiated by simply invoking RPC services to send transactions. Under the condition of ensuring the validity of the attack transactions, the LGTDA attack sends a large volume of low-value, high-frequency dust transactions to the network, relying on nodes for global broadcasting. This sustained attack can significantly impede the growth of block heights among nodes, resulting in network partitioning. We discuss the implications of the LGTDA attack, including its destructive capability, low cost, and ease of execution. Additionally, we analyze the limitations of this attack. Compared to grid lighting attacks, the LGTDA attack has a broader impact range and is not limited by the positional relationship with the victim node. Through experimental validation in a controlled environment, we confirm the effectiveness of this attack.

Financial analysis of a locomotor exercise trial for post-stroke recovery: insights from the HIT Stroke Trial

BackgroundNavigating the complexities of post-stroke recovery trials requires addressing challenges in participant recruitment and retention and effective resource management to ensure trial success. The aim of this study was to examine the financial requirements associated with conducting the Moderate-Intensity Exercise vs. High-Intensity Interval Training to Recover Walking Post-Stroke (HIT Stroke Trial) at a single site encompassing a wide catchment area, recognizing the intricate challenges of participant recruitment and retention inherent in post-stroke recovery trials.MethodsTo determine cost, study expense reports were gathered and divided into seven categories: recruitment, screening assessments, baseline assessments, intervention, outcome assessments, retention, and oversight. Categories were then further divided into chronological order for initial contact and prescreening, consenting, initial screening, and baseline testing. The 12-week intervention was divided into 4-week blocks: intervention block 1, post 4-week outcome testing, intervention block 2, post 8-week outcome testing, intervention block 3, and post 12-week outcome testing.ResultsTotal direct cost for site execution was $539,768 with cost per participant approximated as $35,984. Oversight costs accounted for 65.8% of the budget at $355,661. To achieve goals related to inclusive participant recruitment ($21,923) and retention ($28,009), our site costs totaled $49,932. Direct study-related costs included screening assessments ($5,905), baseline assessments ($15,028), intervention ($76,952), and outcome assessments ($36,288).DiscussionClinical trials focusing on walking rehabilitation and exercise, particularly those requiring multiple assessment visits, demand rigorous oversight. This cost analysis provides important and critical insight into the expenses required to successfully execute an exercise-based walking rehabilitation trial in the United States.

The impact of latent policy synergy between cities on air pollution: An empirical analysis from China's 12,764 air policies

Policy synergy plays a crucial role in managing regional air pollution. However, the current process of formulating collaborative policies often focuses too heavily on achieving optimal emission reduction outcomes, while neglecting the execution costs at the local level. This not only leads to a lack of coordination between existing governance measures and new policies but may also result in inefficient policy implementation and the wastage of administrative resources. To address this issue, we have conducted a thorough analysis of the latent interconnections in local governance and explored the possibility of formulating collaborative policies based on latent policy synergies. Utilizing a dataset of 12,764 policy documents from China spanning from 2000 to 2023, we employed unsupervised learning techniques and panel regression models to investigate the impacts of latent policy synergies among local governments. Our findings reveal that local governments initially relied on rigid command-and-control strategies to address air pollution, which were later enhanced with economic incentives like emissions trading and subsidies, thus broadening the scope of policy tools and improving compliance flexibility. Subsequently, as comprehensive monitoring networks were established, enabling real-time data acquisition and more accurate pollution assessments, the focus of policy efforts shifted towards a more integrated approach to regional air pollution management. This similar evolution facilitated latent policy synergy among local governments, leading to significant reductions in air pollution emissions. Notably, regions such as the Central Plains and coastal cities, characterized by their dense industrial activity and high energy consumption, have shown remarkable potential for collaborative efforts, achieving greater pollution control efficiencies. This study provides a valuable reference for the coordinated governance of air pollution policies.

A novel energy-efficient and cost-effective task offloading approach for UAV-enabled MEC with LEO enhancement in Internet of Remote Things networks

The Internet of Remote Things (IoRT) involves networks of devices deployed in extensive and often remote areas, collecting data for transmission and processing. In such networks, Unmanned Aerial Vehicles (UAVs) gather data, which is then sent to Low Earth Orbit (LEO) satellites for processing. These systems often face significant challenges, particularly in task offloading. Conventional methods typically rely on static routing and scheduling algorithms that do not adapt to changing conditions and usually overlook the complexity of dynamic decision-making in harsh or isolated environments, thus failing to address the critical challenges of energy efficiency and latency. In this paper, we introduce a method comprised of a three-layer architecture. The first layer, the IoRT computing layer, uses Deep Q-Network (DQN) to optimize local decisions based on device constraints and task urgency. The second layer features UAVs serve as Mobile Edge Computing (MEC), which not only processes data but also decides whether to process tasks locally or offload them to LEO satellites, utilizing the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for this decision-making process. The third LEO Satellite Layer has a high computational capacity to handle offloaded tasks. Simulation results demonstrate notable improvements: compared to another method, the proposed model shows a 14.73 % reduction in energy consumption and a 23.13 % decrease in latency while reducing execution costs by an average of 28.7 %.

A Blockchain and PKI-Based Secure Vehicle-to-Vehicle Energy-Trading Protocol

With the increasing awareness for sustainable future and green energy, the demand for electric vehicles (EVs) is growing rapidly, thus placing immense pressure on the energy grid. To alleviate this, local trading between EVs should be encouraged. In this paper, we propose a blockchain and public key infrastructure (PKI)-based secure vehicle-to-vehicle (V2V) energy-trading protocol. A permissioned blockchain utilizing the proof of authority (PoA) consensus and smart contracts is used to securely store data. Encrypted communication is ensured through transport layer security (TLS), with PKI managing the necessary digital certificates and keys. A multi-leader, multi-follower Stackelberg game-based trade algorithm is formulated to determine the optimal energy demands, supplies, and prices. Finally, we propose a detailed communication protocol that ties all the components together, enabling smooth interaction between them. Key findings, such as system behavior and performance, scalability of the trade algorithm and the blockchain, smart contract execution costs, etc., are presented through numerical results by implementing and simulating the protocol in various scenarios. This work not only enhances local energy trading among EVs, encouraging efficient energy usage and reducing burden on the power grid, but also paves a way for future research in sustainable energy management.

PERFORMANCE ANALYSIS OF TASK SCHEDULING USING HYBRID GENETIC MODIFIED WHALE OPTIMIZATION ALGORITHM IN CLOUD COMPUTING

Cloud computing plays a vital role, which is used to access computing resources and information online. There are a lot of challenges in accessing cloud computing systems. One of the major challenges among these is resource Management which includes scheduling, allocation, and sharing. In this paper, the Hybrid Genetic Modified Whale optimization algorithm which is a combined Genetic and Modified Whale optimization algorithm to analyze the performance of the cloud computing system such as task completion time, execution cost, speedup, and efficiency with proper allocation and sharing of resources The performance of the proposed algorithm is compared with Genetic algorithm and Whale optimization algorithm. The main target of this Proposed system is to reduce the completion time of the task by increasing the speed. Cloud Sim environment tool kit is used for the testing of the proposed system.

PERFORMANCE ANALYSIS OF TASK SCHEDULING USING HYBRID GENETIC MODIFIED WHALE OPTIMIZATION ALGORITHM IN CLOUD COMPUTING

Cloud computing plays a vital role, which is used to access computing resources and information online. There are a lot of challenges in accessing cloud computing systems. One of the major challenges among these is resource Management which includes scheduling, allocation, and sharing. In this paper, the Hybrid Genetic Modified Whale optimization algorithm which is a combined Genetic and Modified Whale optimization algorithm to analyze the performance of the cloud computing system such as task completion time, execution cost, speedup, and efficiency with proper allocation and sharing of resources The performance of the proposed algorithm is compared with Genetic algorithm and Whale optimization algorithm. The main target of this Proposed system is to reduce the completion time of the task by increasing the speed. Cloud Sim environment tool kit is used for the testing of the proposed system.

Smart Contracts Management: The Interplay of Data Privacy and Blockchain for Secure and Efficient Real Estate Transactions

The digital transformation of the real estate industry is being significantly influenced by blockchain technology and smart contracts, which promise enhanced efficiency, transparency, and security in transactions. This study aims to develop a secure and efficient smart contract management protocol that balances the benefits of blockchain with robust data privacy practices. The methodology involves descriptive analytics of transaction data from the Ethereum blockchain, feasibility studies using synthetic transaction data, and a regulatory compliance analysis to map the impact of different regions' regulations on blockchain adoption in real estate. The findings reveal that while smart contracts can automate various processes and reduce reliance on intermediaries, challenges related to data privacy and regulatory compliance persist. Higher privacy features in smart contracts are associated with increased execution costs, indicating a trade-off between privacy and cost efficiency. Smart contracts with privacy level 3 had an execution cost of 0.025 ETH, compared to those with privacy level 1 at 0.02 ETH. Integrating permissioned blockchains and zero-knowledge proofs offers a promising solution, though their complexity limits broader adoption. Zero-knowledge proofs maintained high privacy (achieving privacy levels of up to 0.76) at a reasonable computational cost (proof generation time of 1.9 seconds). Thus, the integration of permissioned blockchains and zero-knowledge proofs offers a promising pathway to address these challenges. However, the complexity of these techniques requires specialized knowledge, limiting broader adoption. The study concludes with recommendations to develop specialized training programs, collaborate on regulatory frameworks, invest in advanced cryptographic research, and implement targeted strategies to overcome adoption barriers. These efforts will contribute to the digital transformation of asset management, fostering innovation and enhancing the overall efficiency of real estate transactions.

Multi-priority scheduling algorithm for scientific workflows in cloud

The public cloud environment has emerged as a promising platform for exe-cuting scientific workflows. These executions involve leasing virtual machines (VMs) from public services for the duration of the workflow. The structure of the workflows significantly impacts the performance of any proposed scheduling approach. A task within a workflow cannot begin its execution before receiving all the required data from its preceding tasks. In this paper, we introduce a multi-priority scheduling approach for executing workflow tasks in the cloud. The key component of the proposed approach is a mechanism that logically or-ders and groups workflow tasks based on their data dependencies and locality. Using the proposed approach, the number of available VMs influences the num-ber of groups (partitions) obtained. Based on the locality of each group’s tasks, the priority of each group is determined to reduce the overall execution delay and improve VM utilization. As the results demonstrate, the proposed approach achieves a significant reduction in both execution costs and time in most scenar-ios

Achieving Accountability and Data Integrity in Message Queuing Telemetry Transport Using Blockchain and Interplanetary File System

Ensuring accountability and integrity in MQTT communications is important for enabling several IoT applications. This paper presents a novel approach that combines blockchain technology and the interplanetary file system (IPFS) to achieve non-repudiation and data integrity in the MQTT protocol. Our solution operates in discrete temporal rounds, during which the broker constructs a Merkle hash tree (MHT) from the messages received. Then the broker publishes the root on the blockchain and the MHT itself on IPFS. This mechanism guarantees that both publishers and subscribers can verify the integrity of the message exchanged. Furthermore, the interactions with the blockchain made by the publishers and the broker ensure they cannot deny having sent the exchanged messages. We provide a detailed security analysis, showing that under standard assumptions, the proposed solution achieves both data integrity and accountability. Additionally, we provided an experimental campaign to study the scalability and the throughput of the system. Our results show that our solution scales well with the number of clients. Furthermore, from our results, it emerges that the throughput reduction depends on the integrity check operations. However, since the frequency of these checks can be freely chosen, we can set it so that the throughput reduction is negligible. Finally, we provided a detailed analysis of the costs of our solution showing that, overall, the execution costs are relatively low, especially given the critical security and accountability benefits it guarantees. Furthermore, our analysis shows that the higher the number of subscribers in the system, the lower the costs per client in our solution. Again, this confirms that our solution does not present any scalability issues.

Energy Losses or Savings Due to Air Infiltration and Envelope Sealing Costs in the Passivhaus Standard: A Review on the Mediterranean Coast

To obtain the Passivhaus Certificate or Passivhaus Standard (PHS), requirements regarding building envelope air tightness must be met: according to the n50 parameter, at a pressure of 50 Pa, air leakage must be below 0.6 air changes per hour (ACH). This condition is verified by following the blower door test protocol and is regulated by the ISO 9972 standard, or UNE-EN-13829. Some construction techniques make it easier to comply with these regulations, and in most cases, construction joints and material joints must be sealed in a complex way, both on façades and roofs and at ground contact points. Performing rigorous quality control of these processes during the construction phase allows achieving a value below 0.6 ACH and obtaining the PHS certification. Yet, the value can increase substantially with the passage of time: as windows and doors are used, opened, or closed; as envelope materials expand; with humidity; etc. This could result in significant energy consumption increases and losing the PHS when selling the house at a later point in time. It is therefore important to carefully supervise the quality of the construction and its execution. In this study, we focused on a house located in Sitges (Barcelona). The envelope air tightness quality was measured during four construction phases, together with the sealing of the joints and service ducts. The blower door test was performed in each phase, and the n50 value obtained decreased each time. The execution costs of each phase were also determined, as were the investment amortisation rates based on the consequent annual energy demand reductions. Air infiltration dropped by 43.81%, with the final n50 value resulting in 0.59 ACH. However, the execution costs—EUR 3827—were high compared to the energy savings made, and the investment amortisation period rose to a 15- to 30-year range. To conclude, these airtightness improvements are necessary in cold continental climates but are not applicable on the Spanish Mediterranean coast.

Optimizing execution time and cost while scheduling scientific workflow in edge data center with fault tolerance awareness

Abstract Scheduling scientific workflows is essential for edge data centers operations. Fault tolerance is a crucial focus in workflow scheduling (WS) research. This study proposed fault-tolerant WS in edge data centers using Task Prioritization Adaptive Particle Swarm Optimization (TPAPSO). The aim is to minimize the Makespan, execution costs, and overcoming failures at all workflow processing stages, including when virtual machines are insufficient or tasks fail. The approach proposes three components: initial heuristic list, scheduling tasks with TPAPSO, and implementing performance monitoring with fault tolerance (PMWFT). TPAPSO-PMWFT is simulated using CloudSim 4.0. The experiments indicate that the suggested approach shows superior results compared to existing methods.

Cost-aware workflow offloading in edge-cloud computing using a genetic algorithm

The edge-cloud computing continuum effectively uses fog and cloud servers to meet the quality of service (QoS) requirements of tasks when edge devices cannot meet those requirements. This paper focuses on the workflow offloading problem in edge-cloud computing and formulates this problem as a nonlinear mathematical programming model. The objective function is to minimize the monetary cost of executing a workflow while satisfying constraints related to data dependency among tasks and QoS requirements, including security and deadlines. Additionally, it presents a genetic algorithm for the workflow offloading problem to find near-optimal solutions with the cost minimization objective. The performance of the proposed mathematical model and genetic algorithm is evaluated on several real-world workflows. Experimental results demonstrate that the proposed genetic algorithm can find admissible solutions comparable to the mathematical model and outperforms particle swarm optimization, bee life algorithm, and a hybrid heuristic-genetic algorithm in terms of workflow execution costs.

Explainability analysis: An in-depth comparison between Fuzzy Cognitive Maps and LAMDA

Currently, it has become very relevant that machine learning techniques can provide an explanation of the results they generate, which is even more relevant in certain domains, called critical, such as health and energy, among others. For this reason, several explainability methods have been generated in the literature. Some of them are Local Interpretable Model-Agnostic Explanations (LIME) and Feature Importance, which have been used in a wide range of problems. The objective of this work is to analyze the explainability capacity of the Learning Algorithm for Multivariate Data Analysis (LAMDA) and Fuzzy Cognitive Maps (FCM), which have been used with great interest due to their interpretability, management of uncertainty during the inference process, simplicity in its use, among other things. For the development of this work, data from two critical domains have been considered, health (COVID-19 and Dengue datasets) and energy (energy price dataset), for which prediction/classification models have been developed using LAMDA and FCM techniques. Afterward, two explainability techniques were used to analyze the explainability provided by each method, one based on the LIME method and the other on the feature importance method, the latter adapted to our work by being based on the permutation of values. Finally, the work proposes two new explainability methods, one based on causal inference and the other on the degrees of membership of the variables to the classes. The latter, in particular, allows doing an explainability analysis by class. The new explainability methods reproduce the results of well-known explainability methods in the literature such as LIME and feature importance, with less execution cost, and also, with an explainability analysis by class. This work opens the doors to new work on class explainability. Furthermore, we see that machine learning approaches based on causal or fuzzy relationships are quite self-explanatory, but specific explainability methods such as those we propose in the work allow us to study particular aspects, such as highly important variables, which general explainability methods do not allow us to do, such as LIME and feature importance.

Cost minimization approach with hybrid optimization based task scheduling in Geo-distributed cloud

ABSTRACT To manage the huge data, cloud computing necessitates a significant number of disc I/O, network bandwidth and CPU cycles. To handle the massive volumes of data, the programming paradigm known as data flow integrates the tasks to a graph structure. Task scheduling is one of the main areas of current study that primarily aims to allocate the tasks to resources. It is essential to organise the tasks in a way which saves time and makes the most use of available resources. In recent years, scholars have offered different job scheduling techniques. This work intends to introduce a novel cost minimisation for big data processing with respect to task allocation or scheduling. Initially, the big data is processed under Map Reduce framework. This allocation processes is taken as the optimisation issue, which is solved under the consideration of minimisation factors like execution cost, makespan, communication cost, and energy consumption and risk. For solving this issue, a new hybrid optimisation algorithm known as Hybrid bald eagle and Archimedes Optimisation algorithm (HBE-ArCA) is developed. The betterment of HBE-ArCA is proven regarding cost, makespan and so on.

A Novel Cost Calculation Method for Manipulator Trajectory Planning.

It is worthwhile to calculate the execution cost of a manipulator for selecting a planning algorithm to generate trajectories, especially for an agricultural robot. Although there are various off-the-shelf trajectory planning methods, such as pursuing the shortest stroke or the smallest time cost, they often do not consider factors synthetically. This paper uses the state-of-the-art Python version of the Robotics Toolbox for manipulator trajectory planning instead of the traditional D-H method. We propose a cost function with mass, iteration, and residual to assess the effort of a manipulator. We realized three inverse kinematics methods (NR, GN, and LM with variants) and verified our cost function's feasibility and effectiveness. Furthermore, we compared it with state-of-the-art methods such as Double A* and MoveIt. Results show that our method is valid and stable. Moreover, we applied LM (Chan λ = 0.1) in mobile operation on our agricultural robot platform.

Artificial Intelligence-Based Brain Tumor Segmentation Using Adaptive Hybrid CNN and Classification by Multi-Scale Dilated MobileNet with Attention Mechanism for MRI Images

In the medical field, the demanding task is predicting the type of cancer cell, and the analysis to reduce the death rate. MRI technique is used for capturing the brain image because of its high-quality performance and non-ionizing radiation. These collected input images carry only the area of tissues as bright and remove the cerebrospinal fluid to increase the quality of the image. The supervised learning method indicates marvelous performances in solving the problems related to the segmentation and detection of medical images. In the existing model, Convolutional Neural Network (CNN) is used, and the execution of CNN is carried out in different layers. This network consists of different layers that lead to various challenges, such as execution cost and time being high, fetching the wrong input, arising misdiagnosis of the disease. Prediction using different datasets is difficult and creates an overfitting problem, and large memory is needed in the existing method. To overcome this entire issue, an advanced model is developed. Input images collected from online sources are given to the Brain tumor segmentation stage, where the Adaptive Hybrid Convolutional Neural Network (AHCNN) is utilized. Here, the TransResUNet and Fully Convolutional Network (FCN) is utilized to construct the AHCNN for effectively segmenting brain tumors. Here, the parameters are optimized using Flock Member Movement-Based Hybrid Coati with Tomtit Flock Optimization (FMM-HCTFO). The TransResUNet and FCN outcomes are fed to the prediction stage. Here, the brain tumor classification is done using the Multi-scale Dilated Adaptive MobileNet with Attention Mechanism (MSDM-AM) technique. Here, also the parameters are optimized using FMM-HCTFO. Finally, the brain tumor will be classified using the MSDM-AM technique. The achievement of the developed model for the prediction of the brain is increased by tuning the variables using the proposed algorithms.