International Journal of Computer Applications (0975 – 8887) Volume 62– No.19, January 2013 10 Data Collection using Rendezvous Points Tracking for Mobility enabled Wireless Sensor Networks R. Sahila Devi, B.E., M.Tech.,MISTE, Assistant Professor/CSE, PET Engineering College, Tirunelveli, TamilNadu-627117 M. Anoop, ME(CSE), PET Engineering College, Tirunelveli, Tamil Nadu-627117 S.Sherin Liba, ME(CSE) PET Engineering College, Tirunelveli, Tamil Nadu-627117 ABSTRACT Energy saving can be achieved in mobility enabled wireless sensor networks that visit sensor nodes and collect data from them through short range communication. The problem that has been faced in WSNs is the increased latency in data collection due to the speed at which the data have been collected. So in order to collect the data efficiently a rendezvous point (RP) is used. Here data are collected by the base station while visiting the rendezvous points. The rendezvous points collect the data which are being buffered from various source nodes are being aggregated at a particular point known as RP. This work proposes an efficient rendezvous design algorithm with provable performance bounds with mobility and fixed tracking. Keywords: Rendezvous point, mobility tracking, fixed tracking, mobility, Steiner minimum tree. 1. INTRODUCTION The main problem faced in wireless sensor network is the network lifetime that must operate for an extended period of time on limited power supplies by means of batteries. To reduce the energy consumption of the WSN propose the rendezvous points which aggregate the data from various sources nodes and are being accumulated in one of the source node called as rendezvous point. The area in the network are grouped into various clusters and from each cluster a node which is close to the base station has been selected as the rendezvous point. The clusters are being created by means of partitioning. The base station (BS) periodically visits the rendezvous points in each cluster and collects the data. Each cluster nodes in the network are connected like a binary tree; the edges of each node are connected by means of Steiner Minimum Tree (SMT). The tree is created by means of the shortest path between two nodes. The data are collected from various nodes in preorder traversal are aggregated in the RPs. since the data are collected in preorder the traffic will be reduced by avoiding the confusion in nodes to send the data to the RP. Before the base station starts tracking the data are cached in the RPS. The cached data are being taken by the BS and passes on to the next RP to take the next data that have been accumulated. Some of the advantages of this approach are,  Use of rendezvous points will reduce the energy consumption and communication delay.  Rendezvous points can collect large amount of data at a time from various source nodes in the cluster.  Since the base station only visit the RPs will avoid the network disruption caused by mobility. This section contributes the data collection by means of two approaches. The first describes about the fixed tracking (FT) in which the data are collected by means of fixed path. The second one describes about the mobility tracking (MT) in which the track is formed by means of the minimum distance. It has the following contributions they are, the rendezvous design problem for mobility enabled WSNs, which aims to find a set of RPs that can be visited by the BS within a required delay while the network cost in transmitting data from sources to RPs is reduced. Consider the Steiner Minimum Tree concept which aggregates the data efficiently at the RPs while shortening the data collection tour of BS. Simulation results show that both algorithms can achieve satisfactory performance under a range of settings. The theoretical performance bounds of the algorithms are also validated through simulation. The main goal is to find the tour, which visits the set of nodes referred to as rendezvous points. The RPs collect the data originated at various nodes and send it to the base station by means of short range communication. A set of source node that generates data samples that must be delivers to the base station within the specified time interval. The use of RPs will minimize the network traffic, the length of the traversal path and the data will be delivered at particular deadline. 2. LITERATURE SURVEY YaoyaoGu, DorukBozdag, et.al. Investigates a technique for partitioning-based algorithm is presented that schedules the movements of MEs in a sensor network such that there is no data loss due to buffer overflow [4]. Partitioning-Based Scheduling (PBS) algorithm performs well in terms of reducing the minimum required ME speed to prevent data loss, providing high predictability in inter-visit durations, and minimizing the data loss rate for the cases when the ME is constrained to move slower than the minimum required ME speed. The collected data at the sensors are usually transmitted to the sinks via power efficient multi-hop routing protocols. The traditional approach for data relaying in wireless sensor networks involves multi-hop communication from data sources to sinks. Soo Kim, JeongGilKoet.al. Introduces the concept of Wireless Sensor Network (WSNs), energy efficiency and fault tolerance should be the two major issues in designing WSNs [7]. However, previous studies on positioning base stations in WSNs are focused on energy efficiency only. The two strategies to find the optimal position of BSs,