No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
On Performance Evaluation of Variants of DEEC in WSNs
Abstract
Wireless Sensor Networks (WSNs) contain numerous sensor nodes having limited
power resource, which report sensed data to the Base Station (BS) that requires
high energy usage. Many routing protocols have been proposed in this regard
achieving energy efficiency in heterogeneous scenarios. However, every protocol
is not suitable for heterogeneous WSNs. Efficiency of protocol degrades while
changing the heterogeneity parameters. In this paper, we first test Distributed
Energy- Efficient Clustering (DEEC), Developed DEEC (DDEEC), Enhanced DEEC
(EDEEC) and Threshold DEEC (TDEEC) under several different scenarios containing
high level heterogeneity to low level heterogeneity. We observe thoroughly
regarding the performance based on stability period, network life time and
throughput. EDEEC and TDEEC perform better in all heterogeneous scenarios
containing variable heterogeneity in terms of life time, however TDEEC is best
of all for the stability period of the network. However, the performance of
DEEC and DDEEC is highly effected by changing the heterogeneity parameters of
the network.
... If 'm' is the fraction of advanced sensors, then N(1-m) will be the amount of normal sensors and Nm is the total amount of advanced nodes. hence the overall preliminary energy of the network is the summation of energies of normal as well as advanced nodes 10 and is written as: ...
... The normal and advanced nodes follow the same principle as that of the two-level network. The super-nodes of fraction 'm 0 ' have 'b' times more energy than normal nodes 10 . hence the energy of super-nodes can be written as E 0 (1+b). ...
... If the number of sensors in the network is N, then Nmm 0 is the number of super-nodes. Similarly, Nm(1-m 0 ) will be the number of advanced nodes 10 . hence the overall preliminary energy of the network is the summation of energies of all type of node, i.e. normal, advanced nodes and super-node which is given as: The value of p i is given as: Figure 1 shows the number of nodes alive with each round. ...
Extending the Internet to connect any physical device with smart technology can be called as the Internet of Things (IoT).It is a proposed development of the Internet in which everything can be connected to the internet enabling them to send and receive data. Selection of energy efficient routing protocols has become an essential step in designing any IoT network. Moreover, the protocol should also be selected to enhance the lifetime of the network. In this article, we evaluate the performance analysis of DEEC (Distributed Energy Efficient Clustering), DDEEC (Developed DEEC), EDEEC (Enhanced DEEC) and TDEEC (Threshold DEEC) for the application in IoT. From MATLAB simulation, it was observed that TDEEC outperforms other routing protocols and is well suited for IoT application.
... Thus they perform better than homogeneous WSNs in a real application scenario with variety of sensors such as warehouses, home monitoring and surveillance. Distributed Energy Efficient Clustering (DEEC) [7], Developed DEEC (DDEEC) and Enhanced DEEC (EDEEC) [8] are some of the heterogenous WSN protocols. These distributed clustering algorithms for heterogeneous WSNs have similar topological structure to an IoT system. ...
... (1) The system is distributed in two-levels based on their initial energy as normal nodes with standard battery energy and advanced nodes with a times more energy than normal nodes [8]. We use the RFID tagging and reading mechanism to reduce the energy consumption during the cluster head (CH) selection phase till all the advanced nodes (also called gateway nodes) have their energy exhausted. ...
... Thus we can find the lifetime of network R by putting (1), (8) and (9) in (6). End ...
... In past couple of years increasing interest have been observed in field if Wireless Sensor Networks (WSNs). WSNs consists of several minute power limited sensor units randomly distributed over area of interest [1], [2]. WSNs have numerous military based as well as industrial applications including environmental, temperature, vibration, transport traffic, automated machines, smart offices monitoring and battle field surveillance. ...
... A simple first order model is assumed in which energy is required for reciever and transmitter circuit to make it alive and for amplification of bits at transmitter side to achieve a certain necessary for transmission. bit data packet is sent through distance therefore energy consumed is as below [2], [6], [13]: ...
... VII. PERFORMANCE CRITERIA Performance evaluation of selected protocols under different heterogeneity scenarios are done on basis of following metrices as below [2], [6]. defined as decaying of first node since deployment. ...
In last decade researchers have a growing attention in domain of Wireless Sensor Networks (WSNs) due to numerous increasing automated industry and battle field applications. WSNs comprises of hundreds or even thousands of unsystematically deployed energy lacking sensor units. These sensors are aimed to transfer data from the field to distant Base Station (BS). This operation necessitate excessive energy. Minimizing energy expenditure and spreading WSN lifetime are prodigious tasks. Development of energy saving routing mechanism is one of the main issues in WSNs. In practical scenario almost all the WSNs are heterogenous or become heterogenous after small life span. Practically efficiency of every protocol changes with diverse heterogeneity environment. There is a dire need for testing of routing protocols underling varying heterogeneous parameters to cope with the practical scenario problems. In this paper performance of DEEC (Distributed Energy-Efficient Clustering), DDEEC (Developed DEEC), TDEEC (Threshold DEEC) and BEENISH (Balanced Energy Efficient Network Integrated Super Heterogenous) are evaluated with respect to varying heterogeneity metrics. Testing shows the variable behaviour of protocols with changing environment. However BEENISH performs the best in all cases and performance is sustained in varying heterogeneous scenarios.
... Wireless Sensor Networks (WSNs) [1, 2, 3] have become popular in variety of applications such as military surveillance, environmental, transportation traffic, temperature, pressure and vibration monitoring. To achieve fault tolerance, WSNs consist of hundreds or even thousands of sensor randomly distributed with in the region [4, 5, 6]. ...
... Nodes in WSNs are power constrained due to limited battery resource, and they might be placed where they can not be accessed, so,impossible to recharge or replace. To save energy, regular and long distance communication should be avoided to prolong network lifetime [1]. Sensor nodes take self decisions to accomplish sensing tasks, constructing network topology and routing policy. ...
... Efficiently Grouping sensor nodes in form of clusters is beneficial in minimizing the energy utilization. Numerous energy efficient protocols are made based on clustering structure[1, 7, 8]. In clustering, nodes assemble themselves in form of clusters with one node acting as the Cluster Head (CH). ...
In past years there has been increasing interest in field of Wireless
Sensor Networks (WSNs). One of the major issue of WSNs is development of
energy efficient routing protocols. Clustering is an effective way to
increase energy efficiency. Mostly, heterogenous protocols consider two
or three energy level of nodes. In reality, heterogonous WSNs contain
large range of energy levels. By analyzing communication energy
consumption of the clusters and large range of energy levels in
heterogenous WSN, we propose BEENISH (Balanced Energy Efficient Network
Integrated Super Heterogenous) Protocol. It assumes WSN containing four
energy levels of nodes. Here, Cluster Heads (CHs) are elected on the
bases of residual energy level of nodes. Simulation results show that it
performs better than existing clustering protocols in heterogeneous
WSNs. Our protocol achieve longer stability, lifetime and more effective
messages than Distributed Energy Efficient Clustering (DEEC), Developed
DEEC (DDEEC) and Enhanced DEEC (EDEEC).
... Alsafi et al. [18] and Qureshi et al. [19] presented a comparative performance analysis of distributed energy efficient clustering (DEEC), Developed DEEC (DDEEC), extended DEEC (EDEEC), and threshold-based DEEC (TDEEC) protocols. All these protocols follow a similar pattern in transferring data. ...
... During data transmission, the sensor node consumes energy [19]- [21], as shown in Fig. 6. The energy required by a sensor node to send an L-bit message over distance d is: ...
This paper proposes a zone-based three-level heterogeneous clustering protocol (ZB-TLHCP) for heterogeneous WSNs. In ZB-TLHCP, the sensor field/region is divided into zones where super, advance, and normal nodes are deployed uniformly and randomly. The performance of the proposed ZB-TLHCP system is compared with that of zonal-stable election protocol (Z-SEP), distributed energy efficient clustering (DEEC), and threshold-based DEEC (TDEEC) protocol by varying the number of super and advance nodes, their energy levels for the fixed sensor field, and the total number of nodes. Matlab simulation results revealed that the proposed ZB-TLHCP solution performed better than Z-SEP, DEEC, and TDEEC protocols, as it increased the instability period, prolonged the network's lifetime, and achieved higher throughput values.
... When number is lower than threshold Ts then the node decides to be an aggregator node for that particular round. Threshold value in TDEEC is adjusted and on the basis of that value, node makes the decision to be an aggregator node by taking residual energy and average energy of the round with respect to optimal number of aggregator nodes [12]. ...
... While simulating these results we have ignored any energy losses caused by collision of packets and interference caused by channel conditions between different nodes. [12], these simulation results take into consideration the varying probability i.e. 0.5, 0.05, 0.1 for the results shown in Fig [1 The following results are compiled by varying the probability with four specific values i.e. 0.5, 0.1, 0.05 and 0.01 from simulation for 100 and 50 wireless sensor nodes respectively and tabulated as shown in Table. #2 ...
Maximization of life of Wireless Sensor Network (WSN) is a challenging task. As WSNs are energy-constraint networks, it is very important for them to use their energy in an efficient manner so that their network life is prolonged. This aspect has attracted many researchers to work on different parameters for determining the method for increasing the efficient energy utilization in WSN. One approach is to choose an optimal number of cluster heads or aggregator nodes for data aggregation. For every protocol in a multi-hop environment an average energy per round is calculated and optimal probability of node becoming the aggregator node is determined and hence a selection of an optimal number of aggregator nodes. This leads to the minimization of the average energy per round for the network in question. In this paper, we carry out the comparative analysis of variants of Distributed Energy Efficient Clustering (DEEC) protocol by following probabilistic approach for calculating the number of cluster heads to analyze the network life time and number of packets transmitted to the base station. The results from comparative analysis provide the basis for further investigating the use of probability factor to extend network life time. We propose a method to dynamically calculate the probability for selecting the optimal number of aggregator nodes to maximize the network lifetime as well as to maximize the number of packets sent to the base station.
... Here the nodes available in advanced region & super region select CHs respectively based on ratio of their residual energy and average energy of the round which was proposed by T.N Qureshi et al. [14], through parameter named adjustable threshold value proposed in Mohsin RazaJafri et al. [15]. The adjustable threshold value is set based on the ratio with respect to optimum number of CHs. ...
In today’s world due to extensive use of internet and its supporting devices has led humans to use cutting edge technologies in their lives. To adopt this technology, we need wireless sensor networks which facilitate the IOT devices for intercommunication. Critical application includes military area monitoring where sensor nodes need to intercommunicate without human intervention. All sensor devices require wireless sensor network to operate which is reliable, energy efficient, robust and provides sufficient security which is one of the key challenges. Existing protocols solution includes variants of clustering based hierarchical-topologies but they are still known to have sub-standard reliability, stability, throughput and network lifetime. To overcome these constraints, it is proposed a hybrid routing network protocol named Region-Threshold Distributed Energy Efficient Clustering. The proposed protocol efficiently utilizes multi-tier function permitting some of the nodes to transmit data packets directly to the sink node whilst others use clustering techniques in the network to send data packets towards the sink node. While sending data packets, the routing between the nodes is established using the PD-BSDRL method. The proposed protocol is also compared with existing protocols such as Enhanced Distributed Energy Efficient Clustering (EDEEC) and Threshold Distributed Energy Efficient Clustering (TDEEC). The simulation results show that the proposed R-TDEEC outperforms in terms of reliability, energy efficiency, network complexity and network lifetime.
... Qureshi et al. [10] have compared the four protocols named distributed energy-efficient clustering "DEEC," Developed DEEC "DDEEC," Enhanced DEEC "EDEEC" and Threshold DEEC "TDEEC" with heterogeneous conditions having high to low level of heterogeneity. TDEEC and EDEEC performed better in all conditions, but stability period and life time were best in TDEEC. ...
In wireless sensor networks (WSNs), the protocols for routing have a great effect in performance of network as network’s lifetime, good energy organization, etc. These protocols are developed based on the different schemes like clustering, chaining and cost based. The WSN contains a large number of nodes which are sometimes difficult to manage. So, the best way is to make a cluster by combining various nodes, and this technique is known as clustering. By doing so, the energy exhaustion by nodes can be restricted. A node is nominated as cluster head (CH) to handle the communication amongst nodes and managing of nodes in the cluster. An ACO-based probability rule is used for choosing the CH amid the cluster nodes. The data are sent from cluster nodes to the CH; then, it further sends the relevant details to the base station (BS). ACO-DEEC: ant colony optimization-based distributed energy efficient clustering protocol is used for probability rule calculation for CH selection depending on the metrics, i.e. efficiency of the nodes and distance amongst nodes. The algorithm proposed enhances the parameters like energy consumption by cluster nodes, finding dead nodes in cluster and quantity of packets sent to the BS as compared with existing DEEC protocol.
... The detail of protocol is presented in this section. I-BEENISH implements the same concept and logic in [8] [9] BEENISH as it is the improvement and modified of BEENISH protocol. The selection of CH is totally based on remaining energy level of the nodes in the network with average energy of the network. ...
In this research work we simulate all four protocols in MATLAB software DEEC, Developed-DEEC, Enhanced-DEEC, and I-BEENISH Protocol. we implement improved advanced fuzzy logic concept in I-BEENISH Protocol we compare the living nodes during rounds, nodes died during rounds, packets send to the base station and the size of CH of in all four protocols we compare the result simulations in result shows that I-BEENISH is more efficient compared to DEEC, Developed-DEEC and Enhanced-DEEC in conditions of network life-time and stability.
... Another improvement of LEACH proposed by Power-efficient gathering in sensor information systems (PEGASIS) protocol [13]. The protocol uses Chain based concept and nodes are organized in chain. ...
p class="0abstractCxSpFirst"> Wireless communication network has a significant success in scientific and industrial communities. Due to its various advantages, this technology is considered as a key element in current network architectures. It represents the architecture that allows to group a large number of sensors to collect information about a physical process in different environments. The gathered data is transmitted to base station which communicates the information to the end user.
Several protocols are proposed for WSNs routing, by considering the limited capacities of sensor nodes according to a specific topology that allows to organize the nodes within the network. However, the performance of each routing protocol mainly depends on the application requirements and its results in terms of the lifetime of WSN and satisfaction of objectives defined.
According of the structure of WSN, the routing techniques can be divided in three types hierarchical, location-based flat routing. This paper, present the different routing techniques in WSN, based on the organization of nodes in sensor area. We focus specially to study the three types, cluster-based, chain-based and location-based routing techniques. These techniques will be simulated in order to compared their performances with our protocol Location-Based LEACH (LOC-LEACH). </p
... In Priyadarshi et al. (2020), A review on clustering protocols with energy heterogeneity in wireless sensor networks is presented. Well known probabilistic clustering protocols for homogeneous network being LEACH, Hybrid Energy Efficient Distributed Clustering (HEED) (Younis & Fahmy, 2004) etc. and well known protocols for heterogeneous network are Distributed Energy Efficient Clustering (DEEC) (Qureshi, Javaid, Malik, Qasim, & Khan, 2012), Enhanced DEEC(EDEEC) (Javaid et al., 2013), Energy efficient heterogeneous clustered scheme for wireless sensor networks(EEHC) (Kumar, Aseri, & Patel, 2009). In these protocols, CHs are selected based on a probability value defined by a threshold. ...
Wireless Sensor Networks is one of the most significant area of research where large number of sensor nodes that are distributed in a geographical area operate on limited battery power. As these networks, depending on the application, are sometimes deployed in in-hostile environment, which makes energy conservation one of the major challenge faced in WSN. To reduce energy consumption, clustering is considered to be the most efficient technique. This work proposes a new clustering approach that decreases energy consumption and results in prolonged network lifetime which is an important requirement for networks operating in inaccessible areas. In the proposed approach, heterogeneity is also implemented to increase the stability and energy efficiency of random networks. We have evaluated the efficiency of the proposed protocol through simulations and comparison is performed with well-known existing distributed protocols. Proposed approach shows efficient results in terms of the stability period for different network configurations and Base Station positions. Also, the results are found better in terms of number of alive nodes and network lifetime.
... Power levels of sensor nodes compared to bound threshold and most power levels are thought-about for choosing the cluster head. Some algorithms use distance from base station and its neighbourhood sensors as input for cluster head alternative by Qureshi et al. (2012). Altogether these algorithms first cluster heads ar selected. ...
Nature consists of enormous and various physical and phenomenon, like lightweight, temperature, motion, seismol waves, and plenty of others. For observation and cashing in on the environment it’s necessary to collect the knowledge concerning the phenomenon. Wireless device networks facilitate U.S. in sensing the environment and in obtaining info concerning the natural discernible occurrences. It needs communication protocols to diminish the power consumption. In wireless sensor networks, power is the key one among the foremost necessary resources since every node gathers processes and passes on knowledge to its base station. In general, most of the works in sensor networks are done using static nodes and single base station. Recent researches use mobile knowledge gathering strategies and are planned to prolong the operation time of device networks. One or additional mobile collectors are wont to gather detected knowledge from device nodes at short transmission ranges. This paper presents a novel algorithm for cluster head selection and provides best visiting points and knowledge gathering path for a mobile sink among clusters. With shaping associate best cluster and knowledge gathering path, this methodology improves the information assortment performance yet because the network life extension of device in small scale networks. The performance has been evaluated using LTE and WiFi networks. Also, quality measures for each network have been computed and presented.
... Therefore, a key subject for WSNs is to curtail energy expenditures of sensor nodes to prolong lifetime of network. Several protocols based on clustering topology [14], [15], [16], [17] [18], [19], [20], [21] are available and used in many applications. In these protocols, cluster heads collects data and then transfer to BS. ...
In current era of technology, applications of wireless sensor networks (WSNs) are rising
in various fields. The deployment of WSNs for real life applications is greater than
before. Still, the energy constraints remain one of the key issues; it prevents the complete
utilization of WSN technology. Sensors typically powered with battery, which have
insufficient life span. Even though renewable energy sources like solar energy or piezoelectric means are used as supplementary energy in WSNs, it is still some degree of
reserve to consume energy judiciously. Proficient energy routing is thus a key
requirement for a trustworthy design of a wireless sensor network. In this article, we
advise a new Gateway Based Energy-Efficient Clustering Routing Protocol (M-GEAR)
for WSNs. We divide the sensor nodes into four logical regions based on their distance
from the gateway node and Base Station (BS). We install BS faraway from sensing area
and a gateway node at the centre of the sensing area. If the distance of a sensor node from BS or gateway is less than predefined distance threshold, the node uses direct
communication to transmit its sensed data. We divide the rest of nodes into two equal
regions whose distance is beyond the threshold distance. We then divide these two
regions into clusters and each region elects its own Cluster Heads (CHs) independent of
other region. We compare performance of our protocol with LEACH (Low Energy
Adaptive Clustering Hierarchy). Performance analysis and compared statistic results
show that our proposed protocol perform well in terms of energy consumption and
network lifetime. We also propose a reliable, power efficient and high throughput routing protocol for wireless body area networks (WBANs). We use multi hop topology to minimize energy consumption and maximizing network lifetime. We use a cost function to select parent node or forwarder. Proposed cost function selects a parent node, which has high residual energy and less distance to sink. Residual energy parameter balances the energy consumption among the sensor nodes and distance parameter ensures successful packet delivery to sink. Simulation results shows that proposed protocol enhance the network stability period and nodes stay alive for longer period. Longer stability period contributes high packet delivery to sink which is major interest for continuous patient monitoring.
... Some of them are, distributed energy-efficient clustering (DEEC), enhanced DEEC (EDEEC), threshold DEEC (TDEEC), threshold sensitive energy efficient routing (TEEN), threshold sensitive stable election protocol (TSEP), enhance threshold sensitive stable election protocol (ETSSEP). In DEEC [13], for CH selection process residual and initial energy are considered. DEEC contain three types of nodes i.e., normal, advanced and super nodes having different energy level, perform well in terms of stability period. ...
This paper introduces dual cluster head routing protocol with super node (DCHRP4) having dual cluster head with four level of heterogeneity to improve the lifetime of a wireless sensor network. The main objective is to reduce the number of selection of cluster head so that the energy consumption can be minimized. In a clustering based sensor network cluster head does all the work from collecting to transmitting data to sink. Therefore, Cluster head loses its energy very fast. Energy plays an important role in efficient management of sensor network. Due to the handling of multiple tasks, energy of a cluster head is lost very fast. So, the paper focuses on reduces the energy consumption, improving the stability, the lifetime of the network, and throughput. From the simulation performed it is observed that the stability period of DCHRP4 upgrade 56.11% over enhanced threshold sensitive stable election protocol (ETSSEP) and twice and more than thrice over threshold sensitive stable election protocol (TSEP) and stable election protocol (SEP) respectively. The overall lifetime of DCHRP4 also upgrade by 8.29% and 49.22% over ETSSEP and TSEP respectively whereas about thrice in comparison with SEP. The throughput improved by 7.75% over ETSSEP, twice over TSEP and SEP respectively.
... Distributed Energy Efficient Clustering (DEEC) [8][9] is one of the cluster-based hierarchical protocol used especially for multilevel communication in a heterogeneous routing environment. In DEEC [10] protocol, the selection of cluster head is based on the ratio between the residual energy of each node and the average energy of the network [8].The protocol functions with the estimation of the ideal value of network lifetime in order to compute a reference energy which will be consumed by a node for each round. So that lower energy nodes have less probability than the higher initial and residual energy node to be the cluster head. ...
... Developing technologies aim to bring ease in human life lead to automation of different manual processes through electric machines. Increment in power sources is very slow as compare to power consumption rate due to different automation machines increasing day by day [1], [2], [3], [4], [5], [6]. Conventional Grid (CG) system is unable to cope with increasing power demand [7]. ...
... Afterwards, several reactive routing protocols were proposed for heterogeneous networks following the goal of SEP. A reactive routing protocol is used for time critical applications, such as Distributed Energy Efficient Clustering (DEEC) [13,15], Threshold Sensitive Energy Efficient Routing (TEEN), and Heterogeneity-aware Hierarchical Stable Election Protocol (HSEP). In TEEN, [12] transmission is done only if a severe change occurs in the value. ...
The major challenges in wireless sensor network include energy conservation, node life time, stability and throughput of network and its node.
Clustering is widely used to reduce the energy consumption and to improve the stability of the network. The efficient routing protocol in a cluster plays an important role in energy saving and stability of the cluster and its nodes. Enhance Threshold Sensitive Stable Election Protocol (ETSSEP) is proposed for heterogeneous wireless sensor network in the paper. It is based on dynamically changing cluster head election probability. It selects cluster heads on the basis of residual energy level of nodes and minimum number of clusters per round. The ETSSEP is simulated using MATLAB and found that it performs better than Stable Election Protocol (SEP) and Threshold Sensitive Stable Election protocol (TSEP) in terms of stability and network lifetime. ETSSEP builds more stable routing environment as compared TSEP and SEP. It is also found that ETSSEP stability is increased by 33.5 % in comparison to TSEP and more than twice in comparison to SEP. The overall lifetime of ETSSEP is also increased by 37.79 % in comparison to TSEP and about thrice in comparison to SEP.
... DDEEC [10] is also extension which improved the DEEC further. But [11] has evaluated the performance of improvements of DEEC where it found that EDEEC is better than DDEEC. EDEEC protocol used three types of nodes i.e. normal, advanced and super nodes. ...
In this paper, we study the two different type of routing strategies used in wireless sensor networks i.e. proactive and reactive routing mechanisms. These routing mechanisms are applied in different kind of applications for efficient routing in the network. In this paper, we have studied the different routing protocols which use these routing mechanisms and have compared them. We have also taken the homogenous and heterogeneous type of networks and also see the effect of homogeneity and heterogeneity on the routing in the network. So, we have taken LEACH and SEP routing protocols for homogenous and heterogeneous network respectively using proactive mechanism for routing and TEEN and TADEEC protocols for homogenous and heterogeneous using reactive mechanisms. Lastly we have compared the results of two routing strategies in term of stability period (the round in which first node dies), lifetime of the network and throughput i.e. data send to the base station per unit round.
... EDEEC [9], which was enhanced version of DEEC proposed to insert another node in the network (super node) with the existing normal and advanced nodes which increased the heterogeneity and lifetime as well. It has been evaluated in [10] that DDEEC has low stability period, lifetime and throughput as compared to the EDEEC. So EDEEC act as motivating factor to work on and improve it further. ...
In Wireless sensor networks, several routing protocols have been developed to improve the various parameters such as stability period, throughput etc .After a homogenous protocol leach, many heterogeneous protocol were developed which successfully improved the routing in WSNs .In this Paper we studied one of the heterogeneous protocol DEEC and its improved version EDEEC and we tried to work on two parameters i.e. Stability period and throughput of the network to improve these further .In this Paper we introduced a new node i.e. super advanced node with the existing heterogeneous nodes in the EDEEC which successfully improved its stability period and we also incorporated a reactive protocol i.e. TEEN in our paper to make our network communication more efficient .Thus we used the best of EDEEC and TEEN and made TADEEC protocol. This has been simulated in Matlab and results have outperformed the LEACH, DEEC, EDEEC etc.
... Three level heterogeneous networks contain normal, advances, and super nodes whereas super node have highest energy level as compare to normal and advanced nodes. They are discriminating each protocol on the basis of prolonging network life time of nodes during rounds for three level heterogeneous networks [12]. ...
Wireless body area networks are widely used for applications such as health care system, where wireless sensors (nodes) monitor the parameter(s) of interest. Sensors play a critical role in many sensor network applications. Mac layer operates on non-beacon and beacon enabled mode. The IEEE 802. 15. 4 standard provide two modes of connections: beacon enabled mode and non-offer transmission determinism. The non-beacon enabled mode does not suggest any assurance on traffic determinism. In this network an unslotted CSMA/CA channel access method is used beacon mode. In beacon-enabled networks, the extraordinary network nodes called ZigBee Routers transmit episodic beacons to verify their existence to other network nodes i. e. it can. Opposing to the non-beacon enabled mode, the beacon analyze delay, packet loss ratio, network life time, throughput of the wireless body area network. There will be three states nodes, sleep, awake, idle, which will be used to do transmission of data packets. AR-MAC protocol is based upon TDMA technique to reduce energy utilization. AR-MAC assigns Guaranteed Times Slot (GTS) to every sensor node for com-munication based upon the necessities of sensor node. Analysis of this parameter is performed on TDMA and CSMA/CA techniques that will be used to do the comparison on MAC layer. The performance will be judged on beacon and non-beacon enabled mode. Enabled mode does not permit us to shape mesh topology in order to interrelate numerous beacon networks.
... In future we would like to reduce deficiencies which are expected in this paper and implementation of DREEM-ME in other clustering protocols like Threshold sensitive energy efficient sensor network protocol [15], stable election protocol [16], distributed energy efficient clustering [17], etc. In future, we aim to introduce multiple QoS path parameters [27], energy efficient MAC protocols [18] [37], sink mobility and heterogeneity [32] in our work. Application of Routing Link Matrices on the proposed scheme can be useful in achieving efficient consumption of energy in the network [25]. ...
... Usually nodes in WSNs are power constrained due to limited battery resource. It is also not possible to recharge or replace the battery of already deployed sensor nodes [1, 2, 3]. Routing protocols play important role in achieving energy efficiency in WSNs. ...
Wireless Sensor Networks (WSNs) consist of large number of randomly
deployed energy constrained sensor nodes. Sensor nodes have ability to
sense and send sensed data to Base Station (BS). Sensing as well as
transmitting data towards BS require high energy. In WSNs, saving energy
and extending network lifetime are great challenges. Clustering is a key
technique used to optimize energy consumption in WSNs. In this paper, we
propose a novel clustering based routing technique: Enhanced Developed
Distributed Energy Efficient Clustering scheme (EDDEEC) for
heterogeneous WSNs. Our technique is based on changing dynamically and
with more efficiency the Cluster Head (CH) election probability.
Simulation results show that our proposed protocol achieves longer
lifetime, stability period and more effective messages to BS than
Distributed Energy Efficient Clustering (DEEC), Developed DEEC (DDEEC)
and Enhanced DEEC (EDEEC) in heterogeneous environments.
... To prolong the lifetime of sensors, route selection is of key importance. Thus, Authors in [1], [2] and [3] proposed energy efficient routing protocols. A common method for maximizing the sensors lifetime is minimization of communication between sensors. ...
Wireless Body Area Sensor Networks (WBASNs) consist of on-body or in-body
sensors placed on human body for health monitoring. Energy conservation of
these sensors, while guaranteeing a required level of performance, is a
challenging task. Energy efficient routing schemes are designed for the
longevity of network lifetime. In this paper, we propose a routing protocol for
measuring fatigue of a soldier. Three sensors are attached to soldier's body
that monitor specific parameters. Our proposed protocol is an event driven
protocol and takes three scenarios for measuring the fatigue of a soldier. We
evaluate our proposed work in terms of network lifetime, throughput, remaining
energy of sensors and fatigue of a soldier.
... DEEC is a heterogeneous protocol having nodes with extra energy which can send packets to BS than other protocols. DEEC is compared with its variants to evaluate the performances of all proposed protocols [7]. ...
Energy efficient routing protocols are consistently cited as efficient
solutions for Wireless Sensor Networks (WSNs) routing. The area of WSNs
is one of the emerging and fast growing fields which brought low cost,
low power and multi-functional sensor nodes. In this paper, we examine
some protocols related to homogeneous and heterogeneous networks. To
evaluate the efficiency of different clustering schemes, we compare five
clustering routing protocols; Low Energy Adaptive Clustering Hierarchy
(LEACH), Threshold Sensitive Energy Efficient Sensor Network (TEEN),
Distributed Energy Efficient Clustering (DEEC) and two variants of TEEN
which are Clustering and Multi-Hop Protocol in Threshold Sensitive
Energy Efficient Sensor Network (CAMPTEEN) and Hierarchical Threshold
Sensitive Energy Efficient Sensor Network (H-TEEN). The contribution of
this paper is to introduce sink mobility to increase the network life
time of hierarchal routing protocols. Two scenarios are discussed to
compare the performances of routing protocols; in first scenario static
sink is implanted and in later one mobile sink is used. We perform
analytical simulations in MATLAB by using different performance metrics
such as, number of alive nodes, number of dead nodes and throughput.
... In [8] MS lowers the saturation from the nodes which are close to sink and resulting increase the network life. Authors in [9] surveyed variants of Distributed Energy Efficient Clustering (DEEC) on basis of multi level heterogeneous network to two level heterogeneous network. However, hierarchal clustering is discussed in [10] by authors. ...
Sink Mobility is becoming popular due to excellent load balancing
between nodes and ultimately resulting in prolonged network lifetime and
throughput. A major challenge is to provide reliable and
energy-efficient operations are to be taken into consideration for
differentmobility patterns of sink. Aim of this paper is lifetime
maximization of Delay TolerantWireless Sensor Networks (WSNs) through
the manipulation of Mobile Sink (MS) on different trajectories. We
propose Square Routing Protocol with MS (SRP-MS) based on existing SEP
(Stable Election Protocol) by making it Cluster Less (CL) and
introducing sink mobility.
Energy saving is the rudimentary provocation in (WSNs). Energy of the WSNs can be preserved in many ways such as duty-cycling of nodes, clustering, Energy proficient routing, and data Energy etc. Good WSNs work on the principle of two issue firstly Energy saving and secondly good network lifetime. In WSNs protocols are found of two types heterogeneous and homogenous. Different types of nodes are used in this WSNs. Different Energy levels are found in these nodes. Different nodes arrangement, clustering scheme and algorithms are used in these WSNs protocols. Heterogeneity is related to different Energy uses and different nodes clustering. We give a Review on Energy Saving Clustering Based Protocols of HWSN in this study.
The abrupt changes in the sensor measurements indicating the occurrence of an event are the major factor in some monitoring applications of IoT networks. The prediction-based approach for data aggregation in wireless sensor networks plays a significant role in detecting such events. This paper introduces a prediction-based aggregation model for sensor selection named the Grey prediction model and the Kalman filter-based data aggregation model with rank-based mutual information (GMKFDA-MI) that has a dual synchronization mechanism for aggregating the data and selecting the nodes based on prediction and cumulative error thresholds. Furthermore, the nodes after deployment are clustered using K-medoids clustering along with the Salp swarm optimization algorithm to obtain an optimized aggregator position concerning the base station. An efficient clustering promises energy efficiency and better connectivity. The experiments are accomplished on real-time datasets of air pollution monitoring applications and the results for the proposed method are compared with other similar state-of-the-art techniques. The proposed method promises high prediction accuracy, low energy consumption and enhances the throughput of the network. The energy-saving is recorded to be more than 10 to 30% for the proposed model when compared with other similar approaches. Also, the proposed method achieves 97.8% accuracy as compared to other methods. The method proves its best working efficiency in the applications like event reporting, target detection, and event monitoring.
It is inconvenient to replace the sensor nodes with limited energy in wireless sensor networks (WSNs) when they are deployed in remote or dangerous monitoring area, that makes energy consumption become the main issue to limit wide application of WSNs. Existing clustering methods only consider heterogeneity of node energy for head selection, irrespective of differences in network structure and node density. Fuzzy logic scheme is applied in this paper to consider multiple factors clustering with the purpose of prolonging network lifetime. In addition to the initial energy, the relative density of nodes and the relative distance between nodes and base station are considered to select the cluster head dynamically. Experimental results have demonstrated that the proposed dynamic clustering scheme can balance the energy consumption of the nodes in both homogeneous and heterogeneous networks, effectively prolong the lifetime of the network, maintain the accuracy of data aggregation.
A wireless sensor network is a network of nodes spread across the application field with sensors attached to them, helping them sense the environmental parameters and transmit the data to the base station for further computation. Because of low battery power of sensor nodes, energy efficient routing in the sensor nodes is very important for a good network lifetime and throughput. Clustering of nodes by formation of groups is an effective routing technique which involves transmission of data from the nodes to the head of the cluster and then the transmission of the accumulated data from that cluster head to the base station. In this paper, a new clustering based routing protocol is proposed which shows significant improvement in the network lifetime, stability of network, throughput of the network and the average energy of the network as compared to the conventional clustering based routing algorithms. The nodes in the network field have been deployed according to the gauss function instead of a random distribution. Also, the base station has been made mobile and it’s movement is according to the sigmoid function. Initial energy and current energy of nodes along with average energy of network have been taken into consideration in several computations to modify the conventional clustering routing algorithm. This proposed protocol i.e. Gauss-sigmoid based clustering routing (GSCR) protocol is compared with SEP, LEACH and DEEC protocols for performance evaluation and for exhibiting its improvement in the performance parameters. Significant improvement is exhibited in terms of network lifetime, throughput, stability period and the average energy of the network.
One of the main constraints in wireless sensor networks (WSNs) is the energy consumption. To mitigate this limitation and to prolong network life-time, stability period and throughput, this paper proposes new cluster-heads selection protocols, they based on Stable Election Protocol (SEP) and Distributed Energy-Efficient Clustering (DEEC). We first propose Enhanced Zonal-SEP (EZSEP) and Zonal Threshold-DEEC (ZTDEEC) protocols, the proposed protocols are based on dividing the network field into certain zones, this will improve the connectivity of the far normal nodes with the base station (BS). Several evaluation metrics are used to compare between the proposed protocols and the conventional ZSEP and TDEEC protocols such as: network stability, instability period, life-time and throughput. Considering the same total initial energy, the obtained results show that the proposed EZSEP slightly outperforms the conventional ZSEP in terms of network stability, instability period and life-time, it achieves enormous improvements in terms of throughput as more nodes can transmit direct to BS. On the other hand, the proposed ZTDEEC provides huge improvements in terms of all the evaluation metrics mentioned above. To further improve the network life-time and network throughput, we propose Threshold-based EZSEP (TE-ZSEP) and Enhanced-ZTDEEC (EZ-TDEEC) protocols, in these two new protocols we redefine the threshold formula used in EZSEP and ZTDEEC to consider both weighted energy and weighted distance parameters. By combining the idea of dividing the network field into certain zones and the new threshold formula, the proposed TE-ZSEP and EZ-TDEEC protocols can effectively improve the energy consumption in heterogeneous WSN and prolong its life-time as proved by the obtained results.
In recent years , numerous steering conventions have been proposed to enhance the lifetime, deployment of nodes, energy efficiency, latency, robustness, fault tolerance, and reliability of Wireless Sensor Networks (WSN). The vitality requirements and drawing out the lifetime of the WSN is imperative part of steering conventions. Diverse bunch based directing convention have proposed to enhance the customary conventions i.e. direct transmission, multi-jump steering, static bunching and least transmission-vitality. Among all group based conventions, Low-Energy Adaptive Clustering Hierarchy (LEACH) is the most conspicuous WSN convention. In this undertaking, we have attempted to extend the LEACH by including diverse components in LEACH for homogeneous and heterogeneous situations. We have proposed Hand LEACH Phase-1 by presenting capable group head choice plan and distinctive transmitting force levels for LEACH in homogeneous environment. Be that as it may, vitality sparing plan of homogeneous environment is not suitable for heterogeneous environment. Stable Election Protocol (SEP) is the element heterogeneous steering convention. SEP depends on weighted decision probabilities of every hub to end up the bunch head as indicated by the remaining vitality in every hub. We propose Hand LEACH Phase-2 by applying diverse methods for correspondence (between CH to sink) for cutting edge and ordinary hubs. By demonstrating recreation, we demonstrate that Hand LEACH is more vitality proficient and has longer lifetime of system than LEACH in homogeneous and heterogeneous situations.
Internet of things (IoT) is a global infrastructure for the information society which enables advanced services by interconnecting physical and virtual things based on existing and evolving inter-operable information and communication technologies. Developing green IoT is a difficult task because IoT has more devices and has complex structure, so most of the current schemes for deploying nodes in wireless sensor networks (WSNs) cannot be applied directly in IoT. In this paper, we propose a scheme which gives an energy-efficient IoT. Here, we propose two schemes for framework structure of a network, and then we propose clustering algorithms and routing algorithms for network formation which is based on minimum spanning tree. After numerous simulations, we show that these schemes result in minimal energy consumption and enhance the network lifetime. Thus, the proposed schemes are more energy-efficient compared to a typical WSN deployment scheme; hence, these schemes are applicable to the green IoT deployment. We show that in the proposed schemes, the nodes are alive for more number of rounds as compared to the existing algorithms.
The idea of interconnectivity inside IoT gadgets yearning the world where billions of items can detect, convey and share data, all interconnected over open or private Internet Protocol (IP) systems. The IoT can possibly convey arrangements that drastically enhance vitality proficiency, security, wellbeing, instruction and numerous different parts of everyday life. These interconnected items have information consistently gathered, broke down and used to start the activity, giving an abundance of insight to arranging, administration and basic leadership. All connected nodes within IoT framework are gathering information and that could be prepared at a similar hub for security and effectiveness purposes. Aggregating the data close to its source in IoT is known as edge processing/edge analytics. The reason for this examination is outline a clever framework for load adjusting and vitality preservation, serving edge analytics.
Wireless Sensor Networks (WSNs) containslarge number of low cost, low power and tiny sensor nodes that are handle the complex functionalities, the network require the energy to enhance the network lifetime. Many protocols are proposed to reduce energy consumption and increase the network lifetime. In HEER protocol, Cluster Head selection is based on the ratio of high energy of node and low energy of the network. Moreover, to conserve more energy, HEER has also utilized the Hard Threshold and Soft Threshold. But HEER does not use the inter cluster data aggregation, it may causes flooding of the data which consequences in maximum energy consumption. So to overcome this problem we have proposed a relay node based HEER protocol to overcome the flooding issue at base station. Relay node based HEER has same features as the existing HEER has but has better inter cluster data aggregation at relay node. Therefore relay node based data aggregation can easily handle the problem of flooding in HEER at base station efficiently.
One of the major challenges in Wireless Body Area Networks (WBANs) is to
prolong the lifetime of network. Traditional research work focuses on
minimizing transmit power; however, in the case of short range communication
the consumption power in decoding is significantly larger than transmit power.
This paper investigates the minimization of total power consumption by reducing
the decoding power consumption. For achieving a desired Bit Error Rate (BER),
we introduce some fundamental results on the basis of iterative message-passing
algorithms for Low Density Parity Check Code (LDPC). To reduce energy
dissipation in decoder, LDPC based coded communications between sensors are
considered. Moreover, we evaluate the performance of LDPC at different code
rates and introduce Adaptive Iterative Decoding (AID) by exploiting threshold
on the number of iterations for a certain BER (0.0004). In iterative LDPC
decoding, the total energy consumption of network is reduced by 20 to 25%.
An energy efficient routing protocol is the major attentiveness for
researcher in field of Wireless Sensor Networks (WSNs). In this paper, we
present some energy efficient hierarchal routing protocols, prosper from
conventional Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol.
Fundamental objective of our consideration is to analyze, how these ex- tended
routing protocols work in order to optimize lifetime of network nodes and how
quality of routing protocols is improved for WSNs. Furthermore, this paper also
emphasizes on some issues experienced by LEACH and also explains how these
issues are tackled by other enhanced routing protocols from classi- cal LEACH.
We analytically compare the features and performance issues of each hierarchal
routing protocol. We also simulate selected clustering routing protocols for
our study in order to elaborate the enhancement achieved by ameliorate routing
protocols.
The clustering algorithm are considered as a kind of key technique used
to reduce energy consumption. It can help in increasing the stability
period and network life time. Routing protocol for efficient energy
utilization should be designed for heterogeneous Wireless Sensor
Networks (WSNs). We purpose Hybrid-DEEC (H-DEEC), a chain and cluster
based (hybrid) distributed scheme for efficient energy utilization in
WSNs. In H-DEEC,elected Cluster Heads (CHs) communicate the Base Station
(BS) through beta elected nodes, by using multi-hopping. We logically
divide the network into two parts, on the basis of the residual energy
of nodes. The normal nodes with high initial and residual energy will
behighlyprobable to be CHs than the nodes with lesser energy. To
overcome the deficiencies of H-DEEC, we propose Multi-Edged Hybrid-DEEC
(MH-DEEC). In MH-DEEC the criteria of chain construction is modified.
Finally, the comparison in simulation results with other heterogeneous
protocols show that, MH-DEEC and H-DEEC achieves longer stability time
and network life time due to efficient energy utilization.
Typically, a wireless sensor network contains an important number of inexpensive power constrained sensors, which collect data from the environment and transmit them towards the base station in a cooperative way. Saving energy and therefore, extending the wireless sensor networks lifetime, imposes a great challenge. Clustering techniques are largely used for these purposes. In this paper, we propose and evaluate a clustering technique called a Developed Distributed Energy-Efficient Clustering scheme for heterogeneous wireless sensor networks. This technique is based on changing dynamically and with more efficiency the cluster head election probability. Simulation results show that our protocol performs better than the Stable Election Protocol (SEP) by about 30% and than the Distributed Energy-Efficient Clustering (DEEC) by about 15% in terms of network lifetime and first node dies.
We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.
This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed.
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data within a cluster, and type 1 nodes which act as cluster heads or fusion points. A surveillance aircraft visits the area periodically, and gathers information about the activity in the area. During each data gathering cycle, the sensor nodes use multi-hopping to communicate with their respective cluster heads, while the cluster heads perform data fusion, and transmit the aggregated data directly to the aircraft. We formulate and solve a cost based optimization problem to determine the optimum number of sensor nodes (n
0), cluster head nodes (n
1) and the battery energy in each type of nodes (E
0 and E
1 respectively) to ensure at least T data gathering cycles. We observe that the number of cluster heads required, n
1, scales approximately as \({n_0}{1-\frac{k}{4}}\) where k is the propagation loss exponent.
In recent advances, many routing protocols have been proposedbased on heterogeneity with main research goals such asachieving the energy efficiency, lifetime, deployment of nodes,fault tolerance, latency, in short high reliability and robustness. Inthis paper, we have proposed an energy efficient cluster headscheme, for heterogeneous wireless sensor networks, bymodifying the threshold value of a node based on which it decidesto be a cluster head or not, called TDEEC (Threshold DistributedEnergy Efficient Clustering) protocol. Simulation results showthat proposed algorithm performs better as compared to others.
Typically, a wireless sensor network contains an important number of inexpensive power constrained sensors which collect data from the environment and transmit them towards the base station in a cooperative way. Saving energy and therefore, extending the wireless sensor networks lifetime, imposes a great challenge. Many new protocols are specifically designed for these raisons where energy awareness is an essential consideration. The clustering techniques are largely used for these purposes.In this paper, we present and evaluate a Stochastic and Balanced Developed Distributed Energy-Efficient Clustering (SBDEEC) scheme for heterogeneous wireless sensor networks. This protocol is based on dividing the network into dynamic clusters. The cluster’s nodes communicate with an elected node called cluster head, and then the cluster heads communicate the information to the base station. SBDEEC introduces a balanced and dynamic method where the cluster head election probability is more efficient. Moreover, it uses a stochastic scheme detection to extend the network lifetime. Simulation results show that our protocol performs better than the Stable Election Protocol (SEP) and than the Distributed Energy-Efficient Clustering (DEEC) in terms of network lifetime. In the proposed protocol the first node death occurs over 90% times longer than the first node death in DEEC protocol and by about 130% than SEP. Postprint (published version)
Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.
The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks. Most conventional protocols exhibit their least desirable behavior for highly dynamic interconnection topologies. We propose a new methodology for routing and topology information maintenance in dynamic networks. The basic ideabehind the protocol is to divide the graph into a number of overlapping clusters. A change in the network topology corresponds to a change in cluster membership. We present algorithms for creation of clusters, as well as algorithms to maintain them in the presence of various network events. Compared to existing and conventional routing protocols, the proposed cluster-based approach incurs lower overhead during topology updates and also has quicker reconvergence. The e#ectiveness of this approach also lies in the fact that existing routing protocols can be directly applied to the network # replacing the nodes by clusters. 1 Int...
In order to prolong the network lifetime, energy-efficient protocols should be designed to adapt the characteristic of wireless sensor networks. Clustering Algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. This paper studies the performance of clustering algorithm in saving energy for heterogeneous wireless sensor networks. A new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks is proposed and evaluated. In the new clustering scheme, cluster-heads are elected by a probability based on the ratio between residual energy of node and the average energy of network. The high initial and residual energy nodes will have more chances to be the cluster-heads than the low energy nodes. Simulational results show that the clustering scheme provides longer lifetime and higher throughput than the current important clustering protocols in heterogeneous environments.
Many routing protocols on clustering structure have been proposed in recent years. In recent advances, achieving the energy efficiency, lifetime, deployment of nodes, fault tolerance, latency, in short high reliability and robustness have become the main research goals of wireless sensor network. Many routing protocols on clustering structure have been proposed in recent years based on heterogeneity. We propose EDEEC for three types of nodes in prolonging the lifetime and stability of the network. Hence, it increases the heterogeneity and energy level of the network. Simulation results show that EDEEC performs better than SEP with more stability and effective messages.
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.
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
The popularity of Wireless Sensor Networks have increased tremendously due to the vast potential of the sensor networks to connect the physical world with the virtual world. Since these devices rely on battery power and may be placed in hostile environments replacing them becomes a tedious task. Thus, improving the energy of these networks becomes important.The thesis provides methods for clustering and cluster head selection to WSN to improve energy efficiency. It presents a comparison between the different methods on the basis of the network lifetime . It proposes a modified approach for cluster head selection with good performance and reduced computational complexity .In addition it also proposes BFO as an algorithm for clustering of WSN which would result improved performance with faster convergence.
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies.
Routing in ad-hoc networks is a difficult challenge that involves a tradeoff between efficiency and responsiveness. An ad-hoc network routing algorithm must adapt rapidly enough to topology changes to meet the performance demands of users, without over-utilizing network resources. This paper presents the (α,t) cluster framework which utilizes a distributed dynamic clustering strategy to organize nodes into clusters in which the probability of path failure due to node movement can be bounded over time. The objective of the clustering strategy is to achieve scalability and support robust, efficient routing subject to a wide range of mobility rates. Based on the (α,t) cluster scheme, routes within clusters are maintained on a proactive basis, whereas hierarchical routing between clusters is managed on a demand-basis. Simulation results show that the cluster organization can be effectively adapted to node mobility and that routing is both more robust and efficient than routing in fully proactive, reactive or fixed-hybrid schemes
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.
An applicationspecific protocol architecture for wireless microsensor networks
- W R Heinzelman
- A P Chandrakasan
- H Balakrishnan
W.R. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, "An applicationspecific protocol architecture for wireless microsensor networks", IEEE
Transactions on Wireless Communications 1 (4) (2002) 660-670.
Pegasis: Power efficient gathering in sensor information systems
- S Lindsey
- C S Raghavenda
S. Lindsey, C.S. Raghavenda, PEGASIS: "power efficient gathering in
sensor information systems", in: Proceeding of the IEEE Aerospace
Conference, Big Sky, Montana, March 2002.
SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor network
- G Smaragdakis
- I Matta
- A Bestavros
G. Smaragdakis, I. Matta, A. Bestavros,"SEP: A Stable Election Protocol
for clustered heterogeneous wireless sensor network", in: Second International Workshop on Sensor and Actor Network Protocols and Applications
(SANPA 2004), 2004.