Open AccessPOPA: localising nodes by splitting PLA with n th‐hop anchor neighbours
Author(s) -
Chen Liangyin,
Xiong Xunde,
Liu Kai,
Wang Chaolong,
Zhou Weichao,
Cheng Yanhong,
Luo Qian,
Liu Yan
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2013.4046
Subject(s) - computation , hop (telecommunications) , node (physics) , computer science , algorithm , topology (electrical circuits) , mathematics , computer network , physics , combinatorics , quantum mechanics
A novel distributed range‐free localisation algorithm, named polygonal overlapped possible area (POPA), is proposed to accurately localise an unknown node. First, for an unknown node, to theoretically define its possible localisation area (PLA), virtual radiation regions of its n th‐hop anchor neighbours are introduced. Then an effective area‐splitting algorithm is employed to simplify and speed up the computation of the possible localisation area. Simulation shows localisation error can be controlled within 20% with off‐the‐shelf devices.