• Title/Summary/Keyword: Network optimization

Search Result 2,233, Processing Time 0.029 seconds

Recurrent Ant Colony Optimization for Optimal Path Convergence in Mobile Ad Hoc Networks

  • Karmel, A;Jayakumar, C
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3496-3514
    • /
    • 2015
  • One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

Resource Allocation in Multi-User MIMO-OFDM Systems with Double-objective Optimization

  • Chen, Yuqing;Li, Xiaoyan;Sun, Xixia;Su, Pan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2063-2081
    • /
    • 2018
  • A resource allocation algorithm is proposed in this paper to simultaneously minimize the total system power consumption and maximize the system throughput for the downlink of multi-user multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. With the Lagrange dual decomposition method, we transform the original problem to its convex dual problem and prove that the duality gap between the two problems is zero, which means the optimal solution of the original problem can be obtained by solving its dual problem. Then, we use convex optimization method to solve the dual problem and utilize bisection method to obtain the optimal dual variable. The numerical results show that the proposed algorithm is superior to traditional single-objective optimization method in both the system throughput and the system energy consumption.

A Route Optimization Scheme for Heterogeneous Nested Mobile Networks (혼재된 중첩 이동 네트워크에서의 라우팅 최적화 기법)

  • Cho, Ho-Sik;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.82-89
    • /
    • 2008
  • Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In a network mobility scenario, mobile networks can be nested in a hierarchical form. That situation is referred to a nested mobile network Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. In this paper, we propose a routing optimization scheme having backward compatibility to the basic network mobility protocol and concerning heterogeneity of nested mobile network, also we perform comparison and analysis of proposed schemes.

One Dimensional Optimization using Learning Network

  • Chung, Taishn;Bien, Zeungnam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.33-39
    • /
    • 1995
  • One dimensional optimization problem is considered, we propose a method to find the global minimum of one-dimensional function with on gradient information but only the finite number of input-output samples. We construct a learning network which has a good learning capability and of which global maximum(or minimum) can be calculated with simple calculation. By teaching this network to approximate the given function with minimal samples, we can get the global minimum of the function. We verify this method using some typical esamples.

  • PDF

Whale Optimization Algorithm and Blockchain Technology for Intelligent Networks

  • Sulthana, Shazia;Reddy, BN Manjunatha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.157-164
    • /
    • 2022
  • The proposed privacy preserving scheme has identified the drawbacks of existing schemes in Vehicular Networks. This prototype enhances the number of nodes by decreasing the cluster size. This algorithm is integrated with the whale optimization algorithm and Block Chain Technology. A set of results are done through the NS-2 simulator in the direction to check the effectiveness of proposed algorithm. The proposed method shows better results than with the existing techniques in terms of Delay, Drop, Delivery ratio, Overhead, throughout under the denial of attack.

Regional Information-based Route Optimization Scheme in Nested Mobile Network (중첩된 이동 네트워크 환경에서 지역적 정보를 이용한 경로 최적화 방안)

  • Kim Joon woo;Park Hee dong;Lee Kang won;Choi Young soo;Cho You ze;Cho Bong kwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.178-185
    • /
    • 2005
  • NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers ken pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).

Water Recources Evaluation using Network Optimization Model (Network Optimization Model을 이용한 수자원 평가)

  • Lee, Gwang-Man;Lee, Jae-Eung;Sim, Sang-Jun;Go, Seok-Gu
    • Journal of Korea Water Resources Association
    • /
    • v.32 no.2
    • /
    • pp.143-152
    • /
    • 1999
  • South-eastern part of Kyungbuk Province is suffering from lack of suitable water development sources due to geographic condition and insufficient water sources condition. In order to find an appropriate solution, extensive studies are carried out such as investigation of new dam sites, regional water supply system, modification of existing water supply system, rehabilitation of old water resources structures and development of off-stream reservoirs. The network optimization model is applied for evaluation of the newly suggested water development alternatives. The results show that if water supply system is constructed until 2011, the reliability of water supply to Pohang and Kyungju region will be more than 95% and the network optimization model can be used to analyse the management of water resources system considering water rights or priority orders.

  • PDF

