8 citations · 17 across the 5 of their papers we have counts for
3 papers · 1 filter
Computing Traversal Times on Dynamic Markovian Paths
Philippe Nain, Don Towsley, Matthew P. Johnson +3
In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed,…
Dynamic Coverage of Mobile Sensor Networks
Benyuan Liu, Olivier Dousse, Philippe Nain +1
In this paper we study the dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors. As sensors move around, initially uncovered loc…
An Improved Lower Bound to the Number of Neighbors Required for the Asymptotic Connectivity of Ad Hoc Networks
Sanquan Song, Dennis L. Goeckel, Don Towsley
Xue and Kumar have established that the number of neighbors required for connectivity of wireless networks with N uniformly distributed nodes must grow as log(N), and they also est…