Results 1 - 10
of
41
Sparse data aggregation in sensor networks
- in IPSN 07
, 2007
"... We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively rare events. In such situations, each node that should participate in the aggregation knows this fact based on its own s ..."
Abstract
-
Cited by 25 (6 self)
- Add to MetaCart
(Show Context)
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively rare events. In such situations, each node that should participate in the aggregation knows this fact based on its own sensor readings, but there is no global knowledge in the network of where all these interesting nodes are located. Instead of blindly querying all nodes in the network, we show how the interesting nodes can autonomously discover each other in a distributed fashion and form an ad hoc aggregation structure that can be used to compute cumulants, moments, or other statistical summaries. Key to our approach is the capability for two nodes that wish to communicate at roughly the same time to discover each other at a cost that is proportional to their network distance. We show how to build nearly optimal aggregation structures that can further deal with network volatility and compensate for the loss or duplication of data by exploiting probabilistic techniques.
Circular Sailing Routing for Wireless Networks
"... Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the shortest paths between sources and destinations in routing protocols to achieve smallest traveled distance. However, this leads ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
(Show Context)
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the shortest paths between sources and destinations in routing protocols to achieve smallest traveled distance. However, this leads to the uneven distribution of traffic load in a network. For example, wireless nodes in the center of the network will have heavier traffic since most of the shortest routes go through them. In this paper, we first describe a novel routing method, called Circular Sailing Routing (CSR), which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by the distance on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path). We then extend CSR to a localized version, Localized CSR, by modifying the greedy routing without any additional communication overhead. Finally, we further propose CSR protocols for 3D networks where nodes are distributed in a 3D space instead of a 2D plane. For all proposed methods, we conduct simulations to study their performances and compare them with global shortest path routing or greedy routing. I.
Phero-Trail: a Bio-inspired Location Service for Mobile Underwater Sensor Networks
, 2008
"... A SEA Swarm (Sensor Equipped Aquatic Swarm) moves as a group with water current and enables 4D (space and time) monitoring of local underwater events such as contaminants and intruders. For prompt alert reporting, mobile sensors forward events to mobile sinks (i.e., autonomous underwater vehicles) v ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
A SEA Swarm (Sensor Equipped Aquatic Swarm) moves as a group with water current and enables 4D (space and time) monitoring of local underwater events such as contaminants and intruders. For prompt alert reporting, mobile sensors forward events to mobile sinks (i.e., autonomous underwater vehicles) via geographic routing, thus requiring a location service. In this paper, we analyze various design choices to realize an efficient location service in a SEA Swarm. We find that conventional ad hoc network location service protocols cannot be directly used, because the entire swarm moves along water current. We show that maintaining location information in a 2D plane is an optimal design choice. Given this, we propose a bio-inspired location service called a Phero-Trail location service protocol. In Phero-Trail, location information is stored in a 2D upper hull of a SEA Swarm, and a mobile sink uses its trajectory (à la a pheromone trail of ants) projected to the 2D hull to maintain location information. This enables mobile sensors to efficiently locate a mobile sink via an expanding spiral curve search. Our preliminarily results show that Phero-Trail performs better than existing approaches.
Information Brokerage via Location-Free Double Rulings ⋆
"... Abstract. The in-network aggregation and processing of information is what sets a sensor network apart from a pure data acquisition device. One way to model the exchange of information between the network nodes is to distinguish between nodes that are producers of information, i.e., those that have ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Abstract. The in-network aggregation and processing of information is what sets a sensor network apart from a pure data acquisition device. One way to model the exchange of information between the network nodes is to distinguish between nodes that are producers of information, i.e., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data or events of certain types. In this paper we aim to support that exchange of information via a so-called information brokerage scheme. Main features of our proposed scheme are that 1) it works in a location-free setting where nodes are unaware of their geographic locations 2) it is robust to non-regular network topologies and 3) it does not require the information producers and consumers to know of each other. Our proposed scheme employs boundary detection algorithms which only quite recently have been developed to extract geometry and topology information even in location-free network deployments. 1
Geometric Algorithms for Sensor Networks
, 2011
"... Networked embedded sensors provide a unique opportunity for real time, large scale, high resolution environmental monitoring. Such systems are becoming ubiquitous across many activities important to our economy and life, from manufacturing and industrial sensing, to traffic and powergrid management, ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Networked embedded sensors provide a unique opportunity for real time, large scale, high resolution environmental monitoring. Such systems are becoming ubiquitous across many activities important to our economy and life, from manufacturing and industrial sensing, to traffic and powergrid management, to wildlife, agriculture and environmental monitoring, to hospital operations and patient observation, all the
Join of Multiple Data Streams in Sensor Networks
"... Abstract — Sensor networks are multi-hop wireless networks of resource-constrained sensor nodes used to realize high-level collaborative sensing tasks. To query or access data generated by the sensor nodes, the sensor network can be viewed as a distributed database. In this article, we develop algor ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
Abstract — Sensor networks are multi-hop wireless networks of resource-constrained sensor nodes used to realize high-level collaborative sensing tasks. To query or access data generated by the sensor nodes, the sensor network can be viewed as a distributed database. In this article, we develop algorithms for communication-efficient implementation of join of multiple (two or more) data streams in a sensor network. The distributed implementation of join in sensor networks is particularly challenging due to unique characteristics of the sensor networks such as limited memory and battery energy on individual nodes, arbitrary and dynamic network topology, multihop communication, and unreliable infrastructure. One of our proposed approaches, viz., the Perpendicular Approach (PA), is load-balanced, and in fact, incurs near-optimal communication cost for the special case of binary joins in grid networks. We compare the performance of our designed approaches through extensive simulations on the ns2 simulator, and show that PA results in substantially prolonging the network lifetime compared to other approaches, especially for joins involving spatial constraints. I.
DP2AC: Distributed Privacy-Preserving Access Control in Sensor Networks
"... Abstract—The owner and users of a sensor network may be different, which necessitates privacy-preserving access control. On the one hand, the network owner need enforce strict access control so that the sensed data are only accessible to users willing to pay. On the other hand, users wish to protect ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
Abstract—The owner and users of a sensor network may be different, which necessitates privacy-preserving access control. On the one hand, the network owner need enforce strict access control so that the sensed data are only accessible to users willing to pay. On the other hand, users wish to protect their respective data access patterns whose disclosure may be used against their interests. This paper presents DP2AC, a Distributed Privacy-Preserving Access Control scheme for sensor networks, which is the first work of its kind. Users in DP2AC purchase tokens from the network owner whereby to query data from sensor nodes which will reply only after validating the tokens. The use of blind signatures in token generation ensures that tokens are publicly verifiable yet unlinkable to user identities, so privacy-preserving access control is achieved. A central component in DP2AC is to prevent malicious users from reusing tokens. We propose a suite of distributed techniques for token-reuse detection (TRD) and thoroughly compare their performance with regard to TRD capability, communication overhead, storage overhead, and attack resilience. The efficacy and efficiency of DP2AC are confirmed by detailed performance evaluations. I.
Chasing the Hidden Connectivity in Urban Vehicular Networks
"... Abstract—The high mobility of VANET makes information exchange across the network excessively difficult. Traditional approaches designed for stationary networks are not applicable due to the high dynamics among the nodes. Applying the routing techniques tailored for general mobile networks inevitabl ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—The high mobility of VANET makes information exchange across the network excessively difficult. Traditional approaches designed for stationary networks are not applicable due to the high dynamics among the nodes. Applying the routing techniques tailored for general mobile networks inevitably brings huge traffic burden to the crowded urban VANET and leads to low efficiency. To make the information exchange fluent and efficient, we explore the unique features of the urban VANET. By chasing the invariants in the mobile network topology, we are able to efficiently manage the information on top of the “intersection graph ” transformed from the underlying network of road segments in the urban area. Our approach can thus achieve efficient query dissemination and data retrieval on this information organization. This approach is further extended to provide efficient end-to-end routing among vehicles with much reduced network overhead. We conduct a trace based study to fully adapt our design to the practical conditions in the real circumstance. We intensively investigate and analyze a trace that records the movement of more than 4000 taxies in the urban area of Shanghai City over several months. We grasp the key impact of the fundamental factors that affect the VANET behaviors and accordingly develop tailored techniques to maximize the performance of this design. Experimental results validate the effectiveness and efficiency of our design. Compared with those approaches for general mobile networks, we believe this design best suits the urban VANET environment. Keywords—Urban VANET; information exchange; routing; road map 1
Topology Dependent Space Filling Curves for Sensor Networks and Applications
"... Abstract—In this paper we propose an algorithm to construct a “space filling ” curve for a sensor network with holes. Mathematically, for a given multi-hole domain R, we generate a path P that is provably aperiodic (i.e., any point is covered at most a constant number of times) and dense (i.e., any ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper we propose an algorithm to construct a “space filling ” curve for a sensor network with holes. Mathematically, for a given multi-hole domain R, we generate a path P that is provably aperiodic (i.e., any point is covered at most a constant number of times) and dense (i.e., any point of R is arbitrarily close to P). In a discrete setting as in a sensor network, the path visits the nodes with progressive density, which can adapt to the budget of the path length. Given a higher budget, the path covers the network with higher density. With a lower budget the path becomes proportional sparser. We show how this density-adaptive space filling curve can be useful for applications such as serial data fusion, motion planning for data mules, sensor node indexing, and double ruling type in-network data storage and retrieval. We show by simulation results the superior performance of using our algorithm vs standard space filling curves and random walks. I.
H (2010) Exploring the hidden connectivity in urban vehicular networks
- In: IEEE ICNP 2010, Kyoto, Japan
, 2010
"... ..."
(Show Context)
