— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
Qingquan Zhang, Yu Gu, Tian He, Gerald E. Sobelman
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Abstract—Since the xDSL specifications impose stringent linearity requirements to ensure the integrity of the data transferred, current line drivers use linear amplifiers. The do...
Vincent De Gezelle, Jordie Buyle, Jan Doutreloigne