Distributed selection of references for localization in wireless sensor networks

Lieckfeldt, Dominik; You, Jiaxi; Timmermann, Dirk

doi:10.1109/wpnc.2008.4510354

Cited by 14 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the closest neighbors may not correspond to the best links as positioning also depends on the geometric configuration of the agent and its neighbors. Recently, the Cramér Rao bound (CRB) has been proposed as a criterion to censor ineffective links [3], [5]. Rather than relying on proximity as a criterion, [5] proposed to use a preset number of links that give lowest CRB.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, the Cramér Rao bound (CRB) has been proposed as a criterion to censor ineffective links [3], [5]. Rather than relying on proximity as a criterion, [5] proposed to use a preset number of links that give lowest CRB. Similarly, in the context of GPS, geometric dilution of precision, which is related to the CRB, was used to select the best four satellites among a larger set [6], [7].…”

Section: Introductionmentioning

confidence: 99%

“…Similarly, in the context of GPS, geometric dilution of precision, which is related to the CRB, was used to select the best four satellites among a larger set [6], [7]. In [5] the authors proposed to use the CRB to select those anchors that would give the best positioning accuracy. The mentioned methods are suitable for non-cooperative networks where the question is to select the best anchors.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Censored cooperative positioning for dense wireless networks

Das

Wymeersch

2010

2010 IEEE 21st International Symposium on Personal, Indoor and Mobile Radio Communications Workshops

View full text Add to dashboard Cite

Abstract-Cooperative positioning is an emerging topic in wireless sensor networks and navigation. It can improve the positioning accuracy and coverage in GPS-challenged conditions such as inside tunnels, in urban canyons, and indoors. Different algorithms have been proposed relying on iteratively exchanging and updating positional information. For the purpose of computational complexity, network traffic, and latency, it is desirable to minimize the amount of information shared between devices, while still maintaining acceptable performance. We show that information that is not reliable should not be shared, and information that is not informative should not be used. This naturally leads to censoring schemes. We consider different censoring schemes based on the Cramér Rao bound (CRB). We find that by blocking the broadcasts of the nodes that don't have reliable estimates (transmit censoring) and selecting the most usable links after receiving signals from neighbors (receive censoring), complexity, traffic, and latency can be reduced significantly without degrading positioning performance.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Censored cooperative positioning for dense wireless networks

Das

Wymeersch

2010

2010 IEEE 21st International Symposium on Personal, Indoor and Mobile Radio Communications Workshops

View full text Add to dashboard Cite

show abstract

“…Node selection strategies also save energy because they avoid the use of a large number of cooperative anchor nodes and hence, they reduce the packet exchange saving energy. Some approaches use CRLB to select nodes or select the anchor nodes based on a distance metric [8]. The main disadvantage of distance based criterion is that geometry of the selected cooperating nodes is not contemplated.…”

mentioning

confidence: 99%

Potential Game for Energy-Efficient RSS-Based Positioning in Wireless Sensor Networks

Moragrega

Closas

Ibars

2015

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Positioning is a key aspect for many applications in wireless sensor networks. In order to design practical positioning algorithms, employment of efficient algorithms that maximize the battery lifetime while achieving a high degree of accuracy is crucial. The number of participating anchor nodes and their transmit power have an important impact on the energy consumption of positoning a node. This paper proposes a game theoretical algorithm to optimize resource usage in obtaining location information in a wireless sensor network. The proposed method provides positioning and tracking of nodes using RSS measurements. We use the Geometric Dilution of Precision as an optimization metric for our algorithm, with the aim of minimizing the number and power of anchor nodes that collaborate in positioning, thus saving energy. The algorithm is shown to be a potential game, therefore convergence is guaranteed. A distributed low complexity solution for the implementation is presented. The game is applied to WSN and results show the trade-off between power saving and positioning error.

show abstract

“…The closest reference nodes may not be the most informative for positioning as the geometric configuration also affects the positioning performance. This problem has been partially addressed in [12], [13], where the Cramér-Rao bound (CRB) was used to choose the best reference nodes. In [15], [16] geometric dilution of precision (GDOP) was applied to select the best four satellites for a GPS receiver.…”

mentioning

confidence: 99%

Censoring for Bayesian Cooperative Positioning in Dense Wireless Networks

Das

Wymeersch

2012

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Cooperative positioning is a promising solution for location-enabled technologies in GPS-challenged environments. However, it suffers from high computational complexity and increased network traffic, compared to traditional positioning approaches. The computational complexity is related to the number of links considered during information fusion. The network traffic is dependent on how often devices share positional information with neighbors. For practical implementation of cooperative positioning, a low-complexity algorithm with reduced packet broadcasts is thus necessary. Our work is built on the insight that for precise positioning, not all the incoming information from neighboring devices is required, or even useful. We show that blocking selected broadcasts (transmit censoring) and discarding selected incoming information (receive censoring) based on a Cramér-Rao bound criterion, leads to an algorithm with reduced complexity and traffic, without significantly affecting accuracy and latency.

show abstract

Distributed selection of references for localization in wireless sensor networks

Cited by 14 publications

References 12 publications

Censored cooperative positioning for dense wireless networks

Censored cooperative positioning for dense wireless networks

Potential Game for Energy-Efficient RSS-Based Positioning in Wireless Sensor Networks

Censoring for Bayesian Cooperative Positioning in Dense Wireless Networks

Contact Info

Product

Resources

About