International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3063

Throughput and Power Aware Routing In
Wireless Mesh Network with Path Restoration
Sharankumar Huli
#1
, Sujata P Terdal
*2

#1
Department of Computer Science and Engineering, Poojya Doddapa Appa College of Engineering,
Gulbarga, Karnataka,
India.
*2
Department of Computer Science and Engineering, Poojya Doddapa Appa College of Engineering,
Gulbarga, Karnataka,
India.




Abstract Wireless Mesh networks will be dominant in the
next-generation wireless networks with the integration of
various wireless access networks. The deployment of various
wireless technologies in combination with the evolution of
mobile terminal with multiple network interfaces and the
development of internet-based applications has allowed the
user to have access to internet services anywhere at any time
from any network. In this kind of environment, where more
data packets are sent and received, quick routing and
alternate path selections are required. We propose a concept
that polls the existing routes from source to destination and
organize them based on throughput and power. Once a fault
is detected in the current session either by means of a node
failure or link quality degradation, the system switches to
the other available path. In case of absence of such a path, a
rerouting is initiated. Therefore the method combines the
path rerouting algorithm with a scheme that estimates paths
availability efficiently using link throughput and power.
Simulation results shows that proposed routing protocol has
overall gain of the network.

Index TermsWireless mesh network, throughput, power,
path, link.

I. INTRODUCTION
Wireless mesh network has emerged as a key
technology for next generation wireless networking
because of their advantages over other wireless network.
Wireless mesh network typically consists of mesh clients
and mesh routers with of the client having capability of
operating not only as a host but also as router. Based on
functionality of the nodes wireless mesh network can be
classified as infrastructure backbone, client backbone and
hybrid.
Current technologies vary widely in their bandwidth,
latencies, frequencies and media access method. Thus
routing protocols has been studied extensively in wireless
network design, these protocols are guided by two
essential requirements: 1. Maximize network throughput.
2. Path selection. However a different routing technique
exists in wireless mesh network. Various optimization
research techniques have been used for optimization in
such type of network.
Path restoration can be defined as transferring an on-
going session fromone node to another in heterogeneous
wireless network. Path restoration process can be defined
in two stages detection and execution. Detection process
includes detection of the link failure due to break down or
failure of nodes. Execution process includes search of
alternate path which has maximumthroughput and better
power and execute the transmission process. In
Restoration execution, the mobility management plays an
important role. To achieve seamless and fast Restoration,
the above two processes should be paid attention.
The simulation results shows that the routing packets
using throughput and maximumreceived power of the
link with path restoration has showed better results over
normal routing.
II. RELATED WORKS
To route the packets many routing metrics and routing
algorithms have been designed and implemented by many
researchers. [1] In this paper a quality aware routing
metric was proposed that considers modified expected
transmission time (mETX) and effective number of
transmissions (ENT) which works under different
channel condition to overcome the problem of channel
variability and average packet loss. [2] In this paper, a
routing metric known as weighted cumulative expected
time with load balancing (WCETT-LB) for wireless mesh
network. WCETT-LB provides congestion aware routing
and traffic splitting mechanism to achieve global load
balancing in the network. [3] In this paper WMN
backbone routers use multi-hop communication similarly
to ad hoc networks. On the other hand; mobile users
connect to the backbone via mesh routers that play the
role of access points. The backbone routers typically are
stationary, which permits routing metrics to model link
quality instead of simply using the number of hops.
Assuming that the common case application in WMNs is
Internet access, traffic is concentrated on links close to
the gateways Wireless mesh networks (WMNs) aimat
guaranteeing connectivity. WMNs build a multi-hop
wireless backbone to interconnect isolated local area
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3064

