Abstract

A scalable object location service can enable users to search for various objects in an environment where many small, networked devices are attached to objects. We investigate two hierarchical, self-configuring or unattended approaches for an eficient object location service. Each approach has its advantages and disadvantages based on the anticipated load. The first approach, SCOUT-AGG, is based on aggregation of object names. The second approach, SCOUT-MAE is based on indirection, where information about an object is stored at the locator sensor for the object. The relative efJiciency of SCOUT-AGG and SCOUT-MAP can be characterized by the query to mobilit>l update rate of the system. SCOUT-AGG performs better for low query to update rate but its performance deteriorates in general relative to SCOUT-MAP as the query to update rate increases. The rate of performance deterioration depends on query specijicity (i.e., queries for a specific object or for any object of a particular t>lpe). SCOUT-MAP generally exhibits better load balancing than SCOUT-AGG for various scenarios. We support the above results through simple analytical modeling and siniulation. 1.

Citations