Range free localization in WSN against wormhole attack using Farkas’ Lemma

The ongoing ubiquitous computing era with the internet of things (IoT) and wireless sensor networks (WSN) is desperate to realize near-to-truth information by collecting and processing every significant data. It needs precise localization of unknown sensors that are communicating field-sensed data. The significance of location attracts security threats also, like wormhole attacks (WA). The WA compromises network security more simply; however it ruins the localization terribly. Most of the existing WA-combat localization algorithms instead of finding nodes by defining infeasibility, try to identify inappropriate nodes with too narrowly defined parameters to apply to the global visibility of network states. Therefore, the infeasibility defined by Farkas’ lemma is implemented in the proposed algorithm i.e. secure localization algorithm using Farkas’ lemma (SLAF). SLAF has two steps: WA detection and elimination (WDE), and localization of unknown node (LoU). In WDE, it detects nodes that are inconsistent in terms of distance equations defined between sensor pairs. Subsequently, in LoU, distance is approximated as suggested by DV-Hop. However, distance values are further improved by defining elastic variables. Finally, these distance values are passed to linear optimization for localization. The simulation validates SLAF as consistent, reliable, scalable, and precise in comparison with other recent time contenders.