V1_I2_2012_Paper5.docx

Integrated Intelligent Research (IIR) International Journal of Data Mining Techniques and Applications
Volume: 01 Issue: 02 December 2012 Page No.43-46
ISSN: 2278-2419
43
Anchor Positioning using Sensor Transmission
Range Based Clustering for Mobile Data gathering
in Wireless Sensor Networks
D.Gladis1
and T.Vani2
1
Associate Professor, Presidency College, Chennai
2
Assistant Professor, Queen Mary’s College, Chennai
Abstract - In wireless sensor network, energy efficiency is a
major concern as the sensors have minimum energy capacity.
As the sensor energy consumption plays a vital role in
determining the network lifetime, many strategies have been
proposed for energy conservation. One of them is mobile data
gathering (MDG).In Mobile Data Gathering either the sink can
go on tour to collect the data or a Mobile Data Collector
(MDC) can collect the data from sensors and drops them back
to the static sink. In this paper, static sink with mobile data
collector is considered for the topic of interest. The mobile data
collector will reach the cluster of sensors at some appropriate
locations called as anchor points. For the formation of clusters,
many algorithms have been proposed so far, two of them ,
Square Grid based Clustering (SGC) and Sensor Transmission
based Clustering (STC) are analysed here for the selection of
anchors in the anchor based mobile data gathering approach.
Keywords: Wireless Sensor network, Grid based Clustering,
Mobile Data Collector, Range based clustering, Anchor based
data gathering.
I. INTRODUCTION
Wireless sensor network is an emerging field with many
sophisticated real world applications ranging from personal
front to public usage. To make these applications realistic,
number of wireless static sensor devices is deployed in the
field. These sensors are operated with minimum capacity
batteries. They perform two essential functions namely,
sensing the environment and transmitting the sensed data to the
sink. The sink will make use of these data to do further
processing. The communication between these two
components raise the issue since all the sensors cannot transmit
the data to the sink directly in a single hop fashion. When they
transmit the data in a multi hop fashion, the sensors which are
nearer to the sink may face the ‘hot spot’ condition and thus
spending their energy in transmitting the data from other
sensors. To handle this unnecessary wastage of energy, mobile
data gathering (MDG) approach is introduced. In mobile data
gathering, some mobile data collectors (MDC) are employed to
gather the data from all the sensors and drop them into the
sink. To collect data from each sensor in the field, MDC needs
to take a time consuming long tour which results in high data
latency. Instead, the sensors can be grouped into a cluster,
based on their proximity[3].The MDC can stay in a predefined
position at each cluster for a specific unit of time to gather the
data. These positions are called as Anchor points and this type
of data gathering is called as anchor based mobile data
gathering [1]. Selection of appropriate anchor points plays a
significant role in improving the system performance. Many
algorithms like Square Grid based clustering and Sensor
Transmission based clustering have been proposed for
clustering the sensors. The proposed work makes an analytic
study of these two algorithms and focuses on a new improved
algorithm for the selection of anchor positions for anchor based
mobile data gathering.
In this paper an enhanced sensor transmission based clustering
algorithm is presented to improve the performance of data
gathering in mobile data gathering reduce the round trip time
of the mobile data collector and to select the appropriate
number of anchor points. The rest of the paper is organized as
follows. In Section II, the related research works on this
problem are discussed. In Section III, the problem addressed is
explained, followed by the details of the proposed approach. In
Section IV, the mathematical model used and the performance
evaluation is presented. The conclusion of the paper is given in
Section V.
II. RELATED WORK
In this section, the related research works are explained and the
motivation for proposed work is also explained. Zhao et al [1]
presents an optimization based distributed algorithm in which
mobile data gathering is performed by a SenCar making a tour
through anchor positions .The anchor positions are predefined
by a random method in this paper. The random positioning of
anchor points may not be suitable for all kind of deployment
field and distribution type of sensor deployment. Some specific
algorithm for the selection of anchors may do well. Arun et al
[2] presents range constrained clustering for mobile data
collection, range based clustering technique is applied. This
algorithm can be applied to irregular polygonal field also as it
is based on the location and the transmission range of the
sensors. So this is suitable for both uniform and non-uniform
distribution of sensors as well. This is because the algorithm
takes the coordinates of sensors for the formation of clusters.
To form the cluster this algorithm uses minimum circle fitting
method coupled with the transmission range of the sensor.
Even though it produces optimum results for mobile data
gathering, the algorithm runs for O (n3
) x O (n) time
complexity. So this paper works on to find a similar kind of
algorithm with minimum time complexity. Thanigaivelu et al
[3] presents a grid based clustering for sink mobility based data
gathering that divides the entire deployment area into equal
sized grid cells. Each grid cell is a square. All the sensors
inside the cell are static and their data can be collected from the
sensor which is closer to the center point of the grid. This

