Abstract
Distance vector hop (DV-HOP) localisation algorithm, using flooding routing broadcast anchor node information, is confronted with the problem of communication consumption. Cumulative error will be produced when using the jump distance correction value and the minimum number of hops to represent the distance between the nodes. Using maximum likelihood estimation method to determine the unknown nodes, it suffers from the excessive computational consumption. In this paper, a new algorithm has been presented based on the probability property of random distribution of wireless sensor network. Using the limits hops between nodes will reduce the network communication consumption and minimise the cumulative error in distance calculation. Moreover, trilateral positioning method or the extended MIN-MAX algorithm, which is employed to calculate the unknown node coordinates, can decrease the computational consumption. Performance analysis and simulation results show that the proposed algorithm can achieve multi-objective optimisation with higher precision and lower cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
