IJCST Vol. 2, Issue 3, September 2011
ISSN : 2229-4333(Print) | ISSN : 0976-8491(Online)
Mobile Ad-Hoc Networks Extensions to
Zone Routing Protocol
1
1,2,3
Anwar Mohd Mansuri, 2Mohd Imran Khan, 3Heena Sheikh
Dept. of Information Technology, Mahakal Institute of Technology, Ujjain, MP, India
Abstract
Secure communication, an important aspect of any networking
environment, is an especiallysignicant challenge in ad hoc
networks. The MANET paradism seeks to enable communication
across networks whose topology and membership can change
frequently. Its distinctive feature is that network nodes need to
collaborate with their peers in supporting the network functionality.
In such an environment, malicious or selfish nodes can disrupt
or even deny the communications of potentially any node within
the ad hoc networking domain. This is so, exactly because every
node in the network is not only entitled, but is in fact required,
to assist in the network establishment, the network maintenance,
and the network operation. Ad-Hoc Networks consistof peer-topeer communicating nodes that are highly mobile. As such, an
ad- hoc network lacks infrastructure and topology of the network
changes dynamically. The task of routing data from a source to
a destination in such a network is challenging. Several routing
protocols have been proposed for wireless ad-hoc networks.
Most of these protocols, however, presuppose the presence of
bi-directional links between the nodes in the network. In reality the
ad-hoc network may consist of heterogeneous nodes with different
power capabilities and hence, different transmission ranges.
When this is the case, a given node might be able to receive
the transmission of another given node but might not be able to
successfully transmit to the latter. Thus, unidirectional links are
formed. Most of the current routing protocols are unsuitable
for deployment when such unidirectional links are present. We
consider a routing protocol called the zone routingprotocol (ZRP)
that has been proposed for wireless ad-hoc networks with bidirectional links. The zone routing protocol employs a hybrid
proactive (table driven) and reactive (on- demand) methodology
to provide scalable routing in the ad-hoc network. However, in the
presence of unidirectional links some routes remain undiscovered
if ZRP is used. We propose extensions to ZRP to support its
deployment when unidirectional links are present. In particular,
we propose a query enhancement mechanism that recursively
builds partial routes to a destination.
service discovery protocols and architectures targeted to mobile
environments. Especially, the proliferation of Mobile Ad Hoc
Networks (MANETs) has introduced new requirements to service
discovery due to the inherent characteristics of these networks. It is
a collection of mobile computing devices equipped with wireless
network interfaces which can connect together dynamically to
create a multi-hop wireless network, without the requirement for
any pre-existing infrastructure. The mobility of the nodes makes
the topology of the network time-variant. The rate of change of
the network topology depends upon the velocity of the nodes. The
wireless network is characterized by low bandwidth links that
are subject to harsh conditions of fading and interference.
Thus, routing in such a network is difficult and challenging.
A plethora of routing protocols has been proposed for wireless
ad-hoc networks. These protocols may be mainly classified as
either proactive or reactive.
Keywords
ZRP, Ad-Hoc, Routing, Mobile networks,
proactive/reactive Routing.
I. Introduction
What is Ad-Hoc Networks: A wireless network that transmits from
computer to computer. Instead of using a central base station
(access point) to which all computers must communicate. This
peer-to-peer mode of operation can greatly extend the distance
of the wireless network. To gain access to the Internet, one of the
computers can be connected via wire or wireless to an ISP routing
from one node to another on such a “mesh” network typically
uses an on-demand routing protocol, such as PROACTIVE and
REACTIVE, which generates routing Information only when a
station initiates a transmission. In the past, much research effort
has been devoted on Service Discovery in static networks, like
the Internet The emergence of wireless communications and small
mobile computing devices has created the need for developing
w w w. i j c s t. c o m
Fig.1: Ad-Hoc (client to client)
II. Proactive
When proactive routing protocols are employed a node would
possess routing information to a destination before it would
actually need to route data to that destination For this purpose
routing tables are maintained. Route updates are exchanged
periodically to reflect the changes in topological information.
International Journal of Computer Science and Technology 369
IJCST Vol. 2, Issue 3, September 2011
TABLE DRIVEN
ISSN : 2229-4333(Print) | ISSN : 0976-8491(Online)
and repair, and neighbor detection.
B. Disadvantages
Development of ad-hoc routing protocols has been slow
because current operating systems do not provide adequate
direct system- services for their implementation.
Fig.2
Popular proactive routing protocols for ad-hoc networks
include
• Destination Sequenced Distance Vector (DSDV) Protocol
• Wireless Routing Protocol
• Source Tree Adaptive Routing (STAR) Protocol.
The proactive routing protocols usually require the maintainance
of routing tables and thus, in the dynamically changing mobile
ad- hoc network, nodes would need to exchange routing updates
periodically.This exchange of route updates would consume
bandwidth and if the network is large, these control messages
could contribute to a significant amount of overhead.
A. Advantages:
By continuously evaluating the known and attempting to
discover new routes, they try to maintain the most up-to-date
map of the Network. This allows them to efficiently forward
packets, as the route is known at the time when the packet arrives
at the node.
IV. Zone Routing Protocol
The Zone Routing Protocol (ZRP) was introduced in 1997 by
Haas and Pearlman. It is either a proactive or reactive protocol.
It is a hybrid routing protocol. It combines the advantages
from proactive (for example AODV) and reactive routing
(OLSR). It takes the advantage of pro-active discovery within
a node’s local neighborhood (Interzone Routing Protocol
(IARP)), and using a reactive protocol for communication
between these neighborhoods (Interzone Routing Protocol
(IERP)). The Broadcast Resolution Protocol (BRP) is responsible
for the forwarding of a route request. ZRP divides its network
in different zones. That’s the nodes local neighborhood. Each
node may be within multiple overlapping zones, and each zone
may be of a different size. The size of a zone is not determined
by geographical measurement. It is given by a radius of length,
where the number of hops is the perimeter of the zone. Each node
has its own zone.
III. Reactive
If on demand routing protocols are used, when data is to be
routed to a destination, a source node might be required to
initiate a search for the destination. If the network is large,
significant latency may be incurred before the destination
is found.
Fig.3 :
Reactive protocols determine the proper route only when
required, that is, when a packet needs to be forwarded. In this
instance, the node floods the network with a route request and
builds the route on demand from the responses it receives.
The scalability of both the table driven and the on demand
routing protocols is limited. Numerous on-demand routing
protocols have been proposed some of the on demand routing
protocols. They are
• Adaptive On Demand Distance Vector (AODV) protocol
• Dynamic Source Routing (DSR) Protocol
• Temporally Ordered Routing Algorithm (TORA)
A. Advantages
There are a number of implementations of the Ad-hoc Ondemand Distance Vector (AODV) routing protocol available for
the Linux platform. The AODV protocol consists of a number
of messages which it uses for routediscovery, route maintenance
370 International Journal of Computer Science and Technology
Fig. 4:
The Zone Routing Protocol (ZRP) provides a hybrid proactive/
reactive routing framework in an attempt to achieve scalability.
Each node would maintain routing tables which would only
offer routes to a destination if the destination were to be within
a certain maximum hop count (which is called the zone radius)
from the source node. If the destination were to be outside the
zone radius, the source node would invoke an on demand search
mechanism called border casting. Border casting provides an
efficient means for searching for a destination by sequentially
using the routing tables of the intermediate relay nodes.
Fig.5: Radius=2-Hop (node)
E, D, B, J, E and H are border-nodes
w w w. i j c s t. c o m
ISSN : 2229-4333(Print) | ISSN : 0976-8491(Online)
V. Extensions to the Zone Routing Protocols:
Zone routing protocol consists of the
• Intra Zone Routing Protocol (IARP) (proactivecomponent)
• Inter Zone Routing Protocol (IERF) (reactive Component)
A. Intra Zone Routing Protocol (IARP)
The IARP is responsible for maintaining information about some
nearby links and nodes. Every nodetransmits information about
its in bound neighbors to nodes within a restricted neighborhood
defined by the parameter called the Zone Radius. This information
is used by each node to compute its outbound tree, which
is the shortest path tree rooted at node to nodes from which the
previously mentioned transmission restricted to Zone Radius. The
nodes reachable by the computed outbound tree, define the node’s
zone. The goal of the IARP is to maintain an outbound tree to
some nearby nodes. In case of networks with only bi-directional
links, ZRP defines the zone as consisting of nodes which are within
ZONE-RADIUS hops.
IJCST Vol. 2, Issue 3, September 2011
VI. Conclusion
The mobile ad hoc networks have been a subject of quite a number
of investigations in recent years. Most of these investigations
have been motivated by the need to design an efficient routing
protocol for an ad hoc network. A good routing protocol needs
to provide reliability and energy efficiency with low control
overhead. To ensure reliability, load balancing and Quos, multipath
routing protocols have been proposed for MANET.
A. Advantages of ZRP
• One consisting of devices equipped with wireless interface
cards, which come together to form multi-hop wireless
networks dynamically and automatically.
• It tries to maintain the most up-to-date map of the
network.
• Time required sending messages is less.
• Easy to use by everyone.
• Easy to understand the mechanism.
• It requires less band width.
B. Disadvantages of ZRP
• Hacking the messages can take place.
• When the person is not in the area of zone can’t receive any
information.
• It is applicable to only Linux platform.
• Short latency for finding new routes.
Fig.6: IGRP
C. Real Time Application:
It is widely used in wire less technology such as
• Mobiles.
• Laptops.
• Wi-Fi connections.
• Blue tooth technology.
B. Inter Zone Routing Protocol (IERP) (reactive
component)
The IERP is the component that enables route computation when
the outbound tree maintained by the IARP of a node does not have
a path to the destination. Border casting, which refers to sendingthe route query by using a tree (border cast tree) to a set of nodes
(the border nodes), preferably towards the periphery of the zone,
is an important sub-component of IERP. The border nodes are
nodes that are known to have links to other nodes that the current
node cannot reach by means of its outbound tree. The border
nodes upon receiving a border cast message, repeat the same
procedure (as executed at the source), which involves checking
if a path to the destination exists within the node’s local routing
table and border casting again if a path to the destination is not
known locally. The intermediate nodes that initiate a border cast,
include their Unique identifiers in the route query packet before
forwarding it. Once the query reaches a node that knows a path
to the destination, it includes its identifier in the response packet,
and sends the response to the originator of the query. The list of
nodes that stamped the packet while it traversed its forward path
is used for identifying the reverse path via which a response
is sent to the source of the query. Border casting usually results
in an increase the number of query threads. Without implementing
mechanisms for controlling these query threads, deploying the
protocol could result in flooding the network with query messages.
This is highly inefficient in terms of the number of messages. Some
query control mechanisms have been adopted from the original
ZRP proposal and have been modified to function in the presence
of unidirectional links.
Reference
[1] D.B. Johnson, D.A. Maltz, J. Broch, "DSR: the dynamic
source routing protocol for multi-hop wireless ad hoc
networks", in: C.E. Perkins (Ed.), Ad hoc Networking,
Addison Wesley, 2000, pp. 139–172 (Chapter 5).
[2] C.E. Perkins, E.M. Royer, "Ad hoc on-demand distance
vector routing", in: Proceedings of the 2nd Annual IEEE
International Workshop on Mobile Computing Systems and
Applications, February 1999, pp. 90–100.
[3] N. Meghanathan, "Exploring the stability-energy
consumption-delay network lifetime tradeoff of mobile
ad hoc network routing protocols", Journal of Networks 3
(2) (2008) 17–28.
[4] E. Royer, C.E. Perkins, "Multicast operation of the adhoc on-demand distance vector routing protocol,’’ in:
Proceedings of the 5th ACM/ IEEE Annual Conference on
Mobile Computing and Networking, (MOBICOM), Seattle,
USA, August 1999, pp. 207–218.
[5] Zeng K, Ren K, Lou W. "Geographic on-demand disjoint
multipath routing in wireless ad hoc networks". In: Military
communications conference, MILCOM2005, p.1-7.
[6] Wang L, Jang S, Lee T-Y, "Redundant source routing for
real-time services in ad hoc networks". In: Proceedings of
IEEE international conference on mobile ad hoc and sensor
systems conference, Washington, DC, November, 2005.
[7] Liang Y, Midkiff SF. "Multipath Fresnel zone routing for
wireless ad hoc networks". In: Proceedings of the IEEE
wireless communications and networking conference, vol.
4, March 2005, p. 1958–63.
w w w. i j c s t. c o m
International Journal of Computer Science and Technology 371
IJCST Vol. 2, Issue 3, September 2011
[8] L. Wang, Y. Shu, M. Dong, L. Zhang, O.W.W.Yang, "Adaptive
multipath source routing in ad hoc networks", in: Proceedings
of IEEE International Conference onCommunications,vol.
3, June 2001, pp. 867–871.
[9] N.Wisitpongphan, O.K. Tonguz, "Disjoint multipath
source routing in ad hoc networks: transport capacity", in:
proceedings of IEEE 58th Vehicular Technology Conference,
vol l. 4, October 2003, pp. 2207–2211.
[10] X. Li, L. Cuthbert, "Stable node-disjoint multipath Routing
with low overhead in mobile ad hoc networks", in: Proceedings
of The IEEE Computer Society_12th Annual International
Symposium on Modeling, Analysis, and Simulation of
Computer and Telecommunications Systems, October 2004,
pp. 184–191.
[11] A.M.Abbas, B.N. Jain, "Path diminution in disjoint Multipath
routing for mobile ad hoc networks", in: Proceedings of 15th
IEEE International Symposium on Personal, Indoor and
Mobile Radio Communications, vol. 1, September 2004,pp.
130–134.
[12] F. Ducatelle, G.D. Caro, L.M. Gambardella, "Ant agents for
hybrid multipath routing in mobile ad hoc networks", in:
Proceedings of the Second Annual Conference on Wireless
on demand Network Systems and Services (WONS), January
2005.
[13] Y. Liang, S.F. Midkiff, "Multipath fresnel zone routing for
wireless ad hoc networks", in: Proceedings of 2005 IEEE
Wireless Communications and Networking Conference,
vol.4, March 2005, pp. 1958–1963.
[14] Huang X, Fang Y. "End-to-end delay differentiation by
prioritized multipath routing in wireless sensor Networks".
In: Military communications conference, MILCOM 2005,
vol. 2, p. 1277–83.
[15]Jing F, Bhuvaneswaran RS, Katayama Y, Takahashi
N.A "Multipath on-demand routing with path selection
probabilities for mobile ad hoc networks". In: Proceedings
of the international conference on wireless communications,
networking and mobile computing, 2005, vol. 2, p.
1145–8.
[16] Lee S-J, Gerla M. "SMR: split multipath routing with
maximally disjoint paths in ad hoc networks". Technical
report, Computer Science Department, University of
California, Los Angeles, August 2000.
[17] Li X, Cuthbert L. "Stable node-disjoint multipath routing with
low overhead in mobile ad hoc networks". In: Proceedings
of the IEEE computer society’s 12th annual international
symposium on modeling, analysis, and simulation of
computer and telecommunications systems (MASCOTS
2004), October 4–11, 2004, p. 184–91.
[18] Liang Y, Midkiff SF. "Multipath Fresnel zone routing for
wireless ad hoc networks". In: Proceedings of the IEEE
wireless communications and networking conference, vol.
4, March 2005, p. 1958–63.
372 International Journal of Computer Science and Technology
ISSN : 2229-4333(Print) | ISSN : 0976-8491(Online)
Anwar Mohd Mansuri received his B.E.
degree in Information Technology from
MIT, Mandsaur College, India, in 2009, and
pursuing M Teach-in Information Technology
from Mahakal Institute of Technology, Ujjain,
India. His research interests include MANET,
Data Mining, and Image Processing Computer
Networks.
Mohd Imran Khan received his B.E. degree in
Information Technology from MIT, Mandsaur
College, India., in 2008, and pursuing M Tech.
in Information Technology from Mahakal
Institute of Technology, Ujjain ,India. His
research interests include Image Processing,
Wireless Network, Web Mining, Computer
Network, and DBMS.
w w w. i j c s t. c o m