International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81

A Distributed Three-hop Routing Protocol to Increase the

Capacity of Hybrid Wireless Networks
K. Sushma1, Y. Vamsidhar2
M. Tech Student, Dept of CSE, Amrita Sai Institute of Science and Technology, Vijayawada.
2
Professor, Dept of CSE, Amrita Sai Institute of Science and Technology, Vijayawada.
Email: kilarisushma@gmail.com, asistcsehod@gmail.com
Abstract: Hybrid wireless networks combining the compensation of both mobile ad-hoc networks and
communications wireless networks have been getting enlarged awareness due to their ultra-high concert. An
efficient statistics steering practice is central in such networks for high network competence and scalability.
However, most steering protocols for these networks plainly combine the ad-hoc spread mode with the cellular
spread mode, which inherits the drawbacks of ad-hoc communication. This paper presents a Distributed Threehop Routing protocol (DTR) for hybrid wireless networks. To take full improvement of the extensive base
stations, DTR divides a communication data flow into segments and transmits the segments in a dispersed
manner. It makes full spatial reuse of a scheme via its high tempo ad-hoc boundary and alleviates mobile
opening jamming via its cellular boundary. In addition, distribution segments to a numeral of base stations
concurrently increases throughput and makes full use of prevalent base stations. In adding, DTR significantly
reduces above your head due to short path lengths and the abolition of route detection and maintenance. DTR
also has a blocking control algorithm to avoid overfilling base stations. Conjectural analysis and imitation
results show the advantage of DTR in judgment with other routing protocols in terms of throughput capacity,
scalability and mobility resilience. The outcome also show the efficiency of the blocking control algorithm in
complementary the load between base stations.
1

Index Terms: Hybrid wireless networks, Routing algorithm, Load balancing, Congestion control
1.

INTRODUCTION
Over the earlier period, wireless networks
together with infrastructure wireless networks and
mobile ad-hoc networks (MANETs) have concerned
significant research interest. The mounting craving to
increase wireless complex capacity for high
performance applications has encouraged the
maturity of hybrid wireless networks. A hybrid
wireless network consists of mutually a
transportation wireless network and a mobile ad-hoc
network. Wireless devices like smart-phones, tablets
and laptops, have both a transportation interface and
an ad-hoc interface. As the amount of such
diplomacy has been growing sharply in recent years,
a hybrid communication arrangement will be broadly
used in the close to future. Such a arrangement
synergistically combines the innate recompense and
defeat the disadvantages of the infrastructure
wireless networks and mobile ad-hoc networks. In a
mobile ad-hoc network, with the absence of a middle
control infrastructure, data is routed to its destination
through the intermediate nodes in a multi-hop
manner. The multi-hop routing needs on-demand
route discovery or route maintenance. Since the
messages are transmitted in wireless channels and
through dynamic routing paths, mobile ad-hoc
networks are not as reliable as infrastructure wireless
networks. Furthermore, because of the multi-hop
transmission feature, mobile ad-hoc networks are
only suitable for local area data transmission. The
infrastructure wireless network (e.g. cellular
network) is the major means of wireless
communication in our daily lives. It excels at intercell communication (i.e., communication between
nodes in different cells) and Internet access. It makes

possible the support of universal network

connectivity and ubiquitous computing by integrating
all kinds of wireless devices into the network. In an
infrastructure network, nodes communicate with
each other through base stations (BSes). Because of
the long distance one-hop transmission between
BSes and mobile nodes, the infrastructure wireless
networks can provide higher message transmission
reliability and channel access efficiency, but suffer
from higher power consumption on mobile nodes and
the single point of failure problem. A hybrid wireless
network synergistically combines an infrastructure
wireless network and a mobile adhoc network to
leverage their advantages and overcome their
shortcomings, and finally increases the throughput
capacity of a wide-area wireless network. A routing
protocol is a critical component that affects the
throughput capacity of a wireless network in data
transmission. Most current routing protocols in
hybrid wireless networks
simply combine the
cellular transmission mode (i.e. BS transmission
mode) in infrastructure wireless networks and the adhoc transmission mode in mobile ad-hoc networks .
That is the protocols use the multi-hop routing to
forward a message to the mobile gateway nodes that
are closest to the BSes or have the highest bandwidth
to the BSes. The bandwidth of a channel is the
maximum throughput (i.e., transmission rate in
bits/s) that can be achieved. The mobile gateway
nodes then forward the messages to the BSes,
functioning as bridges to connect the ad-hoc network
and the infrastructure network. However, direct
combination of the two transmission modes inherits
the following problems that are rooted in the ad-hoc

