The Experts below are selected from a list of 1026 Experts worldwide ranked by ideXlab platform

Jacob Beal - One of the best experts on this subject based on the ideXlab platform.

  • Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
    IEEE Transactions on Automatic Control, 2019
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing distance estimation Algorithms are an important building block of many distributed systems, such as seen in the emerging field of aggregate computing. Their safe use in feedback systems or under persistent perturbations has not previously been formally analyzed. Self-stabilization only involves eventual convergence, and is not endowed with robustness properties associated with global uniform asymptotic stability and thus does not guarantee stability under perturbations or feedback. We formulate a Lyapunov function to analyze the Adaptive Bellman–Ford distance estimation Algorithm and use it to prove global uniform asymptotic stability, a property which the classical Bellman–Ford Algorithm lacks. Global uniform asymptotic stability assures a measure of robustness to structural perturbations, empirically observed by us in a previous work. We also show that the Algorithm is ultimately bounded under bounded measurement error and device mobility and provide a tight bound on the ultimate bound and the time to attain it.

  • CDC - Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm
    2019 IEEE 58th Conference on Decision and Control (CDC), 2019
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing information spreading Algorithms are a key basis block for building distributed system for device coordination. The adaptive Bellman-Ford (ABF) Algorithm is a special case of these spreading Algorithms. It finds the distance estimate of each node in a graph from a source set, but unlike the classical Bellman-Ford Algorithm does not assume that all initial distance estimates exceed their true values. Though globally uniformly asymptotically stable (GUAS), its convergence can be very slow in graphs will short edges if some initial estimates are smaller than their true values. We propose here a generalization of ABF with additional parameters to permit faster convergence. We prove it to be GUAS, bounding the time to converge, and show via simulations that it withstands persistent bounded perturbations in the graph edge lengths.

  • CDC - A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford Algorithm
    2016 IEEE 55th Conference on Decision and Control (CDC), 2016
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing (asymptotically stable) distance estimation Algorithms are an important building block of many distributed systems featuring in Spatial or Aggregate computing, but the dynamics of their convergence to correct distance estimates has not previously been formally analyzed. As a first step to understanding, how they behave in interconnections involving other building blocks, it is important to develop a Lyapunov framework to demonstrate their robust stability. This paper addresses this shortcoming by providing the first Lyapunov-based analysis of an adaptive Bellman-Ford Algorithm, by formulating a simple Lyapunov function. This analysis proves global uniform asymptotic stability of such Algorithms, a property which the classical Bellman-Ford Algorithm lacks, thus demonstrating a measure of robustness to structural perturbations, empirically observed by us in a previous work.

Yuan Liu - One of the best experts on this subject based on the ideXlab platform.

  • secrecy rate maximization with outage constraint in multihop relaying networks
    IEEE Communications Letters, 2018
    Co-Authors: Jianping Yao, Yuan Liu
    Abstract:

    In this letter, we study the secure transmission in multihop wireless networks with randomize-and-forward relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with ON–OFF transmission scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then, the secure routing problem is solved by revising the classical Bellman–Ford Algorithm. Simulation results are conducted to verify our analysis.

  • secrecy rate maximization with outage constraint in multihop relaying networks
    arXiv: Information Theory, 2017
    Co-Authors: Jianping Yao, Yuan Liu
    Abstract:

    In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford Algorithm. Simulation results are conducted to verify our analysis.

  • GLOBECOM - Secure Routing in Full-Duplex Jamming Multihop Relaying
    2016 IEEE Global Communications Conference (GLOBECOM), 2016
    Co-Authors: Jianping Yao, Suili Feng, Yuan Liu
    Abstract:

    In this paper, we consider the secure connection problem in multihop wireless networks with full-duplex (FD) jamming relaying, where the colluding eavesdroppers are randomly distributed following a homogeneous Poisson point process (PPP). By applying FD, each legitimate node (including relay and destination) jams the eavesdroppers when it receives the desired signal from transmitter. We adopt the end- to- end secure connection probability (SCP) as a secrecy metric to characterize the physical layer security performance. We first derive the exact expression of SCP for any given path. Then, an approximation of the SCP is proposed to facilitate efficient secure routing by using a revised Bellman- Ford Algorithm. We show that a notable performance gain can be achieved by the proposed scheme compared to the half-duplex (HD) scheme, if the self- interference can be well canceled. Simulation results verify our theoretical analysis.

