International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

A Network Lifetime enhancement method with reduced packet loss using

Easrc in Wireless Sensor Networks
1

V.Seedha Devi, 2 Dr.T.Ravi

1
Assitant Professor, Jaya Engineering College, Chennai, INDIA
2
Principal, Srinivasa Institute of Engineering and Technology, Chennai, INDIA

AbstractRecent advances in micro manufacturing technology have enabled the

development of low-cost, low-power, multi- functional sensor nodes for wireless
communication. In a wireless sensor network (WS N), how to conserve the limited power
resources of sensors to extend the network lifetime of the WS N as long as possible while
performing the sensing and sensed data reporting tasks, is the most critical issue in the
network design. In a WS N, sensor nodes deliver sensed data back to the sink via multi hopping. The sensor nodes near the sink will generally consume more battery power
than others; consequently, these nodes will quickly drain out their battery energy and
shorten the network lifetime of the WS N. S ink relocation is an efficient network lifetime
extension method, which avoids consuming too much battery energy for a specic group
of sensor nodes. Hence a moving strategy called energy-aware sink relocation (EAS R) is
used for mobile sinks in WS Ns. S imultaneously another problem in WS Ns is buffer
overflow in every node, which occurs if the sum of the amount of data it generates and
the amount of data it receives from upstream nodes exceeds its transmission throughput.
Densely connected wireless sensor networks inherit such a buffer overflow problem as
sensor nodes in WS Ns have limited buffering capacity which leads to packet loss. In this
paper, we introduce EAS RC(Energy-Aware Transmission S ink Relocation with Credit)
algorithm with credit technique to detect the buffer overflow in sensor nodes. This
EAS RC algorithm is related to both the residual energy of sensor nodes for sink
relocation and buffer overflow for packet loss reduction. Consequently, the amount of
information lost in the system due to packet overflow/retransmission will be significantly
reduced.

The EASRC scheme mainly focuses on when the sink will be triggered to
perform the relocation process and packet loss reduction. Besides the sink relocation
scheme, the entire operation of the WSNs for environment monitoring also needs to
incorporate the routing method for reporting the sensed data from the source to the
sink, as well as the energy consumption model. In this section, we will rst briey
describe the energy consumption model for message relaying. Then, the energy aware routing method (the MCP) that is adopted in the EASRC method will be
illustrated using a numerical example. At the end of this section, some related
research works for sink relocation and buffer overflow avoidance will also be
addressed.
A. The Energy Consumption Model for WSNs
In our considered energy cons umption model, we adopt the rst order radio model
for later performance simulation. Let ETx(k,d) (and ERx(k)) denote the total energy
required in a sensor node to transmit (and receive) a k-bits length message to (and
from) a neighbouring sensor node at distance d away, respectively. The energy
consumed for message transmitting (ETx(k,d)) can be partitioned into two. The rst
part is the energy consumed in the transmitted electronic component and is equal to
E-elec xk, whereE-elec denotes the energy consumed for driving the transmitter or
receiver circuitry. The second part is the energy consumed in the amplier
component and is equal to ampkdn, where amp denotes the energy required for
the transmitter amplier. Note that, the receiving process performed in a sensor node
only includes the rst part of the energy consumption. Sum- marizing the above
descriptions, the total energy consumption for message transmitting and receiving is
as follows. ETx(k,d) = Eelec k +amp k dn (1) ERx(k) = Eelec k (2) Note that,
in this paper, we let n = 2, Eelec = 50nJ/bit, and amp =100pJ/bit/m2 in Equations (1)
and (2) for later simulation.

Key Words WS N, Data collection , EAS RC, S ink relocation , Adaptive buffering.

I.

INTRODUCTION

AWSN consists of small-sized sensor devices, which are equipped with limited
battery power and are capable of wireless communications. When a WSN is
deployed in a sensing eld, these sensor nodes will be responsible for sensing
abnormal events (e.g., a re in a forest) or for collecting the sensed data (temperature
or humidity) of the environment. In the case of a sensor node detecting an abnormal
event or being set to periodically report the sensed data, it will send the message
hop-by-hop to a special node, called a sink node. The sink node will then inform the
supervisor through the Internet. As shown in Fig. 1, sensor node e detects an
abnormal event and then it will send a warning message to the sink to notify the
supervisor via a predetermined routing path, say Pea = edcba. Note that the
routing path may be static or dynamic, depending on the given routing algorithm.
The applications of WSNs are broad, such as weather monitoring, battleeld
surveillance, inventory and manufacturing processes etc., In general, due to the
sensory environments being harsh in most cases, the sensors in a WSN are not able
to be recharged or replaced when their batteries drain out of power. The battery
drained out nodes may cause several problems such as, incurring coverag e hole and
communication hole problems. Thus, several WSN studies have engaged in
designing efcient methods to conserve the battery power of sensor nodes, for
example, designing duty cycle scheduling for sensor nodes to let some of them
periodically enter the sleep state to conserve energy power, but not harming the
operating of the sensing job of the WSN; designing energy-efcient routing
algorithms to balance the consumption of the battery energy of each sensor node .

B. The Energy-Efcient Load-Balanced Routing Protocol (the Maximum Capacity

Path, MCP)
As discussed previously, in order to prolong the network lifetime of a WSN,
energy saving is the key design issue. Routing protocol designs of message reporting
in a WSN can generally be classied into two categories: static routing and dynamic
routing. For the static routing type, when as the message reporting paths are
determined, each sensor node will report its sensed data along the predetermined
path to the sink at any time. On the other hand, a dynamic routing protocol might
alter the routing paths in each transmission round according to the current state of
the sensor nodes residual battery energy. Due to the fact that the dynamic routing
protocols can balance the load on each sensor node, it performs better for network
lifetime prolonging than the static routing protocols. In this paper, we use a dynamic
routing protocol, called Maximum Capacity Path (MCP), as the underlying routing
protocol of the proposed sink relocation method. The MCP is proposed by Huang
and Jan and has also been demonstrated to perform well in prolonging network
lifetime in a WSN. In the following, we will use an example to illustrate the
procedure steps of the MCP routing algorithm.
A WSN and its current residual battery energy state of sensor node can be
modelled by a capacity graph G =(V, E), where set V denotes the collect ion of
sensor nodes and E denotes all of the possible direct communication between sensor
nodes. And let r: V R+ be the residual battery energy function to represent each
sensors residual battery energy.
For example, node S stands for the sink with innity energy due to the fact that
it can plug in to a power line or is equipped with an extremely large capacity battery
compared to that of the sensor nodes. The value that is associated with node A is
equal to 50, which stands for the current residual battery energy of sensor node A.
The MCP mainly consists of three procedure steps. They are, (1) layering graph G
into a layered network N; (2) determining the maximum capacity path for each
sensor node; and (3) routing performed and residual energy updated. The MCP will
iteratively perform the above three steps for each round of message reporting.
Detailed operations for layering the graph in the rst step are as follows.
Let level number Lv with respect to each sensor node v V denote the shortest
path length from v to the sink S. The layered network N can be obtained from graph
G by deleting the edges (u,v) E such that Lu = Lv. Then the layered network N
obtained from G is a directed graph, such that for all of the remaining edges (u,v) E
after the deleting operation, the directed edge (u,v) from node u to node v, if Lu = Lv
+1.
Let P=u1,u2,...,ul,S be a path from node u to the sink S in N. And we let the
capacity c(P) of path P be the minimum value of residual battery energy in path P;
that is, c(P) = min{r(u1),r(u2),...,r(ul)}. Let P* be the maximum capacity path with
the maximum capacity value among every path from node u to S. The resulting
graph of the union of each maximum capacity path P*, u V will be the routing

Fig.1. An operating scheme of a WSN

II.

THE BACKGROUND AND RELATED WORKS FOR THE SINK

RELOCATION

20

International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

paths for message reporting. The above operations are the second procedure steps of
the MCP.Now, as a sensor node u detects an abnormal event or has sensed data to
report to the sink node S and then the message will be relayed along the maximum
capacity path P* to S. The residual battery energy of each sensor node in the path is
updated accordingly as the nodes relay messages to the sink. The above three
procedure steps will be repeated for each transmission round until one of the nodes
drains out its battery energy.

III.

THE PROPOSED ENERGY-AWARE SINK RELOCATION WITH

CREDIT (EASRC) ALGORITHM

In the EASRC method, we incorporate the technique of sink relocation once the
residual battery energy of the neighbour nodes goes low after performing rounds of
message relaying and environment sensing tasks. Moreover, the relocating decision
made by the sink will take the MCP routing protocol, (which has been described in
the previous section) as the underlying message routing in order to gain the merit of
prolonging network lifetime. The proposed EASRC consists of two components: the
sink relocation mechanism and the adaptive buffering that are described as follows.
Fig.3. An illustration of the four candidate moving destinations for sink relocation.

