Search

The random key graph is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law ...

We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph ...

The Continuous Replenishment Inventory Routing Problem (CRIRP) is a special type of inventory routing problem (IRP) in which vehicle operations occur around the clock. The problem requires determining how many vehicles ...

We propose a component based modelling and design strategy for the Neighborhood Discovery Component (NDC) and the Selector of Topology Information to Disseminate Component (STIDC) of proactive ad hoc routing protocols. ...

Link state routing mechanisms have shown good convergence behaviour with mobile hosts. Pruning methods such as those used in Optimized Link State Routing (OLSR) have showed good throughput behaviour when compared to ...

In this paper, we provide convergence results for an Ant-Based Routing (ARA) Algorithm for wireline, packet-switched communication networks, that are acyclic. Such algorithms are inspired by the foraging behavior of ants ...

In this note we study the performance metrics (rate of convergence and guaranteed region of convergence) of a multi-agent subgradient method for optimizing a sum of convex functions. We assume that the agents exchange ...

Extending Rudolph's works on the convergence analysis of evolutionary computation (EC) for deterministic combinatorial optimization problems (COPs), this brief paper establishes a probability one convergence of some variants ...

Consider a first order linear time-invariant discrete time system driven by process noise, a pre-processor that accepts causal measurements of the state of the system, and a state estimator. The pre-processor and the state ...

In this paper, we introduce the stable path topology control problem for routing in Mobile Ad Hoc Networks (MANETs). We formulate the problem as a constrained multiagent optimization problem with only local neighborhood ...