Grid Location Service (GLS) algorithm partitions the sensing field into the grids and constructs a quad-tree structure over the grids [6]. It uses a hash function, designed on the basis of the quad tree, to match each node (by ID) to a unique subset of nodes called location servers. Every node updates all its location servers with its current location. A node can find the location of any other node by querying one of the location servers of that node. This protocol requires foreknowledge of the sensory field, for grid partition. It may generate large message overhead since location updates and location queries travel along zigzag lines.