MULTI

CONSTRAINT
-QOS ROUTING
IN MANET
RESEARCH PROPOSAL

MANET - INTRODUCTION
Amobile ad hoc network(MANET) is a self-configuring infrastructure

lessnetworkof mobile devices connected bywireless

Each device in a MANET is free to move independently in any direction, and

will therefore change its links to other devices frequently.

Each must forward traffic unrelated to its own use, and therefore be arouter.
The primary challenge in building a MANET is equipping each device to

continuously maintain the information required to properly route traffic.

Such networks may operate by themselves or may be connected to the

largerInternet.

MANETs are a kind ofWireless ad hoc networkthat usually has a routable

networking environment on top of aLink Layerad hoc network

www.therootlearning.com

MANET - TYPES
Vehicular Ad hoc Networks(VANETs) are used for communication among

vehicles and between vehicles and roadside equipment

Internet based mobile ad hoc networks (iMANETs) are ad hoc networks that

link mobile nodes and fixed Internet-gateway nodes.

In such type of networks normal adhoc routing algorithms don't apply directly.

Intelligent vehicular ad hoc networks (InVANETs) are a kind of artificial

intelligence that helps vehicles to behave in intelligent manners during

vehicle-to-vehicle collisions, accidents, drunken driving etc.

www.therootlearning.com

MANET ENERGY
CONSTRAINTS
One of the major drawbacks or limitations of MANET is energy(battery)
Since the devices have limited energy, trade-off between selfishness and

altruism is mandatory

Selfish nodes are those that are not-cooperative in routing packets for

others

Altruistic nodes are those that consider the global benefits for the entire

network and hence continue routing packets not meant for them

Obtaining a trade-off between these two is an important issue

It has to be considered when designing a multi-constrain QoS based routing

protocol

www.therootlearning.com

LITERATURE SURVEY
On the tradeoff between altruism and selfishness in MANET trust

management describes a fuzzy Multi-Path Routing mechanism

incorporating a level of Fuzziness into the system.
Fuzzy Controllers Based Multipath Routing Algorithm in MANET

emphasises the need for fuzziness and multipath routing. It describes the
positives of using a multipath routing technique in a MANET and describes
the Fuzzy mechanism employed in selecting paths.

www.therootlearning.com

LITERATURE SURVEY
Analysis of Reactive Routing Using Fuzzy Inference System uses the

mechanism of Multi criteria Decision Making for the analysis. It considers

the QoS along with shortest path for Routing. Fuzzy inference systems are
used to accept multiple inputs and decide upon it.
Fuzzy-cost based multiconstrained QoS routing with mobility prediction in

MANETs shows that fuzziness could also be employed for mobility

prediction. It also considers the QoS parameters for the decision making
process.
www.therootlearning.com

LITERATURE SURVEY
Simple ant routing algorithm strategies for a (Multipurpose) MANET model

uses the Ant Colony Optimization algorithm for the process of efficient routing.
Multiple constraints must be considered for the process to work efficiently,
further, this method does not consider the selfish/altruistic nature of the nodes.
A Stability Considered density Adaptive routing protocol in MANETs uses an

adaptive routing protocol that assumes the absence of selfish nodes. Security
issues are ignored here. Availability , Trust , Selfishness etc contribute to the
stability of the system, which are not considered here. Fuzzy Multi-Criteria
decision making would be much suitable.
www.therootlearning.com

LITERATURE SURVEY
A link-state QoS routing protocol based on link stability for Mobile Ad hoc

Networks provides a link-state protocol based stability model for MANET.

Multi-criteria not considered here. Considering only the link stability is not
good enough. Complexity of calculating Multipoint routes has to be
considered, through it avoids re-calculation effort.

Swarm mobility and its impact on performance of routing protocols in

MANETs provides a swarm intelligent based routing method. Only proactive

routing protocols are considered. Should also include reactive routing
protocols. Limited QoS parameters are considered for evaluation. Realistic
Applications are not discussed.

