Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single Path Routing Protocol

IDL - International Digital Library Of
Technology & Research

Volume 1, Issue 5, May 2017 Available at: www.dbpublications.org
International e-Journal For Technology And Research-2017
Spatial ReusabilityAware Routing in Multi-

Hop Wireless Networks Using Single Path
Routing protocol
Renuka H.S Mrs.Shruthi G
M.Tech, Dept.of CSE, Assistant Professor, Dept.of

CSE,
Don Bosco Institute of Technology,
Don Bosco Institute of
Renukaputti93@gmail.com Technology,
Shruthiindbit@gmail.com
Abstract:In Multi-hop wireless routing to successfully achieve high end to end throughput .To
search a best node path from source node to the destination node .A large number of routing
protocols use for minimum total transmission count/time for delivering a single packet, such
transmission time minimizing protocols cannot be assured to successfully achieve maximum end
to end throughput. Considering spatial reusability of the wireless media, increase the end-to-end
throughput in multi-hop wireless network. To support a function in spatial reusability-aware
Single path routing (SAAP) protocols, It compare with existing protocols, Results provide
desired end to end throughputgain is up to 62.7%. and desired end to end delay.
Keywords: Underwater resourceful routing, delay sensitive, energy cost.
1INTRODUCTION
Outstanding to limited capacity of wireless that can maximize the end-to-end throughput
communication mediaand loss wireless links , it and end-to-end delay , particularly in multi-hop
is really important to carefully select the route wireless networks. In recent years, a big number
IDL - International Digital Library 1|P a g e Copyright@IDL-2017


of routing protocols (e.g.,[3], ) have been reusability is not considered. In this reader work,
planned for multi-hop wireless networks. Still, a we reason that by carefully considering spatial
central problem with existing wireless routing reusability of the wireless communication
protocols is that minimizing the overall number media, we can very improve the end-to-end
(or time) of programs to deliver a single packet amount in multi- hop wireless networks routing
from a source node to a destination node does and up 60%.The detailed contributions of our
not necessarilymaximize the end-to-end work are as follows. To the best of our
throughput. In this paper,we explore one thing of knowledge, we are the first to explicitly consider
routing protocols, includingsingle-path routing. spatial reusability of the wireless communication
Most of existingrouting protocols, no matter media in routing, and design practical spatial
single-path routing protocols or any path routing reusability aware single-path routing (SASR)
protocols, rely on link-quality aware routing .We express the problem of spatial reusability-
metrics, such as link transmission count-based aware single-path routing as a binary from, and
metrics (e.g., ETX )and link transmission time propose spatial reusability-aware single-path
based metrics (e.g., ETT [2] and EATT routing (SASR) algorithm for path
).However, an important property of the wireless selection.propose SAAR algorithm for
communication media, which decides it from participating node selection, cost calculation,
traditional wired communication media, is the and forwarding list determination. We have
spatial reusability. To the maximum of our evaluated SASR algorithm .Our evaluation
knowledge, most of the existing routing results show that our algorithms significantly
protocols do not take spatial reusability of the improve the end-to-end throughputandend-to-
wireless communication media into form. We end delay compared with existing ones.
will show the wrong usage of routing metrics by Specifically, for single-path routing, aamount
existing routing protocols, when range spatial gain 60%.
2. RELATEDWORKS
A Routing Metrics For single-path routing, probable number of transmissions to

several link-quality aware metrics were successfully deliver a packet. Including the
planned. ETX [1] assigns the link with multi-rate ability, ETT [2] takes the

estimated transmission time of a link as its hyperlink cost and the lasting cost.
cost. Whats more, [4] provided some However, existing routing metrics incline to
principles for routing metric plan.the EATX calculate path cost using some device of cost
metric was defined to reproduce less combination of link costs. For example,
overalltransmissions in any-path forwarding. the procedures in [4], such as consistency,
[3] adopted EATX as the hyperlink cost, and ignored the effect of reusability.
defined the any path cost composed of the
3. EXISTING SYSTEM
In new years, a overweight number of overall number of transmissions to deliver a

