Resource discovery in mobile grids

Abstract

Dual Heap Overlay Resource Discovery Protocol for Mobile Grid proposed in this work locates mobile nodes in a dynamic mobile grid The protocol resolves exact partial match and range queries specifying multi attribute based search for mobile nodes Organizing dynamic nodes with frequently changing attributes to facilitate query resolution is not trivial Issues specific to centralized approaches and P2P approaches employing single or multiple Distributed Hash newlineTables to discovery are overcome by non DHT overlays used by the protocol The protocol uses two non DHT min heap overlays namely the sum heap and the attribute heap A mobile grid built on a cellular network is investigated A central node closer to the Base Station receives periodically the state information on mobile nodes and maintains the centralized sum heap Each newlinenode in the sum heap serves as an index to all nodes having same attribute sum Attribute heap is distributed among the peers based on one of the attributes Upon receipt of the query the central node computes the sum of the attributes in the query Nodes are disqualified and not considered for the query request whose attribute sum exceeds the sum as per the sum heap Nodes if any newlinewhose sum matches newline newline newline