In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
— Even though multiple non-overlapped channels exist in the 2.4GHz and 5GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a resul...
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...