CHAPTER 1 INTRODUCTION

1.1 INTRODUCTION TO PROJECT: In the recent years, as the development of wireless sensor networks people has done some research on cluster-based protocol, about the prolongation of the lifetime of WSN and decrease of energy consumed by the sensors.. With clustering, a network is subdivided into smaller groups called clusters and each cluster would have a head at a time, in many cases called the cluster-head (CH), while other nodes join cluster as members. These member nodes forward data to CH where they are processed and forwarded to base-station through a hierarchy of CHs. A CH may be elected by the sensors in a cluster or pre-assigned by the network designer. A CH is responsible to transmit any information sensed by the nodes in its cluster and may aggregate and compress the data before sending it to the base station. Cluster head are selected randomly and other cluster nodes transmit data to their cluster head. Cluster head receives this data and performs signal processing functions on the data and transmits data to the base station. Data is sent from the cluster head nodes to the BS using a fixed spreading code and CSMA. Cluster Head node sets up a TDMA schedule for data transmission coordination within the cluster. In an existing System there is no cluster formation and cluster head selection. All the nodes are heterogeneous and it can transmit their data directly to the BS free from cluster heads. So, Energy is consumed. In the proposed system all the nodes are not active at all the time. Probably few of the nodes only active at a time in the basis of BS .
1

Remaining nodes are inactive. Periodically they are active after receiving the awake message from BS. Here, Time scheduling is maintained by the BS. The node which is far away cannot sense the BS. In that condition the node sent the data through neighbor node. Energy is consumed due to the periodic activation of nodes. 1.2 LITERATURE SURVEY LEACH is the most popular clustering algorithm. Many of cluster head selection algorithms are based on LEACH's architecture. It is proposed to elect the CHs according to the energy remaining in each node. In [1] the authors V. Loscri, G. Morabito and S. Marano proposed a system. Cluster head selected and it collects and aggregates the data from sensors nodes in its own cluster and passes the information to the BS directly. CH might be located far away from the BS, so it uses most of its energy for transmitting and the main drawbacks is it always all the nodes are in on state and it will die faster than other nodes. In [2] the authors G. Gupta and M. Younis has proposed a system that an algorithm to network these sensors into well define clusters with less energy constrained gateway nodes acting as cluster heads, and balance load among these gateways. An approach to cluster unattended wireless sensors about few high energy gateway nodes and balance load among these clusters.The gateway node acts as a centralized manager to handle the sensors and serves as a hop to relay data from sensors to a distant command node. If nodes are not uniformly distributed around the gateways the clusters formed will be varied load, which will affect the lifetime and energy consumption of the system.

In [3] the authors S. Lindsey, C.S. Raghavenda has developed an system that PEGASIS, a greedy chain protocol that is near optimal for a data-gathering problem in sensor networks. PEGASIS outperforms LEACH by eliminating the overhead of dynamic cluster formation, minimizing the distance non leader-nodes must transmit, limiting the number of transmissions and receives among all nodes, and using only one transmission to the BS per round. Distributing the energy load among the nodes increases the lifetime and quality of the network. the clustering algorithms are designed for homogeneous wireless sensor networks and they are not optimized when network's nodes is in heterogeneous state.But PEGASIS is homogeneous sensor nodes. 1.3 WORK OBJECTIVE The main objective is:

To reduce the over all power consumption To increase the network life time in heterogeneous Wireless sensor networks. To reduce overall power consumption, maximize the network lifetime in a

heterogeneous wireless sensor network. In this protocol, there is no cluster formation and cluster head selection. Every node sends the data directly to the base station. After receiving the data the BS sends a sleep message to the node. The node started to sleep till the BS sends the awake message. The node far from BS transmit the data through the neighbor nodes. At last, the simulation results shown that it achieves longer lifespan and reduce energy consumption in wireless sensor networks.

SOFTWARE TOOL USED Network simulator 2

