Results 1 - 10
of
54
Data collection in wireless sensor networks with mobile elements: A survey
- ACM Trans. Sensor Networks
"... Wireless sensor networks (WSNs) have emerged as an effective solution for a wide range of applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been propo ..."
Abstract
-
Cited by 32 (4 self)
- Add to MetaCart
(Show Context)
Wireless sensor networks (WSNs) have emerged as an effective solution for a wide range of applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been proposed. Most of them exploit mobility to address the problem of data collection in WSNs. In this paper we first define WSNs with MEs and provide a comprehensive taxonomy of their architectures, based on the role of the MEs. Then, we present an overview of the data collection process in such scenario, and identify the corresponding issues and challenges. On the basis of these issues, we provide an extensive survey of the related literature. Finally, we compare the underlying approaches and solutions, with hints to open problems and future research directions.
Ubiquitous data collection for mobile users in wireless sensor networks
- In Proceedings of IEEE INFOCOM
, 2011
"... Abstract—We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data. We propose a novel approach for mobile users to collect the network-wide data. The routing structure of data collection i ..."
Abstract
-
Cited by 23 (4 self)
- Add to MetaCart
(Show Context)
Abstract—We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data. We propose a novel approach for mobile users to collect the network-wide data. The routing structure of data collection is additively updated with the movement of the mobile user. With this approach, we only perform a local modification to update the routing structure while the routing performance is bounded and controlled compared to the optimal performance. The proposed protocol is easy to implement. Our analysis shows that the proposed approach is scalable in maintenance overheads, performs efficiently in the routing performance, and provides continuous data delivery during the user movement. We implement the proposed protocol in a prototype system and test its feasibility and applicability by a 49-node testbed. We further conduct extensive simulations to examine the efficiency and scalability of our protocol with varied network settings.
Fast and Energy Efficient Sensor Data Collection by Multiple Mobile Sinks
, 2007
"... We investigate the impact of multiple, mobile sinks on efficient data collection in wireless sensor networks. To improve performance, our protocol design focuses on minimizing overlaps of sink trajectories and balancing the service load among the sinks. To cope with high network dynamics, placement ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
We investigate the impact of multiple, mobile sinks on efficient data collection in wireless sensor networks. To improve performance, our protocol design focuses on minimizing overlaps of sink trajectories and balancing the service load among the sinks. To cope with high network dynamics, placement irregularities and limited network knowledge we propose three different protocols: a) a centralized one, that explicitly equalizes spatial coverage; this protocol assumes strong modeling assumptions, and also serves as a kind of performance lower bound in uniform networks of low dynamics b) a distributed protocol based on mutual avoidance of sinks c) a clustering protocol that distributively groups service areas towards balancing the load per sink. Our simulation findings demonstrate significant gains in latency, while keeping the success rate and the energy dissipation at very satisfactory levels even under high network dynamics and deployment heterogeneity.
Interest Dissemination with Directional Antennas for Wireless Sensor Networks with Mobile Sinks
- Proc. Fourth Int’l Conf. Embedded Networked Sensor Systems (Sensys ’06
, 2006
"... Introducing mobile data sinks into wireless sensor net-works (WSNs) improves the energy efficiency and the net-work lifetime, and is demanded for many application sce-narios, such as battlefield vehicle security, mobile data ac-quisition, and cellular phone based sensor networks. How-ever, highly mo ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
Introducing mobile data sinks into wireless sensor net-works (WSNs) improves the energy efficiency and the net-work lifetime, and is demanded for many application sce-narios, such as battlefield vehicle security, mobile data ac-quisition, and cellular phone based sensor networks. How-ever, highly mobile sink nodes cause frequent topology changes, resulting in high packet loss rate and poor energy efficiency of traditional reactive WSN routing algorithms. A directional-antenna-assisted reactive routing protocol for WSNs, IDDA (Interest Dissemination with Directional An-tenna) is introduced to resolve this problem. Different from traditional interest diffusion routing protocols, IDDA ex-ploits the antenna directivity to prearrange interest dissem-ination along the direction of motion. IDDA enhances im-portant performance metrics in a target detection application scenario, namely, energy efficiency, packet delivery ratio, and target detection ratio. An analytical model is established to calculate the optimal width of the antenna beam pattern and optimal transmitting power. Extensive simulation re-sults show that IDDA outperforms the traditional directed diffusion protocol in all three aforementioned metrics, which guarantees that IDDA can be applied to WSNs with highly mobile data sink nodes.
Data Stashing: Energy-Efficient Information Delivery to Mobile Sinks through Trajectory Prediction
"... In this paper, we present a routing scheme that exploits knowledge about the behavior of mobile sinks within a network of data sources to minimize energy consumption and network congestion. For delay-tolerant network applications, we propose to route data not to the sink directly, but to send it ins ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
(Show Context)
In this paper, we present a routing scheme that exploits knowledge about the behavior of mobile sinks within a network of data sources to minimize energy consumption and network congestion. For delay-tolerant network applications, we propose to route data not to the sink directly, but to send it instead to a relay node along an announced or predicted path of the mobile node that is close to the data source. The relay node will stash the information until the mobile node passes by and picks up the data. We use linear programming to find optimal relay nodes that minimize the number of necessary transmissions while guaranteeing robustness against link and node failures, as well as trajectory uncertainty. We show that this technique can drastically reduce the number of transmissions necessary to deliver data to mobile sinks. We derive mobility and association models from realworld data traces and evaluate our data stashing technique in simulations. We examine the influence of uncertainty in the trajectory prediction on the performance and robustness of the routing scheme.
Adaptive redundancy for data propagation exploiting dynamic sensory mobility, in
- Proceedings of the 11th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), ACM Press, 2008
, 2009
"... Motivated by emerging applications, we consider sensor net-works where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios char-acterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
(Show Context)
Motivated by emerging applications, we consider sensor net-works where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios char-acterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accu-rately takes into account both the spatial and speed charac-teristics of motion. We then propose adaptive data dissem-ination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g., the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissem-ination schemes are enhanced by a distance-sensitive proba-bilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e., adaptation increases the success rate and reduces la-tency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher mes-sage delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues. Categories and Subject Descriptors: C.2.1 [Network
GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries
- IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR, MESH AND AD HOC COMMUNICATIONS AND NETWORKS
, 2008
"... Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adversary, which seeks to exploit sensor networks by obtaining measurements in an unauthorized way. Our low-complexity soluti ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adversary, which seeks to exploit sensor networks by obtaining measurements in an unauthorized way. Our low-complexity solution, GossiCrypt, leverages on the large scale of sensor networks to protect confidentiality efficiently and effectively. GossiCrypt protects data by symmetric key encryption at their source nodes and re-encryption at a randomly chosen subset of nodes en route to the sink. Furthermore, it employs key refreshing to mitigate the physical compromise of cryptographic keys. We validate GossiCrypt analytically and with simulations, showing it protects data confidentiality with probability almost one. Moreover, compared with a system that uses public-key data encryption, the energy consumption of GossiCrypt is from tens to thousands of times lower.
1 Optimizing Event Coverage in Theme Parks
"... Abstract — Theme parks can be modeled as geographical areas where large crowds of people move among different attractions. The operators of a theme park are interested in quickly and efficiently handling events occurring at various locations in the park. We propose a model which deploys a wireless n ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
(Show Context)
Abstract — Theme parks can be modeled as geographical areas where large crowds of people move among different attractions. The operators of a theme park are interested in quickly and efficiently handling events occurring at various locations in the park. We propose a model which deploys a wireless network with mobile sinks to facilitate event coverage. The event coverage problem can be divided into two sub-problems: the static problem of mobile sink positioning and the dynamic problem of event handling decisions of the mobile sinks. For the mobile sink positioning problem we propose two strategies: crowd density based probability estimation (CDPE) and hot-spot based probability estimation (HSPE). For the event handling decision problem, we propose an approach which represents movement opportunities in the park as a graph with dynamically changing weights, and searches for the shortest path in this dynamic graph. The proposed approaches are simulated on scenarios which model the movement of the visitors using two sophisticated human mobility models. I.
doi:10.1093/comjnl/bxp110 Heuristic Approaches for Transmission Scheduling in Sensor Networks with
, 2009
"... A large part of the energy budget of traditional sensor networks is consumed by the hop-by-hop routing of the collected information to the static sink. In many applications it is possible to replace the static sink with one or more mobile sinks that move in a sensor field and collect the data throug ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
A large part of the energy budget of traditional sensor networks is consumed by the hop-by-hop routing of the collected information to the static sink. In many applications it is possible to replace the static sink with one or more mobile sinks that move in a sensor field and collect the data through one-hop transmissions.This greatly reduces the power consumption of the nodes, which can be further reduced by choosing the appropriate moment of transmission. In general, the transmission energy increases quickly with the distance, and thus it makes sense for the nodes to transmit when one of the mobile sinks is in close proximity. Seeing the node as an autonomous agent, it needs to choose its actions of transmitting or buffering the collected data based on what it knows about the environment and its predictions about the future. The sensor agent needs to appropriately balance the following two objectives: the maximization of the utility of the collected and transmitted data and the minimization of the energy expenditure. We introduce the cummulative policy penalty as an expression of this interdependent pair of requirements. As a baseline, we describe a graph-theory-based approach for calculating the optimal policy in a complete knowledge setting. Then, we describe and compare three heuristics based on different principles (imitation of human decision making, stochastic transmission and constant risk). We compare the proposed approaches in an experimental study under a variety of scenarios.
Scaling Properties of Routing Protocols in Sensor Networks With Mobile Access
, 2007
"... The task of routing streaming data in a sensor network is made arduous by the resource constraints imposed on each node. The control overhead of a routing protocol has to be minimized in order to preserve limited resources at the node. Furthermore, it is widely expected that the gateway of the senso ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The task of routing streaming data in a sensor network is made arduous by the resource constraints imposed on each node. The control overhead of a routing protocol has to be minimized in order to preserve limited resources at the node. Furthermore, it is widely expected that the gateway of the sensor network will not be static in many application scenarios, but will be moving around the network. The gateway could move to collect data, or because it is not associated with a specific location, but with a specific mobile user. We study
