A flexible algorithm for solving nonlinear engineering design optimization problems involving zero-one, discrete, and continuous variables is presented. The algorithm restricts its search only to the permissible values of the variables, thereby reducing the search effort in converging near the optimum solution. The efficiency and ease of application of the proposed method is demonstrated by solving four different mechanical design problems chosen from the optimization literature. These results are encouraging and suggest the use of the technique to other more complex engineering design problems.

No abstract

In Wireless Sensor Networks (WSNs), effective transmission with acceptable degradation in the power of sensor nodes is a key challenge. In a large network, holdup is bound to occur in communicating superfluous data. The aforementioned issues namely, energy, delay and data redundancy are interdependent on each other and a tradeoff needs to be worked out to improve the overall performance. The extant methods in the literature employ either centralized or distributed approach to select a cluster head (CH). In this paper, sink originated hybrid and dynamic clustering with routing technique is proposed. The proposed routing algorithm works based on node handling capability of each sensor node in the selection of CH and also helps in identifying the forwarder node. In addition, processing load of a sensor node is also considered for selecting the forwarder. Both space and time correlation is used to collect data from the clusters and then aggregated to provide a proficient communication. The introduced method is evaluated with the performance of the previously available techniques like, Data Routing for In-Network Aggregation (DRINA), Efficient Data Collection Aware of Spatio-Temporal Correlation (EAST), Cluster-Based Data Aggregation (CBDA), Energy-Efficient Data Aggregation and Transfer (EEDAT), and Distributed algorithm for Integrated tree Construction and data Aggregation (DICA). Simulation parameters considered for assess ing the performance of the proposed algorithm are aggregation ratio, routing overhead, packet delivery fraction, throughput, packet delay and consumed energy. The experimental analysis of the introduced algorithm generates paramount outcome of finest aggregation quality with diverse key characteristics and circumstances as required by a sensor network.

No abstract

Abstract. In recent years Internet has experienced a rapid expansion and also facing increased no. of security threats. However many technological innovations have been proposed for information assurance but still protection of computer systems has been difficult. With the rapid growth of Internet technology, a high level of security is needed for keeping the data resources and equipments secure. In this context intrusion detection (ID) has become an important area of research since building a system with no vulnerabilities has not been technically feasible.In this paper, a Genetic Algorithm based approach is presented for network misuse intrusion detection system. The proposed genetic algorithm uses a set of classification rules which are generated from a predefined intrusion behavior. From the results it could be concluded that by applying proposed rule based network intrusion detection algorithm, more no. of intrusions can be detected.