Distributed Network Center and Size Estimation

Published on Jul 15, 2018in IEEE Sensors Journal3.073
· DOI :10.1109/JSEN.2018.2840048
Sai Zhang7
Estimated H-index: 7
(Qualcomm),
Cihan Tepedelenlioglu28
Estimated H-index: 28
(ASU: Arizona State University),
Andreas Spanias32
Estimated H-index: 32
(ASU: Arizona State University)
Sources
Abstract
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 distributed in the sense that each node in the network only needs to know its own location and nodes do not need to be pre-labeled. The algorithm works for any connected graph structure. The performance of the proposed algorithm is analyzed and it is shown that there is a tradeoff: a larger design parameter results in a more accurate center estimation but also makes the convergence speed of the distributed algorithm slower. It is also shown that the proposed algorithm can also be used to estimate the center and radius of the (not necessarily location-based) data at sensor nodes in a distributed way, thereby providing information and insights about the global data at each sensor. Simulation results corroborating the theory are also provided.
📖 Papers frequently viewed together
1 Citations
2018CDC: Conference on Decision and Control
4 Authors (Donggil Lee, ..., Hyungbo Shim)
1 Citations
2011
References37
Newest
#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...
27 CitationsSource
#1Lidong Wang (Tennessee Technological University)H-Index: 8
#1Lidong Wang (Tennessee Technological University)H-Index: 2
Last. Cheryl Ann AlexanderH-Index: 1
view all 3 authors...
Big Data analytics plays a key role through reducing the data size and complexity in Big Data applications. Visualization is an important approach to helping Big Data get a complete view of data and discover data values. Big Data analytics and visualization should be integrated seamlessly so that they work best in Big Data applications. Conventional data visualization methods as well as the extension of some conventional methods to Big Data applications are introduced in this paper. The challeng...
71 CitationsSource
Apr 14, 2013 in INFOCOM (International Conference on Computer Communications)
#1Zuoming Yu (Jiangsu University)H-Index: 6
#2Jin Teng (OSU: Ohio State University)H-Index: 17
Last. Dong Xuan (OSU: Ohio State University)H-Index: 47
view all 4 authors...
In this paper, we study the problem of wireless coverage in bounded areas. Coverage is one of the fundamental requirements of wireless networks. There has been considerable research on optimal coverage of infinitely large areas. However, in the real world, the deployment areas of wireless networks are always geographically bounded. It is a much more challenging and significant problem to find optimal deployment patterns to cover bounded areas. In this paper, we approach this problem starting fro...
20 CitationsSource
Jan 1, 2013 in ASILOMAR (Asilomar Conference on Signals, Systems and Computers)
#1Xue 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 location detection problem in wireless sensor networks (WSNs) with M anchors and one node is considered in this paper. In the presence of the transmitting node at a known location, each anchor receives a noisy signal in the presence of node. In the absence of the node, the anchors receive only noise. Each anchor makes a decision as to whether the node is present or not by using a Neyman-Pearson detector. The bit denoting the decision is transmitted to a fusion center (FC). If an an...
18 CitationsSource
Dec 1, 2012 in GLOBECOM (Global Communications Conference)
#1Srabani Kundu (Guru Nanak Institute of Technology)H-Index: 2
#2Nabanita Das (ISI: Indian Statistical Institute)H-Index: 12
In many applications of Wireless Sensor Networks (WSN), a large number of sensor nodes are distributed over an area under investigation. The sensors collect ground data at definite time interval and forward it to the sink. In case of an event, it is often required to estimate the affected area and to identify the location of the event. Since, in WSN, communication is costlier than in-network computation in terms of energy, it is better if the area can be estimated in a distributed fashion on the...
6 CitationsSource
#1Franck Iutzeler (ENST: Télécom ParisTech)H-Index: 13
#2Philippe Ciblat (ENST: Télécom ParisTech)H-Index: 30
Last. J. Jakubowicz (Telecom SudParis)H-Index: 2
view all 3 authors...
In this paper, we address the problem of estimating the maximal value over a sensor network using wireless links between them. We introduce two heuristic algorithms and analyze their theoretical performance. More precisely, i) we prove that their convergence time is finite with probability one, ii) we derive an upper-bound on their mean convergence time, and iii) we exhibit a bound on their convergence time dispersion.
87 CitationsSource
#1Marc Willerton (Imperial College London)H-Index: 5
#2Mahesh K. Banavar (ASU: Arizona State University)H-Index: 17
Last. Anthony G. Constantinides (Imperial College London)H-Index: 28
view all 9 authors...
In this paper, a novel wireless sensor network discovery algorithm is presented which estimates the locations of a large number of low powered, randomly distributed sensor nodes. Initially, all nodes are at unknown locations except for a small number which are termed the “anchor” nodes. The remaining nodes are to be located as part of the discovery procedure. As the locations of sensor nodes are estimated, they can be used in the localization of other nodes. The locations of transmitting nodes a...
6 Citations
#1Jianshu Chen (UCLA: University of California, Los Angeles)H-Index: 28
#2Ali H. Sayed (UCLA: University of California, Los Angeles)H-Index: 86
We propose an adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes. The cost function is assumed to consist of a collection of individual components. Diffusion adaptation allows the nodes to cooperate and diffuse information in real-time; it also helps alleviate the effects of stochastic gradient noise and measurement noise through a continuous learning process. We analyze the mean-square-error performance of the algorithm in some detail,...
473 CitationsSource
Mar 1, 2011 in SMC (Systems, Man and Cybernetics)
#1Raghavendra V. Kulkarni (Missouri University of Science and Technology)H-Index: 15
#2Ganesh K. Venayagamoorthy (Missouri University of Science and Technology)H-Index: 66
Wireless-sensor networks (WSNs) are networks of autonomous nodes used for monitoring an environment. Developers of WSNs face challenges that arise from communication link failures, memory and computational constraints, and limited energy. Many issues in WSNs are formulated as multidimensional optimization problems, and approached through bioinspired techniques. Particle swarm optimization (PSO) is a simple, effective, and computationally efficient optimization algorithm. It has been applied to a...
439 CitationsSource
#1Federico S. Cattivelli (UCLA: University of California, Los Angeles)H-Index: 16
#2Ali H. Sayed (UCLA: University of California, Los Angeles)H-Index: 86
We consider the problem of distributed estimation, where a set of nodes is required to collectively estimate some parameter of interest from noisy measurements. The problem is useful in several contexts including wireless and sensor networks, where scalability, robustness, and low power consumption are desirable features. Diffusion cooperation schemes have been shown to provide good performance, robustness to node and link failure, and are amenable to distributed implementations. In this work we...
932 CitationsSource
Cited By8
Newest
#1Gowtham Muniraju (ASU: Arizona State University)H-Index: 6
#2Cihan Tepedelenlioglu (ASU: Arizona State University)H-Index: 28
Last. Andreas Spanias (ASU: Arizona State University)H-Index: 32
view all 3 authors...
A novel distributed algorithm for estimating the maximum of the node initial state values in a network, in the presence of additive communication noise is proposed. Conventionally, the maximum is estimated locally at each node by updating the node state value with the largest received measurements in every iteration. However, due to the additive channel noise, the estimate of the maximum at each node drifts at each iteration and this results in nodes diverging from the true max value. Max-plus a...
4 CitationsSource
#1Qian Cui (Chongqing University)H-Index: 3
#2Jiangshuai Huang (Chongqing University)H-Index: 1
Last. Tingting GaoH-Index: 2
view all 3 authors...
This paper investigates the distributed min-consensus for second-order nonlinear multi-agent systems with external disturbances. A discontinuous integral sliding mode (ISM) protocol combined with finite-time stability theory is applied and a novel min-consensus algorithm is proposed in this paper. To eliminate the chattering phenomenon due to the discontinuous control, a continuous ISM consensus protocol is proposed. It is shown that output of the agents reach a common min-consensus of their ini...
Source
The process of enhancing the ability of a complex network against various malicious attacks through link addition/rewiring has been the subject of extensive interest and research. The performance of existing methods often highly depends on full knowledge about the network topology. In this study, the authors devote ourselves to developing new distributed strategies to perform link manipulation sequentially using only local accessible topology information. This strategy is concerned with a matrix...
1 CitationsSource
#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...
5 CitationsSource