Scheidt, F. ; Jin, D. ; Muma, M. ; Zoubir, A. M. (2016)
Fast and Accurate Cooperative Localization in Wireless Sensor Networks.
24th European Signal Processing Conference. Budapest, Hungary (28.08.2016-02.09.2016)
doi: 10.1109/EUSIPCO.2016.7760236
Conference or Workshop Item, Bibliographie
Abstract
Cooperative localization capability is a highly desirable characteristic of wireless sensor networks. It has attracted considerable research attention in academia and industry. The sum-product algorithm over a wireless sensor network (SPAWN) is a powerful method to cooperatively estimate the positions of many sensors (agents) using knowledge of the absolute positions of a few sensors (anchors). Drawbacks of the SPAWN, however, are its high computational complexity and communication load. In this paper we address the complexity issue, reformulate it as convolution problem and utilize the fast Fourier transform (FFT), culminating in a fast and accurate localization algorithm, which we named SPAWN-FFT. Our simulation results show SPAWN-FFT's superiority over SPAWN regarding the computational effort, while maintaining its full flexibility and localization performance.
| Item Type: | Conference or Workshop Item |
|---|---|
| Erschienen: | 2016 |
| Creators: | Scheidt, F. ; Jin, D. ; Muma, M. ; Zoubir, A. M. |
| Type of entry: | Bibliographie |
| Title: | Fast and Accurate Cooperative Localization in Wireless Sensor Networks |
| Language: | English |
| Date: | 1 December 2016 |
| Publisher: | IEEE |
| Book Title: | 24th European Signal Processing Conference (EUSIPCO 2016): Proceedings |
| Event Title: | 24th European Signal Processing Conference |
| Event Location: | Budapest, Hungary |
| Event Dates: | 28.08.2016-02.09.2016 |
| DOI: | 10.1109/EUSIPCO.2016.7760236 |
| Abstract: | Cooperative localization capability is a highly desirable characteristic of wireless sensor networks. It has attracted considerable research attention in academia and industry. The sum-product algorithm over a wireless sensor network (SPAWN) is a powerful method to cooperatively estimate the positions of many sensors (agents) using knowledge of the absolute positions of a few sensors (anchors). Drawbacks of the SPAWN, however, are its high computational complexity and communication load. In this paper we address the complexity issue, reformulate it as convolution problem and utilize the fast Fourier transform (FFT), culminating in a fast and accurate localization algorithm, which we named SPAWN-FFT. Our simulation results show SPAWN-FFT's superiority over SPAWN regarding the computational effort, while maintaining its full flexibility and localization performance. |
| Divisions: | 18 Department of Electrical Engineering and Information Technology 18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications 18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications > Robust Data Science 18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications > Signal Processing |
| Date Deposited: | 29 Apr 2016 13:22 |
| Last Modified: | 01 Jun 2023 12:24 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum