International Research Journal of Advanced Engineering and Science

ISSN (Online): 2455-9024

Latency Reduction Technique of Mobile AD HOC

Network
Md. Rumman Rafi1, Arifuzzaman2, Sabrina Tasnim3, Md. Salehin Ferdous4
1
Department of Electrical & Electronic Engineering, Fareast International University, Dhaka, Dhaka, Bangladesh-1213
2
Department of Mathematics, Fareast International University, Dhaka, Dhaka, Bangladesh-1213
3
Department of Computer Science & Engineering, Sonargaon University, Dhaka, Dhaka, Bangladesh-1215
4
Department of Electrical & Electronic Engineering, Fareast International University, Dhaka, Dhaka, Bangladesh-1213

Abstract— The latency of Mobile AD HOC Network (MANET) needs
to be improved using different algorithms for mobile nodes,which is
the crying need for future research. This paper will present the idea
of Quadrant-based directional Routing Protocol (Q-DIR) algorithm
with mobile nodes for latency improvement
Keywords— Latency, AODVbis, Quadrant-based directional routing.
I. INTRODUCTION
Mobile Ad Hoc Network (MANET) is a distributed remote
foundation less organize where correspondence among nodes
can be made and arrangement very quickly particularly in
crisis and catastrophe tasks, military combat zone and even in
a working for security and observation [1,2]. Many steering
conventions were suggested that depend on topology and as of
late, in light of situation to decide the course to goal. Position-
based steering conventions utilizes area data from an area
administration and nodes know about their areas. Position-
based conventions are further classified into avaricious
sending and limited flooding [3]. In voracious sending [4], in
light of area data of the goal node, a choice procedure by the
source node will be made of the node with the best progress
towards the goal. After the choice procedure, the information
parcel is unicast to the chosen node. This procedure will
proceed until the information bundle arrives at the goal.
Ravenous sending just works in a particular topology as
expressed in [3] and a few work proposed recuperation
procedures to conquer voids. Then again, confined flooding
recognizes a set number of nodes in a specific geographic
locale that will take an interest in the course disclosure and not
arrange wide support. The RREQ parcel is first communicated
and measurements, for example, separation, the territory found
and sending zone data are registered at the individual nodes to
decide their interest. Taking part nodes will at that point
communicate the parcel and the procedure is rehashed at each
middle of the road node until it comes to the goal.
The directing conventions proposed so far require complex
numerical calculation at every node and to consider a
straightforward and implemental calculation in the portion
space, we propose Q-DIR which uses a basic scientific
calculation in the bit condition which doesn't bring about
preparing delay in the event that it were created in the client
space.
The rest of this paper is composed as pursues. Segment II
will present related works on confined flooding in position-
based directing convention and proving ground execution of
MANET steering conventions. The algorithm and check of Q-
DIR by means of simulation and usage will be depicted in
Section III. Segment IV will show the simulation of the
mobile nodes system model and Section V will display the
outcomes pursued by Segment VI which concludes the paper.
II. RELATED WORKS
With the coming of Global Positioning System (GPS) [5]
and MANET condition based selfpositioning [6] and remote-
situating framework [7, 8], area data can be effectively
dispersed to the mentioning node as required in the position-
based directing convention. In [9, 10, also, 11], good ways
from the node to the goal is utilized to decide nodes
investment in the course revelation process. Nodes that are
further away from source won't take an interest. LAR [9]
figures good ways from the goal dependent on area data of the
goal that will be extricated from the solicitation bundle while
[10] utilizes the relative neighborhood diagram (RNG) which
together with nearby data of separation to neighbors and
separations between neighbors will limit the absolute vitality
utilization while as yet keeping up the entirety organize
inclusion through communicating. LGF [11] ascertains
separations to all nodes in the arrange and will think about the
separation data of the source to the goal removed from the
solicitation parcel to decide its cooperation. Then again, ARP
[12] and DREAM [13] utilizes the edge produced using the
straight line attracted from source to goal as the limited locale
whereby all nodes in this area will partake in the course
disclosure. In any case, DDB [14] utilizes the area data of the
goal node and furthermore of the moderate node which are
embedded in the solicitation bundle. With this extra data, a
middle of the road node can figure the evaluated extra secured
zone that it would cover with its transmission which depends
on Dynamic Forwarding Delay (DFD) The idea of DFD is to
decide when to advance the parcel and node with more
territory secured will be given a littler postponement to
communicate what's more, henceforth, will communicate it
first. All the proposed conventions require calculation of the
separation what's more, edge at all middle of the road nodes to
decide the hubs that are situated in the sending locale. Area
data of goal node is sent in the solicitation bundle as in [9, 10,
11, 12 what's more, 13] yet [14] send the area of source node
also. There are two ways to deal with consider when building
up a MANET proving ground; bit condition or the client
space. A few proving ground usage were created as revealed

124

Md. Rumman Rafi, Arifuzzaman, Sabrina Tasnim, and Md. Salehin Ferdous, “Latency Reduction Technique of Mobile AD HOC Network,”
International Research Journal of Advanced Engineering and Science, Volume 4, Issue 4, pp. 124-126, 2019.
 International Research Journal of Advanced Engineering and Science
in [15] that demonstrates that creating MANET steering
convention in the bit decreases the client portion intersections
characteristic in client area proving ground execution.
Notwithstanding, complex numerical calculation in portion
can't be utilized because of the skimming point issue [16]. In
this way, proving ground usage in the piece condition is the
best approach however straightforward calculations are
required. It is appeared in [14] that by embeddings area data of
the source node or the past middle of the road node in the
information bundle, occasional beaconing can be dispensed
with which will decrease further the directing overhead.
Among the receptive conventions that are effectively
investigated and in actuality have been moved up to Suggested
for Comments (RFC) in the Internet Engineering Task Force
(IETF) are Ad-hoc on-demand Distance Vector (AODV) [17]
and Dynamic Source Routing (DSR) [18]. Between them,
there are a few downsides and points of interest and work to
join these two conventions are submitted to IETF as an
Internet-Draft and are called AODVbis [19] which depended
on the work announced in [20].
III. QUADRANT-BASED DIRECTIONAL ROUTING PROTOCOL
(Q-DIR)
Q-DIR is a limited flooding directing convention that
focuses on a predetermined zone utilizing area data given by
an area administration. In Q-DIR activity, the area data of the
source and goal nodes is piggy-upheld in the course demand
(RREQ) bundle and after that communicated. After getting the
RREQ, middle of the road nodes will analyze utilizing a basic
scientific correlation dependent on the directions of source,
goal and the current node that coordinates the parcel towards
the goal. This scientific handling will be done in the bit
condition to kill the traverse from client to part space and bad
habit versa. The choice to take an interest is made promptly
and a neighbors table isn't required. When the choice to
communicate has been made, the middle of the road node will
embed its area by supplanting the source node organizes and
annex its location and succession number toward the finish of
the RREQ bundle. It will at that point communicate the
bundle. The procedure will rehash at each middle of the road
node until it arrives at the goal. The substitution of the source
node area data with the moderate node directions will make
the bundle increasingly coordinated towards the goal since the
correlation presently depends on the past node. Goal node will
send a course answer message (RREP) back to source by
means of the way taken to arrive at the goal that was affixed in
the RREQ as it crosses over the system. There is no
requirement for the course revelation to the source node. The
proving ground usage of Q-DIR has been effectively been
created as revealed in [21] that demonstrates that the there is a
decrease in start to finish delay while keeping up a practically
identical conveyance proportion. Again as detailed in [22] Q-
DIR has been applied and demonstrated a diminished inertness
of 16.67% less time as the parcel transmission rate is
expanded where the confined flooding and directional steering
lessens the quantity of taking an interest nodes as the RREQ
crosses in the system towards the goal node and subsequently
125
Md. Rumman Rafi, Arifuzzaman, Sabrina Tasnim, and Md. Salehin Ferdous, “Latency Reduction Technique of Mobile AD HOC Network,”
International Research Journal of Advanced Engineering and Science, Volume 4, Issue 4, pp. 124-126, 2019.
ISSN (Online): 2455-9024
lessens delay while keeping up an equivalent conveyance
proportion for a thickly populated system. However, with the
study of Q-DIR utilizing mobile nodes through simulation,
latency can be decreased more in a large network.
IV. SIMULATION
A system of 6 mobile nodes as appeared in Figure 1 is
utilized to confirm that the calculation works and the
directions are deliberately picked so that there will be in any
event 2-bounces transmission to the goal. The fanciful x-and
y-pivot are attracted to indicate which quadrant the nodes are
situated with reference to their quick neighbors. In view of the
transmission range set at 30m, nodes 1, 2, 3 and 4 are
neighbors of node 0 while nodes 0 and nodes 5 are neighbors
of node 2. The simulation design parameters utilized in the
reenactment adjusts to the Internet-Draft [19]. The most
extreme number of bounces between nodes has been set to 10
while the evaluated normal of one bounce traversal time is set
to 0.56 ms.
Fig. 1. End to end delay using mobile nodes.
The MAC layer convention utilized is IEEE 802.11 DCF
CSMA/CA. The information rate has been set to 2 Mbps and
the system convention is IP. The way misfortune model
utilized is the log-ordinary way misfortune model [23]. The
get edge power is set as 1.20475e-08 watts to empower
gathering inside 30m separation. The information parcel
length has been set to 1000 bytes with a CBR (Constant Bit
Rate) traffic design. The simulation was run and messages
showed demonstrate that nodes 1, 2, 3 and 4 will all get the
RREQ parcel from source node 0 bound for goal node 5. In
any case, nodes 1, 3, and 4 will drop the parcel since they are
in various quadrant from the source and goal. The preview of
the choices made when running the reenactment demonstrates
that node 1, 3 and 4 drop the RREQ got from source node 0.
Then again, node 2 advances the parcel to goal node since it is
in a similar quadrant as goal contrasted with source. The result
demonstrates that the calculation is working as proposed.
V. SIMULATION RESULT
A situation was simulated to think about the impact of
differing parcel transmission rate for mobile nodes. The two
 International Research Journal of Advanced Engineering and Science
conventions that were simulated are AODVbis which is a
complete flooding convention and Q-DIR which depends on
confined flooding mobile nodes. Simulation demonstrates the
graph for end to end delay for both AODVbis and Q-DIR
conventions. AODVbis requires a normal of 154 ms for a
portable information parcel to arrive at goal while Q-DIR
takes 125.2 ms. Q-DIR takes 18.71% less time with mobile
nodes contrasted with AODVbis
VI. CONCLUSION
This paper has demonstrated the presentation of QDIR
which is a confined flooding calculation which utilizes area
data of the source, goal and the middle of the road mobile
node to decide the telecom choice. Nodes that are in the
limited communicated area will communicate while different
nodes which are out of this district will overlook the RREQ
parcel. The straightforward numerical examination is
implemental in the portion condition which doesn't bring
about handling delay due the intersection from client to piece
space and the other way around. QDIR demonstrated a
reduced latency of 18.71% as the parcel transmission rate is
expanded. The mobile nodes diminish delay while keeping up
an equivalent conveyance proportion for a thickly populated
organize. The authors intend to study the performance of
QDIR using nodes to reduce more latency of mobile ad-hoc
network.
REFERENCES
[1] J.Z. Sun, “Mobile Ad Hoc Networking An Essential Technology for
Pervasive Computing,” Intl. Conference on Info-tech & Info-net.
Beijing, China 2001.
[2] Y.Sun, E.M Belding-Royer and C.E. Perkins, “Internet Connectivity for
Ad Hoc Mobile Networks”, Intl. Journal on Wireless Information
Networks. 9(2). April 2002.
[3] Stojmenovic, I, “Position-based Routing in Ad Hoc Networks,” IEEE
Communications Magazine. July 2002.40(7). 128-134.
[4] Oh, H., Bahn, H. and Chae, K-J, “An Energy Efficient Sensor Routing
Scheme for Home Automation Networks,” IEEE Transactions on
Consumer Electronics, Vol.31 (3). August 2005.
[5] Garmin Ltd., About GPS. availableat:
http://www.garmin.com/aboutGPS/waas.html.
[6] L.A.Latiff, A.Ali, Chia-Ching Ooi & N.Fisal, “Development of an
Indoor GPS-free Self Positioning System for Mobile Ad Hoc Network
(MANET),” MICC-ICON 2005, Malaysia, 16-18 November 2005.
[7] J.Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris,“ A Scalable
Location Service for Geographic Ad HocRouting”, Mobicom 2000.
126
Md. Rumman Rafi, Arifuzzaman, Sabrina Tasnim, and Md. Salehin Ferdous, “Latency Reduction Technique of Mobile AD HOC Network,”
International Research Journal of Advanced Engineering and Science, Volume 4, Issue 4, pp. 124-126, 2019.
ISSN (Online): 2455-9024
[8] A.Ali, L.A.Latiff, N.Fisal, “GPS-free Indoor Location Tracking in
Mobile Ad Hoc Network (MANET) using RSSI,” RFM 2004, Malaysia,
August 2004.
[9] Ko, Y.B. and Vaidya, N.H, “Location-Aided Routing (LAR) in Mobile
Ad Hoc Networks,” ACM/Baltzer Wireless Networks Journal. 2000.
6:307-321.
[10] Cartigny, J., Simplot, D. and Stojemenovic, I, “Localized minimum-
energy broadcasting in ad hoc networks,” INFOCOM 2003. 30 March-3
April 2003. 3:2210-2217.
[11] A.Ali, L.A.Latiff, Chia-Ching Ooi, and N.Fisal, “Location-based
Geocasting and Forwarding (LGF) Strategyin Mobile Ad Hoc Network
(MANET) ,” ICT 2005, Cape Town, South Africa, May 2005.
[12] Kumar Banka, R. and Xue, G, “Angle routing protocol: location aided
routing for mobile ad-hoc networks using dynamic angle selection,”
MILCOM 2002 Proceedings. 7-10 Oct 2002. 1:501-506.
[13] Basagni, S., Chlamtac, I. and Syrotiuk, V.R, “A Distance Routing Effect
Algorithm for Mobility (DREAM),”ACM/IEEE International
Conference on Mobile Computing and Networking. Oct. 1998. 76-84.
[14] Heissenbuttel, M., Braun, T., Walchli, M. and Bernoulli, T, “
Broadcasting in Wireless Multihop Network with Dynamic Forwarding
Delay Concept,” Technical ReportIAM-04-010. Institute of Computer
Science and Applied Mathematics University of Berne, Switzerland,
December2004.
[15] Chakeres, I. D. and Royer, E.M., “AODV Routing Protocol
Implementation Design,” Proceedings of 24thWWAN 2004. 23-24 March
2004. Tokyo. 2004. 698-703.
[16] Salzman, P.J. and Pomerantz, O. The Linux Kernel Module
Programming Guide. 2003-04-04 ver 2.4.0.Copyright © 2001 Peter Jay
Salzman. 2003
[17] C.E Perkins and E.M. Royer, “Ad-Hoc on-demand distance Vector
Routing,” 2nd IEEE Workshop on Mobile Computing and Application
1999 Proceedings, WMCSA ’99,pp. 90-100, 25-26 Feb 1999.
[18] Johnson, D. B., Maltz, D. A. and Hu, Y-C., “The Dynamic Source
Routing Protocol for Mobile Ad Hoc Networks (DSR),” Internet Draft
of IETF MANET WG.draft-ietf-manet-dsr-09.txt. 15 April 2003.
[19] C. E. Perkins, E. M. Royer, and Ian D. Chakeres. “Adhoc On Demand
Distance Vector (AODV) routing,” IETFMANET Working Group
Internet Draft,http://www1.ietf.org/internet-drafts/draft-perkins-
manetaodvbis-01.txt, January 2004.
[20] Gwalani, S., Belding-Royer, E.M. and Perkins,C.E., “AODV-PA:AODV
with Path Accumulation,” International Conference on
Communications. May 2003. 26(1):527-531.
[21] Latiff, L.A., Ali, A., Ooi, C.-C. and Fisal, N., “Implementation of a
Quadrant-based Directional Routing Protocol (Q-DIR) in Wireless
Mobile Ad Hoc Network.,” IASTED NCS 2006. 29-31 Mac 2006.
Chiang Mai, Thailand. IASTED. 2006.
[22] Latiff. L.A., Ali.A., Fisal.N, “Reduced Latency in Restricted Flooding
Routing Protocol For Mobile AD HOC Network,” 2007 Asia-Pacific
Conference on Applied Electromagnetics Proceedings.
[23] Rappaport, T.S. Wireless Communications: Principles