A THESIS PRESENTATION

1
A THESIS PRESENTATION

• Bluetooth Zone Routing Protocol Analysis
• In Comparison with
• Bluetooth Dynamic Source Routing

2
Introduction

• Bluetooth enables portable electronic devices to
  communicate wirelessly via short range ad hoc
  network and form networks which often called
  Personal Area Network (PAN)
• Several Personal Area Network (PAN) can unite
  together and form a larger network called Scatter
  Network.

3
Introduction

• Bluetooth is a short range wireless technology
  which can replace the function of a cable.
• Bluetooth is using 2.4 2.480 GHz ISM frequency,
  with 79 RF channels with bandwidth of 1 MHz.
• Bluetooth allows transfer rate up to 1 Mbps

4
Objectives

• In this thesis we are going to discuss the
  effectiveness of a newly form routing protocol
  called Zone Routing Protocol (ZRP) through a
  simulation of sending and receiving packages of
  information in a timely based by comparing to a
  routing protocol which has been developed by the
  Bluetooth, SIG itself formally known as the
  Dynamic Source Routing (DSR) and the performances
  of both routing protocol

5
The Frames

• It will not be discussed on how the network
  topology is formed.
• Comparison is only between two different routing
  schemes, namely
• Zone Routing Protocol (ZRP)
• Dynamic Source Routing (DSR)
• Only bi-partite network topology will be
  simulated
• Size of package will have been previously set
• Range of nodes will not be an issue
• Parameters to be used in Analysis are Time
  Process, Time Consumed and Deviation Standard

6
Basic Theory

• Two or more bluetooth units that share a common
  channel form a piconet
• Piconet is a cell in bluetooth radio
  communication with the radius of 10-100m

7
Basic Theory
8
Basic Theory

• Two or more piconets can be interconnected,
  forming a scatternet
• A bluetooth unit which is a member of two or more
  piconets is called inter-piconet node
• Inter-piconet node is use as a relay and often
  called as bridge
• Communication between nodes in the scatternet use
  multihop communication system

9
Basic Theory

• Routing algorithms are needed to make scatternet
  functional. In a multihop scatternet, routing is
  needed to find the right path between source and
  destination that packages of information should
  undergo

10
The Routing Schemes

• Routing Schemes in Bluetooth are classified in
  two, which are
• PROACTIVE (table driven)
• Attemped to keep an up-to-date topological map of
  the entire network
• REACTIVE (on-demand or source initiated)
• a route determination procedure is invoked on
  demand when a packet needs to be forwarded

11
The Routing Schemes

• DYNAMIC SOURCE ROUTING (DSR)
• AD-HOC on DEMAND VECTOR (AODV)
• DESTINATION SEQUENCE DETECTION VECTOR (DSDV)

12
The Routing Schemes

• And theres a combination of proactive and
  reactive routing protocol, which is
• ZONE ROUTING PROTOCOL (ZRP)

13
Dynamic Source Routing

• Dynamic Source Routing (DSR) has been the most
  dynamic routing scheme that is also known as
  reactive routing scheme. It behaves reactively
  and spontaneously without any proper protocol
  that gives a certain rule on how it searches a
  routing path

14
Dynamic Source Routing

• DSRs two Major Phases
• ROUTE DISCOVERY
• ROUTE MAINTENANCE

15
Dynamic Source Routing

• Route Discovery
• the node checks its own routing cache
• broadcasts a route request to its neighbors
  containing its own address, the destination
  address and a unique sequence number for loop
  detection
• The receiving node checks its cache for a route
  to the destination. If it does not contain a
  route it adds its own address to the packet and
  forwards it

16
Dynamic Source Routing

• Route Maintenance
• A route reply will be sent back if a node has an
  actual route to the destination
• If the node is not the destination, it adds its
  cached route to the route reply message
• In the figure, node '4' is no longer in
  transmission range of node '2'. The route 1, 2,
  4, 7 can no longer be taken so the other route
  stored in node 1 1, 2, 3, 5, 6, 7 must be used

17
Zone Routing Protocol

• Zone Routing Protocol as its name implies, is a
  routing protocol which uses zones as a perimeter
  of its searching area. The Zone Routing Protocol
  (ZRP) aims to address the problems by combining
  the best properties of both approaches. ZRP can
  be classed as a hybrid reactive/proactive routing
  protocol

18
Zone Routing Protocol

• ZRP Architecture
• IARP
• IntrA Routing Protocol
• IERP
• IntEr Routing Protocol
• BRP
• Bordercasting Routing Protocol

19
Zone Routing Protocol

• A routing zone is defined for each node
  separately
• The routing zone has a radius ? expressed in
  number of hops
• The zones of neighboring nodes can overlap

20
Zone Routing Protocol
21
Steps in ZRP

• First step
• The zone radius, ? 2. The node uses the routing
  table provided by IARP to first check whether the
  destination is within its zone
• Since it cannot be found in its zone, a route
  request is issued using IERP
• Node I does not find the destination in its
  routing table. Consequently, it broadcasts the
  request to its peripheral nodes

22
Steps in ZRP

• Second Step
• The route request is received by node T, which
  can find the destination in its routing zone,
  shown in the figure. Node T appends the path from
  itself to node X to the path in the route request
