Coupling dynamic simulation and interactive multiobjective optimization for complex problems: An APROS-NIMBUS case study

Dynamic process simulators for plant-wide process simulation and multiobjective optimization tools can be used by industries as a means to cut costs and enhance profitability. Specifically, dynamic process simulators are useful in the process plant design phase, as they provide several benefits such as savings in time and costs. On the other hand, multiobjective optimization tools are useful in obtaining the best possible process designs when multiple conflicting objectives are to be optimized simultaneously. Here we concentrate on interactive multiobjective optimization. When multiobjective optimization methods are used in process design, they need an access to dynamic process simulators, hence it is desirable for them to coexist on the same software platform. However, such a co-existence is not common. Hence, users need to couple multiobjective optimization software and simulators, which may not be trivial. In this paper, we consider APROS, a dynamic process simulator and couple it with IND-NIMBUS, an interactive multiobjective optimization software. Specifically, we: (a) study the coupling of interactive multiobjective optimization with a dynamic process simulator; (b) bring out the importance of utilizing interactive multiobjective optimization; (c) propose an augmented interactive multiobjective optimization algorithm; and (d) apply an APROS-NIMBUS coupling for solving a dynamic optimization problem in a two-stage separation process.     

交互式检索的用户模拟器研究综述

随着检索技术的发展,交互式检索在信息检索领域中变得尤为重要。交互式检索在传统检索模式下增加了捕捉用户细粒度行为的功能,以便通过用户模拟器提升检索引擎性能。基于规则的用户模拟器缺乏个性化用户特征,适应性较差。基于模型的用户模拟器能够学习到更多的用户个性化行为特征,可以有效提升交互式检索引擎的性能。阐述了用户模拟器与检索引擎的交互过程,对基于规则的用户模拟器和基于模型的用户模拟器的构建方法以及近年来用户模拟器的评价方法进行了归纳总结,并重点介绍了基于模型的用户模拟器。最后对比了面向交互式检索的用户模拟器和传统的用户模拟器的差异,并以交互式学位论文检索场景为例,通过此检索场景对用户模拟器的应用进行了展望。     

F-Ant: an effective routing protocol for ant colony optimization based on fuzzy logic in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) are a subset of mobile ad hoc networks that provide communication services between nearby vehicles and also between vehicles and roadside infrastructure. These networks improve road safety and accident prevention and provide entertainment for passengers of vehicles. Due to the characteristics of VANET such as self-organization, dynamic nature and fast-moving vehicles, routing in this network is a considerable challenge. Swarm intelligence algorithms (nature-inspired) such as ant colony optimization (ACO) have been proposed for developing routing protocols in VANETs. In this paper, we propose an enhanced framework for ACO protocol based on fuzzy logic for VANETs. To indicate the effectiveness and performance of our proposed protocol, the network simulator NS-2 is used for simulation. The simulation results demonstrate that our proposed protocol achieves high data packet delivery ratio and low end-to-end delay compared to traditional routing algorithms such as ACO and ad hoc on-demand distance vector (AODV).

     

用于Ad hoc网的网络仿真器的比较

仿真是目前研究 Ad hoc网协议和算法的唯一有效手段 .描述了现有的用于 Ad hoc网仿真的两种网络仿真器 :ns- 2和 Glo Mo Sim ,介绍了它们各自的软件体系结构和特点 ,并对它们的优缺点进行了比较和讨论 ,为选用合适的网络仿真器、扩展其功能、以及开发网络仿真器指出了方向     

An artificial immune system approach with secondary response for misbehavior detection in mobile ad hoc networks

In mobile ad hoc networks, nodes act both as terminals and information relays, and they participate in a common routing protocol, such as dynamic source routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavior detection systems aim at removing this vulnerability. In this paper, we investigate the use of an artificial immune system (AIS) to detect node misbehavior in a mobile ad hoc network using DSR. The system is inspired by the natural immune system (IS) of vertebrates. Our goal is to build a system that, like its natural counterpart, automatically learns, and detects new misbehavior. We describe our solution for the classification task of the AIS; it employs negative selection and clonal selection, the algorithms for learning and adaptation used by the natural IS. We define how we map the natural IS concepts such as self, antigen, and antibody to a mobile ad hoc network and give the resulting algorithm for classifying nodes as misbehaving. We implemented the system in the network simulator Glomosim; we present detection results and discuss how the system parameters affect the performance of primary and secondary response. Further steps will extend the design by using an analogy to the innate system, danger signal, and memory cells.     

