• Title/Summary/Keyword: Optimization of Computer Network

Search Result 501, Processing Time 0.025 seconds

Multi-Objective Optimization for a Reliable Localization Scheme in Wireless Sensor Networks

  • Shahzad, Farrukh;Sheltami, Tarek R.;Shakshuki, Elhadi M.
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.796-805
    • /
    • 2016
  • In many wireless sensor network (WSN) applications, the information transmitted by an individual entity or node is of limited use without the knowledge of its location. Research in node localization is mostly geared towards multi-hop range-free localization algorithms to achieve accuracy by minimizing localization errors between the node's actual and estimated position. The existing localization algorithms are focused on improving localization accuracy without considering efficiency in terms of energy costs and algorithm convergence time. In this work, we show that our proposed localization scheme, called DV-maxHop, can achieve good accuracy and efficiency. We formulate the multi-objective optimization functions to minimize localization errors as well as the number of transmission during localization phase. We evaluate the performance of our scheme using extensive simulation on several anisotropic and isotropic topologies. Our scheme can achieve dual objective of accuracy and efficiency for various scenarios. Furthermore, the recently proposed algorithms require random uniform distribution of anchors. We also utilized our proposed scheme to compare and study some practical anchor distribution schemes.

Improved Feature Selection Techniques for Image Retrieval based on Metaheuristic Optimization

  • Johari, Punit Kumar;Gupta, Rajendra Kumar
    • 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.

Program Osptimality Using Network Partiton in Embedded System (임베디드 시스템에서 네트워크 분할을 이용한 프로그램 최적화)

  • Choi Kang-Hee;Shin Hyun-Duck
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.3
    • /
    • pp.145-154
    • /
    • 2006
  • This paper improves algorithms of Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. Improving SPRE algorithm performs the execution speed optimization based on the information of the execution frequency from profiling and the memory space optimization. The first purpose of presented algorithm is to reduce in space requirements and the second purpose is to de crease the execution time. Since too much weight on execution speed optimization may cause the explosion of the memory space, it is important to consider the size of memory. This fact can be a big advantage in the embedded system which concerns the required memory size more than the execution speed In this paper we implemented the min-cut algorithm, and this algorithm used the control flow graph is constructed with network and partitioned.

  • PDF

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

Integrated NEMO Route Optimization to Improve Security and Communication Path (보안성과 전송 경로를 함께 개선한 NEMO의 통합적인 경로 최적화)

  • Cho, Kyung-San;Shin, Duk-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.203-210
    • /
    • 2008
  • Because BSP(Basic Support Protocol) of NEMO(Network Mobility) has important limitation of not providing route optimization, several route optimization schemes have been proposed. By analyzing and improving the limitations of the existing schemes. we Propose an advanced integrated route optimization scheme for the communication through both the internal and external routing of nested NEMO. Our proposal includes a secure route optimization protocol which connects TLMR directly to an external node CN without passing through any HAs. and allows TLMR to control the internal path without passing through the internet. Thus, our scheme can strengthen the security as well as improve the path and delay of NEMO communication.

  • PDF

An Optimized Mass-spring Model with Shape Restoration Ability Based on Volume Conservation

  • Zhang, Xiaorui;Wu, Hailun;Sun, Wei;Yuan, Chengsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1738-1756
    • /
    • 2020
  • To improve the accuracy and realism of the virtual surgical simulation system, this paper proposes an optimized mass-spring model with shape restoration ability based on volume conservation to simulate soft tissue deformation. The proposed method constructs a soft tissue surface model that adopts a new flexion spring for resisting bending and incorporates it into the mass-spring model (MSM) to restore the original shape. Then, we employ the particle swarm optimization algorithm to achieve the optimal solution of the model parameters. Besides, the volume conservation constraint is applied to the position-based dynamics (PBD) approach to maintain the volume of the deformable object for constructing the soft tissue volumetric model base on tetrahedrons. Finally, we built a simulation system on the PHANTOM OMNI force tactile interaction device to realize the deformation simulation of the virtual liver. Experimental results show that the proposed model has a good shape restoration ability and incompressibility, which can enhance the deformation accuracy and interactive realism.

