9,536 research outputs found
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
Energy Efficient Node Deployment in Wireless Ad-hoc Sensor Networks
We study a wireless ad-hoc sensor network (WASN) where sensors gather
data from the surrounding environment and transmit their sensed information to
fusion centers (FCs) via multi-hop wireless communications. This node
deployment problem is formulated as an optimization problem to make a trade-off
between the sensing uncertainty and energy consumption of the network. Our
primary goal is to find an optimal deployment of sensors and FCs to minimize a
Lagrange combination of the sensing uncertainty and energy consumption. To
support arbitrary routing protocols in WASNs, the routing-dependent necessary
conditions for the optimal deployment are explored. Based on these necessary
conditions, we propose a routing-aware Lloyd algorithm to optimize node
deployment. Simulation results show that, on average, the proposed algorithm
outperforms the existing deployment algorithms.Comment: 7 pages, 6 figure
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
Simplicial Homology for Future Cellular Networks
Simplicial homology is a tool that provides a mathematical way to compute the
connectivity and the coverage of a cellular network without any node location
information. In this article, we use simplicial homology in order to not only
compute the topology of a cellular network, but also to discover the clusters
of nodes still with no location information. We propose three algorithms for
the management of future cellular networks. The first one is a frequency
auto-planning algorithm for the self-configuration of future cellular networks.
It aims at minimizing the number of planned frequencies while maximizing the
usage of each one. Then, our energy conservation algorithm falls into the
self-optimization feature of future cellular networks. It optimizes the energy
consumption of the cellular network during off-peak hours while taking into
account both coverage and user traffic. Finally, we present and discuss the
performance of a disaster recovery algorithm using determinantal point
processes to patch coverage holes
- …