— Space-time communications can help combat fading and hence can significantly increase the capacity of ad hoc networks. Cooperative diversity or virtual antenna arrays facilita...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Mobile ad-hoc networks are typically very dynamic networks in terms of available communication partners, available network resources, connectivity, etc. Furthermore, the end-user ...
Thomas Plagemann, Vera Goebel, Carsten Griwodz, P&...
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...