336 | P a g e

A REVIEW ON DYNAMIC ROUTING PROTOCOLS IN

WIRELESS SENSOR NETWORK

Gurinder Kaur1, Simarjeet Kaur

2

1MTech Scholar,

2Assistant Professor, Department of Computer Science and Engineering

Sri Guru Granth Sahib World University, Fatehgarh Sahib, (India)

ABSTRACT

In wireless senor network numbers of nodes are present, where each node has ability to sense, compute and

communicate with each other. Routing is defined as the process of finding the route for data transmission. The

nodes can communicate directly with each other or with the help of an external mobile sink. Mobile sink concept

was introduced to overcome the drawback of the static sink, with the help of the mobile sink the energy

consumption of the network is reduced and the life time is also increased. This paper presents the study of

various routing algorithm. The virtual Grid-based dynamic routing is the scheme that is used for the mobile sink

based wireless sensor network. This method also decreases the route constructing cost of the sensor node. Along

with this the comparison between the static routing and dynamic routing is performed.

Keywords: Wireless Sensor Network , Routing , VGDRA, Mobile Sink

I INTRODUCTION

The Wireless sensor network is the network in which the communication is done with the help of small device

termed as nodes without any physical link between them. In wireless sensor network large numbers of nodes are

employed. These nodes are capable of sensing the data, communication etc.[26] The communication is done

between the either directly or with the help of mobile sink. Due to presence of large numbers of nodes in the

network a route is set for sending the data from the source to the destination node. This process of data

transmission between the nodes is termed as the routing. The efficiency of the network also depends on the

selection of the path the as it effects network life time, energy consumption etc. Various routing algorithms have

been designed for the efficient routing process. [18] Earlier the static approach of the routing was replaced by

the mobile sink approach in which the sink is kept mobile. In case of static sink the nodes that were near to sink

received more energy than the nodes that are far way, this leads to the decrease in the life time of the network

.With the help of the mobile sink the balanced amount of energy is transferred among the nodes. While the

routing is performed every time a new route is constructed in order to get the best route.[6] This will leads to

increase in the route construction cost and also the energy consumption is more. The energy of the network is to

337 | P a g e

be conserved so a virtual grid based dynamic routing protocol is proposed that will minimize the route

reconstruction cost of the sensor node. With the help of the VGDRA only the few nodes will readjust there route

in accordance with the sink. This will decrease the route reconstruction cost and also the energy consumption is

reduced.

Fig1. Routing in the network

II ROUTING CHALLENGES AND DESIGN ISSUES

Depending on the application, different architectures and design goals/constraints have been considered for

sensor networks.

1) Node deployment: It is application dependent and affects the performance of the routing protocol. The

deployment is either deterministic or self-organizing. In deterministic situations, the sensors are

manually placed and data is routed through pre-determined paths. Where as in self-organizing systems,

the sensor nodes are scattered randomly creating an infrastructure in an ad hoc manner. In later the

position of the sink or the cluster-head is also crucial in terms of energy efficiency and performance.

When the distribution of nodes is not uniform, optimal clustering becomes a pressing issue to enable

energy efficient network operation.

2) Power Consumption: Since the transmission power of a wireless radio is proportional to distance

squared or even higher order in the presence of obstacles, multi-hop routing will consume less energy

than direct communication. However, multi-hop routing introduces significant overhead for topology

management and medium access control. Direct routing would perform well enough if all the nodes

were very close to the sink.

3) Data Aggregation/Fusion: Since sensor nodes might generate significant redundant data, similar

packets from multiple nodes can be aggregated so that the number of transmissions would be reduced.

Data aggregation is the combination of data from different sources by using functions such as

suppression (eliminating duplicates), min, max and average . As computation would be less energy

consuming than communication, substantial energy savings can be obtained through data aggregation.

338 | P a g e

4) Node capabilities: Depending on the application a node can be dedicated to a particular special

function such as relaying, sensing and aggregation since engaging the three functionalities at the same

time on a node might quickly drain the energy of that node.

5) Scalability: Routing protocols should be able to scale with the network size. Also, sensors may not

necessarily have the same capabilities in terms of energy, processing, sensing, and particularly

communication. Hence, communication links between sensors may not be symmetric, that is, a pair of

sensors may not be able to have communication in both directions. This should be taken care of in the

routing protocols.

III ROUTING

Routing process is the process of finding the distance between the source and the destination. Various protocols

are designed for the process of routing. The routing is classified into two types:

1) Static Routing

2) Dynamic Routing

Fig2. Classification of Routing

3.1 Static Routing

In this type of routing the routes are manually decided. The tables are created in which the routing information

is saved route that is selected for the routing or network administator that configure the network routes

manually. It is considered as the simplest form of routing as the routes selected once do not change. In Static

routing the routes are manually configured , updated and repair so the external network failures do not effects

routing. Various static routing based algorithm have been designed for the routing process.

Fig3. Static Routing

Routing

Dynamic Routing Static Routing

339 | P a g e

3.2 Dynamic Routing

In this type of routing the routers themselves learn the routes to the destination in the network. It is also known

as the adaptive routing. The best route that is selected by the router will be shared with other router that is

present in same routing protocol. For dynamic routing no network administrator is needed. These protocols are

capable of responding any change that occurs in the external network. Various dynamic routing protocols are

used to update the routing table and to find the path between the source and the destination. The dynamic

routing protocols are divided into further two types:

A) Distance-Vector Protocols B) Link-State Protocols

Fig4. Dynamic Routing

The table given below presents the comparison between the Static Routing and Dynamic Routing:

S. No Static Routing Dynamic Routing

1

The path between the source and the

destination is set manually.

The path between the source and

destination is the protocols are used to

update tables and to select the path.

2

The fault in the router cannot be detected

that means it does not have controlling

mechanism.

The faults in the router present in the

network are detected.

3

The static routing is used simple process

of sending data from source to the

destination.

The dynamic routing uses complex

algorithm for sending data packets from

source to destination.

4

In case of static routing minimal memory

is required.

The router present in dynamic routing used

few memory, depending on .the algorithms

used.

340 | P a g e

5

The network administrator find out the

optimal path and make changes in the

routing table.

In case of dynamic routing the protocol is

responsible for routing the packets and

making changes in the routing table.

IV DYNAMIC ROUTING PROTOCOLS

This section presents the various routing algorithms that are used for the routing process. Along with this the

comparison between the various static and dynamic algorithm is made for choosing the best routing protocol.

The distance between the source and destination should be reliable, short and should increase the efficiency of

the system. So in this the various existing algorithms have been discussed in order to make comparison.

Dynamic Routing: In this type of routing various protocols are defined that are used for the finding the route

between the source and the destination. Various dynamic algorithms have been proposed earlier for the efficient

routing purpose .Some of the dynamic algorithms is defined below: - Dynamic is further divided into two types

A) Distance-Vector Protocols

B) Link-State Protocols

A) Distance Vector Protocols: In these protocols the routing table is updated and is send to the neighbors.

These protocols are based on the distance. The main type of distance a vector protocols are Routing information

protocol (RIP), Interior gateway routing protocol (IGRP) etc.

Routing Information Protocol

This is the distance vector protocol that is widely used. In this the route of the routing is updated after

every 30 second. It metric is the number of jumps. A jump is introduced whenever the data cross the

routers. Jumps can be maximum up to 15. The main limitation of this protocol is that the routers that

are used are constant. The route having minimum number of jumps is considered as the best route. Also

it does not always select the fastest route of the delivering data packets. It generates large amount of the

traffic in the network with the updates.

Dynamic Routing

Link-State Protocols Distance-Vector

Protocols

OSPF

EIGRP RIP

341 | P a g e

Fig5. Design of Routing Information Protocol

EIGRP Routing Protocol:

It uses concept of both distance vector protocols and link state protocol. It will group the routers that

perform same task. The routes are formed according to the information obtained from the other routes.

It makes three tables to take the routing decision. The tables that are made are the routing table, the

table consisting information about the neighbor and the topology table. The limitation of the protocol is

that the routing tables are updated they will receive the information from the every route even that are

not required.

Fig6. EIGRP Network Model [14]

342 | P a g e

B) Link State Protocols:

In the link state protocol routers work independently to calculate the shortest distance for transferring data from

the source to the destination. The updates of the routing protocol are generally done in the topology. These

protocols give results like faster time convergence with respect to any change in the topology. The one of the

common used link state protocol is the OSPF.

OSPF

This stands for Open Shortest Path First. It is basically an link state routing protocol. It is used to

construct the shortest route in the routing process. The router present in the routing protocol will give

information about its closest neighbor to the all other router in the network. The routing table will

consist of the information about the paths that are followed by from moving from source to the

destination. A tree structure is made that is used to keep the information about the routes. Among all

the routes obtained it will find the route that covers the shortest distance from the source to the

destination. Thus this routing protocol is considered to be more efficient and effective in finding the

path between the source and the destination.

Fig7. Design Area of OSPF Routing Protocol [18]

Dynamic Source Routing (DSR): It is the on demand protocol in which is basically designed to control the

bandwidth of the data packets that are transmitted. When the data is send to the receiver will inturn send the

acknowlege packet that will give the confirmation to that the send packet is received by the receiver. These

protocol are self organised that does not need any network infrastructure. It does not uses any periodic routing

message. So the bandwidth often network is reduced, also the power is conserved and large routing updates are

not needed.

343 | P a g e

Fig8. Design of Dynamic Source Routing

Destination Sequence Distance Vector (DSDV): It is the proactive routing protocol. It is based on the distance

algorithm. In this every node will keep information about the route of with the other node. It provide the

destination number to each source node and thus the data us transmitted. This is one of the reliable method of

the routing as the updates of every nodes and its route is kept. If the destination node receive information less

than the sequence number then that node is discarded. If the sequence number is same than the information is

kept and its shortest route is saved. Thus this protocol works by sending the sequence number.

Fig9. Design of Destination Sequence Distance Vector Protocol

V LITERATURE SURVEY

The process of finding the best route for the data transmission is termed as the routing. In wireless sensor

network various routing protocols are designed to find the best route in which the energy consumption of the

nodes is less, the life time of the network is increased or some other parameters that make network efficient are

taken into the consideration. Most of the protocols were based on the static sink approach, which was later on

replaced with the mobile sink approach, further the Virtual Grid-based Dynamic Routing was introduced that is

considered to be better than the traditional techniques. This study was carried by studying various papers some

of which are described below:

344 | P a g e

Vic Grout et al discussed that OSPF algorithm for Dynamic Routing. This is basically a link state protocol

whose advantage and disadvantages have been discussed. The protocol is used in two ways firstly for

partitioning of the network and secondly for traffic balanced path calculation. From the experiment perform it is

concluded that the this an efficient algorithm and can be used for the large domain and will increase the

efficiency of the routing.[26]

Bob Albrightson et al studied that a new approach that will reduce the problem of the traditional techniques.

Previously the distance based protocol was used that were easy to implement but had some limitation. Various

other techniques were used but the results were not that much efficient later on the new routing protocol that

were based on the link states have been used that will resolve the problem of the distance based routing but the

configuration and troubles shooting complexity were there so in this paper the new distance based protocol is

proposed that converges as quickly as current link-state protocols, while maintaining loop freedom at every

instant. The EIGRP protocol is introduced. This protocol is divided into the three main elements first is the

transport algorithm for reliable exchange of data, secondly diffusing algorithm for finding short path and lastly

the algorithm can be used in the multiprotocol environment. This algorithm is considered to be efficient

algorithm for the routing.[6]

Neha Grang et al, studied that OSFP protocol that is compared with the various interior gateway routing

