A reinforcement learning-based routing for delay tolerant networks

Delay Tolerant Reinforcement-Based (DTRB) is a delay tolerant routing solution for IEEE 802.11 wireless networks which enables device to device data exchange without the support of any pre-existing network infrastructure. The solution utilizes Multi-Agent Reinforcement Learning techniques to learn about routes in the network and forward/replicate the messages that produce the best reward. The rewarding process is executed by a learning algorithm based on the distances between the nodes, which are calculated as a function of time from the last meetings. DTRB is a flooding-based delay tolerant routing solution. The simulation results show that DTRB can deliver more messages than a traditional delay tolerant routing solution does in densely populated areas, with similar end-to-end delay and lower network overhead.     

Coordinating a two-level supply chain with delay in payments and profit sharing

Achieving effective coordination among suppliers and retailers has become a pertinent research issue in supply chain management. Channel coordination is a joint decision policy achieved by a supplier(s) and a retailer(s) characterized by an agreement on the order quantity and the trade credit scenario (e.g., quantity discounts, delay in payments). This paper proposes a centralized model where players in a two-level (supplier–retailer) supply chain coordinate their orders to minimize their local costs and that of the chain. In the proposed supply chain model the permissible delay in payments is considered as a decision variable and it is adopted as a trade credit scenario to coordinate the order quantity between the two-levels. Computational results indicate that with coordination, the retailer orders in larger quantities than its economic order quantity, with savings to either both players, or to one in the supply chain. Moreover, a profit-sharing scenario for the distribution of generated net savings among the players in the supply chain is presented. Analytical and experimental results are presented and discussed to demonstrate the effectiveness of the proposed model.     

A dynamic programming method with lists for the knapsack sharing problem

In this paper, we propose a method to solve exactly the knapsack sharing problem (KSP) by using dynamic programming. The original problem (KSP) is decomposed into a set of knapsack problems. Our method is tested on correlated and uncorrelated instances from the literature. Computational results show that our method is able to find an optimal solution of large instances within reasonable computing time and low memory occupancy.     

State estimation of recurrent neural networks with time-varying delay: A novel delay partition approach

The state estimation problem is studied in this paper for a class of recurrent neural networks with time-varying delay. A novel delay partition approach is developed to derive a delay-dependent condition guaranteeing the existence of a desired state estimator for the delayed neural networks. The design of the gain matrix of the state estimator can be achieved by solving a linear matrix inequality, where no slack variable is involved. A numerical example is finally provided to show the advantage of the proposed approach over some existing results.     

An exact constructive algorithm for the knapsack sharing problem

In this paper, we study the knapsack sharing problem (KSP), a variant of the well-known NP-hard single knapsack problem. We propose an exact constructive tree search that combines two complementary procedures: a reduction interval search and a branch and bound. The reduction search has three phases. The first phase applies a polynomial reduction strategy that decomposes the problem into a series of knapsack problems. The second phase is a size reduction strategy that makes the resolution more efficient. The third phase is an interval reduction search that identifies a set of optimal capacities characterizing the knapsack problems. Experimental results provide computational evidence of the better performance of the proposed exact algorithm in comparison to KSPs best exact algorithm, to Cplex and to KSPs latest heuristic approach. Furthermore, they emphasize the importance of the reduction strategies.     

Comparison of PI controllers designed for the delay model of TCP/AQM networks

One of the major problems of communication networks is congestion. In order to address this problem in TCP/IP networks, Active Queue Management (AQM) scheme is recommended. AQM aims to minimize the congestion by regulating the average queue size at the routers. To improve upon AQM, recently, several feedback control approaches were proposed. Among these approaches, PI controllers are gaining attention because of their simplicity and ease of implementation. In this paper, by utilizing the fluid-flow model of TCP networks, we study the PI controllers designed for TCP/AQM. We compare these controllers by first analyzing their robustness and fragility. Then, we implement these controllers in ns-2 platform and conduct simulation experiments to compare their performances in terms of queue length. Taken together, our results provide a guideline for choosing a PI controller for AQM given specific performance requirements.     

Stochastic characterization of the spectrum sharing game in ad-hoc networks

This work focuses on infrastructure-less ad hoc wireless networks where multiple transmitter/receiver pairs share the same radio resources (spectrum); transmitters have to choose how to split a total power budget across orthogonal spectrum bands with the goal to maximize their sum rate under cumulative interference from concurrent transmissions. We start off by introducing and characterizing the non-cooperative game among transmitter/receiver pairs when the network topology is deterministically given. The corresponding Nash equilibria are derived, highlighting their dependency on the topological parameters (distances between wireless nodes, propagation model, and background noise power). The analysis is then extended to the case of random network topologies drawn from a given spatial stochastic process. Tools of stochastic geometry are leveraged to derive a statistical characterization of the equilibria of the spectrum sharing game. Finally, a distributed algorithm is proposed to let the players of the spectrum sharing game converge to equilibria conditions. Numerical simulations show that the proposed algorithm drives the users to stable points that are close to the equilibria of the game requiring limited information exchange among nodes.     

