2,934 research outputs found
Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks
Cluster based routing technique is most popular routing technique in Wireless
Sensor Networks (WSNs). Due to varying need of WSN applications efficient
energy utilization in routing protocols is still a potential area of research.
In this research work we introduced a new energy efficient cluster based
routing technique. In this technique we tried to overcome the problem of
coverage hole and energy hole. In our technique we controlled these problems by
introducing density controlled uniform distribution of nodes and fixing optimum
number of Cluster Heads (CHs) in each round. Finally we verified our technique
by experimental results of MATLAB simulations.Comment: 26th IEEE Canadian Conference on Electrical and Computer Engineering
(CCECE2013), Regina, Saskatchewan, Canada, 201
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
EDOCR: ENERGY DENSITY ON-DEMAND CLUSTER ROUTING IN WIRELESS SENSOR NETWORKS
Energy management is one of the critical parameters in Wireless Sensor Networks. In this paper we attempt
for a solution to balance the energy usage for maximizing the network lifetime, increase the packet delivery
ratio and throughput. Our proposed algorithm is based on Energy Density of the clusters in Wireless
Sensor Networks. The cluster head is selected using two step method and on-demand routing approach to
calculate the balanced energy shortest path from source to sink. This unique approach maintains the
balanced energy utilization among all nodes by selecting the different cluster heads dynamically. Our
simulation results have compared with one of the plain routing scheme (EBRP) and cluster based routing
(TSCHS), which shows the significant improvements in minimizing the delay and energy utilization and
maximizing the network lifetime and throughput with respect to these works
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
- …