Name
Abstract | ||
|---|---|---|
Cooperative localization capability is a highly desirable characteristic of wireless sensor networks. It has attracted considerable research attention in academia and industry. The sumproduct 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. |
Year | Venue | Keywords |
|---|---|---|
2016 | European Signal Processing Conference | Cooperative localization,SPAWN,FFT,Kernel bandwidth,Efficient computation |
Field | DocType | ISSN |
Kernel (linear algebra),Key distribution in wireless sensor networks,Computer science,Convolution,Interpolation,Real-time computing,Fast Fourier transform,Bandwidth (signal processing),Wireless sensor network,Computational complexity theory | Conference | 2076-1465 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabian Scheidt | 1 | 0 | 0.34 |
| Di Jin | 2 | 19 | 3.07 |
| Michael Muma | 3 | 144 | 19.51 |
| Abdelhak M. Zoubir | 4 | 1036 | 148.03 |