protocols. As the routing is the exchange of information between the user and the destination for this various

dynamic routing protocol are used. OSPF is the route distribution protocol that is considered to be efficient than

the traditional protocols for routing.[18]

Md Samil Farouqui et al, discussed on advancement in various routing protocol and will show the comparison

between the RIP and OSPF routing algorithm. The dynamic routing is divided into the two types that is Distance

Vector Based Routing Protocol and Link State Protocol.[15]

Rajendra V. Boppana et al, discussed that an algorithm that is simple and is designed for the multi-hop wireless

ad-hoc network of the mobile node. The performance of the dynamic routing algorithm is better than previously

used algorithm. Some of the limitation of the protocol has been discussed and various modifications have been

done to improve this algorithm. From the results obtained it is concluded that the proposed algorithm is better as

the traffic load is reduced and overall performance of the network is increased .[20]

Haresh N. Patel et al, discussed on various route redistribution by using the EIGRP and OSPF routing protocol.

The main purpose of routing is to choose path between the source and destination. In case of multiple routing

the route redistribution plays an important role. Without route redistribution one cannot advertise route from

source to destination. So for multiple networks the size of routing table of router also increases for this route

summarization is an important to reduce the complexity of the network. The routing algorithm should be

efficient enough to make increase the system efficiency. So in this intra domain protocols have been used.[11]

345 | P a g e

Lateef Ahmad Bhat et al, discussed that an Interior Gateway Protocol (IGP) for the process of routing. The

classification of various Interior gateway routing protocols have been proposed in this paper. The different

protocol like IGRP, EIGRP, and OSPF are compared. An IGP is used to route within the autonomous system,

and also used to route within the individual networks themselves.[13]

Abdul Waheed Khan et al, studied that VGDRA method to reconstruct the route of the nodes by decreasing its

route construction cost as few nodes are readjusted in accordance with the sink. The set of rules are defined for

the communication from the results it was cleared that this algorithm is better as the network life time is

increased.[1]

Aysegul Tuysuz Erman et al, discussed that comparison and evaluation of the various data dissemination

protocol on the basis of the latency and the data delivery ratio. From the results obtained it is concluded that the

overall energy consumption of the network is reduced and the packet delivery ratio is increased.[5]

Adnan Fida et al, studied that approach in which the problem of the route selection is considered for the transfer

of the information. Communication and position-aware reconfigurable protocol is used for the transfer of the

information from the source to destination. This is better route selection method than the traditional methods.[2]

VI VIRTURAL INFRASTUCTURE BASED PROTOCOL

Data dissemination is the premeditated method of data distribution among the nodes of the network. Various

virtural infrastructure based data dissemination protocols have been designed so far mobile sink based wireless

network. Some of the protocols have been discussed below:-

1) Virtual Circle Combined Straight Routing : In this a virtual structure is designed having virtural circles

and the straight lines. The sink will circulate in the sensor field and will collect the information. In this, the set

of rules are defined for minimizing the readjustment cost of the route that is based on the current loation of the

sink. Though this protocol is effcient as the route reconstruction cost is minimize but due to the presence of the

cluster head at the center of the sensor field can cause descrease in its energy.

2) Hexagonal cell-based Data Dissemination: In this algorithm a hexagonal grid structure is formed for the

data transmission considering multiple numbers of mobile sinks. For avoiding the sink data quires the data is

evenly distributed into the six different directions of the hexagon formed .The node firstly distributed data to the

center line. The nodes that are at the end will store and replicate the data. Due to the presence of the mobile sink

after the sink change its position from one cell to another it informs both center node and the nodes present

along the border. In this way the more energy is consumed if the speed of the mobile sink is more.

3) Backbone-based Virtual Infrastructure: This is the data dissemination in which the single level multi-hop

clustering is used. The main of this objective is to decrease the number of clusters. So that every cluster heads

should know about the location of sink according to which it will set its route. As this method is consider to be

one of the best methods but the life time of network decreases.

346 | P a g e

VII VIRTURAL GRID BASED DYNAMIC ROUTING

As we know that for formation of network. we need to find the route between all the nodes coming in the

network, for this purpose routing is done. Routing is defined as transfer of information from source to

destination. Along the way, at least one intermediate node is encountered. It can be referred as medium for

sending packets from source and destination. Previously the routing was done on the basis of the minimum

distance from the sink. Dynamic routing is defined as the routing in which the route is selected on the present

state of information of the network. This change in the route will depend on the information of the state. In this

paper the Virtual Grid-Based Routing Protocol is studied. The VGDRA will basically reduce the route

reconstruction cost. The VGDRA is the protocol designed for the mobile sink wireless sensor network. In this

virtual structure the nodes are deployed in the sensor field and every node will tack the location of mobile sink.

In this sensor field is divided into equal number of cells. Thus a grid structure is formed. The virtual structure

will reduce the energy consumption as the routes are readjustment is done. The nodes will adjust according to

the position of the mobile sink. Thus this routing is efficient as the network life time is also increased.

Fig10. Virtual Grid-Based Dynamic Routing

VIII CONCLUSION AND FUTURE SCOPE

Routing is defined as transfer of information from source to destination. For efficient network the routing

protocol that is used should consume less energy, and less distance. Form the studied done it is concluded that

the Virtual Grid-Based Routing Protocol is better and more efficient than the traditional routing protocol. As the

energy consumption is decreased and also the lifetime of the network is increased. In addition to this the route

reconstruction cost is also minimize. Among which VGDRA is most trending algorithm. From the result

obtained it is concluded that the VGDRA is the best method of route selection.

As the VGDRA is considered to be efficient than the traditional routing algorithm in future the present

technique can be further enhanced. The route selection method can be enhanced.

REFERENCES

[1] Abdul Waheed Khan, “VGDRA: A Virtual Grid-Based Dynamic Routes Adjustment Scheme for Mobile

Sink-Based Wireless Sensor Networks” IEEE SENSORS JOURNAL, VOL. 15, NO. 1, Pp. 526 -534, 2015

[2] Adnan Fida, “Communication- and position-aware reconfigurable route optimization in large-scale mobile

sensor networks” EURASIP Journal on Wireless Communications and Networking, 2014

347 | P a g e

[3] Akash Raghuvanshi , “Analysis of Routing Protocols for Mobile Sink in Wireless Sensor Networks: A

Survey” IJCSMC, Vol. 4, Issue. 5, Pp. 1082 – 1086, 2015

[4] Awadhesh kumar, “A Novel Energy Aware Data Dissemination Routing Protocol for WSN” IJAIEM,

Volume 2, Issue 4, Pp. 457-465, 2013

[5] Ays¸eg ¨ul T ¨uys ¨uz Erman, “A Fault-Tolerant Data Dissemination based on Honeycomb Architecture for

Mobile Multi-Sink Wireless Sensor Networks” IEEE, Pp. 97-102, 2010

[6] Bob Albrightson , “EIGRP a fast routing protocol based on distance vectors” Pp 1-13

[7] Cheng-Fu Chou, “Straight Line Routing for Wireless Sensor Networks” ISCC '05 Proceedings of the 10th

IEEE Symposium on Computers and Communications, Pp. 110-115, 2005

[8] Chinnabbaiah R, “Intrusion Detection in Heterogeneous Wireless Sensor Networks with Liveliness

Proficient Node Localization Algorithm” , International Journal of Advanced Research in Computer and

Communication Engineering Vol. 3, Issue 6, Pp. 6957-6962, 2014

[9] Dinu Gopal, “A Survey on Performance Comparison of Virtual Structure based Data Dissemination

Schemes in WSN” .JNCET, Volume 3, Issue 1, 2015

[10] Ehsan Ahvar , “An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor

Networks” he Scientific World Journal, Article ID 359897, Pp. 9, 2014

[11] Haresh N. Patel, “Extensive Reviews of OSPF and EIGRP Routing Protocols based on Route

Summarization and Route Redistribution” Int. Journal of Engineering Research and Applications, Vol. 4,

Issue 9( Version 4), Pp. 141-144, 2014

[12] Jin Wang, “A Survey about Routing Protocols with Mobile Sink for Wireless Sensor Network “

International Journal of Future Generation Communication and Networking” Vol. 7, No. 5, Pp. 221-22,

2014

[13] Lateef Ahmad Bhat, “Interior Gateway Protocols” International Journal of Electronics & Communication

Technology, IJECT Vol. 4, Issue 3, Pp. 75-78, 2013

[14] Manoj Barnela, “Performance Analysis of OSPF, RIP, IGRP and EIGRP Routing Protocols using OPNET

14.5 Simulator” International Journal of Advanced Research in Computer Science and Software

Engineering, Volume 5, Issue 5, Pp. 1335 -134, 2015

[15] Md Samil Farouqui, “Evolution of the Routing Protocols from RIP to OSPF” , International Journal of

Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 2, Pp. 750-754, 1969-

1998, 2014

[16] Mingming Wu , “The Research of Multi-hop Routing Algorithm in the Field of Distributed Wireless Sensor

Network” IEEE, Pp. 234 – 238, 2011

[17] Mohamed Guerroumi, “Strengths and Weaknesses of Prominent Data Dissemination Techniques in

Wireless Sensor Networks” International Journal of Communication Networks and Information Security

(IJCNIS) Vol. 5, No. 3, Pp. 158 -177, 2013

[18] Neha Grang, “Compare OSPF Routing Protocol with other Interior Gateway Routing Protocols”

International Journal of Engineering, Business and Enterprise Applications (IJEBEA), Pp. 166-170, 2013

348 | P a g e

[19] PROSENJIT BOSE, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks” wireless

communication , Pp. 1-9, 2001

[20] Rajendra V. Boppana , “Analysis of the Dynamic Source Routing Protocol for Ad Hoc Networks”

Workshop on Next Generation Wireless Networks, December, Pp. 1-8, 2005

[21] Ravi Kant Sahu, “Energy-Efficient Grid-Based Data Dissemination in Wireless Sensor Networks”,

Proceedings published in International Journal of Computer Applications, Pp. 23-27, 2012

[22] Sandeep Kumar Yadav, “A Novel Survey on Various Grid Based Data Dissemination” International Journal

of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 7, ,Pp. 153- 158,

2012

[23] Singh, P, “An energy efficient grid based Data Dissemination routing mechanism to mobile sinks in

Wireless Sensor Network” Issues and Challenges in Intelligent Computing Techniques (ICICT), 2014

International Conference on, Pp. 104-109, 2014

[24] Sonal Verma, “Survey on Grid Based Energy Efficient Routing Protocols in Wireless Sensor Networks”

national Journal of Computer Applications, Volume101– No.10, Pp. 1-6, 2014

[25] SoonRye Park, “Energy-Efficient Multi-hop Scheme Based on Routing Algorithm in Wireless Sensor

Networks” Vol 1, Pp. 756 – 762, 2008

[26] Vic Grout , “A New Distributed Link-State Routing Protocol with Enhanced Traffic Load Balancing”

[27] Xiang Gao, “A Multi-Hop Energy Efficient Clustering Algorithm in Routing Protocol for Wireless Sensor

Networks” IEEE, Pp. 1-5, 2009

[28] Xiaocong Jin, “TIGHT: A Geographic Routing Protocol for Cognitive Radio Mobile Ad Hoc Networks”

Wireless Communications, IEEE Transactions ,Volume 13 , Issue 8, Pp. 4670 - 4681, 2014

Zujue Chen, “Multi-tier Grid Routing to Mobile Sink in Large-scale Wireless Sensor Networks”,Journal of

Networks, Vol. 6, No. 5, Pp. 765-773, 2011