• A route reply, containing the reversed path is
  generated and sent back to the source node. If
  multiple paths to the destination were available,
  the source would receive several replies

23
Steps in ZRP

• Finally, node T can find X within its zone

24
Routing System Design in the Simulation

• In designing the routing system for Bluetooth
  network, we must first consider that the network
  itself consist in two different kinds of design.
  Which namely are bipartit and non-bipartit
  network. In this thesis we will only consider the
  bipartit network that we are going to analyze
• The designing itself consist in 3 large phases,
  e.g.
• Network establishment
• Routing method to be taken
• Execution

25

• General Simulation Flowchart

26
Hardware Minimum Requirements

• Pentium III processor PC
• 128 MB of RAM
• 5 GB HDD, and
• OS Windows 2000/XP

27
The SIMULATION

• The modeling that will be discussed here is a
  model which should be seen as simple as the
  Bluetooth network itself
• The model in this thesis is made with Visual
  Basic .NET program
• Number of nodes are limited until 50
• In Analyzing Mode, it will compare two different
  routing schemes in 2 major cases
• Major Cases in the simulation are
• ALL NODES to ONE NODE
• ONE NODE to ALL NODES

28
The SIMULATION

• In Analyzing Mode, we can develop the major cases
  into two minor cases according to the location of
  the source or destination node, either at the
  very end of the network topology (subcase A) or
  in the middle of the network topology (subcase
  B)
• Data connection speed (transfer rate) in this
  simulation is considered to be the same on each
  link

29
The SIMULATION

• Definition of Parameters in the Simulation
• Time Process is the time needed for each
  routing scheme to find to routing path from a
  source node to the desired destination
• Time Consumed is the time needed for each
  routing scheme from finding the right path to
  completing sending process of the package to the
  desired destination, or in other words it is
• Time Process Sending Time

30

• DSRs Flowchart

31

• ZRPs Flowchart

32
The SIMULATION

• Deviation Standard is used to calculate the data
  results in order to find the better performance
  between two routing schemes on each case. The
  formula of the DS is as follows
• Where
• Xi is the mean value of either Time Process nor
  Time Consumed,
• X is the threshold value, and
• N is the total number of data, which in this
  case has a value of 10

33
The SIMULATION
34
The RESULTS

• Case 1a
• is the case in which Bluetooth equipped devices
  are each sending a packet of data to one specific
  node. The complete data can be found in the
  attachments but the means results are as follows

35
The RESULTS

• Case 1b
• is the case with a different condition in which
  the destination node is located on the middle of
  the topology (please refer to the topology
  figures on the attachments). And the results are
  as follows

36
The RESULTS

• Case 2a
• is very much different in the first two cases.
  In this case one node that is located at the very
  end of the network topology is sending packet to
  all the nodes in the topology. We will see the
  big difference as follows

37
The RESULTS

• Case 2b
• will give us a description when the source node
  is located in the middle of the network topology.
  And the results are as follows

38
Time Process Comparison
39
Time Consumed Comparison
40
RECOMMENDATION

• Before using a routing scheme, a number of
  certain things must be taken under consideration,
  e.g. environment situation, network topology
  that will be established, number of Bluetooth
  equipped devices, and the communication
  schematics that will be used most often.
• Since in all 4 subcases, Zone Routing Protocol
  shows better performance in 3 of them (case 1a,
  case 2a, and case 2b), we should give
  consideration on using the protocol for a large
  network topology. Although then we should also
  consider on increasing the budget due to the
  needs of using a server for operating under this
  protocol.

41
CONCLUSIONS

• With the use of Deviation Standard formula, we
  can determine which has the better performance
  between Zone Routing Protocol and Dynamic Source
  Routing. It is determined from the one that has
  the lowest Deviation Standard (DS) value.

42
CONCLUSIONS

• Zone Routing Protocol when used will give a
  better power efficiency due to the routing
  algorithm that requires to ping only to each zone
  and not to the entire network and it does not
  require to trace back the routing path when the
  destination node is found. Although Zone Routing
  Protocol needs a server and a simple software to
  be implemented in the devices within the network
  topology member.

43
CONCLUSIONS

• Dynamic Source Routing is simpler, it does not
  require a server nor software since it has been
  established in the equipment itself. Although
  when we see it from power efficiency, Dynamic
  Source Routing will consume more power to the
  entire network topology member, since it requires
  to ping to each and every network topology
  members to find its destination and it requires
  to trace it back again to the source before
  routing path is well established.

44
CONCLUSIONS

• Mobility in both routing schemes is not
  applicable, due to the simplicity of Bluetooth
  devices that do not have an algorithm in
  encountering the drastic changes in network
  topology. Once the moving simulation is started,
  the established link from a source node to a
  destination node will be broken.

45
Further Work Suggestions

• Other Bluetooth routing schemes must be taken
  under study further more in order to learn their
  behavior and using it optimally in a Bluetooth
  network topology
• There should be a further learning process on how
  to develop a switching software that can switch
  between routing schemes according to location of
  source, destination, and also according to both
  types of Bluetooth network topology

46
A THESIS PRESENTATION

• THANK YOU
• For further suggestions, please dont hesitate to
  contact me at
• uku_at_stttelkom.ac.id
• Or 0812-2147630
• Telecommunication Engineering Department
• Sekolah Tinggi Teknologi Telkom
• 2005