Results 1 - 10 of 52

Energy conservation in wireless sensor networks: A survey

by Giuseppe Anastasi, Marco Conti, Mario Di Francesco, Andrea Passarella
"... 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.

Data collection in wireless sensor networks with mobile elements: A survey

by Mario Di Francesco, Sajal K. Das, Giuseppe Anastasi - 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.
(Show Context)

Towards an optimal positioning of multiple mobile sinks in wsns for buildings

by Leila Ben Saad, Bernard Tourancheau - Int J On Advances in Intelligent Systems
"... The need for wireless sensor networks is rapidly growing in a wide range of applications specially for buildings automation. In such networks, a large number of sensors with limited energy supply are in charge of relaying the sensed data hop by hop to the nearest sink. The sensors closest to the sin ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
The need for wireless sensor networks is rapidly growing in a wide range of applications specially for buildings automation. In such networks, a large number of sensors with limited energy supply are in charge of relaying the sensed data hop by hop to the nearest sink. The sensors closest to the sinks deplete their energy much faster than distant nodes because they carry heavy traffic which causes prematurely the end of the network lifetime. Employing mobile sinks can alleviate this problem by distributing the high traffic load among the sensors and increase the network lifetime. In this work, we aim to find the best way to relocate sinks inside buildings by determining their optimal locations and the duration of their sojourn time. Therefore, we propose an Integer Linear Program for multiple mobile sinks which directly maximizes the network lifetime instead of minimizing the energy consumption or maximizing the residual energy, which is what was done in previous solutions. We evaluated the performance of our approach by simulation and compared it with others schemes. The results show that our solution extends significantly the network lifetime and balances notably the energy consumption among the nodes.
(Show Context)

Data spider: A resilient mobile basestation protocol for efficient data collection in wireless sensor networks

by Onur Soysal, Murat Demirbas - The 6th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS , 2010
"... Abstract—Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, such as tracking and detection applications, static basestations suffer from communication bottlenecks and long r ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
Abstract—Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, such as tracking and detection applications, static basestations suffer from communication bottlenecks and long routes, which cause reliability and lifetime to plummet. To address this problem, we propose a holistic solution where the synergy of the WSN and the mobile basestation improves the reliability and lifetime of data collection. The WSN component of our solution is a very lightweight dynamic routing tree maintenance protocol which tracks the location of the basestation to provide an always connected network. Our basestation algorithm complements the dynamic tree reconfiguration protocol by trailing towards the data generation, and hence, reducing the number of hops data needs to travel to the basestation. While both protocols are very simple and lightweight, combined they lead to significant improvements in the reliability and lifetime of data collection. We provide an analytical discussion of our solution together with detailed discrete event simulations. I.
(Show Context)

Trailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks

by Xinxin Liu, Han Zhao, Xin Yang, Xiaolin Li, Ning Wang - In: Proc. of MASS, 2010. 16 Xinxin Liu, Li Yu, Di Wang, and Xiaolin Li
"... using mobile sinks typically incurs constant propagation of sink location indication messages to guide the direction of data re-porting. Such behavior is undesirable, especially when the sensor network scale increases, as frequent message flooding will cause serious congestion in network communicati ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
using mobile sinks typically incurs constant propagation of sink location indication messages to guide the direction of data re-porting. Such behavior is undesirable, especially when the sensor network scale increases, as frequent message flooding will cause serious congestion in network communication and significantly impair the sensor network lifetime. In this paper, we propose a proactive data reporting protocol, SinkTrail, which achieves energy efficient data forwarding to multiple mobile sinks, and effectively reduces the number of sink location broadcasting mes-sages. SinkTrail is unique in two aspects: (1) it allows sufficient flexibility in the movement of mobile sinks to dynamically adapt to unknown terrestrial changes; and (2) without assistance of GPS or predefined landmarks, SinkTrail establishes a logical coordinate system for predicting and tracking mobile sinks’ locations, thereby significantly saves energy consumed during the data reporting process. We systematically analyze the impact of several design factors in SinkTrail and explore potential design improvements. The simulation results demonstrate that SinkTrail outperforms the Frequent Flooding Method (FFM) in finding shorter routing path and consumes 33:8 % less energy at best. I.
(Show Context)

doi:10.1093/comjnl/bxp110 Heuristic Approaches for Transmission Scheduling in Sensor Networks with

by Multiple Mobile Sinks, Damla Turgut, Ladislau Bölöni , 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
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.
(Show Context)

