Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.

com Volume 2, Issue 3, May June 2013 ISSN 2278-6856

An Improved Clustering Machanism to Improve NeworkLife for Underwater WSN

Sanjeev Kumar1, Rohit Sethi2
Student, M.Tech (CSE) Department of CSE/IT, Lovely Professional University, Phagwara, Punjab, India
2 Asstt. Professor, Department of CSE Lovely Professional University, Phagwara, Punjab, India 1

Abstract: Underwater sensor network is one of the major

emerging field comes under the sensor network. But these kind of networks are having the more challenges because of the absence of GPS(Global Positioning System). We are presenting a clustering mechanism in underwater sensor network under the restrictions of localization, floating nodes and the lesser transmission speed. To improve the network life in such network, we have defined a two way node tracking. Each node will track the alive neighbor nodes as well as the base station will perform the tracking with each communication to the cluster head. In this work, we have defined a cluster head selection based on the condition of energy, distance and the maximum connectivity level between the nodes. As the cluster head will die, the next node will be selected from the neighbor list based on the criteria of maximum connectivity and the maximum energy constraint. The main objective of the work is to provide the higher throughput and to improve the network life.

head instead of the base station. The cluster head here perform some aggregative[1] operation over the data and pass it to the base station which is the actual destination for sensed data. The basic architecture of clustered sensor network is shown in figure 1.

Keywords: Underwater, Reliable, Throughput.

Clustered,

Localization, Figure 1: Clustered Sensor Network

1. Introduction
A sensor network[1] is a large network with hundreds or thousands of nodes. These nodes are defined along with some localization and energy parameters. To control the network, the complete network is divided in sub-networks called clusters and each cluster is controlled by a centralized cluster head. Complete network including the cluster heads are controlled by a base station. There are number of issues associated along with sensor networks. These issues includes the high energy consumption during transmission, cluster head selection, node aggregation and localization etc. The presented work is about to provide the solution to improve the network life in a clustered network by performing the effective cluster head selection. To generate a clustered network[2][3] we need some supported protocol such as LEACH. The main work of such routing protocol is to provide reliable and efficient communication over the network. In such protocol architecture the group of sensor nodes are controlled by a CH (Cluster Head) or gateway. In such kind of network the transmission is performed by that group to its cluster Volume 2, Issue 3 May June 2013 The LEACH protocol is one of such clustered architecture[5] based protocol that works in a hierarchical manner. LEACH provides a significant reduction of overall energy over other non clustering protocols. The major benefits of the clustering architecture includes the (i) Low power consumption[4] over the network (ii) Improved fault Tolerance (iii) Reduction of Congestion. In a clustered network[7][9] the main challenge is about the selection of Cluster Head. The cluster head should be elected such that it will reduce the communication over the network. Because of this the network load as well as the energy consumption over the network will be reduced. LEACH protocol itself resolve such provide upto some extent. But even though there are some limitation that it contains. To resolve these problems number of modifications are already done in LEACH protocol and number of other improved LEACH protocols are present such as M-LEACH, V-LEACH etc. The presented work is about the design of an improved tracking approach for the cluster head selection in underwater sensor network. The criteria defined for the cluster head selection is based on Page 43

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
the energy and connectivity parameters. The objective of the work is to improve the network life. under real scenario and the environment. The protocol based implementation and the analysis is discussed in this chaper and relative to the coverage and the connective of the nodes[1]. The localization problem is also discussed in this paper. L. Badia(2006) performed a work on the optimization of the routing and scheduling mechanism respective the scheduling and the deployment of the nodes. The paper also discussed the intelligent scheduling scheme called integer linear programming. The optimization is been discussed along with link scheduling and the node placement in different scenarios[6]. Ian F. Akyildiz(2005) performed a work on the challenges of Underwater. It is a kind of survey work. The paper has discussed different physical architectures under the functional aspects. In this work the analytical research is performed for two and three dimensional underwater sensor networks. More over to it the detail study is performed regarding the cross layered approach in under water sensor network. The paper also suggested some relative solution for the problem domain[2].

2. EXISTING VALUES
In year 2009, Jiejun Kong discussed the problems of localization and time synchronization services in case of underwater communication. The auhor discussed the core problems of these kind of networks such as link capacity, floating mobility etc. The author also suggested an aquatic environment to solve the problems of network attacks and the security analysis. The underwater network is been analyzed to save the network from its basic problems and to improve the network life[1]. In year 2012, another work of localization was performed by Samedha S. Naik. The work includes the work on autonomous nature of the underwater sensor network. The work is about the position system in these scenarios respective to the efficiency analysis and the terrestrial positioning of the nodes. The main objective of work is to identify the communication errors and to increase the network throughput[2]. In year 2011, Dongseung Shin has presented a location based aggregation approach for reliable and effective communication over the network. The approach is beneficial for multicast communication where k ACK based methodology is suggested for performing the communication based on the aggregation algorithm. The author has performed the aggregation of n packets to single to reduce the communication data and to improve the network reliability and the efficiency over the network[3]. An effective time synchronization based approach is suggested by Jun Liue for the underwater sensor network. The author has defined pair wise cross layer scheme to perform the time synchronization over communication. The work was presented by using the kalman filter approach and the improvement is shown by using the dynamic propagation delay. The work was about to increase the network efficiency and the reliability[4]. Muhammad Ayaz(2009) performed a work on Underwater Wireless Sensor Networks: respective to different routing challenges and the issues. Here the different aspects are discussed that can affect the communication parameters, network delay, data rate etc. To get these changes the analysis is performed in terms of propagation delay, topological analysis, bandwidth analysis etc. The paper also explore different routing algorithms along with its comparative analysis under different scenarios and the environments. The presented work includes the relative routing algorithms along with the future work that is possible in each direction[8]. Antonio Caruso(2008) presented the analysis on the mobility model for the underwater sensor network. Here the physical movement of the nodes are analyzed respective to the connectivity, range localization, coverage area etc. The work includes study this network Volume 2, Issue 3 May June 2013

3. CLUSTER FORMULATION
The basic objective on any routing protocol is to make the network useful and efficient. A cluster based routing protocol groups sensor nodes where each group of nodes has a CH(Cluster Head) or a gateway. Sensed data is sent to the CH rather than send it to the BS(Base Station); CH performs some aggregation function on data it receives then sends it to the BS where these data is needed.

Figure 2: Clustered Architecture[1] A number of routing protocols have been proposed for WSN. However, few of them are cluster based. One of the most well known hierarchical protocols is LEACH. This show significant reduction in the overall network energy over other non-clustering protocol. Hierarchical routing protocols designed to reduce energy consumption by localizing communication within the cluster and aggregate data to reduce transmissions to the BS. The set-up phase begins with cluster formation. Suppose there are N nodes in the network, in order to ensure certain number of cluster is formed during each round, each sensor elects itself at the beginning of the round with a probability Pi (t) chosen such that the expected number Page 44

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
of cluster head nodes for this round is kc, the choice of probability is based on the assumption that every node has the same level of energy at the beginning of the network and also each node has data to send in each round. To complete the set-up phase, each node sends a join-request message after they receive a broadcast from the elected cluster-heads using a non-persistent CSMA MAC (Carrier Sense Multiple Access/Media Access Control) protocol. The cluster-head creates a TDMA(Time Division Multiple Access) as shown in the LEACH flow chart and finally the nodes forming each cluster wait for their schedule before transmission. The steady phase starts immediately after the set-up phase. The clusterPerform the Energy and Response Time analysis of each node formation of node i. The probability vector is based on the energy level of the node i.e. more the energy a node having, more chances of selecting as the CH. To setup the cluster head, each node send a request message to get elected as cluster head. The basic flow of the cluster head selection is shown in the figure 3. In the original Protocol, the CH is always on receiving data from cluster members, aggregate these data and then send it to the BS that might be located far away from it. The CH will die earlier than the other nodes in the cluster because of its operation of receiving, sending and overhearing. When the CH die, the cluster will become useless because the data gathered by cluster nodes will never reach the base station. In proposed protocol, besides having a CH in the cluster, there is a CH that takes the role of the CH when the CH dies because the reasons we mentioned above by doing this, cluster nodes data will always reach the BS; no need to elect a new CH each time the CH dies. This will extend the overall network life time. The improvement over the existing work is defined in next section.

Identify the connectivity count of each node over the network

