The document summarizes a cell-based clustering algorithm proposed for large wireless sensor networks to reduce energy consumption. The key points are:
1. The target field is divided into small hexagonal cells, with sensor nodes in each cell forming a cluster.
2. A low-overhead algorithm is presented for electing cluster heads within each cell based on node energy levels.
3. An optimal inter-cluster routing algorithm is also proposed to establish communication between adjacent cell clusters using the fewest hops.
4. The performance of the cell-based clustering algorithm is evaluated against the GAF algorithm, showing it generates approximately the same number of clusters but with shorter average inter-cluster path lengths, extending
This document summarizes an academic paper that proposes a new Energy Minimized Opportunistic Routing (EMOR) protocol for wireless sensor networks. EMOR aims to enhance source location privacy and minimize energy usage. It uses opportunistic routing to dynamically change paths from source to destination, hiding the source location. Additionally, EMOR reduces transmission power of each node to minimize energy consumption while still reliably transmitting packets. The paper reviews related work on source privacy and energy efficiency in wireless routing protocols and presents simulation results showing EMOR provides better source privacy compared to existing opportunistic routing while also reducing energy usage.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Ne...IDES Editor
A reliable routing protocol for wireless sensor
networks (WSN) should be capable of adjusting to
constantly varying network conditions while conserving
maximum power. Existing Routing protocols provide
reliability at the cost of high energy consumption. In this
paper, we propose to develop an Adaptive Energy Efficient
Reliable Routing Protocol (AEERRP) with the aim of
keeping the energy consumption low while achieving high
reliability. In our proposed protocol, the data forwarding
probability is adaptively adjusted based on the measured
loss conditions at the sink. So only for high loss rates, a node
makes use of high transmission power to arrive at the sink.
Whenever the loss rate is low, it adaptively lessens the
transmission power. Since the source rebroadcasts the data,
until the packet loss is minimized, high data reliability is
achieved. By simulation results we show that the proposed
protocol achieves high reliability while ensuring low energy
consumption and overhead.
The document discusses topology issues in wireless sensor networks. It defines two main categories of topology issues - topology control problems and topology awareness problems. Topology control problems involve maintaining sensor coverage topology and sensor connectivity topology. Approaches for sensor coverage include controlling node density and positioning for static, mobile, and hybrid sensor networks. Sensor connectivity approaches use power control and power management mechanisms. Topology awareness problems involve geographic routing to efficiently route packets based on node locations and addressing sensor holes that can disrupt routing. The document provides a taxonomy of topology issues and surveys various approaches studied in the literature to optimize wireless sensor network topology.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
The document describes localized, self-organizing approaches for constructing energy-efficient data aggregation trees in sensor networks. It proposes Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs) that use localized structures like LMST and RNG to approximate a minimum spanning tree. L-PEDAP then constructs an actual routing tree over these structures using localized parent selection strategies. Simulation results show L-PEDAP can achieve close to 90% of a theoretical upper bound on network lifetime derived in the paper, outperforming centralized solutions while meeting requirements like distributed operation, scalability, and robustness to failures.
Spread Spectrum Based Energy Efficient Wireless Sensor NetworksIDES Editor
The Wireless Sensor Networks (WSN) is
considered to be one of the most promising emerging
technologies. However one of the main constraints which
is holding back its wide range of applications is the
battery life of the sensor node and thus effecting the
network life. A new approach to this problem has been
presented in this paper. The proposed method is suitable
for event driven applications where the event occurrence
is very rare. The system uses spread spectrum as a means
of communication.
This document summarizes an academic paper that proposes a new Energy Minimized Opportunistic Routing (EMOR) protocol for wireless sensor networks. EMOR aims to enhance source location privacy and minimize energy usage. It uses opportunistic routing to dynamically change paths from source to destination, hiding the source location. Additionally, EMOR reduces transmission power of each node to minimize energy consumption while still reliably transmitting packets. The paper reviews related work on source privacy and energy efficiency in wireless routing protocols and presents simulation results showing EMOR provides better source privacy compared to existing opportunistic routing while also reducing energy usage.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Ne...IDES Editor
A reliable routing protocol for wireless sensor
networks (WSN) should be capable of adjusting to
constantly varying network conditions while conserving
maximum power. Existing Routing protocols provide
reliability at the cost of high energy consumption. In this
paper, we propose to develop an Adaptive Energy Efficient
Reliable Routing Protocol (AEERRP) with the aim of
keeping the energy consumption low while achieving high
reliability. In our proposed protocol, the data forwarding
probability is adaptively adjusted based on the measured
loss conditions at the sink. So only for high loss rates, a node
makes use of high transmission power to arrive at the sink.
Whenever the loss rate is low, it adaptively lessens the
transmission power. Since the source rebroadcasts the data,
until the packet loss is minimized, high data reliability is
achieved. By simulation results we show that the proposed
protocol achieves high reliability while ensuring low energy
consumption and overhead.
The document discusses topology issues in wireless sensor networks. It defines two main categories of topology issues - topology control problems and topology awareness problems. Topology control problems involve maintaining sensor coverage topology and sensor connectivity topology. Approaches for sensor coverage include controlling node density and positioning for static, mobile, and hybrid sensor networks. Sensor connectivity approaches use power control and power management mechanisms. Topology awareness problems involve geographic routing to efficiently route packets based on node locations and addressing sensor holes that can disrupt routing. The document provides a taxonomy of topology issues and surveys various approaches studied in the literature to optimize wireless sensor network topology.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
The document describes localized, self-organizing approaches for constructing energy-efficient data aggregation trees in sensor networks. It proposes Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs) that use localized structures like LMST and RNG to approximate a minimum spanning tree. L-PEDAP then constructs an actual routing tree over these structures using localized parent selection strategies. Simulation results show L-PEDAP can achieve close to 90% of a theoretical upper bound on network lifetime derived in the paper, outperforming centralized solutions while meeting requirements like distributed operation, scalability, and robustness to failures.
Spread Spectrum Based Energy Efficient Wireless Sensor NetworksIDES Editor
The Wireless Sensor Networks (WSN) is
considered to be one of the most promising emerging
technologies. However one of the main constraints which
is holding back its wide range of applications is the
battery life of the sensor node and thus effecting the
network life. A new approach to this problem has been
presented in this paper. The proposed method is suitable
for event driven applications where the event occurrence
is very rare. The system uses spread spectrum as a means
of communication.
This document summarizes a survey of clustering algorithms for improving the lifetime of wireless sensor networks. It discusses how clustering partitions sensor networks into groups called clusters, with high-energy nodes acting as cluster heads. Clustering aims to reduce energy utilization and extend network lifetime by having cluster heads aggregate and transmit data to the base station on behalf of nodes in their clusters. The document reviews different types of clustering algorithms and heterogeneity in wireless sensor networks, noting that heterogeneity can further improve network lifetime, response time, and reliable data transmission through clustering.
This document summarizes a survey of intelligent approaches for efficient energy consumption in wireless sensor networks. Artificial intelligence techniques have been applied to optimize routing protocols and aggregate sensor data more efficiently to conserve limited battery power. Some key approaches discussed are directed diffusion for data dissemination, low-energy adaptive clustering hierarchy (LEACH) for randomized clustering, and energy aware distributed aggregation trees for in-network data aggregation. The goal is to extend the lifetime of battery-powered sensor networks through intelligent energy management strategies.
The document discusses using a mathematical model to analyze how adding supplementary sensor nodes near base stations could increase network lifetime by reducing the energy burden on nodes closest to the base stations. The results show that for some networks, adding only a limited number of extra nodes could quadruple network lifetime. However, the potential gain depends heavily on the existing fraction of nodes near the base stations.
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
The major challenge for wireless sensor networks is energy consumption minimization. Wireless transmission consumes much more of energy. In the clustered network, a few nodes become cluster heads which causes the energetic heterogeneity. Therefore the behavior of the sensor network becomes very unstable. Hence, the need to apply the balancing of energy consumption across all nodes of the heterogeneous network is very important to prevent the death of those nodes and thereafter increase the
lifetime of the network. DEEC (Distributed Energy Efficient Clustering) is one of routing protocols
designed to extend the stability time of the network by reducing energy consumption. A disadvantage of
DEEC, which doesn’t takes into account the cluster size and the density of nodes in this cluster to elect the
cluster heads. When multiple cluster heads are randomly selected within a small area, a big extra energy
loss occurs. The amount of lost energy is approximately proportional to the number of cluster heads in this
area. In this paper, we propose to improve DEEC by a modified energy efficient algorithm for choosing
cluster heads that exclude a number of low energy levels nodes due to their distribution density and their
dimensions area. We show by simulation in MATLAB that the proposed approach increases the number of
received messages and prolong the lifetime of the network compared to DEEC. We conclude by studying
the parameters of heterogeneity that proposed technique provides a longer stability period which increases
by increasing the number of nodes which are excluded from the cluster head selection.
Performance Evaluation of Ant Colony Optimization Based Rendezvous Leach Usin...IJERD Editor
- The document discusses the performance evaluation of an Ant Colony Optimization (ACO) based algorithm for wireless sensor networks with mobile sinks.
- It proposes using ACO along with rendezvous points and mobile sinks in a clustering protocol called Rendezvous LEACH (RZ LEACH) to optimize energy efficiency and network lifetime.
- Simulation results show that the ACO based RZ LEACH outperforms the original RZ LEACH protocol by prolonging the number of operational nodes and increasing average remaining energy in the network over time.
Energy consumption mitigation__routing_protocols_for_large_wsn's_finalGr Patel
This document summarizes and compares four routing protocols for large-scale wireless sensor networks that aim to mitigate energy consumption:
1. Data Gathering algorithm based on Mobile Agent (DGMA) proposes dynamic clustering based on event severity and uses a mobile agent to collect data from cluster members to reduce energy consumption and network delay.
2. Dynamic Minimal Spanning Tree Routing Protocol (DMSTRP) is a cluster-based protocol that uses minimal spanning trees to connect nodes within and between clusters to more efficiently reduce transmission distances and energy usage compared to other protocols.
3. Hierarchical Geographic Multicast Routing (HGMR) decomposes multicast groups hierarchically and uses geographic routing within subgroups to simultaneously achieve
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
This document discusses energy consumption in wireless sensor networks using routing protocols. It introduces a new routing protocol called MIN-RC, which aims to balance energy consumption among sensor nodes. MIN-RC is based on the LEACH-C protocol and uses adaptive round control to adjust cluster size, head location, and round time based on network conditions to minimize energy usage. The document compares MIN-RC to LEACH-C through simulations to evaluate its ability to extend network lifetime by more evenly distributing energy consumption across sensor nodes.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This document summarizes an article about optimizing set coverage problems in wireless sensor networks. It discusses the following key points:
1) Wireless sensor networks aim to maximize network lifetime by scheduling sensors to alternate between active and sleep modes or adjusting transmission ranges. The optimize set coverage (OSC) problem aims to find a maximum number of set covers where each active sensor is connected to the base station.
2) The OSC problem is proved to be NP-complete. Integer programming and linear programming models are proposed to formulate the OSC problem.
3) Greedy-based heuristics are presented for solving the OSC problem in a centralized and distributed manner. Simulations are used to validate the performance of
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
BOTTLENECK DETECTION ALGORITHM TO ENHANCE LIFETIME OF WSNijngnjournal
The document proposes a bottleneck detection algorithm to identify weak areas in a wireless sensor network and enhance the network lifetime. It detects bottleneck and minimal bottleneck zones where sensor nodes deplete their energy quickly. The algorithm identifies these weak zones and two additional sensor node deployment strategies are proposed - random deployment that places extra nodes everywhere and targeted deployment that places nodes in identified bottleneck areas. Simulations show the deployment strategies increase network lifetime parameters like throughput and packet delivery compared to the existing system. The bottleneck detection algorithm and additional node placements help balance energy usage and form stable links to prolong the wireless sensor network lifetime.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
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.
This document proposes using self-organizing maps (SOMs), an unsupervised artificial neural network technique, to categorize sensory data from wireless sensor networks (WSNs) in order to conserve battery power. The proposed system trains a 2x3 SOM on a base station node to categorize data from active sensor nodes. After training, the SOM defines categories that sensor nodes then transmit instead of raw data, reducing transmissions and saving up to 48.5% of battery power. Evaluation of the approach considers battery savings versus number of training samples and transmission interval.
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.
This document summarizes and compares several routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and discusses some of the key challenges in routing for these networks, such as large numbers of sensor nodes, energy constraints, and random node deployment. The document then categorizes routing protocols as flat-based, hierarchical-based, or location-based and focuses on reviewing various dynamic and static hierarchical/clustering-based routing protocols. Several popular protocols are described in detail, including LEACH, EECS, PEGASIS, and EEPSC. The pros and cons of each approach are discussed.
History based adaptive backoff (hbab) ieee 802.11 mac protocolambitlick
The document proposes a History-Based Adaptive Backoff (HBAB) MAC protocol to modify the IEEE 802.11 backoff algorithm. The standard IEEE 802.11 protocol uses a binary exponential backoff algorithm that resets the contention window size to the minimum after a successful transmission, which can lead to repeated collisions. HBAB instead slowly increases and decreases the contention window size based on the busyness of the channel, similar to adaptive delta modulation used in communications. Simulations show HBAB provides around 15% higher packet delivery fraction and up to 50% lower average packet delay compared to the standard backoff algorithm.
The document discusses securing query processing in cloud computing environments. It identifies three key requirements for secure query processing: 1) authenticating users and machines, 2) securing data transfer across machines, and 3) ensuring integrity of query results. The document also analyzes existing and proposed systems for wireless multi-hop networks, including analyzing performance under different conditions.
This document summarizes a survey of clustering algorithms for improving the lifetime of wireless sensor networks. It discusses how clustering partitions sensor networks into groups called clusters, with high-energy nodes acting as cluster heads. Clustering aims to reduce energy utilization and extend network lifetime by having cluster heads aggregate and transmit data to the base station on behalf of nodes in their clusters. The document reviews different types of clustering algorithms and heterogeneity in wireless sensor networks, noting that heterogeneity can further improve network lifetime, response time, and reliable data transmission through clustering.
This document summarizes a survey of intelligent approaches for efficient energy consumption in wireless sensor networks. Artificial intelligence techniques have been applied to optimize routing protocols and aggregate sensor data more efficiently to conserve limited battery power. Some key approaches discussed are directed diffusion for data dissemination, low-energy adaptive clustering hierarchy (LEACH) for randomized clustering, and energy aware distributed aggregation trees for in-network data aggregation. The goal is to extend the lifetime of battery-powered sensor networks through intelligent energy management strategies.
The document discusses using a mathematical model to analyze how adding supplementary sensor nodes near base stations could increase network lifetime by reducing the energy burden on nodes closest to the base stations. The results show that for some networks, adding only a limited number of extra nodes could quadruple network lifetime. However, the potential gain depends heavily on the existing fraction of nodes near the base stations.
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
The major challenge for wireless sensor networks is energy consumption minimization. Wireless transmission consumes much more of energy. In the clustered network, a few nodes become cluster heads which causes the energetic heterogeneity. Therefore the behavior of the sensor network becomes very unstable. Hence, the need to apply the balancing of energy consumption across all nodes of the heterogeneous network is very important to prevent the death of those nodes and thereafter increase the
lifetime of the network. DEEC (Distributed Energy Efficient Clustering) is one of routing protocols
designed to extend the stability time of the network by reducing energy consumption. A disadvantage of
DEEC, which doesn’t takes into account the cluster size and the density of nodes in this cluster to elect the
cluster heads. When multiple cluster heads are randomly selected within a small area, a big extra energy
loss occurs. The amount of lost energy is approximately proportional to the number of cluster heads in this
area. In this paper, we propose to improve DEEC by a modified energy efficient algorithm for choosing
cluster heads that exclude a number of low energy levels nodes due to their distribution density and their
dimensions area. We show by simulation in MATLAB that the proposed approach increases the number of
received messages and prolong the lifetime of the network compared to DEEC. We conclude by studying
the parameters of heterogeneity that proposed technique provides a longer stability period which increases
by increasing the number of nodes which are excluded from the cluster head selection.
Performance Evaluation of Ant Colony Optimization Based Rendezvous Leach Usin...IJERD Editor
- The document discusses the performance evaluation of an Ant Colony Optimization (ACO) based algorithm for wireless sensor networks with mobile sinks.
- It proposes using ACO along with rendezvous points and mobile sinks in a clustering protocol called Rendezvous LEACH (RZ LEACH) to optimize energy efficiency and network lifetime.
- Simulation results show that the ACO based RZ LEACH outperforms the original RZ LEACH protocol by prolonging the number of operational nodes and increasing average remaining energy in the network over time.
Energy consumption mitigation__routing_protocols_for_large_wsn's_finalGr Patel
This document summarizes and compares four routing protocols for large-scale wireless sensor networks that aim to mitigate energy consumption:
1. Data Gathering algorithm based on Mobile Agent (DGMA) proposes dynamic clustering based on event severity and uses a mobile agent to collect data from cluster members to reduce energy consumption and network delay.
2. Dynamic Minimal Spanning Tree Routing Protocol (DMSTRP) is a cluster-based protocol that uses minimal spanning trees to connect nodes within and between clusters to more efficiently reduce transmission distances and energy usage compared to other protocols.
3. Hierarchical Geographic Multicast Routing (HGMR) decomposes multicast groups hierarchically and uses geographic routing within subgroups to simultaneously achieve
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
This document discusses energy consumption in wireless sensor networks using routing protocols. It introduces a new routing protocol called MIN-RC, which aims to balance energy consumption among sensor nodes. MIN-RC is based on the LEACH-C protocol and uses adaptive round control to adjust cluster size, head location, and round time based on network conditions to minimize energy usage. The document compares MIN-RC to LEACH-C through simulations to evaluate its ability to extend network lifetime by more evenly distributing energy consumption across sensor nodes.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This document summarizes an article about optimizing set coverage problems in wireless sensor networks. It discusses the following key points:
1) Wireless sensor networks aim to maximize network lifetime by scheduling sensors to alternate between active and sleep modes or adjusting transmission ranges. The optimize set coverage (OSC) problem aims to find a maximum number of set covers where each active sensor is connected to the base station.
2) The OSC problem is proved to be NP-complete. Integer programming and linear programming models are proposed to formulate the OSC problem.
3) Greedy-based heuristics are presented for solving the OSC problem in a centralized and distributed manner. Simulations are used to validate the performance of
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
BOTTLENECK DETECTION ALGORITHM TO ENHANCE LIFETIME OF WSNijngnjournal
The document proposes a bottleneck detection algorithm to identify weak areas in a wireless sensor network and enhance the network lifetime. It detects bottleneck and minimal bottleneck zones where sensor nodes deplete their energy quickly. The algorithm identifies these weak zones and two additional sensor node deployment strategies are proposed - random deployment that places extra nodes everywhere and targeted deployment that places nodes in identified bottleneck areas. Simulations show the deployment strategies increase network lifetime parameters like throughput and packet delivery compared to the existing system. The bottleneck detection algorithm and additional node placements help balance energy usage and form stable links to prolong the wireless sensor network lifetime.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
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.
This document proposes using self-organizing maps (SOMs), an unsupervised artificial neural network technique, to categorize sensory data from wireless sensor networks (WSNs) in order to conserve battery power. The proposed system trains a 2x3 SOM on a base station node to categorize data from active sensor nodes. After training, the SOM defines categories that sensor nodes then transmit instead of raw data, reducing transmissions and saving up to 48.5% of battery power. Evaluation of the approach considers battery savings versus number of training samples and transmission interval.
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.
This document summarizes and compares several routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and discusses some of the key challenges in routing for these networks, such as large numbers of sensor nodes, energy constraints, and random node deployment. The document then categorizes routing protocols as flat-based, hierarchical-based, or location-based and focuses on reviewing various dynamic and static hierarchical/clustering-based routing protocols. Several popular protocols are described in detail, including LEACH, EECS, PEGASIS, and EEPSC. The pros and cons of each approach are discussed.
History based adaptive backoff (hbab) ieee 802.11 mac protocolambitlick
The document proposes a History-Based Adaptive Backoff (HBAB) MAC protocol to modify the IEEE 802.11 backoff algorithm. The standard IEEE 802.11 protocol uses a binary exponential backoff algorithm that resets the contention window size to the minimum after a successful transmission, which can lead to repeated collisions. HBAB instead slowly increases and decreases the contention window size based on the busyness of the channel, similar to adaptive delta modulation used in communications. Simulations show HBAB provides around 15% higher packet delivery fraction and up to 50% lower average packet delay compared to the standard backoff algorithm.
The document discusses securing query processing in cloud computing environments. It identifies three key requirements for secure query processing: 1) authenticating users and machines, 2) securing data transfer across machines, and 3) ensuring integrity of query results. The document also analyzes existing and proposed systems for wireless multi-hop networks, including analyzing performance under different conditions.
Effective and Efficient Shape-Based Pattern Detection over Streaming Time Seriesambitlick
This article proposes a new distance measure called Spatial Assembling Distance (SpADe) to handle noisy, shifting, and scaling time series data. SpADe can effectively measure the similarity between time series that exhibit amplitude and temporal variations. The article also applies SpADe to the task of continuous pattern detection in streaming time series data and shows it achieves high accuracy and efficiency.
This document summarizes a research paper that proposes a new MAC protocol called Overlapped Carrier-Sense Multiple Access (OCSMA) to improve spatial reuse and throughput in wireless ad hoc networks. OCSMA takes advantage of the fact that in multihop wireless networks, a node will know the contents of packets transmitted by nearby nodes. Specifically, if node B forwards a packet to node C that it previously received from node A, then node A knows the contents of any transmission from node B to C, even if it causes interference. This "known interference" allows nodes A and B to transmit simultaneously without colliding, improving network efficiency. The paper analyzes the limits of this approach, presents the OCSMA MAC
This document provides a draft software requirements specification for the Interactive Logbook project. It includes an introduction, overall description of the product and its features, user requirements for the .NET client and Java 2 Micro Edition client, and system features. The document outlines requirements for document handling, audio/video recording, writing with a stylus, collaboration features like file sharing and messaging, text editing, printing, search, study aids, help features, and integration with institutional systems. It also describes the user classes, operating environments, design constraints, and assumptions.
This document discusses the design of an overlay mesh for peer-to-peer live streaming that achieves low delay, accommodates diverse uplink bandwidths, and is adaptive to peer churn. It aims to minimize the maximum delay from the source to peers. The document proposes Fast-Mesh, a distributed algorithm where peers select parents based on the ratio of throughput to delay to optimize network power and delay. Simulation and experiments show Fast-Mesh substantially outperforms other approaches in terms of delay and source workload.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
The document summarizes an algorithm proposed to reduce energy consumption in wireless sensor networks using duty cycling and multi-hop routing. The key aspects of the algorithm are:
1) Layering the network environment based on size and identifying the optimal number of cluster heads in each layer.
2) Selecting the first layer closest to the sink as the "gateway layer" and stopping energy usage in half of these sensors to extend the network lifespan.
3) Using multi-hop routing whereby cluster heads send data to heads in the above layer until the gateway layer, which then sends to the static or mobile sink.
4) Simulation results showed the proposed algorithm performs better than LEACH and ELEACH in terms of
The document presents an improved clustering algorithm for load balancing in wireless sensor networks. The algorithm aims to address uneven cluster sizes that can negatively impact load balancing. It does this by selecting master and vice master nodes to partition regions and subregions, aiming to make cluster sizes more balanced. The algorithm has setup and steady state phases. In the setup phase, regions are partitioned recursively if needed to select balanced cluster heads. In the steady state phase, nodes send data to their cluster heads, which then send aggregated data to the base station. Simulation results show the improved algorithm increases network lifetime and energy efficiency compared to LEACH and E-LEACH algorithms.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which
makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
In Wireless Sensor Network, due to the
energy restriction of each nodes, efficient routing is very
important in order to save the energy of the hybrid
optimization technique. The results of new protocol i.e.
hybrid have been compared with EEPB and IEEPB.
Simulation results show that the lifetime of Hybrid is better
as compared to EEPB and IEEPB.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
The document proposes a new method to increase the lifetime of wireless sensor networks. It divides the sensor network environment into two virtual layers based on distance from the base station. It then uses residual energy, distance from base station, and position in the layers as factors in selecting cluster heads. Simulations show the proposed method outperforms LEACH and ELEACH algorithms in both homogeneous and heterogeneous sensor energy environments.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
This document summarizes a research paper that proposes a new routing protocol called U-LEACH for wireless sensor networks. U-LEACH aims to prolong the lifetime of sensor networks by uniformly distributing cluster head selection throughout the network, unlike the original LEACH protocol. It describes how LEACH works and its limitations in ensuring uniform cluster head distribution. The proposed U-LEACH protocol incorporates a Uniform Distribution Technique to select cluster heads in a way that ensures each sensor node is within transmission range of a cluster head, extending the overall 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.
A review of Hierarchical energy Protocols in Wireless Sensor Networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This document provides an overview of hierarchical energy protocols in wireless sensor networks. It discusses several key protocols including LEACH, PEGASIS, TEEN, and APTEEN. LEACH is described as a clustered-based protocol that randomly selects cluster heads to help distribute the energy load. PEGASIS is presented as an improvement on LEACH that forms chains between sensor nodes to help reduce energy usage. TEEN is a reactive protocol designed for time-critical applications, using hard and soft thresholds to reduce transmissions. Finally, APTEEN is summarized as an extension of TEEN that aims to support both periodic data collection and responding to important events.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
Wireless Ad Hoc Networks comprise a fast developing research area with a vast spectrum of
applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments
for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the
deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime
of the network has remained a great challenge since years. The time period from the instant at which the
network starts functioning to the time instant at which the first network node runs out of energy, i.e. the
network lifetime is largely dependent on the system energy efficiency. In this paper, we look at energy
efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads
get drain out maximum energy in the wireless ad hoc networks. We propose an algorithm that deals with
minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy
efficient round scheduling of cluster head allocation of nodes and then followed by allocation of nodes to
the cluster heads maximizing network lifetime using ANDA [1, 2]. We compare our results with the
previous works.
Energy Efficient Enhancement of TDEEC Wireless Sensors Network Protocol Based...chokrio
Radio frequency identification (RFID) and wireless sensor networks are two important wireless technologies which have a wide variety of applications in current and in future systems. By integration of these technologies, it is
feasible to improve the operating functionalities. In the heterogeneous network, the need to apply the balancing of
energy consumption across all nodes is very important to prevent the death of those nodes and thereafter increase the lifetime of the network .The most part of the network energy is consumed in the localization and in the communication stages, when nodes are sending HELLO packet, this energy can be recovered by implementing a passive RFID circuit in each node. This approach extends the network lifetime and increase the number of packet messages sent to the base station. Computer simulation in MATLAB with different scenarios comparison shows that the proposed method presents an efficient solution to enhance the energy network performance.
Similar to A cell based clustering algorithm in large wireless sensor networks (20)
Bulk Projects For sale
IEEE 2009-10-11-12-13 PAPERS AVILABLE.
We are providing low cost project for final year student projects.
Solved 2010 -2011 -2012 - 2013 IEEE in all the domain
Mobile : 8940956123
E-Mail : ambitlick@gmail.com,
INNOVATIVE TITLES ARE ALSO WELLCOME TO DO WITH US
For All BE/BTech, ME/MTech, MSC/MCA/MS , and diplamo graduates
PROJECT SUPPORTS & DELIVERABLES
•Project Abstract
•IEEE Paper
•PPT / Review Details
•Project Report
•Working Procedure in Video
•Screen Shots
•Materials & Books in CD
•Project Certification
This document lists 15 potential 2013 IEEE NS2 project titles related to wireless networks and sensor networks. It includes projects on topics like capacity of hybrid wireless mesh networks, delay-optimal broadcast in multihop wireless networks, detection of spoofing attackers, and harvesting-aware energy management for wireless sensor networks. The document provides contact information for a company called Ambitlick Solutions that offers support and deliverables for IEEE projects, including project abstracts, papers, presentations, reports, and certification.
This document lists over 40 potential 2013 IEEE Java Dotnet project titles across various domains including wireless networks, mobile computing, network security, data mining, cloud computing, parallel and distributed computing, and multimedia/image processing. The projects focus on technical topics such as wireless sensor networks, wireless mesh networks, cognitive radio networks, mobile ad hoc networks, network coding, video streaming, machine learning, data warehousing, and more. Project deliverables include an abstract, IEEE paper, presentation, report, working prototype or proof of concept, and certification. Bulk older and new projects can be provided at a low cost.
Handling selfishness in replica allocationambitlick
The document discusses techniques for handling selfish nodes in replica allocation over mobile ad hoc networks. It aims to reduce traffic overhead while maintaining high data accessibility. The techniques include a selfish node detection algorithm that considers partial selfishness and novel replica allocation methods to address issues caused by selfish nodes hoarding replicas for their own benefit instead of sharing memory space. Simulations are used to evaluate the performance of these techniques in improving data delivery rates.
Mutual Distance Bounding Protocols enable entities to determine an upper bound on their physical distance and authenticate each other. They have been actively researched due to distance-based attacks on wireless systems like RFID. While most protocols provide unilateral authentication of a tag to a reader, one was proposed to provide mutual authentication with a lower false acceptance rate. However, this analysis is shown to overestimate security, as a new attack achieves a higher false acceptance rate. A method is also introduced to modify existing unilateral authentication protocols into mutual authentication protocols.
Moderated group authoring system for campus wide workgroupsambitlick
This paper describes a distributed authoring system for campus workgroups that allows group members to modify any document type using their own devices. Each member maintains an updatable copy of shared content, and read-only copies are distributed asynchronously based on wireless availability. Group members manually reconcile updates through moderation, merging changes from others into their copy. Over time, successive moderation converges all copies into a single version. An evaluation found the asynchronous update model effective and the moderation process intuitive for students.
Efficient spread spectrum communication without pre shared secretsambitlick
This document proposes a new mechanism called Time Reversed Message Extraction and Key Scheduling (TREKS) that allows for efficient spread spectrum communication without pre-shared secrets. TREKS is four orders of magnitude faster than previous solutions to this problem. It enables long-term spread spectrum communication with optimal energy costs, minimal storage overhead, and a computation cost at most twice traditional spread spectrum. The approach was evaluated through simulations and experiments sustaining 1Mbps communication spread over 100 Megachips per second using modest hardware.
The document lists 23 networking and mobile computing projects implemented in NS2. It includes projects on topics like mobility in wireless networks, intrusion detection, neighbor discovery, energy renewal with wireless power transfer, load balancing, and spectrum access control. Contact information is provided for those interested in the project reports, presentations, source code, or implementing new projects.
Adaptive weight factor estimation from user review 1ambitlick
This document proposes a novel technique called Adjacent Pair Priorities (APP) to estimate weight factors for quality of service parameters in vertical handoff decision algorithms. The APP technique allows users to set relative priority levels for adjacent pairs of QoS parameters in descending order using an exponential mapping. This adaptive approach controls the width of the weight distribution to provide flexibility for users. The document outlines the system requirements, block diagram, modules and references several research papers on vertical handoff decision schemes and network selection algorithms.
The document proposes an Integrated Institutional Portal that allows all colleges and institutions within a university or district to share information. [1] The portal would allow students and staff from different colleges to discuss and request information from one another through blogs, forums and by publishing notices. [2] Currently, each college maintains separate portals without a common forum for communication. [3] The proposed centralized portal managed by a super administrator would make all college information like results, events and departments accessible to benefit students and staff across institutions.
This document describes an Embassy Administration portal that aims to centralize and automate manual processes at a college. [1] The portal allows separate login access for staff, parents, students and other members of the college. [2] It displays student results, attendance, and performance for parents to view as well as enables communication between parents and faculty. [3] The system conducts model and unit examinations.
The document proposes a customer relationship management system (CRMS) to help space marketing executives, managers, and management interact and share information online. The existing CRMS is manual and DOS-based, which has disadvantages like a distributed database, obsolete technology, and low efficiency. The proposed system is a web-based online CRMS designed for the space marketing department. It allows monitoring executive calls, tracking performance, and sharing information among departments to improve customer relationships and business operations. The system has modules for corporate administration, regional management, center management, and executives to organize work and monitor progress at different levels.
Mutual Distance Bounding Protocols enable entities to determine an upper bound on their physical distance and authenticate each other. They have been actively researched due to distance-based attacks on wireless systems like RFID. While most protocols provide unilateral authentication of a tag to a reader, one was proposed to provide mutual authentication with a lower false acceptance rate. However, this analysis is shown to overestimate security, as a new attack achieves a higher false acceptance rate. A method is also introduced to modify existing unilateral authentication protocols into mutual authentication protocols.
Moderated group authoring system for campus wide workgroupsambitlick
This paper describes a distributed authoring system for campus workgroups that allows group members to modify any document type using their own devices. Each member maintains an updatable copy of shared content, and read-only copies are distributed based on wireless availability. Group members manually reconcile updates through moderation, merging changes from others into their copy. Over time, successive moderations converge the multiple versions into a single version. An evaluation found the asynchronous update propagation and moderation process intuitive for students.
Efficient spread spectrum communication without pre shared secretsambitlick
This document proposes a new mechanism called Time Reversed Message Extraction and Key Scheduling (TREKS) that allows for efficient spread spectrum communication without pre-shared secrets. TREKS is four orders of magnitude faster than previous solutions to this problem and enables long-term spread spectrum communication without establishing keys. It was evaluated through simulation and on a testbed and can sustain 1Mbps communication spread over a 100 Megachips bandwidth in real-time, with provably optimal energy cost and minimal storage overhead.
Comments on “mabs multicast authentication based on batch signature”ambitlick
This document summarizes and critiques the MABS-DSA protocol proposed by Zhou et al. for multicast authentication using batch verification. While MABS-DSA was intended to increase efficiency and security over other implementations, the author finds through reexamination of the arithmetic that the algorithm is actually incorrect and batch signature verification would fail almost always, even when individual packets were properly signed by an honest sender. The key issue is a flaw in protocol correctness rather than the intended security improvements.
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sen...ambitlick
The document proposes a new probabilistic coverage protocol (PCP) for sensor networks that can employ different sensing models. PCP aims to address the costly task of designing and testing different coverage protocols for each sensing model. It works with common disk sensing models as well as probabilistic sensing models with minimal changes. Simulation results show that PCP outperforms other deterministic and probabilistic protocols in terms of number of activated sensors, total energy consumed, and network lifetime while being robust against failures and inaccuracies.
Energy efficient protocol for deterministicambitlick
The document describes a new probabilistic coverage protocol (PCP) for sensor networks that can employ both deterministic and probabilistic sensing models. PCP works by activating sensors to construct an approximate triangular lattice over the monitored area. It is more energy efficient than previous protocols by reducing the number of activated sensors needed for coverage. Simulation results show PCP outperforms other protocols in terms of energy consumption and network lifetime while maintaining coverage under various conditions.
Estimating Parameters of Multiple Heterogeneous Target Objects Using Composit...ambitlick
This article proposes a method for estimating parameters of multiple heterogeneous target objects (objects with different sizes and shapes) using networked binary sensors. The sensors are simple and only report detections, but no individual sensor location is known. The method introduces "composite sensor nodes" containing multiple sensors in a fixed arrangement. This provides relative location information to help distinguish individual target objects. As an example, the article considers a composite node with two sensors on a line segment. Measures from these nodes can identify target shapes and estimate object parameters like radius and side lengths. Numerical tests demonstrate networked composite sensors can estimate parameters of multiple target objects.
How to Fix the Import Error in the Odoo 17Celine George
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
2. head is re-elected if its current energy level is below
2. Related Works the average value.
There’re many researches about network clustering
to reduce energy consumption and prolong network 3. The Proposed Clustering Algorithm
lifetime in wireless sensor network in recent years. In this section, first network model is given, and
Heinzilman et al. [10] proposed Low-Energy then our proposed cell based clustering algorithm is
Adaptive Clustering Hierarchy (LEACH), which is a described.
self-organizing, adaptive clustering protocol utilizing 3.1. Network Model
randomization to evenly spread work load among Consider a wireless sensor network consisting of a
nodes in the network. In cluster set-up phase, each large number of sensor nodes which is dispersed on a
node elects itself to be a cluster head with a certain rectangular field. Let l and w denote the length and the
probability. Then each non-cluster head node joins a width of the rectangular field respectively. We assume
cluster by choosing the cluster head that requires the the following properties about the sensor network
minimum communication energy. Non-cluster head model:
node can turn off its radio except during its (1) Sensor nodes are evenly distributed in the target
transmitting time. Each cluster head aggregates data field. Once deployed, all sensor nodes are static.
from members and transmits the compressed data to (2) All sensor nodes have same capabilities of
the data sink directly. Since the cluster head may be far sensing, processing and communication.
away from the data sink, it will cost high energy. (3) The transmission range of all sensor nodes is
same and fixed which’s denoted by R. Two sensor
r nodes can communicate with each other if their
distance is less than R.
(4) Each sensor node knows its location information
r which can be provided by GPS or other location
systems.
3.2. Cell Based Clustering Algorithm
r First we discuss how to group sensor nodes into
clusters. Similar to GAF, the target field is divided into
r r r r small non-overlapping “virtual cells” which is a
regular hexagon. Sensor nodes belonging to the same
Figure 1 Example of virtual grid in GAF cell form a cluster. Without loss of generality, we
Xu et al. [11] presented a Geographical Adaptive assume l≥w. To minimize the total number of clusters,
Fidelity (GAF) algorithm. As depicted in figure 1, the we partition the rectangle into cells by way as
whole area where nodes are distributed is divided into illustrated in figure 2. The cells are arranged in array.
small “virtual grids”. Each node uses its location Each cell is identified with a two-tuples (i,j), where i is
information which can be provided by GPS or other the row order of the array and j is the column order of
location systems to determine which grid it belongs to. the array. Let Ci,j denotes the cell whose identification
Nodes belonging to the same grid form a cluster. Each is (i,j). To ensure cluster head can relay data from
node in a cluster has opportunity to be selected as adjacent cell, it’s required that any node in adjacent
cluster head. To ensure cluster head can relay data cell can communicate with each other. The maximum
between clusters, it’s required that any node in adjacent distance between any two nodes in adjacent cell is
grid can communicate with each other. Let R denote marked in figure 2. Let R denote the transmission
the transmission range of sensor node and r denote the range of sensor node and r denote the radius of the
size length of virtual grid. Therefore r≤R/ 5 must be circumcircle of cell. Therefore, we get:
held. r2+(2 3 r)2≤R2 (1)
Moussaoui et al. [12] presented a centralized Then r≤R/ 13 . In fact, we set r=R/ 13 to reduce the
clustering algorithm. Sensor nodes are organized into total number of clusters.
no overlapping clusters by taking into account a
combined effect of the cluster size, transmission power
and energy levels of nodes. Each node can
communicate with any other node in a cluster. Once all
clusters are set up, they don’t change in order to reduce
the computation and communication costs. Cluster
183
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on July 19,2010 at 15:20:45 UTC from IEEE Xplore. Restrictions apply.
3. balance energy of each node within cluster, it’s
4,0 4,1 4,2 4,3 4,4 4,5 important to elect the node with the maximum energy
to be cluster head. On the other hand, the energy of
3,0 3,1 3,2 3,3 3,4 3,5 3,6 each node will dynamically decrease as the time
elapses, so the cluster head must be re-elected
u periodically. Here we give a low-cost local algorithm
2,0 2,1 2,2 v 2,3 2,4 2,5 w
for electing cluster head, which is described as follows:
(1) If a node finds there’s no cluster head, it set a
1,0 1,1 1,2 R 1,3 1,4 1,5 1,6
timer which is in inverse proportion to its energy. If no
r cluster head is elected before the timer fires, it elects
0,0 0,1 0,2 0,3 0,4 0,5 itself to be cluster head.
(2) If a node finds its energy is more than twice the
l energy of current cluster head, it elect itself to be new
cluster head replacing current cluster head.
Figure 2 Partitioning the rectangle into virtual
Because each cluster member can directly
cells
communicate with the cluster head, intra-cluster
According to location information, each node can communication is sample. Subsequently we discuss
determine which cell it belongs to without exchanging inter-cluster communication. Assume only adjacent
message with each other. Assume the origin is the left cell can directly communicate with each other due to
down corner of the rectangle, the coordinate of the restriction of MAC protocol. Let (si,sj) and (di,dj)
node is (x,y), the identification of the cell in which the denote the identification of the source cell and the
node is located is (i,j). The value of (i,j) can be destination cell respectively. The question is how to
calculated from (x,y) by the following procedure: establish the communication path connecting Csi,sj and
Procedure Cal_Cell_ID Cdi,dj. As illustrated in figure 2, we first route vertically
Input: x, y, r to the cell which has the same row order as the
Output: i, j destination cell while try to reduce the column
i= ⎣ y / (3 / 2r )⎦ ; difference, then route horizontally to the destination
if (i%2=0) cell. Let Cci,cj denote the current cell and Cni,nj denote
j= ⎣x / ( 3r )⎦ ; the next routing cell. The value of (ni,nj) can be
u=x-j× 3 r; calculated by the following procedure:
else Procedure Route
j= ⎣x / ( )
3 r + 0 .5 ⎦; Input: di, dj, ci, cj
Output: ni, nj
u=x-(j-0.5)× 3 r;
if (di=ci)
v=y-i×3/2r; ni=ci;
if (v>r) if (dj<cj)
v=v-r; nj=cj-1;
if (u< 3 v) else
if (i%2=1) nj=cj+1;
j--; else
i++; if (di<ci)
else if (u> 3 r- 3 v) ni=ci-1;
else
if (i%2=0)
ni=ci+1;
j++;
if (ci%2=1 and dj<cj)
i++;
nj=cj-1;
return (i, j); else if (ci%2=0 and dj>cj)
nj=cj+1;
Figure 3 Procedure of calculating cell else
nj=cj;
identification from coordinate of node
return (ni, nj);
After the clustering procedure, all nodes are
grouped into clusters. Each node belongs to only one Figure 4 Procedure of routing between clusters
cluster. Then a cluster head must be elected from the It’s easy to see that the above routing procedure can
nodes set in each cluster. Cluster head perform more always produce the optimal communication path
functions than non-cluster head nodes and can’t go to between the source cluster and the dentition cluster if
sleep, consequently it will consume more energy. To measured by the hops of the communication path.
184
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on July 19,2010 at 15:20:45 UTC from IEEE Xplore. Restrictions apply.
4. ⎡ 5l ⎤ ⎡ 5 w ⎤
4. Performance Evaluation LPGAF= ⎢ ⎥+⎢ ⎥−2 (5)
⎢ R ⎥ ⎢ R ⎥
In this section, we evaluate the performance of our
CBC algorithm with comparing to GAF algorithm For CBC algorithm, if the number of rows is even,
presented in [11]. The measurements include the the identification of the cell at right up corner is
number of clusters, the length of inter-cluster ( ⎡2 w /(3r ) + 1 / 3⎤ -1, ⎡l /( 3r ) + 0.5⎤ -1). Otherwise the
communication path, and the network lifetime. identification is ( ⎡2 w /(3r ) + 1 / 3⎤ -1, ⎡l /( 3r )⎤ -1). So the
First we analyze the number of clusters generated largest length of inter-cluster communication path of
by CBC algorithm and GAF algorithm respectively. CBC algorithm which’s denoted by LPCBC can be
The smaller the number of clusters, the more energy is obtained as follows:
saved because the more nodes can go to sleep. The ⎧⎡ l 1 ⎤ ⎡ 2w 1 ⎤ ⎡ 2w 1 ⎤
number of clusters by GAF algorithm which’s denoted ⎪⎢ + ⎥+⎢ + ⎥ /2−2 ⎢ 3r + 3 ⎥ is even
by CNGAF can be easily obtained as follows: ⎪⎢ 3r 2 ⎥ ⎢ 3r 3 ⎥ ⎢ ⎥
LPCBC= ⎨ ,
⎡ l ⎤ ⎡ w ⎤ ⎡ 5l ⎤ ⎡ 5 w ⎤ ⎪⎡ l ⎤ ⎡ 2w 1 ⎤ 3 ⎡ 2w 1 ⎤
CNGAF= ⎢ ⎥ ⎢ ⎥ = ⎢ ⎥⎢ ⎥ (2) ⎪⎢ ⎥+⎢ + /2− ⎢ 3r + 3 ⎥ is odd
⎢ r ⎥⎢ r ⎥ ⎢ R ⎥⎢ R ⎥ ⎩⎢ 3r ⎥ ⎢ 3r 3 ⎥
⎥ 2 ⎢ ⎥
For CBC algorithm, the cell number of each even where r=R/ 13 (6)
row is ⎡l /( 3r )⎤ , the cell number of each odd row We can compute the asymptotic value of
is ⎡l /( 3r ) + 0.5⎤ , and the total row number is LPCBC/LPGAF when the target field is large enough as
follows:
⎡2w /(3r ) + 1 / 3⎤ . So the number of clusters by CBC
13l 13w
algorithm which’s denoted by CNCBC can be obtained +
as follows: LPCBC 3R 3R 39l + 13 w
lim = lim = (7)
⎧⎛ ⎡
l →∞ , w→ ∞ LPGAF l →∞ , w →∞ 5l 5w 45l + 45 w
l ⎤ ⎡ l 1 ⎤ ⎞⎡ 2w 1 ⎤ +
⎪⎜ ⎢ ⎥+⎢ + ⎥ ⎟⎢ + ⎥/2 R R
⎪⎜ ⎢
⎝ 3r ⎥ ⎢ 3r 2 ⎥ ⎟ ⎢ 3r 3 ⎥
⎠
⎪ 25
⎪ ⎡ 2w 1 ⎤
⎪ when ⎢ + ⎥ is even CBC
⎪ ⎢ 3r 3 ⎥
CNCBC= ⎨ , 20 GAF
The average length
⎪⎛ ⎡ l ⎤ ⎡ l 1 ⎤ ⎞⎛ ⎡ 2 w 1 ⎤ ⎞ ⎡ l ⎤
⎪⎜ ⎢
⎜ ⎥+⎢ + ⎥ ⎟⎜ ⎢
⎜ 3r + 3 ⎥ − 1⎟ / 2 + ⎢
⎟ ⎥
⎪⎝ ⎢ 3 r ⎥ ⎢ 3 r 2 ⎥ ⎟⎝ ⎢
⎠ ⎥ ⎠ ⎢ 3r ⎥ 15
⎪
⎪ ⎡ 2w 1 ⎤
when ⎢ + ⎥ is odd 10
⎪
⎩ ⎢ 3r 3 ⎥
where r=R/ 13 (3) 5
We can compute the asymptotic value of
CNCBC/CNGAF when the target field is large enough as 0
follows: 5 6 7 8 9 10 11 12 13 14 15
13l ⎛ 2 13 w 1 ⎞ The width of the rectangle (102m)
⎜ + ⎟
CN CBC 3 R ⎜ 3R
⎝ 3⎟⎠ 676 Figure 5 The average length of inter-cluster
lim = lim = (4) communication path for different shape of
l → ∞ , w → ∞ CN
GAF
l →∞ , w →∞
5l 5w 675
rectangles
R R
From above we can see LPCBC<LPGAF. In the special
So the number of clusters generated by CBC
case of l=w, the ratio is about 0.734. Subsequently we
algorithm is approximately equal to GAF algorithm.
analyze the average length of inter-cluster
Next we analyze the length of inter-cluster
communication path of CBC algorithm and GAF
communication path of CBC algorithm and GAF
algorithm by simulation. The transmission range of
algorithm respectively. The shorter the length of inter-
node is set to be R=100m. The length of the target
cluster communication path, the more energy is saved.
rectangle is set to be l=1500m. The width of the target
The longest inter-cluster communication path of GAF
rectangle w is varied from 500m to 1500m. Figure 5
algorithm is the communication path between the grid
shows the average length of inter-cluster
at left down corner and the grid at right up corner. Let
communication path of CBC algorithm and GAF
LPGAF denote it length, which can be obtained as
algorithm for different shape of rectangles. It can be
follows:
seen that the average length of inter-cluster
185
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on July 19,2010 at 15:20:45 UTC from IEEE Xplore. Restrictions apply.
5. communication path of CBC algorithm is smaller than regular hexagon. Sensor nodes belonging to the same
GAF algorithm in all cases. When the target region is a cell form a cluster. The size of cells is selected to be
square, it’s about 78.6% of GAF algorithm. The ratio R/ 13 so that any node in adjacent cell can
of CBC algorithm to GAF algorithm is about 79.4% on communicate with each other, where R is the
average. transmission range of sensor node. We present an
140 algorithm of calculating which cell a sensor node
belongs to from its coordinate. We also present a low-
CBC
The network lifetime (day)
120 cost local algorithm for electing cluster head. And we
GAF
100 give a method of routing that can produce the optimal
inter-cluster communication path.
80 We evaluate the performance of our proposed CBC
60 algorithm with comparing to GAF algorithm. By
analysis, the numbers of clusters generated by CBC
40 algorithm and GAF algorithm are approximately equal,
20 but the largest length of inter-cluster communication
path of CBC algorithm can reach 73.4% of that of
0 GAF algorithm at most. Simulation results show that
4 5 6 7 8 9 10
the ratio of the average length of inter-cluster
The number of sensor nodes (103)
communication path of CBC algorithm to that of GAF
Figure 6 The network lifetime for different algorithm is 79.4% on average, and the network
number of sensor nodes lifetime by CBC algorithm can be prolonged by about
Finally we compare the network lifetime by CBC 10% with comparison to GAF algorithm.
algorithm with GAF algorithm by simulation. The
transmission range of node is set to be R=100m. The 6. Acknowledgement
target rectangle is set to 1000×1000m2. The number of This paper was supported by Guangdong Natural
sensor nodes is varied from 4000 to 10000. The battery Science Foundation (2008254), Science Foundation for
package of sensor nodes can supply 2200mAh at 3V, so Youths of Shenzhen University (200869), National
initial energy of each node is 23.76kJ. We use the radio Science Foundation of China (60602066), Foundation
model described in [13]: The radio spends 200nJ/bit to of Shenzhen City (JC200903120069A and
transmit 1-bit and spends 100nJ/bit to receive 1-bit SG200810220145A).
over a transmission range of 100m. Communications in
the network obey the Poisson process and the average 7. References
number of communications per unit time is 10s-1. The [1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E.
source and dentition of a communication are random Cayirci. Wireless sensor networks: a survey. Computer
points in the rectangle. The average data volume of a Networks, 2002, 38(4): 393-422.
communication is 10KB. The average power of node [2] Y. Tian, E. Ekici. Cross-layer collaborative in-network
not in radio is 2mW. The average power of non-cluster processing in multihop wireless sensor networks. IEEE
head node in idle-listening is 10mW. The network Transactions on Mobile Computing, 2007, 6(3): 297-
lifetime is defined as from beginning to the time when 310.
data successfully routing rate drops below 85% [14]. [3] H.-M. Seo, Y. Moon, Y.-K. Park, D. Kim, D.-S. Kim,
Y.-S. Lee, K.-H. Won, S.-D. Kim, P. Choi. A low power
Figure 6 shows the network lifetime changes with fully CMOS integrated RF transceiver IC for wireless
different numbers of nodes by CBC algorithm and sensor networks. IEEE Transactions on Very Large
GAF algorithm. It can be seen that the network lifetime Scale Integration Systems, 2007, 15(2): 227-231.
increases with the increasing of the number of nodes [4] M.A. Lopez-Gomez, J.C. Tejero-Calado. A lightweight
by both algorithms. But when the number of node is and energy-efficient architecture for wireless sensor
same, the network lifetime by CBC algorithm is longer networks. IEEE Transactions on Consumer Electronics,
than GAF algorithm because the average 2009, 55(3): 1408-1416.
communication path of CBC algorithm is shorter. On [5] W. Li, C.G. Cassandras. A minimum-power wireless
average it’s about 1.1 times of GAF algorithm. sensor network self-deployment scheme. In Proceedings
of 2005 IEEE Wireless Communications and
Networking Conference, 2005: 1897-1902.
5. Conclusions [6] D. Estrin, R. Govindan, J. Heidemann, S. Kumar. Next
In this paper we propose a cell base clustering century challenges: scalable coordination in sensor
algorithm (CBC algorithm). The target field is divided networks. In Proceedings of the ACM/IEEE
into small non-overlapping “virtual cells” which is a International Conference on Mobile Computing and
Networking, 1999: 263-270.
186
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on July 19,2010 at 15:20:45 UTC from IEEE Xplore. Restrictions apply.
6. [7] B. Chen, K. Jamieson, H. Balakrishnan, R. Morris. [11] Y. Xu, J. Heidemann, D. Estrin. Geography-informed
Span: an energy-efficient coordination algorithm for energy conservation for ad hoc routing. In Proceedings
topology maintenance in ad hoc wireless networks. In of 7th ACM/IEEE International Conference on Mobile
Proceedings of 7th ACM/IEEE International Computing and Networking, 2001: 70-84.
Conference on Mobile Computing and Networking, [12] O. Moussaoui, A. Ksentini, M. Naimi, M. Gueroui. A
2001: 85-96. novel clustering algorithm for efficient energy saving in
[8] M. Stemm, R.H. Katz. Measuring and reducing energy wireless sensor networks. In Proceedings of the 7th
consumption of network interfaces in hand-held devices. IEEE International Symposium on Computer Networks,
IEEE Transactions on Communications, 1997, E80-B(8): 2006: 66-72.
1125-1131. [13] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan.
[9] A. Kashyap, S. Fangting, M. Shayman. Relay An application-specific protocol architecture for
placement for minimizing congestion in wireless wireless microsensor networks. IEEE Transactions on
backbone networks. In Proceedings IEEE Wireless Wireless Communications, 2002, 1(4): 660-670.
Communications and Networking Conference, 2006: [14] D.B. Santi. Investigating upper bounds on network
159-164. lifetime extension for cell-based energy conservation
[10] W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan. techniques in stationary ad hoc networks. In
Energy-efficient communication protocol for wireless Proceedings of 8th ACM/IEEE International
microsensor networks. In Proceedings of 33rd Annual Conference on Mobile Computing and Networking,
Hawaii International Conference on System Sciences, 2002: 183-192.
2000: 3005-3014.
187
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on July 19,2010 at 15:20:45 UTC from IEEE Xplore. Restrictions apply.