Energy efficient location service based on kth Order independent set

Location service stores and maintains geographical locations of all the nodes in a network, which is used by location based routing protocols. It consists of location servers which stores location information of some or all nodes in the network. Two basic operations, carried on location servers, are update and query. In update operation, nodes update their location information stored in their location servers. In query, any node wish to communicate with a node in the network queries for the location of destination node. There is a tradeoff between robustness of the location service and its energy efficiency. For increasing the robustness of the system, there should be more nodes serving as location server, but it causes network congestion because of increase in number of control packets and decrease in network lifetime because of power consumption. On the other hand to increase lifetime of the network and to decrease number of control packets, there should be less number of nodes acting as location server, but it leads to decrease in robustness of the location service. Moreover, the set of location servers should spread all over the network to increase the scalability. In this paper, we propose a method to select evenly distributed location servers dynamically based on k^th Order independent set. The number of servers increases as the value of k decreases.