Cloud simulators in the implementation and evaluation of virtual machine placement algorithms

In recent years, many algorithms have been proposed for the optimized allocation of virtual machines in cloud data centers. Such algorithms are usually implemented and evaluated in a cloud simulator. This paper investigates the impact of the choice of cloud simulator on the implementation of the algorithms and on the evaluation results. In particular, we report our experiences with porting an algorithm and its evaluation framework from one simulator (CloudSim) to another (DISSECT‐CF). Our findings include limitations in the design of the simulators and in existing algorithm implementations. Based on this experience, we propose architectural guidelines for the integration of virtual machine allocation algorithms into cloud simulators.     

Toward scalable cloud data center simulation using high-level architecture

Existing simulators are designed to simulate a few thousand nodes due to the tight integration of modules. Thus, with limited simulator scalability, researchers/developers are unable to simulate protocols and algorithms in detail, although cloud simulators provide geographically distributed data centers environment but lack the support for execution on distributed systems. In this paper, we propose a distributed simulation framework referred to as CloudSimScale. The framework is designed on top of highly adapted CloudSim with communication among different modules managed using IEEE Std 1516 (high-level architecture). The underlying modules can now run on the same or different physical systems and still manage to discover and communicate with one another. Thus, the proposed framework provides scalability across distributed systems and interoperability across modules and simulators.     

衰落信道下的无线Ad Hoc网络的有效仿真

现有的网络仿真软件对无线信道尤其是移动衰落信道支持较弱,这些软件大都假设信道在帧的传输期间保持恒定,而在帧与帧之间变化.本文指出,这种基于帧的模型不能有效地仿真无线Ad Hoc网络的节点移动特性,网络的仿真要能够刻画信道在帧内的变化,因而提出了基于bit的模型.仿真结果表明,在基于bit的信号接收模型下,误帧率随着节点移动速度的增加急剧增长,而使用基于帧的模型得到的误帧率与移动速率无关.该模型对于目前的Ad Hoc网络的交叉层协议设计具有重要的参考价值.     

Risk-based attack strategies for mobile ad hoc networks under probabilistic attack modeling framework

In this paper, we introduce and design a modeling framework that allows for the study and analysis of attack propagation in mobile ad hoc networks. The choice of a statistical approach for the problem is motivated by the dynamic characteristics of the ad hoc topology and the stochastic nature of threat propagation. Based on this probabilistic modeling framework, we study the impact of topology and mobility in the propagation of software threats over ad hoc networks. We design topology control algorithms that indicate how to properly adjust an attacker’s transmission radius, according to the measured topological characteristics and availability of its resources, in the process of infecting a network more effectively. Then based on these topology control algorithms we develop different attack strategies that may range from independent attacks to cooperative scenarios in order to increase the negative impact of an attack on the network. Our performance evaluation results demonstrate that the proposed topology control algorithms and respective attack strategies effectively balance the tradeoffs between the potential network damage and the attackers’ lifetime, and as a result significantly outperform any other flat and threshold-based approaches.     

Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks

Motivated by cooperative communication in ad hoc networks, Wu et al. proposed extended dominating set (EDS) where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors, and defined two types of dominating sets: extended strongly connected dominating set (ECDS) and extended weakly connected dominating set (EWCDS), according to the success of a broadcast process. An EWCDS is an effective method for clustering. In this paper, we extend the dominative capabilities of nodes such that each forward node dominates not only itself and its regular neighbors fully, but also its quasi-neighbors partly. Based on this extension, three novel algorithms to find EWCDSs in ad hoc networks are proposed. The correctness and performance of our algorithms are confirmed through theoretical analysis and comprehensive simulations.     

Joint routing and flow rate optimization in multi-rate ad hoc networks

Typical radios in ad hoc networks can support multi-rate transmissions. However, traditional routing protocols do not use this feature well in multi-rate ad hoc networks and therefore, the network performance and resource utilization are not optimized. Some algorithms have been proposed to take advantage of the multi-rate transmission scheme, but their performance is not optimized either. In this paper, we show that a cross-layer optimization based approach can significantly improve the performance of multi-rate ad hoc networks over existing routing algorithms. For this, we consider link interference and propose joint routing and flow rate optimization for optimal performance in multi-rate ad hoc networks, i.e., a Cross-layer Optimization based Model for Multi-rate Ad hoc Networks (COMMAN). Considering the characteristics of multi-rate ad hoc networks, we design and implement a distributed heuristic of this centralized model. It is shown that the distributed heuristic algorithm can approximate the performance of COMMAN closely.     

