This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...