19803744
Effects of Similarity-Based Selection on WBMOIA: A Weight-Based Multiobjective Immune Algorithm
With a comparison to the random selection approach used in the weight-based multiobjective immune algorithm (WBMOIA), this paper proposes a new selection approach based on the truncation algorithm with similar individuals (TASI). Then the effect of the proposed selection approach is examined on the performance of WBMOIA. On one hand, the performance is compared between WBMOIA with the random selection approach and WBMOIA with the proposed selection approach. On the other hand, simulation results on a number of problems are presented to investigate if there exists any value of the reduction rate where WBMOIA performs well. Experiment results show that the performance of WBMOIA can be improved by the proposed selection approach and a better reduction rate can be obtained for each test problem.
393655
A Novel Artificial Immune System for Multiobjective Optimization Problems
This study presents a novel weight-based multiobjective artificial immune system (WBMOAIS) based on opt-aiNET. The proposed algorithm follows the elementary structure of opt-aiNET, but has the following distinct characteristics: At first,a randomly weighted sum of multiple objectives is used as a fitness function; Secondly, the individuals of the population are chosen from the memory, which is a set of elite solutions. Lastly, in addition to the clonal suppression algorithm similar to that used in opt-aiNET, a new truncation algorithm with similar individuals (TASI) is presented in order to eliminate the similar individuals in memory and obtain a well-distributed spread of non-dominated solutions. Simulation results show WBMOAIS outperforms the vector immune algorithm (VIS) and the elitist non-dominated sorting genetic system (NSGA-II).
45421407
LAD: Localization anomaly detection for wireless sensor networks
In wireless sensor networks (WSNs), sensors' locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed to provide correct reference information. However, when the sensor networks are deployed in a hostile environment, where beacon nodes can be compromised, such an assumption does not hold anymore. In this paper, we propose a general scheme to detect localization anomalies that are caused by adversaries. Our scheme is independent from the localization schemes. We formulate the problem as an anomaly intrusion detection problem, and we propose a number of ways to detect localization anomalies. We have conducted simulations to evaluate the performance of our scheme, including the false positive rates, the detection rates, and the resilience to node compromises.
13050911
Efficiency Centric Communication Model for Wireless Sensor Networks
Recent studies on radio reality provided strong evidence that radio links between low-power sensor devices are extremely unreliable. In this paper, we study how to improve energy efficiency for reliable communication using such unreliable links. We identify an optimal bound on energy efficiency for reliable communication, and propose a new communication model in the link layer that asymptotically approaches this bound. This new model indicates a better path metric compared to previous path metrics, and we validate this by establishing a routing infrastructure based on this metric, which indeed achieves a higher energy efficiency compared to other stateof-the-art approaches. We present results from a systematic analysis, simulations and prototype experiments based on the MicaZ platform. The results give us fundamental insights on communication efficiency over unreliable links.
1105662
A time window based approach for job shop scheduling
A time window based approach is developed for job shop scheduling problems to minimize the weighted earliness and tardiness cost. With the time windows provided by Lagrangian relaxation within which parts are processed to minimize the cost and an effective algorithm to find a feasible schedule within or approximately within the windows, the approach can generate schedules better than those generated by the Lagrangian relaxation approach for large problems in a similar computation time. This demonstrates that our approach can be used to solve practical scheduling problems with an improved performance.
17563993
The e-logistics framework in e-commerce
The growth of the supply chain concept has required logistics organizations to improve the flow of information both internally and externally. The increased information requirements have facilitated an integration of logistics information systems (LIS) and supply chain information systems in many companies. The increasing use of electronic commerce and other LIS tools and techniques will shape the business process for the foreseeable future. This paper introduces such a framework for e-logistics processes integration based on Web Services via incorporating (1)common alliance layer (2) adaptation layer; and (3) dynamic data binding mechanism. This framework can be adopted as a new service delivery model which uses a design pattern and solution templates. Companies should understand their options and their impacts when making decisions to support their supply chain systems.
1482280
SIGF: a family of configurable, secure routing protocols for wireless sensor networks
As sensor networks are deployed in adversarial environments and used for critical applications such as battlefield surveillance and medical monitoring, security weaknesses become a big concern. The severe resource constraints of WSNs give rise to the need for resource bound security solutions.In this paper we present SIGF (Secure Implicit Geographic Forwarding), a configurable secure routing protocol family for wireless sensor networks that provides "good enough" security and high performance. By avoiding or limiting shared state, the protocols prevent many common attacks against routing, and contain others to the local neighborhood.SIGF makes explicit the tradeoff between security provided and state which must be stored and maintained. It comprises three protocols, each forming a basis for the next: SIGF-0 keeps no state, but provides probabilistic defenses; SIGF-1 uses local history and reputation to protect against certain attacks; and SIGF-2 uses neighborhood-shared state to provide stronger security guarantees.Our performance evaluation shows that SIGF achieves high packet delivery ratios with low overhead and end-to-end delay. We evaluate the security of SIGF protocols under various security attacks and show that it effectively contains the damage from compromised nodes and defends against black hole, selective forwarding, Sybil, and some denial of service attacks.