Optimizing Network Lifetime of RPL Based IOT Networks Using Neural Network Based Cuckoo Search Algorithm

  • Prakash, P. Jaya;Lalitha, B.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.255-261
    • /
    • 2022
  • Routing Protocol for Low-Power and Lossy Networks (RPLs) in Internet of Things (IoT) is currently one of the most popular wireless technologies for sensor communication. RPLs are typically designed for specialized applications, such as monitoring or tracking, in either indoor or outdoor conditions, where battery capacity is a major concern. Several routing techniques have been proposed in recent years to address this issue. Nevertheless, the expansion of the network lifetime in consideration of the sensors' capacities remains an outstanding question. In this research, aANN-CUCKOO based optimization technique is applied to obtain a more efficient and dependable energy efficient solution in IOT-RPL. The proposed method uses time constraints to minimise the distance between source and sink with the objective of a low-cost path. By considering the mobility of the nodes, the technique outperformed with an efficiency of 98% compared with other methods. MATLAB software is used to simulate the proposed model.

Optimization Protocol using Load Balancing for Hierarchical Wireless Sensor Network (무선센서네트워크에서 부하 균등화를 위한 클러스터링 최적화 프로토콜)

  • Choi, Hae-Won;Kim, Sang-Jin;Pye, Su-Young;Chang, Chu-Seock
    • Journal of Digital Convergence
    • /
    • v.11 no.10
    • /
    • pp.419-429
    • /
    • 2013
  • The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

Multiobjective Space Search Optimization and Information Granulation in the Design of Fuzzy Radial Basis Function Neural Networks

  • Huang, Wei;Oh, Sung-Kwun;Zhang, Honghao
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.636-645
    • /
    • 2012
  • This study introduces an information granular-based fuzzy radial basis function neural networks (FRBFNN) based on multiobjective optimization and weighted least square (WLS). An improved multiobjective space search algorithm (IMSSA) is proposed to optimize the FRBFNN. In the design of FRBFNN, the premise part of the rules is constructed with the aid of Fuzzy C-Means (FCM) clustering while the consequent part of the fuzzy rules is developed by using four types of polynomials, namely constant, linear, quadratic, and modified quadratic. Information granulation realized with C-Means clustering helps determine the initial values of the apex parameters of the membership function of the fuzzy neural network. To enhance the flexibility of neural network, we use the WLS learning to estimate the coefficients of the polynomials. In comparison with ordinary least square commonly used in the design of fuzzy radial basis function neural networks, WLS could come with a different type of the local model in each rule when dealing with the FRBFNN. Since the performance of the FRBFNN model is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials present in the consequent parts of the rules, we carry out both structural as well as parametric optimization of the network. The proposed IMSSA that aims at the simultaneous minimization of complexity and the maximization of accuracy is exploited here to optimize the parameters of the model. Experimental results illustrate that the proposed neural network leads to better performance in comparison with some existing neurofuzzy models encountered in the literature.

Performance analysis of linear pre-processing hopfield network (선형 선처리 방식에 의한 홉필드 네트웍의 성능 분석)

  • Ko, Young-Hoon;Lee, Soo-Jong;Noh, Heung-Sik
    • The Journal of Information Technology
    • /
    • v.7 no.2
    • /
    • pp.43-54
    • /
    • 2004
  • Since Dr. John J. Hopfield has proposed the HOpfield network, it has been widely applied to the pattern recognition and the routing optimization. The method of Jian-Hua Li improved efficiency of Hopfield network which input pattern's weights are regenerated by SVD(singluar value decomposition). This paper deals with Li's Hopfield Network by linear pre-processing. Linear pre-processing is used for increasing orthogonality of input pattern set. Two methods of pre-processing are used, Hadamard method and random method. In manner of success rate, radom method improves maximum 30 percent than the original and hadamard method improves maximum 15 percent. In manner of success time, random method decreases maximum 5 iterations and hadamard method decreases maximum 2.5 iterations.

  • PDF