JiST: an efficient approach to simulation using virtual machines

Discrete event simulators are important scientific tools and their efficient design and execution is the subject of much research. In this paper, we propose a new approach for constructing simulators that leverages virtual machines and combines advantages from the traditional systems‐based and language‐based simulator designs. We introduce JiST, a Java‐based simulation system that executes discrete event simulations both efficiently and transparently by embedding simulation semantics directly into the Java execution model. The system provides standard benefits that the modern Java runtime affords. In addition, JiST is efficient, out‐performing existing highly optimized simulation runtimes. As a case study, we illustrate the practicality of the JiST framework by applying it to the construction of SWANS, a scalable wireless ad hoc network simulator. We simulate million node wireless networks, which represents two orders of magnitude increase in scale over what existing simulators can achieve on equivalent hardware and at the same level of detail. Copyright © 2005 John Wiley & Sons, Ltd.     

Error analysis in accelerated session-level MANET simulations

Simulation investigations form a vital part of networking research, and have long been used by the research community interested in mobile ad hoc networks (MANETs) to design protocols and to evaluate quality of service mechanisms. Many MANET simulators developed so far model the network with high granularity in order to ensure the accuracy of the simulation results. But those tools are often too computationally expensive to simulate large-scale MANETs. This paper reports a new session-level MANET simulator and develops an error analysis approach which uniquely allows for optimal parameterization of the time-stepping simulation methods. The novelty lies in broadening the simulation acceleration method, model abstraction, to MANET simulation. At the same time the methodological challenges of validation are addressed through both analytical and experimental approaches. The proposed techniques were implemented in SSIM, a session-level simulator for MANETs. The experimental results show that the proposed accelerated simulation solution achieves significant acceleration by reducing the number of events, and the wall-clock simulation time, while retaining excellent accuracy.     

自组织网络基于邻居信息广播算法综述

随着网络的发展,自组织网络因其自组织、无需固定设施支持等特点成为近年来新兴的研究热点问题。而自组织网络的广播算法因在路由发现过程中的关键作用而受到广大研究者的关注。基于邻居信息广播算法是当前比较流行的自组织网络广播算法。本文主要对基于邻居信息的广播算法进行详细的分类和比较,同时分析了不同广播算法的优点和缺点。最后,对自组织网络基于邻居信息的广播算法进行了总结和展望。     

Ad Hoc无线网络公平调度算法研究

随着个人通信的日益增长，支持诸如移动会议、移动网络以及自然灾难营救的ad hoc无线网络逐渐从军用扩大到商用等诸多领域。商用ad hoc无线同使用一种称为“付贾使用”(pay—for—use)的模式，于是在用户间定义合理的公平机制则变得非常重要。公平机制的核心问题是公平调度算法问题。但是在ad hoc无线网中，公平分配带宽和最大化利用资源本质上是冲突的，这为公平调度算法的设计带来了巨大的挑战。本文系统地研究了著名的公平性标准以及两类公平调度机制。通过模拟和分析，我们讨论了这两类公平调度机制中存在的问题。此外，我们提出了一种新的公平调度模型并给出了模拟结果。模拟结果表明，该算法在公平性和带宽利用率之间实现了理想的平衡。     

RETENTION: A reactive trust-based mechanism to detect and punish malicious nodes in ad hoc grid environments

In ad hoc grid environments, resources are not always available since nodes can spontaneously connect and disconnect at any time. Thus, these environments demand the correct execution of tasks to guarantee good performance. However, there are malicious users that affect the normal operation of these grids. These users modify tasks results and even cheat security mechanisms. Therefore, to assure high performance in these grid computing scenarios, it is essential to use punishment procedures based on trust models. These solutions have been used in wireless ad hoc networks, but not in the context of ad hoc grid computing. Thus, in this paper, we first present an analysis of mathematical trust models in ad hoc grid scenarios, using different ways to treat detection information passed on by other nodes. Then, we provide a comparison and a performance evaluation of these models using a grid simulator platform. Besides that, we choose the most accurate trust model among the evaluated ones to propose RETENTION: a reactive trust-based mechanism to detect and punish malicious nodes in ad hoc grid environments. Simulation results demonstrate the effectiveness of the proposed approach in detecting and punishing up to 100% of malicious nodes without generating false-positives. The results can be a valuable tool for network designers in planning trust models in ad hoc grid network deployments.     

