TY - GEN
T1 - Query scoping for the sensor internet
AU - Frank, Christian
AU - Roduner, Christof
AU - Noda, Chie
AU - Kellerer, Wolfgang
PY - 2006
Y1 - 2006
N2 - In a large scale distributed system with a large number of sensors interconnected through a wide-area network infrastructure, it is advantageous not to disseminate a query to all available sensors, but only to a subset of the most-relevant ones. We target an application scenario where mobile phones trace users' objects (which are equipped with small identification tags), distribute useful context information related to these objects, and are able to locate them when lost or misplaced. For locating a lost object, the proposed algorithm - parameterized with a data model of the application domain - is able to explore a wide range of heuristics based on history data present in the system (on objects, users, and their past location), similarly to the way a human user would re-iterate all that she/he knows about a lost object in order to locate it. As the proposed algorithm uses the data present in the system to parameterize its execution, it is generic enough to be applied to other application domains.
AB - In a large scale distributed system with a large number of sensors interconnected through a wide-area network infrastructure, it is advantageous not to disseminate a query to all available sensors, but only to a subset of the most-relevant ones. We target an application scenario where mobile phones trace users' objects (which are equipped with small identification tags), distribute useful context information related to these objects, and are able to locate them when lost or misplaced. For locating a lost object, the proposed algorithm - parameterized with a data model of the application domain - is able to explore a wide range of heuristics based on history data present in the system (on objects, users, and their past location), similarly to the way a human user would re-iterate all that she/he knows about a lost object in order to locate it. As the proposed algorithm uses the data present in the system to parameterize its execution, it is generic enough to be applied to other application domains.
UR - http://www.scopus.com/inward/record.url?scp=33845932913&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33845932913
SN - 1424402379
SN - 9781424402373
T3 - Proceedings for ICPS:2006 International Conference on Pervasive Services
SP - 239
EP - 242
BT - Proceedings for ICPS:2006 International Conference on Pervasive Services
T2 - ICPS:2006 International Conference on Pervasive Services
Y2 - 26 June 2006 through 29 June 2006
ER -