Wireless sensor network consists of application oriented and cheap micro-devices called sensors nodes
having potential of connecting the physical world with virtual world by their sensing abilities. These sensor
nodes are having restrained battery sources. Efficient energy management is current area of research in
wireless sensor networks. Here we advice one such energy aware multi-hop protocol (G-DEEC) for two
level heterogeneous networks. In G-DEEC, the Base Station is placed out of sensing area and rechargeable
gateway nodes are placed inside field with other randomly deployed sensor nodes. Simulation shows the
proposed protocol G-DEEC is better than single-hop DEEC in terms of number of half dead nodes, alive
nodes and dead nodes; thereby showing improvement in network lifetime and stability.
G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTO...IJCI JOURNAL
Wireless sensor network is composed of hundreds and thousands of small wireless sensor nodes which
collect information by sensing the physical environment. The sensed data is processed and communicated
to other sensor nodes and finally to Base Station. So energy efficient routing to final destination called base
station is ongoing current requirement in wireless sensor networks. Here in this research paper we propose
a multi-hop DEEC routing scheme i.e. G-DEEC for heterogeneous networks where we deploy rechargeable
intermediate nodes called gateways in-between cluster head and base station for minimizing energy
consumption by sensor nodes in each processing round thereby increasing the network lifetime and
stability of wireless sensor networks unlike DEEC.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR HET...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR H...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is
introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.
Gateway nodes are deployed in sensing field.
Energy Efficient Stable Election Protocol for Clustered Heterogeneous Wireles...IOSR Journals
This document summarizes an energy efficient stable election protocol (EE-SEP) for clustered heterogeneous wireless sensor networks. EE-SEP modifies the existing SEP protocol to improve energy efficiency, stability period, and network lifetime. It does this by calculating the optimal threshold value for selecting cluster heads based on the initial energy of sensor nodes, rather than the weighted election probability used in SEP. Simulations show EE-SEP performs better than SEP by increasing the number of alive nodes over time, reducing energy consumption, and prolonging network lifetime.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
This document describes a new clustering protocol called WDDC (Weighted Dynamic Distributed Clustering) for heterogeneous wireless sensor networks. WDDC selects cluster heads based on the ratio of a node's residual energy to the average network energy, and also considers the distance between nodes and the base station. WDDC divides the network lifetime into two zones and changes its behavior dynamically between the zones. Simulation results show WDDC outperforms other clustering protocols like SEP and DEEC in terms of energy efficiency and extending network lifetime.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTO...IJCI JOURNAL
Wireless sensor network is composed of hundreds and thousands of small wireless sensor nodes which
collect information by sensing the physical environment. The sensed data is processed and communicated
to other sensor nodes and finally to Base Station. So energy efficient routing to final destination called base
station is ongoing current requirement in wireless sensor networks. Here in this research paper we propose
a multi-hop DEEC routing scheme i.e. G-DEEC for heterogeneous networks where we deploy rechargeable
intermediate nodes called gateways in-between cluster head and base station for minimizing energy
consumption by sensor nodes in each processing round thereby increasing the network lifetime and
stability of wireless sensor networks unlike DEEC.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR HET...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR H...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is
introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.
Gateway nodes are deployed in sensing field.
Energy Efficient Stable Election Protocol for Clustered Heterogeneous Wireles...IOSR Journals
This document summarizes an energy efficient stable election protocol (EE-SEP) for clustered heterogeneous wireless sensor networks. EE-SEP modifies the existing SEP protocol to improve energy efficiency, stability period, and network lifetime. It does this by calculating the optimal threshold value for selecting cluster heads based on the initial energy of sensor nodes, rather than the weighted election probability used in SEP. Simulations show EE-SEP performs better than SEP by increasing the number of alive nodes over time, reducing energy consumption, and prolonging network lifetime.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
This document describes a new clustering protocol called WDDC (Weighted Dynamic Distributed Clustering) for heterogeneous wireless sensor networks. WDDC selects cluster heads based on the ratio of a node's residual energy to the average network energy, and also considers the distance between nodes and the base station. WDDC divides the network lifetime into two zones and changes its behavior dynamically between the zones. Simulation results show WDDC outperforms other clustering protocols like SEP and DEEC in terms of energy efficiency and extending network lifetime.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterog...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
A PROPOSAL TO IMPROVE SEP ROUTING PROTOCOL USING INSENSITIVE FUZZY C-MEANS IN...IJCNCJournal
This document proposes improving the SEP routing protocol in wireless sensor networks by combining it with the Insensitive Fuzzy C-Means clustering algorithm. The SEP protocol is an existing heterogeneous routing protocol that increases network stability but has limitations. The proposed SEP-εFCM protocol selects cluster heads using εFCM clustering, which can create more balanced clusters and reduce energy consumption. Simulation results showed the SEP-εFCM protocol performed better than the original SEP protocol, with more remaining live nodes and energy over time.
An Improved Deterministic Energy Efficient Clustering Protocol for Wireless S...IJERA Editor
In recent development, achieving the deployment of nodes, lifetime, fault tolerance, latency, energy efficiency in brief robustness and high reliability have become the prime research goals of wireless sensor network. In recent years many clustering protocols have been suggested on clustering structure based on heterogeneity. We propose improved deterministic energy-efficient clustering protocol for four types of nodes which extend the stability and lifetime of the network in team of first node get dead. Hence, it increases the heterogeneity and energy level of the network. I-DEC performs better than E-SEP, SEP and DEC with more stability and effective messages shows in simulation results.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Iaetsd load stabilizing and energy conserving routingIaetsd Iaetsd
The document summarizes a proposed routing protocol called Load Stabilizing Tree Based Energy Conserving Routing Protocol (LSTEC) for wireless sensor networks. LSTEC aims to balance energy utilization and extend network lifetime. It constructs a routing tree where each round a base station assigns a root node and nodes select parents based on their own and neighbor information. Simulation results show LSTEC performs better than other protocols in balancing energy consumption and extending network lifetime. The protocol operations include initialization, tree construction, data collection/transmission, and information exchange phases. Tree construction differs depending on whether data can be fully fused or not.
The document summarizes a student's M. Tech thesis project on improving routing protocols in wireless sensor networks. It begins with an objective to develop a hybrid routing protocol combining features of PEGASIS and LEACH to increase network lifetime. It then reviews related work on routing protocols and energy efficiency. The proposed methodology describes a hybrid protocol that selects cluster heads probabilistically like LEACH while forming chains to route data like PEGASIS. Simulation results show the hybrid protocol increases network lifetime to over 2000 rounds compared to 2000 rounds for previous work. The conclusion is that lower cluster head election probabilities in the hybrid protocol extend network lifetime. Future work could analyze different network parameters.
CBHRP: A Cluster Based Routing Protocol for Wireless Sensor NetworkCSEIJJournal
A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol
(CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster
head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to
collect information from target field. On rotation basis, a head-set member receives data from the neighbor
nodes and transmits the aggregated results to the distance base station. This protocol reduces energy
consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP
performs better than other well accepted hierarchical routing protocols like LEACH in term of energy
consumption and time requirement.
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
Lifetime enhanced energy efficient wireless sensor networks using renewable e...IJECEIAES
In this paper, we consider a remote environment with randomly deployed sensor nodes, with an initial energy of E0 (J) and a solar panel. A hierarchical clustering technique is implemented. At each round, the normal nodes send the sensed data to the nearest cluster head (CH) which is chosen on the probability value. Data after aggregation at CHs is sent to the base station (BS). CH requires more energy than normal nodes. Here, we energize only CHs if their energy is less than 5% of its initial value with the use of solar energy. We evaluate parameters like energy consumption, the lifetime of the network, and data packets sent to CH and BS. The obtained results are compared with existing techniques. The proposed protocol provides better energy efficiency and network lifetime. The results show increased stability with delayed death of the first node. The network lifetime of the proposed protocol is compared to the multi-level hybrid energy efficient distributed (MLHEED) technique and low-energy adaptive clustering hierarchy (LEACH) variants. Network lifetime is enhanced by 13.35%. Energy consumption is reduced with respect to MLHEED-4, 5, and 6 by 7.15%, 12.10%, and 14.975% respectively. The no. of packets transferred to the BS is greater than the MLHEED protocol by 39.03%.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
Energy Optimization in Heterogeneous Clustered Wireless Sensor NetworksIRJET Journal
1) The document discusses energy optimization in heterogeneous clustered wireless sensor networks. It proposes a new method called Energy optimized heterogeneous clustered wireless sensor networks (EEHC) to improve network lifetime by reducing energy consumption.
2) The EEHC method selects cluster heads based on node energy levels and connectivity to balance energy usage. It uses different transmission techniques within and between clusters to minimize energy usage.
3) Simulation results show the EEHC method improves network lifetime compared to LEACH and AEEC clustering protocols for wireless sensor networks.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
More Related Content
Similar to Gateway Based Multi-Hop Distributed Energy Efficient Clustering Protocol for Heterogeneous Wireless Sensor Networks
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterog...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
A PROPOSAL TO IMPROVE SEP ROUTING PROTOCOL USING INSENSITIVE FUZZY C-MEANS IN...IJCNCJournal
This document proposes improving the SEP routing protocol in wireless sensor networks by combining it with the Insensitive Fuzzy C-Means clustering algorithm. The SEP protocol is an existing heterogeneous routing protocol that increases network stability but has limitations. The proposed SEP-εFCM protocol selects cluster heads using εFCM clustering, which can create more balanced clusters and reduce energy consumption. Simulation results showed the SEP-εFCM protocol performed better than the original SEP protocol, with more remaining live nodes and energy over time.
An Improved Deterministic Energy Efficient Clustering Protocol for Wireless S...IJERA Editor
In recent development, achieving the deployment of nodes, lifetime, fault tolerance, latency, energy efficiency in brief robustness and high reliability have become the prime research goals of wireless sensor network. In recent years many clustering protocols have been suggested on clustering structure based on heterogeneity. We propose improved deterministic energy-efficient clustering protocol for four types of nodes which extend the stability and lifetime of the network in team of first node get dead. Hence, it increases the heterogeneity and energy level of the network. I-DEC performs better than E-SEP, SEP and DEC with more stability and effective messages shows in simulation results.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Iaetsd load stabilizing and energy conserving routingIaetsd Iaetsd
The document summarizes a proposed routing protocol called Load Stabilizing Tree Based Energy Conserving Routing Protocol (LSTEC) for wireless sensor networks. LSTEC aims to balance energy utilization and extend network lifetime. It constructs a routing tree where each round a base station assigns a root node and nodes select parents based on their own and neighbor information. Simulation results show LSTEC performs better than other protocols in balancing energy consumption and extending network lifetime. The protocol operations include initialization, tree construction, data collection/transmission, and information exchange phases. Tree construction differs depending on whether data can be fully fused or not.
The document summarizes a student's M. Tech thesis project on improving routing protocols in wireless sensor networks. It begins with an objective to develop a hybrid routing protocol combining features of PEGASIS and LEACH to increase network lifetime. It then reviews related work on routing protocols and energy efficiency. The proposed methodology describes a hybrid protocol that selects cluster heads probabilistically like LEACH while forming chains to route data like PEGASIS. Simulation results show the hybrid protocol increases network lifetime to over 2000 rounds compared to 2000 rounds for previous work. The conclusion is that lower cluster head election probabilities in the hybrid protocol extend network lifetime. Future work could analyze different network parameters.
CBHRP: A Cluster Based Routing Protocol for Wireless Sensor NetworkCSEIJJournal
A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol
(CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster
head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to
collect information from target field. On rotation basis, a head-set member receives data from the neighbor
nodes and transmits the aggregated results to the distance base station. This protocol reduces energy
consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP
performs better than other well accepted hierarchical routing protocols like LEACH in term of energy
consumption and time requirement.
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
Lifetime enhanced energy efficient wireless sensor networks using renewable e...IJECEIAES
In this paper, we consider a remote environment with randomly deployed sensor nodes, with an initial energy of E0 (J) and a solar panel. A hierarchical clustering technique is implemented. At each round, the normal nodes send the sensed data to the nearest cluster head (CH) which is chosen on the probability value. Data after aggregation at CHs is sent to the base station (BS). CH requires more energy than normal nodes. Here, we energize only CHs if their energy is less than 5% of its initial value with the use of solar energy. We evaluate parameters like energy consumption, the lifetime of the network, and data packets sent to CH and BS. The obtained results are compared with existing techniques. The proposed protocol provides better energy efficiency and network lifetime. The results show increased stability with delayed death of the first node. The network lifetime of the proposed protocol is compared to the multi-level hybrid energy efficient distributed (MLHEED) technique and low-energy adaptive clustering hierarchy (LEACH) variants. Network lifetime is enhanced by 13.35%. Energy consumption is reduced with respect to MLHEED-4, 5, and 6 by 7.15%, 12.10%, and 14.975% respectively. The no. of packets transferred to the BS is greater than the MLHEED protocol by 39.03%.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
Energy Optimization in Heterogeneous Clustered Wireless Sensor NetworksIRJET Journal
1) The document discusses energy optimization in heterogeneous clustered wireless sensor networks. It proposes a new method called Energy optimized heterogeneous clustered wireless sensor networks (EEHC) to improve network lifetime by reducing energy consumption.
2) The EEHC method selects cluster heads based on node energy levels and connectivity to balance energy usage. It uses different transmission techniques within and between clusters to minimize energy usage.
3) Simulation results show the EEHC method improves network lifetime compared to LEACH and AEEC clustering protocols for wireless sensor networks.
Similar to Gateway Based Multi-Hop Distributed Energy Efficient Clustering Protocol for Heterogeneous Wireless Sensor Networks (20)
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
October 2023-Top Cited Articles in IJU.pdfijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
ACCELERATION DETECTION OF LARGE (PROBABLY) PRIME NUMBERSijujournal
This document discusses methods for efficiently generating large prime numbers for use in RSA cryptography. It presents experimental results measuring the time taken to generate prime numbers when trial dividing the starting number by different numbers of initial primes before applying the Miller-Rabin primality test. The optimal number of trial divisions can be estimated as B=E/D, where E is the time for Miller-Rabin test and D is the maximum usefulness of trial division. Experimental results on different sized numbers support dividing by around 20 initial primes as optimal.
A novel integrated approach for handling anomalies in RFID dataijujournal
Radio Frequency Identification (RFID) is a convenient technology employed in various applications. The
success of these RFID applications depends heavily on the quality of the data stream generated by RFID
readers. Due to various anomalies found predominantly in RFID data it limits the widespread adoption of
this technology. Our work is to eliminate the anomalies present in RFID data in an effective manner so that
it can be applied for high end applications. Our approach is a hybrid approach of middleware and
deferred because it is not always possible to remove all anomalies and redundancies in middleware. The
processing of other anomalies is deferred until the query time and cleaned by business rules. Experimental
results show that the proposed approach performs the cleaning in an effective manner compared to the
existing approaches.
UBIQUITOUS HEALTHCARE MONITORING SYSTEM USING INTEGRATED TRIAXIAL ACCELEROMET...ijujournal
Ubiquitous healthcare has become one of the prominent areas of research inorder to address the
challenges encountered in healthcare environment. In contribution to this area, this study developed a
system prototype that recommends diagonostic services based on physiological data collected in real time
from a distant patient. The prototype uses WBAN body sensors to be worn by the individual and an android
smart phone as a personal server. Physiological data is collected and uploaded to a Medical Health
Server (MHS) via GPRS/internet to be analysed. Our implemented prototype monitors the activity, location
and physiological data such as SpO2 and Heart Rate (HR) of the elderly and patients in rehabilitation. The
uploaded information can be accessed in real time by medical practitioners through a web application.
ENHANCING INDEPENDENT SENIOR LIVING THROUGH SMART HOME TECHNOLOGIESijujournal
The population of elderly folks is ballooning worldwide as people live longer. But getting older often
means declining health and trouble living solo. Smart home tech could keep an eye on old folks and get
help quickly when needed so they can stay independent. This paper looks at a system combining wireless
sensors, video watches, automation, resident monitoring, emergency detection, and remote access. Sensors
track health signs, activities, appliance use. Video analytics spot odd stuff like falls. Sensor fusion and
machine learning find normal patterns so wonks can see unhealthy changes and send alerts. Multi-channel
alerts reach caregivers and emergency folks. A LabVIEW can integrate devices and enables local and
remote oversight and can control and handle emergency responses. Benefits seem to be early illness clues,
quick help, less burden on caregivers, and optimized home settings. But will old folks use all this tech? Can
we prove it really helps folks live longer and better? More research on maximizing reliability and
evaluating real-world impacts is needed. But designed thoughtfully, smart homes could may profoundly
improve the aging experience.
HMR LOG ANALYZER: ANALYZE WEB APPLICATION LOGS OVER HADOOP MAPREDUCEijujournal
In today’s Internet world, log file analysis is becoming a necessary task for analyzing the customer’s
behavior in order to improve advertising and sales as well as for datasets like environment, medical,
banking system it is important to analyze the log data to get required knowledge from it. Web mining is the
process of discovering the knowledge from the web data. Log files are getting generated very fast at the
rate of 1-10 Mb/s per machine, a single data center can generate tens of terabytes of log data in a day.
These datasets are huge. In order to analyze such large datasets we need parallel processing system and
reliable data storage mechanism. Virtual database system is an effective solution for integrating the data
but it becomes inefficient for large datasets. The Hadoop framework provides reliable data storage by
Hadoop Distributed File System and MapReduce programming model which is a parallel processing
system for large datasets. Hadoop distributed file system breaks up input data and sends fractions of the
original data to several machines in hadoop cluster to hold blocks of data. This mechanism helps to
process log data in parallel using all the machines in the hadoop cluster and computes result efficiently.
The dominant approach provided by hadoop to “Store first query later”, loads the data to the Hadoop
Distributed File System and then executes queries written in Pig Latin. This approach reduces the response
time as well as the load on to the end system. This paper proposes a log analysis system using Hadoop
MapReduce which will provide accurate results in minimum response time.
SERVICE DISCOVERY – A SURVEY AND COMPARISONijujournal
The document summarizes and compares several major service discovery approaches. It provides an overview of service discovery objectives and techniques, then surveys prominent protocols including SLP, Jini, and UPnP. Each approach is analyzed based on features like service description, discovery architecture, announcement/query mechanisms, and how they handle service usage and dynamic network changes. The comparison aims to identify strengths and limitations to guide future research in improving service discovery.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PERVASIVE COMPUTING APPLIED TO THE CARE OF PATIENTS WITH DEMENTIA IN HOMECARE...ijujournal
The aging population and the consequent increase in the incidence of dementias is causing many
challenges to health systems, mainly related to infrastructure, low services quality and high costs. One
solution is to provide the care at house of the patient, through of home care services. However, it is not a
trivial task, since a patient with dementia requires constant care and monitoring from a caregiver, who
suffers physical and emotional overload. In this context, this work presents an modelling for development of
pervasive systems aimed at helping the care of these patients in order to lessen the burden of the caregiver
while the patient continue to receive the necessary care.
A proposed Novel Approach for Sentiment Analysis and Opinion Miningijujournal
as the people are being dependent on internet the requirement of user view analysis is increasing
exponentially. Customer posts their experience and opinion about the product policy and services. But,
because of the massive volume of reviews, customers can’t read all reviews. In order to solve this problem,
a lot of research is being carried out in Opinion Mining. In order to solve this problem, a lot of research is
being carried out in Opinion Mining. Through the Opinion Mining, we can know about contents of whole
product reviews, Blogs are websites that allow one or more individuals to write about things they want to
share with other The valuable data contained in posts from a large number of users across geographic,
demographic and cultural boundaries provide a rich data source not only for commercial exploitation but
also for psychological & sociopolitical research. This paper tries to demonstrate the plausibility of the idea
through our clustering and classifying opinion mining experiment on analysis of blog posts on recent
product policy and services reviews. We are proposing a Nobel approach for analyzing the Review for the
customer opinion
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
USABILITY ENGINEERING OF GAMES: A COMPARATIVE ANALYSIS OF MEASURING EXCITEMEN...ijujournal
Usability engineering and usability testing are concepts that continue to evolve. Interesting research studies
and new ideas come up every now and then. This paper tests the hypothesis of using an EDA-based
physiological measurements as a usability testing tool by considering three measures; which are observers‟
opinions, self-reported data and EDA-based physiological sensor data. These data were analyzed
comparatively and statistically. It concludes by discussing the findings that has been obtained from those
subjective and objective measures, which partially supports the hypothesis.
SECURED SMART SYSTEM DESING IN PERVASIVE COMPUTING ENVIRONMENT USING VCSijujournal
Ubiquitous Computing uses mobile phones or tiny devices for application development with sensors
embedded in mobile phones. The information generated by these devices is a big task in collection and
storage. For further, the data transmission to the intended destination is delay tolerant. In this paper, we
made an attempt to propose a new security algorithm for providing security to Pervasive Computing
Environment (PCE) system using Public-key Encryption (PKE) algorithm, Biometric Security (BS)
algorithm and Visual Cryptography Scheme (VCS) algorithm. In the proposed PCE monitoring system it
automates various home appliances using VCS and also provides security against intrusion using Zigbee
IEEE 802.15.4 based Sensor Network, GSM and Wi-Fi networks are embedded through a standard Home
gateway.
PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have
elaborated several routing protocols that possess different performance levels. In this paper we give a
performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing
protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their
performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to
End Delay, Normalised Routing Load and Average Throughput.
The document compares the performance of various optical character recognition (OCR) tools. It analyzes eight OCR tools - Online OCR, Free Online OCR, OCR Convert, Convert image to text.net, Free OCR, i2OCR, Free OCR to Word Convert, and Google Docs. The document provides sample outputs of each tool processing the same input image. It then evaluates the tools based on character accuracy, character error rate, special symbol accuracy, and special symbol error rate to determine which tools most accurately convert images to editable text.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
Learn SQL from basic queries to Advance queriesmanishkhaire30
Dive into the world of data analysis with our comprehensive guide on mastering SQL! This presentation offers a practical approach to learning SQL, focusing on real-world applications and hands-on practice. Whether you're a beginner or looking to sharpen your skills, this guide provides the tools you need to extract, analyze, and interpret data effectively.
Key Highlights:
Foundations of SQL: Understand the basics of SQL, including data retrieval, filtering, and aggregation.
Advanced Queries: Learn to craft complex queries to uncover deep insights from your data.
Data Trends and Patterns: Discover how to identify and interpret trends and patterns in your datasets.
Practical Examples: Follow step-by-step examples to apply SQL techniques in real-world scenarios.
Actionable Insights: Gain the skills to derive actionable insights that drive informed decision-making.
Join us on this journey to enhance your data analysis capabilities and unlock the full potential of SQL. Perfect for data enthusiasts, analysts, and anyone eager to harness the power of data!
#DataAnalysis #SQL #LearningSQL #DataInsights #DataScience #Analytics
Global Situational Awareness of A.I. and where its headedvikram sood
You can see the future first in San Francisco.
Over the past year, the talk of the town has shifted from $10 billion compute clusters to $100 billion clusters to trillion-dollar clusters. Every six months another zero is added to the boardroom plans. Behind the scenes, there’s a fierce scramble to secure every power contract still available for the rest of the decade, every voltage transformer that can possibly be procured. American big business is gearing up to pour trillions of dollars into a long-unseen mobilization of American industrial might. By the end of the decade, American electricity production will have grown tens of percent; from the shale fields of Pennsylvania to the solar farms of Nevada, hundreds of millions of GPUs will hum.
The AGI race has begun. We are building machines that can think and reason. By 2025/26, these machines will outpace college graduates. By the end of the decade, they will be smarter than you or I; we will have superintelligence, in the true sense of the word. Along the way, national security forces not seen in half a century will be un-leashed, and before long, The Project will be on. If we’re lucky, we’ll be in an all-out race with the CCP; if we’re unlucky, an all-out war.
Everyone is now talking about AI, but few have the faintest glimmer of what is about to hit them. Nvidia analysts still think 2024 might be close to the peak. Mainstream pundits are stuck on the wilful blindness of “it’s just predicting the next word”. They see only hype and business-as-usual; at most they entertain another internet-scale technological change.
Before long, the world will wake up. But right now, there are perhaps a few hundred people, most of them in San Francisco and the AI labs, that have situational awareness. Through whatever peculiar forces of fate, I have found myself amongst them. A few years ago, these people were derided as crazy—but they trusted the trendlines, which allowed them to correctly predict the AI advances of the past few years. Whether these people are also right about the next few years remains to be seen. But these are very smart people—the smartest people I have ever met—and they are the ones building this technology. Perhaps they will be an odd footnote in history, or perhaps they will go down in history like Szilard and Oppenheimer and Teller. If they are seeing the future even close to correctly, we are in for a wild ride.
Let me tell you what we see.
Analysis insight about a Flyball dog competition team's performanceroli9797
Insight of my analysis about a Flyball dog competition team's last year performance. Find more: https://github.com/rolandnagy-ds/flyball_race_analysis/tree/main
State of Artificial intelligence Report 2023kuntobimo2016
Artificial intelligence (AI) is a multidisciplinary field of science and engineering whose goal is to create intelligent machines.
We believe that AI will be a force multiplier on technological progress in our increasingly digital, data-driven world. This is because everything around us today, ranging from culture to consumer products, is a product of intelligence.
The State of AI Report is now in its sixth year. Consider this report as a compilation of the most interesting things we’ve seen with a goal of triggering an informed conversation about the state of AI and its implication for the future.
We consider the following key dimensions in our report:
Research: Technology breakthroughs and their capabilities.
Industry: Areas of commercial application for AI and its business impact.
Politics: Regulation of AI, its economic implications and the evolving geopolitics of AI.
Safety: Identifying and mitigating catastrophic risks that highly-capable future AI systems could pose to us.
Predictions: What we believe will happen in the next 12 months and a 2022 performance review to keep us honest.
Beyond the Basics of A/B Tests: Highly Innovative Experimentation Tactics You...Aggregage
This webinar will explore cutting-edge, less familiar but powerful experimentation methodologies which address well-known limitations of standard A/B Testing. Designed for data and product leaders, this session aims to inspire the embrace of innovative approaches and provide insights into the frontiers of experimentation!
End-to-end pipeline agility - Berlin Buzzwords 2024Lars Albertsson
We describe how we achieve high change agility in data engineering by eliminating the fear of breaking downstream data pipelines through end-to-end pipeline testing, and by using schema metaprogramming to safely eliminate boilerplate involved in changes that affect whole pipelines.
A quick poll on agility in changing pipelines from end to end indicated a huge span in capabilities. For the question "How long time does it take for all downstream pipelines to be adapted to an upstream change," the median response was 6 months, but some respondents could do it in less than a day. When quantitative data engineering differences between the best and worst are measured, the span is often 100x-1000x, sometimes even more.
A long time ago, we suffered at Spotify from fear of changing pipelines due to not knowing what the impact might be downstream. We made plans for a technical solution to test pipelines end-to-end to mitigate that fear, but the effort failed for cultural reasons. We eventually solved this challenge, but in a different context. In this presentation we will describe how we test full pipelines effectively by manipulating workflow orchestration, which enables us to make changes in pipelines without fear of breaking downstream.
Making schema changes that affect many jobs also involves a lot of toil and boilerplate. Using schema-on-read mitigates some of it, but has drawbacks since it makes it more difficult to detect errors early. We will describe how we have rejected this tradeoff by applying schema metaprogramming, eliminating boilerplate but keeping the protection of static typing, thereby further improving agility to quickly modify data pipelines without fear.
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data LakeWalaa Eldin Moustafa
Dynamic policy enforcement is becoming an increasingly important topic in today’s world where data privacy and compliance is a top priority for companies, individuals, and regulators alike. In these slides, we discuss how LinkedIn implements a powerful dynamic policy enforcement engine, called ViewShift, and integrates it within its data lake. We show the query engine architecture and how catalog implementations can automatically route table resolutions to compliance-enforcing SQL views. Such views have a set of very interesting properties: (1) They are auto-generated from declarative data annotations. (2) They respect user-level consent and preferences (3) They are context-aware, encoding a different set of transformations for different use cases (4) They are portable; while the SQL logic is only implemented in one SQL dialect, it is accessible in all engines.
#SQL #Views #Privacy #Compliance #DataLake
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data Lake
Gateway Based Multi-Hop Distributed Energy Efficient Clustering Protocol for Heterogeneous Wireless Sensor Networks
1. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
DOI:10.5121/iju.2015.6402 13
Gateway Based Multi-Hop Distributed Energy
Efficient Clustering Protocol for Heterogeneous
Wireless Sensor Networks
Sheenam1
and Rupinder Kaur2
M. Tech Research Scholar1
, Assistant Professor2
1, 2
Department of Electronics and Communication Engineering, Punjabi University,
Patiala, India
ABSTRACT
Wireless sensor network consists of application oriented and cheap micro-devices called sensors nodes
having potential of connecting the physical world with virtual world by their sensing abilities. These sensor
nodes are having restrained battery sources. Efficient energy management is current area of research in
wireless sensor networks. Here we advice one such energy aware multi-hop protocol (G-DEEC) for two
level heterogeneous networks. In G-DEEC, the Base Station is placed out of sensing area and rechargeable
gateway nodes are placed inside field with other randomly deployed sensor nodes. Simulation shows the
proposed protocol G-DEEC is better than single-hop DEEC in terms of number of half dead nodes, alive
nodes and dead nodes; thereby showing improvement in network lifetime and stability.
KEYWORDS
Wireless sensor network, DEEC, lifetime, half dead nodes, alive nodes, stability, gateway.
1. INTRODUCTION
Ongoing advancements in VLSI and MEMS (Micro-electro-mechanical Systems) lead to
manufacture of sensor networks in large numbers. Sensors have many applications depending on
the application they are being used for like forest fire detection in forests, enemy tracking in
military areas; they are also used for monitoring temperature, pressure, intensity, chemical
concentrations, tracking objects. Sensors are also useful in medical science for monitoring vital
body functions [1]. Sensor nodes mainly consists of sensor with analog to digital converter
(ADC) which sense the outer environment defending on application they are being used for; then
the converter converts the sensed analog data to digital form as shown in figure 1. ADC forward
the converted data to processor for processing of data and finally to trans-receiver antennas for
sending to final Base station.
Figure 1. The components of Sensor Node
Sensor +
ADC
Processor +
Storage
Trans-
Receiver
POWER SUPPLY
2. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
14
Sensors are randomly scattered in sensing field connected other sensor nodes and finally
connected to base station. In conventional protocols like DT and MTE, data is transmitted directly
from sensor nodes to base station (BS) and one node to neighboring node respectively [2]. So
nodes away to BS die more often as compared to other nodes as they are require more energy in
transmitting data in DT. Nodes near to BS are more probable to transfer data in MTE; so nodes
near to BS die more often. Here comes the concept of clustering introduced in LEACH [3] in
network field where a group of nodes are grouped together in one cluster with one Cluster head
(CH). CH will aggregate the collected data and further transfer this data to BS. Wireless
communication architecture as shown in figure 2 consists of nodes like A, B, C, D, E etc scattered
in sensing field. If want to send data to BS; it follows multi-hop routing i.e. A send data to B and
then to C and so on finally to BS.
Figure 2. Architecture of multi-hop sensor network
LEACH introduced clustering in homogeneous sensor networks where each sensor node is having
same initial energy levels. Routing of data in sensor networks is done through many
homogeneous and heterogeneous routing protocols. Homogeneous protocols include LEACH [3],
PEGASIS [18], HEED [19], TEEN [16, 21], M-GEAR [23] whereas heterogeneous protocols
include SEP [4], DEEC [5], DDEEC [6], E-DEEC [22], DEEC-WIN [12], SEARCH [14].
Homogeneous protocols have all nodes of same type in terms of size, shape and mode of energy
supply whereas a heterogeneous protocol utilizes the energy discrimination of sensor nodes.
Heterogeneous protocols are helpful in increasing the network lifetime compared to homogeneous
protocols. As the sensor nodes are energy constrained in terms of battery power [17, 20] so here
we introduce the gateway based multi-hop protocol where 9 gateway nodes are placed in sensor
field in systematic manner so that the CH of each cluster formed is near to the gateway node.
Deployment of gateway nodes reduces the transmission distance from sensor nodes to BS;
thereby increasing the number of half dead nodes, alive nodes. Election of CH is done on basis of
ratio of residual energy to average energy making the transmission more reliable.
2. RELATED WORK
In [3], clustering was introduced for homogeneous sensor networks unlike conventional protocols
like DT, MTE in order to increase the network lifetime of homogeneous sensor networks. Here
the role of CH is rotated so that only one node doesn’t keep on draining it initial energy level.
Simulation performed showed improvement in stability period of homogeneous sensor networks.
3. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
15
In [4], clustering was used for heterogeneous sensor networks by proposing a new protocol SEP
unlike LEACH, PEGASIS [18], HEED [19] etc. CH is chosen on basis of initial energy of sensor
nodes. Two level heterogeneity is been considered i.e. normal nodes and advance nodes with
additional energy. As advance nodes are having higher energy levels than normal nodes so they
are more probable to become CH in each transmitting round. Simulation performed showed
improvement in stability than LEACH.
In [5], distributed energy efficient clustering (DEEC) was proposed for heterogeneous wireless
sensor networks. CHs are chosen based on residual energy unlike SEP where they are chosen
based on initial energy. Simulation performed showed improvement in stability and lifetime of
network as compared to SEP.
In [6], developed distributed energy efficient clustering (DDEEC) was proposed for
heterogeneous wireless networks which balances the selection of CHs over entire sensor field.
Here an improvement in CH selection as compared to DEEC is been done where advance nodes
are equally probable of becoming CHs as normal nodes after energy depletion. Simulation
performed showed improvement in stability period as compared to DEEC.
In [7], balanced and centralized distributed energy efficient clustering (BCDEEC) for
heterogeneous wireless sensor networks is been proposed which is an extension of DEEC.
Simulation performed showed improvement in stability period as compared to DEEC and SEP.
In [8], SEP was extended to three-level heterogeneity by considering normal nodes, intermediate
nodes and advance nodes with different energy levels in protocol named SEP-E. Simulation
performed showed improvement in terms of throughput and stability (First node dead) as
compared to LEACH.
In [9], heterogeneity aware hierarchical stable election protocol was proposed which tends to
increase lifetime of Wireless sensor networks (WSNs) by reducing transmission cost between CH
and BS. Two types of CHs are considered i.e. primary and secondary CHs. Secondary ones are
chosen from primary ones. Simulation performed showed improvement in network lifetime as
compared to LEACH, SEP and DEEC.
In [10], Away cluster head scheme (ACH), was proposed foe heterogeneous wireless sensor
networks which consider number of sensor nodes similar in all clusters so that energy dissipated
is similar for all clusters and nodes are considered normal if distance from nearby CH is less than
12m, otherwise they are called as advance nodes. Simulation performed showed improvement in
average residual energy as compared to LEACH and SEP.
In [11], Cluster head re-election protocol (CRP), was proposed where re-election of CHs is done
from elected ones on basis of residual energy. Simulation performed showed improvement in
residual energy deviation as compared to LEACH and SEP.
In [12], DEEC with Isolated Nodes (DEEC-WIN) was proposed where mechanism of nodes
joining a cluster is improved. Some nodes near to BS communicate directly to BS. Simulation
performed improvement as compared to DEEC.
4. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
16
In [13], Energy efficient two level distributed clustering (EE-TDLC) scheme, was proposed to
save transmission cost by considering secondary level CHs after primary CHs. Simulation
performed showed improvement in number of CHs and improvement in stability period.
3. SYSTEM MODEL OF PROPOSED PROTOCOL (G-DEEC)
3.1 Basic assumptions of proposed protocol G-DEEC
1. BS is placed out of network field which is stationary after deployment.
2. Bs is location aware and aware about location of other sensor nodes
3. Each sensor node is provided with different identity in network area called as sensor ID
(Identifier).
4. Location of gateway nodes is been decided before deployment such that each CH
formed is near to gateway node.
5. Gateway nodes are rechargeable and stationary after placement.
6. Transmission distance is reduced between CHs and BS with aid of gateway nodes.
7. Sensor nodes are uniformly distributed over network field.
8. Two level heterogeneous nodes are deployed i.e. normal nodes and advance nodes.
Figure 3. Network model of proposed G-DEEC
○ Normal nodes
◊ Advanced nodes
× Base Station
* Gateway nodes
Here we used first order radio dissipation model as used in LEACH [3] as shown in figure 4. This
model describes the amount of energy dissipated in transmitting, receiving and fusing data from
sensor nodes to Base station. Energy dissipated by transmitter is higher than receiver. The energy
consumption in transmitting l- bit data packet at distance d is given as
( ) { (1)
5. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
17
Figure 4. Radio dissipation model
Where is amount of energy dissipated per bit to run electronic circuit. is free space path
loss and is multi path attenuation constant depending on model. Here d is distance between
two interacting ends and is threshold distance calculated as
√ (2)
3.2 THE G-DEEC PROTOCOL
In this research we proposed a heterogeneity aware multi-hop energy efficient clustered protocol
for WSNs. G-DEEC (Gateway based multi-hop DEEC), where gateway are stationary battery
rechargeable sensor nodes which are deployed at center of boundaries, corners and middle of
sensor field so that the CH from each cluster is each approachable to gateway node. Data
transmission in G-DEEC follows multi-hop data transmission i.e. CHs collect and aggregate all of
data coming from sensor node members of their cluster and forward this data for further
processing to gateway nodes; whose function is to process the collected data from CHs and pass
this data to BS. Gateway nodes reduce traffic problems and increase the rate of data transmission.
As number of gateways are deployed in network field, increases reliability of network from
failures of gateway node as if one gateway node is blocked or damaged in particular case; another
nearby located gateway node can do the network operations. Data may follow DT (Direct
Transmission) in case they are near to BS or near to gateway node. This protocol considers two
types of sensor nodes in terms of energy levels i.e. normal nodes and m fraction of advance
nodes.
Total energy = Energy of normal nodes + Energy of advance nodes
= n (1-m) +nm (1+ ) = n (1+m ) (3)
where n is total number of nodes and is initial energy of normal nodes and m is fraction of
advance nodes having extra energy than normal nodes. CHs are elected based on ratio of
residual energy and average energy of network as in DEEC [5]. Different election probabilities
are considered for normal nodes and advance nodes as:
Transmitter TX
Amplifier
Receiver
L- bit (l, d)
( )
L-bit
d
6. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
18
(4)
( ) (5)
Where is residual energy and is ideal average energy that each node should own to keep
network alive to longer extent.
( ) (6)
Where r is current round and R is the total number of processing rounds. After election of CHs
per round, a single CH is selected per round based on random number generated and comparing
this number with threshold value ( ) for normal nodes and ( ) for advance nodes as in
equation below:
( ) { * ( )+
} (7)
( ) { [ ( )]
} (8)
Where r is round number of current processing and g’ is set of normal nodes not been cluster
heads in last ⁄ rounds and g’’ is set of advance nodes not been cluster heads in last ⁄
rounds.
4. PERFORMANCE EVALUATION
4.1 Simulation settings
In order to improve the performance of G-DEEC, we simulated our proposed G-DEEC protocol
in MATLAB. We consider a 100m*100m wireless sensor network field comprised of 100 nodes
deployed uniformly over it with some pre-planned Gateway nodes. BS is deployed 25m away
from top sensor area boundary. BS is stationary at its place and gateway nodes are also non-
movable but rechargeable to increase the number of alive nodes so as to increase the network
lifetime. To assess the performance of proposed G-DEEC with DEEC, we ignore the interference
in transmission channels. We consider packet size of 4000 bits. 9 Gateway Nodes are located at
predefined distance covering the network field. Data can be transmitted directly to BS in case
they are near to BS than the CH or gateway node. Simulation parameters are given in Table 1.
4.2 Performance metrics
4.2.1 Network lifetime- This is defined as time till network is operational and calculated from
number of half dead nodes, dead nodes, alive nodes.
4.2.1.1 Half Dead nodes (HDN) - These are defined as nodes which are partially dead and
partially alive and still perform network operations. They need to high in number to increase
network lifetime. Total HDN comprised of NHDN (Normal half dead nodes) and AHDN
(Advance half dead nodes).
7. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
19
4.2.1.2 Dead nodes (DN) - These are nodes with no energy left for processing. They need to be
low in number for increasing network lifetime. Total DN comprised of NDN (Normal dead
nodes) and ADN (Advance dead nodes).
4.2.1.3 Alive nodes (AN) - These are defined as nodes having some left energy after processing
so these nodes can still be part of network operations. They need to be high in number to increase
network lifetime. Total AN comprised of NAN (Normal alive nodes) and AAN (Advance alive
nodes).
4.2.2 First node dead (FND) - This is defined as time interval between start of processing
rounds till first node becoming dead. Late the round of dying first node arrives, higher the
stability of network.
4.2.3 Remaining energy- This is defined as leftover energy per processing round. Higher this
energy increases the network lifetime as network will be operational for much longer time.
4.2.4 Packet transmission- This is defined as amount of data exchanged between CHs and BS.
The rate of data transmission from sensor nodes to CH and further to BS via CH; gateway or
directly is considered.
4.3 Simulation results and Analysis
4.3.1 Network lifetime: Following in this section we are analyzing the network lifetime in
terms of HDN, DN, AN.
4.3.1.1 Analysis of HDN (Half Dead Nodes) - In figure 5, Total number of half dead nodes in
DEEC and proposed DEEC is shown. The number is zero in DEEC which is coming out to be 60
in proposed G-DEEC at 2000 iteration showing 60% overall improvement in half dead nodes.
Figure 6 shows number of normal half dead nodes in DEEC and proposed G-DEEC. As m= .2
means 80 normal nodes and 20 advance nodes initially. Normal nodes becoming half dead are
zero in DEEC at 2000 iteration and 60 in G-DEEC showing 75% overall improvement in normal
half dead nodes. Figure 7 shows number of advance half dead nodes in DEEC and G-DEEC
respectively. There are 20 advance nodes initially which reduced to zero at 2000 iteration in both
DEEC and G-DEEC showing zero improvement in number of advance half dead nodes.
Figure 5. Total number of HDN
8. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
20
Figure 6. Number of NHDN
Figure 7. Number of AHDN
4.3.1.2 Analysis of DN (Dead Nodes) – Figure 8 shows number of dead nodes in DEEC and G-
DEEC. At 2000 iteration the numbers of dead nodes are 80 in DEEC and 17 in G-DEEC. This
high amount of reduction in number of dead nodes shows 63% improvement in lifetime. Figure 9
shows the number of normal dead nodes. Normal nodes were 80 initially which are maintained to
be still 80 in DEEC showing no improvement and reduced to 17 in G-DEEC showing 78.75 %
improvement in lifetime. Reduction in number of dead nodes increases network lifetime.
9. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
21
Figure 8. Total number of DN
Figure 9. Number of NDN
Figure 10 shows number of advance dead nodes in DEEC and G-DEEC. Initial there were 20
advance nodes which are reduced to zero in both DEEC and G-DEEC showing zero overall
improvement.
10. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
22
Figure 10. Number of AND
4.3.1.3 Analysis of AN (Alive Nodes) - Figure 11 shows number of total alive nodes in both
DEEC and G-DEEC. The number is 20 in DEEC and 83 in G-DEEC. This rise of alive node
number increases lifetime by 63%. Figure 12 shows the number of normal alive nodes which are
initially 80. The number is 0 in DEEC and 60 in G-DEEC showing 75% improvement.
Figure 11. Number of total AN
11. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
23
Figure 12. Number of NAN
Figure 13 shows number of advance alive nodes in DEEC and G-DEEC. The number is 20
initially which is still 20 in both protocols showing no improvement.
Figure 13. Number of AAN
4.3.2 Analysis of First Dead Node (Stability) - Figure 14 shows bar graph of the time interval
till first node dies. The round at which first node died in DEEC is 1242 and 1369 in G-DEEC
showing 6.35% increase in stability.
12. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
24
Figure 14. First Node Dead
4.3.3 Analysis of Remaining Energy- Figure 15 shows the network remaining energy per round.
The energy remained is 0 joules in DEEC at 1500 iteration and 0.05 joules in G-DEEC showing
10% increase in remaining energy as initial energy was 0.5 joules. The network parameters
considered in research are given in Table 1.
Figure 15. Remaining Energy
13. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
25
Table 1. Network parameters
Parameters Definition Values
n Population of sensor nodes 100
Initial energy of sensor nodes 0.5J
Optimal Probability 0.1
Transmitter / Receiver electronics energy 50nJ/ bit
EDA Data aggregation energy 5nJ/bit/signal
Energy consumed by transmit amplifier at shorter
distance
10pJ/bit/m2
Energy consumed by transmit amplifier at longer
distance
0.0013pJ/bit/m4
Threshold distance 70m
m Fraction of advance nodes 0.2
α Fraction of extra energy 3
4.3.4 Analysis of packets transmission: Figure 16 shows the count of packet transmission from
to CH. At 2000 iteration, 80 packets are sent to CH in G-DEEC whereas the number is 20 in
DEEC. Each packet is of 4000 bit length.
Figure 16. Packets transmission to CH
Figure 17 shows the packets transmission to Base station. The number is 3 in DEEC and 13 in G-
DEEC.
14. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
26
Figure 17. Packets transmission to BS
Table 2. Simulation Results
Performance metric DEEC G-DEEC Overall
Improvement (%)
Number of HDN (Total) 0 60 60
Number of NHDN 0 60 75
Number of AHDN 0 0 0
Number of DN (Total) 80 17 63
Number of NDN 80 17 78.75
Number of AND 0 0 0
Number of AN (Total) 20 83 63
Number of NAN 0 60 75
Number of AAN 20 20 0
FND (Stability) 1242 1369 6.35
Remaining Energy (joules) 0 0.05 10
15. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
27
5. CONCLUSIONS AND FUTURE SCOPE
In this research we proposed a multi-hop DEEC in order to increase the number of alive nodes
and half dead nodes and decrement in dead nodes. Simulation performed in MATLAB shows
60%, 63%, 63% improvement in number of half dead nodes, Dead nodes and alive nodes resp. in
return giving 62% on an average improvement in lifetime, 6.35% improvement in stability and
10% in remaining energy. This work can further be extended to improvement in threshold levels
and CH selection criteria.
REFERENCES
[1] Q. Wang and I. Balasingham, (2010) “Wireless sensor networks: Application centric design”, Journal
of Communications, vol. 2, no.5, pp. 134-149.
[2] J. Yick, B. Mukherjee and D. Ghosal, (2008) "Wireless sensor network survey", Journal of Computer
Networks, vol. 52, no.2, pp. 2292-2330.
[3] W.R. Heinzelman, A. Chandrakasan and H. Balakrishnan, (2000) “Energy-efficient communication
protocol for wireless microsensor networks”, In Proc. International Conference on System Sciences,
pp. 4-7, Maui, Hawaii.
[4] G. Smaragdakis, I. Matta and A. Bestavros, (2004) “SEP: A Stable Election Protocol for Clustered
Heterogeneous Wireless Sensor Networks”, In Proc. of IEEE International Workshop on SANPA, pp.
1–11, Boston.
[5] L. Qing, Q. Zhu and M. Wang, (2006) ”Design of a distributed energy-efficient clustering algorithm
for heterogeneous wireless sensor networks”, Journal of Computer Communications, vol. 29, no.4,
pp. 2230-2237.
[6] B. Elbhiri, S. Rachid, S. El Fkihi and D. Aboutajdine, “Developed distributed energy-efficient
clustering (DDEEC) for heterogeneous wireless sensor networks”, In proc. IEEE 5th International
Symposium on I/V Communications and Mobile Network, pp. 1-4.,Rabat, 2010.
[7] S.B. Alla, A. Ezzati, A. Mouhsen, A.B. Hssane and M.L. Hasnaoui, (2011) ”Balance and centralized
energy efficient clustering for heterogeneous wireless sensor networks”, In proc. IEEE 3rd
International conference on next generation networks and services, pp .39-44, Hammamet.
[8] M.M. Islam, M.A. Matin, and T.K Mondol, (2012) “Extended stable election protocol for three-level
hierarchical clustered heterogeneous WSN”, In Proc. of IET Conference on Wireless Sensor Systems,
pp. 1-4, London, England.
[9] A.A. Khan, N. Javaid, U. Qasim, Z. Lu and Z. A. Khan, (2012) “HSEP: Heterogeneity-Aware
Hierarchical Stable Election Protocol for WSNs”, In Proc. IEEE International Conference on
Broadband and Wireless Computing, Communication and Applications, pp. 373-378, Victoria,
Canada.
[10] N. Javaid, M. Waseem, Z. A. Khan, U. Qasim, K. Latif and A. Javaid, (2013) ”ACH: Away cluster
heads scheme for energy efficient clustering protocols in WSNs”, In proc. IEEE Saudi International
Conference on Electronics, Communications and Photonics, pp.1-4, Fira.
[11] R. Tandon and S. Nandi, (2013) ”CRP: Cluster head Re-election protocol for heterogeneous wireless
sensor networks”, In proc. IEEE 5th International conference on communication systems and
networks, pp. 1-10, Bangalore.
[12] Z. Kaili, Z. Lihua, Wang Xu, (2013) ”An Improved DEEC Algorithm with Isolated nodes”, In proc.
International conference on Information and Communication Technologies IETICT, pp. 228-232,
Beijing.
[13] M. Kaur, A. Jain and A.K. Goel, (2014) ”Energy efficient two level distributed clustering scheme to
prolong stability period of wireless sensor network”, In proc. IEEE International Conference on
Advances in Computing, Communication and Informatics, pp. 68-73, New Delhi, India.
[14] M.Y. Wang, J. Ding, W.P. Chen and W.Q. Guan, (2015)”SEARCH: A stochastic election approach
for heterogeneous wireless sensor networks”, IEEE Communication letters, vol.9, no.3, pp. 443-446.
16. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
28
[15] J. Ibriq and I. Mahgoub, (2004) “Cluster-based routing in wireless sensor networks: issues and
challenges”, In proc. IEEE International Symposium on Performance Evaluation of Computation and
Telecommunication System, pp. 25-29, San Jose, California.
[16] M. Omari, N. Tiouririne and D. Dahmila, (2012) “Simulation of the TEEN and the SPIN protocols in
a wireless sensor network environment”, Journal of Telecommunication, vol. 3, no. 5, pp. 9-15.
[17] F.A. Aderohunmu, (2010) “Energy Management Techniques in Wireless Sensor Networks: Protocol
Design and Evaluation”, M.S. thesis, Otago University, New Zealand.
[18] S. Lindsey, C.S. Raghavendra, (2002)”PEGASIS: Power-Efficient Gathering in Sensor Information
Systems” IEEE Proceedings on Aerospace, vol. 3, no.2, pp.1-6.
[19] O. Younis, S. Fahmy, (2004) ” HEED: A hybrid, energy efficient, distributed clustering approach for
ad hoc sensor networks” IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 660-669.
[20] B.M. Lee, H.M. Hsieh, J.T. Wang, K. L. Hsiao, (2014)” Note for LC Oscillator Power Management
for Wireless Network Sensors Technique, Energy and Power Engineering Science, pp. 17-21.
[21] A. Manjeshwar and D.P Agrawal, (2001) “TEEN: A routing protocol for enhanced efficiency in
wireless sensor networks”, In proc. IEEE International Parallel and Distributed Processing
Symposium, pp. 2009 -2015, San Francisco, California.
[22] P. Saini and A. K. Sharma, (2010) “E-DEEC- Enhanced distributed energy efficient clustering
scheme for heterogeneous WSN”, In proc. IEEE 1st International Conference on Parallel, Distributed
and Grid Computing, pp. 205-210, Solan.
[23] Q. Nadeem, M.B. Rasheed, N. Javaid, Z.A Khan, Y. Maqsood and A. Din, (2013) “M-GEAR:
Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs”, In proc. IEEE International
Conference on Broadband, Wireless Computing, Communication and Applications, pp. 164-169,
Compiegne, France.
Authors
SHEENAM received her Bachelor’s of Technology in Electronics and Communication
Engineering from SVIET, Banur affiliated to Punjab Technical University, Jalandhar,
Punjab, India in 2012, and currently doing final semester of Masters of Technology in
Electronics and Communication Engineering from Punjabi University, Patiala, Punjab,
India. She yet has published one paper on wireless sensor networks. Her research interests
include energy management in wireless sensor networks etc.
RUPINDER KAUR is currently working as Assistant professor at Punjabi University,
Patiala, Punjab, India. She received her Masters of Technology in Electronics and
Communication Engineering from Guru Nanak Dev University, Amritsar, Punjab, India in
2012. She has 3 years of teaching experience. Her research interests include wireless
communication etc.