,.

Abstract
y

The wireless sensor network is a type of the wireless ad-hoc networks is composed of nodes with limited battery power. Energy saving, energy efficiency, energy balance are important technologies to prolong service life of wireless sensor networks. Wireless sensor network can be Homogeneous and Heterogeneous . Most of the routing algorithm like LEACH, LEACH-C, and PEGASIS etc used homogeneous sensor nodes. The impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources.

Most of the Clustering routing protocols take assumption that all the sensor nodes are having same energy and which results in less advantage of the heterogeneity of the sensor nodes. In this thesis working we took consideration of existing LEACH protocol and then introduce heterogeneity in this existing protocol which increases the time period of the sensor network. Simulation results show that the scheme can gain longer lifetime of wireless sensor network (WSN) than the LEACH protocol.

Introduction
A wireless sensor network is designed to detect events or phenomena, collect and process data, and transmit sensed information to interested users. Basic features of sensor networks are: Self-organizing capabilities Short-range broadcast communication and multihop routing Dense deployment and cooperative effort of sensor nodes Frequently changing topology due to fading and node failures Limitations in energy, transmit power, memory, and computing power

Application of wireless sensor network

Wireless sensor networks are used in various applications but most of the application involved some kind of controlling, monitoring and tracking. In general engineering technology: y Automotive telemetric y In industrial plant y Fingertip Accelerometer virtual Keyboards y Smart office space Agriculture and environment monitoring y Geophysical monitoring
y y

Monitoring of quality of fresh water Planetary exploration

Military applications y Asset monitoring y Protection Health Monitoring Medical sensing y Micro surgery Civil Engineering y Disaster recovery y Monitoring of structures y Urban planning
y

Challenges in Wireless Sensor Networks

y y y y y y y y

Limited and unrechargeable battery Short memory and less computational ability Due to wireless channel bandwidth is low and prone to error Problem of Scalability Fault tolerance Low processing power Connectivity Data reporting model

PERFORMANCE METRICS OF WIRELESS SENSOR NETWORK

y y y y y y y

Latency Accuracy Energy efficiency Fault tolerance Lifetime Scalability Throughput

MOTIVATION AND PROBLEM STATEMENT

1.

Sensor networks re-energization

Due to use of battery and remote area of the sensor networks we all know that the sensor network has the limited life time and there is a need of re energized the wireless sensor network

2.

Constraint on the density of nodes

In many applications we are bound to use given number of nodes and we cannot increase the spatial density of the sensor nodes in the wireless sensor network.

ROUTING IN HOMOGENEOUS WIRELESS SENSOR NETWORKS

Routing algorithm in the WSN has been classified into three main categories : Flat routing 2. Hierarchical routing 3. Location based routing
1.

Flat Routing
In flat routing the task given to all nodes are same so they have the same capability to perform the same work. In this type of routing algorithms number of sensor nodes used is very large so it is not promising to offer a exclusive id to each node.
y y y

Sequential Assignment Routing (SAR) Directed Diffusion Minimum Cost Forwarding Algorithm

Hierarchical Routing
In hierarchical routing all nodes do not perform the same task .In this technique the clusters of sensor node are developed for routing the data from one node to other. Low Energy Adaptive Clustering Hierarchy (LEACH) Power-Efficient Gathering in Sensor Information Systems (PEGASIS) Threshold-Sensitive Energy-Efficient Protocols (TEEN and APTEEN) Small Minimum Energy Communication Network (SMECN) Fixed-Size Cluster Routing Virtual Grid Architecture Routing Hierarchical Power-Aware Routing

y y y y y y y

Location-based Protocols LocationIn location-based protocols, sensor nodes are addressed by means of their locations. Location information for sensor nodes is required for sensor networks by most of the routing protocols to calculate the distance between two particular nodes so that energy consumption can be estimated. Geographic Adaptive Fidelity (GAF) Geographic and Energy-Aware Routing (GEAR) Coordination of Power Saving with Routing Trajectory-Based Forwarding (TBF)

y y y y

A wireless sensor network which is having heterogeneous environment is composed of following three elements:
Sensor nodes (SN) 2. Cluster heads (CH) 3. Base station (BS)
1.

The one of the main protocol is: LEACH protocol

y

LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network

Flow Chart of Cluster Head Selection In LEACH Protocol

Cluster Formation During LEACH

All nodes marked with a given symbol belong to the same cluster, and the clusterhead nodes are marked with

CHARCTERISTICS OF CLUSTER HEAD

y y y y

Cluster head is stronger than other node Cluster head is aware of their location Cluster head have unique node ID Cluster head have more processing power and aggregation of data and they also have the capability of compression of data to reduce the redundancy in the network

Homogeneous vs. Heterogeneous Architectures

In a homogeneous sensor network, the sensor nodes have identical capabilities and functionality with respect to the various aspects of sensing, communication, and resource constraints. In a heterogeneous sensor network, each node may have different capabilities and execute different functions.

Assumptions for Heterogeneity

y y y

y y y y

