A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Filters
Distributed cooperative localization based on Gaussian message passing on factor graph in wireless networks
2014
Science China Information Sciences
In this paper, a distributed cooperative localization method based on factor graph is proposed in wireless networks. ...
To solve this problem, the Taylor expansion is used to approximate the nonlinear terms in message updating, which leads to the Gaussian message passing on factor graph. ...
Gaussian message passing on factor graph. ...
doi:10.1007/s11432-014-5172-y
fatcat:wfsncqjihrarhlrnjwqsjaojwq
A variational message passing algorithm for sensor self-localization in wireless networks
2011
2011 IEEE International Symposium on Information Theory Proceedings
We propose a novel algorithm for sensor selflocalization in cooperative wireless networks where observations of relative sensor distances are available. ...
The variational message passing (VMP) algorithm is used to implement a mean field solution to the estimation of the posterior probabilities of the sensor positions in an R 2 scenario. ...
Figure 4 . 4 The Gaussian VMP algorithm for distributed self-localization in cooperative wireless networks. ...
doi:10.1109/isit.2011.6033940
dblp:conf/isit/PedersenPF11
fatcat:z6dl3zj6yffgvd2u5h224xbbke
Sequential Uniformly Reweighted Sum-Product Algorithm for Cooperative Localization in Wireless Networks
2014
International Journal of Distributed Sensor Networks
In this paper, we formulate the cooperative localization problem in a mobile network as an inference problem on a factor graph. ...
Graphical models have been widely applied in solving distributed inference problems in wireless networks. ...
Factor Graph-Based Cooperative Localization
Problem Formulation. ...
doi:10.1155/2014/164816
fatcat:74l7tafb7rh6zhx6omds5k7hcq
A Bayesian algorithm for distributed network localization using distance and direction data
[article]
2017
arXiv
pre-print
In this paper, the novel Message Passing Hybrid Localization (MPHL) algorithm is proposed to solve the problem of cooperative distributed localization using distance and direction estimates. ...
A reliable, accurate, and affordable positioning service is highly required in wireless networks. ...
A stochastic search algorithm for cooperative localization, 2 based on a Gaussian model for data and locations, was proposed in [18] . ...
arXiv:1704.01918v2
fatcat:lax6pmt7srbz7iiaz3t255hdxq
Iterative Receivers for Downlink MIMO-SCMA: Message Passing and Distributed Cooperative Detection
2018
IEEE Transactions on Wireless Communications
To tackle this challenge, we propose near optimal low-complexity iterative receivers based on factor graph. ...
To tackle this challenge, we propose near optimal low-complexity iterative receivers based on factor graph. ...
Based on the observation that global messages on factor graph can be expressed as the product of several local messages calculated at each user, we are able to perform the cooperative detection in a distributed ...
doi:10.1109/twc.2018.2813378
fatcat:4jonk73dqrgopjbsoijgx4batm
Cooperative simultaneous localization and synchronization: A distributed hybrid message passing algorithm
2013
2013 Asilomar Conference on Signals, Systems and Computers
Localization and synchronization in wireless networks are strongly related when they are based on internode time measurements. ...
We leverage this relation by presenting a message passing algorithm for cooperative simultaneous localization and synchronization (CoSLAS). ...
CONCLUSIONS We presented a factor graph framework and a message passing algorithm for distributed cooperative simultaneous localization and synchronization (CoSLAS) in wireless networks. ...
doi:10.1109/acssc.2013.6810651
dblp:conf/acssc/EtzlingerMSHW13
fatcat:iwlhjjhn3fa7jjhe6pzggn6coe
Parametric Variational Sum-Product Algorithm for Cooperative Localization in Wireless Sensor Networks
2021
IEEE Access
FACTOR GRAPH-BASED COOPERATIVE LOCALIZATION
A. ...
Literature [13] provide a unified factor graph-based framework for passive localization in WSNs based on TOA measurements. ...
When the observation message , is expressed in a dual-mode, the two diameter parameters of the annular distribution shown in equation (22) need to be calculated, that is, ( )
D. ...
doi:10.1109/access.2021.3090566
fatcat:6xhtuejwpne6df4l4br5oolk4e
Iterative Receivers for Downlink MIMO-SCMA: Message Passing and Distributed Cooperative Detection
[article]
2017
arXiv
pre-print
To tackle this challenge, we propose near optimal low-complexity iterative receivers based on factor graph. ...
We further consider cooperative network and propose two distributed cooperative detection schemes to exploit the diversity gain, namely, belief consensus-based algorithm and Bregman alternative direction ...
Based on the observation that global messages on factor graph can be expressed as the product of several local messages calculated at each user, we are able to perform the cooperative detection in a distributed ...
arXiv:1710.08590v1
fatcat:3ocidpbu4jeixii42ufmor43gy
A network traffic reduction method for cooperative positioning
2011
2011 8th Workshop on Positioning, Navigation and Communication
In a dense network, as the number of cooperating devices increases, the number of packet exchanges also increases proportionally. This causes network congestion and increases packet collisions. ...
Cooperative positioning is suitable for applications where conventional non-cooperative positioning fails due to lack of connectivity with a sufficient number of reference nodes. ...
SPAWN maps a factor graph onto the network topology and develops a distributed message passing scheme [6] . ...
doi:10.1109/wpnc.2011.5961015
dblp:conf/wpnc/DasW11
fatcat:zvytl2b4tnfe7nlnduytmqm45m
Hybrid GNSS-Terrestrial Cooperative Positioning via Distributed Belief Propagation
2010
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
In particular, SPAWN (Sum-Product Algorithm over a Wireless Network) was shown to provide accurate position estimate even in challenged indoor environments, thanks to exchange of local information among ...
peers based on terrestrial ranging. ...
CONCLUSION The problem of hybrid positioning for wireless networks has been addressed in this paper by proposing a novel, distributed approach based on iterative message passing on a factor graph model ...
doi:10.1109/glocom.2010.5683684
dblp:conf/globecom/CaceresPWG10
fatcat:odd277zhfjbbfpfnpebu6ted4a
Bayesian outlier detection in location-aware wireless networks
2011
2011 8th Workshop on Positioning, Navigation and Communication
We propose a new method based on factor graphs. ...
The accuracy of localization depends on the reliability of the information exchanged between devices in the network. ...
Based on probabilistic graphical models, we propose a message passing algorithm that enables multiple devices to cooperate in identifying points of failure. ...
doi:10.1109/wpnc.2011.5961012
dblp:conf/wpnc/LiLW11
fatcat:guxefaq2brhsbkgfc7shr4gzhi
Cooperative Joint Localization and Clock Synchronization Based on Gaussian Message Passing in Asynchronous Wireless Networks
2016
IEEE Transactions on Vehicular Technology
In this paper, we present a factor graph (FG) representation of the joint localization and time synchronization problem based on TOA measurements, in which the non-line-of-sight measurements are also taken ...
On this FG, belief propagation (BP) message passing and variational message passing (VMP) are applied to derive two fully distributed cooperative algorithms with low computational requirements. ...
CONCLUSIONSIn this paper, a unified factor graph framework was proposed to solve the distributed joint cooperative localization and synchronization problem in dynamic wireless networks. ...
doi:10.1109/tvt.2016.2518185
fatcat:nugghlnv3nbtbgnjoyx7rnubji
Reducing Communication Overhead for Cooperative Localization Using Nonparametric Belief Propagation
2012
IEEE Wireless Communications Letters
It is based on: i) communication of the beliefs (instead of the messages), ii) approximation of the belief with Gaussian mixture of very few components, and iii) censoring. ...
In this paper, we propose a novel approach to reduce communication overhead for cooperative positioning using NBP. ...
There are two well-known frameworks in the state-of-the-art: one based on factor graph [16] , and other based on Markov Random Field [17] . ...
doi:10.1109/wcl.2012.042512.120172
fatcat:jic7ovifqnfzfjbh3xtedjhevu
Distributed Downlink Beamforming With Cooperative Base Stations
2008
IEEE Transactions on Information Theory
For 2-D cellular networks, we remodel the network as a factor graph and present a distributed beamforming algorithm based on the sum-product algorithm. ...
Index Terms-Cooperative base stations, distributed algorithm, downlink beamforming, Kalman smoothing, linear mean square error (LMMSE), localized interference, message passing, multicell processing, multiple-input-multiple-output ...
Grant for stimulating initial discussions, and the editor and reviewers for helpful comments on the first version of the manuscript. ...
doi:10.1109/tit.2008.2006426
fatcat:feitmrgf7zc2nlcx2lfvc2uj64
Neural Enhanced Belief Propagation for Cooperative Localization
[article]
2021
arXiv
pre-print
We consider a cooperative localization (CL) scenario where the mobile agents in a wireless network aim to localize themselves by performing pairwise observations with other agents and by exchanging location ...
In this paper, we establish a hybrid method for model-based and data-driven inference. ...
BP [9] [10] [11] is a message passing algorithm. It operates on the factor graph that represents the statistical model of an estimation problem. ...
arXiv:2105.12903v1
fatcat:v5olbbh24jaezimo355c5qalou
« Previous
Showing results 1 — 15 out of 2,088 results