—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, and access the data to dynamically generate responses to user reque...
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...