CATO: complexity-accuracy trade-off localisation approach in wireless sensor networks

A low computational complexity localisation algorithm with an innovative test procedure and an approximate maximum likelihood-least square hybrid estimation scheme is proposed. The work is based on the following principles: the residual squares from line of sight propagation follow a central chi-square distribution of one degree of freedom; a portion of the residual squares follow a central chi-square distribution, if all the normalised residual squares follow the same distribution. The measures can approximately reduce computational complexity by 90%.