1) The sink relocation mechanism

Then, the relocating position Si will be chosen from S1, S2, S3, andS4, such that
the weight value wi with respect to Si is the maximum value among wi (1 i 4).
Now the sink s will relocate itself to position Si. Intuitively, the weight value wi of a
candidate position represents the residual energy lower bound among the bottleneck
value of the routing paths to the sink when the sink relocate its elf to the candidate
position Si . Thus the EASRC method will drive the sink to the candidate position
with the greatest wi value among the four candidate positions by adopting healthy
routing paths to transmit the message to enhance the network lifetime. After the sink
relocates to the new position, the above processes (the residual battery energy
collecting, the relocating condition checking) will be iteratively performed. In the
case of the relocation condition once again being met, then the relocation process
will also be invoked again. Detailed procedure steps of the Energy-aware
transmission range adjusting for the sensor node and the relocating method for the
sink are illustrated further.

This mechanism consists of two parts. The rst is to determine whether to

trigger the sink relocation by determining whether a relocation condition is met or
not. The second part is to determine which direction the sink is heading in and the
relocation distance as well.

Procedure Energy Aware Sink Relocation (Sink S)

Input:
V: The set of sensor nodes in the WSN;
N: The neighbour set of S with range ;
B: Initial battery energy;
r(u): Current residual battery energy of u;
n(u): Neighbour subsets in a ring area;
k(u): Total residual battery energy of each node in n(u);
{
while(true)
{
/* data collecting */
collecting the residual battery energy r(u);
compute the maximu m capacity path P* and its maximu m capacity value c(P*);
/*summation of the residual energy of all the nodes within the ring area*/
k (u)= r(u);
/* relocating condition checking */
Compares the k(u) of each ring in the network;
if(k(u)<B/2)
then
/* perform the sink relocating */
determine the moving destination candidate position S1, S2, S3 and S4;
compute the neighbour subset N1, N2,N3 and N4;
compute the weight value wi with respect to each neighbour subset Ni( 1 I 4);
let Si be the moving destination candidate with the maximu m weight value among
w1, w2, w3 and w4;
relocate the sink S to the position Si;
}
}//end while(true) loop
}

Fig.2. An illustration for sink relocation

For the relocation condition, the sink will periodically collect the residual
battery energy of each sensor node in the WSN. After the collecting process is
completed, the sink will use the MCP routing protocol to compute the maximu m
capacity path P* with respect to each sensor neighbour u of sink s. For each
maximu m capacity path P*, we denote the maximu m capacity value with respect to
P* as c(P*). Let the collection of the sensor neighbours of s be N. Then the
relocation condition will be met when one of the following conditions occurs: (1)
when one of the capacity values c(P*) with respect to the sensor neighbour u in N
drops below B/2; or (2) the average residual battery energy of the neighbour set
drops below B/2. That is, when either the
1.
2.

u N, such that: c(P*)<B/2 or

uN r(u)/|N| < B/2

condition occurs, which means the residual energy of the nearby sensor nodes of the
sink become small or the residual energy bottleneck of some routing paths falls
below a given threshold (B/2). Then the sink relocation mechanism will be
performed to relocate the s ink to a new position, which can enlarge the network
lifetime. In the case of the sink having to relocate, it will rstly determine the
positions of the moving destination. The moving destination has 4 candidate
positions, S1, S2, S3, and S4, which are located in the right, up, left, and down
direction distance away from the current position of the sink. Let the neighbour
subset Ni with respect to each moving destination candidate Si (1 i 4) be the
collection of sensor nodes that is located within the circle centred at node Si with
radius , respectively.Let a weight value wi that is associated with each neighbour
subset Ni,1 i 4 be
wi = min{c(P*)|u Ni}
where c(P*) denotes the maximum capacity value of P*.

Fig.4. The procedure steps for the energy-aware-sink-relocation in the sink.

2) Adaptive Buffering
Data loss in a wireless communication system result by two ways. One possibility
is that data is transmitted successfully and traveling on a communication channel
data may be lost due to channel impairments, heavy traffic resulting in collisions, no
connecting node etc. second possibility of data loss is before data transmission takes
place. With a small sized hardware having constraints on its memory and buffer
sizes, there is possibility of data loss due to buffer overflow. The tradeoff between
packet loss due to buffer overflow and packet loss due to transmission errors
decreases the overall system throughput. Data loss after transmission can be
controlled to some extent by using proper modulation technique, channel encoding,
error correcting codes etc. Data loss before transmission needs to take care by
individual node. This kind of data loss is very prominent in the wireless
communication networks where each node is highly hardware constrained as well as
energy constrained. Wireless sensor network is a good example of this kind of
network. Data loss in the node also results due to network congestion. Data is lost in

21

International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

the node itself before getting transmitted. Such loss occurs due to the buffer
overflow at the output buffer (data loss due to buffer congestion).
Since the sensor node has stringently limited buffer capability, the transmission of
data message along the path from the source node to the destination node may cause
buffer overflow in case of intensive traffic load. Significant amount of literature
exist on buffer overflow problem in wireless sensor networks and performance
strongly depends on the buffer size, transmission rate and network throughput. Large
buffer space, if possible, in sensor node can store large amount of data packet, and
reduce buffer overflow; however, deploying large memory at each node is costly and
impractical. Thus, each sensor node can only be equipped with limited buffering
capacity. The advantage of power aware buffering leads to take advantage of the
predictable idleness of workload and extend the lifetime of sensor networks. In our
proposed algorithm (EASRC), the buffer level in each node will be monitored by the
credit level stored in the sensor node itself. If the buffer level is above a threshold
value the credit will be updated as low else it will remain as high.

simulation time 150sec.The network lifetime increased as the transmission range

increased for the EASRC method. Since a transmission range is setting to be larger,
the routing path length will be decreased and the number of neighbo urs with respect
to the sink will also be increas ed. The amount of residual battery energy in the hot
spots for performing the message relaying task to the sink will be increased, which
might then increase the network lifetime of a WSN.
Fig.7 shows the comparative results of overhead with varying the energy level of
the sensor nodes. EASRC reduces the traffic and thus shows the effectiveness. It is
the measure of the ratio between sums of energy consumption of all nod es to the
total number of packets delivered.
Fig.8 shows the dropping ratio with varying the number of sensor nodes.
Dropping ratio refers to the number of packets dropped by the sensor nodes on its
way to the base station via sink node. When compared to the existing system the
dropping ratio is low in the proposed system. The dropping ratio is less in the
proposed system because of the adaptive buffering method in the proposed EASRC
algorithm. The path of the sensor node will get altered before the buffer level of its
neighbour sensor node gets full, the dropped packets amount is comparatively less.
Fig.8 shows the throughput comparison by varying the number of sensor nodes.
Throughput refers to the number of packets delivered to the base station by the sink
node at any instance of time. When compared to the EASR the throughput is high in
the EASRC. It traverses through the shortest path inside the sensing field and
collects updated data on time and hence delivers more number of packets at any
instance of time to the base station.
Fig.9 shows the PDR (Packet Delivery Ratio) comparison with varying the energy
level of the sensor nodes. Packet delivery ratio refers to the number of packets
delivered to the base station at any instance of time. The sink node traverses through
the shortest path inside the sensing field and collects data from the sensors. Packet
delivery ratio is expressed in terms of number of packets. When compared to the
existing system (EASR) the packet delivery ratio is high in the proposed system
(EASRC).
Fig.10 shows the comparative results of jitter with varying the energy level of the
sensor nodes in the network. Jitter refers to the delay which is the amount of time
delayed by the sink node to forward the data to the base station. Delay is expressed
in units of time, usually milliseconds in wireless sensor networks. When compared
to the existing system (EASR) the delay is low in the proposed system (EASRC).
The delay in delivering the data to the base station by the sink node is less in the
proposed system because the sink node relocates in an efficient way and collects the
data in lesser time than the existing system.

Procedure- Adaptive Buffering with Credit technique

Input:
CH: Credit High indicates the more buffer level in the sensor nodes;
CL: Credit Low indicates the less buffer level inthe sensor nodes;
q_level: variable that holds either CH or CL;
{
/* Monitors the q_level */
determines the buffer level and embeds the q_level (CH/CL) with the hello message;
broadcasts the hello message for interval of time;
if(q_level==CH)
{
the nodes find an alternative path;
}
else
{
forwards the data in the existing path
}
Fig.5. The procedure steps for the Adaptive Buffering using Credit technique

In EASRC algorithm, the buffer level (queue level) is shared via hello message
among the sensor nodes in WSN. The hello message in the network will be
generated for periodic interval of time to update the other nodes residual energy,
next hop and the queue level. The credit is updated as CH(Credit High) if a node has
enough buffering capacity else the credit is updated as CL(Credit Low) in that sensor
node. If the credit level is determined as CH the sensor node keeps forwarding its
sensed data to the node else if the credit is determined as CL the sensor nodes will
find another node to forward its data packets.

Fig.11 is the comparative results of throughput with varying the number of sensor
nodes. Throughput refers to the number of packets delivered to the base station by
the mobile collector at any instance of time. When compared to the existing system
the throughput is high in the proposed system. It traverses through the shortest path
inside the sensing field and collects updated data on time and hence delivers more
number of packets at any instance of time to the base station.
Fig.12 shows the jitter variance with varying the number of sensor nodes. Jitter
refers to the delay which is the amount of time delayed by the sink node to forward
the data to the base station. Delay is expressed in units of time, usually milliseconds
in wireless sensor networks. When compared to the existing system (EASR) the
delay is low in the proposed system (EASRC). The delay in delivering the data to the
base station by the sink node is less in the proposed system because the sink node
relocates in an efficient way and collects the data in lesser time than the existing
system.
Fig.13 shows the Average Energy Consumption varying the sensor nodes . The
sensor node consumes power for sensing, communicating and data processing. More
energy is required for data communication than any other process. The energy cost
of transmitting 1 Kb a distance of 100 metres (330 ft) is approximately the same as
that used for the execution of 3 million instructions by a 100 million instructions per
second/W processor. Power is stored either in batteries or capacitors. More the
sensor nodes save energy more will be the lifetime of the WSN. Upon comparing the
existing system (EASR) ,the energy is saved more in our proposed system (EASRC).
The performance results for network lifetime comparisons when the initial battery
energy variation and varied number of sensor nodes are given. The EASRC also
outperformed the other schemes as the initial battery energy varied. And as the initial
battery energy increased, the gap in the performance results increased between the
EASRC method and the EASR scheme. As expected the stationary sink scheme
received the worst network lifetime performance.

Fig.6. An illustration for adaptive buffering using credit technique

The Fig.6 shows the buffer level monitoring in the WSN using the credit
technique to reduce the number of packet loss that increases the throughput of the
network. Initially the q_level is given as CL to all the sensor nodes in the network.
Based on the number of packets it receives the q_level gets updates to CH or remain
as CL. A threshold value is set and if the q_level attains the threshod level, the
q_level of the sensor node gets updated as CH. This updation is embedded with the
hello message which all the sensor nodes share for regular intervals.
This approach can not only relieve the burden of the hotspot (the node that has very
low residual energy is known as hotspot), but can also integrate the energy-aware
routing to enhance the performance of the prolonging network lifetime.
IV.

SIMULATION

Simulation of the algorithm is performed using NS-2. The nodes are placed in a
grid structure in the given area. The results obtained for different performance
measures of EASRC are compared with EASR.
A network is considered with diameter of 1000 x 1000 meters with 36 nodes
(including the Sink node), packet size is 64kB, initial energy of nodes is 100 J and

22

International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

Fig.9. PDR comparison with varying the energy level of the sensor nodes
Fig.7. Normalized overhead comparison with varying the energy level of the sensor
nodes.

Fig.10.Jitter comparison with varying energy level of the sensor nodes

Fig.8. Dropping ratio comparison with varying the energy level of sensor nodes

23

International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

Fig.11. Throughput comparison with varying the number of sensor nodes

Fig.13. Average Energy Consumption comparison with varying the number of
sensor nodes

The results also show that the stationary sink scheme had the worst performance
in any instance of the number of sensor nodes. Since the sink in the stationary sink
scheme stays in the same position, the neighbours of the sink (the hot-spots) are
always the same set of sensor nodes. Consequently they will quickly drain out their
battery energy.

V.

CONCLUSION AND FUTURE WORK

The depleting speeds of battery energy of sensor nodes will signicantly affect the
network lifetime of a WSN. Most researchers have aimed to design energy -aware
routings to conserve the usage of the battery energy to prolong network lifetimes. A
relocatable sink is another approach for prolonging network lifetime by avoiding
staying at a certain location for too long which may harm the lifetime of nearby
sensor nodes. This approach can not only relieve the burden of the hot -spot, but can
also integrate the energy-aware routing to enhance the performance of the
prolonging network lifetime. In this paper, we have propos ed an EASRC, which
mainly focuses on the buffer overflow problem that leads to information lost. Hence,
reducing the packet loss serve in reducing the required number of retransmission.
Thus the nodes save energy. Also it adopts the energy -aware routing MCP as the
underlying routing method for message relaying. Theoretical analysis has been made
to demonstrate that our proposed EASRC algorithm prolongs the network lifetime.
As an extension of this work, we are investigating how the proposed scheme can be
adopted for mobile nodes.
Fig.12. Jitter comparison with varying the number of sensor nodes

REFERENCES
G.Xing,T .Wang,W.lia A Rendezvous-Based Approach Enabling Energy-Efficient Sensor
Collection With Mobile Sinks (IEEE T ransaction on Parallel and Distributed System, Vol. 23, No.
5, 2012)
[2] S.Jain, M.C.ShahA Novel Information Acquisition Technique for Mobile-Assisted Wireless Sensor
Networks(IEEE T ransaction on Vehicular T echnology, Vol. 61, No. 4, May 2012)
[3] HamidrezaSalarian, Kwan-Wu Chin, and FazelNaghdy An Energy-Efficient Mobile-Sink Path
Selection Strategy for Wireless Sensor Networks(IEEE T ransactions on Vehicular T echnology,
Vol.63, No.5, June 2014)
[4] Zaenab D. Shakir, Kenji Yoshigoe, R. B. Lenin Adaptive Buffering Scheme to Reduce Packet Loss
on Densely Connected WSN with Mobile Sink(2 nd IEEE International Workshop on Densely
Connected Networks)
[5] Ming Ma, Miao Zhoa and Yuanyuan yang Efficient data gathering with mobile collector and
SDMA in WSN(IEEE transactions on computer,vol.60,no.3,march 2011)
[6] Ahmad Patooghy, MeisamKamarei, Ali Farajzadeh, FatemehTavakoli, Mehdi Saeidmanesh LoadBalancing Enhancement by a Mobile Data Collector in Wireless Sensor Networks (8 th International
Conference on Sensing T echnology, Sep. 2-4,2014, Liverpool, UK)
[7] S.H. Patil, S.M. Shinde Reliable Data Collection using Mobile Data Collector in Wireless Sensor
Network (International Journal of Engineering and Advanced T echnology(IJEAT ) ISSN:2249 8958, volume-2, Issue-5, June 2013)
[8] R. Alageswaran, R. Usha, R. GayathriDevi, G.Kiruthika Design and Implementation of Dynamic
Sink Node Placement using Particle Swarm Optimization for Lifetime Min imization of WSN
Applications (IEEE- International Conference on Advances in Engineering, Science and
Management(ICAESM-2012) March 30,31,2012)
[9] WaleedAlsalih, SelimAkl, HossamHassaenein Placement of Multiple Mobile Base stations in
Wireless Sensor Networks (IEEE International Symposium on Signal Processing and Information
T echnology, 2007)
[10] ZoltanVincze, Rolland Vida, Attila Vidacs Deploying Multiple Sinkin Multi-Hop Wireless Sensor
Networks (IEEE, 2007)
[11] Guiling Wang, Guohong Cao, T om La Porta, and Wensheng Zhang Sensor Relocation in Mobile
Sensor Networks
[12] Arun K. Kumar and Krishna M. Sivalingam Energy-Efficient Mobile Data Collection in Wireless
Sensor Networks with Delay Reduction using Wireless Communication (IEEE, April 30, 2010)
[1]

24

International Journal of Networks (IJN)

Vol. 1, Issue. 1, April 2015

ISSN (Online): 2454-1060

[13] Leandro Aparecido Villas, AzzedineBoukerche, HeitorSoares Ramos,Horacio A.B. Fernandes de

Oliveira, Regina Borges de Araujo, and Antonio Alfredo Ferreira Loureiro(2013). DRINA: A
Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor
Networks, IEEE T RANSACT IONS ON COMPUT ERS, VOL. 62, NO. 4, APRIL 2013.
[14] AdwitiyaSinha and DayaKrishanLobiyal(2013) Performance evaluation of data aggregation for
cluster-based wireless sensor network, Human-centric Computing and Information Sciences 2013, a
Springer Open Journal.
[15] Kumar, D., Aseri, T . C., & Patel, R. B. (2011) EECDA: Energy efficient clustering and data
aggregation protocol for heterogeneous wireless sensor networks. International Journal of
Computers Communications& Control, 6(1), 113124. ISSN 18419836.
[16] Chi-T sun Cheng, Member, IEEE, Henry Leung, Member, IEEE, and Patrick Maupin(2013). A
Delay-Aware Network Structure for Wireless Sensor Networks With In-Network Data Fusion, IEEE
SENSORS JOURNAL, VOL. 13, NO. 5, MAY 2013 .
[17] K.Lin, M.Chen, S. Zeadally, and J. J. P. C. Rodrigues, Balancing Energy Consumption with
Mobile Agents in Wireless Sensor Networks Future Generation Computer Systems, Vol. 28,
pp.446-456,2012.
[18] B. C. Cheng Network lifetime bounds for Hierarchiral Wireless Sensor Networks in the presence of
Energy Constraints, Computer Networks, Vol.56, No.2, pp.820 -831, 2012.
[19] S. V. AnnlinJeba and B. Parasivan, Energy Efficient Multi-Path Data Transfer Scheme to Mitigate
false data injection attack in Wireless Sensor Network, Computers and Electrical Engineering,
Vol.39, pp.1867-1879, 2013.
[20] M. Matra and M. Cardei, Improved Sensor Network lifetime with Mltiple Mobile Sink, Pervasive
and Mobile Computing, Vol.5, pp.542-555, 2009.
[21] J. W. Ding, D. J. Deng, T . Y. Wu, and H. H. Chen, Quality-aware bandwidth allocation for scalable
on-demand streaming in wireless networks, IEEE J. Sel. Areas Commun., vol. 28, no. 3, pp. 366
376, Apr. 2010.
[22] Y. Yang, M. I. Fonoage, and M. Cardei, Improving network lifetime with mobile wireless sensor
networks, Comput. Commun., vol. 33, no. 4, pp. 409 419, Mar. 2010.
[23] G. S. Sara and D. Sridharan, Routing in mobile wireless sensor network: A survey, T elecommun.
Syst., Aug. 2013.
[24] M. Marta and M. Cardei, Improved sensor network lifetime with multiple mobile sinks, J. Pervas.
Mobile Comput., vol. 5, no. 5, pp. 542555, Oct. 2009.
[25] H. Salarian, K.-W. Chin, and F. Naghdy, Coordination in wireless senso- ractuator networks: A
survey, J. Parallel Distrib. Comput., vol. 72, no. 7, pp. 856867, Jul. 2012.
[26] S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, and Z. M. Wang, Controlled sink mobility for
prolonging wireless sensor networks life- time, Wireless Netw., vol. 14, no. 6, pp. 831858, Dec.
2008.
[27] M. Gatzianas and L. Georgiadis, A distributed algorithm for maximum lifetime routing in sensor
networks with mobile sink, IEEE Trans. Wire- less Commun., vol. 7, no. 3, pp. 984994, Mar.
2008.
[28] M. Ma and Y. Yang, Data gathering in wireless sensor networks with mobile collectors, in Proc.
IEEE Int. Symp. Parallel Distrib. Process., Miami, FL, USA, Apr. 2008, pp. 1 9. S. Nesamony, M.
Vairamuthu, and M. Orlowska, On optimal route of a calibrating mobile sink in a wireless sensor
network, in Proc. 4th Int. Conf. Netw. Sens. Syst., Braunschweig, Germany, Jun. 2007, pp. 61 64.
[29] N. Abu-Ghazaleh, K. D. Kang and K. Liu. T owards resilient geographic routing in wireless sensor
networks.In Proc. of the 1st ACM Workshop on QoS and Security for Wireless and Mobile
Networks, Montreal, Canada, October 2005.
[30] A Network Lifetime Enhancement Method for Sink Relocation and Its Analysis in Wireless Sensor
Networks,Chu-Fu Wang; Jau-DerShih; Bo-HanPan; T in-YuWu for Sensors Journal, IEEE
Volume: 14 ,Issue:6,DOI:10.1109/JSEN.2014.2306429, Publication Year: 2014 , Page(s): 1932 1943 ,IEEE Journals & Magazines

25