scispace - formally typeset
Search or ask a question

Energy Efficient Cluster based Hierarchical Routing Protocols in Wireless Sensor Network - a Survey

TL;DR: A detailed study of the resources used, protocols modified and medium access control changes of the energy optimization techniques are provided so as to promote power saving in wireless sensor networks.
Abstract: Nowadays the wireless sensor networks have developed into popular domain owing to their extensive variety of applications. Many aspects are decisive the survivability and lifetime of the wireless sensor networks. Energy consumption is one of the biggest restraints of the wireless sensor node and these limitations joint with a characteristic operation of greatest number of nodes that have added several tasks to the design management of wireless sensor networks. The existing systems say that, one of the ways, the energy can be saved efficiently is only by clustering and cluster head election, by using many techniques. Provision of energy to the sensor nodes remains the primary deterrent in the development of sensor nodes as per the typical remote environment monitoring. This survey highlights the way of power saving and energy optimization techniques in wireless sensor networks, enhances the available methods to save energy. In this paper, a detailed study of the resources used, protocols modified and medium access control changes of the energy optimization techniques are provided so as to promote power saving in wireless sensor networks.
Citations
More filters
Proceedings ArticleDOI
01 Dec 2015
TL;DR: Yet Another LEACH (YA-LEACH), which uses centralised cluster formation to ensure optimal clusters and allow Cluster Heads (CH) to extend operation into multiple rounds to achieve energy savings and will have an alternative CH that takes over when CH residual energy reaches a critically low level.
Abstract: Wireless Sensor Networks (WSN) is an ever growing field owing to their extensive variety of applications. WSN have limited battery energy, consequently, an energy efficient routing protocol is of major concern. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the fundamental clustering protocols in WSN that provides high energy efficiency. Many protocols have been derived from LEACH which mostly address a single inherent challenge. Instead of focusing on a single parameter, combining independent techniques can compound gains in energy efficiency. This paper proposes Yet Another LEACH (YA-LEACH) which uses centralised cluster formation to ensure optimal clusters and allow Cluster Heads (CH) to extend operation into multiple rounds to achieve energy savings. Also, the proposed protocol will have an alternative (vice) CH that takes over when CH residual energy reaches a critically low level. The extended protocol was simulated on NS2 with results showing an improvement in network lifetime and overall data throughput.

6 citations


Cites background from "Energy Efficient Cluster based Hier..."

  • ...Hierarchical routing protocols are best known to minimize energy consumption by forming clusters of nodes with a Cluster Head (CH), where the sensed data from the Cluster Member (CM) nodes can be aggregated and compressed before forwarding to the BS [3]....

    [...]

Journal ArticleDOI
TL;DR: To reduce energy consumption, this work designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time and a tier structure in which the network is concentrically organized around the sink node.
Abstract: Wireless sensor networks for forest monitoring are typically deployed in fields in which manual intervention cannot be easily accessed. An interesting approach to extending the lifetime of sensor nodes is the use of energy harvested from the environment. Design constraints are application-dependent and based on the monitored environment in which the energy harvesting takes place. To reduce energy consumption, we designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time. The dynamic duty cycle scheduling is realized based on a tier structure in which the network is concentrically organized around the sink node. In addition, the multi-paths preserved in the tier structure can be used to deliver residual packets when a path failure occurs. Experimental results show that the proposed method has a better performance.

2 citations

Proceedings ArticleDOI
01 Dec 2014
TL;DR: Two new stage approaches are proposed which are the DPFM-[Data Packet Format Matching] method which detects the attacker node and DAA-[Divert Attention Attacker], which prevents nodes compromising in the zone and shows that the compromising node is eliminated and attacks are controlled in the network.
Abstract: Since the WSN is not secure in nature, it compromises the sensor node and the physical capture of these nodes is very easy for the intruder nodes The intruder nodes simply communicate with any node in the zone, thus compromising the nodes and in turn spoiling the nature of the network To reduce the damages be fallen on the compromised nodes, it should be successfully detected and revoked as soon as possible Range of node specifies detection systems in wireless ad-hoc and sensor networks have been projected by academicians, of late In the existing approach Leader based intrusion detection system is used to find out suspect regions where the compromised nodes are ensconced, here the Leader will be elected region wise based on the energy level to detect the attacker and revoke the compromised node To overcome this as well as to provide high security two new stage approaches are proposed They are the DPFM-[Data Packet Format Matching] method which detects the attacker node and DAA-[Divert Attention Attacker] method which prevents nodes compromising in the zone The simulation result shows that the compromising node is eliminated and attacks are controlled in the network

2 citations