All nodes are deployed uniformly in the field. In this we assume that some of the node among all the nodes have more power than other nodes. Let us assume that total no of nodes is n and from n number of nodes m nodes are having times greater energy than the normal node. We named the strong node as enhanced nodes and other (1-m) x n nodes as simple nodes. We also consider that all the nodes are static and not mobile. Another assumption is that sink is situated at centre of the wireless sensor network To ensure the connectivity and coverage, all the sensor nodes are having enough communication ranges.

WIRELESS SENSOR NETWORK WITH ALL NODES ACTIVE

WIRELESS SENSOR NETWORK WITH SOME NODES DEAD

PERFORMANCE MEASURES
y

y y

Steadiness region: This is the time phase in which the 1st sensor node became passive from the starting of the network or we can articulate that it is the interval from the starting of the sensor node to the death of 1st sensor node Unsteadiness Region: This is the time period in between when first node die to the time period when last node will die Network lifetime: This is the duration from when the sensor node start working till the last node will become inactive

Number of cluster heads / iteration:This will offer the quantity of nodes which is able to send aggregated data to the sink node directly in each iteration from the members of their cluster. Number of active (total, enhanced and simple) nodes/iteration: We can get the total of the nodes including simple and enhanced node which are still active in the network in every iteration. Throughput: In this we calculate the ratio of data sent from CH TO BS to the data sent from simple nodes to CH.

PROPOSED ALGORITHM
y

The aim of our algorithm to increase the steadiness region of the wireless sensor network with hierarchical clustering using heterogeneity. These parameters are enhanced nodes (m) and the extra energy of these enhanced nodes ( ) . But the overall energy of the structure will not remain the same. Suppose initial energy of the simple sensor node is E0 so the energy of the enhanced node is E0( +1). Total initial energy of this heterogeneous network is: n.(1-m).E0+n.m ( +1) E0=n.E0(1+ m).(1) so we can see that entire energy of the network is improved by a factor (1+ m). This is the first enhancement over existing LEACH that the active period of network is increased in proportion to the increased energy.

The steadiness region of the network can be increased by (1+ m) if

y y y

(i)In every 1/popt (1+ m) iteration per network lifetime every simple node becomes a cluster head. (ii)Exactly in (1+ ) times in every 1/popt (1+ m) iteration per network lifetime a enhanced node becomes cluster head . (iii)n x popt is the average no of cluster head in each iteration per network life time.

PARAMETER USED IN SIMULATION

y

Field Dimensions - x and y maximum (in meters) xm = 100; ym = 100; x and y Coordinates of the Sink sink.x=0.5*xm; sink.y=0.5*ym; Number of Nodes in the field n=100

Optimal Election Probability of a node to become cluster head p=0.1;

Energy Model (all values in Joules) Initial Energy Eo=0.5; Eelec=Etx=Erx ETX=50*0.000000001; ERX=50*0.000000001; Transmit Amplifier types Efs=10*0.000000000001; Emp=0.0013*0.000000000001; Data Aggregation Energy EDA=5*0.000000001; Values for Heterogeneity(Percentage of nodes than are advanced) m=0.1; a=2; (alpha) maximum number of rounds rmax=4999

RESULT FROM LECACH

for m=0.1 and =1 for m=0.2 and =3

Number of dead node

Number of dead node

Number of simple dead node

Number of simple dead node

Number of enhanced dead node

Number of enhanced dead node

Number of cluster head/iteration

Number of cluster head/iteration

OBSERVATION FROM LEACH

y

y y

y y

(i)First node dies after a large number of iteration due to heterogeneity which is an advantage of heterogeneity over homogeneous case where m= =0. (ii)Network lifetime is increased but this does not show that node will send the data. (iii)For m=.2 and =1 and for m=.2 and =3 In both the case LEACH is not able to take the full benefit of heterogeneity because steadiness region for both the case is same. In both cases simple nodes loose activeness very early. (iv)And the probability of the election of cluster head is not optimum. (v) The average count of cluster head in each iteration in each epoch is less than 1 after the death of the major simple nodes so no data transmitted to the sink.

PARAMETER USED IN SIMULATION FOR OUR HETEROGENEOUS AWARE APPROACH

y

Field Dimensions - x and y maximum (in meters) xm = 100; ym = 100; x and y Coordinates of the Sink sink.x=0.5*xm; sink.y=0.5*ym; Number of Nodes in the field n=100 Optimal Election Probability of a node to become cluster head p=0.1;

Energy Model (all values in Joules) Initial Energy Eo=0.5; Eelec=Etx=Erx ETX=50*0.000000001; ERX=50*0.000000001; y Transmit Amplifier types Efs=10*0.000000000001; Emp=0.0013*0.000000000001; y Data Aggregation Energy EDA=5*0.000000001; y Values for Heterogeneity Percentage of nodes than are advanced m=0.1; a=2; (alpha) y maximum number of rounds rmax=4999
y y

SIMULATION RESULTS OF HETROGENEOUS AWARE ALGORITHM

