Modified Gram Schmidt algorithm applied to localization for wireless sensor networks

Many applications that use sensor data from a wireless sensor network (WSN) require corresponding node position information as well. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free algorithms. In this paper, we propose a Modified Gram Schmidt DV-Hop algorithm (MGDV-Hop) by introducing a new formula for computing the optimal hope size, the application of Modified Gram Schmidt Orthogonalization Algorithm for solving least square localization problem and introducing a scheme for reducing power cost in MGDV-hop. Finally, simulation results show that our MGDV-Hop achieves good location accuracy than normal DV-Hop.