polynomial time routing algorithm to identify shortest …
TRANSCRIPT
ISSN: 2347-971X (online) International Journal of Innovations in Scientific and ISSN: 2347-9728(print) Engineering Research (IJISER)
www.ijiser.com 204 Vol 4 Issue 10 OCT 2017/101
POLYNOMIAL TIME ROUTING ALGORITHM TO IDENTIFY SHORTEST PATH IN
A DISTRIBUTED WIRELESS NETWORKS
1Nethaji Kumar D,
2 L.Bharathi,
3 R Mahadevan
1PG Student/Department of ECE Excel Engineering College Komarapalayam, Sankari, Namakkal-637303
2Associate Professor/Dept of ECE Excel Engineering College Komarapalayam, Sankari, Namakkal-637303
Assistant Professor/Department of CSE Excel College of Engineering & Tech Komarapalayam, Sankari,
Namakkal-637303
Abstract: A hybrid wireless network has gained attention in the field of wireless technology due to its drastic high
performance of bringing together both mobile ad hoc network and infrastructure wireless network. In order to
provide network performance, it requires a dynamic data routing protocol which produces high capacity and
scalability. Many of the wireless networks just combine the ad hoc transmission mode along with wireless. This
acquires greater disadvantage of that exists in ad hoc transmission. This project proposes polynomial time routing
algorithm for distributed wireless network algorithm which provides the best way for channel selection and forward
the packet to correct destination with minimum routing cost. It also identifies the shortes t path between the source
and destination. It works by dividing the data stream into packets and forward them to other nodes in a distributed
way. It consumes full spatial reuse and also produces wireless gateway congestion by using cellular interface
method. Moreover, sending packets to all the nearest base station increases throughput and make use of complete
base station. Intensively it also decreases route discovery problem and maintenance problem. The proposed
algorithm considerably increases packet delivery ratio and decreases node to node delay with less communication
and computation. This method also appears to be effective for congestion control algorithm in load balancing
between two nodes.
Keywords: Adhoc network, Data rate, Hybrid wireless, Latency, Polynomial time algorithm.
1. INTRODUCTION:
In the recent years the significant research has made in
wireless network which includes mobile adhoc network
and infrastructure wireless network. The development
of hybrid wireless network has increased due to its high
performance and capacity.
Hybrid wireless network is a combination of both
infrastructure wireless network and mobile adhoc
network. In recent day’s hand-held devices such as
tablets, laptops, palm tops etc. have been a major
attraction of wireless devices. Since it has both
infrastructure interface and adhoc interface. Due to a
sharp increase in such devices we require a hybrid
transmission since structure in upcoming days.
Such a hybrid structure interactively combines the
essential attribute and overcome the drawbacks of
infrastructure wireless network and mobile adhoc
network. In a mobile adhoc network the data is
transmitted to its destination via intermediate nodes.
Since it is a self-configuring network there is no base
station which controls all other nodes. The packets are
moved in a multi hop manner from source to
destination.
The multihop routing requires On-Demand route
discovery, since the packets are transmitted in a
dynamic route path. It is an infrastructure wireless
network. So we cannot attain the consistency and
reliable data transfer. Because of this drawback the
mobile adhoc network are suitable for small area
probably line LAN for data transmission.
In our daily lives wireless communication plays an
inevitable role. These are s imply a cellular network
which is also infrastructure wireless network. It
communicates between nodes inter cell communication
with the help of internet access. It also integrates all
kind wireless devices into the network which supports
universal network connectivity and present computing
possible. This type of network has a base station and
ISSN: 2347-971X (online) International Journal of Innovations in Scientific and ISSN: 2347-9728(print) Engineering Research (IJISER)
www.ijiser.com 205 Vol 4 Issue 10 OCT 2017/101
controls all other encircled nodes. The data is
transferred through base station from one node to
another; it is also called as one hop transmission. Since
the packet is passed from one node to another node is
single hop. It provides high reliability and channel
efficiency and used for long distance communication. It
suffers from high power consumption and in case of
base station failure the data transfer is interrupted until
another base station is fixed.
To increase throughput capacity of a network, a
hybrid wireless network combines both an
infrastructure wireless network and mobile adhoc
network to increase their advantage and overcome their
short comings. In wireless network a routing protocol
determine the throughput capacity of a network in data
transmission.
Therefore it is require choosing an efficient routing
protocol that increases the throughput in a network. At
present, routing protocols combines simply the cellular
transmission mode and adhoc transmission mode which
inherits the disadvantage present and consists ably
degrades the efficiency of a network.
Multihop routing protocol forwards a message to
mobile gateway which is very closes to base station
thus having a maximum bandwidth. The maximum
throughput can be achieved by forwarding the packets
from mobile gateway to base station which acts as a
bridge to connect both infrastructure and mobile adhoc
network.
When we combine adhoc transmission mode with
infrastructure wireless network which inherits the
problem given below:
1. Increased Overload: When we use mobile adhoc
network a medium access protocol is required to
discover route and further a hand shaking process
is also used which increases overload in the
network.
2. A mobile gateway can acts as a source of
transmitting data to various other nodes. In most of
the cases the data traffic goes through the same
node which is already predicted this increases
flooding. In addition to that the route discovery
problem occurs such as leaving the other node
unutilized. Thus the transmission rate severely
drops which leads to congestion.
3. Less Reliability: When mobile adhoc network is
used for long distance communication noise
interference and neighbor node interference occurs
during multihop transmission process, which
increases data drop rate further leads to low
reliability.
In addition to than in long range communication path
breakdown happens dynamically.
The fore mentioned problem occurs in hybrid
wireless network. The mobile nodes can choose
different base station while moving, Taking this as
shown in the picture below:
A source node divide a message into number of
segments and each segment is forwarded to neighbor
node. The quality of service can be achieved in two
ways either by direct transmission or by rely
transmission based on their needs anyone transmission
is chosen and segment is forwarded. In destination the
segments are rearranged in original order.
In PTR the time is limited based on the user needs
and capacity of the data if also ensures traffic
congestion between two base stations by using
congestion control algorithm. It has the following
advantages:
1. Less Overhead: The route discovery and
maintenance problem in adhoc transmission is
eliminated by using PTR.
2. Hotspot Abatement: It decreases traffic congestion
by using full spatial resources available in the
channel.
3. Increased Reliability: Since we have time limit the
data is passed within small hop path.
4. Therefore there is less number of noise and other
interferences. Thus decreases packet drop rate and
increases reliability.
2. METHO DO LO GY:
The proposed algorithm is a combination of various
algorithms such as SPF, Bellmen Ford etc… the
algorithms used are discussed below:
2.1 Shortest Path First
In this algorithm the node senses the neighbor node
continuously and calculates the distance between the
two nodes and updates the routing information.
Here the data packets are transmitted to nearest
node based on the information available in the routing
table. The packed then passed to other neighbor node
which has a least distance or smallest path. By
ISSN: 2347-971X (online) International Journal of Innovations in Scientific and ISSN: 2347-9728(print) Engineering Research (IJISER)
www.ijiser.com 206 Vol 4 Issue 10 OCT 2017/101
transmitting the packets only by shortest path from
source to destination, achieves the reduction in time.
The diagram shows the shortest path first
implementation
Figure 2.1 Networks before SPF
After implementation of SPF the shortest route is
calculated and the packets are channelized through that
node. The implementation after SPF is shown in Fig 2.2
2.2Bellman Ford Algorithm:
Another alternate algorithm to find the shortest path of
any network is Bellman Ford. It is used to find the
shortest distance between source vertex and destination
by calculating its weight.
It is an weighted graph, where a network is
described by (e,w) , in that ‘e’ denotes the edge
between two nodes and ‘w’ denotes the weight. If a
network contains n nodes then its shortest path is
obtained for n-1 nodes because shortest path couldn’t
have a cycle.
Figure 2.2 Networks before SPF
The implementation is shown below:
1: INITIALIZE-SOURCE (G,S)
2: for I = 1 to |G.V| - 1
3: for each edge (i,j) ∈ G.E
4: RELAX (i,d,W)
5: for each edge (i,d) ∈ G.E
6: if d.d > i.d + w (i,d)
7: return FALSE
8: return TRUE
3.PO LYNO MIAL TIME RO UTING ALGO RITHM:
The execution time of any algorithm is determined by
its complexity called time complexity. It is generally
denoted by various notations preferably by big O
notations.
The complexity of algorithm increases when the
node in a network increases . It is denoted by ‘n’. The
performance of an algorithm varies depending on the
number of input and operations performed on that.
Any algorithm is said to be polynomial time if the
running time of an algorithm is always greater or called
upper bound. In such case to decrease the latency we
perform sorting on the input by using graph matching
or by selection sort.
In this proposed method an idea of polynomial
time is been imposed to routing methodology to
decrease the latency time and also to decrease the
congestion in a network. It uses modern routing
ISSN: 2347-971X (online) International Journal of Innovations in Scientific and ISSN: 2347-9728(print) Engineering Research (IJISER)
www.ijiser.com 207 Vol 4 Issue 10 OCT 2017/101
methodology which is capable of joining two
algorithms such as next hop and multivariate algorithm.
By introducing polynomial time algorithm we provide
optimality to network. This algorithm shares same
running time as shortest path first algorithm and can be
used for deployment of any hybrid network.
The pseudo code for polynomial time algorithm is
given below
Algorithm 2: Polynomial Time Rouiting
1: for i := 0 to I do
2: d[v; c] := ∞, Φ[v; c] := null,
∀ v ∈ V . d[s; c] := 0.
3: end for
4: for c := 0 to C do
5: for each (u, v) ∈ E s.t. κ(u, v) > 0 and
b , c − κ(u, v) ≥ 0 do
6: κ(u, v) ≥ 0 do
7: d[v; c] := d[u; b] + δ(u, v), Φ[v; c] := u.
8: end if
9: end for
10: Create a graph with G(v,e,W)
11: Use Dijkstra’s shortest path algorithm
to find the shortest path as below
12: for all v ∈ V do
13: Let d′[v; c] denote the weight
of the shortest s–v path in G Let Φ′[v; c]
denote the shortest s–v path in c.
14: if d[v; c] > d′[v; c] then
15: d[v; c] := d′[v; c], Φ[v; c] := Φ′[v; c].
16: end if
17: end for
18: if (d[t; c] ≤ D) then
19: return FEASIBLE
20: end if
21: end for
22: return INFEASIBLE. STOP
4. PERFORMANCE EVALUATIONL:
This section describes the performance of polynomial
time routing algorithm through NS2 Simulator. In this
simulation the graph is plotted between the various
nodes to show the throughput, delay performance level
and network delay.
Figure 2.3: Throughput Of A Network And
Comparison Between PTR, Two Hop And AODV
The above comparison shows the increased throughput
level when compared to other algorithms.
Figure 2.4: Delay Performance Comparison
between PTR, Two hop And AODV
The above comparison shows the increased delay
performance level when compared to other algorithms
Fig 2.5 Network Delay Comparison Between
PTR, Two hop And AODV
ISSN: 2347-971X (online) International Journal of Innovations in Scientific and ISSN: 2347-9728(print) Engineering Research (IJISER)
www.ijiser.com 208 Vol 4 Issue 10 OCT 2017/101
The above comparison shows the decreased network
delay when compared to other algorithms
5 .CONCLUS IONS :
In hybrid wireless network combines both adhoc and
infrastructure wireless networks which has greater
disadvantage like network delay, Throughput, Delivery
performance etc. In wireless technology the network
performance is achieved by using a dynamic data
routing protocol which produce high capacity and
scalability. In Distributed three hop routing the data is
divided into segment and transmit each segment in a
distributed manner which covers wide spread area of a
base station but the segment is transferred from source
to destination in a three hop manner. This considerably
increases the packet delay and also increases the routing
cost. The DTR also decreases the efficiency of the
network by searching the next base station which also
increases time delay. The proposed Polynomial Time
Routing algorithm levitates the disadvantages in the
existing system by using minimum shortest routing path
between two nodes. It proposes that polynomial time
routing algorithm can improve throughput, delivery
performance and efficiency and decreases delay
between wireless networks.
REFERENCES
1 . H Luo, R. Ramjee, P. Sinha, L. Li, and S. Lu. Ucan: A
unified cell and ad-hoc network architecture. In Proc. of
MOBICOM, 2003.
2 . P. K. McKinley, H. Xu, A. H. Esfahanian, and L. M.
Ni. Unicast-based multicast communication in
wormhole-routed direct net- works. TPDS, 1992.
3 . H. Wu, C. Qiao, S. De, and O. Tonguz. Integrated cell
and ad hoc relaying systems: iCAR. J-SAC, 2001.
4 . Y. H. Tam, H. S. Hassanein, S. G. Akl, and R.
Benkoczi. Optimal multi-hop cellular architecture for
wireless communications. In Proc. of LCN, 2006.
5 . Y. D. Lin and Y. C. Hsu. Multi-hop cellular: A new
architecture for wireless communications. In Proc. of
INFOCOM, 2000.
6 . P. T. Oliver, Dousse, and M. Hasler. Connectivity in ad
hoc and hybrid networks. In Proc. of INFOCOM, 2002.
7 . E. P. Charles and P. Bhagwat. Highly dynamic
destination sequenced distance vector routing (DSDV)
for mobile computers. In Proc. of SIGCOMM, 1994.
8 . C. Perkins, E. Belding-Royer, and S. Das. RFC
3561: Ad hoc on demand distance vector (AODV)
routing. Technical report, Internet Engineering Task
Force, 2003.
9 . D. B. Johnson and D. A. Maltz. Dynamic source
routing in ad hoc wireless networks. IEEE Mobile
Computing, 1996.
1 0 . V. D. Park and M. Scott Corson. A highly adaptive
distributed routing algorithm for mobile wireless
networks. In Proc. of INFOCOM, 1997.
1 1 . R. S. Chang, W. Y. Chen, and Y. F. Wen. Hybrid
wireless network protocols. IEEE Transaction on
Vehicular Technology, 2003.
1 2 . G. N. Aggelou and R. Tafazolli. On the relaying
capacity of next- generation gsm cellular networks.
IEEE Personal Communications Magazine, 2001
1 3 . T. Rouse, I. Band, and S. McLaughlin. Capacity and
power investigation of opportunity driven multiple
access (ODMA) networks in TDD-CDMA based
systems. In Proc. of ICC, 2002.
1 4 . H. Y. Hsieh and R. Sivakumar. On Using the Ad-hoc
Network Model in Wireless Packet Data Networks. In
Proc. of MOBIHOC, 2002.
1 5 . L. M. Feeney, B. Cetin, D. Hollos, M. Kubisch, S.
Mengesha, and H. Karl. Multi-rate relaying for
performance improvement in ieee 802.11 wlans. In
Proc. of WWIC, 2007.
1 6 . J. Cho and Z. J. Haas. On the throughput
enhancement of the downstream channel in cellular
radio networks through multihop relaying. IEEE JSAC,
2004.