a survey on routing protocols in wireless sensor network using mobile sink

Int. Journal of Electrical & Electronics Engg. Vol. 2, Spl. Issue 1 (2015) e-ISSN: 1694-2310 | p-ISSN: 1694-2426

15 NITTTR, Chandigarh EDIT-2015

A Survey on Routing Protocols in WirelessSensor Network Using Mobile Sink

1Deepak Kumar, 2Deepali1,2CS Department, Guru Nanak College, Budhlada, India

Abstract— Wireless sensor network (WSN) is collection oflarge number of sensor nodes which senses the physicalconditions of environment and send the data to sink. WSNcan be classified as static and mobile WSN. In static routingprotocol, energy consumption is not uniformly distributed. Toavoid this problem, wireless sensor network with mobile sinkcan be used, where mobile sink gathers data from other nodesusing 1-hop communication. In this paper, we presented thevarious types of WSN. At last, we compared the variousrouting protocol of WSN with mobile sink based onparameter no. of sinks, mobility of CH and mobility pattern.

Keywords—Static WSN. Mobile WSN, Sink node,Cluster head

I. INTRODUCTION

WSN is collection of large number of sensor nodes whichsenses the physical conditions of environment and send thedata to sink. The various application of WSN is in militaryarea, environment area, health, home and other commercialareas [1]. A sensor network design is influenced by manyfactors like fault tolerance, scalability, production costs,operating environment, transmission media and powerconsumption.

WSN is divided into categories based on type ofcommunication: Single-hop and Multi-hop. In Single-hopcommunication, CH directly sends their aggregate data tosink. In Multi-hop, CH may send their aggregate to otherCH that is nearer to CH rather than sink directly. CH usesone or more CH to send its data to sink.

Fig 1.1 shows the categorization of WSN. WSN can beclassified as static and mobile WSN. In static WSN, energyefficient routing algorithm can be categorized as follows:data centric routing algorithm, location based routingalgorithm and hierarchical routing algorithm. Data centricrouting algorithm finds route from multiple sources tosingle destination by using metadata [2]. Location basedrouting algorithm requires actual location information forevery sensor node. Hierarchical routing algorithm dividesthe network into clusters [3]. Cluster head (CH) is electedin each cluster. CH collects data from its members,aggregates the data and sends to sink. This approach isenergy efficient but relatively complex than otherapproaches.

Fig 1 Categorization of WSN

In WSN, mobility can be divided into three classes: sinkmobility, node mobility, relay agent mobility[4]. In sinkmobility, sink node’s position is not static throughout thelifetime of network. With sink mobility, we can achieveload balancing and longer network lifetime. In nodemobility, sensor nodes are mobile. It is further categorizedinto two classes: Weak mobility, Strong mobility. In weakmobility, mobility takes place due to death of somenetwork nodes. In strong mobility, mobility takes placedue to external factors. In relay agent mobility, the endsystem is mobile. Sink mobility can be classified accordingto movement as: random mobility, predictable mobilityand controlled mobility. In random mobility, nodes moverandomly in network. In predictable mobility, nodes movealong a trajectory with given speed. In controlled mobility,external entity controls the node movement.

An outline of this paper is as follows. Section II presentsthe Low Energy Adaptive Cluster Hierarchy (LEACH)protocol. Section III presents the related work. Section IVpresents comparison of routing protocols based on mobilesink WSN and section V describes the conclusion of thepaper.

II. LEACH Protocol

LEACH [5] is a cluster based approach in which bothsensor nodes and sink are stationary. LEACH works inrounds. Each round begins with set up phase followed bysteady phase. In set up phase, CH is elected. Each nodegenerates random number between 0 and 1. This number iscompared with threshold value T(n) which is calculated byusing Eq. (1).

T(n) =∗( ) if n ∈ G0, Otherwise (1)

Where P is percentage of CHs, r is number of rounds andG is set of nodes that have not been CHs in the last 1/Prounds. If the random value is less than T (n), the nodebecomes CH for current round. In steady phase, all Non-CH nodes send data to CH and then CH aggregate all dataand send it to the sink.

III. RELATED WORKIn [6] author proposed a protocol in which sink mobility isconsidered for removing the problem of energy depletionof nodes that are nearer to sink. In this, sink changes itsposition when the energy of nearby nodes becomes low.Sink moves to that zone which has maximum residualenergy. Simulation result shows that proposed protocol

Wireless SensorNetwork

Static WSN

Datacentric

Mobile WSN

LocationBased

Hierarchical

RelayagentMobility

NodeMobility

SinkMobility

WeakMobility

StrongMobility


NITTTR, Chandigarh EDIT -2015 16

increase the network lifetime than the protocol that havingstatic nodes.

In [7] author proposed a protocol that using mobile sink. Inthis protocol, when each round begins, clustering isperformed and CH get selected as in LEACH. All CHssend a status packet across the network which gives theinformation of maximum distance from sink supported byCH for performing the data communication. Node’sremaining energy and lifetime is tracked down forcalculation of this distance. The optimal point for sink is anew location where data communication with all the CHscan take place in minimum cost of energy. Simulationresult shows that proposed protocol increases networklifetime.In [8] author proposed a protocol that having both nodeand sink mobility. In proposed protocol, after deploymentof sensor nodes, network is divided into clusters and eachcluster contains sensor node with different roles such thatgateway node, CH node and ordinary sensor node. Sinkselects a gateway node in each cluster which has highestremaining energy and lowest mobility level. Sink selectstwo CH in each cluster such that two nodes jointly cancover the entire cluster. Ordinary nodes send their data toCH. CH aggregates the data and send to gateway node.Gateway node collects data from both CH and send to sink.This hierarchical protocol reduces energy consumption andincreases network lifetime. Simulation results show thatthe proposed protocol is better than CBR-Mobile in termsof throughput, average energy consumption and networklifetime.In [9] author proposed a scheme based upon controlledmobility of sink. In this protocol, mathematical modelMixed Integer Linear Programming (MILP) is used forfinding the path of sink such that it will consume lessenergy and increase network lifetime. Simulation resultshows that the proposed scheme increases networklifetime.

In [10] author proposed Mobile-Sink based Energyefficient Clustering Algorithm (MECA).In this algorithm,initially mobile sink is deployed at the edge of the sensingfield that moves along a fixed track and is predictable. Sinkonly needs to broadcast its current location at thebeginning and that too just for once. After that, sensornodes keep record of initial position of sink and reduceangle by:- = ∗∆

(2)

Where is velocity, R is radius of transmission range and∆ is time interval. In this, sensing field is divided intoequal sectors. In each sector, a node is selected as CHbased on residual energy. In setup phase, non-CHs sendtheir data to CH. After collecting data, CH aggregates thatdata and sends it to the sink. MECA uses multi-hoptransmission for intra cluster routing for saving energy.Simulation results show that MECA is better than LEACHin terms of energy consumption.

In [11] author proposed Energy Efficient Competitiveprotocol [20]. In this protocol, candidate CH is selectedbased on probability. Each candidate CH computescompetition range as:-residual energy and node id.Competition range is calculated as:

= × ( , ) + (3)

Where is maximum distance, is minimumdistance, ( , ) is distance between node and sink.Candidate CHs that are in competition range will competefor final CH based on residual energy. If two candidateCHs have same residual energy and are in competitionrange, then candidate CH having low node id will beselected as CH. In setup phase, multi-hop communicationis take place. If the distance between CH and sink is lessthan threshold value, then CH sends aggregate data directlyto sink. Else, CH send data to relay node. Each CH selectrelay node as minimum cost node as:-( ) = ∗ ( , ) ( , )( , ( , ) ) + (1 − ) ∗( ) ( )( ) , [0,1] (4)

Where ( , ) is distance between node and node ,SN is sink and ( ) is energy of node j. Sink is mobilewith certain speed and with predefined path. Sink hasscheduled park position. Each CH finds optimal parkposition for sending their data to sink. Simulations resultsshow that mobile sink prolong network lifetime andimprove energy efficiency.In [12] author proposed a protocol that having multiplemobile sink. In this protocol, sensor nodes are deployedrandomly in the network. One sink node has fixed positionwhich controlled the other mobile sink nodes. Mobile sinknodes collect the data from CHs which reducecommunication cost of CHs and increase the networklifetime. Then mobile sink nodes send the aggregated datato static sink. Simulation results show that proposedalgorithm is better than shortest hop path algorithm interms of network lifetime and packet delivery ratio.

IV.PROTOCOL COMPARISON

The papers surveyed have common objective which is touniformly distribute energy consumption by all sensornodes using mobile sink. This improves the overall lifetimeof the network. Protocols discussed in section III arecompared and presented in Table 1.

COMPARISON OF ROUTING PROTOCOLS IN MOBILE WSN

Protocol

Characteristics

No. ofsinks

Mobility isprovided to Mobility

patternSink

CH

[6] Multiple Mobile StaticRandom andPredefined

[7] Single Mobile Static Controlled[8] Single Mobile Mobile Random

[9] SingleMobile

StaticControlled

[10] Multiple Mobile Static Predefined

[11] SingleMobile Static Predefined and

Controlled

[12] MultipleMobile Static Random and

predefined

[13] MultipleMobile Static Random and

predefined


17 NITTTR, Chandigarh EDIT-2015

V. CONCLUSION

In static WSN energy consumption is not uniformlydistributed between all sensor nodes of the network. Thiscauses a limited network lifetime. To avoid this problem,wireless sensor network with mobile sink can be used. Inthis paper, we presented the various types of WSN. At last,we compared the various routing protocol of WSN withmobile sink based on parameter.

REFERENCES.F.Akyildiz,W. Su, Y. Sankarassubramaniam, E.Cayirci, “Wireless SensorNetworks: a survey,” Computer Networks(Elsevier), vol. 38, pp. 393-422, 2002.B.Krishnamachari, D.Estrin, S.Wicker, “Modelling Data-centric routingin Wireless sensor network,” IEEE Infocom, pp. 1-11, 2002.Prabagarane, C. A.Navin, Partibane, Nagarajan, V. Krishnakiran,“Hierarchictal routing algorithm for cluster based multi hop MobileAdhoc network,” IEEE Communication Society, pp. 1116-1120, 2004.A.Raja, X. Su, “Mobility handling in mac for wireless ad hoc networks,”Wirel. Commun. Mob. Comput. ,Vol. 9, pp. 303-311, 2009.

W.R.Heinzelman, “Energy-Efficient Communication Protocol forWireless Microsensor Networks,” Proc. of the 33rd Hawaii InternationalConference on System Sciences, pp. 1-10, 2000.M.Marta, M.Cardei, “Using Sink Mobility to increase Wireless sensorNetwork lifetime,” IEEE 2008.M.H.Khodashahi, F.Tashtarian, M.H.Y. Moghaddam, M.T.Honary,“Optimal Location of Mobile sink in Wireless Sensoe,” IEEECommunication Society, 2010.H.K.D. Sarma, A.Kar, R.Mall, “Energy Efficient Routing protocolWireless sensor networks with node and sink Mobility,” IEEE, 2011.F.Tashtarian, M.H.Y. Moghaddam, S.Effati, “Energy Efficient DataGathering Algorithm in Hierarchical Wireless sensor network withMobile Sink,” Proc. of 2nd International Conference on Computer andKnowledge Engineering, pp. 232-237, 2012.J.Wang, Y.Yin, J.U.Kim, S.Lee, C.F,Lai, “An Mobile-sonk Based EnergyEfficient Clustering Algorithm for Wireless sensor networks,” Proc. of12th International Conference on Computer and Information Technology,pp. 678-683, 2012.J.Wang, X.Yang, Tinghuai, M.Wuz, J.Kim, “An Energy-efficientCompetitive Clustering algorithm for Wireless sensor networks usingMobile Sink,” International Journal of Grid and Distributed Computing,vol. 5, pp. 79-92, 2012.V.Jose, G.Sadashivappa, “A Novel Energy efficient Routing algorithm forwireless sensor network using Sink Mobility,” International Journal ofWireless & Mobile Networks, vol. 6, pp. 15-25, 2014.