IJAEM 040315 Copyright @ 2015 SRC. All rights reserved.

A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks

transmission mode Low reliability. Dynamic and

long routing paths lead to unreliable routing. Noise
interference andneighbor interference during the
multi-hop transmission process cause a high data
drop rate. Long routing paths increase the probability
of the occurrence of path breakdown due to the
highly dynamic nature of wireless ad-hoc networks.
These problems become an obstacle in achieving
high throughput capacity and scalability in hybrid
wireless networks. Considering the widespread BSes,
the mobile nodes have a high probability of
encountering a BS while moving. Taking advantage
of this feature, we propose a Distributed Three-hop
Data Routing protocol (DTR). In DTR, as shown in
Figure 1 (b), a source node divides a message stream
into a number of segments. Each segment is sent to a
neighbor mobile node. Based on the QoS
requirement, these mobile relay nodes choose
between direct transmissions or relay transmission to
the BS. In relay transmission, a segment is forwarded
to another mobile node with higher capacity to a BS
than the current node. In direct transmission, a
segment is directly forwarded to a BS. In the
infrastructure, the segments are rearranged in their
original order and sent to the destination. The
number of routing hops in DTR is confined to three,
including at most two hops in the ad-hoc
transmission mode and one hop in the cellular
transmission mode. To overcome the aforementioned
shortcomings, DTR tries to limit the number of hops.
The first hop forwarding distributes the segments of
a message in different directions to fully utilize the
resources, and the possible second hop forwarding
ensures the high capacity of the forwarder. DTR also
has a congestion control algorithm to balance the
traffic load between the nearby BSes in order to
avoid traffic congestion at BSes. Using self-adaptive
and distributed routing with high speed and shortpath ad-hoc transmission, DTR significantly
increases the throughput capacity and scalability of
hybrid wireless networks by overcoming the three
shortcomings of the previous routing algorithms. It
has the following features: _ Low overhead. It
eliminates overhead caused by route discovery and
maintenance in the ad-hoc transmission mode,
especially in a dynamic environment. _ Hot spot
reduction. It alleviates traffic congestion at mobile
gateway nodes while makes full use of channel
resources through a distributed multi-path relay.
High reliability. Because of its small hop path length
with a short physical distance in each step, it
alleviates noise and neighbor interference and avoids
the adverse effect of route breakdown during data
transmission. Thus, it reduces the packet drop rate
and makes full use of special reuse, in which several
source and destination nodes can communicate
simultaneously without interference. The rest of this
paper is organized as follows. Section 2 presents a
review of representative hybrid wireless networks
and multi-hop routing protocols. Section 3 details the

DTR protocol, with an emphasis on its routing

methods, segment structure, and BS congestion
control. Section 4 theoretically analyzes the
performance of the DTR protocol. Section 5 shows
the performance of the DTR protocol in comparison
to other routing protocols. Finally, Section 6
concludes the paper.
2. RELATED WORK
In order to increase the capacity of hybrid wireless
networks, various routing methods with different
features have been proposed. One group of routing
methods integrate the ad-hoc transmission mode and
the cellular transmission mode. Dousse et al built a
Poisson Boolean model to study how a BS increases
the capacity of a MANET. Lin et al. proposed a
Multihop Cellular Network and derived its
throughput. Hsieh et al. investigated a hybrid IEEE
802.11 network architecture with both a distributed
coordination function and a point coordination
function. Luo et al. proposed a unified cellular and
ad-hoc
network
architecture
for
wireless
communication. Cho et al. studied the impact of
concurrent transmission in a downlink direction (i.e.
from BSes to mobile nodes) on the system capacity
of a hybrid wireless network. In, a node initially
communicates with other nodes using an ad-hoc
transmission mode, and switches to a cellular
transmission mode when its performance is better
than the ad-hoc transmission. The above methods are
only used to assist intra-cell ad-hoc transmission
rather than inter-cell transmission. In inter-cell
transmission, a message is forwarded via the ad-hoc
interface to the gateway mobile node that is closest to
or has the highest uplink transmission bandwidth to a
BS. The gateway mobile node then forwards the
message to the BS using the cellular interface.
However, most of these routing protocols simply
combine routing schemes in ad-hoc networks and
infrastructure networks, hence inherit the drawbacks
of the ad-hoc transmission mode as explained
previously. DTR is similar to the Two-hop
transmission protocol in terms of the elimination of
route maintenance and the limited number of hops in
routing. In two-hop, when a nodes bandwidth to a
BS is larger than that of each neighbor, it directly
sends a message to the BS. Otherwise, it chooses a
neighbor with a higher channel and sends a message
to it, which further forwards the message to the BS.
DTR is different from Two-hop in three aspects.
First, Two-hop only considers the node transmission
within a single cell, while DTR can also deal with
inter-cell transmission, which is more challenging
and more common than intra-cell communication in
the real world. Second, DTR uses distributed
transmission involving multiple cells, which makes
full use of system resources and dynamically
balances the traffic load between neighboring cells.
In contrast, Two-hop employs single-path
transmission. There are other methods proposed to

