Dennis Goeckel

Neighbor discovery in wireless networks and the coupon collector's problem

Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algorithm in a synchronous system, proposed in an earlier work. When nodes do not have a collision detection mechanism, we show that this algorithm reduces to the classical {\em Coupon Collectors Problem}. Consequently, we show that each node discovers all its

Opportunistic Relaying for Secrecy Communications: Cooperative Jamming vs. Relay Chatting

n

A dynamically reconfigurable adaptive viterbi decoder

neighbors in an expected time equal to

Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks

ne (\ln n + c)

Limits of Reliable Communication with Low Probability of Detection on AWGN Channels

, for some constant

Efficient algorithms for neighbor discovery in wireless networks

c

A modern extreme value theory approach to calculating the distribution of the peak-to-average power ratio in OFDM systems

. When nodes have a collision detection mechanism, we propose an algorithm based on receiver status feedback which yields a

On the Study of Analogue Network Coding for Multi-Pair, Bidirectional Relay Channels

\ln n

A reconfigurable, power-efficient adaptive Viterbi decoder

improvement over the ALOHA-like algorithm. Our algorithms do not require nodes to have any estimate of the number of neighbors. In particular, we show that not knowing

Bounds on the throughput gain of network coding in unicast and multicast wireless networks

n