networks (LANs) and to extend backhaul access to users
not within range of typical access points. Backbone
routers are usually stationary, and mobile users roam
among them. [4] In this paper, a new routing metric for
load balancing in wireless mesh networks. This routing
metric is called expected transmission time load
balancing (ETT-LB) and this metric use expected
transmission time and bandwidth usage. [5] In this paper,
an Expected Forwarded Counter (EFW) which copes
behavior of the wireless mesh network. This metric uses
MAC layer for measurement of wireless link quality to
select most reliable and high performance path. [6] In this
paper, a survey on different kind of interference that
wireless mesh nodes experiences and also survey on
different routing metric of wireless mesh network. [7] In
this paper, the new link quality metric based on
maximumsustainable throughput, named Least Power for
Best Throughput (LPBT) which use the initial
configuration of a WMN to increase the average
throughput, while reducing the power consumption. [8] In
this paper, a path weight captures the available path
bandwidth information. The new technique guarantees
that each node makes a proper packet forwarding
decision, so that a data packet does traverse over the
intended path. The result showed that proposed path
weight outperforms existing path metrics in identifying
high-throughput paths. [9] In this paper, a routing
algorithm that combines the simulation of the path
rerouting algorithm with a dynamic path failure
importance sampling (DPFS) scheme to estimate path
availabilities efficiently.
III. THE PROPOSED ROUTING PROTOCOL
In this paper we propose, a routing method that is
based on the network throughput and maximumreceived
power with path restoration when failure of link occurs.
The throughput is measured as the number of bytes
delivered per unit time frame.

Throughput (T) =no of bytes delivered
(1)
Time (t)

Maximum received power is calculated as ratio of a
constant of transmitter and receiver that depends on
antenna gain and height which is denoted as P
0
and radius
of the node coverage R, which is termed as power
threshold which is denoted as P
t
.

Power threshold (P
t
) =P
0
/ R (2)

If the power threshold is less than 10% then link is said to
be failed. Based on throughput and power is as link
quality metric (Q
m
) is calculated as.

Quality metric (Q
m
) =T +P
t
(3)

