International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
An Efficient Backbone Aware Shortest Path
Selection Protocol in Zigbee Wireless Networks
Ms. S.Shoba#1, Mrs. S. Raja Rajeswari*2
#
Student,*Assistant Professor
Department of Computer Science and Engineering
Regional Centre of Anna University
Tirunelveli (T.N) India
Abstract— The zigbee tree routing is wide used in several
resource restricted devices and applications. Since it doesn’t need
any routing table and route discovery overhead to send a packet
to the destination. But the ZigBee tree routing has the elemental
limitation that a packet follows the tree topology. Therefore, it
cannot provide the optimum routing path. The shortcut tree
routing protocol that provides the close to best routing path also
as maintains the advantages of the ZigBee tree routing like no
route discovery overhead and low memory consumption. in a
very tree-structured ZigBee wireless network, nodes near the
basis of the tree (i.e., hot-spot nodes) could exhaust their power
sooner than those distant from the basis attributable to serious
hundreds on packet forwarding. This hot spot downside is
inherent in tree-structured networks and should demand
additional energy to live through failures of hot-spot nodes. The
backbone-aware topology formation (BATF) theme is planned to
alleviate the hot-spot downside. BATF utilizes power-rich nodes
to create a backbone tree that doesn't suffer from the new spot
downside. To prolong the period of time of a ZigBee network and
improve its knowledge assortment capability introduced a
backbone-aware topology formation (BATF) theme.
The reactive routing protocol in ZigBee is derived from
AODVjr which is one of the representative routing protocols
in MANET (Mobile Ad-hoc Networks).Similar with other
MANET routing protocols ZigBee reactive routing protocol
provides the optimal routing path for the arbitrary source and
destination pair through the on-demand route discovery. It
requires the route discovery process for each communication
pair, so the route discovery overhead and the memory
consumption proportionally increases with the number of
traffic sessions. Moreover, route discovery packets are
flooded to the overall network, which interfere with
transmission of other packets even in the spatially
uncorrelated area with the route discovery. The tree routing
protocol uses only parent and child relationship for routing,
ignoring neighbor nodes. As a result,packets may be routed
through several hops towards the destination even if this is
within sender’s 1-hop transmission In many cases, the routing
overhead of tree routing algorithm cannot be avoided if only
parent-child relationships are considered in the routing.
Keywords— ZigBee, Tree routing, Shortcut tree routing, STR,
Neighbor table, MANET, WSN, IEEE 802.15.4,BATF,PN
In order to overcome such problem, each node should
consider its neighbor nodes as next hop nodes. On the other
hand, ZigBee tree routing (ZTR) prevents the route discovery
overhead in both memory and bandwidth using the distributed
block addressing scheme. In ZTR, since each node is assigned
a hierarchical address, a source or an intermediate node only
decides whether to forward a packet to the parent or one of the
children by comparing its address with the destination address.
The most benefit of ZTR is that any source node can transmit
a packet to an arbitrary destination in a network without any
route discovery overheads. Due to this efficiency, ZTR is
considered as a promising protocol for resource constrained
devices in diverse applications such as smart grid project and
Internet of Things. However, in ZTR, packets are forwarded
along the tree topology to the destination even if the
destination is located nearby. Thus, ZTR cannot provide the
optimal routing path, while it does not require any route
discovery overhead.
Introduction
ZigBee is used in applications that require a low data rate,
long battery life, and secure networking. ZigBee has a defined
rate of 250 kbit/s, best suited for periodic or intermittent data
or a single signal transmission from a sensor or input device.
ZigBee is a specification for a suite of high level
communication protocols used to create personal area
networks built
from
small,
low-power digital
radios.Applications include wireless light switches, electrical
meters with in-home-displays, traffic management systems,
and other consumer and industrial equipment that requires
short-range wireless transfer of data at relatively low rates.
The technology defined by the ZigBee specification is
intended to be simpler and less expensive than other WPANs,
such as Bluetooth or Wi-Fi. ZigBee networks are secured by
128 bit symmetric encryption keys. In home automation
applications, transmission distances range from 10 to 100
meters line of sight, depending on power output and
environmental characteristics.
ISSN: 2231-5381
In this paper propose the BATF algorithm The hotspot problem is inherent in tree-structured networks and may
demand extra energy to recover from failures of hot-spot
nodes. The backbone-aware topology formation (BATF)
scheme is proposed to alleviate the hot-spot problem. BATF
http://www.ijettjournal.org
Page 127
International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
utilizes power-rich nodes to form a backbone tree that does
not suffer from the hot-spot problem
II RELATED WORK
A Distributed and Efficient Flooding Scheme using 1-hop
Information in MobileAdHocNetworks [1] by H.Lu,et al(2007) is
implemented in 1-hop neighbor information. The objective of this
work is the sufficient and necessary condition of 100 percent
deliverability for flooding scheme. Flooding is one of the most
fundamental operations in mobile ad hoc networks
(MANETs). Flooding is a very frequently invoked utility
function in MANETs. Therefore, an efficient implementation
of flooding scheme is crucial in reducing the overhead of
routing protocols and improving the throughput of networks.
Pure flooding, or blind flooding, where every node in the
network retransmits the flooding message when it is its first
time to receive it. This simple scheme guarantees that a
flooding message can reach all nodes if there is no collision
and the network is connected. However, it generates an
excessive amount of redundant network traffic because all
nodes in the network transmit the flooding message. This will
consume a lot of the energy resources of mobile nodes and
cause congestion of the network.
Dynamic Source Routing in Ad Hoc Wireless Networks [2]
by D.B. Johnson and D.A. Maltz is implemented in Mobile
Computing. An ad hoc network is a collection of wireless
mobile hosts forming a temporary network without the aid of
any established infrastructure or centralized administration. In
such an environment, it may be necessary for one mobile host
to enlist the aid of other hosts in forwarding a packet to its
destination, due to the limited range of each mobile host’s
wireless transmissions. This paper presents a protocol for
routing in ad hoc networks that uses dynamic source routing.
The protocol adapts quickly to routing changes when host
movement is frequent, yet requires little or no overhead during
periods in which hosts move less frequently. Based on results
from a packet-level simulation of mobile hosts operating in an
ad hoc network, the protocol performs well over a variety of
environmental conditions such as host density and movement
rates. For all but the highest rates of host movement simulated,
the overhead of the protocol is quite low, falling to just 1% of
total data packets transmitted for moderate movement rates in
a network of 24 mobile hosts. In all cases, the difference in
length between the routes used and the optimal route lengths
is negligible, and in most cases, route lengths are on average
within a factor of 1.01 of optimal.
Distributed Throughput Optimization for ZigBee Cluster Tree
Networks [3] by Y. Huang, et al is implemented in zigbee
networks. ZigBee, a unique communication standard designed
for low-rate wireless personal area networks, has extremely
low complexity, cost, and power consumption for wireless
connectivity in inexpensive, portable, and mobile devices.
Among the well-known ZigBee topologies, ZigBee clustertree is especially suitable for low- power and low-cost
ISSN: 2231-5381
wireless sensor networks because it supports power saving
operations and light-weight routing. In a constructed wireless
sensor network, the information about some area of interest
may require further investigation such that more traffic will be
generated. However, the restricted routing of a ZigBee clustertree network may not be able to provide sufficient bandwidth
for the increased traffic load, so the additional information
may not be delivered successfully. In this paper, we present an
adoptive-parent- based framework for a ZigBee cluster-tree
network to increase band- width utilization without generating
any extra message exchange.
T.Kim,D.Kim,N.Park,S.Yoo,andT.S.Lopez [4]. The objective of
this work is to find the optimal next hop node that has the
smallest remaining hop count to the destination. ZigBee is the
emerging industrial standard for ad hoc networks based on
IEEE 802.15.4. Due to characteristics such as low data rate,
low price, and low power consumption, ZigBee is expected to
be used in wireless sensor networks for remote monitoring,
home control, and industrial automation. Since one of the
most important goals is to reduce the installation and running
cost, ZigBee stack is embedded in small and cheap microcontroller units. Since tree routing does not require any
routing tables to send the packet to the destination, it can be
used in ZigBee end devices that have limited resources.
However, tree routing has the problem that the packets follow
the tree topology to the destination even if the destination is
located nearby.The shortcut tree routing protocol to reduce the
routing cost of ZigBee tree routing by using the neighbor table
that is originally defined in the ZigBee standard
Chengfa Li, Mao Ye, Guihai Chen and Jie Wu [5].Clustering
provides an effective way for prolonging the lifetime of a
wireless sensor network. Current clustering algorithms usually
utilize two techniques, selecting cluster heads with more
residual energy and rotating cluster heads periodically, to
distribute the energy consumption among nodes in each
cluster and extend the network lifetime. However, they rarely
consider the hot spots problem in multihop wireless sensor
networks. When cluster heads cooperate with each other to
forward their data to the base station, the cluster heads closer
to the base station are burdened with heavy relay traffic and
tend to die early, leaving areas of the network uncovered and
causing network partition. To address the problem, here
propose an Energy Efficient Unequal Clustering (EEUC)
mechanism for periodical data gathering in wireless sensor
networks. It partitions the nodes into clusters of unequal size,
and clusters closer to the base station have smaller sizes than
those farther away from the base station. Thus cluster heads
closer to the base station can preserve some energy for the
inter cluster data forwarding. Here also propose an energy
aware multihop routing protocol for the inter cluster
communication. Simulation results show that unequal
clustering mechanism balances the energy consumption well
among all sensor nodes and achieves an obvious improvement
on the network lifetime.
http://www.ijettjournal.org
Page 128
International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
III PROPOSED SYSTEM
System design or system architecture is the conceptual design
that defines the structure and/or behavior of a system.
.
Topology
creation
creation
device in a network, whereas a network conforming to a tree
topology uses a distributed scheme (Cskip) to assign a 16-bit
address to each device. Every node is assigned a unique 16 bit
short address dynamically using either distributed addressing
or stochastic addressing scheme. The routing protocols of
ZigBee are diverse so that a system or users can choose the
optimal routing strategy according to the applications.
Address scheme
Routing tree
calculation
Back bone
tree
D.Neighbor Table
First, each node needs to determine what other ports it is
connected to, over fully working links; it does this using
a reach ability protocol which it runs periodically and
separately with each of its directly connected neighbors. Each
node independently runs an algorithm over the map to
determine the shortest path from itself to every other node in
the network; generally some variant of Dijkstra's algorithm is
used. This is based around a link cost across each path which
includes available bandwidth among other things.
Power rich
node
Packet
transmission
Neighborhood
table
E.Position Identifier
Position of the node is identified to increase the performance
of the system and to collect better node for Communication
Destination
address
Path selection
Verification
level information
Transmission
Fig 1.Architecture diagram
A.Topology Creation
Once the node of the given type has been configured as shown
in the previous subsection sec:node comfit, the next step is to
create the nodes. The node-creation API basically looks very
similar to the old node creation API. In case of hierarchical
addressing the node address has to be passed as an argument
as shown below:
set node [$ns_ node]
## or
set node [$ns_ node $node address] ;# incase of hierarchical
;# addressing.
B.Routing Tree Calculation
Tree based collection protocol. Some number of nodes in a
network advertises themselves as tree roots. Nodes form a set
of routing trees to these roots. TP is address in that a node
does not send a packet to a particular root; instead, it
implicitly chooses a root by choosing a next hop. Nodes
generate routes to roots using a routing gradient.
C.Address Scheme 16 bit
The function of the network layer is to assign a 16-bit address
to each device joining the network and to route packets to
their destination. ZigBee PRO uses a stochastic
(nondeterministic) scheme to assign the address of each
ISSN: 2231-5381
F.Power Node Selection
To Identify an efficient back bone network and to collect the
best path node energy levels is identified so that based on the
power node information the Back bone Network can be easily
identified . Power Node are identified using the energy
information of the Node and based on the energy information
color transition are performed for the system.
G.Packet transmission
For a variety of reasons data in networks is transmitted in
packets, which are sequences of octets (i.e. bytes). Usually
packets are transmitted asynchronously, so we need to know
when the packet starts and when it ends [in the case of RS232
characters we had a start and an end bit. In general the
problem of recognizing start and end of a packet is called
the framing problem.
H.Path Selection via tree routing
Routing is the process of selecting best paths in a network
along which to send network traffic. Routing is performed for
many kinds of networks, including the telephone
network (circuit switching).A local network administrator, in
special cases, can set up host-specific routes to a particular
device which provides more control over network usage,
permits testing and better overall security. This can come in
handy when debugging network connections or routing tables.
I.Path verification
Two major types of routing protocols exist, internal protocols
that route information within an organization and external
protocols that route information between networks.IGP is the
Interior Gateway Protocol used to exchange routing
information within an autonomous system. RIP and IGRP are
http://www.ijettjournal.org
Page 129
International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
examples of IGPs.EGP are the Exterior Gateway Protocol
used to exchange routing information between autonomous
systems. Border Gateway Protocol version 4 (BGP4) is an
example of an EGP. path is verified whether it is shortest or
not. If the path is shortest means take that path for
consideration. Other takes the alternative path for path
verification.
In this module the calculation of ancestor at each node. Using
programming, the ZTR Protocol is modified for the detection
of the tree and the tree based addressing scheme is used at
each node deployment and front/back ancestor are calculated
at individual node section. Some number of nodes in a
network advertises themselves as tree roots. Nodes form a set
of routing trees to these roots. TP is address in that a node
does not send a packet to a particular root. Instead, it
implicitly chooses a root by choosing a next hop.
IV SIMULATION AND RESULTS
Once the node of the given type has been configured the next
step is to create the nodes. The node creation API basically
looks very similar to the old node creation API.The
Communication Node with all specification parameters like
protocol,range, buffer,wireless IEEE802.11 like definitions
are carried and created for the basic communication. In this
module ZTR based protocol creation will defined and the
protocol deployment is carried.
Fig. 4 Ancestor at each node
This figure shows the Individual node neighborhood log
creation and the log include the information regarding its two
hop neighbor description and the neighborhood list is created
with detailed information description about the node
capability is displayed. First, each node needs to determine
what other ports it is connected to, over fully working links. It
does this using a reach ability protocol which it runs
periodically and separately with each of its directly connected
neighbors.
Fig. 2 Node creation
In this module ZTR based protocol is designed and the
addressing mechanism are deployed . An efficient 16 bit
address mode is deployed.Tree structure is created and the
addressing schemes are deployed for the individual
system..Every node is assigned a unique 16 bit short address
dynamically using either distributed addressing or stochastic
addressing scheme.
Fig. 5 Neighborhood node collection
Fig.3 Block Address Scheme
ISSN: 2231-5381
This figure shows the power node selection. To Identify an
efficient Back bone network and to collect the best path Node
Energy levels is identified so that based on the power node
information the Back bone Network can be easily identified .
Power Node are identified using the energy information of the
Node and based on the energy information color transition are
performed for the system.
http://www.ijettjournal.org
Page 130
International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
Routing is the process of selecting best paths in a network
along which to send network traffic. Routing is performed for
many kinds of networks, including the telephone
network (circuit switching).A local network administrator, in
special cases, can set up host-specific routes to a particular
device which provides more control over network usage,
permits testing and better overall security. This can come in
handy when debugging network connections or routing tables
Comparison
table
for
performance
evaluation
A.Comparison table for end to end delay and packet
delivery and routing send
control packet
Fig. 6 N Power node selection
In this module shows the Backbone network awareness. To
prolong the lifetime of a ZigBee network and improve its data
collection capability, we propose a backbone-aware topology
formation (BATF) scheme, where one ZigBee tree network
can be rooted at each PN. All PNs form a backbone that
connects all independently-developing ZigBee trees to one
network. In BATF, all PNs and ZNs are required to share the
same 16-bit address space to uniquely identify every PN and
ZN in the network. Furthermore, tree-based routing used by
ZigBee, which is tightly-coupled with addressing, is required
to work in each PN-rooted ZigBee tree.
Fig. 7 Backbone network awareness
In this module shows the packet transmission.Usually
packets are transmitted asynchronously, so we need to know
when the packet starts and when it ends. In general the
problem of recognizing start and end of a packet is called
the framing problem. One possible way to represent a packet
is by starting it with a special character, say SOH = 0x01, and
ending it with a special character, say EOT=0x04. Then one
can recognize a packet by looking for these characters. Of
course, we need to make sure that SOH and EOT appear only
two major types of Routing protocols exist, internal protocols
that route information within an organization and external
protocols that route information between networks.
Table 1: End to end delay, packet delivery and send control
packet
Routing End to
End delay(msec)
Routing Packet
Delivery(msec)
Routing
Send
Control
Packets(msec)
No. of nodes
No. of nodes
No. of nodes
BATF
STR
BATF
STR
BATF
STR
0
0
0
0
0
0
0.013
0.013
943
823
10003
10003
0.0136
0.0156
93.56
83.56
20006
18006
0.0189
0.0199
959
85.39
25009
20009
0.00812
0.02012
96.512
86.512
350012
250012
0.02015
0.02315
9715
9015
400015
350015
0.02218
0.02518
9818
9418
500018
400018
0.01921
0.02921
10021
9435
550021
450021
0.01825
0.02825
10525
10125
570525
510525
0.0203
0.0313
10830
10330
580830
540830
0.02235
0.03235
11035
11035
620035
590035
0.0234
0.0334
11440
10740
680440
640440
0.025
0.035
11900
11200
740000
690000
This table shows the comparison for end to end delay, packet
delivery and send control packet. The end-to-end latency is
mainly affected by the hop distance between a source and a
destination. Whereas STR shows long end-to-end latency
about 32~47msec, BATF show short end-to end latency about
18msec per session. The packet delivery ratio is mainly
affected by the number of hops the packet delivery ratio
decreases for the increasing network traffic. It results from
that the network congestion causes the collision and drops of
the packets
Fig. 8 Packet Transmission
ISSN: 2231-5381
http://www.ijettjournal.org
Page 131
International Journal of Engineering Trends and Technology (IJETT) – Volume 11 Number 3 - May 2014
B.Comparison table for received control packet and
throughput
Table 2 Received control packet and throughput
Routing Received Control Routing
Packets(msec)
Throughput(msec)
No. of nodes
No. of nodes
BATF
STR
BATF
STR
0
0
0
0
10003
10003
16003
12003
20006
22006
17006
13006
25009
27009
17509
15509
270012
290012
180012
159012
260015
300015
187015
163015
300018
320018
190018
170018
350021
330021
230021
190021
370525
390525
270525
230525
380830
400830
320830
270830
420035
420035
350035
300035
480440
490440
410440
350440
600000
700000
450000
400000
This table shows the comparison of the received control
packet and throughput. Throughput of BATF is high when
compared to STR routing overhead of link state maintenance
in STR and the route discovery in STR. The routing overhead
of STR is exponentially increased as the network density
increases, because the RREQ (Route Request) packets are
flooded into the whole network.
[5] Bandyopadhyay, S., & Coyle, E. (2003). An energy-efficient hierarchical
clustering algorithm for wireless sensor networks. In Proceedings of IEEE
INFOCOM (Vol. 3, pp. 1713–1723).
[6] Agbaria, et al, “Efficient and Reliable Dissemination in Mobile Ad Hoc
Networks by Location Extrapolation,” Journal of Computer Networks and
Communications, vol. 2011.
[7] W. Kiess , M. Mauve, “A survey on real-world implementations of
mobile ad-hoc networks,” Ad Hoc Networks, v.5 no.3, p.324-339, April, 2007
[8] B.-R. Chen, K.-K. Muniswamy-Reddy, and M. Welsh, “Ad-hoc multicast routing on resource-limited sensor nodes,” The 2nd International
Workshop on Multi-hop Ad Hoc Networks from theory to reality, Florence,
It- aly, 2006.
[9] A. Wheeler, “Commercial Applications of Wireless Sensor Networks
Using ZigBee,” IEEE Communications Magazine, vol. 45, Issue. 4, pp. 70-77,
April, 2007.
[10] O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis, “Collection
tree protocol,” The 7th ACM Conference on Embedded Networked Sensor
Systems (SenSys), Berkeley, CA, 2009.
[11] J. Ko, et al., “Connecting low-power and lossy networks to the internet,” IEEE Communications Magazine, pp. 96-101.
[12] P. Levis, et al., “TinyOS: An operating system for wireless sensor networks,” Ambient Intelligence, Springer-verlag, 2005.
[13] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, “On finding lowest common
ancestors in trees,” SIAM Journal of Computing, vol. 5, no. 1, pp. 115-132,
1976.
[14] H. Lu, et al, “A Distributed and Efficient Flooding Scheme using 1-hop
Information in Mobile Ad Hoc Networks ,” IEEE Transactions on Par- allel
and Distributed Systems, vol. 18, no. 5, pp. 658-671, 2007.
V CONCLUSION
Here presented BATF, a network infrastructure for treestructured ZigBee networks that utilizes PNs as virtual
coordinators for regular ZigBee devices. BATF distributes the
traffic load of hot-spot nodes by organizing all PNs into a
backbone tree. Yet it is ZigBee-compatible from the
perspective of ZNs. In other words, BATF demands no
modification from regular ZigBee devices.
REFERENCES
[1] H. Lu, et al, “A Distributed and Efficient Flooding Scheme using 1-hop
Information in Mobile Ad Hoc Networks ,” IEEE Transactions on Parallel
and Distributed Systems, vol. 18, no. 5, pp. 658-671, 2007.
.[2] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc
Wireless Networks,” Mobile Computing, vol. 353, 1996, p. 153–181.
[3] Y. Huang, et al, “Distributed Throughput Optimization for ZigBee
Cluster-Tree Networks,” IEEE Transaction on Parallel and Distributed
Systems, vol. 23, no. 3, pp. 513-520, 2012.
[4] Li, C. F., Ye, M., Chen, G., & Wu, J. (2005). An energy efficient unequal
clustering mechanism for wireless sensor networks. In IEEE international
conference on mobile ad-hoc and sensor systems (pp. 535–540).
ISSN: 2231-5381
http://www.ijettjournal.org
Page 132