An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem

We present an optimal solution procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. In this problem, we assume the constrained renewable resources are limited to very expensive equipments and machines that are used in other projects and are not available in all periods of time of a project. In other words, for each resource, there is a dictated ready date as well as a due date such that no resource can be available before its ready date but the resources are permitted to be used after their due dates by paying penalty cost depending on the resource type. We also assume that only one unit of each resource type is available and no activity needs more than it for execution. The objective is to determine a schedule with minimal total weighted resource tardiness penalty costs. For this purpose, we present a branch-and-bound algorithm in which the branching scheme starts from a graph representing a set of conjunctions (the classical finish-start precedence constraints) and disjunctions (introduced by the resource constraints). In the search tree, each node is branched to two child nodes based on the two opposite directions of each undirected arc of disjunctions. Selection sequence of undirected arcs in the search tree affects the performance of the algorithm. Hence, we developed different rules for this issue and compare the performance of the algorithm under these rules using a randomly generated benchmark problem set.     

Joint fingerprinting and encryption in hybrid domains for multimedia sharing in social networks

The advent of social networks and cloud computing has made social multimedia sharing in social networks become easier and more efficient. The lowered cost of redistribution, however, also invites much motivation for large-scale copyright infringement, so it is necessary to safeguard multimedia sharing for security and privacy. In this paper, we proposed a novel framework for joint fingerprinting and encryption (JFE) based on Cellular Automata (CA) and social network analysis (SNA) with the purpose of protecting media distribution in social networks. The motivation is to map the hierarchical community structure of social networks into the tree structure of Discrete Wavelet Transform (DWT) for fingerprinting and encryption. First, the fingerprint code is produced by using SNA. Then the obtained fingerprints are embedded into the DWT domain. Afterwards, CA is used for permutation in the DWT domain. Finally, the image is diffused with XOR operation in the spatial domain. The proposed method, to the best of our knowledge, is the first JFE method using CA and SNA in hybrid domains for security and privacy in social networks. The use of fingerprinting along with encryption can provide a double-layer protection for media sharing in social networks. Both theoretical analysis and experimental results validate the effectiveness of the proposed scheme.     

A dynamic multicast tree based routing scheme without replication in delay tolerant networks

Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that supports the distribution of data to a group of users: a service needed for many potential DTN applications. While multicasting in the Internet and in mobile ad hoc networks has been studied extensively, efficient multicasting in DTNs is a considerably different and challenging problem due to the probabilistic nature of contact among nodes. This paper aims to provide a non-replication multicasting scheme in DTNs while keeping the number of forwardings low. The address of each destination is not replicated, but is assigned to a particular node based on its contact rate level and active level. Our scheme is based on a dynamic multicast tree where each leaf node corresponds to a destination. Each tree branch is generated at a contact based on the compare–split rule proposed in this paper. The compare part determines when a new search branch is needed, and the split part decides how the destination set should be partitioned. When only one destination is left in the destination set, we use either wait (no further relay) or focus (with further relay) to reach the final destination. The effectiveness of our approach is verified through extensive simulations. Ratio-based-split performs best in the compare–split step, both in synthetic and real traces. Using the wait scheme can reduce the number of forwardings, while using the focus scheme can reduce the latency.     

VxWorks下共享中断的多串口卡驱动设计

本文介绍了嵌入式操作系统VxWorks下的串口驱动程序的结构和基于16C554芯片的多串口扩展卡，分析了共享中断的多串口扩展卡的标准驱动开发过程，最后介绍了简单的非标准驱动的实现方法。     

On the weighted sensitivity minimization problem for delay systems

We consider the H^∞-optimal sensitivity problem for delay systems. In particular, we consider computation of μ:= inf {|W-φq|_∞ : q ε H^∞(j )} where W(s) is any function in RH^∞(j ), and φ in H^∞(j ) is any inner function. We derive a new explicit solution in the pure delay case where φ = e^−sh, h > 0.     

The impact of the distance-dependent promotional effect on the promotion cost sharing decision

