Wireless Pers Commun (2016) 87:335348

DOI 10.1007/s11277-015-2642-5

Multi-sink Optimal Repositioning for Energy and Power

Optimization in Wireless Sensor Networks
S. Yasotha1 V. Gopalakrishnan2
M. Mohankumar1

Published online: 26 May 2015

 Springer Science+Business Media New York 2015

Abstract A wireless sensor network (WSN) plays a major role in many recent applications now such as surveillance and security, target tracking, agriculture, health and
military purposes. The main problem with WSN is the energy resource for long lasting
lifetime. Therefore an efficient methodology is to be implemented for improving the
energy level of WSN. Also some efforts have focused on the mobility of a single or
multiple sink nodes. The mobility of the sink node introduces a tradeoff between the need
for frequent re-routing to optimize the performance and the minimization of the overhead
resulting from this topology management. In this we propose a novel approach to increase
the lifetime of a sensor network based on the mobility, static sink repositioning and
multiplicity of sinks. Optimal sink position also identified using optimal search concepts
and multipath routing in large scale sensor networks with multiple sink nodes for energy is
implemented for entire WSN. Based on the evolution of network in terms of energy
dissipation and distribution this approach reaches to find the optimal position for all the
sinks in order to optimize the lifetime of the network and move according with intelligent
sink positioning. The simulation result shows the efficiency of our approach in terms of
energy gain.
Keywords Wireless sensor networks  Multiple sinks mobility  Energy efficiency  Sink
relocation  Optimal repositioning

& S. Yasotha
yasothaes.s@gmail.com
1

Department of Information and Communication Engineering, Anna University of Technology,

Coimbatore, Coimbatore, India

Department of Electrical and Electronics Engineering, Government College of Technology,

Coimbatore, Coimbatore, India

123

336

S. Yasotha et al.

1 Introduction
A large number of electro mechanical devices such as relays with sensing unit embedded
with computing and communication capabilities of included in wireless sensor networks
(WSN). A sensing unit is an electro mechanic device which generally collects three main
parameters: collecting the data relative to the environment surrounded by it, ability to
measure the data and to exchange it with the neighboring devices. The neighboring devices
may be sensor nodes or sink nodes. A sink is a particular node that collects the information
or data resulting from the sensing nodes present in the network, which has ability to
process them and/or send them to data concentration center. Generally sensor nodes deliver
their information to the nearest sink node. If the amount of data which needs to be
transmitted is reduced then the energy consumption of the network also is reduced [1]. It is
necessary to consider in WSN architecture, the network topology, power consumption,
data rate and fault tolerance for avoiding the energy consumption and for improving the
bandwidth utilization [2]. The sink repositioning includes a moving node which has the
ability to move around to collect data from sensor nodes. Sink repositioning can be made
with the following methods.

1.1 Multiple Sink Deployment

Always the collected information by the sensing node will be shared with the nearest sink,
deploying multiple sinks may decrease the average number of hops a message has to pass
through.

1.2 Sink Mobility

The sink moves fast enough to deliver data with a tolerable delay with the mechanical
movements, the mobile sink picks up data from nodes and transports the data. Therefore
for the reduction of energy consumption of nodes, this approach trades data delivery
latency.

1.3 Deploying Multiple Mobile Sinks

The multiple sinks are deployed for collecting sensor data without delay and without
causing buffer overflow. Our aim is to propose a multiple sinks relocation solution for
network lifetime optimization and power optimization by moving the sink nodes towards
their optimal positions with an intelligent manner.
All sensor networks datas are routed towards by a single sink, the gateway in our
model, hops close to that sink become heavily involved in packet forwarding and thus their
energy resource gets depleted rather quickly. The hops that are further away from the
gateway have to be used as substitutes. It increases the total transmission power and it
gradually limits sensor coverage in the WSN and often it makes the network useless. If the
sink node has limited motion capability it will be necessary to relocate the sink close to an
area of heavy traffic or near loaded hops in order to decrease total transmission power and
extend the life of nodes on the path of heavy packet traffic and also it will reduce the
average delay per packet.
The challenging scenario in WSN is repositioning the sink node during regular network
operation. By making the sink node to be relocated when it would make sense, where the

123

Multi-sink Optimal Repositioning for Energy and Power

337

sink node should go and how it will be moved. The relocation of the gateway first has to be
motivated by odd pattern of energy depletion or data route setup, even if it is the most
efficient network operation given the traffic distribution and network state at that time. The
sink node detects the optimal location to place the sink which has the odd pattern energy
depletion in order to improve the network performance. While moving the sink node
ensures that there is no data loss during that time.
The sink node achieves a trade-off analysis between the gain achieved by going to a
new place and the overhead in terms of additional energy consumption that the relocation
imposes on sensors. If the relocation is justified, the sink node moves towards that location.

2 Related Works
The purpose is to determine the optimal multiple sink relocation to enhance the energy of
the WSN by minimizing the energy utilization in multiple sink nodes. In many applications
like inside the buildings the nodes are deployed in WSN to collect the information in that
area, they used integer linear program (ILP) for multiple sinks which increases the WSN
lifetime instead of reducing the energy consumption [3]. In that mobile sinks are moved
randomly and sinks are moved separately in different clusters. WSN consist of collection
of nodes which collects the information like pressure, humidity and temperature etc to
collect these information the nodes are used in the network area, collected information will
be send to the destination through sink node/base station. Sink node energy drains faster
compare to other nodes present in the network because sink node will act as a gateway to
other nodes. In paper [4] they have implemented a hybrid sink repositioning technique
which indirectly increases the network lifetime, in that the considered sink node as a static
node which collects urgent data in that network area and mobile sink nodes are used to
collect the non-urgent data which moves randomly and periodically collects the datas in
the network. Repositioning the sink node gives the greatest achievement in the network
lifetime for a longer period by reducing the energy consumed for sending data. This
replaces the deployment of multiple sink and multi hop transmission. While placing the
sink node in the network the energy balanced is a major problem. Here the node which
deployed nearest to a sink node which drains the energy faster compare to other nodes in
network [5, 6]. Akkaya [7] has scrutinized the potential of sink relocating for improvement
of network performance in case of energy, throughput and delay. They faced a problem
that how to handle the data traffic without any loss of data while moving the sink node
from one location to another location. They identified a solution that using relay node for
each sink node for optimized energy and suitability. In this paper [8], they have considered
reposition of the sink/base station by checking the traffic flow of the networks node that is
one hop away from the sink and the distance from the sink. Once the total transmission
power for node is guaranteed then it is compared with the threshold value and the overhead
of moving sink is decided, then sink starts move to the new position. Using routing strategy
the sink is moved so the data will not be affected. In [9] Seino, proposed sink node travel in
fixed route in sensing area and collect the data from sensors and stored on the base station.
Communication traffic can be reduced by delivering the predicated sensor data. In this
method the mobile sink node broadcast the predicated value to the sensor and only that
sensor can send the data which exceeds the admissible error margin.
Comparison of sink node The static sink node, mobile sink node and multiple sink nodes
are specified [10]. Static sink node was used for data collection in WSN by using multi hop

123

338

S. Yasotha et al.

transmission so sink node consumes more energy around by node base station and passes
the data from other one. Mobile sink node was used to collect data from sensors node and
stored it to the base station. If only one sink node is used for the entire network in case that
particular node gets failure then it affects the entire network. Multiple sink nodes were
used in data collection process from the sensors and stored collected data on the base
station in the database. If multiple sink nodes is used in the network then it will reduces the
network failure.
In this paper [11] technique the adaptive data approximation algorithm should be selfadaptive to the changes of the sensor readings timely as sensor readings change slowly
according to the change of physical phenomena. This algorithm consists of two parts; data
approximation learning algorithm and data approximation monitoring algorithm. In [12]
proposed schemes block partition is used and then each block selects a sensor node as local
sink for the data collection of the local area. In [13] proposed Mobicluster protocol for
sensor node under the assumption of SNs are location aware. The protocol consist of five
phases (1) clustering approach is used for WSN, (2) cluster head (CHs) attachment to RNs,
(3) rendezvous nodes (RNs), (4) data aggregation and forwarding to the RNs, (5) communication between RNs and mobile sinks.

2.1 Movement of the Sink

The movement of the sink node will be decided based on the traffic flow in network area. It
checks for the nearest hop to take a move to new location in order to reduce the energy
consumption in sink to achieve the overall performance of the WSN.
The following notations are used for sink relocation:
G:
G1:
GR:
GR1:
Gnew
1 :
Gnew
R :
GR2:
Pi:
PT:
PTnew:
E
(Tri):

Gateway in a cluster
Set of sensors less than distance D from G
Set of sensors that are one hop away on the active route
Set of sensors in GR which are also in G1, i.e. GR1 = G1\GR
Set of sensors less than distance D away from the gateway at the new location
Set of sensors those are one hop away on new route at the new location
new
Set of sensors in GR new which are also in G1new, i.e. GR2 = Gnew
1 \GR
Packet traffic measured as the number of packets per frame, going through a
node
Set consisting of packet traffic of each sensor in GR1in an ascending order
Set consisting of packet traffic of each sensor in GR2 in an ascending order
Energy consumed by a node i in transmission of a packet to the next hop

new
new
Note that Gnew
are calculated by locating the sink node at new
1 , GR , GR2 and PT
location. The basic idea is for the sink node to check the changes in data route in consecutive routing cycles using routing algorithm. Typically re-routing is performed in response to a high packet loss caused by the energy depletion or failure of a relay node or is
triggered by a change in data sources that requires setting a new topology [14]. When
comparing routes in two consecutive cycles, if the data sources are the same and the nodes
in previous GR1 differs from that the current GR1, the gateway perform further analysis.
The gateway checks the nodes that used to be in the previous GR1 and are excluded from
the new GR1. If these nodes were among the bottom 70 % of the set PT, relocation would
not be necessary. On the other hand if these nodes were forwarding high traffic (among top
30 % in PT), the gateway perform a heuristic search for a better position.

123

Multi-sink Optimal Repositioning for Energy and Power

339

To qualify the impact of locating the sink node at a new position, some static network
performance parameter has to be used. Most popular performance parameter for sensor
networks, such as average delay per packet, data transmission rate and throughput, are
based on the network operation over time period and are typically network-wide in
scope. The parameter which is considered here is the total transmission energy of the
relay node that is one-hop away from the sink node, basically those in GR and Gnew
R . A
positive effect on the total transmission energy for these nodes would be a good indication for the sink node move from one place to another. The reduction in the total
transmission energy has to exceed an application threshold to justify the overhead. A
constant d can be derived based on the overhead for handling the movement of both at
the gateway and at the network level. The condition for relocation can be mathematically
defined as:
X
X
ETR j Pj [ d
1
ETRi Pi 
8i2GR

8j2GR new

Determining an optimal new position for the sink node is a hard issue for the relocation decision. Optimal positioning of the sink node is an NP-hard problem. Therefore
we purse a heuristic search and settle for a quasi-optimal location to overcome such
complexity.

2.2 Intelligent Positioning for a Sink Node

Once the gateway movement is identified, then a difficult problem is to find the direction of
move for G (sink) could be based on the network traffic. The node G is moved towards the
sensors that produces the maximum number of packets. However, it may be infeasible for
G to move far from its current position. There is a risk for wasting substantial resources for
reaching a far position, which turns shortly after to be not optimal due to changes in the
environment when the network topology dynamically changes. To achieve the largest
number of packets G is placed close to the relay nodes in GR.
In our method, G is to move towards the most dominating node in PT and it should
give a greater value of d. In case of multiple relay sensors in network, a weighted
average based on the distance between the sink node and these relay sensors and their
traffic load is taken into account. The idea is to balance the sink node while directing the
position for the sink.
A position g central, in terms of distance 9 traffic density, different routes is determined from the relay sensors in high traffic area. While performing this repositioning
will be ideal for high traffic way, it can worsen the total power consumed on other route
with lower traffic load. Therefore, the sink node will be located on some point on the
straight line between its current position and the newly determined position g that is
intermediate from picked relay nodes. How to choose the direction of the sink node motion
to optimize total transmission energy for the top two relay nodes in PT. Wang et al. [15]
and Dandekar and Deshmukh [16] refers the optimal search with multiple hop transmission. Balancing the interest of the relay node A and B changes the slope of the sink node
travel path. Placing the sink node at position g on the line between A and B increases the
efficiency of packet transmissions from A and B which indirectly proposition to the energy
efficient of entire network area, to the sink node at the expense of node C. Therefore a
location on the route to g that decreases the total transmission energy for the entire GR set
will be looked for using a bisection search.

123

340

S. Yasotha et al.

2.3 Handling Gateway Motion

One the position for a new location for a sink node is identified, surely this will improves
the overall performance of WSN, and then next vital role is moving a sink node to a new
position without any data loss. In order to face this problem, during routing phase the sink
node to be moved to a new position. Routing phase has two parts (1) data transfer phase,
(2) routing phase
Data transfer phase In this phase using routing table concept the data packets are sends
to sink node from sensing node.
Routing phase The sensors send their information to their sink node and based on such
information multi-hop routes to the sink node are created and routing table information is
sent back to the sensor nodes. In this phase there is no data transmission takes place so the
relocation can be done easily by modifying the location of the sink node followed by the
modification of network topology at the new location without any packet loss or data loss.

3 Proposed Work
Multi-sink repositioning consists in finding the best sinks positions within the network
during the network lifetime. The sink movement facility is possible which allows us to
move the sinks in an efficient way towards the positions which enhance the network
lifetime.

3.1 Routing
Before realizing the routing identity, the first phase consists in providing each link in the
network a specific weight. This weight depends on the energy of the destination node, in
order to relay the information by the nodes having the higher residual energy, and the
distance between nodes, in order to prefer short distance transmissions in Fig. 1.
Once this weight is calculated, we obtain a graph on which Dijkstra algorithm can be
applied to obtain the shortest path between a sink and each node in the network. Since
more than one sink node is present in the network then the aim is to find the shortest path
towards the nearest sink.

Fig. 1 Routing in a sensor network

123

Multi-sink Optimal Repositioning for Energy and Power

341

The algorithm complexity is acceptable since we achieve p Dijkstra in O(n). The next
problem is to find the weight of the links.

3.2 Calculation of Links Weight

The energy consumed for the communication is defined by the distance between the nodes
i and j. Since the required energy is proportional to distance squared, the wait will show the
same behavior. The lowest is the destination node energy and the highest is the link weight.
The link weight is defined as follows:
W i; j CF0  disti; jexpCF0 CF1 

1
energyj

where,

W(i,j) is the weight of a link between nodes i and j

dist(i,j) is the energy consumed by the communication between nodes i and j
energy(j) is the remaining energy in node j
CF0, CF1, and expCF0 are coefficients for equation balancing

The energy model is updated by decreasing the energy of the whole nodes which contributed to the packet relaying. When a packet arrives to a sink by implementing, only the
transmission energy consumption has been considered. The routing protocol is divided in
several periods. The major periods are data transferring phases and routing phases.
Regularly, a routing phase is activated in order to detect if a better configuration of the
sinks is possible and take an intelligent decision for sinks arrangement.

3.3 Optimum Search

The optimal multi-sinks positioning problem in a network is NP-complete [17]. Here the
problem faced is an infinite space of solutions since a sink position is defined by a couple
of real numbers. This approach can be implemented using integer numbers space. Even if
we admit such an approach in an integer numbers space, in a 100 9 100 points space, we
will have 1012 solutions for a 3 sinks placement.

Fig. 2 a, b Initial network and associated routing; c, d one sink movement and associated routing; e, f two
sinks movement and associated routing

123

342

S. Yasotha et al.

A solution neighborhood and relocations The aim of the local search approach is as
follows: from an initial solution x0, a nite series of solutions xi is generated with a systematic change of neighborhood. xi?1 is derived from xi such that for all i, f(xi) [ f(xi?1).
f is the evaluation function of the solution.
To choose a neighborhood and relocation 3 levels are implemented:
One sink movement: this movement consists in one sink relocation in respect to the
initial position. This movement is performed in eight directions: North (N), South(S),
East (E), West (W), NE, NW, SE, SW.
Two sinks movement: this level consists in a two sinks simultaneous transform to
widen the neighborhood of a solution and avoid certain deadlock situations. We limited
the transformations to the fourth cardinal points.
Three sinks movement: three sinks are relocated simultaneously.
To illustrate the relevance of the two sinks movement, Fig. 2 shows a theoretical case
proved by simulation where a single sink movement does not lead to a better solution. The
simultaneous movement of two sinks allows getting a better solution.
1.

Constrained local search The aim of the constrained local search is to limit the sinks
motion while maintaining their path way to the optimal positions. Based on both the
current and the optimal locations of the sink the liberty is defined. The next move will
take place in this constrained space.

Lets d be the liberty distance [18]. We also dene G, the point located at a distance
d from the current position of the sink on the line formed by the current position Cp and the
optimal position of the sink. The liberty space is then defined as the set of points located at
a distance smaller than d from the point G and the current position (see Fig. 3).
Graphically, this point is the intersection between two discs with G and Cp as centers and
d as radius.
In Fig. 4, the intelligent movement is shown based on the constrained space to achieve
the optimal solution.

3.4 MRMS Algorithm Overview

Multipath routing in large scale sensor networks with multiple sink nodes (MRMS) consist
of three phases: topology discovery, cluster maintenance and path switching.
MRMS topology discovery is derived from the three-color algorithm, but with a number
of significant differences. In paper [19] initially, MRMS must save the routes from different sinks, so that when the primary path is not reachable another path is selected based

Fig. 3 Liberty spaces delimitation

123

Multi-sink Optimal Repositioning for Energy and Power

343

Fig. 4 a Intelligent movement in the constraint space; b the sink in the right side is blocked

on the residuals energy. Secondly, based on the cost metric it can construct an optimal or
sub-optimal path to any sink node (i.e.) construct construction. Finally each cluster can be
considered as a single node.
There are two major processes within cluster maintenance: energy monitoring and
cluster reconstruction. The residual energy of the each node is monitored and the level
reaches below threshold, cluster reconstruction is started. In cluster reconstruction, if the
CH residual energy is below some threshold, it will select a new child which has the
maximum residual energy. On the other hand, if the delivery nodes residual energy is
below the threshold, the CH will choose the new destination node based on the path cost.
Next, the main phase, path switching, is to switch path to another sink when the primary.
After a primary path has been in use for an extended period of time, the energy level of
these sensors along with this path will dissipate quicker than other sensor nodes, and few
nodes may run out of energy in total leaving the path unusable. By switching paths, energy
consumption is distributed more evenhandedly. In [20] the size and structure of each
cluster follow certain rules so that each CH can transmit data to sink over a period of time
which does not overlap with each other and these time periods are continuous.

4 Simulation Results
4.1 Simulation Model
The implementation of the sensor network we proposed was realized by simulation with
riverbed software (OPNET). A first series of simulations was dedicated to validate the
model. Our aim was to make sure that the network behaves according to the theoretical
model and operates on some easily verifiable configurations. 100 9 100 square meter area
nodes and sinks are randomly placed for sensor networks. Except for testing specific
capabilities of our approach, the sinks and node positions are determined randomly within

123

344

S. Yasotha et al.

the area boundaries. Each node is assumed to have an initial energy of 5 joules and is
considered non-functional if its energy level reaches 0. The experiment was carried out for
various numbers of sinks to evaluate the performance for intelligent movement of sink
node.

4.2 Performances Metrics

We used the following metrics to evaluate the performance of our multi-sink repositioning
approach and to compare it with the motionless approach (Table 1):

Time for first node to die

Number of delivered packets and lost packets
Average delay per packet
Average energy consumed per packet

4.3 Environment Validation

The results of an experiment, shown in Fig. 5, illustrate this principle and example, when
the energy of the node C is equal to 5 Joules, the routing algorithm chooses C to route the
information from A to the sink. The node B is chosen as relay when the energy of C is 1.5
Joules.
Finally, we checked that the optimal location of each sink is selected so as to minimize
the sum of the distances crossed by the sinks and thus, reduce the delay necessary to reach
these positions. This was done by testing each possible permutation of the sinks.

Table 1 Simulation parameters

Network size

802.15.42.4 GHz

Coverage area

30 m

packet size

97 bytes

Number of nodes

46

Data rate

250 kbps

Bandwidth

2.4 GHz

Fig. 5 Energy, routing cost and energy-aware routing

123

100 9 100 m

Physical channel

Multi-sink Optimal Repositioning for Energy and Power

345

4.4 Performance Results

The main performance results derived from simulation model. Figure 6 shows the energy
dissipation with static sink and mobile is shown, comparisons was made between both the
mobile node and static node but that is not shown here. The mobility rate is defined by
when the sinks move towards the data generating zones, and since these data generating
nodes are relatively stable, we observe a decrease in the consumed energy. Finally, the
efficiency of the approach a vary with more than the data production of zones are stable,
the efficiency here is an important criteria however, in such case the performance is
obtained by choosing high value for the coefficient which is taken into account the flow in
the network (Figs. 7, 8, 9).
1.

Straight line movement versus smart movement: a major part of our work was
dedicated to the smart location of the sinks by defining a restricted area of freedom to
move the nodes.

Fig. 6 Energy dissipation with and without mobility

Fig. 7 Nodes lifetime and packet transfer results [Y axis represents Time (s)/number]

123

346

S. Yasotha et al.

Fig. 8 The average energy consumed per packet

Fig. 9 Average energy consumed per packet for both approaches

5 Conclusions and Future Works

In this paper, we proposed a new approach for static sinks repositioning and finding the
optimal multi sink location in a sensor networks. The static nodes for collecting urgent
datas and mobile sink for colleting un-urgent datas in the network area. This approach is
based on previous works related to two fields: multiple sinks positioning and the unique
sink relocation. Our approach has the advantage when relocating the sinks to their optimal
positions for the entire network. In the high traffic are the optimal solution will be used in
effective way. Moving the sinks towards the heavy traffic (in terms of information production), allows to obtain a power saving provided that a stability of these areas exists.
Repositioning of the static sink will be implemented in routing phase to avoid the packet
loss. Finding the optimal solution will enhance the energy efficiency of the nodes and it
indirectly increases the network lifetime. Our result shows the average energy efficiency

123

Multi-sink Optimal Repositioning for Energy and Power

347

with mobility and without mobility using riverbed (OPNET) simulator. In future the
metrics can be focused on minimizing delay and area.

References
1. Vass, D., & Vidacs, A. (2007). Distributed data aggregation with geographical routing in wireless
sensor networks. In IEEE International Conference.
2. Athanassoulis, M., Alagiannis, I., & Hadjiefthymiades, S. (2007). Energy efficiency in wireless sensor
networks: A utility-based architecture. In Proceeding of 13th European Wireless Conference. April 1 to
4, Paris, France.
3. Saad, L. B., & Tourancheau, B. (2009). Towards an optimal positioning of multiple mobile sinks in
WSNs for buildings. In International Journal on Advances in Intelligent Systems, 2(4). http://www.
iariajournals.org/intelligent_systems.
4. Shrivastava, P., & Pokle, S. B. (2012). A hybrid sink positioning technique for data gathering in
wireless sensor networks. International Journal of Engineering and Innovative Technology (IJEIT),
1(3), 225227.
5. Wu, F.-J., Hsu, H.-C., Tseng, Y.-C., & Huang, C.-F. (2009). Non-location-based mobile sensor relocation in a hybrid static-mobile wireless sensor network. In Proceedings of the 2009 Third International
Conference on Sensor Technologies and Applications, ACM.
6. Akkaya, K., & Younis, M. (2004). Energy-aware routing to a mobile gateway in wireless sensor
networks. In The Proceedings of the IEEE Globecom, Wireless Ad Hoc and Sensor Networks Workshop,
Dallas, TX.
7. Akkaya, K., Younis, M., & Bangad, M. (2005). Sink repositioning for enhanced performance in wireless
sensor networks. Computer Networks, 49, 512534.
8. Younis, M., Bangad, M., & Akkaya, K. (2003). Base-station repositioning for optimized performance of
sensor networks. In 2003 IEEE 58th Vehicular Technology Conference, 2003. VTC 2003-Fall.
9. Wankhade, S. R., & Chavhan, N. A. (2013). A review on data collection method with Sink node in
wireless sensor network. In International Journal of Distributed and Parallel Systems (IJDPS), 4(1).
10. Seino, W., Sakashita, S., Yoshihisa, T., Hara, T., & Nishio, S. (2012). A sensor data collection method
with a mobile sink for communication traffic reduction by delivering predicted values. pp. 613618.
11. Wang, C., Ma, H., He, Y., & Xiong, S. (2012). Adaptive approximate data collection for wireless sensor
networks. IEEE Transactions on Parallel and Distributed Systems, 23(6), 10041016.
12. Cheng, C.-H., Liang, H., Huang, Y.-F., Wu, T.-Y. (2012). Energy efficient block division methods for
data aggregation in wireless sensor networks. In Sixth International Conference on Innovative Mobile
and Internet Services in Ubiquitous Computing (IMIS), pp. 454458.
13. Konstantopoulos, C., Pantziou, G., Gavalas, D., Mpitziopoulos, A., & Mamalis, B. (2012). A rendezvous-based approach enabling energy-efficient sensory data collection with mobile sinks. IEEE
Transactions on Parallel and Distributed Systems, 23(5), 809817.
14. Friedmann, L., & Boukhatem, L. (2007). Efficient multi-sink relocation in wireless sensor networks. In
Third International Conference on Networking and Services, ICNS.
15. Wang, J., Li, B., Xia, F., Kim, C.-S., & Kim, J.-U. (2014). An energy efficient distanceAware routing
algorithm with multiple mobile sinks for wireless sensor networks. Sensor Journal, 14, 1516315181.
16. Dandekar, D. R., Deshmukh, P. R. (2013). Energy balancing multiple sink optimal deployment in multihop wireless sensor networks. In Advance Computing Conference (IACC), 2013 IEEE 3rd International,
pp. 408412. doi:10.1109/IAdCC.2013.6514260.
17. Nayak, B. K., Mishra, M., Rai, S. C., & Pradhan, S. K. (2014). A novel cluster head selection method
for energy efficient wireless sensor network. In Information Technology (ICIT), 2014 International
Conference (pp. 5357). IEEE Conference Publications.
18. Rana, K. M., & Zaveri, M. A. (2011). Techniques for efficient routing in wireless sensor network. In
International Conference on Intelligent Systems and Data Processing (ICISD).
19. Chen, Y., Chan, E., & Han, S. (2008). Energy efficient multipath routing in large scale sensor networks
with multiple sink nodes. In Wireless Communications, Networking and Mobile Computing, 2008.
WiCOM 08. 4th International Conference on 2008 (pp. 14).
20. You, X., Xu, P., & Zhu, W. (2014). Low-balanced data collection in wireless sensor networks. In Wireless
Communications and Signal Processing (WCSP), 6th International Conference on 2014 (pp. 16).

123

348

S. Yasotha et al.
Mrs. S. Yasotha pursing the Ph.D. degree in Information and Communication Engineering from Anna University of Technology,
Coimbatore, Tamil Nadu, India, Received the M.E. degree in Information and Communication Engineering Anna University of Technology, Coimbatore, India, in 2010; currently I am working as an
Assistant Professor, Sri Eshwar College of Engineering, Department of
Computer Science and Engineering, Coimbatore. I had published 2
papers in National Journals and she presented more than 6 papers in
National and International Conferences. My research interests include
wireless sensor networks, networks security, VLSI design, mobile
networks, data mining, adhoc sensor networks and android.

Dr. V. Gopalakrishnan received the Ph.D. degree in Information and

Communication Engineering from Anna University, Chennai, Tamil
Nadu, India, Received the M.E. degree in Computer Science and
Engineering from Government College of Technology, Coimbatore,
India; He presented more than 20 papers in National and International
Conferences and also he published more than 10 papers in National
and International Journals. His research interests include power system
protection, high voltage engineering, computer network, wireless
sensor networks, renewable energy resources.

Mr. M. Mohankumar pursing the Ph.D. degree in Information and

Communication Engineering from Anna University of Technology,
Coimbatore, Tamil Nadu, India, Received the M.E. degree in Information and Communication Engineering from Anna University of
Technology, Coimbatore, India, in 2010; currently he is working as an
Assistant Professor for Sri Eshwar College of Engineering, Department
of Electronics and Communication Engineering, Coimbatore. He had
presented more than 8 papers in National and International Conferences and also published 3 papers in National Journals. His research
interests include wireless sensor networks, VLSI design, image processing, control systems, power electronics drives and circuits.

123