Dissipative boundary conditions for nonlinear 1-D hyperbolic systems: sharp conditions through an approach via time-delay systems

We analyse dissipative boundary conditions for nonlinear hyperbolic systems in one space dimension. We show that a previous known sufficient condition for exponential stability with respect to the C^1-norm is optimal. In particular a known weaker sufficient condition for exponential stability with respect to the H^2-norm is not sufficient for the exponential stability with respect to the C^1-norm. Hence, due to the nonlinearity, even in the case of classical solutions, the exponential stability depends strongly on the norm considered. We also give a new sufficient condition for the exponential stability with respect to the W^{2,p}-norm. The methods used are inspired from the theory of the linear time-delay systems and incorporate the characteristic method

Understanding and modeling the small-world phenomenon in dynamic networks

The small-world phenomenon first introduced in the context of static graphs consists of graphs with high clustering coefficient and low shortest path length. This is an intrinsic property of many real complex static networks. Recent research has shown that this structure is also observable in dynamic networks but how it emerges remains an open problem. In this paper, we propose a model capable of capturing the small-world behavior observed in various real traces. We then study information diffusion in such small-world networks. Analytical and simulation results with epidemic model show that the small-world structure increases dramatically the information spreading speed in dynamic networks

Metric Regularity of the Sum of Multifunctions and Applications

In this work, we use the theory of error bounds to study metric regularity of the sum of two multifunctions, as well as some important properties of variational systems. We use an approach based on the metric regularity of epigraphical multifunctions. Our results subsume some recent results by Durea and Strugariu.Comment: Submitted to JOTA 37 page

Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks

This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN

Pervasive intelligent routing in content centric delay tolerant networks

This paper introduces a Swarm-Intelligence based Routing protocol (SIR) that aims to efficiently route information in content centric Delay Tolerant Networks (CCDTN) also dubbed pocket switched networks. First, this paper formalizes the notion of optimal path in CCDTN and introduces an original and efficient algorithm to process these paths in dynamic graphs. The properties and some invariant features of these optimal paths are analyzed and derived from several real traces. Then, this paper shows how optimal path in CCDTN can be found and used from a fully distributed swarm-intelligence based approach of which the global intelligent behavior (i.e. shortest path discovery and use) emerges from simple peer to peer interactions applied during opportunistic contacts. This leads to the definition of the SIR routing protocol of which the consistency, efficiency and performances are demonstrated from intensive representative simulations

How mobility increases mobile cloud computing processing capacity

In this paper, we address a important and still unanswered question in mobile cloud computing ``how mobility impacts the distributed processing power of network and computing clouds formed from mobile ad-hoc networks ?''. Indeed, mobile ad-hoc networks potentially offer an aggregate cloud of resources delivering collectively processing, storage and networking resources. We demonstrate that the mobility can increase significantly the performances of distributed computation in such networks. In particular, we show that this improvement can be achieved more efficiently with mobility patterns that entail a dynamic small-world network structure on the mobile cloud. Moreover, we show that the small-world structure can improve significantly the resilience of mobile cloud computing services