This paper considers the promotion cost sharing decision between a supplier and a retailer. The customer demand is affected by both national and local promotional effects while the local promotional effect on a customer is dependent on the distance between the retailer and this customer. We propose a continuous approximation approach to modelling the sum of the customer demand in the whole market area served by the retailer. A model is provided to help managers decide on the retail price, the local advertising expenditure, the national advertising expenditure, and the supplier participation rate, with consideration of the influence of distance on the promotional effect. We also find that the supplier's promotion cost sharing rate increases as the market size increases or the influence of distance on the promotional effect decreases. A numerical example is given to show that the nature of distance-dependent promotional effect has a significant impact on the decisions and profits.     

A new method for computing delay margins for stability of linear delay systems

This note is concerned with stability properties of linear time-invariant delay systems. We consider delay systems of retarded type modeled both as a high order scalar differential-difference equation and as a set of first order differential-difference equations expressed in state space form. We provide a computational method that can be used to compute a delay interval such that the system under consideration is stable for all delay values that lie in the computed interval. This method requires computing only the eigenvalues and generalized eigenvalues of certain constant matrices and it can be implemented efficiently. Based on this method, we further state a simple necessary and sufficient condition concerning stability independent of delay for each of the two types of the models.     

Assessing the value of information sharing and its impact on the performance of the various partners in supply chains

With major developments in information and communication technologies, real-time information sharing becomes a significant challenge and has a considerable impact on the overall performance of supply chains. Here, we study the influence of information sharing for a monoproduct serial supply chain consisting of a supplier, warehouse, retailer and customers in the context of a decentralized decision. The objectives of this study are twofold: (1) to estimate the gains from sharing different types of information on each elementary cost and for each partner of the supply chain in detail and (2) to determine the cumulative impact of simultaneously sharing different types of information.A mathematical model is developed to assess the value of information sharing in terms of logistic costs and for different combinations related to the sharing or non-sharing of three types of upstream and downstream information: the customer demand and the supplier-warehouse and warehouse-retailer lead times. A perturbation is also injected to consider the intended or unintended distortion in the communicated information.Our study clearly showed that the gains are not cumulative when we simultaneously share different types of information. The results also highlighted the necessity to establish incentive cooperation mechanisms between the different links in the supply chain in many scenarios where the gains are not balanced. A distortion in the communicated information can also have a significant effect on the gains from sharing.     

A simple index rule for efficient traffic splitting over parallel wireless networks with partial information

Multi-path communication solutions provide a promising means to improve the network performance in areas covered by multiple wireless access networks. Today, little is known about how to effectively exploit this potential. We study a model where flows are transferred over multiple parallel networks, each of which is modeled as a processor sharing node. The goal is to minimize the expected transfer time of elastic data traffic by smartly dispatching the flows to the networks, based on partial information about the numbers of foreground and background flows in each of the nodes. In the case of full state information, the optimal policy can be derived via standard MDP-techniques, but for models with partial information an optimal solution is hard to obtain. An important requirement is that the splitting algorithm is efficient, yet simple, easy-to-implement, scalable in the number of parallel networks and robust against changes in the parameter settings. We propose a simple index rule for splitting traffic streams based on partial information, and benchmark the results against the optimal solution in the case of full state information. Extensive simulations with real networks show that this method performs extremely well under practical circumstances for a wide range of realistic parameter settings.     

A numerical algorithm for stability testing of fractional delay systems

This paper presents an effective numerical algorithm for testing the BIBO stability of fractional delay systems described by fractional-order delay-differential equations. It is based on using Cauchy's integral theorem and solving an initial-value problem. The algorithm has a reliable result which is illustrated by several examples, and hence is practically useful in the analysis and design of feedback control for both integer- and fractional-order systems having time delays.     

Hopfield networks for identification of delay differential equations with an application to dengue fever epidemics in Cuba

This work is aimed at proposing an algorithm, based upon Hopfield networks, for estimating the parameters of delay differential equations. This neural estimator has been successfully applied to models described by Ordinary Differential Equations, whereas its application to systems with delays is a novel contribution. As a case in point, we present a model of dengue fever for the Cuban case, which is defined by a delay differential system. This epidemiological model is built upon the scheme of an SIR (susceptible, infected, recovered) population system, where both delays and time-varying parameters have been included. The latter are thus estimated by the proposed neural algorithm. Additionally, we obtain an expression of the Basic Reproduction Number for our model. Experimental results show the ability of the estimator to deal with systems with delays, providing plausible parameter estimations, which lead to predictions that are coherent with actual epidemiological data. Besides, when the Basic Reproduction Number is computed from the estimated parameter values, results suggest an evolution of the epidemic that is consistent with the observed infection. Hence the estimation could help health authorities to both predict the future trend of the epidemic and assess the efficiency of control measures.