Results 1 - 10
of
110
Energy conservation in wireless sensor networks: A survey
"... In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifeti ..."
Abstract
-
Cited by 227 (11 self)
- Add to MetaCart
In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. In this paper we first break down the energy consumption for the components of a typical sensor node, and discuss the main directions to energy conservation in WSNs. Then, we present a systematic and comprehensive taxonomy of the energy conservation schemes, which are subsequently discussed in depth. Special attention has been devoted to promising solutions which have not yet obtained a wide attention in the literature, such as techniques for energy efficient data acquisition. Finally we conclude the paper with insights for research directions about energy conservation in WSNs.
Rendezvous design algorithms for wireless sensor networks . . .
, 2008
"... Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range communications. However, a major performance bottleneck of such WSNs is the significantly increased latency in data collect ..."
Abstract
-
Cited by 61 (5 self)
- Add to MetaCart
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range communications. However, a major performance bottleneck of such WSNs is the significantly increased latency in data collection due to the low movement speed of mobile base stations. To address this issue, we propose a rendezvous-based data collection approach in which a subset of nodes serve as the rendezvous points that buffer and aggregate data originated from sources and transfer to the base station when it arrives. This approach combines the advantages of controlled mobility and in-network data caching and can achieve a desirable balance between network energy saving and data collection delay. We propose two efficient rendezvous design algorithms with provable performance bounds for mobile base stations with variable and fixed tracks, respectively. The effectiveness of our approach is validated through both theoretical analysis and extensive simulations.
Mobiroute: Routing towards a mobile sink for improving lifetime in sensor networks
- in Sensor Networks in the 2nd IEEE/ACM DCOSS
, 2006
"... Improving network lifetime is a fundamental challenge of wireless sensor networks. One possible solution consists in making use of mobile sinks. Whereas theoretical analysis shows that this approach does indeed benefit network lifetime, practical routing protocols that support sink mobility are stil ..."
Abstract
-
Cited by 58 (7 self)
- Add to MetaCart
(Show Context)
Improving network lifetime is a fundamental challenge of wireless sensor networks. One possible solution consists in making use of mobile sinks. Whereas theoretical analysis shows that this approach does indeed benefit network lifetime, practical routing protocols that support sink mobility are still missing. In this paper, in line with our previous efforts, we investigate the approach that makes use of a mobile sink for balancing the traffic load and in turn improving network lifetime. We engineer a routing protocol, MobiRoute, that effectively supports sink mobility. Through intensive simulations in TOSSIM with a mobile sink and an implementation of MobiRoute, we prove the feasibility of the mobile sink approach by demonstrating the improved network lifetime in several deployment scenarios. I.
Controlled sink mobility for prolonging wireless sensor networks lifetime
, 2008
"... This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs that comprise a large number of statically placed s ..."
Abstract
-
Cited by 52 (1 self)
- Add to MetaCart
This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show that by controlling the sink movements we can obtain remarkable lifetime improvements. In order to determine sink movements, we first define a Mixed Integer Linear Programming (MILP) analytical model whose solution determines those sink routes that maximize network lifetime. Our contribution expands further by defining the first heuristics for controlled sink movements that are fully distributed and localized. Our Greedy Maximum Residual Energy (GMRE) heuristic moves the sink from its current location to a new site as if drawn toward the area where nodes have the highest residual energy. We also introduce a simple distributed mobility scheme (Random Movement or
Theoretical Results on Base Station Movement Problem for Sensor Network
- In Proc. IEEE INFOCOM
, 2008
"... The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limit and provably optimal algorithms remain difficult to develop. This ..."
Abstract
-
Cited by 46 (5 self)
- Add to MetaCart
(Show Context)
The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limit and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon a novel transformation of the joint base station movement and flow routing problem from time domain to space domain. Based on this transformation, we first show if the base station is allowed to be present only on a set of pre-defined points, then we can find the optimal time duration for the base station on each of these points so that the overall network lifetime is maximized. Based on this finding, we show that when the location of the base station is un-constrained (i.e., can move to any point in the two-dimensional plane), we can develop an approximation algorithm for the joint mobile base station location and flow routing problem such that the network lifetime is guaranteed to be at least of the maximum network lifetime, where can be made arbitrarily small depending on required precision.
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 34 (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.
Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications
- Mobile Computing, IEEE Transactions on
, 2010
"... Abstract—This paper proposes a framework to maximize the lifetime the wireless sensor network (WSN) by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each node does not need to send the data immediate ..."
Abstract
-
Cited by 29 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper proposes a framework to maximize the lifetime the wireless sensor network (WSN) by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each node does not need to send the data immediately as they become available. Instead, the node can store the data temporarily and transmit them when the mobile sink is at the most favorable location for achieving the longest WSN lifetime. To find the best solution within the proposed framework, we formulate optimization problems that maximize the lifetime of the WSN subject to the delay bound constraints, node energy constraints and flow conservation constraints. We conduct extensive computational experiments on the optimization problems and find that the lifetime can be increased significantly as compared to not only the stationary sink model but also more traditional mobile sink models. We also show that the delay tolerance level does not affect the maximum lifetime of the WSN. I.
Rendezvous Planning in Wireless Sensor Networks with Mobile Elements
, 2008
"... Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To addres ..."
Abstract
-
Cited by 28 (2 self)
- Add to MetaCart
(Show Context)
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address this issue, we propose a rendezvous-based approach in which a subset of nodes serves as the rendezvous points (RPs) that buffer data originated from sources and transfer to MEs when they arrive. RPs enable MEs to collect a large volume of data at a time without traveling long distances, which can achieve a desirable balance between network energy saving and data collection delay. We develop two rendezvous planning algorithms: RP-CP and RP-UG. RP-CP finds the optimal RPs when MEs move along the data routing tree, while RP-UG greedily chooses the RPs with maximum energy saving to travel distance ratios. We design the Rendezvous-based Data Collection protocol that facilitates reliable data transfers from RPs to MEs in presence of significant unexpected delays in ME movement and network communication. Our approach is validated through extensive simulations.
Rendezvous planning in mobility-assisted wireless sensor networks
, 2007
"... Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
(Show Context)
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address this issue, we propose a rendezvousbased approach in which a subset of nodes serve as the rendezvous points (RPs) that buffer data originated from sources and transfer to MEs when they arrive. RPs enable MEs to collect a large volume of data at a time without traveling long distances, which can achieve a desirable balance between network energy saving and data collection delay. We develop two rendezvous planning algorithms, RP-CP and RP-UG. RP-CP finds the optimal RPs when MEs move along the data routing tree while RP-UG greedily chooses the RPs with maximum energy saving to travel distance ratios. We design the Rendezvous-based Data Collection protocol that facilitates reliable data transfers from RPs to MEs in presence of significant unexpected delays in ME movement and network communication. Our approach is validated through extensive simulations. these WSNs is to support high-bandwidth data collection with minimum network energy consumption. Several recent work have exploited the use of mobilityassisted WSNs in data collection [5]. In this approach, a small number of mobile devices referred to as mobile elements (MEs) roam about sensing fields and collect data from sensors. As a result, significant network energy saving can be achieved by reducing or completely avoiding costly multi-hop wireless transmissions. On the other hand, the energy consumption of MEs is less constrained as they can replenish their energy supplies because of the mobility. However, the primary disadvantage of this approach is the increased latency. For instance, the typical speed of several practical ME systems (e.g., NIMs [15] and Packbot [18]) is about 0.1 − 1 m/s. As a result, it takes hours for an ME to tour a large sensing field, which cannot meet the delay requirements of many data-intensive applications. 20 minutes to visit all RPs
Reliable and Energy-efficient Data Collection in Sparse Sensor Networks with Mobile Elements
, 2009
"... Sparse wireless sensor networks (WSNs) are emerging as an effective solution for a wide range of applications, especially for environmental monitoring. In many scenarios, a moderate number of sparsely deployed nodes can be sufficient to get the required information about the sensed phenomenon. To th ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
Sparse wireless sensor networks (WSNs) are emerging as an effective solution for a wide range of applications, especially for environmental monitoring. In many scenarios, a moderate number of sparsely deployed nodes can be sufficient to get the required information about the sensed phenomenon. To this end, special mobile elements, i.e. mobile data collectors (MDCs), can be used to get data sampled by sensor nodes. In this paper we present an analytical evaluation of the data collection performance in sparse WSNs with MDCs. Our main contribution is the definition of a flexible model which can derive the total energy consumption for each message correctly transferred by sensors to the MDC. The obtained energy expenditure for data transfer also accounts for the overhead due to the MDC detection when sensor nodes operate with a low duty cycle. The results show that a low duty cycle is convenient and allows a significant amount of correctly received messages, especially when the MDC moves with a low speed. When the MDC moves fast, depending on its mobility pattern, a low duty cycle may not always be the most energy efficient option.