www.therootlearning.com

RECENT PUBLICATIONS AND

CONTRIBUTIONS
ROUTING IN MANET BASE PAPERS

PAPER TITLE

AUTHORS

YEAR

On the tradeoff between altruism and

selfishness in MANET trust management

Lin Hee Cho, Ing-Rav

Chen

2013

Fuzzy Controllers Based Multipath Routing

Algorithm in MANET

Shangchao Pi,Baolin
Sun

2011

Analysis of Reactive Routing Using Fuzzy

Inference System.

M.N Doja,Bashir
Alam,Vivek Sharma

2013

FUZZY-COST based multiconstrained QoS

routing with mobility prediction in
MANETs

G.Santhi, Alamelu
Nachiappan

2012

Mohammed
Tarique,Kemal
E.Tepe ,Sasan Adibi,
Shervin Erfani

2009

Survey of multipath routing protocols for

mobile ad hoc networks
www.therootlearning.com

COMMENTS & POSSIBLE

IMPROVEMENTS
Provide fuzzy Multi-Path Routing
Develop Fuzzy control system for fuzzification and
Defuzzification
Selfishness/Altrusim fuzzy decision making considering
many Qos Criteria,not only availability.
Multi-Criteria QOS based fuzzy balance between
selfishness /Altruism
Multipath Routing is preferable.
Use fuzzy decision to select between alternative paths.
Combine with Trust based selfishness/Altruism nodes
Multi criteria Decision Making
Considering Qos along with shortest path for Routing
Fuzzy inference system to accept multiple inputs and
decide upon it.
Fuzziness could also be employed for mobility prediction
Defuzzification should be proper and without loss in order
to obtain precise outputs.
Machine Learning System to study the dynamics of the
Networks and for choosing appropriate protocol.
Fuzzification of the process to make better decisions.
Multiple Constraints must be considered. (Fuzzy could be

Assumes absence of selfish nodes:

Trade off between selfishness and altruistic behavior
must be considered.
A Stability Considered density Adaptive
Security issues are ignored.
Weijie Liu, Wooju Kim
2013
routing protocol in MANETs
Avalilability , Trust , Selfishness etc contribute to the
stability of the system.
Fuzzy Multi-Criteria decision making would be much
suitable.
Multi-criteria not considered
Only the link stability is not good enough.
A link -state QoS routing protocol based
Ali Moussaoui, Fouzi
Complexity of calculating Multipoint routes has to be
on link stability for Mobile Ad hoc
Semchedine , Abdallah
2013
considered, through it avoids re-calculation effort.
Networks
Boukerram
Fuzzy inference with threshold can provide a better
option
Mobility of a set of nodes reduces overhead.
Swarm mobility and its impact on
Jun Li,Yifeng Zhou, Louise
Only proactive routing protocols are considered.
performance of routing protocols in
Lamont ,F Richard Yu,
2011 Should also include reactive routing protocols.
MANETs
Camille -Alain Rabbath
Other Qos parameters must be considered
Realistic Applications are not discussed.
Multi- Objective , Multi Crieria Qos Routing in MANET
Fully Polynomial time approximation scheme.
Uses multiple constraints to determine the resultant
path for transmission
Routing With multiple quality of services
Jun Huang , Xiaohong
2012
Auxillary graph construction
constraints : An approximation perspective
Huang, Yan Ma
Time and space complexity reduction using nonlinear definition of path constraints.
Progressive refinement of results.
Encounter based metric (Path Encounter Rate)
Enviromental Changes are reflected
Generic algorithm that can be applied to all routing
Tran The Son, Hoa Le Minh,
A novel encounter -based metric for
protocols.
Graham Sexton, Nauman
2013
mobile ad-hoc networks routing
Stores the average encounters per time, which
Aslam
replaces the mobility factor(MF)
www.therootlearning.com
Packet forwarding avoids high mobility regions.
Control packet count reduction

10

Bee life- based multi Constraints

multicast routing optimization for
vehicular ad hoc network

Energy-aware multicast routing in

manet based on particle swarm
optimization

A light-Weight trust based QoS routing

algorithm for ad hoc networks

Trust predicition and trust-based source

routing in mobile ad hoc networks.

A dynamic programing solution for QoS

www.therootlearning.com
routing
in wireless ad hoc network with
energy constraints

Swarm Optimization and Genetic Algorithm

A modified Bee colony Optimization algorithm
called Bees Life Algorithm(BLA) is used
Salim Bitam, Abdelhamid
BLA is used to solve QoS multicast routing
2012
Mellouk
problem.
Follows the reprodction and food foraging
behavior of the bees.
PSO based multicast routing
Alireza Sajedi Nasab, Vali
Routing focus on delay and batttery
Derhami, Leyli
Grpah based routing strategy
2012
Mohammad Khanli, Ali
Multicast tree that satisfies the QoS constraint is
Mohammad
determined.
Minimum QoS constraint are considered
Trust Based Routing
Trust based method
Direct and indirect trust computation.
Nodes have trust degrees for each of its
Bo Wang ,Xunxun
2013
neighbors.
Chen,Weiling Chang
Topology info is used to calculate trust.
QoS constraint: Link delay
Not very reliable in terms of Qos
Trust calculation from historical behaviors.
Fuzzy rules are employed.
Hui Xia,Zhiping Jia, Xin
2012
Node's historical trust,current trust and route
Li,Lei Ju,Edwin H., M.sha
trust are considered before transmission.
Unicast routing.
Energy Efficient QoS Routing
Solves battery limitation and bandwidth
constraints.
Dynamic programming based QoS routing
model.
XING Yi-hai,TENG Ying-lei
An intermediate node set D is determined.
,DONG Mu-Xin , ZHANG
2012
D connects source and destination nodes.
Yong,SONG Mei
Minimum distance is considered as the constaint

11

Energy supported AODV (EN-AODV) for QoS

routing in MANET

S.Sridhar,R.Baskaran,P.Chandr
asekar

2013

Energy value of a node is taken as the base for routing.

Checks for the energy level of a node 1
If it goes below threshold ,an alternate path is selected.
Traffic bursts can be observed.
Low energy nodes cannot complete the routing process.
Nodes might become unusable if they have less energy

Multicast Routing QoS

On-demand multicast routing protocol with
efficient route discovery

MOEAQ: A Qos Aware Multicast Routing

Algorithm for MANET

Consensus based decision support for

multicriteria group decision making

Inteeactive Multiple Criteria Decision Making

based on preference driven Evolutionary
MultiObjective Optimization with controllable
accuracy

On demand multicast routing

Manages the flooding machanism
2011
Nodes that satisfy the delay
Requirement are allowed to flood join query messages.
Uses a combination of 'greedy' and family competetion
approach
Genetic algorithm is used to maintain fitness and provide
Jun Huang ,Yanbing Liu
2009
diversity.
Parallel based search.
Fitness value determines the QoS.
Multi Criteria Decision Making Process
Several decision makes.
Multiple criteria.
Subjective and imprecise decision making process.
Santoso Wibowo ,Hepu Deng
2013
Interest of all decision makes must be considered for
making an effective decision
Fuzzy numbers are used to handle uncertainity
Mohammad-Amin Kharraz
,Hamid Sarbazi-Azad, Albert
Y.Zomaya

Ignacy Kaliszewski,Janusz
Miroforids,Dmitry Podkopaev

2011

Multiple criteria decision making

Evolutionary method with controllable accuracy
Calculation of upper and lower bounds is possible

Analytic Hierarchical processing

Research and Development Evaluation at an
Early Stage Using the Analytic Hierarchy
www.therootlearning.com
Process(AHP)

Hiroki KAMODA and

Shigetoshi SUGAWA

2008

R and D theme Evalustion at an early stage was

performed by AHP Decision making tool.
AHP evaluation process.
Problem definition in hierarchy
Importance of evalution criteria
Result evaluation and analysis

12

Parallelization GPUs

A parallel ant colony algorithm on

massively parallel processors and its
convergence analysis for the travelling
salesman problem

A Survey on parallel ant colony

optimization

An effective Parallel Multicast Tabu

Search for Quadratic Assignment Problm
on CUDA platform

Parallel processing oflarge graphs.

www.therootlearning.com

Chen Ling,Sun Hai Ying

,Wang Shu

2012

Martin Pedemonte,Sergio
Nesmachnow ,Hector
Cancela

2011

Michal Czapinski

2012

Tomasz
kajdanowicz,Przemyslaw
Kazienko,Wojciech Indyk

2013

Parallelized ACO
Every group is assigned a parallel processor
Local best is communicated periodically to partner.
Partner determination is dynamic
Inefficient time interwals lead to unnecessary data
transfer
Partner determination leads to loss of data from
other nodes.
Choosing same partner everytime leads to
bottleneck
Classifier parallel ACO algos:
Master -slave model
Course grain master slave model
Medium grain M-S model
Fine Grain model
Cellular model
Parallel indepentent runs model
Multicolony Model
Hybrid Models
NP hard guadratic problem is considered
Tabu Search parallelization
Tabu list length and initial solution has the
maximum impact on results.
Parallelization model uses different initial solution
and list lengths
Solution are obtained from various angles
GPU Implementation of the problem could be faster
assuming enough GPGPU's with a capacity to hold
the graphs in memory
bsp--> Better than Map-Reduce for systems that
fits into local memory
Map-->Reduce is still utilized for enormous
systems with very large data structure
requirements.

13

ACO and Parallel ACO

Jose M.Ceilia ,Jose
M.Garcia,Andy
Nisbet,Martyn
Amos,Manuel Ujaldon

2012

Alberto Cano,Juan
Luis Olmo,Sebastian
Ventura

2013

Multi agent approach to

distributed ant colony optimization

Sorin llie,Costin
Badica

2011

Ant colony algorithms in MANETs :

A review

Gurpreet Singh,Neeaj
Kumar,Anil Kumar
Verma

2012

A tree-growth based ant colony

algorithm
for QoS multicast
www.therootlearning.com
routing problem

Hunt Wang,Hong
Xu,Shanwen Yi,Zhao
Shi

2011

Enhancing data parallelism for Ant

Colony Optimization on GPUs

Parallel multi-objective Ant

Programming for Classification
using GPUs

Challenges in ACO:
Irregular memory access pattern
Data parallelism for tour Construction
GPU programming strategy for pheromone
update
I-Roulette to improve parallelism
Uses CUDA to define a parallel
programming model for ACO.
CPU parallel and GPU various .
Grammer based Ant programming
Every ant is designated its own processor
Agents find shortest paths for resource
discovery(low cost)
Tour cost sharing will result in optimal
solutions
Sequential model,hence time consumption
is considerably high.
Uses ACO to find the network route.
Provides analysis and comparison of
various Ant based algorithms.
The Process of the Ant based algorithm are
discussed along with there are no of usage
.
ACO based routing is used.
Multicast tree optimization is performed.
ACO is used to control the tree growth .
Faster than conventional ACO.
Scalable

14

RESEARCH PROBLEMS
Following are the research problems or issues that we are going to address

in our Multi-Constraint QoS Routing in MANET

www.therootlearning.com

15

SELFISH VS. ALTRUISTIC

NATURE
Selfishness / altruistic nature here is not just about availability, because it

will affect almost all other QoS constraints

A multi-criteria QoS based equilibrium must be achieved

Being selfish could compromise the overall network QoS and on the other

hand being altruistic could drain that particular nodes energy and could
render it useless in future

A routing algorithm must consider the pros and cons and must try to

achieve an equilibrium based on requirements

Altruistic nodes consider social welfare to be important and hence the view

is total

www.therootlearning.com

16

GAME THEORY APPROACH

What if all the nodes are being altruistic?
What if all the nodes are being selfish?
Obtaining a NASH equilibrium in this scenario will help us bring in stability and

hence a proper routing process could be devised

Obtaining NASH Equilibrium based on Multiple QoS criteria is by itself difficult,

as most of the properties are dependent on one another

Mostly in game theory the number of participants is predefined and hence a

equilibrium could be easily defined but in this case the nodes could
dynamically change their nature based on the prevailing network conditions

We can consider the average energy rate of the devices and those that are

above or near that average could be used for altruistic routing and those far
below it could be made selfish

www.therootlearning.com

17

APPLICATION SENSITIVITY
AND SELFISHNESS
Applications could be throughput sensitive or delay sensitive
Throughput sensitive applications: Overall outcome expected is to

complete the job - browser, download manager

Delay sensitive application: overall output expected is to complete the job

within that time in sequence live video/audio streaming, online games

etc.

Application sensitivity will be considered on a fuzzy basis and a particular

application could be to delay sensitive to a certain extent and at the same

time it could be throughput sensitive as well.

www.therootlearning.com

18

FUZZY FOR
SELFISH/ALTRUISTIC
NATURE

Instead of considering a node to be either selfish or altruistic it could be modelled

in an fuzzy manner where the degree of belonging could be defined based on

Fuzzy membership functions.

A fuzzy nature provides extraordinary clarity and ability to represent the real

scenarios effectively

So a node could be selfish to certain extent and at the same time be altruistic also
Based on that degree, whether to use that particular node for routing a particular

type of applications packet could be decided

If the application is delay sensitive then packets must be delivered in sequence

and on time otherwise there is no use delivering it, so even nodes that are selfish
to a certain extent could be used for routing such packets, whereas in the case of
throughput sensitive applications packets could be delivered only through
altruistic nodes

www.therootlearning.com

19

HYBRID DYNAMIC ANT

COLONY OPTIMIZATION
Optimization problems/issues in Multi-QoS MANET Routing
Optimized route discovery
Route discovery based on multiple constraints that has dependencies
Considering selfish/altruistic node could affect the overall QoS to a greater extent
Due to this re-routing overhead will be too high and we will have to overcome it

effectively
Optimal placement of selfish and altruistic nodes in a static environment itself is
a NP hard problem and in the case of a dynamic mobile ad hoc network it will be
much more difficult
Threshold based switch over from selfish to altruistic and vice versa
Determining the optimal threshold value for switch over based on application
sensitivity and overall network requirements
www.therootlearning.com

20

FUZZY MULTI-QOS
OPTIMIZATION
Nature of Multi-QoS optimization is that it could effectively be fuzzified
Every parameter could be considered as fuzzy and various appropriate

fuzzy membership functions could be defined for each one of them

Overall threshold value could be considered on a fuzzy scale and then

defuzzified for final decision making

www.therootlearning.com

21

FUZZY ANT COLONY

OPTIMIZATION
Fuzziness in the pheromone evaporation rate
Fuzziness in the ants visibility of pheromone concentration in the

vicinity(pheromone sensing abilities)

Optimal value for vicinity/ visibility of the ants

Too high and there will be distraction and too much of computational complexity

to evaluate the fitness function for all possible outcomes

Too low and it could get struck in a local minima or a plateau

www.therootlearning.com

22

FUZZY ANT COLONY

OPTIMIZATION
Optimal value for evaporation rate
Too high, there will be distraction and we will lose the optimal path very often
Too low, problem in getting struck with local optima

Ant Population size estimation

Too low and inefficient exploration of search space
Too high and it will result in more proximate overlap of pheromone trails and will

become chaotic, hence convergence will be a problem

Evaluation Metrics for estimating the performance of various optimization

algorithms for Multi-QoS routing in MANET

Proposing a benchmark for comparing optimization algorithms for Multi-

QoS routing in MANET

www.therootlearning.com

23

PAPER COMMUNICATED
The paper titled Multi-QoS Routing in
MANET : A Survey has been communicated
for the August 2014 issue of the International
Journal of Computer Applications (IJCA)

www.therootlearning.com

24

MULTI-QOS ROUTING IN
MANET : A SURVEY
It discusses the working of MANETs, the node

categories and provides a survey on the available

routing strategies in MANET.

It also discusses their pros and cons and identifies the

necessary components for a MANET routing

algorithm.

The necessity of a Multi-QoS and multipath routing in

MANET is discussed and challenges involved in such a

scenario are conversed.

www.therootlearning.com

25

MULTI-QOS ROUTING IN
MANET : A SURVEY
The concept of evolutionary algorithms and their role

in MANET routing is analyzed in detail.

It also discusses the advantages they have over

conventional methods.

Usage of evolutionary algorithms in a MANET scenario

and areas of improvement are instigated.

www.therootlearning.com

26

MANET NODE CATEGORIES

AND THEIR WORKING
This section discusses the two basic nature of the

nodes; selfishness and altruism.

The behaviour of selfish nodes and the altruistic

nodes is discussed in detail.

The positives and negatives of being a selfish or

altruistic node is discussed in detail.

The need for both selfish and altruistic nodes is

presented.

www.therootlearning.com

27

MANET ROUTING: A
STUDY
This section discusses the presently available

algorithms for MANET Routing, their pros and cons

and areas where they can be improvised.

www.therootlearning.com

28

MULTI-QOS AND MULTIPATH ROUTING

IN MANET: PROS, CONS AND
CHALLENGES
This section discusses the problems in the

existing (shortest path) routing techniques and

the need for Multi-QoS and multipath routing
strategies.
It also discusses various design challenges
existing in MANET and the drawbacks of using
a multipath routing strategy.
www.therootlearning.com

29

MULTI-QOS AND MULTIPATH ROUTING

IN MANET: PROS, CONS AND
CHALLENGES
The four basic design challenges existing in designing

a multi-path routing protocol are

How to discover multiple paths in a network

How to choose the required number of paths from the

available path set

How to select the appropriate constraint or constraints
for the process of path selection
How to distribute load in the selected paths
www.therootlearning.com

30

EVOLUTIONARY ALGORITHMS AND

THEIR ROLE IN MANET ROUTING
This section describes the importance of evolutionary algorithms, and how

they can be efficiently used in a MANET scenario.

Various properties of the Evolutionary algorithms are discussed in detail

and it has been perceived that swarm intelligence based algorithms would
work best in a MANET environment.

The three most suitable swarm intelligence based techniques Ant Colony

Optimization, Artificial Bee Colony Algorithm and Particle Swarm

Optimization were discussed.

www.therootlearning.com

31

EVOLUTIONARY
ALGORITHMS AND THEIR
ROLE IN MANET ROUTING
The basic constraints that are to be considered for the performance
analysis are discussed below:
Complexity of the fitness function
Scalability with respect to complexity
Ability to define the stop criterion/ completeness
Getting struck in local optima
Handling dynamic datasets
Parallelization capacity
Stochastic nature
Hybridization
www.therootlearning.com

32

SURVEY OF EVOLUTIONARY
ALGORITHMS AND FUTURE DIRECTIONS
A survey on the usage of Evolutionary algorithms on

MANET routing is performed and the efficiency of the

proposed algorithms have been discussed.
Future research directions were provided after

analysis of the problems and the shortcomings of the

available methodologies.
www.therootlearning.com

33

CONCLUSION

The following future research directions were proposed from the

study
Obtaining a tradeoff between selfishness and altruistic nodes
Attaining an equilibrium based on the game theoretic

principles as provided by Nash

A fuzzy decision making approach for determining and relaxing

the selfishness/altruistic constraints

Validation on the basis of CAP theorem and also the

dependencies among the various other QoS parameters and

their tradeoffs

Utilizing Pareto Sets where a set of solutions rather than a

single solution is found and utilized.

www.therootlearning.com

34

THANK YOU