The study of dynamic networks has come into popularity recently, and many models and
algorithms for such networks have been suggested. In this column we survey some recent …

In wireless network applications, packet length is a key factor in affecting packet loss
probability, and channel scheduling protocol can effectively reduce packet length by …

Broadcasting is a basic network communication task, where a message initially held by a
source node has to be disseminated to all other nodes in the network. Fast algorithms for …

Dynamicity is one of the most challenging, yet, key aspects of wireless networks. It can come
in many guises, such as churn (node insertion/deletion) and node mobility. Although the …

This paper addresses the static output‐feedback sliding mode control (SMC) problem for a
class of uncertain control systems subject to the round‐robin protocol scheduling, in which …

A diversity of possible communication assumptions complicates the study of algorithms and
lower bounds for radio networks. We address this problem by defining an abstract MAC …

This paper studies the event-triggered (ET) L 2-gain control issues for time-delay networked
control systems (NCSs) subject to round-robin protocol. The considered NCS consists of n …

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 …

We consider the fault-tolerant consensus problem in wireless ad hoc networks with crash-
prone nodes. We develop consensus algorithms for single-hop environments where the …

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 …