We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
Abstract—Recently, distributed data storage has gained increasing popularity for efficient and robust data management in wireless sensor networks (WSNs). But the distributed arc...
In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop w...
Reservoir sampling is a well-known technique for sequential random sampling over data streams. Conventional reservoir sampling assumes a fixed-size reservoir. There are situation...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...