4. PROPOSED WORK
Identify the node with maximum residual energy and maximum connectivity The presented work is the improvement over the existing clustering protocol to increase the network communication and the network life. The improvement is defined under two main factors (i) The maintenance of tracking table for the node localization (ii) selection of the cluster head over the network. The main cluster head selection parameters defined in this presented work are (i) Maximum Connectivity Parameter (ii) Maximum Energy (iii) Response Time. The algorithm defined for the proposed work is given as under Algorithm(Nodes,N) { (i) Design a network with N number of nodes and with specific constraints like energy, position etc. (ii) Define the base station called bs for the network. (iii) Define the probalistic vector for the selection of cluster head. Initially the probability vector will be defined equally (iv) Generate a neighbor list to track the neighboring nodes so that the node monitoring will be performed and the chances of node loss will be reduced. (v) Set PClusterHead=1; (vi) Set MaxEnergy=0 (vii) Set MaxConnectivity=0 (viii) Set MinResponseTime=Inf Page 45

Send Request to elect as Cluster head

Select node as the Cluster head and update tracking tables Figure 3 : Cluster Head Selection Procedure

heads gather all data from their respective cluster members. The cluster-heads performs data aggregation using signal processing techniques before sending the refined data to the BS in each round. The idea of the TDMA schedule ensures the efficient use of the bandwidth and the data aggregation process reduces communication cost and energy, thus, improving the network life-time. The sections that follow discuss variants to LEACH protocol that were proposed as an improvement by extending the network life-time. Most of these schemes are more of energy management techniques rather than cost-based models. In a clustered network[6][8] the work begins with the cluster formation. To start the work we need to define the number of required clusters over the network with each round of communication. Each node of the network is defined by some probability vector Pi, this probability vector ensures that the effectiveness of the cluster Volume 2, Issue 3 May June 2013

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
(ix) For i=1 to n (x) { (xi) ProbabilityVector(Node(i)) = Energy(Node(i))*ProbabilityVector(Node(i))+ (1ProbabilityVector(Node(i)))* EnergyConsumed(Node(i)) (xii) If (ProbabilityVector(Node(i))>.5) (xiii) { (xiv) If(Energy(Node(i))> MaxEnergy ResponseTime(Node(i))< MinResponseTime ConnectivityVector(Node(i))>MaxConnectivity (xv) { (xvi) Set MaxEnergy=Energy(Node(i)) (xvii) Set MinResponseTime= ResponseTime(Node(i) (xviii) Set ConnectivityVector(Node(i)) (xix) Set PClusterHead=i (xx) } (xxi) Else if(i!= PClusterHead And (xxii) { (xxiii) Set CClusterHead=i Energy(i)=Max) MaxConnectivity= And And and important parameter is the response time. The response time depict the congestion free node. A node already having the heavy load cannot be selected as the cluster head. During the selection of cluster head, the vice cluster head will also be selected. In this present work, the vice cluster head selection is also performed in an effective way. Instead of getting request from all nodes again for the vice cluster head selection. In this work, we have listed the most neighboring nodes of the cluster head. The neighboring node with maximum energy and minimum response time will be selected as the vice cluster head. The presented work will save the time taken to perform the selection of vice cluster head. Because of this over all life of the network will be improved. The procedure begin with the localization of the nodes under defined energy parameters. To perform the cluster head selection, At first calculate the distance between the cluster head and the sensor node, which have the shortest distance that node join that cluster. The second parameter is the energy and third parameter is residual Energy. As a cluster head will be selected with minimum distance and maximum energy. We will also select the Vice Cluster Head. The Cluster head is that alternate head that will work only when the cluster head will die. Now CH receives data from Non-CH nodes and aggregates them. And send to the BS. If the distance between the CH and the BS is more than here we used multi-hopping concept, acc to this if the distance between the CH and the BS is more than one CH send data to the other CH which is more closer to the BS. Now energy dissipated is calculated and subtracted from the remaining energy of every node and if some nodes are having energy less than minimum than those nodes are deleted from the network and the life time close .and we get the output. The proposed approach will improve the network life as never the cluster head will die. As a cluster head will die it will be replaced by its new Cluster head. The algorithm for the proposed work is given as under. As we can see in the above algorithm, it provide the cluster head selection as well as the Vice cluster head selection under the defined parameters. The cluster head election will be performed under the distance, energy and the minimum connectivity parameters whereas the proposed work will perform the selection under the parameter of maximum energy constraints. The PClusterHead will maintain the communication over the network and the Vice cluster head will be activated as the primary cluster head dies. The presented work will improve the network throughput and the network life.

(xxiv) [Set the Vice Cluster Head] (xxv) } (xxvi) } (xxvii) If(Energy(PClusterHead)<0) (xxviii) { (xxix) PClusterHead=CClusterHead (xxx) } (xxxi) } (xxxii) } The maximum connectivity parameters is the distance based analysis of the cluster head with all other nodes. The node that is centralized and having the minimum distance ratio with all nodes will be selected as the cluster head. Along with distance, the another parameter included here is the maximum energy. The centralized node that will be selected as the cluster head must have the maximum energy among all other nodes. The third Volume 2, Issue 3 May June 2013

5. CONCLUSION
In this presented work, we have presented an effective clustering mechanism for the underwater sensor network. The cluster head selection will be done based on the basis on maximum energy and the maximum connectivity count. The work is to maintain the two ways tracking of Page 46

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
the nodes to perform effective communication and clustering over the network. The proposed work will improve the network life as well as improve the network communication. It is expected that the network will be more reliable and provide the higher communication. [14] Umberto M. Cella, Wireless Sensor Networks in Coastal Marine Environments: a Study Case Outcome, WUWNet'09, 978-1-60558-821-6 [15] Zhong Zhou, Localization for Large-Scale Underwater Sensor Networks. [16] Yogesh Kumar, Enhanced Energy Conserving Improved and Balanced LEACH for Heterogeneous Wireless Sensor Networks, International Journal of Computer Science & Engineering Technology (IJCSET), Vol. 3 No. 9 Sep 2012, pp 422-430

References
[1] Jiejun Kong (2005),"Low-cost Attacks against Packet Delivery, Localization and Time Synchronization Services in Under-Water Sensor Networks", WiSE05, September 2, 2005, Cologne, Germany. Pp. 87-96 [2] Samedha S. Naik (2012),"Self Organizing Localization Algorithm for Large Scale Underwater Sensor Network", 978-1-4673-0255-5/12@2012 IEEE, pp 207-213 [3] Dongseung Shin (2011)," Location-based k-ACK Aggregation Method for Underwater Sensor Networks", 0-933957-39-8 2011 MTS [4] Jun Liu (2011) ," TSMU: A Time Synchronization Scheme for Mobile Underwater Sensor Networks", 978-1-4244-9268-8/11 2011 IEEE [5] Antonio Caruso, The Meandering Current Mobility Model and its Impact on Underwater Mobile Sensor Networks, IEEE INFOCOM 2008 978-1-42442026-1/08 2008 IEEE [6] Ian F. Akyildiz, Underwater acoustic sensor networks: research challenges. [7] Jiejun Kong, DISRUPTING PACKETDELIVERY, LOCALIZATION AND SYNCHRONIZATION SERVICES IN UNDER-WATER SENSOR NETWORKS. [8] Jiejun Kong, Low-cost Attacks against Packet Delivery, Localization and Time Synchronization Services in Under-Water Sensor Networks, WiSE05, 1-59593-142- 2/05/0009 [9] Kenneth P. Hunt, Short Paper: Antennas for Mussel-Based Underwater Biological Sensor Networks in Rivers, WUWNet10, 978-1-45023/09/0010 [10] Muhammad Ayaz, Underwater Wireless Sensor Networks: Routing Issues and Future Challenges, MoMM 2009 ERPAS 978-1- 60558-6595/09/0012. [11] Salvador Climent, Short Paper: Impact Analysis of Different Scheduling and Retransmission Techniques on an Underwater Routing Protocol, WUWNet11, 978-1-4503- 1151-9 [12] Slim Rekhis, A Wireless Sensor Network Based Water Monitoring System, Q2SWinet12 978-14503-1619-4/12/10 [13] Umberto M. Cella, Electromagnetic Wave Wireless Communication in Shallow Water Coastal Environment: Theoretical Analysis and Experimental Results, WUWNet'09 978-1-60558-821-6

Volume 2, Issue 3 May June 2013

Page 47