ENHANCEMENT OF ROUTING SELECTION SCHEME IN MOBILE AD-HOC
NETWORK (MANET)
AIN IYLIA BINTI IZANI
BACHELOR OF COMPUTER SCIENCE
(COMPUTER NETWORK SECURITY) WITH HONOURS
UNIVERSITI SULTAN ZAINAL ABIDIN
2018
ENHANCEMENT OF ROUTING SELECTION SCHEME IN MOBILE AD-
HOC NETWORK (MANET)
AIN IYLIA BINTI IZANI
BACHELOR OF COMPUTER SCIENCE
(COMPUTER NETWORK SECURITY) WITH HONOURS
FACULTY OF INFORMATICS AND COMPUTING
UNIVERSITY SULTAN ZAINAL ABIDIN
2018
i
DECLARATION
This dissertation is submitted as a partial fulfillment for the award of a Bachelor
of Computer Science (Computer Network Security) with Honours at University of
Sultan Zainal Abidin (UniSZA). The results of this work are on my own investigations.
All sections of text and results which have been obtained from other sources are full
referenced. I understand that cheating and plagiarism constitute a breach of university
regulations and will be dealt with accordingly.
Signature: ………………………………………….
Name: AIN IYLIA BINTI IZANI
Date:……………………………………………….
ii
CONFIRMATION
I certify that the project and the writing of this report were conducted by the student
under my supervision.
Signature: ……………………………………….
Name: NOR AIDA BINTI MAHIDDIN
Date: ……………………………………………
iii
DEDICATION
First of all, praise to Allah, the Most Gracious and the Most Merciful for
blessing and giving me the opportunity to undergo and complete my proposal for final
year project, An Enhancement of Gateway Selection Scheme for Mobile Ad-hoc
Network (MANET).
I would like to take this opportunity to express my heartiest gratitude to my
supportive supervisor, Puan Nor Aida Binti Mahiddin for her motivation, guidance and
help throughout my project. Without her time, her support and guidance, it is impossible
for me to finish my project successfully. Thank you for the kindness. May Allah bless
her.
Besides, I would like to extend my appreciation to my parent (Izani bin Mat
Hassan and Zuria Kanchana Binti Draman), my family members and that always been
there in my hard and easy times. May Allah protects and bless all of them.
Lastly, thank you to all my lectures who taught me throughout my education
from Semester 1 until Semester 6 at University of Sultan Zainal Abidin (UniSZA). May
Allah bless all of them.
iv
ABSTRACT
Mobile Ad-Hoc Network (MANET) is a self-organizing and self-configuring
network without the need of any centralized administrator. It is a collection of two or
more mobile devices that can communicate among each other without any fixed
infrastructure because of the node can leave or join the network when they want to do
so. There are various of routing protocols in MANET but there is a problem that occurs
in routing protocol itself due to dynamic network topology. Besides, it also a challenge
on how the routing protocol providing consistent quality of service in wireless node.
Therefore, providing the consistent quality of service in network routing protocol is one
of the crucial problem due to dynamic network topology because of the nodes in the
network are non-static and move randomly. Therefore, an enhancement of routing
selection scheme is proposed in order to overcome the routing protocol issues in
MANET. The simulation shows that the proposed technique has minimum packet loss
and highest throughput in the network. In this thesis, the simulation is simulated in
OMNET++ 4.6.
v
ABSTRAK
Rangkaian Ad-Hoc Mudah Alih (MANET) adalah rangkaian penganjur diri dan
kendiri tanpa memerlukan mana-mana pentadbir berpusat. Ini adalah koleksi dua atau
lebih peranti mudah alih yang boleh berkomunikasi antara satu sama lain tanpa sebarang
infrastruktur tetap kerana nod boleh meninggalkan atau menyertai rangkaian apabila
mereka mahu melakukannya. Terdapat pelbagai protokol routing di MANET tetapi ada
masalah yang berlaku dalam protokol routing itu sendiri kerana topologi rangkaian
dinamik. Selain itu, ia juga merupakan satu cabaran bagaimana protokol routing
menyediakan kualiti perkhidmatan yang konsisten dalam nod tanpa wayar. Oleh itu,
menyediakan kualiti perkhidmatan yang konsisten dalam protokol penghalaan
rangkaian adalah salah satu masalah penting kerana topologi rangkaian dinamik kerana
nod dalam rangkaian tidak statik dan bergerak secara rawak. Oleh itu, peningkatan skim
pemilihan routing dicadangkan untuk mengatasi masalah protokol routing di MANET.
Simulasi menunjukkan bahawa teknik yang dicadangkan mempunyai kehilangan paket
minimum dan pencapaian tertinggi dalam rangkaian. Dalam tesis ini, simulasi
disimulasikan dalam OMNET ++ 4.6.
vi
LIST OF CONTENTS
DECLARATION I
CONFIRMATION II
DEDICATION III
ABSTRACT IV
ABSTRAK V
LIST OF CONTENTS VI-VIII
LIST OF FIGURES IX-X
LIST OF TABLES XI
LIST OF ABBREVIATIONS XII
CHAPTER 1 INTRODUCTION
1.1 Background 1
1.1.1 Mobile Ad-hoc Network (MANET) 1-3
1.1.2 Characteristic of MANET 3-4
1.1.3 Description of Routing Protocol in 4
MANET
1.1.3.1 Reactive Roiting Protocol 5
1.1.3.2 Proactive Routing protocol 5-6
1.1.3.4 Hybrid Routing Protocol 6
1.1.4 Ad-hoc On-demand Distance Vector 7-8
(AODV) Routing Protocol
1.1.5 Destination Sequence Distance Vector 8-9
(DSDV) Routing Protocol
vii
1.2 Routing Selection Scheme in MANET 9
1.3 Problem Statement 10
1.4 Objectives 10-11
1.5 Scopes 11
1.6 Limitation of Works 11
1.7 Summary 11
CHAPTER 2 LITERATURE REVIEW
2.1 Introduction 12
2.2 Related Works 13-18
2.3 Summary 18
CHAPTER 3 METHODOLOGY
3.1 Introduction 19
3.2 Simulation 19-20
3.3 Project Framework 21
3.4 Project Flowchart 21-22
3.5 Summary 22
CHAPTER 4 IMPLEMENTATION AND RESULTS
4.1 Introduction 23
4.2 OMNET++ in Windows Environment 23
4.2.1 Installation of OMNET++ version 4.6 23-27
4.3 Configuration of MANET Environment 28-29
viii
4.4 Configuration of Routing Selection Scheme 29
Technique
4.4.1 omnetpp.ini File 30
4.4.2 GWLBRouting.c File 30-31
4.4.3 Routing Table 31-32
4.5 Simulation of Routing Selection Scheme 33-34
Technique
4.6 Results 34
4.5.1 Packet Throughput 34-35
4.5.2 Packet Delay 35-36
CHAPTER 5 CONCLUSION
5.1 Introduction 37
5.2 Finalization of Project 37
5.3 Constrains and Challenges 38
5.4 Future Works 38
5.5 Summary 39
REFERENCES 40-42
ix
LIST OF FIGURES
FIGURE TITLE PAGE
1.1 Example of MANET 3
1.2 Classification of MANET Routing Protocol 4
3.1 OMNET++ 4.6Simulation Icon 20
3.2 Inetmanet Framework Icon 21
3.3 Framework of Routing Selection Scheme 21
3.4 Flowchart of Routing Selection Scheme 22
4.1 omnetpp-4.6 24
4.2 mingwenv File 24
4.3 setenv Command 25
4.4 configure Command 25
4.5 configure Command 26
4.6 make Command 26
4.7 omnetpp command 27
4.8 Omnet++ Simulator 27
4.9 Inetmanet Framework 28
4.10 Routing Table 32
4.11 Simulation of MANET Environment 33
4.12 Simulation run with 50 Number of Nodes 34
4.13 Packet Throughput Result (Mbps) 35
4.14 Packet Delay 36
x
LIST OF TABLES
TABLE TITLE PAGE
4.1 Selected Simulator Parameters in 29
Simulation
xi
LIST OF ABBREVIATIONS
MANET Mobile Ad-hoc Network
OMNet++ Objective Modular Testbed in C++
1
CHAPTER 1
INTRODUCTION
1.1 Project Background
1.1.1 Mobile Ad-Hoc Network (MANET)
In this recent year, the growing development of mobile devices has made
a revolution in this era of communication of wireless network. The mobile
devices including laptops, smart phones and handheld digital devices. This trend
of wireless networks is towards pervasive and ubiquitous computing which the
user can use this mobile device anytime at anywhere. Thus, in present of this
wireless network technology, the research in Mobile Ad-hoc Network
(MANET) has been progressing at great speed and getting to become more
popular. This is due to most of the multimedia applications run in an
infrastructure less and because of the nodes which is refer to mobile nodes in
this experiment are not fixed, it becomes very difficult to provides the consistent
quality of service of wireless node in MANET environment. Thus the nodes in
MANET are prone to frequent link failure due to high mobility.
On the other hand, MANET is a system of wireless mobile nodes that
dynamically self- organize in arbitrary and transitory network topologies.
MANET environment allows the nodes to directly communicate with each other
nodes within their range such as radio range, while the nodes that not in direct
2
communication range will make a route to intermediate nodes to communicate
with the others until it reaches the destination. Based on the two situations stated,
it is clear that all the nodes have been associated with the communication
spontaneously from a wireless network. As the conclusion, this kind of wireless
network can be claimed as MANET.
Besides. MANET is a dynamic network topology which means the
topology will change rapidly and uncertainly. This kind of networks may be
function and connected in larger network and because of the minimal
configuration and a rapid implementation make of an ad-hoc network, therefore
this network is applicable to be used in crisis situations such as natural or
disaster area, in military clash, emergency situation and others situation that
needs for employment of ad-hoc networks.
Figure 2. are describes about a basic example of MANET environment
with three nodes which are node A, node B and node C and each node will act
as router to forward the data packet. Assuming that, node A want to forward
data packet to node C but node A and node C are not within their transmission
range of each other. So, node A cannot directly pass the packet to node C. Node
A must find the intermediate node to forward the data packet n order to reach
the destination, as node B is in the coverage range of node A and node C.
Therefore, node A can forward the data packet to node B and after that node B
will forward the packet to node C. in conclusion this three nodes together create
a MANET by having the path called as A-B-C.
3
Figure 1.1 Example of MANET [4]
1.1.2 Characteristic of MANET
i. Distributed Operation
The control of the network is distributed among the nodes as there is no
background network for the central control unit of the operation. Therefore,
the node that get involved in MANET should associate with each other and
communicate among themselves. Besides, when there is a need to
implement specific function such as routing and security, the node in the
network must acts as relay to each other.
ii. Multi-hop Routing
When a node had a request to send information to other nodes in which is
out of its communication range, the packet need to be forwarded via one or
more intermediate nodes.
B C
A
A
4
iii. Dynamic Topology
The node in MANET are free to move arbitrarily with different speed.
Therefore the network topology in MANET may change randomly at
unpredictable time. When there is a request to forward the message to the
destination, the nodes in MANET will dynamically establish routing among
themselves.
1.1.3 Description of Routing Protocol in MANET
In general, an ad-hoc routing protocol is a custom or standard that literaly
control on how the mobile nodes decide which path should it route the data
packet among themeselve in MANET environment. Basically, ad-hoc network
routing protocols are commonly devided into three main cleasses which are
reactive, proactive and hybrid protocols as shown in Figure 1.2
Figure 1.2 Classification of MANET Routing Protocol
MANET Routing Protocols
Reactive
DSDV, etc
Proactive
AODV, DSr, etc
Hybrid
ZRP, etc
5
1.1.3.1 Reactive Routing Protocol
Reactive routing protocol is commonly known as on demand
routing protocol as the route is discovered only when it is needed thus
this protocol examine for the route in on-demand action and create a
route in order to forward and acquire the packet from the source to the
destination, if the route is not available, the node will initiates route
discovery process. There is two major component in this routing
protocol. Firstly is “Route Discovery” which is in this phase source
node initiates route discovery on demand basis in a simple words source
nodes will consults its route cache for available route from siurce to
destinationotherwise if the route is not present, it initiates node
discovery and for the second one is “Route Maintenance” which is
when the node is having a route failure due to link breakage, so route
maintenance is done. As there are based on route discovery on demand
bases so there will be less overhead of control message hence it can
saving the bandwidth but it also increased the network latency due to
route discovery process. The axample of reactive routing protocol is
Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source
Routing (DSR).
1.1.3.2 Proactive Routing Protocol
Proactive protocol basically known as table driven routing
protocol. In proactive routing protocol, each node has to conserve one
or more table to store routing information about the network topology
6
withaout requiring it. The routing tables are updated periodically
whwnwver the network topology changes. In the other hand, this
protocol are not suitable for larger network as they need to maintain
node entries for each and every node in the routing table and because
of these protocol being a table driven protocols, there will increase the
control message in the network due to increaing in message overhead
in the network but at he same time due to routing information already
present, therefore the latency will be reduced in the network. The
example of proactive protocol are Dynamic Sequence Distance Vector
(DSDV) and Optimize Sequence Latency Routing (OLSR).
1.1.3.3 Hybrid Routing Protocol
In general, hybrid protocol is the combination of reactive routing
protocol and proactive routing protocol. The hybrid protocol is
designed to overcome the weakness of both reactive and proactive
routing protocol. It uses the route discovery mechanism of reactive
routing protocol and the table driven mechanism in proactive routing
protocol. Those mechanism is use to avoid latency and overhead
problems in the network. This protocol is suitable for large network
when there is a large number of nodes are present. In the large network,
it is divided into set of zones where routing inside the zones is
performed by using reactive approach and outside the zones the routing
is done by using reactive approach. The example of hybrid protocol is
Zone Routing Protocol (ZRP).
7
1.1.4 Ad-hoc On-demand Distance Vector (AODV) Routing Protocol
Ad-hoc On-demands Distance Vector (AODV) is on of the reactive
routing technique that are applicable for ad-hoc wireless network topology. In
this routing technique, routes are only discovered when it is needed. It does not
continually maintain a route between all pairs of the network nodes. AODV
maintains a routing table with the next hop to reach the destination. Routes time
out after a while if it not being used such as the number of packets is sent
between the nodes. There are three features of routing message types in AODV
routing protocol:
i. RREQ: Route request
ii. RREP: Route reply
iii. RERR: Route error
When a node wants to send a packet, and it does not know the route to the
destination, it initiates route discovery by sending the message broadcastly
which is an RREQ multicast message. The neighboring nodes record where the
message came from and forward it to their neighbors until the message reach to
the destination node. After the node found the route to the destination, the
destination node replies with an RREP, which gets back to the source on the
reverse path along which the RREQ came. Forward routes are set up in the
intermediate nodes as the RREP travels back to the source. An intermediate node
can also send an RREP in reply to a received RREQ, if it knows the route to the
destination, thus nodes can join an existing route. When the RREP arrives at the
source and the route is created, communication can begin between the source
and the destination which the source node will send the message through the
8
forward path. If a route no longer works due to link break, such as the messages
cannot be forwarded on it, a RERR message is broadcast by the node which
detects the link break. The other nodes will re-broadcast the message. The
RERR message indicates the destination which is unreachable. Nodes receiving
the message make the route inactive (and eventually the route is deleted). The
next packet to be sent triggers route discovery. As a reactive protocol, generally
AODV has less overhead (less route maintenance messages) than proactive
ones, but setting up new routes takes time while packets are waiting to be
delivered. The routing protocol overhead is depends on the mobility level in the
network.
In the other hand, even though AODV is a reactive protocol, nodes can
send periodic “HELLO" messages to discover links to neighbors and update the
status of these links. “HELLO” messages are only sent to neighbors, and not
forwarded. This mechanism is local and it can make the network more
responsive to local topology changes.
1.1.5 Destination Sequence Distance Vector (DSDV) Routing Protocol
DSDV is a proactive or also known as table driven in MANET routing
protocol, so it makes sure routing information in the network is always up-to-
date. Each node maintains a routing table with the best route to each destination.
The routing table contains routing entries to all possible destinations known
either directly or indirectly through neighbors. A routing entry contains the
destination’s IP address, last known sequence number, hop count required to
reach the destination, and the next hop. Routing information is frequently
9
updated, so all nodes have the best routes in the network. Routing information
is updated in two ways:
i. Nodes broadcast their entire routing tables periodically
(infrequently)
ii. Nodes will broadcast small updates when there is a change in their
routing table
A node updates a routing table entry if it receives a better route. A better route
is the one that has a higher sequence number, or a lower hop count if the
sequence number is the same.
In general, DSDV has more overhead than reactive routing protocols, because
route maintenance messages are sent all the time. Since the routes are always up
to date, DSDV has less delay in sending data.
1.2 Routing Selection Scheme in MANET
Routing is one of the most crucial issues in MANET. In order to overcome this
issues, Routing Selection Scheme is required to reduce the amount of packet
throughput and packet delivery ratio between the mobile nodes to the destination.
This condition occurs as the routing. It is important as the node need to choose the
optimal route to the destination. Routing selection Scheme, routing table will
generate first before the node send the data packet to the destination.
10
1.3 Problem Statement
Below are the problem that occured in this routing issues in MANET environment
:
i. Challenging in routing due to dynamic network topology
As there are changes in topology due to dynamic network topology, therefore make
its difficult to provide consistent quality of services in wireless nodes.
ii. Providing consistent quality of service in wireless nodes
Basically, the nodes in MANET are mobile and hence the network is self-
organizing. Therefore, due to this statement the topology of the network keeps
changing with time. Hence the routing protocols designed for such networks must
also be adaptive to the changes in the topology.
1.4 Objectives
These are three aims that to be achieve in this project. The objectives are
as stated below :
i. To study the routing issues in MANET.
The the nodes move randomly due dynamic network topology in MANET.
This type of movement can cause link failure which makes the node always
to find new routes to reach the destination. Beside, message broadcasting
also can cause increasing the packet delay time in MANET.
ii. To enhanced the routing protocol in MANET.
11
This routing selection scheme is proposed to provide consistent quality of
sevice in wireless nodes.
iii. To evaluate the performance in MANET.
The evaluation of performance in MANET in terms of packet delay and
packet throughput can be observed from pattern of the graph that will be
show in the result of the simulation.
1.5 Scopes
The scope of the project are as follows :
i. To simulate MANET via Omnet++ in windows.
ii. To implement routing selection scheme in MANET environment.
1.6 Limitation of Works
Applying MANET in a real world environment as this project only simulation
in Omnett++. Working prototypes or implementing in a real world is costly and
require plenty of time to work for.
1.7 Summary
Due to the nature of MANET which has been stated in the problem statement
above. It is pretty much encouraging and motivating to develop this research as an
effort to bring some contribution to the education and academic.
12
CHAPTER 2
LITERATURE REVIEW
2.1 Introduction
This chapter will discuss about the previous articles and research papers that are
related with this project. It is important to gathered the information or knowledge to get
better understanding of the used and idea on how this project works.
As describe in Chapter 1, it clearly state about the routing in MANET. Each node
in MANET acts as a router or source or destination. This node need to forwards packets
to the next hop that allowing them to reach the final destination through multiple
hops[1]. Since MANET is a temporary network without any infrastructure or centralised
administrator due to its dynamic topology, threfore the rule of a routing protocol is very
crucial in the implementation of MANET because in a simple words it is on the
capability of the routing protocols to adapt them-selves to unpredictable changes of
topology network in MANET. However, this problem could be solved by doing an
enhancement of routing selection scheme in MANET. It can be observe through the
evalution of matric performance.
13
2.2 Related Works
Routing Selection Scheme is proposed to this project in order to provide better
routing protocol technique that can establish and maintain multiple-hop routes to allow
data communication between nodes. Besides, this ,ethod also proposed to prevent
flooding occured among the node when passing the data packet to the destination node.
In this previous research paper, Ad-hoc On-Demand Distance Vector protocol
(AODV) has being used [1]. It is a novel algorithm for operation of ad-hoc networks.
Each mobile host operates as a specialized router to forward the message. Besides, the
routes to the destination are only obtained as it needed with no reliance on periodic
advertisements. It is quite suitable for a dynamic self-starting networks. This potocol
provides loop-free routes even when preparing broken links and because it does not
required global periodic advertisements, the demand on overall bandwidth available to
the mobile nodes is substantially less than in those protocols that do neccessitate such
as advertisements.
Next, Sukhdev Singh Ghuman et. (2016) has do a research on “Dynamic Source
Routing (DSR) Protocol in Wireless Networks”[18]. This protocol is designed for use
in multi-hop wireless networks which allows the network to be entirely self-organizing
without the requirement of any network infrasturcture. Besides, Dynamic Source
Routing Network can configure itself independently without the invention of human
administrator. It forms a route on demand when a transmitting route requests and it uses
a source of relying on the routing table at each intermediate device. In determining
source of routing, it requires gathering the address of each node between the source and
destination during routes discovery. The gathered information is used to route packets.
The route packets contain the address of each device the packet will tranverse. In
14
conclusion this protocol can adapts quickly to routing changes when host moves
frequently, and requires little overhead during periods in which hosts move less
frequently.
Besides in “Destination-Sequenced Distance Vector (DSDV) Routing Protocol
Implementation in ns-3” paper, the researcher conduct a research to analyze DSDV
routing performance under various scenarios and compare its performance with the
other protocols implemented in ns-3, which is AODV and OLSR. DSDV protocol uses
the Bellman-Ford algorithm to calculate path. The cost metric used is the hop count,
which is the number of hops is takes for the packet to reach its destination. This protocol
is a table-driven proactive protocol, thus it maintains a routing table with entries for all
the nodes in the network and node just the neighbours of the node. The changes are
propagated through periodic and trigger update mechanisms used by DSDV and due
this updates, there is a chance of having routing loops within the network. To eliminate
routing loops, each update from the node is tagged with a sequence number. The
sequence number from each node is independently chosen but it must be an even
number, since each time a normal updates is made the node increments its sequence
number by 2 and adds it updates to the routing message it transmits. The node cannot
change the sequence number of nodes. If a node wants to send an update for an expired
route to its neighbours, only then look at the sequence number of disconnect node by 1.
The nodes receiving this update will then look at the sequence number and if it is odd,
it will remove the corresponding entry from the routing table. In conclusion, DSDV
overhead inrcreases as the node density increases.
Tamanna el. Al. (2016) leads a paper of “ Study and Analysis of DSDV and
OSLR”[9]. The authors conduct a study about two routing protocol in MANET which
15
is Destination Sequenced Distance Vector (DSDV) protocol and Optimized Link State
Routing (OSLR) protocol. Both of this protocol are table driven protocols that
commonly used in wireless network but this protocol also compitable with wired
networks. Bellman-Ford algorithm is used in wired network, this algorithm is
implemented in DSDV protocol. As the problem faced in wired network because of
broken link addresed in DSDV protocol, therefore the modification in wired network
protocol makes it suitable for wireless networks. Next OSLR protocol is based on link
state algorithm and it is proactive in nature. Therefore to maintain topology information
of network at each node, it peridically exchange messages and compact the size of
control packets by reducing the amount of information sent in message. In addition, it
can reduce the transmission of floading message in the network. So, for efficiently and
economically flooding of control messages multipoint relay concept is used. It has
optimal routes immediatly available in terms of number of hops. In conclusion this
protocol is suited for large and dense network.
Meanwhile, Anuj K. Gupta el. Al. (2013) conducted a paper about “Implementation
of DYMO Routing Protocol”[8]. In this paper, the author discussed about one of the
latest protocol which is know as Dynamic Manet On-demand (DYMO) routing
protocol. This protocol then is implemented and the performance are being analysed
with other similar protocols aganst different parameters. This routing protocol is the
advancement to the existing AODV protocol and it is also defined to as successor of
AODV or AODVv2 and keeps on updating till date. DYMO routing protocol operates
similar to its predecessor for example AODV routing protocol and it does not not add
any extra modifications to the existing functionality but the operation of this routing
protocol is moreover simpler. Besides, DYMO is a purely reactive protocol in which
routes are computed on demand as it needed and this protocol does not support
16
unnecessary HELLO message and the operation is based on sequence numbers that
assigned to all the packets. Its also employs sequence number to ensure loop freedom
and it enable on-demand, multi-hop unicast routing among the nodes in a mobile nodes
in a mobile ad-hoc network. The basic operation in this protocol are route discovery and
maintenance. Route dicovery is performsed to avoid the existing obliterated routes from
the routing table and to reduce the packet dropping in case of any route break or faced
a failure.
On the other hand, Anand Pandey et. Al. (2013) has leads a paper on “Performance
Evaluation of TORA Protocol with Reference to Varying Number of Mobile Nodes”[6].
This paper is conducted to compare the performance of TORA on the basis varying
number of mobile nodes. Besides, authors also give a clear explaination about
Temporally Ordered Routing Algorithm (TORA) routing protocol that was implement
in this project. TORA is a reactive routing protocol for multi-hop networks with some
proactive features. It uses distributed and loop-free routing as node need only maintain
one-hop information in the routing table. TORA is deploy to reduce the communication
overhead that related to adapting to network topology that always changes at a time and
it also maintains routing table entries on a per-destination basis like a distance-vector
routing approach. TORA also aasigns directions (“upstream” or “downstream”) to the
links between nodes to forward datagram packet to the node destination based on the
relative values of metric associated with each router. The metric used by the node/router
to specify the links can conceptually be thought of as a router’s “height”. The significant
of height field is that the node will only forward datagrams downstream and node links
with an unknown or undefined height are considered un-directed and cannot be used for
forwarding.
17
Next, M Ravi Kumar et. Al. (2013) has conducted a research on “Performance
Evaluation of AODV and FSR Routing Protocols in Manets”[7]. In this research paper,
an attempt has been made to understand the characteristic or the behavior of Ad-hoc
On-demand Distance Vector (AODV) and Fisheye State Routing (FSR) protocols. The
authors give an overview of the protocols which is AODV protocol anf FSR protocol.
AODV is a reactive routing protocol and it capable of both unicast and multicast
routing. The route discovery process in this protocol is performed using control
messages Route Request (RREQ) and Route Reply (RREP) whenever a node wish to
send a packet to the destination. During a route discovery process, the source node
broadcast a route request packet to its neighbours. This control packet includes the last
known sequence number for that destination. If any of the neighbours has a route to
destination, it will reply the query with Route Reply packet., otherwise the neighbours
node will rebroadcast the Route Request packet and if there is a node that have a route
to the destination, a reply packet is generated and transmitted tracing back the route
traversed by the query control packet. In order to maintain freshness node list, AODV
basically requires each node by periodically transmit a HELLO messages from it
neighbours. When a node fails to receive three consecutive HELLO messages, the node
will make an assumption that the link to its neighbour is down, so Route Error (RERR)
packet is send to the neighbours in the precursor list associated with the routing entry
to inform them of the link failure.
Meanwhile, Fisheye State Routing (FSR) protocol is a proactive protocol and its
mechanism is based on the Link State Routing protocol used in wired networks. This
protocol reduce the update overhead in large networks by using a fisheye technique.
Fisheye has the ability to see the objects better when they are nearer to its focal point
which means that each nodes maintain accurate information about near nodes and not
18
so accurate about far-away nodes. This is defined as the set of nodes that can be reached
within a given number of hops. The number of levels and the radius of each scope will
depend on the size of the network. The entries that corresponding to nodes within the
smaller scope are propagated to the neighbours with the highest frequency and the
exchange in smaller scopes are more frequent than in larger scopes. Besides, this
protocol will minimized the consumed of bandwidth as the link state exchanged only
among neighbouring nodes and its manage to reduce the message size of the topology
information due to removal of topology information concerned far-away nodes and if
the node doesn’t have accurate information about far-away nodes, the packets still be
routed correctly because the route information becomes more accurate as the packet
getting closer to the destination. In conclusion, the FSR scales well to large mobile ad
hoc networks as the overhead is controlled and supports high rates of mobility.
2.3 Summary
This chapter brings the information about the study on previous research of the
methods and technique that was implemented in routing selection scheme in MANET.
This study is important to get the idea on to conduct and guide to the successful project.
19
CHAPTER 3
METHODOLOGY
3.1 Introduction
In methodology’s chapter will discuss about simulation that are used in this project
which is by using OMNET++ 4.6. It also review the framework and flowchart of the
projet that can help to visualize the idea to get better understanding about this project.
3.2 Simulation of MANET
Simulation are choosen in this project because of the limitation of works that are
quite costly and need a lot of time to be consumed to implemented the MANET
environmnet in the real world. Therefore the simulation is preferred to provides valuable
solution to cope with this matter effectively. In this project, OMNET++ (Objective
Modular Network Testbed in C++) is the network simulator that will be implemented
and one of the reason the simulation is being choosen because it is capable to work in
Windows environment. Besides OMNET++ is an extensible, modular, component-
based C++ simulation library and framework. It is primarily used for building network
simulators. OMNeT++ provides a component architecture for models. Components
(modules) are programmed in C++, then assembled into larger components and models
using a high-level language (NED). Reusability of models comes for free. OMNeT++
has extensive GUI support, and due to its modular architecture, the simulation kernel
(and models) can be embedded easily into your applications.
20
In addition, as it is an open source tool thus it can be downloaded on Windows
directly with the version OMNET++ 4.6 and for MANET environment there are
specifically framework that are created which is known as inetmanet. This framework
also can be downloaded on windows directly. After download, OMNET++ 4.6 and
inetmanet must be extracted and save in the file. The file contains all related files that
is needed for the simulation for instance AODV, DSDV, DYMO files and etc with need
to some algorithm. This file is important as the routing selection scheme technique in
this project is the enhancement of AODV and DSDV routing technique. Therefore the
implementation of OMNet++ and inetmanet will help to make this project become
successfully onwards.
Figure 3.1 OMNET++ Simulation Icon
Figure 3.2 Inetmanet Framework Icon
21
3.3 Project Framework
Figure shows an overview of project framework.
Figure 3.3 Framework of Routing Selection Scheme
3.4 Project Flowchart
This section will explain about the flowchart on how the algorithm of routing
selection scheme works. Figure shows the flowchart of the enhancement of routing
selection scheme technique.
As for the example, we assume the number of nodes in this simulation is 50
nodes. Firstly, it will determine gateway neighbour (node within gateway coverage
range). After that, all gateway neighbours listed into level 1 routing table. Each node in
level 1 will determine their neighbours. Each neighbour’s node of level 1 will be listed
into level 2 routing table. If it found same node in their coverage range, it will remove
the node. Therefore, redundancy node with node at level 1 will remove. Next, each node
in level 2 determine their neighbours. Each neighbour’s node of level 2 listed into level
22
3 routing table. If it found same node in their coverage range, it will remove the node
Redundancy node with node in level 2 will remove. The process will repeat until all
node have listed into level and no duplication of the same node at any level.
Figure 3.4 Flowchart of Gateway Selection Scheme
3.5 Summary
This chapter brings about the concept of research methodology thst were used in
this project, the framework of the project and flowchart of the algorithm used in routing
selection scheme technique. All of this dicussion will help to get more understanding
about the project itself.
23
CHAPTER 4
IMPLEMENTATION AND RESULTS
4.1 Introduction
This chapter discussed about configuration on network simulator that is employ
in this project which is OMNET++ version 4.6 and implementation of Routing
Selection Scheme in MANET . This phase is important to ensure that the objective
in this project is achieved. The evaluation and results of the performance matric are
also shown in this chapter.
4.2 OMNET++ in Windows Environment
4.2.1 Installation of OMNET++ version 4.6
Windows 7 Ultimate is the platform that are choosen to be used for
installation OMNet++ 4.6. The guidelines of the installation OMNet++ are show
below. This guidelines must be followed step by step as for the installation can
successfully be installed.
Step 1: Download OMNet++ 4.6 win32 from the link above
https://omnetpp.org/omnetpp/summary/30-omnet-releases/2291-omnet-4-6-
win32-source-ide-mingw-zip
https://omnetpp.org/omnetpp/summary/30-omnet-releases/2291-omnet-4-6-win32-source-ide-mingw-ziphttps://omnetpp.org/omnetpp/summary/30-omnet-releases/2291-omnet-4-6-win32-source-ide-mingw-zip
24
Step 2: Extract the downloaded file into local C:\
Figure 4.1 omnetpp-4.6
Step 3: After all of the file in omnetpp-4.6 has being extracting completely,
select mingwenv file in omnetPP-4.6 and run the file.
Figure 4.2 mingwenv File
Step 4: Type 3 commands in mingwenv to install omnetpp into the system
1. setenv
25
Figure 4.3 setenv command
2. ./configure
Figure 4.4 configure command
26
Figure 4.5 configuration Command
When the path mentioned “Good”, then proceed with the next command.
3. Make
Figure 4.6 make Command
Step 4: To open the OMNet++ simulator, type command “omnetpp” in
mingwenv
27
Figure 4.7 Omnetpp Command
Figure 4.8 Omnet++ Simulator
Last but not least, after all of the installation of OMNet++ verion 4.6 has
being successfully installed, next step is import the Inetmanet framework. This
Inetmanet framwork is imported because it consist all of the MANET
requirement and component that is needed in this project with the version of
Inetmanet-3.x-inetmanet-2.2.
28
Figure 4.9 Inetmanrt Framework
4.3 Configuration of MANET Environment
This section discussed about the configuration of MANET environmnet that are
need to be set up as shown in table . OMNet++ version 4.6 simulation tool used on
Windows platform which is Windows 7 Ultimate. In this simulation is run with three
different scenarios with varying number of nodes 50,100 and 150. These nodes will
move in the simulation area of 1200(m) x 2000(m) with simulation time is fixed to
900(s). This simulation area are being setup based on the actual size in real MANET
environment. For mobility type, Random mobility are chosen, but the speed of the
mobility are set as static as the project are not emphasize about the mobility phases.
The packet size for one node is set at 1052 bytes and transmission range of each
node in this simulation is 250.
29
Parameter Value
Platform Windows 7 Ultimate
Simulators OMNet++ version 4.6
Simulation Area(m2) 1200 x 2000
Simulation Time (s) 900
Transmission Range (m) 250
Packet Size 1052 bytes
Number of Nodes 50, 100, 150, 200
Measuring parameter Packet Throughput, Packet Delay
Table 4.1 Selected Simulators Parameters in Simulation
4.4 Configuration of Routing Selection Scheme Technique
The configuration of MANET environmnet and Routing Selection Scheme will
follow as simulators parameter that we have set in the table before but there were
some file that we need to modified to makesure the process of the simulation runs
smoothly wihout having any failure.
30
4.4.1 Omnetpp.ini File
The omnetpp.ini file contain the main function of the simulation that
need to be set for MANET environment. This file consist of simulation time,
declaration number of nodes, the area of simulation required that need to be set,
transmission range and the mobility of the nodes that are set in static condition.
Simulation time = 900(s) // Simulation time is fixed
Number of host = 50 // Based on the user
Area of simulation = 1000(m) x 2000(m) //Area is fixed
Transmission range = 250(m) //Transmission range is fixed
Speed mobility = 0(mb) //Mobility is fixed
4.4.2 GWLBRouting.c File
GWLBR is refers to Gateway Load Balancing Routing. This routing
selection scheme is hybrid routing scheme which this routing selection scheme
is combination of AODV and DSDR. This project will focus at the routing
technique in which how the nodes choose the route to destination. In
GWLBRoutingtable.c it contain the main function in this routing selectin
scheme. It show the level of nodes in routing table. This level is very important
as each of the nodes need to know first which level in routing table there are
belong.
Assume that 50 nodes were set in this simulation with three gateway,
every level of the nodes in routing table is determined with the nodes that is in
gateway coverage range which is known as neighbour’s nodes. So every node
that were in gateway coverage range will be listed in level 1 routing table. After
31
that every node in lavel 1 will determindes the nodes in their range. So every
nodes that are in their coverage range will be listed in level 2. The redundancy
node with node at level 1 will be remove. The process will repeat untill all node
have listed into level and there is no duplication of the same node at any level.
Those are one of main function of the routing table.
//get the number of hosts in routing table
int GWLBRoutingTable::getNumHostsInRoutingTable() {
int numHosts = 0;
for (RoutingTable::iterator it = globalRoutingTable.begin();
it != globalRoutingTable.end(); it++) {
numHosts += (it->second).size();
}
return numHosts;
}
4.4.3 Routing Table
Algorithm for Determine Each Level of Nodes in Routing Table
1. Determine gateway neighbour (node within gateway coverage
range)
2. All gateway neighbours listed into level 1 routing table.
3. Each node in level 1 determine their neighbours
4. Each neighbour’s node of level 1 listed into level 2 routing table.
5. Redundancy node with node at level 1 will remove
6. Each node in level 2 determine their neighbours
7. Each neighbour’s node of level 2 listed into level 3 routing table.
8. Redundancy node with node in level 2 will remove
9. Process repeat until all node have listed into level and no duplication
of the same node at any level.
32
Algorithm above explained on how the nodes determine their level
in the routing table before the nodes pass data packet to the destination.
Figure 4.10 Routing Table
Figure shows the routing table that was generated after run the simulation.
---------| RoutingTable [Current Simulating Time 0.1 (sec)] |-----------
GateWays:
145.236.0.35(host[9])
145.236.0.14(host[25])
145.236.0.9(host[33])
Level -->1
145.236.0.5(host[29])
145.236.0.8(host[32])
145.236.0.20(host[44])
145.236.0.23(host[47])
145.236.0.29(host[3])
145.236.0.48(host[22])
145.236.0.43(host[17])
145.236.0.27(host[1])
Level -->2
145.236.0.7(host[31])
145.236.0.9(host[33])
33
4.5 Simulation of Routing Selection Scheme Technique
Figure 4.11 Simulation of MANET Environment
34
Figure 4.12 The simulation Run with 50 Numbers of Nodes
4.6 Results
In this simulation phase, each simulation was run for a simulation time of 900(s)
with varying numbers 50,100,150 numbers of nodes. This results of the simulation
was calculated and plotted in the graph below.
4.6.1 Packet Throughput
Packet throughput is defined as the total number of packets delivered
over the total simulation time. The throughput comparison shows that the
routing selection scheme algorithms performance under traffic load of 50, 100
150 and 200 nodes in MANET environment. As the result that we can observed
from the graph in Figure 4.13, the number of packet throughput is slowly
35
decrease as the number of nodes increase. Figure 4.13, x-axis is number of nodes
and y-axis is the packet throughput (Mbps)
Figure 4.13 Packet Throughput Result (Mbps)
4.6.2 Packet Delay
Packet delay is defined as the time taken for the packet to be received.
In this project the packet delay is compared the number of nodes 50,100,150 and
200. The graphs show the time taken for the data packet successfully be received
during simulations time versus the number of nodes. Figure 4.21, x-axis is the
number of nodes and y-axis refers to packet drop ratio (%). As the result, the
number packet delay increase with the increase of the number of nodes.
0
10
20
30
40
50
60
50 100 150
Packet Throughput
Packet Throughput
Number of Nodes
36
Figure 4.14 Packet Delay Result (ms)
0
5
10
15
20
25
30
50 100 150
Packet Delay
Packet Delay
Number of Nodes
37
CHAPTER 5
CONCLUSION
5.1 Introduction
This chapter discusses on the summarization of the project, constraint and
challenges that were faced during the process of completing this project. Besides, the
future work in this project also were proposed as the suggestion for future project.
5.2 Finalization of Project
The simulation of MANET is one of the significant way in order to spread the
knowledge to the people about about the operation of MANET. This will help them to
get the idea about MANET operation. In the real world, MANET is give more benefit
to users that are risiding in a restriction situation, disaster area, military where obtaining
the wired network would be very impractical. This also could help to save a person that
get involve in disaster area. For this purpose, the enhancement of routing selection
scheme need to be done to makesure that it can provide better quality of service in
routing selection. So that it can communicate effectively. Therefore, based on the
discussion the routing selection scheme technique is proposed to be done in simulation
rather than in the real world. This scheme has improved the packet throughput and
packet delevery ratio. The result of the simulation are shown in the previous chapter.
38
5.3 Constrains and Challenges
There are several problems and and limitations that occured throughout the
development of this project in order to achieve the objectives. In early phase of
deployment of OMNet++, unstable connection of internet is one of the main problem
that were faced as it could bring some problems during installation process. This phases
is important because to makesure all the file required in OMNet++ simulation
completely be install so that the simulation can run successfullt. Besides, there are some
error after run the simulation. It is difficult to solve as it need to trace one by one file in
the simulation plus some errors are related to the computer’s system and panel. Lastly,
the difficulties that have to going through is on adjusting and running the routing
selection scheme technique in inetmanet framework because of the errors in some file
that has being modified, thus it need to be fixed in order to makesure this project
achieved the objective.
5.4 Future Works
There is a few suggestions that can be made for future work that can be used to
improve the performance of this project. Firsly, the evaluation performance of
parameter in this project can be could be added such packet delay and packet loss.
Besides, mobility of the nodes should be one of the reseach rather than routing technique
in MANET. Last but not least, this simulation maybe can be implemented in Internet
Of Thing (IOT) which the matric performance of this simulation can be calculated in
application that are created for specifically MANET purpose.
39
5.5 Summary
This chapter conclude about the benefit of the project and the difficulty faces
during the development process. Besides, the future work is highlighted so that the other
researcher can use as a reference to conduct a better research about MANET issues or
can make an enhancement from the previous work to it can give more benefit to the
others. In the other hand, the simulation of MANET is one of the goog tools as an effort
for the researcher do an experiment and give a understanding to the people, so they can
understand more about the opertaion of MANET in real world environmnet.
40
References
[1] Charles E. Perkins and Elizabeth M. Royer. “Ad-hoc On-Demand Distance
Vector Routing.” .
[2] Pankaj Rohal, Ruchika Dahiya, Prashant Dahiya “Study and Analysis of
Throuhghput, delay and Packet Delivery Ratio in MANET for Topology Based Routing
Protocols (AODV, DSR and DSDV).” International Journal for Advance Research in
Engineering and Technology, Vol. 3, Issue ll, Mar 2013, ISSN 2320-6802.
[3] Zeyad M. Alfawaer and Belgaum Mohammad Riyaz. “An enhanced Multipath
Strategy in Mobile Ad hoc Routing Protocols.” 9th IEEE-GCC Conference and
Exhibition (GCCCE), 2013.
[4] Sandeep Kumar and Dr. Suresh Kumar. "Study of MANET: Characteristics,
Challenge, Application, Routing Protocol and Secuity Attacks.", International Journal
of R&D in Enginering Science and Management, Vol.2, Issue 5, July 2015, Impact
Factor-0.439,p.p.266-274, ISSN 2393-865X.
[5] Jay Prakash, Rakesh Kumar, Jai Prakash Saini. “Path Load Balancing Adaptive
Gateway Discovery in MANET-Internet Integration Using PSO.” International Journal
of Intelligent Engineering and Systems, Vol.10, No.4, 2017.
[6] Anand Pandey, Dinesh Kumar, Shailendra Kumar Sigh. “Performance
Evaluation of Tora Protocol with Reference to Varying Number of Mobile Nodes.”
International Journal of Application or Innovation in Engineering & Management
(IJAIEM), Vol.2, Issue 12, December 2019.
[7] M. Ravi Kumar, Dr. N. Geethanjali & N. Ramesh Babu. “Performance
Evaluation of AODV and FSR Routing Protocols in Manets.”, Global Journal of
41
Computer Science and Technology Network, Web & Security, Vol 13, Issue 4 version
1.0, 2013.
[8] Anuj K. Gupta, Harsh Sadarwati, Anil K. Verma. “ Implementation of DYMO
Routing Protocol.” International Journal of Information Technology, Modeling and
Computing (IJITMC), Vol.1, No.2, May 2013.
[9] Tamanna and Nikita Nain. “Study and Analysis of DSDV and OSLR.”
International Journal of Computer Science and Mobile Computing, Vol.5, Issue.1,
January 2016, pg. 283-290, issn 2320-088X.
[10] Hemanth Narra, Yufei Cheng, Egemen K. Cetinkaya, Justin P. Rohrer, James
P.G Sterbenz. “ Destination-Sequenced Distance Vector (DSDV) Routing Protocol
Implementation in ns-3.” , March 2011.
[11] Vinita Mishra, SmitaJangale. “Analysis and Comparison of Different Network
Simulators.” International Journal of Application or Innovation in Engineering &
Management (IJAIEM), Special Issue for International Technological Conference-
2014.
[12] Swati Dhawan, Vinod Saroha. “Review on Performance Issues of Routing
Protocols of Mobile Ad-hoc Networks.” International Journal of Advanced Research in
Computer Science anf Software Engineering, Vol.3, Issue.6, June 2013.
[13] IqbalIdeep Kaur, Navneet Kaur, Tanisha, Gurmeen, Deepi. “Challenges and
Issues in Adhoc Network.” Dept. of CSE, Chandigarh Engineering College, Landran,
Punjab, India, Vol.7, Issue.4, Oct-Dec 2016.
42
[14] P. Venkata Maheswara and K. Bhaskar Naik. “Routing Protocol Performance
Issues and Evaluation Considerations in MANET.” International Journal of Engineering
Research and Application (IJERA), Vol.3, Issue.4, Jul-Aug 2013, pp.01-05.
[15] Suresh Kumar and Jogendra Kumar. “Comparative Analysis of Proactive and
Reactive Routing Protocols in Mobile Ad-hoc networks.” Journal of Information and
Operations Management, Vol.3, Issue.1, 2012, pp-92-95.
[16] Nor Aida Mahiddin, Nurul I Sarkar. “ Improving the Performance of MANET
Gateway Selection Scheme for Disaster Recovery.” The Review of Socionetwork
Strategies, pp. , 2017, ISSN 1867-3236.
[17] Nor Aida Mahiddin, Nurul I Sarkar, Brian Cusack. “Gateway Load Balancing
and Routing Selection Scheme of MANET in Disaster Scenario.” 2nd Asia-Pasific
World Congress on Computer Science and Engineeering (APWC on CSE), 2015, vol.
1542, pp. 1–7.
[18] Sukhdev Singh Ghuman. “ Dynamic Source Routing (DSR) Protocol in
Wireless networks”. International Journal of Computer Science and Mobile Computing
(IJCSMC), Vol.5, Issue 6, June 2015,pg. 251-254.
[19] https://omnetpp.org/intro
APPENDIX
43
GANTT CHART FINAL YEAR PROJECT 1
TASKS W
1
W
2
W
3
W
4
W
5
W
6
W
7
W
8
W
9
W
1
0
W
1
1
W
1
2
W
1
3
W
1
4
W
1
5
Project’s titles
discussion
with
supervisor
Title and
abstract
submission
Problem
statement and
literature
review
submission
Presentation of
problem
statements,
objectives and
literature
review
Designing
project’s
44
framework
and
methodology
Documentatio
n writing and
preparation
slide
presentation
Final
presentation
and panel’s
evaluation
Submitting
report to
supervisor
45
GANTT CHART FINAL YEAR PROJECT 2
TASKS W1 W2 W3 W4 W5 W6 W7 W8 W9
Installation and
configuration of
OMNet++ 4.6
Simulation of MANET
environment in
OMNet++ 4.6
Project progress and
panel’s evaluation
Configuring on
Gateway Selection
Scheme
Testing the simulation
with running the
simulation using
algorithm
Final project
presentation
Thesis’s draft
submission to
supervisor
Final thesis submission