1.4 REPORT ORGANISATION The entire report is organized into seven chapters. Introduction to this project, objective of the project work and literature review forms the first chapter. `The second chapter explains about the wireless sensor networks. The third chapter deals with the performance evaluation clustering in homogeneous network. The fourth chapter deals with the performance evaluation clustering in heterogeneous network. The fifth chapter shows the simulation results. The six chapter deals with the performance analysis. The sixth and seventh chapter concludes the report with future work.

CHAPTER 2 WIRELESS SENSOR NETWORK

2.1 INTRODUCTION Wireless sensor networks have generated much research interest in recent years as advances in electronics technology have made them feasible. In general, such a network consists of many nodes scattered over an area to provide distributed sensing and data processing . These networks can enable unattended monitoring of physical quantities over large areas on a scale that would be prohibitively expensive to accomplish with humans. Many uses have been suggested for wireless sensor networks, including habitat and medical monitoring . All of these sensors have similar goals, such as small physical size, low power consumption, and rich sensing abilities. In addition, the Tiny os project provides a framework for designing flexible distributed applications for data collection and processing across a sensor network. Many sensor network applications require the collection of data over long periods of time. Sensor nodes are generally powered with batteries, putting a limit on how small the node can be made for a given lifetime. Wireless sensor systems will enable fault tolerant monitoring and control of a variety of applications. Due to the large number of micro sensor nodes that may be deployed and the long required system lifetimes, replacing the battery is not an option. Sensor systems must utilize the minimal possible energy while operating over a wide range of operating scenarios. With recent advances in MEMS technology and its associated interfaces, signal processing, and RF circuitry, the focus has shifted away from limited macro sensors communicating with base stations to creating wireless networks of communicating micro sensors that aggregate complex data to provide rich, multi- dimensional pictures of the
5

environment. While individual micro sensor nodes are not as accurate as their macro sensor counterparts, the networking of a large number of nodes enables high quality sensing networks with the additional advantages of easy deployment and fault tolerance.These characteristics that make micro sensor side all for deployment in otherwise inaccessible environments where maintenance would be inconvenient or impossible.

Fig 1.1:wireless sensor field

2.2 CHARACTERISTICS OF WSN:

Power consumption constrains for nodes using batteries or energy harvesting.

Ability to cope with node failures Mobility of nodes

6

 Dynamic network topology

Communication failures

Scalability to large scale of deployment Ability to withstand harsh environmental conditions Ease of use Unattended operation Power consumption

2.3 NODES
Sensor nodes can be imagined as small computers, extremely basic in terms of their interfaces and their components. They usually consist of a processing unit with limited computational power and limited memory, sensors or MEMS (including specific conditioning circuitry), a communication device (usually radio transceivers or alternatively optical), and a power source usually in the form of a battery. Other possible inclusions are energy harvesting modules, secondary ASICs, and possibly secondary communication devices (e.g. RS-232 or USB). The base stations are one or more components of the WSN with much more computational, energy and communication resources. They act as a gateway between sensor nodes and the end user as they typically forward data from the WSN on to a server. Other special components in routing based networks are routers, designed to compute, calculate and distribute the routing tables. Many techniques are used to connect to the outside world including mobile phone

networks, satellite phones, radio modems, long-range Wi-Fi links etc. Many base stations are ARM-based running a form of Embedded Linux. Energy is the scarcest resource of WSN nodes, and it determines the lifetime of WSNs. WSNs are meant to be deployed in large numbers in various environments, including remote and hostile regions, where ad-hoc communications are a key component.

2.4 HETEROGENEOUS NETWORKS

A heterogeneous network is a network connecting computers and other devices with different operating systems and/or protocols. For example, local area networks (LANs) that connect Microsoft Windows and Linux based personal computers with Apple Macintosh computers are heterogeneous.The word heterogeneous network is also used in wireless networks using different access technologies. For example, a wireless network which provides a service through a wireless LAN and is able to maintain the service when switching to a cellular network is called a wireless heterogeneous network. In this model there is a common core network that deals with all network functionality and operates as a single network. Different radio access networks handle only those functions specifically related to a distinct radio access technology(modulation, etc.). In general the wireless access radio incorporates the physical and link layer only.Between access networks belonging to common core is based on lower network layers (link layer or network layer). This reduces the overhead, and performance. A major obstacle of this model is that the different access networks must converge, which requires a standardization effort and business commitment to support it.
8

2.4.1 MODELS OF HETEROGENEOUS NETWORK The are several architectures using multiple different wireless networks. The basic models are illustrated by two wireless networks, network A and network B. The main distinction between these models is the layer on which the wireless networks communicate. A. Tunneled network - In this model, a user has a service agreement with operators of several wireless access networks independently. Based on some policy,the optimal network for the requested service is selected.The hybrid core tunnels the traffic across the Internet and the selected access network to the mobile host. This system requires no modification to existing access networks. Main disadvantage is that connectivity between networks is based on relatively high network layers of the Internet (i.e. transport layer), increasing service latency. B. Hybrid network - In this model we have a hybrid core that interfaces directly between the wireless access networks and the Internet. In this model the wireless networks implement the network layer. Advantages are that this in model there will be less duplicate functions, and that it is able to offer advanced services at the network or data link layer (e.g. it can provide a better handover between the access networks). Notice our differentiation between hybrid and heterogeneous. Often, the various kinds of architectures are all referred to as hybrid. We prefer to call them heterogeneous to stress the fact that there can be multiple networks simultaneously, all working together. Hybrid networks describe the more traditional view of having multiple networks of which one can be chosen to use. As described above, existing systems use their own to provide services to mobile users. Moreover, they all have
9

their own infrastructure for e.g. signaling, handover, and billing. This makes it very difficult for existing network systems to cooperate efficiently. Convergence of current wireless systems is practically only possible at the higher layers of the network protocol stack. The main disadvantages of this solution are that many functions are duplicated, and because of its inefficiency, internetworking between the access networks is not convenient, and seamless handover between different access networks are likely to be impossible.

10

CHAPTER 3 PERFORMANCE EVALUATION CLUSTERING IN HOMOGENEOUS NETWORK 3.1 LEACH

Leach is defined as LOW ENERGY ADAPTIVE CLUSTERING HIERARCHY. Random node broadcasts to its neighbors its intent to be the head of a cluster. Each neighbor might receive many invitations to join the clusters. However, it selects which cluster it wants to be a member. Once all nodes are organized, each head makes a schedule for each of its member nodes. And then, these heads also belong to higher level clusters and so on until they hit the base at the top level. In LEACH protocol, energy efficiency are achieved by being CH in turn, and then distributing impartially the total networks energy to unique node, thus lowing energy consuming and increasing network lifespan. CH election depends on the whole numbers of CH in networks and times that nodes have been CH until now. Principles scenarios for this protocol are:

The base station fixed in no where near of the sensor nodes. All the nodes in the wireless sensor network have the same initial battery power and are homogeneous in all other ways.

For each node, a random number between 0 and 1is generated. If this random number is less than T(n) , this sensor node will become a cluster head in this round and broadcast an advertisement message to other sensor nodes near it. When each node has elected as cluster head itself for the current round broadcasts an
11

advertisement message to the rest of the nodes in the network. All the non-cluster headnodes, after receiving this advertisement message, decide on the cluster to which they will belong for this round. This decision is based on the received signal strength of the advertisement messages. After cluster head receives all the messages from the nodes that would like to be included in the cluster and based on the number of nodes in the cluster, the cluster head creates a TDMA schedule and assigns each node a time slot when it can transmit. 3.2 SETUP PHASE AND STEADY STATE PHASE

Fig:3.1:Time line showing for LEACH

SETUP PHASE: Cluster head are chosen in the setup phase. STEADYSTATE PHASE:

12

Fig 3.2:flow diagram for steady state phase

TDMA schedule is used to send data from node to cluster head. Cluster head aggregates the data received from nodes in the cluster.

Communication is via direct-sequence spread spectrum (DSSS) and each cluster uses a unique spreading code to reduce inter-cluster interference.

Data is sent from the cluster head nodes to the BS using a fixed spreading code and CSMA Nodes are all time synchronized and start the setup phase at same time. BS sends out synchronized pulses to the nodes. Cluster Head must be awake all the time. To reduce inter-cluster interference, each cluster in LEACH communicates using direct-sequence spread spectrum (DSSS). Data is sent from the cluster head nodes to the BS using a fixed spreading code and CSMA. 3.3 ALGORITHM FOR CLUSTER FORMATION
13

Fig 3.3:flow chart for cluster formation

Cluster Heads broadcasts an advertisement message (ADV) using CSMA MAC protocol. ADV = nodes ID + distinguishable header. Based on the received signal strength of ADV message, each non-Cluster Head node determines its Cluster Head for this round.

Each non-Cluster Head transmits a join-request message (Join-REQ) back to its chosen Cluster Head using a CSMA MAC protocol.

Join-REQ = nodes ID + cluster-head ID + header. coordination within the cluster.

Cluster Head node sets up a TDMA schedule for data transmission TDMA Schedule Prevents collision among data messages.

Energy conservation in non cluster-head nodes.

3.4 CHARACTERISTICS OF LEACH

14

Better energy utilization and system lifetime

Load balancing is achieved All nodes die at a time 3.5 DRAWBACKS The cluster heads are selected randomly so that the nodes lose their energy and die faster.

CHAPTER 4 PERFORMANCE EVALUATION IN CLUSTERING IN HETEROGENEOUS NETWORK 4.1 NEAP

Neap is defined as NOVEL ENERGY ADAPTIVE PROTOCOL. The major application of a wireless sensor network is to monitoring of a remote environment. Data of individual nodes are usually not very important. Since the data of sensor nodes are correlated with their neighbor nodes, data aggregation can increase reliability of the measured parameter and decrease the amount of traffic to the base station. NEAP uses this observation to increase the efficiency of the network. in order to develop the NEAP, some assumptions are made about sensor nodes and the Underlying network model. For sensor nodes, it is assumed that all nodes are able to transmit with enough power to reach the BS if needed, that the nodes can adjust the amount of transmit power, and each node can support
15

different Medium Access Control (MAC) protocols and perform signal processing functions.

In this protocol, there is no cluster head selection and clustering formation. All the nodes are heterogeneous. Every node can send the data to base station. The node senses the BS only to few distances. If one node looses more energy or too far from base station, it transmits data to the neighbor node. The neighbor node transmits data to the base station. Before transmission all the nodes sends hello messages to all the nodes to show that all the nodes are active.BS will allocate the separate interface for all the nodes for the TDMA schedule. The TDMA schedule is used to i. Prevent collision ii. Energy conservation in nodes.

16

P o o e mt o r p s d eh d

nd s oe

B S D ta a lo ss

At initial stage, except some nodes all other nodes are made to sleep by BS.BS sends a sleep message to some of the nodes except the node from which BS going to receive data. BS only controls all the nodes of sending sleep and awake messages. So that the network life time is increased energy spent is reduced. TDMA schedule is used to send data from node to BS.

Communication is via direct-sequence spread spectrum (DSSS) and each cluster uses a unique spreading code to reduce inter-cluster interference.

Data is sent from the nodes to the BS using a fixed spreading code and CSMA Nodes are all time synchronized and start the setup phase at same time. BS sends out synchronized pulses to the nodes.

To reduce inter-cluster interference, each nodes communicates using directsequence spread spectrum (DSSS).

Data is sent from the nodes to the BS using a fixed spreading code and CSMA.

17

4.2 CHARACTERISTICS: i.Better energy utilization ii. Load balancing is achieved iii. All nodes die in a same time. 4.3 ADVANTAGES & DISADVANTAGES: I. II. III.
IV.

Network life time is increased . Energy consumption Data loss due to in sufficient energy. Possibilities of malware nodes attack due to accepting of neighbor nodes data.

CHAPTER 5 SIMULATION RESULTS 5.1 SIMULATION PARAMETER

Protocol Used: LEACH & NEAP Physical Layer: 802.11a MAC Layer No. Of Nodes : 802 : 50

18

5.2 FORMATION OF NODES AND CLUSTER HEAD FOR 50 NODES IN LEACH TOTAL NUMBEROF NODES =50

19

Fig 5.1:formation of cluster head for 50 nodes

The total number of nodes are created (nodes=50) and the cluster head are selected randomly.The nodes starts to transmit the data towards cluster head and the cluster head forward the data to master head(sink).The red colour circled nodes are cluster head,blue are nodes and orange is a sink.In this figure the total number of node is 50.so the data transmission from nodes to cluster head is more higher.

5.3 NODES GET IDLE

20

Fig 5.2:idle nodes

The most of the nodes lost their energy and become idle.some of the cluster head also lose their energy while transmitting the data.All nodes turns into silver colour.the nodes lost their power by transmitting the more datas to the cluster head.

21

5.4 EXISTING SYSTEM:ALL THE NODES ARE ACTIVE IN NEAP TOTAL NUMBER OF NODES =50

Fig 5.3: all nodes are active

As shown above, the total number of nodes are created (nodes=50) . The nodes starts to transmits the data towards the BS (sink). The yellow colour circled node is sink and green colour nodes are all active nodes.

22

5.5

NODES GET IDLE

Fig 5.4: nodes get idle

The nodes are transmitting the data to the BS and some nodes are started to lose their energy and it become idle without energy.The idle nodes are shown in silver colour. Slowly most of the nodes will lost their energy after the transmitting the data and turns into silver.

23

5.6

PROPOSED METHOD:

TOTAL NUMBER OF NODES=50

Fig 5.5: some active nodes

The total number of nodes are created (node=50). All the nodes are active at the beginning. After the ack message is send and received the BS send a sleep message to all the node except one node. The blue colour circled nodes are all active nodes and yellow is a sink.

24

5.7: ONLY SOME NODES ARE ACTIVE

Fig 5.6: some nodes are active

All the nodes are made to sleep by BS except some node.BS collects data from the awake nodes. After receiving data from the respective nodes the BS make to sleep the nodes and the BS send awake message to some other nodes. The green colour circled nodes are a awake nodes.

25

CHAPTER 6 PERFORMANCE ANALYSIS 6.1 TIME VS TOTAL ENERGY SPENT IN 50 NODES FOR LEACH

Fig 6.1: time vs total energy spend for 50 nodes in leach

The graph shows the total number of average energy spend for the 50 nodes.The energy is calculated in terms of joules.The graph gradually decreases from top to bottom is based on the number datas are transmitted.If more number of datas are transmitted from nodes means that the energy spend in a node will be higher. nodes will transmit the data because all nodes have only initial energy.
26

6.2 TIME VS TOTAL ENERGY SPENT IN 50 NODES FOR NEAP

Fig 6.2: time vs total energy spend in 50 nodes

The graph shows the total number of average energy spend for the 50 nodes in the neap. The energy is calculated in terms of joules. The graph gradually decreases from the top to bottom is based on the number datas are transmitted.

27

6.3 TIME VS TOTAL ENERGY SPENT FOR PROPOSED METHOD

Fig 6.3:time vs total energy spend for 50 nodes

The graph shows the total number of average energy spend for the 50 nodes. The energy is calculated in terms of joules. The graph gradually decreases from the top to bottom is based on the number datas are transmitted.

28

6.4 COMPARISION OF LEACH,NEAP & PROPOSED SYSTEM

Fig 6.4: comparison graph of leach, neap & proposed system

The above graph shows the performance of leach, neap and proposed system. Leach and neap are the existing methods. Neap has better performance when compared to leach and the proposed system has the better energy efficient among the leach and neap.

29

6.5 ENERGY REMAINING IN THE PROPOSED SYSTEM

Fig 6.5: energy remaining in the nodes

The above graph shows the energy remaining in the proposed system. By the proposed system, the node energy is saved upto 88 joules in the network. The Xaxis shows the time and Y-axis shows the energy saved in terms of joules.

30

CHAPTER 7 CONCLUSION AND FUTURE WORK

7.1 CONCLUCION Thus the nodes are formed in the wireless sensor network. The total number of nodes 50 are generated, and then the datas are transmitted. The total average energy spend is calculated for both methods. Thus the proposed method is more

efficient then the existing method.

7.2 FUTURE WORK

i.

All the nodes are inter connected, so that there is a possibility of malware node attack. To avoid that Cryptography with digital signature in this protocol will be implemented. So that it would help to detect malware node and reduce the data loss.

31

REFERENCES

[1]

V.Loseri, G.Morabito and S.Marano A Two Level Hierarchy For Low IEEE Internatioal Conference On

Energy Adaptive Clustering Hierarchy in Vehicular Technology 2005.

[2]

G.Gupta and M.Younis, "Load-Balanced Clustering in Wireless Sensor

Networks", in the Proceedings of International Conference on Communication (ICC2003), Anchorage, AK, May 2003.

[3]

S. Lindsey, C.S. Raghavenda, "PEGASIS: power efficient gathering in

sensor information systems", Proceeding of the IEEE Aerospace Conference, Big Sky, Montana, March 2002.

[4]

Mehdi Golsorkhtabar, Farzad Kaviani Nia, Mehdi Hosseinzadeh The Novel

Energy Adaptive protocol for Heterogeneous Wireless Sensor Networkson 3rd IEEE International Conference in Computer Science and Information Technology (ICCSIT), 2010.

32