Sensor placement for lifetime maximization in monitoring oil pipelines

by Yifeng Guo , Fanxin Kong , Dakai Zhu , Alişaman Tosun , Qingxu Deng - In Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems , 2010
"... ABSTRACT Wireless sensor networks (WSNs) have been widely deployed and it is crucial to properly control the energy consumption of the sensor nodes to achieve the maximum WSNs' operation time (i.e., lifetime) as they are normally battery powered. In this paper, for sensor nodes that are utiliz ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
ABSTRACT Wireless sensor networks (WSNs) have been widely deployed and it is crucial to properly control the energy consumption of the sensor nodes to achieve the maximum WSNs' operation time (i.e., lifetime) as they are normally battery powered. In this paper, for sensor nodes that are utilized to monitor oil pipelines, we study the linear sensor placement problem with the goal of maximizing their lifetime. For a simple equal-distance placement scheme, we first illustrate that the result based on the widely used ideal power model can be misleading (i.e., adding more sensor nodes can improve WSN's lifetime) when compared to that of a realistic power model derived from Tmote Sky sensors. Then, we study equal-power placement schemes and formulate the problem as a MILP (mixed integer linear programming) problem. In addition, two efficient placement heuristics are proposed. The evaluation results show that, even with the Tmote power model, the equal-power placement schemes can improve the WSN's lifetime by up to 29% with properly selected number of sensor nodes, the distance between them and the corresponding transmission power levels. Moreover, one heuristic scheme actually obtains almost the same results as that of MILP, which is optimal. The real deployment in one oil field is also discussed.
(Show Context)

A case study for evaluating IEEE 802.15.4 wireless sensor network formation with mobile sinks

by Anna Abbagnale, Emanuele Cipollone, Francesca Cuomo - IEEE ICC, 2009. 28 Journal of Computer Applications (0975 – 8887) Volume 40– No.5 , 2012
"... Abstract—Wireless Sensor Networks are traditionally com-posed of a multiplicity of sensor nodes that sense given phenom-ena and deliver the sensed data to specific sink nodes. In the most of the application scenarios, sensor nodes have been considered motionless. On the contrary, interesting possibi ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract—Wireless Sensor Networks are traditionally com-posed of a multiplicity of sensor nodes that sense given phenom-ena and deliver the sensed data to specific sink nodes. In the most of the application scenarios, sensor nodes have been considered motionless. On the contrary, interesting possibilities arise if some sensors are embedded in devices carried by mobile agents as peo-ple, cars, animals, etc. If sinks move within the considered sensor field, they are able to provide both sparse sensing and collecting of data measured by static sensors placed at fixed locations. The main goal of this work is to evaluate, through simulations, the impact of sinks ’ mobility in a wireless sensor network created by using the topology formation mechanism provided by the IEEE 802.15.4 Standard. To this aim, as a practical case study, we consider a wireless sensor network deployed in a museum used to monitor the presence, the localization and other parameters of artworks exposed in it. In this context, we analyze how sinks’ mobility affects connectivity and energy consumption for network formation and re-configuration. Index Terms—Wireless Sensor Network, IEEE 802.15.4, topol-ogy formation, sinks ’ mobility.
(Show Context)

1 Optimizing Event Coverage in Theme Parks

by Gürkan Solmaz, Damla Turgut
"... 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
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.
(Show Context)

Using Mobile Sinks in Wireless Sensor Networks to Improve Building Emergency Response

by T. T. Truong, K. N. Brown, C. J. Sreenan
"... Abstract-We propose an opportunistic routing scheme for wireless sensor networks operating in volatile environments. In particular, we consider a sensor field for sensing and reporting on buildings during fires, where sensors are progressively being destroyed by the fire. We envisage firefighters eq ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract-We propose an opportunistic routing scheme for wireless sensor networks operating in volatile environments. In particular, we consider a sensor field for sensing and reporting on buildings during fires, where sensors are progressively being destroyed by the fire. We envisage firefighters equipped with small computers which can act as mobile sink nodes, offering transient shorter routes for relaying data, and offering connectivity to disconnected areas of the network. We examine different ways in which these uncontrolled mobile sinks could enhance performance, and develop protocols for advertising the presence of the mobile sinks, gathering data for forwarding, and prioritising disconnected regions. We evaluate the performance in simulation, and on randomly damaged networks, we show that we can increase the data delivery by up to 50%. I.
(Show Context)