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 …

Cognitive radio network is designed to opportunistically exploit the licensed band. To deploy
a cognitive radio network, nodes need to perform the neighbor discovery process in order to …

Efficient neighbor discovery in vehicular ad hoc networks is crucial to a number of
applications such as driving safety and data transmission. The main challenge is the high …

We present a distributed stable protocol for local broadcast in multi-hop wireless networks,
where packets are injected to the nodes continuously, and each node needs to quickly …

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 …

We define a reliable neighbor discovery layer for mobile adhoc networks and present two
algorithms that implement this layer as a service with varying progress guarantees. Our …

A cognitive network makes use of the information gathered from the network in order to
sense the environment, plan actions according to the input, and make appropriate decisions …

In much of the theoretical literature on wireless algorithms, issues of message dissemination
are considered together with issues of contention management. This combination leads to …

In this paper, we study distributed algorithms to realize efficient communications under the
Rayleigh-fading model. This model extends the popular deterministic SINR model using …

In this paper, we study fault-tolerant distributed consensus in wireless systems. In more
detail, we produce two new randomized algorithms that solve this problem in the abstract …