COMPARATIVE REVIEW ON ENERGY EFFICIENT TECHNIQUES IN WIRELESS SENSOR NETWORK
Neha Abbi, Dr. Sandeep Sharma
Department of CSE G.N.D.U./CSE, Amritsar, India
Abstract: A wireless sensor network is type of wireless network. Basically it consists a collection of tiny device are called sensor node, sensor node has a resource constraint means battery power, storage and communication capability. Network lifetime is the most important metric for the evaluation of sensor networks. In a resource-constrained environment, the utilization of every limited resource must be considered. The network can only fulfill its purpose as long as it is considered alive, but not after that. It is therefore an indicator for the maximum utility a sensor network can provide. Energy efficiency is therefore of paramount importance in sensor networks that are constrained by limited resources. In this paper we purposed a novel technique in which we added the no of relay nodes in the network to increase the network lifetime.
1.Introduction
Wireless sensor network (WSN) is actually a network linked with tiny transportable cellular nodes that will be hugely dispersed and deployed inside significant numbers. It monitor the computer or environment by means of testing physical specifications like humidity, stress and temperature [6]. It offers a monetary way for a deployment within the control little units and dispersed detects averting a high-priced feeling wireless system.
It consists of small devices which
1. Allowed to sense physical and environment conditions like temps, pressure and humidity.
2. Allowed to run devices with regard to instance actuators, motors and switches which often control conditions.
3. provides productive and reliable communications.
In order to send out details to everywhere across the network take in additional nodes furthermore more network resources. In the same way it consumes more energy as well as bandwidth [16]. Sensor nodes take constrained strength sources that happen to be irreplaceable as a result, now there is necessary to develop a power efficient technique to add to the lifetime of wireless sensor network. An internal trade-off process needs to be produced to ensure the end-user must select extended network life efficiently means high throughput with less consumption of energy [11].
Communication Amongst Sensor Nodes Plus Sink
Communication will depend on number of results returned per mean time. Mentioned previously that sink insert the query within Wireless Sensor Network and sensor nodes responds to the query when needed. [11].
A Wireless Sensor Network may consist of various sinks which is mobile or possibly static. In the event virtually any system presents multiple sink , after that it can produce the same query within the Wireless Sensor Network.in that case system every single sink node has its unique path used for the source node and that is not necessary there might be a approach which usually cuts down on the risk with reference to.
The best source-sink transmission depend upon multi-hop meaning rely. If sensor node is nearest to sink the battery will certainly consume fast than the batteries as contrast with the nodes that are distant from the base station. If more load on sensor node then it will consume more energy. so far researchers developed so many enery models but they are not still successful for consuming energy. This additional power consumption or power depletion will degrade network performance.
things must benefit from nodal redundancy together with dispersed processing. Numerous obstacles continue to be really should be overcome in instant indicator networks. These kinds of challenges consist of procedure heterogeneity, constrained energy ability, dynamic topology, deficiency request help, developing high quality, of high quality of aid, plus ecological challenges [6]. Yet the primary problem of WSNs style must be to develop any kind of protocol in which integrated indicator nodes work in a prearranged together with collaborative approach. Every sensor node wants to increase it's energy operate. The whole network prerequisites steadiness in source assignment to do in a fashion this is useful , beneficial and productive. There are lots of network direction-finding networks that are developed in very few final years.
2.Scope
The actual communication between sensor node to base station is fully dependent on multi-hop message relay. The actual electric batteries of the sensor nodes placed around the sink will deplete swifter when as opposed to those which are placed significantly away. The reason being for nearby devices are used
more sensor-to-sink routes, more load consume a lot of energy. Energy depletion causes energy holes which weaken the system performance. to improve the performance and to extend the lifetime of a network we are replacing some nodes with sensor nodes.Scientific study has build many energy versions [5,15] to grant good justification however these versions continue to have to be improved. Clustering approach helps to provide stability to network and to extend the lifetime of a network. Among the energy-efficient routing protocols regarding wireless sensor network is Divide and Rule scheme. In Divide and Rule scheme [12], Cluster Head in external area (Os) send data to Cluster Head of middle area. These kind of clusters are also called secondary level cluster heads, these heads collect their own cluster nodes data and, data with the primary level Cluster Head then, broadcast data to sink it will result in a lot more energy intake of Cluster Head nodes present in the middle area . (Ms) and nodes present in the Interior area (Is) rehions which can lead to energy gap and could lead to data routing problems. So there exists need to boost this scheme for you to enhance the lifetime of nodes throughout middle area (Ms) and Iner area . (Is) regions.
Comparative Study
Sr. No
Author Name Technique Used
Advantages Diadvantages 1. W.R.
Heinzelman, A.P
Chandrakasan and H. Balakrishnan
LEACH 1.flexible and self adaptive
2.prevent interference between clusters by using CDMA
3.It has maximum power management.
4. Its network lifetime is good.
1.data transmission from all cluster heads to the base station may be a long distance. 2.large overheads occurred while formation of clusters.
3.It has no multipath so collision may occur.
4.It is query based so user have to take training to work on this.
2. O. Younis and S. Fahmy
HEED 1.It is an extended form of LEACH
2.improves network lifetime
3.It improves stability of the network.
4.It is a distributed clustering methods that benefits from the use of the two important parameters for CH
1. Same as the LEACH protocol, the clustering in each round appoint significant burden in the network. This burden causes remarkable energy dissipation which results in decline the network lifetime
election. 5.
3.some CHs , particularly near the sink, might die earlier because these CHs have huge workload.
3. S. Lindsey and C.Raghavendra
PEGASIS 1.it is an improved version of HEED
2.It forms chains rather than clusters so it decrease the workload. 3.It reduces the number or quantity of data/information
transmission volume through the chain of information aggregation.
1. The communication suffers from excessive delays caused by the one or single chain for distant nodes and a high probability for any node to become a bottleneck.
2.It is not suitable for long distance. 3.In PEGASIS sensor nodes usually or probably die early.
4.It is a troublesome task for all nodes to maintain a complete database about the location of all other nodes within the network.
5.network is not very scalable as all nodes should have global knowledge of the network and use the greedy rule or algorithm.
4. A.Manjeshwar and D. P. Agarwal
TEEN 1.Data transmission are usually controlled accurately .
2.It is improved version of HEED.
3.
1.Some times needed data are not send by base stations.
2.data is sent by checking the condition of threshold which is time consuming and not easy to work.
5. A. Manjeshwar and D. P. Agarwal
APTEEN 1.low energy consumption.
2.It embodies lots of flexibilities and set the count- time interval and the threshold values for the energy consumption by changing the count as well as threshold values.
1.long delay
2.overhead with forming clusters at multiple levels
6. N. Amjad Dreem-ME 1.Its network lifetime is better than other techniques.
2. It has efficient data packet transmission.
1.It suffers long distance communication. 2.the waste of network bandwidth due to differentiating between nearby and far away MNs
7. G.Smaragdakis, I. Matta and A. Bestavros
SEP 1.It does not require any universal knowledge of energy at each election round
The shortcoming of SEP method is that the election of the cluster heads among the two type of nodes is not dynamic
8. M. Ye, C. Li, G. Chen and J. Wu
EECS 1.The clusters with a large distance to the BS require more energy for transmission than those with a shorter distance, therefore the message overhead is small and CHs are uniformly distributed as compared to LEACH. 2.Clustering is performed by dynamic
1.EECS produces more control overhead complexity because all nodes have to compete with each other for becoming CHs.
sizing based on cluster distance from the BS. 9. Harneet Kour
and Ajay K. Sharma
H-HEED 1.It is superior version of HEED protocol in terms of heterogeneity.
2.It is used to extend the network lifetime
3.Its network reengineered by node replacement technique.
1.It can’t work or out perform well in the homogeneous environment.
Conclusion
Energy saving is amongst the big issues in the network of routing protocols in WSNs. The energy consumption of the sensors lessened by info transmitting as well as receiving.In this paper, we have discussed various energy efficient techniques to reduce energy consumption. It is now concluded that divide and conquer method is the best effective way to reduce energy consumption.
REFERENCES
[1] A.A. Kharazian, K. Jamshidi and M.R. Khayyambashi, “Adaptive clustering in wireless sensor network: considering nodes with lowest energy ”, International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.3, No.2, April 2012.
[2] A.K. Somani, S. Kher, S. Paul, and J. Chen, “Distributed Dynamic Clustering Algorithm in Uneven Distributed Wireless Sensor Network”, 2006. [3] A. Sahu, E.B. Fernandez, M. Cardei, and M. VanHilst “A Pattern for a Sensor Node” Department of Computer and Electrical Engineering and Computer Science Florida Atlantic University, Boca Raton, FL 33431.
[4] B. Amutha , M. Ponnavaikko N.Karthick and M.Saravanan, “Localization algorithm using varying speed mobile sink for wire”, International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010.
[5] B. Mamalis, D. Gavalas, C. Konstantopoulos and G. Pantziou , “Clustering in Wireless Sensor Networks”,2007.
[6] C.G. Izquierdo, F. Bertiglia , “Traceability of ground based meteorological surface temperature measurements”,2012.
[7] D. Niculescu and B. Nath, “Ad hoc positioning system (aps)”, in Global Telecommun. Conf. GLOBECOM 2001, San Antonio, USA, 2001. [8] F. Santos, I.S. Tecnico, “Localization in Wireless Sensor Networks” ACM Journal Name, Vol. V, No. N, November 2008.
[9] G.H. Raghunandan, B.N. Lakshmi, “A Comparative Analysis of Routing Techniques for Wireless Sensor Networks”, Proceedings of the National Conference on Innovations in Emerging Technology, IEEE 2011.
[10] H. Duboris-Ferries and D. Estrin, “Efficient and Practical Query Scoping in Sensor networks,” Tech Rep.2004-39, CENS/UCLA Tech Report, 2004. [11] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci. “Wireless Sensor Networks: A survey” Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia institute of Technology, Atlanta, GA 30332, USA Received 12 December 2001; accepted 20 December 2001.
Efficient Routing in Wireless Sensor Networks” 4th International Conference on Ambient Systems, Networks and Technologies (ANT), 2014
[13] K. Maraiya, K. Kant, N. Gupta “Efficient Cluster Head Selection Scheme for Data Aggregation in Wireless Sensor Network” International Journal of Computer Applications, Volume 23-No. 9, June 2011.
[14] K. Maraiya, K. Kant, N. Gupta, “Application based Study on Wireless Sensor Network” International Journal of Computer Applications (0975 – 8887), Volume 21– No.8, May 2011.
[15] S. Tyagi, N. Kumar, “A systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks” Journal of Network and Computer Applications, Volume 36, Issue 2, March 2013.
[16]G. de Meulenaer, F. Gosset, F.-X. Standaert, and O. Pereira, “On the energy cost of communication and cryptography in wireless sensor networks,” Wireless and Mobile Computing, Networking and Communication, IEEE International Conference on, vol. 0, pp. 580–585, 2008.
[17]Z. Zhi, “A cryptography system for wireless sensor networks based on ibe and cpk algorithms,” Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE, vol. 2, pp. 857–861, 2008.
[18]S. Lindsey, C. Raghavendra. 2002. PEGASIS: PowerEfficient Gathering in Sensor Information Systems. IEEE Aerospace Conference Proceedings, Vol. 3, 9-16 pp. 1125- 1130.
[19]M. Ye, C. Li, G. Chen, J. Wu. 2005. EECS: an energy efficient cluster scheme in wireless sensor networks. In IEEE International Workshop on Strategies for Energy Efficiency in Ad Hoc and
Sensor Networks (IEEE IWSEEASN-2005), Phoenix, Arizona, April 7–9
