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
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2016 |
| Autor(en): | Scheidt, F. ; Jin, D. ; Muma, M. ; Zoubir, A. M. |
| Art des Eintrags: | Bibliographie |
| Titel: | Fast and Accurate Cooperative Localization in Wireless Sensor Networks |
| Sprache: | Englisch |
| Publikationsjahr: | 1 Dezember 2016 |
| Verlag: | IEEE |
| Buchtitel: | 24th European Signal Processing Conference (EUSIPCO 2016): Proceedings |
| Veranstaltungstitel: | 24th European Signal Processing Conference |
| Veranstaltungsort: | Budapest, Hungary |
| Veranstaltungsdatum: | 28.08.2016-02.09.2016 |
| DOI: | 10.1109/EUSIPCO.2016.7760236 |
| Kurzbeschreibung (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. |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Robust Data Science 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Signalverarbeitung |
| Hinterlegungsdatum: | 29 Apr 2016 13:22 |
| Letzte Änderung: | 01 Jun 2023 12:24 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum