Cluster-Based Routing for the Mobile Sink in Wireless

Sensor Networks with Obstacles

Abstract: In wireless sensor networks (WSNs), the

benefits of exploiting the sink mobility to prolong network
lifetime

have

been

well

recognized.

In

physical

environments, all kinds of obstacles could exit in the

sensing field. Therefore, a research challenge is how to
efficiently dispatch the mobile sink to find an obstacleavoiding shortest route. This paper presents an energyefficient routing mechanism based on the cluster-based
method for the mobile sink in WSNs with obstacles.
According

to

the

cluster-based

method,

the

nodes

selected as cluster heads collect data from their cluster

members and transfer the data collected to the mobile
sink. In this paper, the mobile sink starts the datagathering route periodically from the starting site, then
directly collects data from these cluster heads in a singlehop range, and finally returns to the starting site.
However, due to the complexity of the scheduling
problem

in

WSNs

with

obstacles,

the

conventional

algorithms are difficult to resolve. To remedy this issue,

we propose an efficient scheduling mechanism based on

spanning graphs in this paper. Based on the spanning
graph, we present a heuristic tour-planning algorithm for
the mobile sink to find the obstacle-avoiding shortest
route. Simulation results verify the effectiveness of our
method.
Existing system:
LEACH:
LEACH is the first network protocol that uses
hierarchical routing for wireless sensor networks to
increase the life time of network. All the nodes in a
network organize themselves into local clusters, with one
node acting as the cluster head. All non-cluster-head
nodes transmit their data to the cluster-head, while the
cluster-head node receive data from all the cluster
members, perform signal processing functions on the
data (e.g., data aggregation), and transmit data to the
remote base station. Therefore, being a cluster-head node
is much more energy-intensive than being a non clusterhead node. Thus, when a cluster-head node dies all the
nodes that belong to the cluster lose communication

ability. LEACH incorporates randomized rotation of the

high-energy cluster-head position such that it rotates
among the sensors in order to avoid draining the battery
of any one sensor in the network. In this way, the energy
load associated with being a cluster-head is evenly
distributed among the nodes. Since the cluster-head node
knows all the cluster members, it can create a TDMA
schedule that tells each node exactly when to transmit its
data. In addition, using a TDMA schedule for data transfer
prevents intra-cluster collisions. The operation of LEACH
is divided rounds. Each round begins with a set-up phase
when the clusters are organized, followed by a steadystate phase where several frames of data are transferred
from the nodes to the cluster-head and onto the base
station.
Disadvantages of existing system:
Although

LEACH

protocol

prolongs

the

network

lifetime in contrast to plane multi-hop routing and static

routing, it still has problems. The cluster heads are
elected randomly, so the optimal number and distribution
of cluster heads cannot be ensured. The nodes with low

remnant energy have the same priority to be a cluster

head as the node with high remnant energy. Therefore,
those nodes with less remaining energy may be chosen
as the cluster heads which will result that these nodes
may die first. The cluster heads communicate with the
base station in single-hop mode which makes LEACH
cannot be used in large-scale wireless sensor networks
for the limit effective communication range of the sensor
nodes
Proposed system:
In this paper, the mobile sink will move through the
network with obstacles to find an obstacle-avoiding
shortest route. At the same time, the mobile sink must
consider the energy consumption balance among nodes
while moving across the sensing field. To dispatch the
mobile sink efficiently, we utilize the cluster-based
method. According to the cluster-based method, all
sensor nodes in the sensing field are divided into two
categories: cluster heads and cluster members. Cluster

heads collect data from corresponding cluster members

which collect environment information, and then pass
data to the mobile sink.
We present a heuristic algorithm to find an obstacleavoiding shortest route for the mobile sink. In order to
better solve the dispatch problem of the mobile sink, we
use the algorithm to construct the spanning graph of the
network model. According to the spanning graph, we
obtain all obstacle-avoiding paths. Furthermore, the
obstacle-avoiding shortest route for the mobile sink can
be acquired from these obstacle-avoiding paths. We
introduce specific steps of the heuristic obstacle-avoiding
algorithm below.

Algorithm 1
SpanningGraph
Input:
V: the set of nodes of pin vertices and obstacle corners;
Output:
G: the spanning graph for V;

1: Vx sort V by non-decreasing x
2: if Vi _ Vx in region R2 and R6 of all obstacle corners
then
3: EdgeGraph(Vi);
4: end if
5: Vy sort V by non-decreasing y
6: if Vi _ Vy in region R4 and R8 of all obstacle corners
then
7: EdgeGraph(Vi);
8: end if
9: VxCy sort V by non-decreasing x C y
10: if Vi _ VxCy in region R1 and R5 of all obstacle
corners
and in region R1 and R3 of all pin vertices then
11: EdgeGraph(Vi);
12: end if
13: Vyx sort V by non-decreasing y x
14: if Vi _ Vyx in region R3 and R7 of all obstacle corners
and in region R2 and R4 of all pin vertices then
15: EdgeGraph(Vi);
16: end if
Algorithm 2
EdgeGraph
Input:
Vs: the sorted list V with non-decreasing corresponding
coordinates;
Output:
Gs: the edge connection graph for quadrant partition;

1: N ;
2: for each si 2 Vs do
3: if si is not a corresponding location of blockage bj
then
4: add si to N;
5: else
6: if NW D ; then
7: N D ;;
8: if bj is not a vertical blockage then
9: delete points in quadrant partition of si which
are from N;
10: end if
11: add these points located in quadrant partition of
si to Nk ;
12: if Nk W D ; then
13: choose the points m and n from Nk which are
closest to si and siC1, respectively;
14: add the edges (si;m) and (siC1; n) to the edge
connection graph Gs;
15: end if
16: end if
17: end if
18: end for
Advantages of proposed system:
The spanning graph for the mobile sink is to find an
obstacle-avoiding shortest route. Based on the clusterbased method, we applied the heuristic obstacle-avoiding
algorithm to dispatch the mobile sink. The cluster-based

approach is feasible for the dispatch of the mobile sink.

We finally found an obstacle-avoiding shortest route for
the mobile sink and the network lifetime was prolonged

System diagram

References:
1. J. C. Cuevas-Martinez, J. Canada-Bago, J. A. FernandezPrieto, and M. A. Gadeo-Martos, ``Knowledge-based duty
cycle estimation in wireless sensor networks: Application
for sound pressure monitoring,'' Appl. Soft Comput., vol.
13, no. 2, pp. 967_980, 2013.
2. H.-L. Fu, H.-C. Chen, and P. Lin, ``Aps: Distributed air
pollution sensing
system on wireless sensor and robot networks,'' Comput.
Commun., vol. 35, no. 9, pp. 1141_1150, 2012.
3.Z. Shen et al., ``Energy consumption monitoring for
sensor nodes in snap,''
Int. J. Sensor Netw., vol. 13, no. 2, pp. 112_120, 2013.
4. B. Zhou, S. Yang, T. H. Nguyen, T. Sun, and K. T. V.
Grattan, ``Wireless
sensor network platform for intrinsic optical _ber pH
sensors,'' IEEE
Sensors J., vol. 14, no. 4, pp. 1313_1320, Apr. 2014.