No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
IDDR: Improved Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks
Abstract
In Wireless Sensor Networks (WSNs) unbalanced energy consumption is a major problem. As a result, energy hole is created and network lifetime is reduced. In this paper, we propose IDDR to avoid the energy hole creation through uniform energy consumption. Proposed scheme reduces coverage and energy hole by dividing the network into small segments with static number of Cluster Heads (CHs) in each round. Selection of CH in each segment is based on maximum residual energy. Simulation results prove that proposed protocol outperforms the compared protocols. c ⃝ 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of Elhadi M. Shakshuki.
... This affects transmission power consumption between nodes as a metric. F. Saleem et al in [16] propose a scheme which reduces coverage and energy consumption by dividing the network into small segments with static number of Cluster Heads. ...
... Throughput: Figures 14,15,16 and 17 illustrate that the Number of packets sent to base station is greater in our proposition than the LEACH 3D. This difference is been wide if we pass to the number of levels increases. ...
In this paper, we present a multilevel network model using two criteria. The first one makes it possible to determine the number of levels according to the dimension of the space and the second one makes it possible to determine the rate of the nodes in each level. Using this wonderful model, we evaluate the performance of LEACH as a cluster communication protocol. In this case, the name of the protocol is LEACH 3D-nLevel. We also compare the energy efficiency of a three dimensional network in different large spaces. We organize the deployment of the networks in these spaces so that the energy consumed is minimal. With these new operations, the LEACH 3D-TwoLevel, the LEACH 3D-ThreeLevel, the LEACH 3D-FourLevel and the LEACH 3D-FiveLevel offer a network lifetime increase of 11%, 52%, 75% and 378%. They also offer a network throughput increase of 56%, 62%, 253% and 360%.
... This affects transmission power consumption between nodes as a metric. F. Saleem et al in [16] propose a scheme which reduces coverage and energy consumption by dividing the network into small segments with static number of Cluster Heads. ...
... Throughput: Figures 14,15,16 and 17 illustrate that the Number of packets sent to base station is greater in our proposition than the LEACH 3D. This difference is been wide if we pass to the number of levels increases. ...
The challenge of modern researches is how to organize the energy consumption in wireless sensor networks, which been more used in the communications. LEACH is one of the protocols that make such an organization of energy consumption. The estimation of this consumption is further from reality. This due to the deployment of nodes in a distorted space; where the nodes are not at the same height. In a two-dimensional WSN, the energy will be consumed more in large spaces. Therefore, this consumption will be more seriously increased in large three-dimensional spaces. In this paper, we compare the energy efficiency of a three-dimensional network in different extended spaces, then we organize the nodes deployment in these spaces so that the energy consumed is the minimum, in order to increase the WSN lifetime over than 18% and LEACH performance, two times more.
... Iddr: improved density controlled divide-and-rule scheme for energy efficient routing in wireless sensor networks is more energy efficient compared to LEACH protocol. It is proposed by F. Saleem et al. [11]. Here, the BS contains the information about each better than concentric ring region in respect of the energy-saving and network lifetime formation. ...
Nowadays, the energy consumption has become one of the major constraints for the sensor nodes having a finite energy source in the design of Wireless sensor networks (WSNs). In this paper, a new routing concept using divide-and-rule sectorization (DRS) scheme has been proposed to curtail the energy efficiency issues in WSNs. In this scheme, each forwarder node is dynamically selected for WSNs which balances the energy consumption among the sensor nodes significantly. The network area is divided into subareas to reduce the unbalance loading condition, and each subarea known as the segment, efficiently decrease the energy hole creation problem of the network. Moreover, the analytical analysis of the energy consumption for the proposed scheme has also been presented. The simulation results confirm that the proposed DRS scheme has better enduring stability, prolonging network lifetime, and minimized energy consumption as compared to available state-of-the-arts.
... The density control technique is used in network area so that the network lifetime can be improve at significant level. In this technique, authors prove that distance is proportional to density from BS [14]. ...
... To optimize resources, a sensible decision is to deploy an equal percentage of nodes over different regions to ensure minimization of coverage holes, and elongation of network lifetime. Therefore, in this scenario, we propose to deploy 20% of the nodes in region R 1 and the rest 80% of the nodes to be distributed evenly over R 2,3,..., 8,9 regions as shown in Fig. 3(a). This nodes' deployment always depend upon the network field area and number of nodes. ...
... Another issue that is handled in this paper is the energyhole problem that decreases the efficiency of the WSNs many protocols had been proposed by researchers to solve this problem. In [7], the energy-hole creation is avoided by proposing a new scheme called improved density controlled divide-and-rule scheme (IDDR), which divides the network area into segments. Each segment elects a new cluster head in each round based on maximum residual energy. ...
Wireless Sensor Networks (WSNs) have been popular nowadays as they provide low-cost solutions of a wide-range of real life challenges. WSN consists of a group of infrastructure-less wireless nodes that works together to deliver physical or environmental monitored data from source to sink. In general, WSNs are vulnerable to wireless attacks due to the open nature of the wireless networks. Also, WSNs suffer from unbalanced energy consumption which reduces the network life time due to the creation of the energy-hole. Two types of threats may occur for the WSNs privacy, which are; contextual and content privacy; location privacy is considered as an example for contextual privacy, where an eavesdropper tries to find the location of the source or sink. Hence, ensuring the security and privacy in WSNs is considered as an essential issue. In this paper, we avoid energy-hole creation and protect source location privacy (SLP) via proposing two source privacy protection schemes based on clustering, which are dynamic shortest path scheme (DSP) and Dynamic tree scheme (DT). We adopted grid-based clustering technique to divide the network to several square clusters. Matlab simulation evaluates the performance of the two proposed schemes in terms of safety period.
... An Improved version from DDR known as (IDDR) was proposed by Saleem et al (2014). They utilized the concept of uniform consumption of the energy. ...
As a part from the great revolution that was occurred recently, a continuous improvement was and still achieved in communication and network field. Wireless Sensor Networks was emerged as a result for this development, extensive researches were introduced in order to improve it is performance since it is now employed within several tactical applications, including; detection and monitoring applications. Routing process is considered one of the hottest research areas throughout the last years, several routing protocols were proposed in order to improve the performance of the network. In this paper, a new Energy Efficient Optimized Routing Algorithm (EEORA) is proposed and implemented by hybridization for the features of flat and Hierarchal routing techniques. EEORA routing process is performed into two stages, clustering and data communication phases. MATLAB program was employed in simulating the model of the proposed routing protocol for both Wireless Sensor Networks (WSNs) and Dense Wireless Sensor Networks (DWSNs). The results showed that more scalability is obtained by EEORA over other considered routing protocols. The results also showed that improved performance in terms of, energy consumption, end-to-end delay, network life time and throughput is also achieved by EEORA. the nodes energy is limited, the maximum WSN lifetime is a significant goal to the routing protocol destination. Therefore, it is essential to consider the energy balance consumption in addition to the consumption of energy along the path needed to transmit small messages toward the required destination. Moreover, since there is a large number of senor nodes in these networks, especially in " Dense WSNs (DWSNs) " , only partial information regarding to the topology information can be obtained by the nodes, so it is essential for the routing protocol to select the optimal path based on these available partial information (Guo and Tang, 2010).
In this paper, we propose a novel framework for performance optimization in Internet of Things (IoT)-based next-generation wireless sensor networks. In particular, a computationally-convenient system is presented to combat two major research problems in sensor networks. First is the conventionally-tackled resource optimization problem which triggers the drainage of battery at a faster rate within a network. Such drainage promotes inefficient resource usage thereby causing sudden death of the network. The second main bottleneck for such networks is the data degradation. This is because the nodes in such networks communicate via a wireless channel, where the inevitable presence of noise corrupts the data making it unsuitable for practical applications. Therefore, we present a layer-adaptive method via 3-tier communication mechanism to ensure the efficient use of resources. This is supported with a mathematical coverage model that deals with the formation of coverage holes. We also present a transform-domain based robust algorithm to effectively remove the unwanted components from the data. Our proposed framework offers a handy algorithm that enjoys desirable complexity for real-time applications as shown by the extensive simulation results.
KeywordsCoverage holesDenoisingEnergy efficiencyEnergy holesSparse representationsWireless sensor networks
In a Wireless Sensor Networks (WSNs), energy consumption is a key challenge due to its dynamic topology, highly decentralized infrastructure and resource constraint sensors. These entities make WSNs easily compromised by various denials of service attacks resulting in disastrous consequences. In the development of various cluster based energy efficient protocols to improve the lifetime of WSNs compromised with some malicious nodes, a challenging problem is how to adopt the most effective energy efficient cluster head selection approach to extend lifetime of WSNs. Gray-Hole and Black-Hole attack are those denial of service attacks that reduces the performance of WSNs. In order to achieve energy efficiency in WSNs, an efficient and trust based secure protocol is proposed to defend against single and cooperative Gray-Hole and Black Hole attacks. A proposed protocol incorporates efficient estimation to determine honest nodes during packets transmission phase. A proposed energy efficient technique is builds to evaluate in detecting and preventing compromised node to become cluster head. Besides, NS2 simulation result compare proposed protocol with LEACH proves that proposed system is efficiently reduces possibility of compromised node to be a part of network communication process and achieves better packet delivery ratio, throughput, less end-to-end delay and extend the lifetime of network significantly.
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.
Unbalanced energy consumption is an inherent problem in gradient sinking sensor networks. This uneven energy dissipation can lead to the existence of energy holes, and significantly reduce network lifetime. In this paper, our study is based on corona-based network division. We investigate the unbalanced energy consumption among nodes both within the same coronas and within different coronas. We take advantage of mixed-routing strategy to achieve balanced energy consumption among nodes both within the same coronas and within different coronas. Besides, once the mixed-routing strategy can not balance energy consumption in local areas, the strategy of nonuniform energy distribution is used in these areas. Finally, we give algorithms to compute the optimal data distribution ratio and the initial energy of nodes. Simulation results show that our strategy can reduce the energy consumption, avoid energy holes and prolong the network lifetime dramatically.
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.
Energy-efficient communication protocol for wireless microsensor networks
- W R Heinzelman
- Chandrakasan
- H Balakrishnan
Heinzelman, W.R, Chandrakasan, A and Balakrishnan,H. "Energy-efficient communication protocol for wireless microsensor networks." System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on. IEEE, 2000.
Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks
- K Latif
- A Ahmad
- N Javaid
- Z Khan
- N Alrajeh
Latif, K, Ahmad, A, Javaid, N, Khan,Z.A and Alrajeh, N. "Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks." Procedia Computer Science 19 (2013): 340-347.