No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
... In multi-hop corona WSNs (Figure 2), energy holes occur at the inner coronas (rings) which are close to the sink. There have been several solutions proposed to alleviate this problem through the use of non-uniform node deployment, dynamic methods (through mobile sink or clustering algorithm), transmission range (control of multilevel ranges), and heterogeneous nodes (nodes with capabilities for relaying data and/or energy provisioning)[28][29][30][31][32][33][34]. Figure 3showssome of the solutions, which can be demonstrated by using multi-hop corona network model, to overcome the energy holes problem. www.thesai.org ...
With the promising technology of Wireless Sensor Networks (WSNs), lots of applications have been developed for monitoring and tracking in military, commercial, and educational environments. Characteristics of WSNs and resource limitation impose negative impacts on the performance and effectiveness of these applications. Imbalanced energy consumption among sensor nodes can significantly reduce the performance and lifetime of the network. In multi-hop corona WSN, the traffic imbalance among sensor nodes will make nodes located near to the sink consume more energy and finish their energy faster than those distant from the sink. This would cause what is called “energy hole”, which prevents the network from performing the intended tasks properly. The objective of the work in this paper is to balance energy consumption to help improving the lifetime of corona-based WSNs. To maximize the lifetime of the network, an innovative energy provisioning technique is proposed for harmonizing the energy consumption among coronas by computing the extra needed energy in every corona. Experimental results of the evaluation revealed that the proposed technique could improve the network lifetime noticeably via fair balancing of energy consumption ratio among coronas.
The use of mobile sensors is of great relevance to monitor hazardous applications where sensors cannot be deployed manually. Traditional algorithms primarily aim at maximizing network coverage rate, which leads to the creation of the "energy hole" in the region near the sink node. In this article, we are addressing the problem of redistributing mobile sensor nodes over an unattended target area. Driven by energy efficiency considerations, a pixel-based transmission scheme is developed to reduce extra overhead caused by frequent sensing and decision making. We derive the optimal node distribution and provide a theoretical explanation of balanced energy depletion for corona-based sensor network. In addition, we demonstrate that it can be extended to deal with uneven energy depletion due to the many-to-one communications in multi-hop wireless sensor networks. Applying the optimal condition, we then propose a novel sensor redistribution algorithm to completely eliminate the energy hole problem in mobile sensor network. Extensive simulation results verify that the proposed solution outperforms others in terms of coverage rate, average moving distance, residual energy, and total energy consumption.
In this paper, the energy hole problem in wireless sensor networks is modeled, and a novel transmission range adjustment method is proposed to solve the problem. The goal of our work is to analyze the problem and to propose a dynamic algorithm that allows the transmission range of the sensor nodes to be varied as a function of their residual energy and distance to the base station, such that each individual node consumes its energy smoothly. This method contributes to the balancing of the energy consumption among sensor nodes, avoiding the energy hole problem and, thus, extending the network lifetime.
From energy conservation perspective in Wireless Sensor Networks (WSNs), clustering of sensor nodes is a challenging task. Clustering technique in routing protocols play a key role to prolong the stability period and lifetime of the network. In this paper, we propose and evaluate a new routing protocol for WSNs. Our protocol; Divide-and-Rule (DR) is based upon static clustering and dynamic Cluster Head (CH) selection technique. This technique selects fixed number of CHs in each round instead of probabilistic selection of CH. Simulation results show that DR protocol outperform its counterpart routing protocols.
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.
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.
The Energy Hole (EH) phenomena has been a great hindrance for wireless sensor networks (WSNs). By employing theoretical analysis, we can obtain the energy consumption in different regions of the network. The first nodal death time (FDT) and all nodal death time (ADT) are calculated and the results show that the FDT and ADT are related to the nodal transmission radius r, which has nothing to do with nodal density. Finally, the occurrence region and size of the energy hole can also be accurately obtained. The simulation results are consistent with theoretical analysis, which can be a good guidance for WSNs.
The demand for maximum network lifetime in many mission-critical applications of wireless sensor networks motivates the great significance to deploy as few sensors as possible to achieve the expected network performance. In this paper, we first characterize the energy consumption of wireless sensor networks with adjustable transmission ranges through theoretical analysis. Based on this result, we propose a deployment strategy with T as the required minimum network lifetime. We come up with three interventions: (A) in order to achieve an evenly balanced energy consumption among all nodes, the node density in different areas of the network should be a continuous varying function of the distance from the sink; (B) if there are insufficient nodes to achieve a balanced energy consumption over the whole network, our proposed node deployment strategy can be used to achieve the required lifetime threshold T with minimum number of nodes; and (C) when there are sufficient nodes to ensure the network connectivity and coverage with the node density of τ, we design an algorithm to identify the optimal transmission radius r and the corresponding achievable maximum network lifetime. Our conclusions are verified by extensive simulation results.
Wireless distributed sensor network consists of randomly deployed sensors
having low energy assets. These networks can be used for monitoring a variety
of environments. Major problems of these networks are energy constraints and
their finite lifetimes. To overcome these problems different routing protocols
and clustering techniques are introduced. We propose DREEM-ME which uses a
unique technique for clustering to overcome these two problems efficiently.
DREEM-ME elects a fix number of cluster heads (CHs) in each round instead of
probabilistic selection of CHs. Packet Drop Technique is also implemented in
our protocol to make it more comprehensive and practical. In DREEM-ME
confidence interval is also shown in each graph which helps in visualising the
maximum deviation from original course. Our simulations and results show that
DREEM-ME is much better than existing protocols of the same nature.
In this paper, we propose Regional Energy Efficient Cluster Heads based on
Maximum Energy (REECH-ME) Routing Protocol for Wireless Sensor Networks (WSNs)
. The main purpose of this protocol is to improve the network lifetime and
particularly the stability period of the network. In REECH-ME, the node with
the maximum energy in a region becomes Cluster Head (CH) of that region for
that particular round and the number of the cluster heads in each round remains
the same. Our technique outperforms LEACH which uses probabilistic approach for
the selection of CHs. We also implement the Uniform Random Distribution Model
to find the packet drop to make this protocol more practical. We also calculate
the confidence interval of all our results which helps us to visualize the
possible deviation of our graphs from the mean value.
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
Topology control in a sensor network balances load on sensor nodes, and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad-hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intra-cluster and inter-cluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.