This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
Abstract-- We consider the problem of Spectrum Sensing in Cognitive Radio Networks. In our previous work we have developed DualCUSUM, a distributed algorithm for change detection a...
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...