routing protocols have been proposed for single packet from a source node to a
multi hop wireless networks. Though, a destination node does not unavoidably
fundamental problem with existing wireless maximize the end-to-end amount. We study
routing protocols is that minimizing the one thing of routing protocol, including
overall number (or time) of transmissions to single-path routing ,The task of a single-path
deliver a single packet from a source node to routing protocol to select a cost minimizing
a destination node does not necessarily path, along which the packets are delivered
maximize the end-to-endthroughput and from the source node to the destination
desired end-to-end delay, Great number of node. In spatial reusability of wireless
works wireless routing matrices is ended in signals decline during spread, two links are
traditional wireless sensor network. In free of interference if they are remotegone
wireless communication network it is key to enough, and so can transmit at the same time
carefully find the high value route in multi on the same channel. To the top of our
hop wireless networks, a great number of knowledge, most of the existing routing
routing protocols have been projected for protocols do not take spatial reusability of
multi hop wireless networks. However, a the wireless communication. We
fundamental problem with existing wireless studyspatial reusability of wireless sensor
routing protocols is that minimizing the network routing using spatial reusability of


by single path routing media into account. destination Stripping,Destination
Routing protocols are generally Stripping means destination is packet
implemented based on transmission cost remove from ring network ,Source Stripping
minimizing routing metrics, they cannot in the packet is only present on the network
agreement maximumend-to-end amount end .The packet is present all the way
when spatial reusability need tobe around the ring and remove by the source
considered. They need national control to node. The algorithms proposed in this work
realizeMAC-layer scheduling, and to do not needany development, and the SASR
eliminate transmission contention.Spatial algorithms can be implemented in a spread
Reusability has a unique bandwidth allows manner.Our approach can be extended to
multiple nodes on the ring to entirety of its adapt to multiple transmission rates, as long
bandwidth efficiency mechanism allows as the conflict graph of links can be
multiple nodes on the rings. Node can send calculated .Proposed system motivate to
packet from source to destination, The simply select the (any) path that minimizes.
implementation of a method called
the overall transmission counts or formation of an ad hoc network. While a

transmission time for delivering a packet. In large number of routing protocols have been
An ad hoc network wireless sensor nodes applied to find the path with minimum
with dynamism forming a network without transmission time for sending a single
the use of any existing network setup packet, such transmission time reduces
administration.Existing setup is expensive or protocols cannot be guaranteed to achieve
difficultto use, wireless mobile users may high end-to-end throughput and end-to-end
silent be able to communicate through the delay.
3.1 Disadvantages of Existing System
1. Maximum of existing routing protocols, any path routing protocols, trust on link-
no substance single path routing protocols or quality aware routing metrics, such as link


transmission count-based metrics and link the wireless communication media into
broadcast time based metrics. reason.
2. Maximum of the existing routing

protocols do not take spatial reusability of
4 PROPOSED SYSTEM
In this work, we study two kinds of routing proposed to find the path with minimum
protocols, including single-path routing and total transmissioncount/time for delivering a
any path routing. The task of a single-path single packet, suchtransmission count/time
routing protocol is to select a cost minimizing protocols cannot besure
minimizing path, along which the packets tocomplete maximum end-to-end throughput
are delivered from the source node to the end-to-end delay. In this work, we say that
destination node. Just, anypath routing by carefully considering spatial reusability
appears as a new routing technique of the wireless communication media, we
exploiting the broadcast countryside of can greatly improve the end-to-end
wireless communication media to improve throughput and end-to-end delay in multi-
the end-to-end throughput end-to-end delay. hop wireless networks. To support our row,
It collections the rule of multiple fairly weak we propose spatial reusability-aware single-
paths to form a strong path, by greeting any path routing (SASR) and anypath routing
intermediate node who hears the packet to (SAAR) protocols, and compare them with
join in packet forwarding. In the difficult of existing single-path routing and any path
routing and multi-hop wireless networks, to routing protocols, respectively. Our
achieve high end-to-end andend-to-end assessment results show that our protocols
delay , it is key to find the greatest path significantly improve the end-to-end
from the source nonode. Although a large throughput compared with existing
number of routing protocols have stayed protocols. Specifically, for single-path


