A survey on in-network querying and tracking services for wireless sensor networks

Given a set of m mobile objects in a sensor network, we consider the problem of finding the nearest object among them from any node in the network at any time. These mobile objects are tracked by nearby sensors called proxy nodes. This problem requires an object tracking mechanism which typically relies on two basic operations: query and update. A query is invoked by a node each time when there is a need to find the closest object from it in the network. Updates of an object's location are initiated when the object moves from one location (proxy node) to another. We present a scalable distributed algorithm for tracking these mobile objects such that both the query cost and the update cost are small. The main idea in our algorithm is to maintain a virtual tree of downward paths pointing to the objects. Our algorithm guarantees an asymptotically optimal O(1) approximation for query cost and an O(min{log n, log D}) approximation for update cost in the constantdoubling graph model, where n and D, respectively, are the number of nodes and the diameter of the network. We also give polylogarithmic approximations for both query and update cost in the general graph model. Our algorithm requires only polylogarithmic bits of memory per node. To the best of our knowledge, this is the first algorithm that is asymptotically optimal in handling nearest neighbor queries with low update cost in a distributed setting.

show abstract

“…However, these approaches assume a single object per hierarchy. We direct readers to this recent survey [16] for more details.…”

Section: Related Workmentioning

confidence: 98%

“…can be detected by nearby sensors [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. This application is interesting and arises in a setting where a system of static sensor nodes and a set of mobile objects are working in the same physical plane [12].…”

Section: Introductionmentioning

confidence: 99%

Optimal nearest neighbor queries in sensor networks

Sharma

Busch

2015

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…• How to deploy and manage heterogeneous nodes • How to deal with node failure and adjust the network topology accordingly • Study the mobility effects (target, nodes or sink relocation) on the quality of tracking performance and what is required for network adaption accordingly • The use of efficient aggregation techniques • The manufacturing of sensor nodes to have more powerful batteries, fast processors and long-distance transceivers in order to optimize the energy consumption and achieve better coverage (Can and Demirbas, 2013).…”

Section: Discussionmentioning

confidence: 99%

Object Tracking in Wireless Sensor Networks: Challenges and Solutions

Ismail¹,

Alkhader²,

Elnaffar³

2016

Journal of Computer Science

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) are small, inexpensive and battery-operated sensor nodes that are deployed over a geographical area. WSNs are used in many applications such border patrolling, military intrusion detection, wildlife animal monitoring, surveillance of natural disasters and healthcare systems. Mobile object tracking is a vital task in all these applications. The goal of this work is to highlight the most important challenges in the field of object tracking and provide a survey of the WSN architectural design and implementation approaches for tackling this problem.To that end, we analyze how each approach responds to each challenge and where it falls short. This analysis should provide researchers with a state-of-the-art review and inspire them to propose novel solutions.

show abstract

“…We categorize querying protocols in the WSNs literature according to their underlying data routing mechanisms, as geometrical, hierarchical cluster-based, hash-based, and tree-based [4]. In this section, we select a querying protocol from each of these categories and discuss how an EG can be related with these protocols.…”

Section: Intra-island Queryingmentioning

confidence: 99%

“…Gathered data is routed to the querying or indexing unit by multi-hop routing techniques. Based on the underlying routing techniques, Can and Demirbas categorize in-network querying techniques as geometrical, hierarchical cluster-based, hash-based, and tree-based with a discussion of WSN design metrics, such as energy-efficiency, distance-sensitivity, scalability and fault-tolerance [4].…”

Section: Related Workmentioning

confidence: 99%

Querying on Federated Sensor Networks

Can

Demirbaş

2016

JSAN

Self Cite

View full text Add to dashboard Cite

A Federated Sensor Network (FSN) is a network of geographically distributed Wireless Sensor Networks (WSNs) called islands. For querying on an FSN, we introduce the Layered Federated Sensor Network (L-FSN) Protocol. For layered management, L-FSN provides communication among islands by its inter-island querying protocol by which a query packet routing path is determined according to some path selection policies. L-FSN allows autonomous management of each island by island-specific intra-island querying protocols that can be selected according to island properties. We evaluate the applicability of L-FSN and compare the L-FSN protocol with various querying protocols running on the flat federation model. Flat federation is a method to federate islands by running a single querying protocol on an entire FSN without distinguishing communication among and within islands. For flat federation, we select a querying protocol from geometrical, hierarchical cluster-based, hash-based, and tree-based WSN querying protocol categories. We found that a layered federation of islands by L-FSN increases the querying performance with respect to energy-efficiency, query resolving distance, and query resolving latency. Moreover, L-FSN's flexibility of choosing intra-island querying protocols regarding the island size brings advantages on energy-efficiency and query resolving latency.

show abstract

A survey on in-network querying and tracking services for wireless sensor networks

Cited by 35 publications

References 35 publications

Optimal nearest neighbor queries in sensor networks

Optimal nearest neighbor queries in sensor networks

Object Tracking in Wireless Sensor Networks: Challenges and Solutions

Querying on Federated Sensor Networks

Contact Info

Product

Resources

About