• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.568-577
• /
• 2014

We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.726-732
• /
• 2017

In practical distributed sensing and prediction applications over wireless sensor networks (WSN), environmental sensing activities are highly dynamic because of noisy sensory information from moving source signals. The recent distributed online convex optimization frameworks have been developed as promising approaches for solving approximately stochastic learning problems over network of sensors in a distributed manner. Negligence of mobility consequence in the original distributed saddle point algorithm (DSPA) could strongly affect the convergence rate and stability of learning results. In this paper, we propose an integrated sliding windows mechanism in order to stabilize predictions and achieve better convergence rates in cooperative detection of a moving source signal scenario.

• Structural Engineering and Mechanics
• /
• v.44 no.3
• /
• pp.379-403
• /
• 2012

In recent years, the need for optimal design of structures under time-history loading aroused great attention in researchers. The main problem in this field is the extremely high computational demand of time-history analyses, which may convert the solution algorithm to an illogical one. In this paper, a new framework is developed to solve the size optimization problem of steel truss structures subjected to ground motions. In order to solve this problem, the covariance matrix adaptation evolution strategy algorithm is employed for the optimization procedure, while a generalized regression neural network is utilized as a meta-model for fitness approximation. Moreover, the computational cost of time-history analysis is decreased through a wavelet analysis. Capability and efficiency of the proposed framework is investigated via two design examples, comprising of a tower truss and a footbridge truss.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1229-1239
• /
• 2014

Optimal Distributed Generation (DG) output and reconfiguration are among the well accepted approach to reduce power loss in a distribution network. In the past, most of the researchers employed optimal DG output and reconfiguration separately. In this work, a simultaneous DG output and reconfiguration analysis is proposed to maximize power loss reduction. The impact of the separated analysis and simultaneous analysis are investigated. The test result on the 33 bus distribution network with 3 units of DG operated in PV mode showed the simultaneous analysis gave the lowest power loss (global optimal) and faster results compared to other combined methods. All the analyses for optimizing the DG as well as reconfiguration are used the Artificial Bee Colony Optimization technique.

• Steel and Composite Structures
• /
• v.39 no.4
• /
• pp.471-491
• /
• 2021

In this study, we estimate the ultimate load of rectangular concrete-filled steel tubes (CFST) by developing a novel hybrid predictive model (ANN-BCMO) which is a combination of balancing composite motion optimization (BCMO) - a very new optimization technique and artificial neural network (ANN). For this aim, an experimental database consisting of 422 datasets is used for the development and validation of the ANN-BCMO model. Variables in the database are related with the geometrical characteristics of the structural members, and the mechanical properties of the constituent materials (steel and concrete). Validation of the hybrid ANN-BCMO model is carried out by applying standard statistical criteria such as root mean square error (RMSE), coefficient of determination (R²), and mean absolute error (MAE). In addition, the selection of appropriate values for parameters of the hybrid ANN-BCMO is conducted and its robustness is evaluated and compared with the conventional ANN techniques. The results reveal that the new hybrid ANN-BCMO model is a promising tool for prediction of the ultimate load of rectangular CFST, and prove the effective role of BCMO as a powerful algorithm in optimizing and improving the capability of the ANN predictor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2650-2667
• /
• 2021

In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.40-48
• /
• 2021

Content-Based Image Retrieval (CBIR) system plays a vital role to retrieve the relevant images as per the user perception from the huge database is a challenging task. Images are represented is to employ a combination of low-level features as per their visual content to form a feature vector. To reduce the search time of a large database while retrieving images, a novel image retrieval technique based on feature dimensionality reduction is being proposed with the exploit of metaheuristic optimization techniques based on Genetic Algorithm (GA), Extended Binary Cuckoo Search (EBCS) and Whale Optimization Algorithm (WOA). Each image in the database is indexed using a feature vector comprising of fuzzified based color histogram descriptor for color and Median binary pattern were derived in the color space from HSI for texture feature variants respectively. Finally, results are being compared in terms of Precision, Recall, F-measure, Accuracy, and error rate with benchmark classification algorithms (Linear discriminant analysis, CatBoost, Extra Trees, Random Forest, Naive Bayes, light gradient boosting, Extreme gradient boosting, k-NN, and Ridge) to validate the efficiency of the proposed approach. Finally, a ranking of the techniques using TOPSIS has been considered choosing the best feature selection technique based on different model parameters.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.1-10
• /
• 2022

Nowadays software defect prediction (SDP) is most active research going on in software engineering. Early detection of defects lowers the cost of the software and also improves reliability. Machine learning techniques are widely used to create SDP models based on programming measures. The majority of defect prediction models in the literature have problems with class imbalance and high dimensionality. In this paper, we proposed Centroid and Nearest Neighbor based Class Imbalance Reduction (CNNCIR) technique that considers dataset distribution characteristics to generate symmetry between defective and non-defective records in imbalanced datasets. The proposed approach is compared with SMOTE (Synthetic Minority Oversampling Technique). The high-dimensionality problem is addressed using Ant Colony Optimization (ACO) technique by choosing relevant features. We used nine different classifiers to analyze six open-source software defect datasets from the PROMISE repository and seven performance measures are used to evaluate them. The results of the proposed CNNCIR method with ACO based feature selection reveals that it outperforms SMOTE in the majority of cases.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.746-758
• /
• 2022

This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of battery-powered mobile devices. The formulated optimization problem is a typical mixed-integer nonlinear programming problem. To solve this nondeterministic polynomial (NP)-hard problem, a decomposition-based task-scheduling algorithm is proposed. Using an alternating optimization technology, the original problem is divided into three subproblems. In the outer loop, task offloading decisions are yielded using a pruning search algorithm for the task offloading subproblem. In the inner loop, closed-form solutions for computational resource allocation subproblems are derived using the Lagrangian multiplier method. Then, it is proven that the transmitted power-allocation subproblem is a unimodal problem; this subproblem is solved using a gradient-based bisection search algorithm. The simulation results demonstrate that the proposed framework achieves better energy efficiency than other frameworks. Additionally, the impact of the battery level-aware scheme on the operating hours of battery-powered mobile devices is also investigated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1276-1295
• /
• 2023

Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.