Soura Dasgupta - One of the best experts on this subject based on the ideXlab platform.

  • Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
    IEEE Transactions on Automatic Control, 2019
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing distance estimation Algorithms are an important building block of many distributed systems, such as seen in the emerging field of aggregate computing. Their safe use in feedback systems or under persistent perturbations has not previously been formally analyzed. Self-stabilization only involves eventual convergence, and is not endowed with robustness properties associated with global uniform asymptotic stability and thus does not guarantee stability under perturbations or feedback. We formulate a Lyapunov function to analyze the Adaptive Bellman–Ford distance estimation Algorithm and use it to prove global uniform asymptotic stability, a property which the classical Bellman–Ford Algorithm lacks. Global uniform asymptotic stability assures a measure of robustness to structural perturbations, empirically observed by us in a previous work. We also show that the Algorithm is ultimately bounded under bounded measurement error and device mobility and provide a tight bound on the ultimate bound and the time to attain it.

  • CDC - Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm
    2019 IEEE 58th Conference on Decision and Control (CDC), 2019
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing information spreading Algorithms are a key basis block for building distributed system for device coordination. The adaptive Bellman-Ford (ABF) Algorithm is a special case of these spreading Algorithms. It finds the distance estimate of each node in a graph from a source set, but unlike the classical Bellman-Ford Algorithm does not assume that all initial distance estimates exceed their true values. Though globally uniformly asymptotically stable (GUAS), its convergence can be very slow in graphs will short edges if some initial estimates are smaller than their true values. We propose here a generalization of ABF with additional parameters to permit faster convergence. We prove it to be GUAS, bounding the time to converge, and show via simulations that it withstands persistent bounded perturbations in the graph edge lengths.

  • CDC - A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford Algorithm
    2016 IEEE 55th Conference on Decision and Control (CDC), 2016
    Co-Authors: Soura Dasgupta, Jacob Beal
    Abstract:

    Self-stabilizing (asymptotically stable) distance estimation Algorithms are an important building block of many distributed systems featuring in Spatial or Aggregate computing, but the dynamics of their convergence to correct distance estimates has not previously been formally analyzed. As a first step to understanding, how they behave in interconnections involving other building blocks, it is important to develop a Lyapunov framework to demonstrate their robust stability. This paper addresses this shortcoming by providing the first Lyapunov-based analysis of an adaptive Bellman-Ford Algorithm, by formulating a simple Lyapunov function. This analysis proves global uniform asymptotic stability of such Algorithms, a property which the classical Bellman-Ford Algorithm lacks, thus demonstrating a measure of robustness to structural perturbations, empirically observed by us in a previous work.

Jianping Yao - One of the best experts on this subject based on the ideXlab platform.

  • secrecy rate maximization with outage constraint in multihop relaying networks
    IEEE Communications Letters, 2018
    Co-Authors: Jianping Yao, Yuan Liu
    Abstract:

    In this letter, we study the secure transmission in multihop wireless networks with randomize-and-forward relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with ON–OFF transmission scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then, the secure routing problem is solved by revising the classical Bellman–Ford Algorithm. Simulation results are conducted to verify our analysis.

  • secrecy rate maximization with outage constraint in multihop relaying networks
    arXiv: Information Theory, 2017
    Co-Authors: Jianping Yao, Yuan Liu
    Abstract:

    In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford Algorithm. Simulation results are conducted to verify our analysis.

  • GLOBECOM - Secure Routing in Full-Duplex Jamming Multihop Relaying
    2016 IEEE Global Communications Conference (GLOBECOM), 2016
    Co-Authors: Jianping Yao, Suili Feng, Yuan Liu
    Abstract:

    In this paper, we consider the secure connection problem in multihop wireless networks with full-duplex (FD) jamming relaying, where the colluding eavesdroppers are randomly distributed following a homogeneous Poisson point process (PPP). By applying FD, each legitimate node (including relay and destination) jams the eavesdroppers when it receives the desired signal from transmitter. We adopt the end- to- end secure connection probability (SCP) as a secrecy metric to characterize the physical layer security performance. We first derive the exact expression of SCP for any given path. Then, an approximation of the SCP is proposed to facilitate efficient secure routing by using a revised Bellman- Ford Algorithm. We show that a notable performance gain can be achieved by the proposed scheme compared to the half-duplex (HD) scheme, if the self- interference can be well canceled. Simulation results verify our theoretical analysis.

D F Wong - One of the best experts on this subject based on the ideXlab platform.

  • an Algorithm for zero skew clock tree routing with buffer insertion
    European Design and Test Conference, 1996
    Co-Authors: Y P Chen, D F Wong
    Abstract:

    We study the problem of multi-stage zero skew clock tree construction for minimizing clock phase delay and wire-length. In existing approaches clock buffers are inserted only after the clock tree is constructed. The novelty of this paper lies in simultaneously performing clock tree routing and buffer insertion. We propose a clustering-based Algorithm which uses shortest delay as the cost function. We show that the feasible positions for clock tree nodes and buffers can be generalized from diagonal segments (merging segments) to rectangles (merging blocks). Buffers are large components and must be placed pairwise disjointly. We also show that the problem of finding legal positions for buffers such that no buffers overlap can be formulated as a shortest path problem on graphs, and can be solved by the Bellman-Ford Algorithm. By making use of the spacial properties of the graphs, we further speedup the Bellman-Ford Algorithm. The experimental results show that our Algorithm greatly outperforms the approach of inserting buffers after clock routing.

  • ED&TC - An Algorithm for zero-skew clock tree routing with buffer insertion
    Proceedings ED&TC European Design and Test Conference, 1
    Co-Authors: Y P Chen, D F Wong
    Abstract:

    We study the problem of multi-stage zero skew clock tree construction for minimizing clock phase delay and wire-length. In existing approaches clock buffers are inserted only after the clock tree is constructed. The novelty of this paper lies in simultaneously performing clock tree routing and buffer insertion. We propose a clustering-based Algorithm which uses shortest delay as the cost function. We show that the feasible positions for clock tree nodes and buffers can be generalized from diagonal segments (merging segments) to rectangles (merging blocks). Buffers are large components and must be placed pairwise disjointly. We also show that the problem of finding legal positions for buffers such that no buffers overlap can be formulated as a shortest path problem on graphs, and can be solved by the Bellman-Ford Algorithm. By making use of the spacial properties of the graphs, we further speedup the Bellman-Ford Algorithm. The experimental results show that our Algorithm greatly outperforms the approach of inserting buffers after clock routing.