ation of its location. This process consumes high energy of the network. These distributed localization algorithms are generally suboptimal and less efficient in terms of accuracy and energy compared to centralized algorithm. In order to solve these problems of localization, the authors in (Zhu, 2017) have proposed a SDN based anchor scheduling algorithm for the localization in the WSN. Main objective of the proposed algorithm to minimize number of active anchor nodes. Since SDN paradigm control the network activities through from the Downloaded: 4/15/2022 9:44:49 AM Nova Southeastern University IP Address: 137.52.76.29 Software-Defined Networking Paradigm in Wireless Sensor Networks point of view of global network topology, it offers optimal solution for deciding the optimal number of active anchor nodes and how to estimates the location of normal sensor nodes at the SDN controllers with high accuracy. In the proposed algorithm, it is assume that an information table is maintained in the controller for each anchor node. This information is used to design the timer of the corresponding anchor node. In this scheme, controller determines a subset of active anchor nodes for each time slot and also ensures connectivity among the agents. The proposed scheme works in two phases: Initialization and anchor node scheduling. In the initialization phase, an agent node who does not know its location sends a hello packet to the anchor nodes in order to active them. After this, each active anchor node sends a packet which contains its location, residual energy and the hop counts with the agent i to the SDN controller. In this phase, location of an agent I is estimated at the controller and also information table is constructed for each anchor node. In anchor scheduling phase, first information table is updated after expiration of time slot and after that controller decides the schedule of the anchor nodes based on the connectivity degree of the agents. In (Zhu, 2016), a SDN based localization node selection algorithm is propos