Professional Documents
Culture Documents
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
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
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