Results 1 - 10
of
175
Multiple controlled mobile elements (data mules) for data collection in sensor networks
- In DCOSS
, 2005
"... Abstract. Recent research has shown that using a mobile element to collect and carry data mechanically from a sensor network has many advantages over static multihop routing. We have an implementation as well employing a single mobile element. But the network scalability and traffic may make a singl ..."
Abstract
-
Cited by 120 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Recent research has shown that using a mobile element to collect and carry data mechanically from a sensor network has many advantages over static multihop routing. We have an implementation as well employing a single mobile element. But the network scalability and traffic may make a single mobile element insufficient. In this paper we investigate the use of multiple mobile elements. In particular, we present load balancing algorithm which tries to balance the number of sensor nodes each mobile element services. We show by simulation the benefits of load balancing. 1
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.
Routing Protocols in Wireless Sensor Networks-A Survey,
- International Journal of Computer Science & Engineering Survey(IJCESE),
, 2010
"... Abstract Advances in wireless sensor network (WSN) ..."
Abstract
-
Cited by 40 (3 self)
- Add to MetaCart
(Show Context)
Abstract Advances in wireless sensor network (WSN)
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
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.
On the energy hole problem of nonuniform node distribution in wireless sensor networks
- IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS
, 2006
"... Abstract — In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy in wireless sensor networks, which aims to avoid the energy hole around the sink. We find that in a circular sensor network with a nonuniform node distribution and constant data reporting, t ..."
Abstract
-
Cited by 24 (1 self)
- Add to MetaCart
(Show Context)
Abstract — In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy in wireless sensor networks, which aims to avoid the energy hole around the sink. We find that in a circular sensor network with a nonuniform node distribution and constant data reporting, the unbalanced energy depletion among the nodes in the whole network is unavoidable. This is because although all the inner nodes have used up their energy simultaneously, the outmost part of the network may still have energy left. In spite of this fact, a suboptimal energy efficiency among the inner parts of the network is possible if the number of nodes increases with geometric proportion from the outer parts to the inner ones. In our proposed nonuniform node distribution strategy, the ratio between the node densities of the adjacent (i+1)th corona and the ith corona is equal to (2i − 1)/q(2i +1), where q is the geometric proportion mentioned above. We also present a routing algorithm with this node distribution strategy. Simulation experiments demonstrate that when the network lifetime has ended, the nodes in the inner parts of the network achieve nearly balanced energy depletion, and only less than 10 % of the total energy is wasted. I.