For m=0.1 and a=1 for m=0.2 and a=3

Number of dead node

Number of dead node

Number of simple dead node

Number of simple dead node

Number of enhanced dead node

Number of enhanced dead node

Number of cluster head/iteration

Number of cluster head/iteration

OBSERVATION FROM PROPOSED HETEROGENEOUS AWARE APPROACH

y y y y y

(i)For m=0.1 and =1 steadiness region is increased by some amount but gain is not large (ii)Unsteadiness region is short in this case. (iii)For m=0.2 and =3 proposed algorithm take total benefit of heterogeneity in terms of initial energy. (iv)Steadiness region is increased in comparison to LEACH by a significant percentage. (v)Number of active nodes per node is increased so the unsteadiness region is increased

Throughput For LEACH

for m=0.1 and =1 for m=0.2 and =3

Throughput from cluster head to BS

Throughput from cluster head to BS

Throughput from node to cluster head

Throughput from node to cluster head

FOR PROPOSED HETEROGENEOUS APPROACH

For m=0.1 and a=1 for m=0.2 and a=3

Throughput from cluster head to BS

Throughput from cluster head to BS

Throughput from node to cluster head

Throughput from node to cluster head

SUMMARY OF RESULT
y

The sensitivity of the leach is very high to the heterogeneity in terms of initial energy of nodes it starts unsteadiness operation early in a wireless sensor network Our heterogeneous aware approach can increase the steadiness period of the network by conveying election of cluster head probability weighted by relative starting energy of sensor nodes. Due to extended stability, the throughput of Our heterogeneous aware approach is also greater than that LEACH which is heterogeneity unaware because stability is increased. The result of our heterogeneous aware approach equivalent to the approach in extra initial energy of enhanced node is allocated uniformly throughout the sensor network. Our heterogeneous aware approach is more flexible than LEACH in sensibly expend the extra initial energy of enhanced nodes.

References
1.

W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan, Energy-Efficient Communication Protocol for Wireless Microsensor Networks, in Proceedings of IEEE HICSS, January 2000. S. Bandyopadhyay, E. J. Coyle, An energy efficient hierarchical clustering algorithm for wireless sensor networks, in Proc. IEEE INFOCOM 2003 Conference, vol. 3, pp. 1713-1723, Mar. 2003 W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, An ApplicationSpecific Protocol Architecture for Wireless Microsensor Networks, IEEE Trans. Wireless comm., vol. 1, no. 4, Oct. 2002, pp. 660 670 K. MACA A New Channel Access Method for Packet Radio, ARRL/CRRL Amateur Radio 9th Computer networking conf., September 22,1990. S. Lindsey, C. S. Raghavendra, "PEGASIS Power-Efficient Gathering in Sensor Information System," IEEE Aerospace Conf. Proceedings 2002, Volume 3, pp.11251130, 2002. Manjeshwar and D. P. Agarwal, APTEEN: A HybridProtocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks, in Proc.Intl. Parallel and Distrib. Proc. Symp., pp. 195202 A. Manjeshwar and D. P. Agarwal, TEEN: a Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks,1st Intl. Wksp. on Parallel and Distrib. Comp. Issues in Wireless Networks and Mobile Comp., April 2001.

2.

3.

4.

5.

6.

7.

8.

Q. Li, J. Aslam and D. Rus, Hierarchical Power-Aware Routing in Sensor Networks, Proc. DIMACS Wksp. Pervasive Net., May, 2001. http://www.tinyos.net/tinyos-1.x/apps/Surge/ J. Ai, D. Turgut, and L. Boloni, "A cluster-based energy balancing scheme in heterogeneous wireless sensor networks," in Proceedings of the 4th International Conf. on Networking (ICN'05), pp. 467-474, Reunion, France, April 2005. V. Paruchuri, A. Durresi, L. Barolli Energy Aware Routing Protocol for Heterogeneous Wireless Sensor Networks in Proceedings of the16th International Workshop on Database and Expert Systems Applications (DEXA05) 2005 IEEE. H.Yong Lee, W. K.G. Seah, P. Sun Energy Implications of Clustering In Heterogeneous Wireless Sensor Networks An Analytical ViewThe 17th Annual IEEE International Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC06) R. Wang and G. Liu, C. Zheng A Clustering Algorithm based on Virtual Area Partition for Heterogeneous Wireless Sensor Networks in Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation August 5 - 8, 2007, Harbin, China. V. P. Mhatre, C. Rosenberg, D. Kofman, and N.Shroff, A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint IEEE Transactions on Mobile Computing, Vol. 4, No. 1, pp. ,January/February 2005. V. P. Mhatre, and C. Rosenberg, Homogeneous vs Heterogeneous Clustered Sensor Networks: A Comparative Study, IEEE International Conf on Communications (ICC 2004), vol. 27, no. 1, pp. 3646-3651, June 2004. E. J. Duarte-Melo, and M. Liu, Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks, in Proceedings of IEEE Globecom, Taipei, Taiwan, November 2002.

9.

10.

11.

12.

13.

14.

15.