Proposing an Optimal Model for Localization in Query Based Wireless Sensor Networks

The basis of procedure in query based sensor networks is such that the component nodes of network wait for receiving query from sink and once they took the query, they provide sink with required data. An issue in this kind of networks is the way that location of responder node is calculated. This requires addition of localization mechanisms or localization hardware. The former has communication overhead and the latter has cost overhead and power consumption, both of which result in reduction in life time of the network. Since in most of these networks the exact location of nodes is not required and having the approximate location of nodes is sufficient, a model is presented in this paper that calculates the approximate location of nodes. In this model nodes can obtain their approximate location without any need to extra hardware. In this model each node can obtain its location using query packets received from different sinks. Thus there is no need to communication overhead for calculating the location as well.