International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81

K. Sushma, Y. Vamsidhar

improve routing performance in hybrid wireless

networks. Wu et al. proposed using ad-hoc relay
stations to dynamically relay traffic from one cell to
another in order to avoid traffic congestion in BSes.
Li et al. surveyed a number of multi-hop cellular
network (MCN) architectures in literature, and
compared and discussed methods to reduce the cost
of deployment for MCNs. The work in investigates
how to allocate the bandwidth to users to improve the
performance of hybrid wireless networks.
Thulasiraman et al. further considered the wireless
interference in optimizing the resource allocation in
hybrid wireless networks. The work in proposes a
coalitional game theory based cooperative packet
delivery scheme in hybrid wireless networks There
are also some works that study radio frequency
allocation for direction transmission and relay
transmission in hybrid wireless networks. These
works are orthogonal to our study in this paper and
can be incorporated into DTR to further enhance its
performance. The throughput capacity of the hybrid
wireless network under different settings has also
been an active research topic in the hybrid wireless
network. The works in have studied the throughput
of hybrid network with n nodes and m stations. Liu et
al. theoretically studied the capacity of hybrid
wireless networks under an one-dimensional network
topology and a two dimensional strip topology.
Wang et al. studied the multicast throughput of
hybrid wireless networks and designed an optimal
multicast strategy based on deduced throughput.
3.

DISTRIBUTED THREE-HOP ROUTING

PROTOCOL

3.1Assumption and Overview SinceBSes are

connected with a wired backbone, we assume that
there are no bandwidth and power constraints on
transmissions between BSes. We use intermediate
nodes to denote relay nodes that function as
gateways connecting an infrastructure wireless
network and a mobile ad-hoc network.We assume
every mobile node is dual-mode; that is, it has ad-hoc
network interface such as a WLAN radio interface
and infrastructure network interface such as a 3G
cellular interface.
3.2Uplink Data Routing
A long routing path will lead to high overhead, hot
spots and low reliability. Thus, DTR tries to limit the
path length. It uses one hop to forward the segments
of a message in a distributed manner and uses
another hop to find high-capacity forwarder for high
performance routing. As a result, DTR limits the path
length of uplink routing to two hops in order to avoid
the problems of long-path multi-hop routing in the
ad-hoc networks. Specifically, in the uplink routing,
a source node initially divides its message stream
into a number of segments, then transmits the
segments to its neighbor nodes. The neighbor nodes

forward segments to BSes, which will forward the

segments to the BS where the destination resides.
Below, we first explain how to define capacity, then
introduce the way for a node to collect the capacity
information from its neighbors, and finally present
the details of the DTR routing algorithm.
3.3 Downlink Data Routing and Data
Reconstruction
As mentioned above, the message stream of a source
node is divided into several segments. After a BS
receives a segment, it needs to forward the segment
to the BS, where the destination node resides (i.e.,
the destination BS). We use the mobile IP protocol
[32] to enable BSes to know the destination BS. In
this protocol, each mobile node is associated with a
home BS, which is the BS in the nodes home
network, regardless of its current location in the
network. The home network of a node contains its
registration information identified by its home
address, which is a static IP address assigned by an
ISP. In a hybrid wireless network, each BS
periodically emits beacon signals to locate the mobile
nodes in its range. When a mobile node mi moves
away from its home BS, the BS where mi currently
resides detects mi and sends its IP address to the
home BS of mi. When a BS wants to contact mi, it
contacts the home BS of mi to find the destination
BS where mi currently resides at. may not be the
most up-to-date destination BS since destination
mobile nodes switch between the coverage regions of
different BSes during data transmission to them. For
instance, data is transmitted to BS Bi that has the
datas destination, but the destination has moved to
the range of BS Bj before the data arrives at BS Bi.
To deal with this problem, we adopt the Cellular IP
protocol for tracking node locations. With this
protocol, a BS has a home agent and a foreign agent.
The foreign agent keeps track of mobile nodes
moving into the ranges of other BSes. The home
agent intercepts in-coming segments, reconstructs the
original data, and re-routes it to the foreign agent,
which then forwards the data to the destination
mobile node. After the destination BS receives the
segments of a message, it rearranges the segments
into the original message and then sends it to the
destination mobile node. A vital issue is guaranteeing
that the segments are combined in the correct order.
For this purpose, DTR specifies the segment
structure format. Each segment contains eight fields,
including: (1) source node IP address (denoted by S);
(2) destination node IP address (denoted by D); (3)
message sequence number (denoted by m); (4)
segment sequence number (denoted by s); (5) QoS
indication number (denoted by q); (6) data; (7) length
of the data; and (8) checksum. Fields (1)-(5) are in
the segment head.

