In this paper, we propose a novel ReliAble ProbabIlistic Dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and sel...
Vadim Drabkin, Roy Friedman, Gabriel Kliot, Marc S...
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment—in terms of node mobility as well as in ter...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...