Energy-Efficient Wireless Network Design

A crucial issue in wireless networks is to support efficiently communication patterns that are typical in traditional (wired) networks. These include broadcasting, multicasting, and gossiping (all-to-all communication). In this work we study such problems in static ad hoc networks. Since, in ad hoc networks, energy is a scarce resource, the important engineering question to be solved is to guarantee a desired communication pattern minimizing the total energy consumption. Motivated by this question, we study a series of wireless network design problems and present new approximation algorithms and inapproximability results.     

Service discovery in mobile ad hoc networks: A field theoretic approach

Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hence not well suited for mobile ad hoc networks. In this paper, we present a novel decentralized service discovery mechanism for ad hoc networks. The basic idea is to distribute information about available services to the network neighborhood. We achieve this by using the analogy of an electrostatic field: A service is modelled by a (positive) point charge, and service request packets are seen as (negative) test charges which are attracted by the service instances. In our approach, we map the physical model to a mobile ad hoc network in a way where each network element calculates a potential value and routes service requests towards the neighbor with the highest potential, hence towards a service instance. Our approach allows for differentiation of service instances based on their capacity. We define the required protocols and methods which we implemented in a network simulator. Using extensive simulations, we evaluate the performance and robustness of the mechanisms. The results indicate good performance and convergence even in highly mobile environments. We believe that this technique can and should be further exploited, e.g., as a routing protocol in mobile ad hoc networks.     

移动自组织网络路由选择算法研究进展

移动Ad Hoc无需基础设施,可支持高动态的移动数据通信,具有广泛应用的前景。然而,其高动态特性导致互联网现有路由协议不再适用。近年来学者针对Ad Hoc网络提出了大量的路由选择算法。给出了各种路由技术分类方法,简述了Ad Hoc网络的基本路由协议和路由选择算法,进而从预测模型、能量模型、位置信息、服务质量控制和安全支持等5个角度,深入分析了当前Ad Hoc网络路由选择算法的最新研究进展。预测模型通过基于历史信息的移动预测,降低了路由选择的时间代价;能耗模型则采用适当的数学模型来描述网络能耗情况,在选路过程中实现了分组传送的能耗最小化和能量负担均衡之间的权衡;基于位置的路由选择算法根据节点的地理位置来标识目的地,从而利用该地理位置信息进行路由选择;服务质量感知的路由选择算法在本地计算中考虑带宽、延迟、能量和电池生命周期,从而在选路过程中提供了服务质量支持;安全路由选择算法则利用适合移动Ad Hoc网络的密钥、哈希链、电子签名等技术对协议交互消息进行加密来保障网络安全。最后从通信开销、计算和存储开销、路径数量、关键节点的存在性以及算法类型等方面详细对比总结了近年来提出的30余种典型路由选择算法,指出了各自的特点...     

Distributed initialization algorithms for single-hop ad hoc networks with minislotted carrier sensing

An ad hoc network is a self-organized and distributed entity, consisting of n mobile stations (MSs) without the coordination of any centralized access point. Initialization is one of the fundamental tasks to set up an ad hoc network, which involves assigning each of the n MSs a distinct ID number from 1 to n, distributedly. In Nakano et al. (2000), randomized initialization protocols are developed for single-hop ad hoc networks under different conditions. However, carrier sensing has not been utilized and suitable acknowledgment schemes for the algorithms are not developed. Moreover, the assumption taken by Nakano et al. about MSs being able to listen while transmitting is not valid for ad hoc networks. In this context, we describe two algorithms for initializing an ad hoc network with carrier sensing capability. First, a novel acknowledgment scheme is proposed for notifying a transmitting MS whether its transmission is successful during the initialization. Then, two distributed and randomized initialization algorithms are developed and analyzed, under the assumptions of a known and unknown number of users in the network, respectively. Both algorithms are obtained based on optimizing some key parameters to minimize the total time required to complete the initialization. Both theoretical analysis and simulations indicate that the proposed initialization algorithms outperform the existing methods, in the sense that they take much less time to complete the initialization and the average number of transmission attempts before success is much smaller.