Sai Zhang

Arizona State University

Brooks–Iyengar algorithmAlgorithm designConsensusAlgorithmDistributed computingMathematical optimizationDistributed algorithmGraph (abstract data type)Convex functionApproximation algorithmNoiseCommunication channelConvex optimizationNonlinear systemIterative methodElectronic engineeringWireless sensor networkFusion centerNoise measurementComputer networkMathematicsBounded functionOrthogonal frequency-division multiplexingComputer scienceLinear programmingKey distribution in wireless sensor networksNode (networking)ModulationConvergence (routing)ConnectivityUpper and lower boundsReal-time computingDegree distribution

17Publications

7H-index

120Citations

Publications 16

#1Gowtham Muniraju (ASU: Arizona State University)H-Index: 6

#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28

Last. Mahesh K. Banavar (Clarkson University)H-Index: 17

view all 5 authors...

The analysis of a distributed consensus algorithm for estimating the maximum of the node initial state values in a network is considered in the presence of communication noise. Conventionally, the maximum is estimated by updating the node state value with the largest received measurements in every iteration at each node. However, due to additive channel noise, the estimate of the maximum at each node has a positive drift at each iteration and this results in nodes diverging from the true max val...

#1Sai Zhang (Qualcomm)H-Index: 7

#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28

Last. Andreas Spanias (ASU: Arizona State University)H-Index: 32

view all 3 authors...

A fully distributed algorithm for estimating the center and the radius of the smallest sphere that contains a wireless sensor network is proposed. The center finding problem is formulated as a convex optimization problem in summation form by using a soft-max approximation to the maximum function. Diffusion adaptation method is used where states of nodes converge to the estimated center distributively. Then, distributed max consensus is used to compute the radius. The proposed algorithm is fully ...

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Cihan TepedelenliogluH-Index: 28

Last. Mahesh K. Banavar (Clarkson University)H-Index: 17

view all 4 authors...

Abstract The area of detection and estimation in a distributed wireless sensor network (WSN) has several applications, including military surveillance, sustainability, health monitoring, and Internet of Things (IoT). Compared with a wired centralized sensor network, a distributed WSN has many advantages including scalability and robustness to sensor node failures. In this book, we address the problem of estimating the structure of distributed WSNs. First, we provide a literature review in: (a) g...

#1Gowtham Muniraju (ASU: Arizona State University)H-Index: 6

#2Sai Zhang (ASU: Arizona State University)H-Index: 7

Last. Rafaela Villalpando-HernandezH-Index: 4

view all 7 authors...

A distributed spectral clustering algorithm to group sensors based on their location in a wireless sensor network (WSN) is proposed. For machine learning and data mining applications in WSN's, gathering data at a fusion center is vulnerable to attacks and creates data congestion. To avoid this, we propose a robust distributed clustering method without a fusion center. The algorithm combines distributed eigenvector computation and distributed K-means clustering. A distributed power iteration meth...

Distributed center and coverage region estimation in wireless sensor networks using diffusion adaptation

Oct 1, 2017 in ASILOMAR (Asilomar Conference on Signals, Systems and Computers)

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28

Last. Andreas Spanias (ASU: Arizona State University)H-Index: 32

view all 3 authors...

A fully distributed algorithm for estimating the center and coverage region of a wireless sensor network (WSN) is proposed. The proposed algorithm is useful in many applications, such as finding the required power for a certain level of connectivity in WSNs and localizing a service center in a network. The network coverage region is defined to be the smallest sphere that covers all the sensor nodes. The center and radius of the smallest covering sphere are estimated. The center estimation is for...

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28

Last. Andreas Spanias (ASU: Arizona State University)H-Index: 32

view all 4 authors...

Distributed node counting in wireless sensor networks can be important in various applications, such as network maintenance and information aggregation. In this paper, a distributed consensus algorithm for estimating the number of nodes in a wireless sensor network in the presence of communication noise is introduced. In networks with a fusion center, counting the number of nodes can easily be done by letting each node to transmit a fixed constant value to the fusion center. In a network without...

#1Sai ZhangH-Index: 7

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28

Last. Andreas Spanias (ASU: Arizona State University)H-Index: 32

view all 4 authors...

A distributed consensus algorithm for estimating the maximum value of the initial measurements in a sensor network with communication noise is proposed. In the absence of communication noise, max estimation can be done by updating the state value with the largest received measurements in every iteration at each sensor. In the presence of communication noise, however, the maximum estimate will incorrectly drift and the estimate at each sensor will diverge. As a result, a soft-max approximation to...

Dec 1, 2016 in GLOBECOM (Global Communications Conference)

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Jongmin Lee (ASU: Arizona State University)H-Index: 6

Last. Andreas SpaniasH-Index: 32

view all 4 authors...

A distributed consensus algorithm for estimating the degree distribution of a graph is proposed. The proposed algorithm is based on average consensus and in-network empirical mass function estimation. It is fully distributed in the sense that each node in the network only needs to know its own degree, and nodes do not need to be labeled. The algorithm works for any connected graph structure in the presence of communication noise. The performance of the algorithm is analyzed. A discussion on how ...

#1Sai Zhang (ASU: Arizona State University)H-Index: 7

#2Cihan TepedelenliogluH-Index: 28

Last. Andreas SpaniasH-Index: 32

view all 5 authors...

System size estimation in distributed wireless sensor networks is important in various applications such as network management and maintenance. One popular method for system size estimation is to use distributed consensus algorithms with randomly generated initial values at nodes. In this paper, the performance of such methods is studied and Fisher information and Cramer-Rao bounds (CRBs) for different consensus algorithms are derived. Errors caused by communication noise and lack of convergence...

Close Researchers

Andreas Spanias

H-index : 32

Cihan Tepedelenlioglu

H-index : 28

Mahesh K. Banavar

H-index : 17

Gowtham Muniraju

H-index : 6

Rafaela Villalpando-Hernandez

H-index : 4