Related papers: Asynchronous Neighbor Discovery Using Coupled Comp…
This paper studies the problem of neighbor discovery in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed…
In this work, we propose a fast and energy-efficient neighbor discovery scheme for proximity-aware networks such as wireless ad hoc networks. Discovery efficiency is accomplished by the use of a special discovery signal that provides random…
We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequency-flat Gaussian channel, where $K+1$ nodes associate their identities to…
A Sensor network generally has a large number of sensor nodes that are deployed at some audited site. In most sensor networks the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless…
The accelerating penetration of physical environments by objects with information processing and wireless communication capabilities requires approaches to find potential communication partners and discover services. In the present work, we…
In distributed wireless networks, neighbor discovery is one of the bootstrapping primitives in supporting many important network functionalities. Existing neighbor discovery protocols mostly assume a single-channel network model and can…
Compressive sensing is a signal acquisition framework based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable recovery. In this paper we introduce a new theory for…
An important first step when deploying a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can communicate with in one wireless hop. In the recent years, cognitive radio (CR)…
The accelerating penetration of physical environments by objects with information processing and wireless communication capabilities requires approaches to find potential communication partners and discover services. In the present work, we…
In this paper, a cooperative spectrum sensing scheme based on compressive sensing is proposed. In this scheme, secondary users (SUs) are organized in clusters. In each cluster, SUs forward their compressed signals to the cluster head. Then,…
In mobile ad-hoc networks, neighbor discovery protocols are used to find surrounding devices and to establish a first contact between them. Since the clocks of the devices are not synchronized and their energy-budgets are limited, usually…
This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…
We study asymptotic performance of distributed detection in large scale connected sensor networks. Contrasting to the canonical parallel network where a single node has access to local decisions from all other nodes, each node can only…
The fundamental communication problem in the wireless Internet of Things (IoT) is to discover a massive number of devices and to allow them reliable access to shared channels. Oftentimes these devices transmit short messages randomly and…
We consider the problem of Spectrum Sensing in Cognitive Radio Systems. We have developed a distributed algorithm that the Secondary users can run to sense the channel cooperatively. It is based on sequential detection algorithms which…
This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error…
In this paper, we exploit the theory of compressive sensing to perform detection of a random source in a dense sensor network. When the sensors are densely deployed, observations at adjacent sensors are highly correlated while those…
The discovery of neighbouring nodes in multihop wireless networks has become a key challenge. Due to tribulations in communication, synchronization loss between nodes, disparity in transmission power etc, the connectivity of nodes will…
Nearest neighbor search is a basic computational tool used extensively in almost research domains of computer science specially when dealing with large amount of data. However, the use of nearest neighbor search is restricted for the…
For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among…