Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
Alexander Sprintson, Marcelo Yannuzzi, Ariel Orda,...
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
— We propose an Efficient Reliable Data Collection (eRDC) algorithm. The eRDC is designed for energy-constraint wireless sensor networks (WSN) to balance reliability and energy c...
Ren Ping Liu, John Zic, Iain B. Collings, Alex Y. ...
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...