World appl. programming, Vol(5), No (3), March, 2015. pp.

56-59

TI Journals

World Applied Programming

www.tijournals.com

ISSN:
2222-2510
Copyright 2015. All rights reserved for TI Journals.

The Geographic Convergence in Wireless Sensor Networks by Using

the Moving Sink Node Approach
Yosra Deravi *
MSc student of Computer Engineering , Computer Software, Islamic Azad University, Science and Research Branch.
*Corresponding author: hezare3.2000@gmail.com

Keywords

Abstract

Wireless sensor networks

Moving sink node
Network lifetime
Data transmission.

A wireless sensor network consists of many sensor nodes in a certain area that each of them has the ability to
collect information from the environment and to send the collected data to the base station. This paper
presents a new convergence algorithm called the virtual combined circle, (VCCSR- Virtual Circle Combined
Straight Routing). This algorithm uses the moving sink for collecting data in wireless sensor networks
(WSN). The shortest route for delivering data will be proposed, in according to the routing tree, and that is a
scheme in which by using moving sinks, collecting data will be done from the sensors. When a sink node
moves, the routes between the sink and the sensors should be rebuilt which will waste a large amount of
energy. The proposed algorithm aims to reduce the cost of rebuilding and increase the delivery rate. In
comparison of the provided protocol with protocols based on the BFS tree in simulation, the reduction of
cost rebuilding and increasing of the delivery rate are shown.

1.

Introduction

The technology of the sensor networks is one of the key technologies for the future, so that it can be considered as the most important
technologies in the 21st century. A sensor network consists of sensing, calculating and communicating components that allows a manager to
view and adjust the observations and in addition they make it easier to show the reaction toward occurred events in a specific area. The manager
means a social, governmental, commercial, or industrial identity. The specific area can be the physical world, a biological system or a specific
frame of information technology. Today the sensor systems that have turned to network will be available for the users study as an important
technology which will experience different patterns in the coming years [1,2].
Typical applications of this type of sensors include data collection, control, supervision and carrying out of various measurements. Cheap and
smart devices with multiple sensors on a single board, that have formed a network through wireless links, give us many facilities and
opportunities in management of cities ,houses and even environments. Furthermore, sensor networks in military and defense issues; including
investigation of potential enemies and monitoring on their actions, give us many facilities. The smart sensors can be used in the air, on land,
underwater, inside vehicles and even inside the buildings. A system of networked sensors can be used to identify and tracking the behaviors
(such as winged and wheeled vehicles, persons, and chemical or biological elements) and targeting by using advanced weapons and preventing
from enemies influence [2,3].
The wireless Sensor Networks are used for data collecting in areas where the user can not be there. In a sensor network, the sensors are
individually sample (measure) local amounts, and if it is necessary, they send this information to other sensors, and finally they send them to the
main observer.
The main purpose in the wireless sensor networks is monitoring and controlling the situation and environmental, physical or chemical changes in
a certain area [4].
One of the key points in the development and presenting the new routing algorithms is reduction and saving energy consumption. Providing a
practical model for the sensors is a complicated and difficult task and this is due to the variety of different types of sensors both structurally and
in terms of their task principles [5].
In wireless sensor networks, there are only one or two base stations and a large number of sensor nodes are distributed in the environment. Due
to the limited range of these sensor nodes and battery energy, many of the nodes cannot communicate directly with the base station. But they
immediately communicate with the base station by relying on their peer nodes and other sensor nodes.
The using of several moving sink previously has not been studied. In this case, the purpose is that the wireless sensor network by using several
nodes of the moving sink collects sensor nodes data from ground-based wireless sensor network in which the network lifetime will be optimized
and guarantee the Real Time.
And generally we are going to meet the following objectives:
Decreasing the energy consumption of the network
Increasing the Network lifetime
Reducing the latency of data transmission

2.

The General structure of the wireless sensor network

The Sensor network is composed of sensor and actor nodes or sensor and actor that are the general state of the under discussion networks. In
other words, this is a network with a large number of nodes that each node generally has several sensors and actors. In particular state, a node
can be only a sensor or just an actor. The nodes scatter in an area that is called sense /act with high density. A sink is responsible for monitoring
of the entire network. Information is collected by the sink and the commands will be distributed through the sink. (Figure 1) management of
tasks can be centralized or distributed. Depending on in what level the reaction is operated; there are two different automatic and semi-automatic
structures which their combination can also be used [6].

57

The Geographic Convergence in Wireless Sensor Networks by Using the Moving Sink Node Approach
World Applied Programming Vol(5), No (3), March, 2015.

Figure 1. The General structure of the sensor network

There are some features in sensor / actor network which distinguish it from other traditional and wireless networks. They include [7]:

The Hardware problems include physical size limitations, source of energy, power processing and memory capacity

Very large number of the nodes

High density of nodes distribution in the operational area.

The existence of failure possibility in the nodes

The changing of topology dynamically and probably alternatively

The using of broadcasting in communication between nodes toward point to point connection

The Data-driven network means that the nodes dont have any identification code.

3.

The VCCSR algorithm

