Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Improving localization in wireless sensor networks with an evolutionary algorithm

Wireless sensor networks are highly useful for many location-sensitive applications including environmental monitoring, military applications, disaster management, etc. Localization in wireless sensor networks concerns about the precise estimation of node positions given a relatively small portion as anchor nodes with their absolute positions predetermined. Intrinsically, localization is an unconstrained optimization problem based on various distance/path measures. Most of the existing work focus on increasing the accuracy in position estimation typically by using different heuristic-based or mathematical techniques. On the other hand, there were many complex optimization problems successfully tackled by the nature inspired search algorithms including the ant-based or genetic algorithms. In this paper, we propose to adapt an evolutionary approach, namely a microgenetic algorithm, and integrate as a post-optimizer into some existing localization techniques such as the Ad-hoc Positioning System (APS) to further improve their position estimation. Clearly, our proposed MGA is so adaptable that it can easily be integrated into other localization methods. More importantly, the remarkable improvements obtained by the prototype of our proposed evolutionary optimizer on certain anisotropic topologies of our simulation tests prompt for further investigation. © 2006 IEEE.published_or_final_versio

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

An evaluation of two distributed deployment algorithms for Mobile Wireless Sensor Networks

Deployment is important in large wireless sensor networks (WSN), specially because nodes may fall due to failure or battery issues. Mobile WSN cope with deployment and reconfiguration at the same time: nodes may move autonomously: i) to achieve a good area coverage; and ii) to distribute as homogeneously as possible. Optimal distribution is computationally expensive and implies high tra c load, so local, distributed approaches may be preferable. This paper presents an experimental evaluation of role-based and behavior based ones. Results show that the later are better, specially for a large number of nodes in areas with obstacles.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network