The Experts below are selected from a list of 5256 Experts worldwide ranked by ideXlab platform
Dongning Guo - One of the best experts on this subject based on the ideXlab platform.
-
ICASSP - Asynchronous Neighbor Discovery Using Coupled Compressive Sensing
ICASSP 2019 - 2019 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2019Co-Authors: Vamsi K. Amalladinne, Krishna R. Narayanan, Jean-francois Chamberland, Dongning GuoAbstract:The Neighbor Discovery paradigm finds wide application in Internet of Things networks, where the number of active devices is orders of magnitude smaller than the total device population. Designing low-complexity schemes for asynchronous Neighbor Discovery has recently gained significant attention from the research community. Concurrently, a divide-and-conquer framework, referred to as coupled compressive sensing, has been introduced for the synchronous massive random access channel. This work adapts this novel algorithm to the problem of asynchronous Neighbor Discovery with unknown transmission delays. Simulation results suggest that the proposed scheme requires much fewer transmissions to achieve a performance level akin to that of state-of-the-art techniques.
-
Asynchronous Neighbor Discovery Using Coupled Compressive Sensing
arXiv: Signal Processing, 2018Co-Authors: Vamsi K. Amalladinne, Krishna R. Narayanan, Jean-francois Chamberland, Dongning GuoAbstract:The Neighbor Discovery paradigm finds wide application in Internet of Things networks, where the number of active devices is orders of magnitude smaller than the total device population. Designing low-complexity schemes for asynchronous Neighbor Discovery has recently gained significant attention from the research community. Concurrently, a divide-and-conquer framework, referred to as coupled compressive sensing, has been introduced for the synchronous massive random access channel. This work adapts this novel algorithm to the problem of asynchronous Neighbor Discovery with unknown transmission delays. Simulation results suggest that the proposed scheme requires much fewer transmissions to achieve a performance level akin to that of state-of-the-art techniques.
-
Compressed Neighbor Discovery for wireless ad hoc networks: The Rayleigh fading case
2009 47th Annual Allerton Conference on Communication Control and Computing (Allerton), 2009Co-Authors: Jun Luo, Dongning GuoAbstract:Fast and efficient Neighbor Discovery is crucial to the deployment of wireless ad hoc networks. Conventional random access Neighbor Discovery schemes assume a collision model for the medium access control layer and require each Neighbor to transmit its identity repeatedly with random delay to resolve collision. This paper proposes a compressed Neighbor Discovery scheme which jointly detect all Neighbors simultaneously by allowing them to simultaneously report their identity using structured signaling. The compressed Neighbor Discovery scheme consists of non-coherent (energy) detection followed by a simple, efficient algorithm based on group testing, which is easy to implement in wireless terminals. The performance of the scheme is characterized for networks of any given size, assuming that transmissions are subject to Rayleigh fading. The compressed Neighbor Discovery scheme is shown to achieve faster and more reliable Neighbor Discovery than existing random access schemes. For example, in a wireless ad hoc network of ten thousand nodes, where each nodes has on average six Neighbors, the compressed Neighbor Discovery scheme is 40% faster.
Stephan Bohacek - One of the best experts on this subject based on the ideXlab platform.
-
Performance modeling of Neighbor Discovery in proactive routing protocols
Journal of Advanced Research, 2011Co-Authors: Andres Medina, Stephan BohacekAbstract:Abstract It is well known that Neighbor Discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed Neighbor Discovery mechanisms. This paper provides a detailed model of key performance metrics of Neighbor Discovery algorithms, such as node degree and the distribution of the distance to symmetric Neighbors. The model accounts for the dynamics of Neighbor Discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad hoc networks.
-
a performance model of Neighbor Discovery in proactive routing protocols
Performance Evaluation of Wireless Ad Hoc Sensor and Ubiquitous Networks, 2010Co-Authors: Andres Medina, Stephan BohacekAbstract:It is well known that Neighbor Discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed Neighbor Discovery mechanisms. This paper provides a detailed model of key performance metrics of Neighbor Discovery algorithms, such as node degree and the distribution of the distance to symmetric Neighbors. The model accounts for the dynamics of Neighbor Discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad-hoc networks.
Samarjit Chakraborty - One of the best experts on this subject based on the ideXlab platform.
-
Neighbor Discovery latency in ble like protocols
IEEE Transactions on Mobile Computing, 2018Co-Authors: Philipp H. Kindt, Marco Saur, Michael Balszun, Samarjit ChakrabortyAbstract:Neighbor Discovery is the procedure in which two wireless devices initiate a first contact. In low power ad-hoc networks, radios are duty-cycled and the latency until a packet meets a reception phase of another device is determined by a random process. Most research considers slotted protocols, in which the points in time for reception are temporally coupled to beacon transmissions. In contrast, many recent protocols, such as ANT/ANT+ and Bluetooth Low Energy (BLE) use a slotless, periodic-interval based scheme for Neighbor Discovery. Here, one device periodically broadcasts packets, whereas the other device periodically listens to the channel. Both periods are independent from each other and drawn over continuous time. Such protocols provide 3 degrees of freedom (viz., the intervals for advertising and scanning and the duration of each scan phase). Though billions of existing BLE devices rely on these protocols, neither their expected latencies nor beneficial configurations with good latency-duty-cycle relations are known. Parametrizations for the participating devices are usually determined based on a “good guess”. In this paper, we, for the first time, present a mathematical theory which can compute the Neighbor Discovery latencies for all possible parametrizations. Further, our theory shows that upper bounds on the latency can be guaranteed for all parametrizations, except for a finite number of singularities. Therefore, slotless, periodic interval-based protocols can be used in applications with deterministic latency demands, which have been reserved for slotted protocols until now. Our proposed theory can be used for analyzing the Neighbor Discovery latencies, for tweaking protocol parameters and for developing new protocols.
-
IPSN - Understanding slotless Neighbor Discovery: demo abstract
Proceedings of the 16th ACM IEEE International Conference on Information Processing in Sensor Networks, 2017Co-Authors: Philipp H. Kindt, Nils Heitmann, Daniel Yunge, Samarjit ChakrabortyAbstract:The process of two wireless devices meeting over-the-air for the first time is referred to as Neighbor Discovery. In mobile ad-hoc networks, battery powered devices duty-cycle their radios during Neighbor Discovery. As a result, they transmit and receive for very short durations of time and sleep at other times. Energy-efficient protocols, which guarantee short, bounded latencies while achieving low energy-consumptions are highly important for long battery lifetimes. In the past, Neighbor Discovery has been carried out mostly using slotted protocols, which subdivide time into multiple, equal length periods, called slots. An alternative are slotless protocols, which decouple beaconing from listening and can potentially achieve lower latency-duty-cycle-relations. As in slotted protocols, they also guarantee bounded latencies. However, understanding the mechanisms that ensure these deterministic bounds is more complex than for slotted protocols, since they rely on less intuitive concepts. In this demo, we propose a setup that visualizes the operation of two radios with slotless protocols in real-time, thereby providing insights that help in understanding slotless Neighbor Discovery. This demo is supposed to accompany the paper entitled "Griassdi: Mutually Assisted Slotless Neighbor Discovery Protocols", which appeared at IPSN 2017 as a regular paper.
-
Demo Abstract: Understanding Slotless Neighbor Discovery
2017Co-Authors: Philipp H. Kindt, Nils Heitmann, Daniel Yunge, Samarjit ChakrabortyAbstract:The process of two wireless devices meeting over-the-air for the first time is referred to as Neighbor Discovery. In mobile ad-hoc networks, battery powered devices duty-cycle their radios during Neighbor Discovery. As a result, they transmit and receive for very short durations of time and sleep at other times.Energy-efficient protocols, which guarantee short, bounded latencies while achieving low energy-consumptions are highly important for long battery lifetimes. In the past, Neighbor Discovery has been carried out mostly using slotted protocols, which subdivide time into multiple, equal length periods, called slots. An alternative are slotless protocols, which decouple beaconing from listening and can potentially achieve lower latency-duty-cycle-relations. As in slotted protocols, they also guarantee bounded latencies. However, understanding the mechanisms that ensure these deterministic bounds is more complex than for slotted protocols, since they rely on less intuitive concepts. In this demo, we propose a setup that visualizes the operation of two radios with slotless protocols in real-time, thereby providing insights that help in understanding slotless Neighbor Discovery. This demo is supposed to accompany the paper entitled "Griassdi: Mutually Assisted Slotless Neighbor Discovery Protocols", which appeared at IPSN 2017 as a regular paper.
Hao Cai - One of the best experts on this subject based on the ideXlab platform.
-
INFOCOM - Self-Adapting Quorum-Based Neighbor Discovery in Wireless Sensor Networks
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 2018Co-Authors: Hao Cai, Tilman WolfAbstract:Neighbor Discovery is a critical first step in establishing communication in a wireless ad-hoc network. Existing quorum-based Neighbor Discovery algorithms only consider a pair of nodes and ensure that this pair can communicate at least once in a bounded interval. However, when the node density of a wireless network increases, collisions are more likely to happen, which makes these quorum-based algorithms inefficient in practice. We propose a novel self-adapting quorum-based Neighbor Discovery algorithm that can dynamically adjust its cycle pattern to decrease the impact of such collisions. We first assess the collision problem in wireless networks when using quorum-based Neighbor Discovery algorithms and then establish a theoretical framework to analyze the Discovery delay when considering collision effects. Guided by these theoretical results, we design a self-adapting mechanism for cycle patterns in quorum-based algorithms. Simulation results show that our algorithm can achieve complete Neighbor Discovery in less time than existing quorum-based Neighbor Discovery algorithms.
-
Practical Asynchronous Neighbor Discovery in Ad Hoc Networks with Directional Antennas
IEEE Transactions on Vehicular Technology, 2016Co-Authors: Bo Liu, Hao Cai, Haibo Zhou, Lin GuiAbstract:Neighbor Discovery is a crucial step in the initialization of wireless ad hoc networks. When directional antennas are used, this process becomes more challenging since two Neighboring nodes must be in transmit and receive states, respectively, pointing their antennas to each other simultaneously. Most of the proposed Neighbor Discovery algorithms only consider the synchronous system and cannot work efficiently in the asynchronous environment. However, asynchronous Neighbor Discovery algorithms are more practical and offer many potential advantages. In this paper, we first analyze a one-way handshake-based asynchronous Neighbor Discovery algorithm by introducing a mathematical model named “Problem of Coloring Balls.” Then, we extend it to a hybrid asynchronous algorithm that leads to a 24.4% decrease in the expected time of Neighbor Discovery. Compared with the synchronous algorithms, the asynchronous algorithms require approximately twice the time to complete the Neighbor Discovery process. Our proposed hybrid asynchronous algorithm performs better than both the two-way synchronous algorithm and the two-way asynchronous algorithm. We validate the practicality of our proposed asynchronous algorithms by OPNET simulations.
-
ICC - Neighbor Discovery algorithms in wireless networks using directional antennas
2012 IEEE International Conference on Communications (ICC), 2012Co-Authors: Hao Cai, Bo Liu, Lin GuiAbstract:Directional antennas provide great performance improvement for wireless networks, such as increased network capacity and reduced energy consumption. Nonetheless new media access and routing protocols are required to control the directional antenna system. One of the most important protocols is Neighbor Discovery, which is aiming at setting up links between nodes and their Neighbors. In the past few years, a number of algorithms have been proposed for Neighbor Discovery with directional antennas. However, most of them cannot work efficiently when taking into account the collision case that more than one node exist in one directional beam. For practical considerations, we propose a new Neighbor Discovery algorithm to overcome this shortcoming. Moreover, we present a novel and practical mathematical model to analyze the performance of Neighbor Discovery algorithms considering collision effects. Numerical results clearly show our new algorithm always requires less time to discover the whole Neighbors than previous ones. To the best of our knowledge, it is the first complete, practical analytical model that incorporates directional Neighbor Discovery algorithms.
Yunhao Liu - One of the best experts on this subject based on the ideXlab platform.
-
BlindDate: A Neighbor Discovery Protocol
IEEE Transactions on Parallel and Distributed Systems, 2015Co-Authors: Keyu Wang, Xufei Mao, Yunhao LiuAbstract:Many wireless applications urgently demand an efficient Neighbor Discovery protocol to build up bridges connecting user themselves or to some service providers. However, due to intrinsic constraints of wireless devices, e.g., limited energy and error of clock synchronization, there is still absence of effective and efficient Neighbor Discovery protocols in the literature. In this work, we propose Neighbor Discovery protocols for the following two problems. First, we study Asynchronous Symmetry Neighbor Discovery problem, in which potential Neighbor devices with asynchronous time clocks but the same duty cycle aim to find each other. Second, we propose an efficient protocol (utilizing Bouncing strategy) named BlindDate with guaranteed worst-case performance ${ 9\over 10} (1+\delta)^2x^2$ where $\delta$ is a small fraction of the length of a time slot unit and ${ 1\over x}$ is the duty cycle. Third, we extend this strategy to address Asynchronous Asymmetry Neighbor Discovery problem, in which both the time clock and the duty cycles of potential Neighbors are considered to be heterogeneous. We conduct extensive experiments and simulations to examine the feasibility and efficiency of the proposed protocols, and results show that BlindDate greatly outperforms existing approaches in average-case. Compared with known protocols, BlindDate also achieves a better worst-case Discovery latency bound (e.g., $10$ percent performance gain comparing with Searchlight [1] ).
-
blinddate a Neighbor Discovery protocol
International Conference on Parallel Processing, 2013Co-Authors: Keyu Wang, Xufei Mao, Yunhao LiuAbstract:Many wireless applications urgently demand an efficient Neighbor Discovery protocol to build up a bridge connecting users to service providers or to other users. However, due to intrinsic constraints of wireless devices, e.g., limited energy and error of clock synchronization, there is still absence of effective and efficient Neighbor Discovery protocols in the literature. In this work, we propose Neighbor Discovery protocols for the following two problems. We first study Asynchronous Symmetry Neighbor Discovery problem, in which potential Neighbor devices with asynchronous time clock but the same duty cycle aim to find each other. We further propose an efficient protocol (using Bouncing strategy) named Blind Date with guaranteed worst-case performance 9/10(1 + δ)2x2 where δ is a small fraction of the length of time slot unit and 1/x is the duty cycle. Next, we extend this design to address Asynchronous Asymmetry Neighbor Discovery problem, in which both time clock and the duty cycles of potential Neighbors are considered to be heterogeneous. We conduct extensive simulations to examine the feasibility and efficiency of the proposed protocols. Results show that Blind Date protocol outperforms existing approaches in average-case. We conclude that, compared with known protocols, Blind Date achieves a better worst-case Discovery latency bound (e.g., 10% performance gain comparing with Searchlight [1]).
-
ICPP - BlindDate: A Neighbor Discovery Protocol
2013 42nd International Conference on Parallel Processing, 2013Co-Authors: Keyu Wang, Xufei Mao, Yunhao LiuAbstract:Many wireless applications urgently demand an efficient Neighbor Discovery protocol to build up a bridge connecting users to service providers or to other users. However, due to intrinsic constraints of wireless devices, e.g., limited energy and error of clock synchronization, there is still absence of effective and efficient Neighbor Discovery protocols in the literature. In this work, we propose Neighbor Discovery protocols for the following two problems. We first study Asynchronous Symmetry Neighbor Discovery problem, in which potential Neighbor devices with asynchronous time clock but the same duty cycle aim to find each other. We further propose an efficient protocol (using Bouncing strategy) named Blind Date with guaranteed worst-case performance 9/10(1 + δ)2x2 where δ is a small fraction of the length of time slot unit and 1/x is the duty cycle. Next, we extend this design to address Asynchronous Asymmetry Neighbor Discovery problem, in which both time clock and the duty cycles of potential Neighbors are considered to be heterogeneous. We conduct extensive simulations to examine the feasibility and efficiency of the proposed protocols. Results show that Blind Date protocol outperforms existing approaches in average-case. We conclude that, compared with known protocols, Blind Date achieves a better worst-case Discovery latency bound (e.g., 10% performance gain comparing with Searchlight [1]).