International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81

A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks

4.

SYSTEM ANALYSIS

4.1EXISTING SYSTEM
Though no interference exists between intra-cell,
uplink, and downlink traffics, interference exists
between the same type of traffic in a cell and
between different cells. Unlike most existing routing
protocols, DTR produces significantly lower
overhead by eliminating route discovery and
maintenance. In addition, its distinguishing
characteristics of short path length, short-distance
transmission, and balanced load distribution provide
high routing reliability and efficiency.
4.2PROPOSED SYSTEM In organize to enlarge
the competence of hybrid wireless networks; various
routing methods with dissimilar facial appearance are
implemented.
Proposed a Multi-hop Cellular
Network and derived its throughput. Hsieh
investigated hybrid IEEE 802.11 network structural
design with both a scattered synchronization purpose
and a point management function. Proposed a
integrated cellular and ad-hoc network architecture
for wireless communication. Intentional the collision
of concurrent transmission in a downlink direction
(i.e. from BSes to mobile nodes) on the system
capability of a hybrid wireless network. There are
additional methods projected to improve routing
concert in hybrid wireless networks.
5.

SYSTEM ARCHITECTURE

line rate and will stay unchanged even if scales to

more than thousand external ports, thus guarantees
system scalability.
6.2 DTR:
Through lay-aside Buffer Management
module, all packets are virtually queued at the output
according to the flow group and the priority class in a
hierarchical manner. The output scheduler fetches
packets to the output line using information provided
by. Packets in the same flow will be virtually
buffered in the same queue and scheduled in
discipline. Hence, intra flow packet departure orders
holds their arriving orders at the multiplexer.
Central-stage parallel switches adopt an outputqueued model. By Theorem, we derive packet delay
bound at first stage. We then study delay at secondstage switches. Define native packet delay at stage m
of an be delay experienced at stage m on the
condition that all the preceding stages immediately
send all arrival packets out without delay.
6.3Wireless Network:
We consider the Multistage Multi-plane
Clos-network based switch by Chao et a . It is
constructed of five stages of switch modules with
top-level architecture similar to a external
input/output ports. The first and last stages Clos are
composed of input de multiplexers and output
multiplexers, respectively, having similar internal
structures as those in PPS. Stages 2-4 of M2Clos are
constructed by parallel switching planes; however,
each plane is no longer formed by a basic switch, but
by a three-stage Clos Network to support large port
count. Inside each Clos Network, the first stage is
composed by k identical Input Modules. Each IM is
an packet switch, with each output link connected to
a Central Module. Thus, there are a total of m
identical in second stage of the Close networks.
7.

6.

MODULE DESCRIPTION

6.1 Load-Balancing:
Interflow packet order is natively preserved
besetting slicing threshold to the delay upper bound
at .Any two packets in the same flow slice cannot be
disordered as they are dispatched to the same
switching path where processing is guaranteed; and
two packets in the same flow but different flow slices
will be in order at departure, as the earlier packet will
have depart from before the latter packet arrives. Due
to the fewer number of active flow slices, the only
additional overhead in, the hash table, can be kept
rather small, , and placed on-chip to provide ultrafast
access speed. This table size depends only on system

INPUT DESIGN AND OUTPUT DESIGN

7.1INPUT DESIGN The input design is the link

between the information system and the user. It
comprises the developing specification and
procedures for data preparation and those steps are
necessary to put transaction data in to a usable form
for processing can be achieved by inspecting the
computer to read data from a written or printed
document or it can occur by having people keying
the data directly into the system. The design of input
focuses on controlling the amount of input required,
controlling the errors, avoiding delay, avoiding extra
steps and keeping the process simple. The input is
designed in such a way so that it provides security
and ease of use with retaining the privacy. Input
Design considered the following things:
What data should be given as input?
How the data should be arranged or
coded?

International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81

