Abstract
Supporting nodes without Global Positioning System (GPS) capability, in wireless ad hoc and sensor networks, has numerous applications in guidance and surveying systems in use today. At issue is that a procedure be available so that the subset of nodes with GPS capability succeed in supporting the maximum possible number of nodes without GPS capability and as a result enable the highest connectivity of the underlying network infrastructure. In this paper, we identify incompleteness in the standard method for computing the position of a node based on three GPS enabled neighbors, in that it may fail to support the maximum possible subset of sensors of the wireless network. We give a new complementary algorithm (the three/two neighbor algorithm) that indeed succeeds in providing a higher fraction of nodes (than the 3-Neighbour algorithm) with their position. We prove its correctness and test its performance with simulations.
Sign-in/Register to access full text options 
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.
