Abstract
Location knowledge of sensor nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks, and it is hard to get the precision solution by traditional node localization algorithm, while genetic algorithm is an effective methodology for solving combinatorial optimization problems, so, in this paper, a real-coded version of the commonly used genetic algorithm is described in order to evaluate the precision of node localization problem in wireless sensor networks, meanwhile, the corresponding fitness function and genetic operators are designed. The algorithms presented in this paper are validated on a combined Windows XP and MATLAB simulation on a sensor network with fixed number of nodes whose distance measurements are corrupted by Gaussian noise. The results show that the proposed scheme gives accurate location of nodes.
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.