K. Sushma, Y. Vamsidhar

The dialog to guide the operating

personnel in providing input.
Methods for preparing input validations
and steps to follow when error occur.
OBJECTIVES
1. Input Design is the process of converting a useroriented description of the input into a computerbased system. This design is important to avoid
errors in the data input process and show the correct
direction to the management for getting correct
information from the computerized system.
2.It is achieved by creating user-friendly screens for
the data entry to handle large volume of data. The
goal of designing input is to make data entry easier
and to be free from errors. The data entry screen is
designed in such a way that all the data manipulates
can be performed. It also provides record viewing
facilities.
3. When the data is entered it will check for its
validity. Data can be entered with the help of screens.
Appropriate messages are provided as when needed
so that the user will not be in maize of instant. Thus
the objective of input design is to create an input
layout that is easy to follow
7.2OUTPUT DESIGN A quality output is one,
which meets the requirements of the end user and
presents the information clearly. In any system
results of processing are communicated to the users
and to other system through outputs. In output design
it is determined how the information is to be
displaced for immediate need and also the hard copy
output. It is the most important and direct source
information to the user.
Efficient and intelligent output design improves
the systems relationship to help user decisionmaking.
1. Designing computer output should proceed in an
organized, well thought out manner; the right output
must be developed while ensuring that each output
element is designed so that people will find the
system can use easily and effectively. When analysis
design computer output, they should Identify the
specific output that is needed to meet the
requirements. 2.Select methods for presenting
information. 3. Create document, report, or other
formats that contain information produced by the
system. The output form of an information system
should accomplish one or more of the following
objectives.
Convey information about past activities,
current status or projections of the
Future.
Signal important events, opportunities,
problems, or warnings.
Trigger an action.
Confirm an action.

CONCLUSION
Hybrid wireless networks have been getting
increasing concentration in recent years. A hybrid
wireless network combining a transportation wireless
network and a mobile ad-hoc network leverages their
compensation to increase the throughput capacity of
the system. Though, current hybrid wireless
networks simply unitethe direction-finding protocols
in the two types of networks for data communication,
which prevents them from achieving elevated
scheme capability. In this paper, we recommend a
Distributed Three-hop Routing (DTR) data routing
protocol that integrates the dual features of hybrid
wireless networks in the information broadcast
process. In DTR, a foundation node divides a
communication stream into segments and transmits
them to its mobile neighbors, which additional
forward the segments to their intention through a
transportation network. DTR restrictions the steering
path length to three and at all times arranges for
high-capacity nodes to advance data. Unlike most
obtainable routing protocols, DTR produces
considerably lower overhead by eliminating route
discovery and preservation. In addition, its individual
characteristics of short path length, short-distance
transmission, and balanced load allocation provide
high routing dependability and competence. DTR
also has a congestion control algorithm to avoid load
blocking in BSes in the case of disturbed traffic
distributions in networks. Conjectural analysis and
reproduction consequences show that DTR can
considerably advance the throughput capacity and
scalability of hybrid wireless networks due to its high
scalability, efficiency, and reliability and low
overhead.
REFERENCE
[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.
Unicastbased
multicast
communication in wormhole-routed direct
networks. 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

International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81

A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks

(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.
[10] V. D. Park and M. Scott Corson. A highly
adaptive distribute routing algorithm for mobile
wireless networks. In Proc. Of INFOCOM,
1997.
[11] R. S. Chang, W. Y. Chen, and Y. F. Wen.
Hybrid wireless network protocols. IEEE
Transaction on Vehicular Technology, 2003.
[12] G. N. Aggelou and R. Tafazolli. On the relaying
capacity of next generation gsm cellular
networks. IEEE Personal Communications
Magazine, 2001.

[13] T. Rouse, I. Band, and S. McLaughlin. Capacity

and power investigation of opportunity driven
multiple access (ODMA) networks in TDDCDMA based systems. In Proc. of ICC, 2002.
[14] H. Y. Hsieh and R. Sivakumar. On Using the
Ad-hoc Network Model in Wireless Packet Data
Networks. In Proc. of MOBIHOC, 2002.
[15] 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.
[16] J. Cho and Z. J. Haas. On the throughput
enhancement of the downstream channel in
cellular radio networks through multihop
relaying. IEEE JSAC, 2004.
[17] B. Liu, Z. Liu, and D. Towsley. On the capacity
of hybrid wireless networks. In Proc. of
INFOCOM, 2003.

International Journal of Applied Sciences, Engineering and Management

ISSN 2320 3439, Vol. 04, No. 03, November 2015, pp. 76 81