This quality metric for each node is calculated and is
stored in link cache. When a node wants to send a data
then that node looks at the link cache for destination
route. First node broadcast the Route Request Packet to
its neighbors until it reaches the destination. When a node
receives a route request (RREQ) packet it will add link
quality metric for the link over which packet had arrived.
When a Source node receives route reply (RREP) packet,
it includes link quality information and node information.
The failure of a link can lead to the failure of a path.
When a path experiences a failure, the wireless mesh
network will attempt to reroute the affected path over
other links that are operational. The process of rerouting a
failed path in response to a failed link is called path
restoration.
Let the state of the bandwidth of the link at time t is
defined by
B (t) = {(B (1, t)..B (n, t)} (4)
The path routing matrix at time is given by P (t). Now,
suppose at time t+there is a link failure event rerouting
take place. The general function R() of the path
restoration algorithmis to determine a new path routing
matrix P(t
+
) based on P(t) subjected to bandwidth and
power.
P (t
+
) =R {P (t), B (t
+
)} (5)
When all links return back to an operational state, all
paths return to their initial routes once all links become
operational. The whole operation is illustrated in the Fig
1 as sequence diagrambelow.


Fig.1 Sequence diagram.



International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3065


IV. RESULT ANALYSIS
The simulation experiment was carried out in omnetpp
4.2.2 simulation. The simulation area is a square field of
800mx 800msize, where nodes are placed uniformly.
Throughput is the average rate of successful message
delivery over a communication channel. This data may be
delivered over a link, or pass through a certain network
node.

Fig 2 Throughput versus Number of nodes


Fig 3 Collision of packets versus Number of nodes

In fig 2, initially throughput is high for particular number
of nodes because there is less number of packet
collisions, which is as show in fig 3. As there is increase
in the number of node there is increase in the collision of
packets so there is decrease in the throughput. Therefore
network performs well when number of node is less for a
particular area. Thus seven is the optimal number of
nodes for considered simulation area.


Fig 3 SNIR versus speed

SINR is Signal to Interference plus Noise Ratio. SINR is
commonly used in wireless communication as a way to
measure the quality of wireless connections. Typically,
the energy of a signal fades with distance. In wireless
networks, this is commonly defined by path loss. SNIR is
calculated as
SINR =P / (I +N) (4)
Where P is signal power, I is interference power and N
is noise power. As show in fig 3, there is decrease in the
SNIR as there is increase in speed of nodes.
V. CONCLUSION
In this paper we proposed a new routing method that
uses throughput and power as routing metric with path
restoration for wireless mesh network. The basic
objective is to utilize the available bandwidth and to route
the packets to destination without any error or delay in
the transmission.
A simulation result shows a promising gain in the
proposed system and is able to route the packet with
overall gain of the system.
REFERENCES
[1] Can Emre Koksal , and Hari Balakrishnan, Quality-Aware
Routing Metrics for Time-Varying Wireless Mesh Networks,
IEEE2006.
[2] Liang Ma and Mieso K. Denko, A Routing Metric for Load-
Balancing in Wireless Mesh Networks, Department of
Computing and Information Science, International Conference on
Advanced Information Networking and Applications Workshops
IEEE 2007.
[3] Campista, M.E.M. et al., Routing Metrics and Protocols for
Wireless Mesh Networks, IEEE Netwoek, Vol. 22, Issue 1, pp.
6-12 (2008).
[4] Sooyeol Yang, Youngmi Baek, J unhyung Kim, Keuchul Cho and
Kijun Han Kyungpook, A Routing Metric for Load Balance in
Wireless Mesh Networks, National University Department,
Electrical Engineering and Computer Science, IEEE 2009
[5] Stefano Paris, Member, IEEE, Cristina Nita-Rotaru, Senior
Member, IEEE, Member, ACM, Fabio Martignon, Member,
0
10
20
30
40
50
2 4 6 8
d
B
Speed (m/s)
SNIR Vs Speed
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3066

IEEE, and Antonio Capone, Senior Member, Cross-Layer
Metrics for Reliable Routing in Wireless Mesh Networks, IEEE
2012
[6] G. Kalpana, D. Kumar, K. Ranjani, and G. SenthilKumar,
Interference Aware Routing Metrics for wireless Mesh Networks:
A Survey, International J ournal of Research and Reviews in
Wireless Communications, September 2011.
[7] Asitha U. Bandaranayake, Vaibhav Pandit and Dharma P.
Agrawal, LPBT: An Energy-Aware Link Quality Metric for
Wireless Mesh Networks, Agrawal School of Computing
Sciences and Informatics, globecom2012.
[8] Ronghui Hou, Member, IEEE, King-Shan Lui, Senior Member,
IEEE, Fred Baker, and J iandong Li, Senior Member, Hop-by-
Hop Routing in Wireless Mesh Networks with Bandwidth
Guarantees, February 2012.
[9] M. Naresh, M. Mahender, R. Rajesh, Simulation of Service
Availability and Restoration in Hybrid 4G Mesh Networks with
Bandwidth and Power Management, Assistant Professor Dept. of
ECE, J NIT, Hyderabad, India, (IJ CNWC), ISSN: 2250-3501
Vol.2, No4, August 2012.
[10] A. Spyropoulos, C.S. Raghavendra, Energy efficient
communications in ad hoc networks using directional antenna, in:
IEEE Annual Conference on Computer Communications
(INFOCOM), pp. 220228,2002.
[11] A. Spyropoulos, C.S. Raghavendra, Asymptotic capacity bounds
for ad hoc networks revisited: the directional and smart antenna
cases, in: IEEE Global Telecommunications Conference
(GLOBECOM), pp. 1216 1220,2003.
[12] A. Raniwala, K. Gopalan, T.c. Chiueh, Centralized channel
assignment and routing algorithms for multi-channel wireless
mesh networks, ACM Mobile Computing and Communications
Review, pp.50-65, 2004.
[13] Akyildiz, I.F., Wang, X. and Wang, W., Wireless Mesh
Networks: A Survey,'' Computer Networks J ournal (Elsevier),
March 2005.
[14] XUDONG WANG, KIYON, INC., A Survey on Wireless Mesh
Networks, IEEE Communications Magazine, Volume 43, Issue
9, Sept. 2005