Study on Prediction of Similar Typhoons through Neural Network Optimization (뉴럴 네트워크의 최적화에 따른 유사태풍 예측에 관한 연구)

  • Kim, Yeon-Joong;Kim, Tae-Woo;Yoon, Jong-Sung;Kim, In-Ho
    • Journal of Ocean Engineering and Technology
    • /
    • v.33 no.5
    • /
    • pp.427-434
    • /
    • 2019
  • Artificial intelligence (AI)-aided research currently enjoys active use in a wide array of fields thanks to the rapid development of computing capability and the use of Big Data. Until now, forecasting methods were primarily based on physics models and statistical studies. Today, AI is utilized in disaster prevention forecasts by studying the relationships between physical factors and their characteristics. Current studies also involve combining AI and physics models to supplement the strengths and weaknesses of each aspect. However, prior to these studies, an optimization algorithm for the AI model should be developed and its applicability should be studied. This study aimed to improve the forecast performance by constructing a model for neural network optimization. An artificial neural network (ANN) followed the ever-changing path of a typhoon to produce similar typhoon predictions, while the optimization achieved by the neural network algorithm was examined by evaluating the activation function, hidden layer composition, and dropouts. A learning and test dataset was constructed from the available digital data of one typhoon that affected Korea throughout the record period (1951-2018). As a result of neural network optimization, assessments showed a higher degree of forecast accuracy.

A Hybrid Optimized Deep Learning Techniques for Analyzing Mammograms

  • Bandaru, Satish Babu;Deivarajan, Natarajasivan;Gatram, Rama Mohan Babu
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.73-82
    • /
    • 2022
  • Early detection continues to be the mainstay of breast cancer control as well as the improvement of its treatment. Even so, the absence of cancer symptoms at the onset has early detection quite challenging. Therefore, various researchers continue to focus on cancer as a topic of health to try and make improvements from the perspectives of diagnosis, prevention, and treatment. This research's chief goal is development of a system with deep learning for classification of the breast cancer as non-malignant and malignant using mammogram images. The following two distinct approaches: the first one with the utilization of patches of the Region of Interest (ROI), and the second one with the utilization of the overall images is used. The proposed system is composed of the following two distinct stages: the pre-processing stage and the Convolution Neural Network (CNN) building stage. Of late, the use of meta-heuristic optimization algorithms has accomplished a lot of progress in resolving these problems. Teaching-Learning Based Optimization algorithm (TIBO) meta-heuristic was originally employed for resolving problems of continuous optimization. This work has offered the proposals of novel methods for training the Residual Network (ResNet) as well as the CNN based on the TLBO and the Genetic Algorithm (GA). The classification of breast cancer can be enhanced with direct application of the hybrid TLBO- GA. For this hybrid algorithm, the TLBO, i.e., a core component, will combine the following three distinct operators of the GA: coding, crossover, and mutation. In the TLBO, there is a representation of the optimization solutions as students. On the other hand, the hybrid TLBO-GA will have further division of the students as follows: the top students, the ordinary students, and the poor students. The experiments demonstrated that the proposed hybrid TLBO-GA is more effective than TLBO and GA.

An Approximation Method in Collaborative Optimization for Engine Selection coupled with Propulsion Performance Prediction

  • Jang, Beom-Seon;Yang, Young-Soon;Suh, Jung-Chun
    • Journal of Ship and Ocean Technology
    • /
    • v.8 no.2
    • /
    • pp.41-60
    • /
    • 2004
  • Ship design process requires lots of complicated analyses for determining a large number of design variables. Due to its complexity, the process is divided into several tractable designs or analysis problems. The interdependent relationship requires repetitive works. This paper employs collaborative optimization (CO), one of the multidisciplinary design optimization (MDO) techniques, for treating such complex relationship. CO guarantees disciplinary autonomy while maintaining interdisciplinary compatibility due to its bi-level optimization structure. However, the considerably increased computational time and the slow convergence have been reported as its drawbacks. This paper proposes the use of an approximation model in place of the disciplinary optimization in the system-level optimization. Neural network classification is employed as a classifier to determine whether a design point is feasible or not. Kriging is also combined with the classification to make up for the weakness that the classification cannot estimate the degree of infeasibility. For the purpose of enhancing the accuracy of a predicted optimum and reducing the required number of disciplinary optimizations, an approximation management framework is also employed in the system-level optimization.