The VCCSR algorithm consists of the method of creating an actual support structure and the method of collecting periodical and completed data
by using the graph association. The actual support structure includes multiple actual circles and actual multiple straight lines and a set of its
vertex clusters are placed in these actual circles and straight lines. By using the VCCSR algorithm we can obtain the locations of vertex clusters
(vertex clusters points) by calculating the midpoints of virtual routes. A vertex cluster point has two routes that are the shortest virtual routes to
the moving sink. The sensing point that is closer to its vertex cluster point will be selected as the vertex of the cluster. The vertex cluster is
responsible for collecting data from its cluster and transmitting the data to the moving sink through the tree graph structure. In this section we
will provide an algorithm with tree structure that it forms the shortest virtual route by using the vertex clusters. The details of the algorithm
consist of formulas and proofs and the communication rules used for transferring moving sink data and synchronization of routes in the time of
movement of the moving sink.
3.1 The virtual structure
The VCCSR algorithm is a virtual structure composed of actual circles and straight lines that forms the basis of the network. These main points
are called vertex of the cluster that are responsible for the transmission of data from the clusters to the moving sink. Figure (2) shows a virtual
structure in which the sensor field is specified as the cover of the virtual routes. Since the locations of the sensor points are randomly selected,
the VCCSR algorithm finds and determines points that are closer to the vertex points of cluster than others in virtual structure. These vertexes of
the cluster form a virtual structure in accordance with the laws of the regular connection.
3.2 The features of the proposed network
The features of the proposed sensor network are considered as the followings:

This network is well connected and the sensors are used densely in the network.

Each point knows its place in the network.

The WSN is the constant type.

All parts with energy have the same sole and communicational range.

The circles of the moving sink are generated in the sensing area and set up a stable connection with the Boundary points of the sensor
area.

The moving sink collects complete periodic data of all areas of sensing locations.

Figure 2. An example of the virtual structure of the VCCSR algorithm

Yosra Deravi *

58

World Applied Programming Vol(5), No (3), March, 2015.

The moving sink selects a vertex of cluster in the nearest random point (e.g., R1) as the root of the tree graph. Each vertex of the cluster in
random point forms a tree structure by using the same method. When the moving sink moves and reaches to another random point (e.g., 2R), the
tree graph must be consistent with it. In order to clearly recognize what areas can be synchronized with each other, several Boundary points (BPs
(get together, in order to form the virtual structure. Data transferring circle is always performed along the shortest virtual tree graph which
consists of the communication routes (CRs) to the random points. The boundary point is located in the middle of the random Point. Figure (b) -3
shows all the boundary points of R1 and all the boundary points that have two virtual routes to R1. For example, the boundary point b1 has two
red routes in Figure (b)-3 and the lengths of the routes are equal. Figure (c)-3 shows all the boundary points of R2 in which R1 and R2 have the
same boundary point b8. Figure (a)-4 shows all the boundary points of 8 random points in the virtual structure.

4.

The discussion

Figure 5 shows an example of the synchronization direction step in which n = 8 i =3, and Ms is close to RPR1. We have created 145 CHPs in
the sensor network. When MS is looking for sensory information about the sensor network, it determines the RPR1 as the tree root and sets up a
virtual tree structure. Each CH of CHP sends its sensory data through CR route to R1 and creates a variable CL line between two RPs. If the MS
moves and doesnt pass the CL cluster, then the CH of CHP will not require any coordination during the route on the perimeter of the largest
circle. Figure (a) -5 shows the communication routes of (CCRs) variable when MS is separated from R1. When MS passes Cl, some parts of the
CHPs must become compatible with the CRs. figure (b) - 5 shows CCRs and CCHPs after aligning in the route. The moving Sink sends the
updated data along the route, in order to direct the data to a new location of CCHPs in the coordinate route step. The basic updating of the route
will be done during the communication routes which are shown in Figure (c) -5. The vertex points of the cluster are updated on communication
routes (UCHPs) and they should update the routes to neighbor circle areas.

5.

Conclusion

In summary, the VCCSR algorithm generates a virtual tree structure by using the vertex points of the cluster and periodically collects moving
sink of full sensory data through the convergence with different routes. Each point on the sensor first sends data to vertex of the cluster then each
vertex of the cluster sends the data to the moving sink along the usual connecting route which is the shortest virtual route to the sink.
When the moving sink passes the changing line, it updates its local information for some vertexes of the cluster and thus, they can alter their
communication routes. The VCCSR algorithm uses the communication rules to reduce the cost of rebuilding.

Figure 3. An example of random and limited locations in the virtual structure (n =8 and i =1)

Figure 4. An example of all the boundary points and the vertex points of the cluster (n =8 and i =1)

59

The Geographic Convergence in Wireless Sensor Networks by Using the Moving Sink Node Approach
World Applied Programming Vol(5), No (3), March, 2015.

Figure 5. An example of synchronization direction step (n = 8 and i =3)

References
[1]
[2]
[3]
[4]
[5]
[6]

[7]

C. Y. Chong, S. P. Kumar. 2003. Sensor Networks: Evolution, Opportunities, and Challenges, Proceedings of the IEEE Transaction on Computers, Vol.
91, pp.23-27.
Akyildiz I. F., Su W., Sankarasubramaniam Y. and Cayircl E., A survey on sensor networks, in: Proceedings of the IEEE Communication Magazine,
Vol. 40, pp. 102-114, August 2002.
G. J. Potties, W. J. Kaiser. 2000. Wireless Integrated Sensor Networks, Communications of the ACM. An overview with more of a signal processing
viewpoint.
Ilyas M. and Mahgoub I., "Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems", in: Proceedings of the CRC Press, London,
Washington, D.C., 2005.
Mehdi Ghasemi Banabari : evaluation and optimization of routing protocols in each vehicle networks, Master's Thesis, Kermanshah Islamic Azad
University , 2014.
Mohsen Heydar Azadzadeh, Niloufar Bayati Chaleshtari,Mojtaba Soki,Ali Vahedian,2013: Evaluation of the optimal methods for placement of sensors in
a wireless sensor network to cover the optimization and to increase the lifetime of the sensors. The first International Conference of new approaches in
Computer Engineering and retrieval of Iran Information. Ramsar.
Masoud Ghanbardost : presenting a spatial coverage algorithm in wireless sensor networks, Master's thesis, Arak Islamic Azad University, 2014.