Journal ArticleDOI
TL;DR: This paper identifies that, in order to further development of WSN application in real world, minimizing energy waste is one of the most life-threatening problem and measures WSN lifetime by simulating the behavior of multiple nodes.
Abstract: Wireless sensor network has many issues like energy consumption, security, etc. Wireless sensor network is broadly used in different field like battle-field, education and organization etc. This paper identify that, in order to further development of WSN application in real world, minimizing energy waste is one of the most life-threatening problem. Replacing this energy resource in the field is usually not realistic, and all together, a WSN must operate at least for a given mission time or as long as possible. Hence, the lifetime of a WSN becomes a very essential figure of merit. Here problem recognize by students is that in MAC protocol overhead is biggest issue for WSN. To minimize energy wastage, algorithm is designed in such manner that will decrease overhead from data transmission. Therefore, mismanaged spares can shorten WSN lifetime instead of extending it. We measured WSN lifetime by simulating the behavior of multiple nodes.
01 Jan 2015
TL;DR: Different types of protocols and methods of energy management in routing in wireless sensor network are reviewed to indicate the possible research on energy saving during routing in WSNs.
Abstract: Wireless Sensor Network (WSN) is a set of various wireless sensor nodes. WSN require in rural, remote area and at such place where human dealings is required. But wireless sensor network has many issues like energy consumption, security, etc. Wireless sensor network is widely used in different field like battle-field, education and organization etc. This paper review different types of protocols and methods of energy management in routing. Here comparison of few methods which are related to energy efficient routing in WSNs. This study indicates the possible research on energy saving during routing in WSNs.
References
More filters
Journal Article
TL;DR: S-MAC as discussed by the authors is a medium access control protocol designed for wireless sensor networks, which uses three novel techniques to reduce energy consumption and support self-configuration, including virtual clusters to auto-sync on sleep schedules.
Abstract: This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption in listening to an idle channel, nodes periodically sleep. Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules. Inspired by PAMAS, S-MAC also sets the radio to sleep during transmissions of other nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network. We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley. The experiment results show that, on a source node, an 802.11-like MAC consumes 2–6 times more energy than S-MAC for traffic load with messages sent every 1–10s.

5,354 citations

Proceedings ArticleDOI
07 Nov 2002
TL;DR: S-MAC uses three novel techniques to reduce energy consumption and support self-configuration, and applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network.
Abstract: This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks Wireless sensor networks use battery-operated computing and sensing devices A network of these devices will collaborate for a common application such as environmental monitoring We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 80211 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important S-MAC uses three novel techniques to reduce energy consumption and support self-configuration To reduce energy consumption in listening to an idle channel, nodes periodically sleep Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules Inspired by PAMAS, S-MAC also sets the radio to sleep during transmissions of other nodes Unlike PAMAS, it only uses in-channel signaling Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley The experiment results show that, on a source node, an 80211-like MAC consumes 2-6 times more energy than S-MAC for traffic load with messages sent every 1-10 s

5,117 citations


"Energy Efficient Cluster based Hier..." refers background in this paper

  • ...The technology of WSN has been used widely in a number of applications [4] of hospitals and medical centres which includes the pre-hospital, in-hospital patient monitoring, rehabilitation and disaster response....

    [...]

Proceedings ArticleDOI
26 Mar 2000
TL;DR: An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system and algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized are proposed.
Abstract: An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver. We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves, instead of routing to minimize the absolute consumed power.

1,830 citations


"Energy Efficient Cluster based Hier..." refers methods in this paper

  • ...In [9], this paper, present an Energy Optimization Approach based on Cross-Layer for Wireless Sensor Networks named as EOA, which consider the combined optimal design of...

    [...]

Proceedings ArticleDOI
26 Mar 2000
TL;DR: This work considers the problem of adjusting the transmit powers of nodes in a multihop wireless network as a constrained optimization problem with two constraints-connectivity and biconnectivity, and one optimization objective-maximum power used.
Abstract: We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints-connectivity and biconnectivity, and one optimization objective-maximum power used. We present two centralized algorithms for use in static networks, and prove their optimality. For mobile networks, we present two distributed heuristics that adaptively adjust node transmit powers in response to topological changes and attempt to maintain a connected topology using minimum power. We analyze the throughput, delay, and power consumption of our algorithms using a prototype software implementation, an emulation of a power-controllable radio, and a detailed channel model. Our results show that the performance of multihop wireless networks in practice can be substantially increased with topology control.

1,728 citations


"Energy Efficient Cluster based Hier..." refers background in this paper

  • ...Due to packet collision [6], there occurs an energy loss, as all packets involved in the collision are to be discarded and to be retransmitted....

    [...]

Proceedings ArticleDOI
22 Apr 2001
TL;DR: This work proposes a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connectivity and gives an approximation scheme in which the power consumption of each route can be made arbitrarily close to the optimal by carefully choosing the parameters.
Abstract: The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connectivity. Specifically, based on the directional information, a node grows it transmission power until it finds a neighbor node in every direction. The resulting network topology increases the network lifetime by reducing the transmission power and reduces traffic interference by having low node degrees. Moreover, we show that the routes in the multihop network are efficient in power consumption. We give an approximation scheme in which the power consumption of each route can be made arbitrarily close to the optimal by carefully choosing the parameters. Simulation results demonstrate significant performance improvements.

955 citations


Additional excerpts

  • ...The design of electronic transceiver circuits and the network protocols uses a number of power saving techniques [5]....

    [...]