We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
Abstract--In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimation...
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Abstract—In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimatio...