Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
— This paper studies the contributions of routing dynamics to the duration of long-lived end-to-end Internet path failures. Studies have shown that end-to-end Internet failures (...
Abstract— This paper presents three algorithms that outperform all other published work for allocating a limited number of orthogonal frequency channels to access points (APs) in...
Jeremy K. Chen, Gustavo de Veciana, Theodore S. Ra...
Abstract— We propose the QoS-driven opportunistic cooperation schemes for the wireless relay networks. By integrating information theory with the concept of effective capacity, o...
— The quality of communications in mobile ad-hoc networks is largely determined by the topological stability. Characterizing the mobility of mobile nodes (e.g. how often they mov...