L Yang, Y Zou, D Yu, J Yu - Journal of Systems Architecture, 2023 - Elsevier
As an important concept to depict the freshness of an information when it arrives at the destination, the Age-of-Information (AoI) and its relative scheduling works can be a very …
D Yu, Y Zou, M Xu, Y Xu, Y Zhang… - IEEE Internet of …, 2020 - ieeexplore.ieee.org
In the past decades, Dynamic Internet of Things (D-IoT) networks have played a conspicuously more important role in many real-life areas, including disaster relief …
This paper investigates distributed Dominating Set (DS) and Connected Dominating Set (CDS) construction in dynamic wireless networks under the SINR interference model …
B Haeupler, F Kuhn - … 26th International Symposium, DISC 2012, Salvador …, 2012 - Springer
We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes …
D Yu, Y Zou, Y Zhang, H Sheng, W Lv… - … /ACM Transactions on …, 2021 - ieeexplore.ieee.org
In this paper, we present the first algorithm to precisely implement the abstract MAC (absMAC) layer under the physical SINR model in dynamic networks. The absMac layer, first …
Dynamic Networks. Large real-world networks are inherently very dynamic: the participants in peer-to-peer (P2P) networks change over time, mobile nodes in wireless networks move …
D Yu, Y Zou, J Yu, Y Wu, W Lv, X Cheng… - IEEE/ACM …, 2021 - ieeexplore.ieee.org
In this paper, we investigate distributed broadcasting in dynamic networks, where the topology changes continually over time. We propose a network model that captures the …
A distributed task is local if its time complexity is (nearly) constant, otherwise it is global. Unfortunately, local tasks are relatively scarce, and most distributed tasks require time at …
In this paper, we generalize the technique of smoothed analysis to apply to distributed algorithms in dynamic networks in which the network graph can change from round to round …