14 research outputs found
Collaborative Broadcast in O(log log n) Rounds
We consider the multihop broadcasting problem for nodes placed uniformly
at random in a disk and investigate the number of hops required to transmit a
signal from the central node to all other nodes under three communication
models: Unit-Disk-Graph (UDG), Signal-to-Noise-Ratio (SNR), and the wave
superposition model of multiple input/multiple output (MIMO). In the MIMO
model, informed nodes cooperate to produce a stronger superposed signal. We do
not consider the problem of transmitting a full message nor do we consider
interference. In each round, the informed senders try to deliver to other nodes
the required signal strength such that the received signal can be distinguished
from the noise. We assume sufficiently high node density . In the unit-disk graph model, broadcasting needs
rounds. In the other models, we use an Expanding Disk Broadcasting Algorithm,
where in a round only triggered nodes within a certain distance from the
initiator node contribute to the broadcasting operation. This algorithm
achieves a broadcast in only rounds in the
SNR-model. Adapted to the MIMO model, it broadcasts within rounds. All bounds are asymptotically tight and hold with high
probability, i.e. .Comment: extended abstract accepted for ALGOSENSORS 201
Combined distributed turbo coding and space frequency block coding techniques
The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547
Combined distributed turbo coding and space frequency block coding techniques
The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547
Combined distributed turbo coding and space frequency block coding techniques
The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547
Low-Power Low-Rate Goes Long-Range: The Case for Secure and Cooperative Machine-to-Machine Communications
Part 3: - WCNS 2011 WorkshopInternational audienceThe vision of connecting a large amount of objects on this planet to improve well-being and safety is slowly taking shape. Preceded by a decade-long era of research on low-power low-rate short-range wireless sensor networks, first proprietary and later standards-compliant embedded technologies have successfully been put forward. Cellular machine-to-machine (M2M) is taking this technology to a next step where communication ranges are significantly extended by relying on cellular infrastructure. This position paper discusses these emerging paradigms and highlights how cooperative as well as security requirements are core to their designs