Related papers: Convergence of Desynchronization Primitives in Wir…
Synchronization and localization are critical challenges for the coherent functioning of a wireless network, which are conventionally solved independently. Recently, various estimators have been proposed for pairwise synchronization between…
This work presents set-membership adaptive algorithms based on time-varying error bounds for CDMA interference suppression. We introduce a modified family of set-membership adaptive algorithms for parameter estimation with time-varying…
Phase, frequency, and time synchronization are crucial requirements for many applications, such as multi-static remote sensing and communication systems. Moreover, the synchronization solution becomes even more challenging when the nodes…
A central problem in analog wireless sensor networks is to design the gain or phase-shifts of the sensor nodes (i.e. the relaying configuration) in order to achieve an accurate estimation of some parameter of interest at a fusion center, or…
Accurate and fast-convergent time synchronization is very important for wireless sensor networks. The flooding time synchronization converges fast, but its transmission delay and by-hop error accumulation seriously reduce the…
We investigate the problem of jointly testing two hypotheses and estimating a random parameter based on data that is observed sequentially by sensors in a distributed network. In particular, we assume the data to be drawn from a Gaussian…
Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing can root back to the network information theory. For generations of wireless communication systems design, orthogonal multiple access (OMA) schemes in time,…
In this paper the issue of energy efficiency in CDMA wireless data networks is addressed through a game theoretic approach. Building on a recent paper by the first two authors, wherein a non-cooperative game for spreading-code optimization,…
Space-Division Multiple Access (SDMA) utilizes linear precoding to separate users in the spatial domain and relies on fully treating any residual multi-user interference as noise. Non-Orthogonal Multiple Access (NOMA) uses linearly precoded…
Traditionally paired with impulsive communications, Time-Hopping CDMA (TH-CDMA) is a multiple access technique that separates users in time by coding their transmissions into pulses occupying a subset of $N_\mathsf{s}$ chips out of the…
This paper develops a fast, accurate and energy-efficient time synchronization protocol in wireless sensor networks that operate in harsh environments. The suggested protocol concept is based on an electrical physical metaphor. The protocol…
Generative AI has received significant attention among a spectrum of diverse industrial and academic domains, thanks to the magnificent results achieved from deep generative models such as generative pre-trained transformers (GPT) and…
This paper characterizes the performance of interference alignment (IA) technique taking into account the dynamic traffic pattern and the probing/feedback cost. We consider a time-division duplex (TDD) system where transmitters acquire…
In this paper, we propose a new algorithm for the estimation of multiple time delays (TDs). Since a TD is a fundamental spatial cue for sensor array signal processing techniques, many methods for estimating it have been studied. Most of…
It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized…
We introduce a novel decentralized monitoring algorithm for mobile ad-hoc networks. This algorithm is a combination of gossip-based and tree-based approaches. Its main feature is on multi root nodes selection which provides an opportunity…
Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…
In multi-access wireless networks, transmission scheduling is a key component that determines the efficiency and fairness of wireless spectrum allocation. At one extreme, greedy opportunistic scheduling that allocates airtime to the user…
A challenging problem in decentralized optimization is to develop algorithms with fast convergence on random and time varying topologies under unreliable and bandwidth-constrained communication network. This paper studies a stochastic…
For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply…