SWITCHING BETWEEN ACTIVE AND SLEEP MODE IN UNDERWATER WIRELESS SENSOR NETWORKS TO EXTEND NETWORK LIFETIME

Transcription

1 SWITCHING BETWEEN ACTIVE AND SLEEP MODE IN UNDERWATER WIRELESS SENSOR NETWORKS TO EXTEND NETWORK LIFETIME D.Saranya Department of Electronic and Communication Engineering, Valliammai Engineering College Chennai, Tamilnadu K.Arthi Department of Electronic and Communication Engineering, Valliammai Engineering College Chennai, Tamilnadu Abstract--- Underwater wireless sensor networks (UWSN) is recently proposed to observe aquatic environments. It uses acoustic technology for underwater communication. A new clustering method is used to handle similarity between node readings which are sent periodically to the cluster-head. A two tier data aggregation technique is proposed. First level the node periodically cleans its reading to eliminate data redundancies. At second level an enhanced K-mean algorithm based on one way ANOVA model is applied on the cluster head in order to identify nodes generating identical data sets and aggregated them before sending to sink. In this project, we propose a sleep scheduling method to reduce the energy consumption of sensor node in UWSNs. The sensors are scheduled in a manner that the node generating redundant data will not be active at same time. So that the sensor nodes will conserve more energy and increase network lifetime. Our experimental results show that this technique largely reduces data redundancies thus extending the network lifetime. protocols are proposed in UASN. In which few protocols consider sensor readings similarity and the correlation between received data. But, the lack of suitable energy efficient protocols for handling correlations leads us to study the data aggregation and clustering protocol that creates clusters of nodes with identical readings. Index Terms- Underwater Wireless sensor network, K-mean clustering, ANOVA model, Data aggregation, Network Lifetime, Switch between active and sleep mode. I. INTRODUCTION Underwater Wireless Sensor Network consists of a large number of sensors that are deployed in aquatic environment. They are capable of monitoring the surroundings and explore the underwater environments. In Underwater Wireless Sensor Networks (UWSNs) the sensor nodes are deployed in the oceans which are responsible for collecting the sensed information and send it to the sink. The effectiveness of the UWSNs lie in their sensing quality, flexibility, coverage, etc., they can offer. Node clustering and Data aggregation are the two methods to organize data traffic and reduce in network redundancies. Node clustering makes the network smaller and it extends the network lifetime. Data aggregation is used to minimize the energy consumption by eliminating data redundancies. These two techniques combines to improve the network performances. Many clustering Figure 1. 2-D Underwater Sensor Network Architecture The ultimate goal of the UWSNs deployed in the underwater environments is often to deliver the sensing data from sensor nodes to sink node and then conduct further analysis at the sink node. Data collection becomes an important factor in determining the performance of such UWSNs. APPLICATION OF UWSNs Environmental Monitoring, Real-time warship Monitoring, Locating mooring positions and submerged wrecks, Disaster prevention, Oceanographic data collection, Mine reconnaissance,

2 Assisted navigation, Undersea explorations, Tactical surveillance. The similarities between the collected data sets are defined using two different functions. They are similar function and measure weight function. II RELATED WORK CLUSTER-BASED FALSE DATA FILTERING SCHEME In sensor networks, the adversaries can inject false data reports from compromising nodes. Previous approaches for filtering false reports share keys between the source node and its upstream nodes on the path to sink, and rely on intermediate nodes to verify the reports generated by downstream nodes in a probabilistic manner. As a result, false reports have to travel several hops before detected. Worse still, these schemes haven't balanced the overheads of all nodes in the process of keys distributing. In response to these, this project proposes a clusterbased filtering scheme, in which nodes are grouped into clusters once deployed by employing some strong nodes act as cluster heads. Then a distributed method of keys assignment is proposed by constructing a sink-rooted tree which comprises of all the cluster heads, guarantees that the keys of a source cluster are stored by several forwarding clusters close to it and thus to filter false reports generated by the source cluster during several hops during forwarding, further, the number of authentication keys held by the forwarding clusters getting smaller with the distance increase from the source cluster and thus to balance the keys stored by each forwarding cluster. The major disadvantages of this filtering scheme are that they failed to maintain network lifetime and it consumes large amount of energy. III CLUSTER-BASED ARCHITECTURE A 2-D UWSN with cluster based architecture is considered in this paper. Clustering is the efficient topology control method used to increase network lifetime and scalability. The network is divided into a number of clusters in clustering scheme in which each cluster has a CH. Cluster Head manages the clusters. Single-hop communication is used for the data transmission between the sensor nodes and the CH. The periodic data collection system is used in which the sensor sends its data periodically to the CH. The CH sends the received data sets to the sink which is also performed periodically. A two tier data aggregation based transmission efficient technique is proposed. This technique is applied at each cluster. First level the node periodically cleans its reading to eliminate data redundancies. At second level an enhanced K-mean algorithm based on one-way ANOVA model is applied on the cluster head in order to identify nodes generating identical data sets and aggregated them before sending to sink. This technique significantly reduces the amount of data sets which are sent to the sink. Figure -2 Cluster-based architecture K-MEAN BASED CLUSTERING METHOD Three decades ago, the K-Mean clustering algorithm was proposed by MacQueen. The nodes member sends all datasets to the cluster head, in which the cluster head applies K-Means based clustering algorithm to classify these sets by identical data sets with the aim to eliminate redundancies and reduce the huge amount of data. An enhanced K-mean clustering algorithm using the one way ANOVA model is proposed in order to identify neighboring nodes generating identical data sets. K-Means algorithm is implemented in four steps: Partition objects into k nonempty subsets Compute seed points as the centroids of the clusters of the current partition. Assign each object to the cluster with the nearest seed point OPTIMAL SLEEP SCHEDULING MECHANISM Novel sleep scheduling method is based on the level-by-level offset schedule. This approach is based on sleep scheduling, called Sense-Sleep Trees (SS-Trees). There are various types of sleep mechanism has been practiced inorder to conserve energy and extend network lifetime. Intelligent Sleeping Mechanism adopts a sleeping mode for a percentage of nodes in the network depending on the data sent at a certain period to conserve energy throughout the transmission

3 ADVANTAGES OF SHEDULING V ARCHITECTURE DIAGRAM With the sleep/wake scheduling the sensors within the same cluster are densely deployed, the connectivity of the area covered by active sensors can be guaranteed. If a source has no more traffic to send, the slot assignments along the flow path from the source to the sink will timeout. Thus nodes can adjust their sleep schedules according to the change of traffic patterns, which is important for energy conservation. For continuous monitoring systems, synchronization-based sleep/wake scheduling schemes are often used because the traffic pattern is periodic. Energy consumption can be controlled when the sleep/wake scheduling is applied to the node of the network i.e. when a task has to be done only some of the nodes are assigned through a work message. IV PROPOSED METHOD A new clustering method is used to deal with the spatial similarity between the node readings. Cluster Head (CH) receives the readings periodically from sensor nodes. Two common methods to organize data traffic and to reduce in network redundancies which improve the energy consumption and network scalability are node clustering and data aggregation. By reducing the data transmissions between nodes and sink the lifetime of the network will be extended and the size of the network will look smaller by the technique node clustering. Best way to minimize the consumption of energy by eliminating data redundancy is done by data aggregation techniques. It also reduces the number of transmissions to the sink. These two techniques combines to improve the network performances. Then a two tier data aggregation technique is proposed. First level the node periodically cleans its reading to eliminate data redundancies. At second level an enhanced K-mean algorithm based on one-way ANOVA model is applied on the cluster head in order to identify nodes generating identical data sets and aggregated them before sending to sink. The process of Active and Sleep mode mechanism is implemented. The sensor will be in active mode when the transmission is taking place, it remains in sleep mode when there is no transmission. When the sensor is in active mode it consumes 0.98 mj of energy whereas when it is in sleep mode it consumes only 0.076mj of energy. This process of switching between active and sleep mode will conserve huge amount of energy. Our experimental results show that this technique largely reduces data redundancies thus extending the network lifetime VI RESULT AND DISCUSSION In this section, the experimental results of this technique, at both sensor node and CH level is performed. This is shown via simulation on real data the efficiency of our approach in saving energy and reducing the huge amount of data thus extending the network lifetime of real UWSNs. This paper consists of 240 sensors over an area of 1000 * 1000m2. They consist of three cluster heads N1 = 3; N2 = 29 and N3 = 63 sensors respectively. Each node periodically reads real measures while applying the first aggregation phase. At the end of this step, each node sends its set of measures with frequencies to their corresponding CH which in his turn applies the CH aggregation phase. SIMULATION RESULTS PARAMETER PERCENTAGE OF DATA SENT TO CH (%) With aggregation T=100 24% With aggregation T=500 20% With aggregation T= % Without aggregation 100% T- Total number of slots in a period CLUSTERING TECHNIQUE ENERGY CONSERVATION (%) K-Mean algorithm 80% Active and Sleep mechanism 88% Sensor node applies Upto 96% aggregation phase

4 DATA AGGREGATION RATIO AT THE SENSOR NODE Similar function is used to reduce the amount of data collected at each sensor node over a period by the process of eliminating redundancies. The obtained results show that each sensor node will send in the worst case scenario, e.g. threshold = 0:01 and T =200, 24% of its collected data to the CH when the aggregation techniques is applied and when the aggregation is not applied the 100% of the collected data will be sent to sink which consumes more energy. This figure clearly shows the percentage of aggregated measures at sensor nodes. Depends on the number of slots over a period (T) the percentage of aggregation differs. When the number of data collected increases the amount of data sent to sink will be reduced as the data collected by sensors will be same over a closer region. On the other hand, the energy consumption comparison between the ANOVA model with the three tests and the PFF technique at the CHs level is considered. We fixed T and threshold and we varied N to N1, N2 and N3 respectively, while we fixed N and threshold and we varied T to 200, 500 and 1000 respectively. The obtained results show that our technique outperforms PFF for all values of thresholds and it reduces up to 70% of the energy consumption when compared to PFF. Prefix Frequency Filtering techniques does not obtain results as we obtain from the K-mean clustering method. When compared to the PFF technique the ANOVA model eliminates more data sets in CH. When compared to other tests in one way ANOVA model the, Bartlett test decreases the energy consumption of the cluster head (CH). The CH conserves more energy when compared to the Prefix Frequency Filtering Techniques as the value of N is increased. Similarly the CH energy consumption is minimized as there is decrease in the value of threshold. A sleep scheduling method to reduce the energy consumption of sensor node in UWSNs. The sensors are scheduled in a manner that the node generating redundant data will not be active at same time. When the sensor is in active mode it consumes 0.98 mj of energy whereas when it is in sleep mode it consumes only 0.076mj of energy. The sensor will be in active mode when the transmission is taking place, it remains in sleep mode when there is no transmission. The process of switching between active and sleep mode will conserve huge amount of energy. So that the sensor nodes will conserve more energy and increase network lifetime. Figure- 3 Percentage of aggregated measures at the sensor nodes. ENERGY CONSUMPTION STUDY This section, deals with the study of energy consumption at the sensor nodes and CH levels. The energy consumption in network depends on amount of data sent and received. Fig. 4 shows the energy consumption comparison with and without applying the aggregation phase by each sensor node and when varying T and threshold. The redundancy among data collected by the sensor node in aggregation phase is reduced significantly, which allows it to save proportionally its energy when transmitting its data to the CH at each period. It is important to notice that our technique can conserve energy of a sensor node up to 96%. Figure -4 Energy consumption at each sensor node T=

5 Figure -5 Energy consumption at each sensor node T=500 Figure -7 Network lifetime VII CONCLUSION Figure -6 Energy consumption at each sensor node T=1000 NETWORK LIFETIME Comparison for network lifetime using sleep active mode is in the below figure. The experiment results show that this technique has largely reduced the data redundancy and has also extended the network lifetime. In UWSN, researches are done for data aggregation based on clustering to minimize energy consumption and network lifetime extension. This approach is used to avoid multihop communications and develop an aggregated path around network. A two tier data aggregation based transmission efficient technique is proposed. This technique is applied at each cluster. First level the node periodically cleans its reading to eliminate data redundancies. At second level an enhanced K-mean algorithm based on one-way ANOVA model is applied on the cluster head in order to identify nodes generating identical data sets and aggregated them before sending to sink. A sleep scheduling method to reduce the energy consumption of sensor node in UWSNs is used. The sensors are scheduled in a manner that the node generating redundant data will not be active at same time. So that the sensor nodes will conserve more energy and increase network lifetime. Our experimental results show that this technique largely reduces data redundancies thus extending the network lifetime. REFERENCES [1] J. Heidemann, M. Stojanovic and M. Zorzi, Underwater sensor networks: applications, advances and challenges, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. Vol. 370, pp [2] S. Sendra, J. Lloret, J.J.P.C. Rodrigues and J.M. Aguiar, Underwater wireless communications in freshwater at

6 2.4 GHz. Communication Letters, IEEE, Vol. 17. Iss. 9, pp , [3] K. T. M. Tran and S. H. Oh, UWSNs: A Round-Based Clustering Scheme for Data Redundancy Resolve, International Journal of Distributed Sensor Networks, Vol, 2014, 6 pages, [4] G. Yang, M. Xiao, E. Cheng and J. Zhang, A clusterhead selection scheme for underwater acoustic sensor networks, in Proc. Of the 2010 International Conference on Communications and Mobile Computing (CMC 10), pp , April [5] I. Akyildiz, D. Pompili and T. Melodia, Underwater acoustic sensor networks: research challenges, Journal of Ad Hoc Networks, vol. 3, No.3, pp , May [6] C. Peach and A. Yarali, An Overview of Underwater Sensor Networks, The Ninth Int. Conf. on Wireless and Mobile Communications (ICWMC 2013), pp , July [7] A. Anbarasan, S. Sivasubramaniam, M. Mohanasundhram, A Minimum Cost Effective Cluster Algorithm Using UWSN, International Journal of Innovative Research in Science, Engineering and Technology, Vol. 3, Iss. 7, July [8] J. Lloret, M. Garcia, J. Tomas and J.J.P.C. Rodrigues, Architecture and protocol for intercloud communication, Information Science, vol. 258, pp , [9] R. Kumar and N. Singh, A Survey on Data Aggregation And Clustering Schemes in Underwater Sensor Networks, International Journal of Grid Distribution Computing, vol. 7, no. 6, pp , [10] K. T. M. Tran and S. H. Oh, A Data Aggregation Based Efficient Clustering Schemes in Underwater Sensor Networks, Ubiquitous Information Technologies and Application Lecture Notes in Electrical Engineering, vol. 280, pp , [11] N. Goyal, M. Dave, A.K. Verma, Fuzzy based clustering and aggregation technique for Under Water Wireless Sensor Networks, International Conference on Electronics and Communication Systems (ICECS), pp. 1-5, [12] X. Kul, J. Wang, S. Zhang and J. Cao, Energy Balanced Clustering Data Collection Based on Dominating Set in Wireless Sensor Networks, Ad Hoc & Sensor Wireless Networks Journal, vol. 24, no. (3-4), pp ,2015. [13] Z. Liu, J. Wang, S. Zhang, H. Liu and X. Zhang, A Cluster-Based False Data Filtering Scheme in Wireless Sensor Networks, Ad Hoc & Sensor Wireless Networks, Vol. 23, Iss. (1-2), pp , [14] Kuthadi, Venu Madhav, Rajalakshmi Selvaraj, and T. Marwala. "An Efficient web services framework for secure Data collection in Wireless sensor Network." British Journal of Science 12.1 (2015): [15] J. Bahi, A. Makhoul, and M. Medlej, A Two Tiers Data Aggregation Scheme for Periodic Sensor Networks, Ad Hoc & Sensor Wireless Networks, vol. 21, no. (1-2), pp , [16] K. T. M. Tran and S. H. Oh and J. Y. Byun, Well-suited similarity functions for data aggregation in cluster-based underwater wireless sensor networks, International Journal of Distributed Sensor Networks 2013, Article Id , 7 pages, [17] D. Laiymani and A. Makhoul, Adaptive data collectiom approach for periodic sensor networks, In 9 th International Wireless Communications and Mobile Computing Conference (IWCMC), pp , [18] H. Harb, A. Makhoul, D. Laiymani, A. Jaber and R. Tawil, K-Means Based Clustering Approach for Data Aggregation in Periodic Sensor Networks, 10 th IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications (WIMOB 2014), pp , [19] H. Harb, A. Makhoul, D. Laiymani, A. Jaber, A Suffix- Based Enhanced Technique for Data Aggregation in Periodic Sensor Networks, 10 th IEEE Int. Conf. on Wireless and Mobile Computing (IWCMC 2014), p , [20] C. Zhang and Z. Fang, An Improved K-mean Clustering Algorithm, Journal of Information & Computational Science, Vol. 10, No. 1, pp , [21] A. Ahmed and W. Ashour, An Initialization Method for the K-means Algorithm using RNN and Coupling Degree, International Journal of Computer Applications, Vol. 25, N0. 1, July [22] Kuthadi, V. Madhav, R. Selvaraj, and C. Rajendra. "A Study of Security Challenges In Wireless Sensor Networks." Journal of Theoretical and applied information technology 20.1 (2009): [23] Saravanakumar R, Susila SG, Raja J. An energy efficient cluster based node scheduling protocol for wireless sensor networks. Solid-state and integrated circuit technology (ICSICT), th IEEE international conference on, November p [24] Abd El-Kader SM. Performance evaluation for flat and hierarchical WSN routing protocols. Mediterr J Comput Networks United Kingdom 2011;7(3):237 43, [25] Heinzelman WB. Application-specific protocol architectures for wireless networks. PhD thesis. Massachusetts Institute of Technology; June