routing, the middle throughput gain is up to protocols is that lesseningthe overall number
60 percent, and for each source-destination of transmissions to deliver a singlepacket
pair,Wireless networks are an emergent new from a source node to a destination node
technology that will allow users to access does notautomatically maximize the end-to-
information and services electronically from end throughput and end-to-end delay.
anywhere. The foundation of multi-hop Firstly,most routing algorithms were built on
transmission in wireless networks is the min-hopcount metric, which is a metric that
placement of intermediate nodes to relay assumes perfect wirelesslinks and inclines to
packets from the source to the destination, in minimize the number of hops onthe path.
states where direct communication is not But, in the look ofdamage links in
possible due to power or interference wirelesssetting, protocols using min-hop
limitations. In wireless communication metric does notdo well because they may
network it is significant to carefully find include some unfortunate linkswith high loss
thehigh utility route in multi-hop wireless ratios. Most of existing routing protocols,no
networks, a largenumber of routing matter singlepath routing protocols or
protocols have been proposed for multihop anypath routingprotocols, trust on link-
wireless networks However, a fundamental quality aware routing metrics.
problemwith existing wireless routing
4.1 Advantages of Proposed System
1. We can achieve more significant end-to-

end throughput and end-to-end delay
advances below higher data rates.
5. MODULES
We have 2 main modules, 2. Anypath Routing Module
1. Single-path Routing Module Single-path Routing:The task of a single-

path routing protocol is to select a cost


minimizing path, lengthwisewhich the a strong path, by friendly any midwaynode
packets are brought from the source node to who overhears the packet to joinin packet
the destination node. advancing.
Anypath Routing:This unitcollections the

control of multiple justly weak paths to form
SASR Working:
Step 1: SASR, Select the high cost in given Step 4:From the selected pair node ,find
path. minimum cost is calculated.
Step 2: Establish path, Src to Dst using average cost +remaining cost=minimum
RREQ and RREP. cost
Step 3: Multiple pair of node can transmit a Step 5: Return minimum cost.
packet , when there is no non-interference
path.
Example:
Spatial Reusability:
Path 1:Src-B-C-D-Dst cost is 8.9
Path 2:Src-A-B-C-D-Dst cost is 9.7

6. SYSTEM CONFIGURATION
Hardware Configuration
Processor - Pentium 1V
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Software Configuration
Operating System - Ubuntu


Programming Language - C++,
Softerware - NS2.35
7. CONCLUSION
In this work, we have established that we an single-path routing, correspondingly. We

knowinglyimprove the end-to-end have also applied our protocols, and
throughput and end-to-end delay in multihop compared them with existing routing
wireless networks, by sensibly considering protocols. Evaluation results show that
spatial reusability of the wireless SASR achieves a throughput gain is up to
communication media. We have presented 62.7% .
protocols SASR for spatial reusability aware
References
[1] D. S. J. D. Couto, D. Aguayo, J. C. Bicket, and R. Morris, AHighthroughput path metric for
multi-hop wireless routing, in MOBICOM, 2003.ransmission cost minimizing routing de to the
destination.
[2] R. Draves, J. Padhye, and B. Zill, Routing in multi-radio, multi-hop wireless mesh
networks, in MOBICOM, 2004.
[3] R. P. Laufer, H. Dubois-Ferri`ere, and L. Kleinrock, Multirate anypath routing in wireless

mesh networks, in INFOCOM, 2009.
[4] H. Zhai and Y. Fang, Physical carrier sensing and spatial reuse in multirate and multihop
wireless ad hoc networks, in INFOCOM, 2006.
[5] S. Zhao, L. Fu, X. Wang, and Q. Zhang, Fundamental relationship between nodedensity and
delay in wireless ad hoc networks with unreliable links, in MOBICOM, 2011.

Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single Path Routing Protocol

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single Path Routing Protocol

Diunggah oleh

Hak Cipta:

Format Tersedia

IDL - International Digital Library Of

Technology & Research

International e-Journal For Technology And Research-2017