7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 1/12

State University of Novi Pazar,

Department of Technical Sciences

A Routing Algorithm for Mobile Ad Hoc Networks 

Ivan Djokic, Aldina Avdic, Aleksandra Pavlovic

5th International Conference on Information Society and Technology (ICIST 2015)Ko aonik 8-11. March 2015

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 2/12

 

Introduction

Background

The Proposed New Routing Protocol

Protocol Simulation

Conclusions and Future Researches

Contents

2

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 3/12

 

 A mobile ad hoc network - a set of mobile nodes that are dynamicallylocated and connected by wireless links.

 A routing protocol - discovers routes between source and destination, inorder to facilitate communication within the network

Routing in the mobile ad hoc networks is a challenging task, and this hasled to development of many different routing protocols.

It is difficult to determine which protocols is best under a number of different

network scenarios, such as increasing node density and traffic.

Proposed Solution - a simple routing protocol, based on packet delivery rateand distance from the destination node.

Introduction

3

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 4/12

  Background and Motivation

4

• Different kind of ad hoc routing protocols are suitable for different kind of network structures and

node behaviors.

• Protocol taxonomy aim is to divide protocols according to following criteria, reflecting

fundamental design and implementation choices:

Communication model. What is the wireless communication model? Multi or

single channel?Structure. Are all nodes treated uniformly? How are distinguished nodes selected? Is the

addressing hierarchical or flat?

State Information. Is network-scale topology information obtained at each node?

Scheduling. Is route information continually maintained for each destination?

• According to RFC 2501 quantitative metrics for network routing protocol performance are:

- End-to-end data throughput and delay.- Route acquisition time , which is a particular concern for on-demand protocols

- Percentage out-of-order delivery, which can affect how efficiently transport layer protocols

can perform it’s own task 

- Efficiency, which is an internal measure of protocols effectiveness.

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 5/12

  Background and Motivation

5

• The proposed new routing protocol is based on:- the packet delivery rate between source and neighboring nodes,

- the distance between source neighboring nodes and the destination node.

• The protocol is simulated and tested through different network scenarios,

with nomadic and low mobility nodes.

• Complete performance testing is in progress, according to RFC 2501

quantitative metrics 

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 6/12

 

The algorithm is running on the S node, when it has adata packet for delivering to D node, where S and D arenodes of an ad hoc network;

The algorithm input data are address and location of Dnode, and the minimum packet delivery rate betweennodes on the route from S to D (PDRmin);

The S node determines the neighboring nodes (nodeswithin the range);

The Proposed New Routing Protocol

6

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 7/12

 

The S node determines or measures packetdelivery rate to the neighboring nodes (with 10 shortping messages, for example);

The S node selects the neighboring nodes withPDR≥PDRmin;

The S node obtains locations of neighboring nodeswith PDR≥PDRmin;

The Proposed New Routing Protocol

7

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 8/12

 

The S node calculates distance from nodes with

PDR≥PDRmin to the D node; 

The S node selects the node with the shortest

distance to the D node (next hop node);

The S node starts the data transmission to the next

hop node.

The Proposed New Routing Protocol

8

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 9/12

  The Examples

9

PDRmin=90% PDRmin≥0.9 and PDRmin≥0.75 

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 10/12

  Protocol Simulation

10

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 11/12

 

 A new routing protocol based on:

the packet delivery rate between source and neighboring nodes,

the distance between source neighboring nodes and the destination node.

Quickly finding a source destination route for different networktopologies and different required packet delivery rates between nodes

The ability to deliver a message when the communication model

deviates from the unit graph due to obstacles or noise

Influence of node mobility has to be evaluated through different

scenarios

11

Conclusions and Future Work

7/23/2019 Icist2015 Prez

http://slidepdf.com/reader/full/icist2015-prez 12/12

Contact

State University of Novi Pazarwww.np.ac.rs

Vuka Karadžića bb, 36300 Novi Pazar, Serbia | Tel.: 00381.20.317754

Ivan Djokic, idjokic@np.ac.rsAldina Avdic, apljaskovic@np.ac.rs 

Aleksandra Pavlovic, apavlovic@np.ac.rs