Efficient and practical query scoping in sensor networks

Abstract

A driving scenario for sensor networks is environmental monitoring: nodes gather data and send it back to a sink (i.e., a basestation with an internet connection or persistent storage) via a multi-hop tree topology. In order to form the data-gathering tree, and in order to configure the sensor nodes, the sink periodically disseminates messages into the network. For scaling, robustness, and load-balancing reasons, it is desirable to introduce multiple sinks and have nodes send data to their closest sink (under a metric, such as hop-count or energy cost) rather than all nodes sending to a unique sink. With multiple sinks, it becomes important to constrain dissemination of queries so that each sink does not flood the whole network. In this work we propose Voronoi scoping, a distributed algorithm to constrain the dissemination of messages from different sinks. It has the property that a query originated by a given sink will be forwarded only to the nodes for which that sink is the closest sink (under the chosen metric). Thus each query is forwarded to the smallest possible number of nodes, and per-node dissemination overhead does not grow with network size or with number of sinks. The algorithm has a simple distributed implementation and requires only a few bytes of state at each node. Experiments over a network of 55 motes confirm the algorithm's effectiveness.

Autonomous Decentralized Control Scheme for Long-Term Operation of Large Scale and Dense Wireless Sensor Networks with Multiple Sinks

“…In Fig.6, the existing schemes in Ohtaki et al, 2006 andUtani et al, 2008, which belong to the category of ant-based routing algorithms, are denoted as MUAA and AAR, respectively. The existing scheme in Dubois-Ferriere et al, 2004 andOyman andErsoy, 2004, which describe representative data gathering for a wireless sensor network with multiple sinks, is denoted as NS. From Fig.6, it can be confirmed that our scheme denoted as Proposal in Fig.6 achieves a longer-term operation of a wireless sensor network with multiple sinks than the existing ones because it improves and balances the load of each sensor node by the communication load reduction for network control and the autonomous load-balancing data transmission.…”

A Sink Node Allocation Scheme in Wireless Sensor Networks Using Suppression Particle Swarm Optimization

“…This makes the long-term observation by a wireless sensor network difficult. To solve this communication load concentration problem, a data gathering scheme for a wireless sensor network with multiple sinks has been proposed (Dubois-Ferriere et al, 2004;Oyman & Ersoy, 2004). Each sensor node, in this scheme, sends sensing data to the nearest sink node.…”

A Novel Model for User Mobility in Wireless Sensor Networks

“…1, a sink in typical sensor networks takes charge of the function as a gateway for a connection with infrastructure networks [1]. Various papers in relation to multiple static sinks also indicate the connection between a sink and an infrastructure network and the connection between all sinks as an assumption [10], [11]. Therefore, in this paper, it is assumed that each sink placed in the edge of a sensor field can communicate with the other sinks via the infrastructure networks.…”