Tolerance of localization imprecision in efficiently managing mobile sensor databases

Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index structure in an ad hoc manner requires two operations: localization to discover the sensor’s position; and assignment to each sensor of the appropriate data space partition. We propose a fully distributed, cost-effective scheme, which integrates localization, indexing and data space management for sensors. We show that without affecting the overall performance of routing and query processing, our localization scheme, which involves merely local interaction, is performed with significantly less message and time cost than traditional approaches. Categories and Subject Descriptors E.1 [Data Structures]: Distributed data structures; C.2.4 [Computer-Communication Networks]: Distributed Systems – Distributed Databases; H.2.2 [Database Management]: Physical Design – Access Methods. General Terms Algorithms, Ma...

• Type: Conference
• Year: 2005
• Where: MOBIDE
• Authors: Lin Xiao, Aris M. Ouksel
• Keywords: Data Space, MOBIDE 2005, Query Processing, Sensor