ISSN: 2278-2419
44
sensor is called as Cluster Head (CH).CH will collect the data
from other sensors within the cluster and retransmit it to the
sink. Each sensor is identified by Sensor id and its
corresponding grid id. This is applied for both static sink as
well as mobile sink. If the cluster heads run out of energy it
chooses the secondary cluster head with more energy and
immediate closer to the center of the grid. This algorithm is
suitable for regular polygonal field with uniform sensor
deployment. If the field is irregular polygonal shape with non –
uniform sensor deployment this method will have more unused
grid cells. This is because it partitions the network based on
the coordinates of the area but not on the basis of sensor
locations. So if a grid cell does not contain any sensors, that
grid will become unused.
III. SYSTEM DESIGN
A. Square Grid Clustering method[SGC]
In SGC ,the total deployment area is viewed as an N x N
square field[3].The square field is divided into a number of
Grid cells based on the range of the sensor r as shown in fig
1.Each Grid cell represents one cluster. So the side of one grid
cell is 2r. The centroid of each gives the anchor position of the
MDC. Each anchor position is assumed to be a circle of radius
r such that the MDC can collect the data from all the sensors of
range r within the grid cell.
Fig.1
Anchor positions in the Area N x N
If each grid cell is of length 2r and the area of deployment field
is nxn, thenNo of grid cells in a row of Grid, say q =n / rThen
the total no of grid cells in the square grid = q x q = (n /
r) 2
As each Grid cell contains one anchor points, the total no of
anchor points in a Grid is (𝑛𝑎) = q2
The Data Gathering Time
(per one trip of MDC) =
{Travelling time from anchor to anchor (Tt)}
+
{Time to stay at one anchor point for data gathering (St)}
i.e., The Data Gathering Time (per one trip of MDC)
T = (Tt) + (St)
Travelling time from anchor to anchor = distance between
anchor pointsFor SGC, the Travelling time from anchor to
anchor = 2 r [Since the distance between anchors is same for
SGC approach]The total tour time (Tt) =2 x r x q2
If the data
uploading time varies from sensor to sensor then the MDC has
to stay at each anchor for a longer period. In such cases, the
anchor stay time can be calculated as
The anchor stay time (St) =no of sensors in that cluster (𝑛𝑠𝑖
) x
Upload time of a sensor (𝑢𝑖) x total data to be uploaded(𝑑𝑖) [5]
St = 𝑛𝑠𝑖
x 𝑢𝑖x 𝑑𝑖
Total anchor stay time =∑ 𝑛𝑠𝑖
𝑛𝑎
i=1
Total Data Gathering time per one trip of MDC = 2(𝐪𝟐 −
1)𝒓 + ∑ 𝑛𝑠𝑖
𝑛𝑎
i=1
x 𝑢𝑖x 𝑑𝑖 ---------------1
B. Sensor Transmission range based Clustering Method[STC]
This algorithm takes the coordinates set of all the sensors
which are deployed all over the field. Using these coordinates,
it groups the sensors into a number of clusters based on their
relative distance. To find the relative distance, Euclidian
distance formula is used. After the distance matrix is
calculated, it generates the list of clusters and calculates the
centroid of each cluster. Then it returns the number of clusters
and their centroids.
§
§
§
§
§ - sensor Figure 2: Sensors and Anchors in Sensor
transmission range based Clustering
In this method, to find the anchor points, the coordinate
positions of all the sensors are taken as input. Based on these
data, the neighbourhood sensors form clusters using the range
of transmission power r.For forming the clusters, the distance
matrix D [i, j] is calculated between all the sensors using the
Euclidian formula.
So the total no of anchor points in STC (say na) is ≤ the total
number of sensors deployed. So na ≤ nThe Data
Gathering Time (per one trip of MDC) =
{Travelling time from anchor to anchor (Tt)}
+
{Time to stay at one anchor point for data gathering (St)}
i.e., The Data Gathering Time (per one trip of SenCar) T =
(Tt) + (St)
Travelling time from anchor to anchor =distance between
anchor points
= D [ a i ,ai+1 ]
[Since the distance between anchors is different for STC
approach]
0 5 10 15 20 25 30
0
5
10
15
20
25
30

