Publications related to Collision domain

Remote sensing visual question answering with a self-attention multi-modal encoder

Visual Question Answering (VQA) on remote sensing imagery can help non-expert users in extracting information from Earth observation data. Current approaches follow a neural encoder-decoder design, combining convolutional and recurrent encoders together wi ...

2022

On the Implementation Complexity of Digital Full-Duplex Self-Interference Cancellation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen

In-band full-duplex systems promise to further increase the throughput of wireless systems, by simultaneously transmitting and receiving on the same frequency band. However, concurrent transmission generates a strong self-interference signal at the receive ...

IEEE2020

Destination buffer analysis for packets rejection obliteration in multi-channel networks

Georgia Fragkouli

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...

2019

A CMOS SPAD Imager with Collision Detection and 128 Dynamically Reallocating TDCs for Single-Photon Counting and 3D Time-of-Flight Imaging

Edoardo Charbon, Ivan Michel Antolovic, Scott Anthony Lindner, Chunmin Zhang, Martin Wolf

Per-pixel time-to-digital converter (TDC) architectures have been exploited by single-photon avalanche diode (SPAD) sensors to achieve high photon throughput, but at the expense of fill factor, pixel pitch and readout efficiency. In contrast, TDC sharing a ...

2018

Csma/ca in time and frequency domains

Patrick Thiran, Julien Pierre Sacha Herzen

The present invention concerns a method for a communication device to transmit a data packet in a wireless communication system. The method comprises: determining (21) a first set of transmission parameters comprising a first central transmission frequency ...

2017

Cooperative data exchange based on MDS codes

Michael Christoph Gastpar, Su Li

The coded cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the K packets making up the file. Nodes make broadcast transmissions that are received by all other node ...

2017

CSMA/CA in Time and Frequency Domains

Patrick Thiran, Julien Pierre Sacha Herzen

It has recently been shown that flexible channelization, whereby wireless stations adapt their spectrum bands on a per-frame basis, is feasible in practice. In this paper, we propose TF-CSMA/CA, an algorithm for flexible channelization that schedules packe ...

IEEE2015

Random Access With Physical-Layer Network Coding

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strategy for the random-access channel, based on compute-and-forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmission ...

Institute of Electrical and Electronics Engineers2015

Baseband and RF hardware impairments in full-duplex wireless systems: experimental characterisation and suppression

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pavle Belanovic, Andrew Charles Mallory Austin

Hardware imperfections can significantly reduce the performance of full-duplex wireless systems by introducing non-idealities and random effects that make it challenging to fully suppress self-interference. Previous research has mostly focused on analysing ...

Hindawi Publishing Corporation2015

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices Σ1, . . . ΣC, computing C hashes of a particular length based at least on a hashing front end and the ...

2015

Physical-layer Network Coding on the Random-access Channel

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...

2013

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Hierarchical Beamforming for Large One-Dimensional Wireless Networks

Olivier Lévêque, Alla Merzakreeva

We consider a wireless network with a large number of source-destination pairs distributed over a line. Under line-of-sight propagation, this network has only one degree of freedom for communication. At high SNR, this one degree of freedom can be readily a ...

Ieee2012

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the p ...

2010

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Verifiable Network-Performance Measurements

Aikaterini Argyraki

In the current Internet, there is no clean way for affected parties to react to poor forwarding performance: to detect and assess Service Level Agreement (SLA) violations by a contractual partner, a domain must resort to ad-hoc monitoring using probes. Ins ...

2010

NC Node Selection Game in Collaborative Streaming Systems

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversi ...

2010

On the Fairness of Large CSMA Networks

Patrick Thiran, Olivier Dousse, Mathilde Durvy

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologie ...

Institute of Electrical and Electronics Engineers2009

Fast collision detection methods for joint surfaces

Daniel Thalmann, Ronan Boulic, Ehsan Arbabi

In the recent years medical diagnosis and surgery planning often require the precise evaluation of joint movements. This has led to exploit reconstructed three-dimensional models of the joint tissues obtained from CT or MR Images (for bones, cartilages, et ...

2009