15,277 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
Enhancing coverage and reducing power consumption in peer-to-peer networks through airborne relaying
Self-organization of Nodes using Bio-Inspired Techniques for Achieving Small World Properties
In an autonomous wireless sensor network, self-organization of the nodes is
essential to achieve network wide characteristics. We believe that connectivity
in wireless autonomous networks can be increased and overall average path
length can be reduced by using beamforming and bio-inspired algorithms. Recent
works on the use of beamforming in wireless networks mostly assume the
knowledge of the network in aggregation to either heterogeneous or hybrid
deployment. We propose that without the global knowledge or the introduction of
any special feature, the average path length can be reduced with the help of
inspirations from the nature and simple interactions between neighboring nodes.
Our algorithm also reduces the number of disconnected components within the
network. Our results show that reduction in the average path length and the
number of disconnected components can be achieved using very simple local rules
and without the full network knowledge.Comment: Accepted to Joint workshop on complex networks and pervasive group
communication (CCNet/PerGroup), in conjunction with IEEE Globecom 201
- …