You are on page 1of 4

International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No: 02 9

A Novel Routing Algorithm for MANET

Mamoun Hussein Mamoun


Faculty of Computers and Information Sciences
Mansoura University, Egypt
mamooninf@yahoo.com

Abstract The wireless channel quality among mobile nodes is


time varying due to fading, Doppler Effect and
In this paper, we propose a novel algorithm to pathloss. Known that the shortest-path metric does not
routing called NRA, in mobile ad hoc networks, that take into account the physical channel variations of the
allows the network layer to adjust its routing protocol wireless medium, it is desirable to choose the route
dynamically based on SNR along the end-to-end with minimum cost based on some other metrics which
routing path for each transmission link. The are aware of the wireless nature of the underlying
experimental results are very promising as the physical channel. In MANET, there are many other
proposed algorithm exhibits superior performance metrics to be considered: Power, SNR, Packet Loss,
with respect to traditional DSR routing algorithm in maximum available bandwidth etc. These metrics
terms of throughput and packet delivery ratio should come from a cross-layer approach in order to
make the routing layer aware of the local issues of the
Key words: MANET, QoS, Routing Protocols. underling layers. [8].
The ability of MANET to provide acceptable
quality of service (QoS) is restricted by the ability of
1. Introduction the underlying routing protocol to provide consistent
behavior despite the inherent dynamics of a mobile
A Mobile Ad hoc Network (MANET) is a dynamic computing environment. [9] [10].
wireless network with or without fixed infrastructure. Many proposals and models addressed quality of
Nodes may move freely and arrange themselves service (QoS) among mobile nodes of the wireless
randomly. The contacts between nodes in the network networks and considered the link quality in their
do not occur very frequently. As a result, the network designs and architectures [11][12][13].
graph is rarely, if ever, connected and message Our objective is to design a mechanism to provide
delivery required a mechanism to deal with this an efficient QoS routing protocol to enhance the
environment [1] Routing in MANET using the performance of existing routing protocols in Mobile ad
shortest-path metric is not a sufficient condition to hoc network environment
construct high-quality paths, because minimum hop In this paper we select DSR as one of the common
count routing often chooses routes that have MANET protocols to demonstrate our two models,
significantly less capacity than the best paths that exist Signal to noise Ratio (SNR), to enhance the quality of
in the network. [2] service of the DSR. We evaluate how the protocol
Most of the existing MANET protocols optimize differ in the methods it uses to select paths, detect
hop count as building a route selection. Examples of broken links, and buffer messages during periods of
MANET protocols are Ad hoc On Demand Distance link outage. Our new approach is called NRA. We
Vector (AODV) [3], Dynamic Source Routing (DSR) computed differences in terms of packet delivery ratio,
[4], and Destination Sequenced Distance Vector throughput, end-to-end latency, and mechanism
(DSDV) [5]. However, the routes selected based on overhead. We show that the performance of DSR
hop count alone may be of bad quality since the protocol improved by using the proposed model.
routing protocols do not ignore weak quality links This paper is structured as follows: Section 2
which are typically used to connect to remote nodes. presents a DSR routing protocol. We investigate the
These links usually have poor signal-to-noise ratio proposed routing protocol (NRA) in section 3. Section 4
(SNR), hence higher frame error rates and lower elaborates on the simulation environment and the
throughput. [6], [7].
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No: 02 10

experimental results. In Section 5, we present our Routing in MANET is difficult as a result of the
conclusion. dynamic nature of network topology and the resource
constraints. The issue of Link reliability in mobile ad
2. DSR Protocol hoc networks is a main problem to transmit messages
through the wireless channels. Routing in multi-hop
DSR is an entirely on-demand ad hoc network wireless networks using the shortest-path metric is not
routing protocol composed of two parts: Route an adequate condition to build good quality paths,
Discovery and Route Maintenance. In this section, we because minimum hop count routing often selects
describe the basic form of Route Discovery and Route paths that have significantly less capacity than the best
maintenance in DSR. paths that exist in the network. [2]
In DSR, when a node has a packet to send to some Physical-layer limits of wireless channel because
destination and does not currently have a route to that of: time-varying fading, multipath, co-channel
destination in its Route Cache, the node initiates Route interference, hostile jamming, mobility, dynamic
Discovery to find a route; this node is known as the network topology.
initiator of the Route Discovery, and the destination of In technicality, information from the transmission
the packet is known as the Discovery's target. The links, such as Signal to Noise Ratio (SNR), can furnish
initiator transmits a Route Request (RREQ) packet as a valuable information to the source node about the
local broadcast, specifying the target and a unique transmission paths as far as routing is concerned. Each
identifier from the initiator. Each node receiving the wireless node can communicate with any other node
Route Request, if it has recently seen this request within its transmission range, which depends on SNR
identifier from the initiator, discards the Request. at the receiver node.
Otherwise, it appends its own node address to a list in We modified the route reply packet format and
the Request and rebroadcasts the Request. When the added one extra field in the packet format to store the
Route Request reaches its target node, the target sends a worst value of SNR along the route from destination to
Route Replay (RREP) back to the initiator of the source.
Request, including a copy of the accumulated list of Section 2 illustrated how original DSR works. We
addresses from the Request. When the Replay reaches modified also the mechanism of DSR process to
the initiator of the Request, it caches the new route in its include our model. The new mechanism will works as
Route Cache. follows: When the route request packet arrives at the
Route Maintenance is the mechanism by which a destination or an intermediate node with a route to the
node sending a packet along a specified route to some destination, a route reply packet will be generated.
destination detects if that route has broken, for example This reply packet is then sent back to the source node
because two nodes in it have moved too apart. DSR is following the reverse route contained in the route
based on source routing: when sending a packet, the request packet. Each intermediate node will update the
originator lists in the header of the packet the complete SNR value if its link values of SNR lower than the
sequence of nodes through which the packet is existing recorded values in the route reply packet. If
forwarded. Each node along the route forwards the SNR value of its link is greater than recorded value,
packet to the next hop indicated in the packet’s header, the node will not update the value. The process will
and attempts to confirm this by means of a link-layer continue until the route reply packet reach the source
acknowledgment or network layer acknowledgment. If, node. Now, at the source node there are many of
after a limited number of local retransmissions of the available routes with different values of SNR. The
packet, a node in the route is unable to make this Source node will select the route based on the value of
confirmation, it returns a Route Error to the original best of worse available values of SNR.
source of packet, identifying the link from itself to the
4. Simulation and Results
next node was broken. The sender then removes this
broken link from its Route Cache; for subsequent
A network simulator (NS2) [14] was developed in
packets to its destination, the sender may use any other
order to monitor, observe and measure the
route to its destination in its Cash, or it may attempt a
performance of MDSR routing. In simulations, we
new Route Discovery for that target if necessary.
choose propagation model based on 802.11.
The fading modules contributed in [15] are included
3. A Proposed Routing Protocol (NRA) into account. The modulation, BPSK, compute the
BER under fading condition from the loop-up tables.
We calculate the Doppler shift velocity according to
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No: 02 11

the ground speed, pitch, and yaw of the transmitting 90


node and the receiving node. Look up the fading 80

P a c k e t d e l i v e ry (p a c k e t/ s e c )
amplitude according to the Rician K=5 factor [16]. 70

We considered in our network topology to include 60

fading, Doppler Effect and various speed mobility. 50 NRA


40 DSR
Under these simulation conditions, the wireless
30
node is configured as: 20
10
Table1. Configuration parameters 0
Configuration Parameter Value 0 50 100 150 200 250 300 350
Pause time (sec)
Effective comm. area 300- 400 m
Terrain range 3000x3000 m
No. of nodes 80 Figure2. Packet delivery vs. Pause time
Modulation Scheme BPSK
Threshold Power -75dBm From figure 1, it is noticed that there is an increase
Propagation Pass Loss Free space in the network throughput due to the using of the NRA
Fading model Rician protocol compared to the traditional DSR showing that
Rician Fading factor 5 the influence of our algorithm to the DSR protocol.
Speed 3-12 m/sec From figure 2, it is noticed that there is an increase
Packet size 1024 bits in the packet delivery ratio due to the using NRA
Routing protocol NRA, DSR compared to the standard DSR protocol showing that
MAC layer IEEE 802.11 the influence of the our algorithm to the DSR protocol.
Routing protocol DSR and MDSR
Carrier frequency 2.4 GHz
45
40
The results of experiments are shown in the
E n d -to -e n d d e l a y (s e c )

35
following Figures. 30
25 NRA
20 DSR
18000
15
16000
10
14000 5
Throughput (bit/sec)

12000 0
NRA 0 50 100 150 200 250 300 350
10000
DSR
8000 Pause time (sec)

6000

4000
Figure3. End-to-end delay vs. Pause time
2000

0
Pause tims (sec)
From figure 3, it is noticed that there is slightly
increase in End-to-End delay in NRA compared to
Figure1. Throughput vs. Pause time traditional DSR.

5. Conclusion
In this paper, we propose a new algorithm to
modify the DSR routing protocol to choose routes
according to the Signal to Noise Ratio (SNR) criterion
which is characterized with the best value of SNR of
the weakest link along the route from destination to
source to eliminate the routes with bad links that has
very low SNR and to improve QoS.
Simulation results show that our model achieved
better performance than traditional DSR protocol in
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No: 02 12

terms of delivery rate and throughput over intermittent


network. [13] V. Gulati, A. Garg and N. Vaidya, “Anycast in Mobile
Ad Hoc Networks”, Technical Report, Texas A&M
University, April 2001.
6. References
[14] D. Cavin, Y. Sasson and A. Schiper, “On the accuracy
[1] F. Alnajjar, T. Saadawi, “Social-stratification of MANET simulators”, Proceeding ACM POMC’02, pp.
Probabilistic Routing Algorithm in Delay-Tolerant 38-43, Oct. 2002.
Networks”, The International Conference on Wireless
Algorithms, Systems and Applications (WASA'09), Boston, [15] R. J. Punnoose, P. V. Nikitin, and D. D. Stancil,
MA, pp. 579–59, August 2009. “Efficient simulation of Rician fading within a packet
simulator”, September 2000. Code available at
[2] W. Ho Yuen, H. Lee and T. D. Andersen “A Simple and http://www.ece.cmu.edu/downloads/ns2 ricean dist.tgz
Effective Cross Layer Networking System for Mobile Ad
Hoc Networks”, PIMRC 2002, vol. 4, pp. 1952-1956, [16]. Theodore Rappaport, Wireless Communications:
September 2002. Principles and Practice, Prentice Hall PTR, Upper Saddle
[3] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand River, NJ, 2001.
distance vector routing”, Proc. IEEE Workshop on Mobile
Comp. Systems .and Applications, pp. 90-100, Feb. 1999.
Bibliography
[4] D. B. Johnson and D. A. Maltz, “Dynamic source routing
in ad hoc wireless networks”, Mobile Computing, pp. 153-
▲Name: Dr. Mamoun
181, 1996. Hussein Mamoun.
Address: Faculty of
[5] C. E. Perkins and P. Bhagwat, “Highly dynamic Computer and Information
destination sequenced distance-vector routing (DSDV) for Sciences, Mansoura
mobile computers”, Computer Communications Review, pp. University, Egypt.
234-244, Oct.1994.
Education & Work
[6] H. M. Tsai, N. Wisitpongphan and O.K. Tonguz, experience: has completed B.S. degree in electrical
“Link-Quality Aware AODV Protocol,” Proc. IEEE and computer engineering from Military Technical
International Symposium on Wireless Pervasive Computing Collage (Egypt) in June 1979, his M.S degree in
(ISWPC), Phuket, Thailand, January 2006 electrical and computer engineering from Cairo
University (Faculty of Engineering) in Oct. 1985 and
[7] E. Royer and C.-K. Toh, "A Review of Current Routing PhD degree in electrical and computer engineering
Protocols for Ad Hoc Mobile Wireless Networks", IEEE from Cairo University (Faculty of Engineering) in
Personal Communications Magazine, vol. 6, No. 2, April
Dec.1990.His research interests including Routing and
1999.
Multicast for MANET. Presently he is working as
[8] M. Drini and T. Saadawi, “Modeling Wireless Channel Associate Prof. in Faculty of Computers and
for Ad-Hoc Network Routing Protocol”, ISCC Marakech Information Sciences, Mansoura University, Egypt.
Marocco, pp. 549-555, July 2008. Tel: +20180554768
: +966594113095
[9] J. Novatnack , L. Greenwald and H. Arora, “Evaluating
ad hoc routing protocols with respect to quality of service”,
E-mail: mamooninf@yahoo.com
Wireless And Mobile Computing, Networking And
Communications, Vol. 3, pp. 205-212, Aug. 2005.

[10] F. Aune, “Cross-Layer Tutorial”, NTNU 2004.

[11] N. Wisitpongphan, G. Ferrari, S. Panichpapiboon, J.S.


Parikh and O.K. Tonguz, "QoS provisioning using BER-
based routing for ad hoc wireless networks", IEEE Vehicular
Tech. Conf. (VTC), pp. 2483-2487, Spring 2005.

[12] B. R Arun kumar, C. Lokanatha Reddy and P. S.


Hiremath, “High performance Modified DSR with Power
Consumption Optimization for Mobile Ad hoc Networks”,
IJCSNS International Journal of Computer Science and
Network Security, Vol.7, No. 5, May 2007.

You might also like