Learn More
The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems – delay-tolerant networks, opportunistic-mobility networks, social networks – obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the(More)
The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to handle it in a context-reactive manner, and, when possible, with algorithms that are localized and decentralized. The present paper shows how the DA-GRS model, that is a high level(More)
In this paper we approach the definition of new methodologies for the visualization and the exploration of social networks and their dynamics. We present a recently introduced formalism called TVG (for time-varying graphs), which was initially developed to model and analyze highly-dynamic and infrastructure-less communication networks, and TVG derived(More)
Most instruments-formalisms, concepts, and metrics-for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently led researchers to consider temporal versions of distance, connectivity, and related indicators), to the evolution of(More)
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at their assumptions on the underlying network. This paper focuses on the study of such assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution. Our main contribution is a(More)
Vehicular networks are envisioned for large scale deployment, and standardization bodies, car manufacturers and academic researchers are solving a variety of related challenges. After a brief description of intelligent transportation system architectures and the main already-established low-level standards, this tutorial elaborates on four particular(More)
—This paper proposes a new solution to the problem of self-deploying a network of wireless mobile robots with simultaneous consideration to several criteria, that are, the fault-tolerance (biconnectivity) of the resulting network, its coverage, its diameter, and the quantity of movement required to complete the deployment. These criteria have already been(More)
—We introduce a new time-efficient Bluetooth Scatter-net Formation (BSF) algorithm, called BSF-UED (Unnecessary-Edges Deletion). BSF-UED forms connected scatternets determin-istically. Heuristics are added to make these scatternets outdegree limited (that is, with no more than 7 slaves per piconet). The performance of the algorithm is evaluated through a(More)