10,746 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
Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control
This paper presents two dynamic and distributed clustering algorithms for Wireless Sensor Networks (WSNs). Clustering approaches are used in WSNs to improve the network lifetime and scalability by balancing the workload among the clusters. Each cluster is managed by a cluster head (CH) node. The first algorithm requires the CH nodes to be mobile: by dynamically varying the CH node positions, the algorithm is proved to converge to a specific partition of the mission area, the generalised Voronoi tessellation, in which the loads of the CH nodes are balanced. Conversely, if the CH nodes are fixed, a weighted Voronoi clustering approach is proposed with the same load-balancing objective: a reinforcement learning approach is used to dynamically vary the mission space partition by controlling the weights of the Voronoi regions. Numerical simulations are provided to validate the approaches
Analyzing Energy-efficiency and Route-selection of Multi-level Hierarchal Routing Protocols in WSNs
The advent and development in the field of Wireless Sensor Networks (WSNs) in
recent years has seen the growth of extremely small and low-cost sensors that
possess sensing, signal processing and wireless communication capabilities.
These sensors can be expended at a much lower cost and are capable of detecting
conditions such as temperature, sound, security or any other system. A good
protocol design should be able to scale well both in energy heterogeneous and
homogeneous environment, meet the demands of different application scenarios
and guarantee reliability. On this basis, we have compared six different
protocols of different scenarios which are presenting their own schemes of
energy minimizing, clustering and route selection in order to have more
effective communication. This research is motivated to have an insight that
which of the under consideration protocols suit well in which application and
can be a guide-line for the design of a more robust and efficient protocol.
MATLAB simulations are performed to analyze and compare the performance of
LEACH, multi-level hierarchal LEACH and multihop LEACH.Comment: NGWMN with 7th IEEE Inter- national Conference on Broadband and
Wireless Computing, Communication and Applications (BWCCA 2012), Victoria,
Canada, 201
A Trust Based Congestion Aware Hybrid Ant Colony Optimization Algorithm for Energy Efficient Routing in Wireless Sensor Networks (TC-ACO)
Congestion is a problem of paramount importance in resource constrained
Wireless Sensor Networks, especially for large networks, where the traffic
loads exceed the available capacity of the resources. Sensor nodes are prone to
failure and the misbehavior of these faulty nodes creates further congestion.
The resulting effect is a degradation in network performance, additional
computation and increased energy consumption, which in turn decreases network
lifetime. Hence, the data packet routing algorithm should consider congestion
as one of the parameters, in addition to the role of the faulty nodes and not
merely energy efficient protocols. Unfortunately most of the researchers have
tried to make the routing schemes energy efficient without considering
congestion factor and the effect of the faulty nodes. In this paper we have
proposed a congestion aware, energy efficient, routing approach that utilizes
Ant Colony Optimization algorithm, in which faulty nodes are isolated by means
of the concept of trust. The merits of the proposed scheme are verified through
simulations where they are compared with other protocols.Comment: 6 pages, 5 figures and 2 tables (Conference Paper
- …