ISSN: 2278-2419
45
Table 1 Parameters for Square Grid Clustering algorithm
Table 2 Parameter set for proposed Clustering algorithm
The total tour time (Tt) =∑ D[ 𝑎𝑖 , 𝑎𝑖+1 ]
𝑛𝑎
𝑖=1
If the data uploading time varies from sensor to sensor then the
Mobile Data Collector has to stay at each anchor for a longer
period. In such cases, the anchor stay time can be calculated as
The anchor stay time (St) = no of sensors in that cluster=(𝑛𝑠𝑖
)
x Upload time of a sensor (𝑢𝑖) x total data to be uploaded (𝑑𝑖)
[5]
St=𝑛𝑠𝑖
Total anchor stay time =∑ 𝑛𝑠𝑖
𝑛𝑎
i=1
Total Data Gathering Time per one trip of SenCar
= ∑ D[ 𝑎𝑖 , 𝑎𝑖+1 ]
𝑛𝑎
𝑖=1 + ∑ 𝑛𝑠𝑖
𝑛𝑎
i=1
x 𝑢𝑖x 𝑑𝑖 ---------------------
---------------------- 2
This algorithm runs with O(N2
)time complexity and O(N2
)
space complexity which is better than the Range constrained
clustering algorithm given in [2] for which the time
complexity is O(N3
) and O(N2
) space complexity.
IV. RESULTS AND ANALYSIS
For a sample area of 20m X 20m, 18 sensors can be deployed
approximately with sensing range of 2 m for each sensor.
Based on this approximation, a range of different number of
sensors is chosen for the Square Grid method. The chosen
values are given in the Table 1.The results obtained from the
execution of this algorithm is also tabulated (Table 1).In case
of the Sensor Transmission range based Clustering algorithm,
the input parameters are the coordinate sets of the deployed
sensors. Using these coordinate values this algorithm creates
the set of clusters based on the proximity of the sensors. The
proximity is measured using the Euclidean distance formula.
Once the list of clusters is obtained, the centred of each cluster
is computed and displayed. The dataset for this algorithm is
shown in Table 2 with the results.For the comparison of the
two algorithms deployment area of 4x4 sq.m,10x10 sq.m,
20x20 sq.m fields are considered. The SGC algorithm
produced the number of anchors 4 ,25 and 100 respectively for
the above fields as it divides the field into the number of grid
cells of size 2xr, whereas r is the range of transmission of the
sensor. But the proposed STC algorithm produced considerably
less number of anchors as the position coordinates of the
sensors are taken into consideration for cluster formation. The
results are depicted in the graph shown below.
Figure-3
6 8 10 12 14 16 18
0
10
20
30
40
50
60
70
80
90
100
NUMBER OF SENSORS
N
U
M
BER
O
F
A
N
C
H
O
RS
SQUARE GRID METHOD Vs SENSOR TRANSMISSION BASED CLUSTERING
STC
SQC
Sno Area No of sensors No of anchors
1 [0 0] to
[ 4 4]
7 4
2 [0 0] to
[ 10x10]
15 25
3 [0 0]to [20 20] 18 100
Sno No of sensors No of anchors
1 7 2
2 15 3
3 18 10

ISSN: 2278-2419
46
When the round trip time of the mobile data collector (MDC)
is calculated for these two algorithms based on the formulae
given in Equations (1) and (2), the round trip time of STC is
very much lesser than that of SGC algorithm. The variations in
the results of these two algorithms are clearly depicted in the
following graph.
Figure-4
V. CONCLUSION
In this paper, a new enhanced transmission based clustering
method is proposed for finding the appropriate anchor points
for Anchor based Mobile Data Gathering process.This
algorithm is compared with the existing square grid method.
The experiment results prove that the proposed algorithm
gives better results for selecting number of anchors
appropriate for the mobile data gathering. It also reduces the
round trip time of the mobile data collector (MDC)
significantly when compared with the Square Grid method.
In future, the work will be extended for higher dimension of
sensor deployment and automated placement of sensor
positions.
REFERENCES
[1] Miao Zhao, Yuanyuan Yang, “Optimization-Based Distributed
Algorithms for Mobile Data Gathering in Wireless Sensor Networks “
, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 11, NO.
10, pp 1464-1477, OCTOBER 2012
[2] Arun K. Kumar and Krishna M. Sivalingam, "Energy-Efficient
Mobile Data Collection in Wireless Sensor Networks with Delay
Reduction using Wireless Communication”, Second International
IEEE Conference on Communication Systems and Networks, pp. 1-10,
January 2010.
[3] K.Thanigaivelu and K.Murugan, “Grid Based clustering with
predefined path mobility with mobile sink data collection in
WSN”,IETE Technical Review,Vol 29,Issue 2, pp133-147,Mar-Apr
2012
[4] Zhenghao Zhang, Ming Ma, Yuanyuan Yang, "Energy-Efficient
Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor
Networks",IEEE Transactions on Computers, vol. 57, no. 2, pp. 231-
245, Feb. 2008, doi:10.1109/TC.2007.70774
[5] Deepak - Bhadauria and Volkan Isler,” Data Gathering Tours for
Mobile Robots” Proceeding IROS'09 Proceedings of the 2009
IEEE/RSJ international conference on Intelligent robots and systems
Pages 3868-3873, 2009
0 5 10 15 20 25
0
200
400
600
800
1000
1200
1400
1600
1800
NO OF SENSORS
RO
UND
T
RIP
T
IME
ROUND TRIP TIME FOR SGC AND STC
SGC
STC

V1_I2_2012_Paper5.docx

More Related Content

Similar to V1_I2_2012_Paper5.docx (20)

More from praveena06 (14)

Recently uploaded (20)

V1_I2_2012_Paper5.docx