Cooperative positioning in wireless networks

Abstract

In this article, we study cooperative positioning in wireless networks in which target nodes at unknown locations locally collaborate with each other to find their locations. We review different models available for positioning and categorize the model‐based algorithms in two groups: centralized and distributed. We then investigate a lower bound on the variance of unbiased estimators, namely the Cramer–Rao lower bound, which is a common benchmark in the positioning literature. We finally discuss some open problems and research topics in the area of positioning that are worth exploring in future studies.