No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Optimized Energy Efficient Routing using Dynamic Clustering in Wireless Sensor Networks
Abstract
Energy efficient routing, minimum network lifetime, adaptation to continuous variation in topology of nodes and high energy consumption for data transmission are the major limitations in Wireless Sensor Networks (WSNs). Different routing techniques of WSNs have been presented to tackle the above mentioned challenges. These techniques are Direct Transmission Mechanism (DTM), Chain Based Routing (CBR) and Hierarchical Clustering (HC) for network lifetime maxi-mization. Nevertheless, the available solutions are suitable for limited range network but not for scalable networks. Moreover, these techniques do not address the variable clustering approach in terms of energy efficiency and the hot spot problem. In this work, an efficient algorithm is proposed to enhance lifetime and stability period of the entire systems by meeting the all available constraints.
... Paper [15] proposed a distribution scheme of cluster heads to reduce energy dissipation by avoiding unnecessary redundancy and compared with existing LEACH it prolongs network lifetime. Paper [16] proposed energy efficient adaptive multipath routing technique to reduce routing overhead and efficiently utilizes the energy availability. In paper [17] competitive clustering (CC) algorithm with sink mobility was proposed to increase residual energy in sensor nodes and improve the network performance. ...
Wireless Sensor Network (WSN) is a network which formed with a maximum number of sensor nodes which are positioned in an application environment to monitor the physical entities in a target area, for example, temperature monitoring environment, water level, monitoring pressure, and health care, and various military applications. Mostly sensor nodes are equipped with self-supported battery power through which they can perform adequate operations and communication among neighboring nodes. Maximizing the lifetime of the Wireless Sensor networks, energy conservation measures are essential for improving the performance of WSNs. This paper proposes an Enhanced PSO-Based Clustering Energy Optimization (EPSO-CEO) algorithm for Wireless Sensor Network in which clustering and clustering head selection are done by using Particle Swarm Optimization (PSO) algorithm with respect to minimizing the power consumption in WSN. The performance metrics are evaluated and results are compared with competitive clustering algorithm to validate the reduction in energy consumption.
Wireless Sensor Networks(WSNs) have problem of energy starvation in their operations. This constraint demands that the topology of communicating nodes should be limited. One of the ways of restraining the communicating nodes is by creating a Connected Dominating Set(CDS) of nodes out of them. In this paper, an Optimized Region Based Efficient Data(AORED) routing protocol for WSNs has been proposed. CDS has been employed in AORED to create a virtual backbone of communicating nodes in the network. The empirical study involving extensive simulations show that the proposed routing protocol outperforms the legacy DEEC and SEP protocols. AORED has increased number of transmission rounds, increased number of clusterheads and reduced number of packets sent to the basestation as compared to DEEC and SEP protocols.
Wireless sensor network (WSN) is an emerging technology
for monitoring physical world.
WSNs consist of large numbers of sensor nodes operated by
battery mostly in harsh environment. Thus energy
conservation is a primary issue for organization of these
sensor nodes. Another crucial issue is the data delivery time
by sensor nodes to the sink node, especially in Military,
medical fields, and security monitoring systems where
minimum delay is desirable.
Number of protocols has been proposed in the literature for
routing. One of such protocols is the cluster based routing
protocol LEACH (low energy adaptive clustering hierarchy).
LEACH protocol organizes WSN into a set of clusters and a
periodic voting for cluster head is performed in order to be
evenly distributed among all the sensors of the WSN. This
periodical cluster head voting in LEACH, however,
consumes an amount of non-negligible energy and other
resources. For energy conservation, PEGASIS (power
efficient gathering in sensor information systems) a near
optimal chain-based protocol has been proposed, however, it
is faced with the challenge of long delay for the transmitted
data. Another routing protocol called CCM (Chain-Cluster
based Mixed routing), which is mainly a hybrid of LEACH
and PEGASIS is proposed, the consumed energy increases as
network size increases.
In this paper, we propose an efficient routing protocol called
CCBRP (Chain-Chain based routing protocol), it achieves
both minimum energy consumption and minimum delay. The
CCBRP protocol mainly divides a WSN into a number of
chains (Greedy algorithm is used to form each chain as in
PEGSIS protocol) and runs in two phases. In the first phase,
sensor nodes in each chain transmit data to their chain leader
nodes in parallel. In the second phase, all chain leader nodes
form a chain (also, using Greedy algorithm) and choose
randomly a leader node then all chain leader nodes send their
data to this chosen leader node. This chosen leader node
fuses the data and forwards it to the Base Station, BS.
Experimental results demonstrate that the proposed CCBRP
outperforms LEACH, PEGASIS and CCM with respect to
the product of the energy consumed and the experienced
delay.
Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless
networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various
routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has
been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed
among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources.
While another chain-based algorithm PEGASIS (power- efficient gathering in sensor information systems) can reduce such energy
consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster
based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides
a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own
chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as
a cluster in a self- organized manner, where they transmit fused data to a voted cluster head using the cluster based routing.
Experimental results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed
energy and delay, weighting the overall performance of both energy consumption and transmission delay.
KeywordsWireless sensor network-Chain based routing-Cluster based routing-Mobile and ubiquitous computing
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network based on the LEACH protocol. The proposed protocol adds feature to LEACH to support for mobile nodes and also reduces the consumption of the network resource in each round. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH.
In recent advances, many routing protocols have been proposedbased on heterogeneity with main research goals such asachieving the energy efficiency, lifetime, deployment of nodes,fault tolerance, latency, in short high reliability and robustness. Inthis paper, we have proposed an energy efficient cluster headscheme, for heterogeneous wireless sensor networks, bymodifying the threshold value of a node based on which it decidesto be a cluster head or not, called TDEEC (Threshold DistributedEnergy Efficient Clustering) protocol. Simulation results showthat proposed algorithm performs better as compared to others.
Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.
Reducing the energy consumption and extending network lifetime are key techniques for wireless sensor networks (WSNs). A novel reliable routing algorithm is proposed by taking advantages of both LEACH and PEGASIS algorithms. The new algorithm randomly selects five cluster heads linked into chains and the one with maximum residual energy is chosen to transfer information to the sink. Nodes with energy less than the threshold can not be selected as the cluster head thus to enhance the overall network robustness. Theoretical analysis and simulation results demonstrate that, compared with LEACH, the proposed algorithm can prolong the network lifetime by 117% -351% and balance the energy consumption of network nodes as well. At the same time, compared with the PEGASIS, the algorithm improves by 290% in terms of the network latency.
Many researcher has paid their to explore and monitor the under water environment. There are lot of application of Underwater WSNs like environment monitoring, exploration of under water surfaces, disaster preventions assisted navigation etc. Underwater sensors are totally different from the terrestrial sensors. Terrestrial sensor network uses the radio signal and underwater sensor network uses the acoustic signal. As the radio signal has not good strength that it can propagate in the water. The Radio signal can propagate over the large distance as compared to the acoustic signals. Therefor, acoustic signal are used. In this paper, we propose Energy Hole Repairing Depth based routing protocol (EHRDBR) and Interference-Bandwidth aware Depth based routing (IBDBR) protocol. In both protocols, nodes move toward the specific area where the other node dies and cover the energy hole. In EHRDBR, forwarder node is selected on the basis of the interference residual energy, and depth parameters. In IBDBR, interference, bandwidth, residual energy, and depth parameters are used to select the forward node. Our protocols have performed better in network lifetime, throughput and ene to end delay .
Regarding energy efficiency in Wireless Sensor Net-works (WSNs), routing protocols are engaged in a playful manner suggesting a consciousness of high value. In this research work, we present Away Cluster Heads with Adaptive Clustering Habit ((ACH) 2) scheme for WSNs. Our proposed scheme increases the stability period, network lifetime and throughput of the WSN. The beauty of our proposed scheme is its away Cluster Heads (CHs) formation, and free association mechanisms. The (ACH) 2 controls the CHs' election and selection in such a way that uniform load on CHs is ensured. On the other hand, free association mechanism removes back transmissions. Thus, the scheme operations minimize the over all energy consumption of the network. In subject to throughput maximization, a linear programming based mathematical formulation is carried out in which the induced subproblem of bandwidth allocation is solved by mixed-bias resource allocation scheme. We implement (ACH) 2 scheme, by varying node density and initial energy of nodes in homogeneous, heterogeneous, reactive and proactive simulation environments. Results justify its applicability.
Wireless Sensor Networks (WSNs) consist of large number of randomly
deployed energy constrained sensor nodes. Sensor nodes have ability to
sense and send sensed data to Base Station (BS). Sensing as well as
transmitting data towards BS require high energy. In WSNs, saving energy
and extending network lifetime are great challenges. Clustering is a key
technique used to optimize energy consumption in WSNs. In this paper, we
propose a novel clustering based routing technique: Enhanced Developed
Distributed Energy Efficient Clustering scheme (EDDEEC) for
heterogeneous WSNs. Our technique is based on changing dynamically and
with more efficiency the Cluster Head (CH) election probability.
Simulation results show that our proposed protocol achieves longer
lifetime, stability period and more effective messages to BS than
Distributed Energy Efficient Clustering (DEEC), Developed DEEC (DDEEC)
and Enhanced DEEC (EDEEC) in heterogeneous environments.
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
Wireless Sensor Networks (WSNs) monitors changes in the operational environment and collaborate to actuate distributed tasks in dynamic uncertain and hostile environments. The biggest constraint of these networks is short life time. In this context, various schemes have been presented in order to improve the life time of these networks and to overcome the energy constraint. This paper presents a new cluster based routing algorithm to address the traditional problem of load balancing and energy efficiency in the WSNs. The proposed algorithm makes use of the nodes in a sensor network whose area coverage is covered by the neighboring nodes and marks these nodes as temporary cluster heads. These temporary cluster heads are later used for multihop intercluster communication. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing across the network and is more energy efficient compared to standard Leach and the enhanced version of Leach algorithms.
This paper focuses on reducing the power consumption of wireless microsensor networks. Therefore, a communication protocol named LEACH (low-energy adaptive clustering hierarchy) is modified. We extend LEACH's stochastic cluster-head selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime by about 30% can be accomplished. Furthermore, we present a new approach to define lifetime of microsensor networks using three new metrics FND (First Node Dies), HNA (Half of the Nodes Alive), and LND (Last Node Dies).
Sep: A stable election protocol for clustered heterogeneous wireless sensor networks
- G Smaragdakis
- I Matta
- A Bestavros
G. Smaragdakis, I. Matta and A. Bestavros, "Sep: A stable election protocol for clustered
heterogeneous wireless sensor networks," Second International Workshop on Sensor and Actor
Network Protocols and Applications (SANPA), pp. 1-11, 2004.
Research Issues in Wireless Sensor Net-workApplications: A Survey
- E P K Gilbert
- B Kaliaperumal
- E B Rajsingh
E. P. K. Gilbert, B. Kaliaperumal and E. B. Rajsingh. "Research Issues in Wireless Sensor Net-workApplications: A Survey," International Journal of Information and Electronics Engineering
2.5 (2012): 702.