Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to
intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and …

We present the discrete bee** communication model, which assumes nodes have
minimal knowledge about their environment and severely limited communication …

We consider the problem of computing a maximal independent set (MIS) in an extremely
harsh broadcast model that relies only on carrier sensing. The model consists of an …

We provide a non-unit-disk framework to solve combinatorial optimization problems such as
maximum cut and maximum independent set on a Rydberg quantum annealer. Our setup …

In this paper we address a common question in wireless communication: How long does it
take to satisfy an arbitrary set of wireless communication requests? This problem is known …

In this work we analyze the complexity of local broadcasting in the physical interference
model. We present two distributed randomized algorithms: one that assumes that each node …

We consider the scheduling of arbitrary wireless links in the physical model of interference to
minimize the time for satisfying all requests. We study here the combined problem of …

In this paper, we consider the classical problem of link scheduling in wireless networks
under an accurate interference model, in which correct packet reception at a receiver node …

We design leader election protocols for multi-hop radio networks that elect a leader in
almost the same time TBC that it takes for broadcasting one message (one ID). For the …

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 …