Exploring BATMAN and SPEED: Routing Protocols for Ad-hoc Networks

This report provides an overview of mobile ad-hoc networks (MANETs) and delves into two prominent routing protocols: Better Approach To Mobile Ad-Hoc Networking (B.A.T.M.A.N.) and SPEED, a real-time routing protocol for wireless sensor networks. It begins by introducing wireless networking concepts, highlighting the characteristics and advantages of ad-hoc networks, and then focuses on the MESH topology. The report details the B.A.T.M.A.N protocol, its algorithm, and its advantages over Optimized Link State Protocol (OLSR). Furthermore, it explores real-time sensor networks, their applications, constraints, and the importance of MAC and routing protocols. The SPEED protocol and its variations (MM SPEED, FT SPEED, EE SPEED) are discussed in detail, along with their evaluation and comparison. The report concludes by emphasizing the suitability of B.A.T.M.A.N for ad-hoc networks and SPEED (particularly MMSPEED) for real-time wireless networking.

Better Approach To Mobile
Adhoc Networking
(B.A.T.M.A.N.)
SPEED: A Real-Time Routing Protocol for Wireless
Sensor Networks

WIRELESS NETWORK
INTRODUCTION
Wireless networking is the largest growing segment in technical field.
Wireless mobile communication is one of the major application of
wireless networking.
Purpose: Remote access of communication service.
Wireless communication
Wireless
LAN
Ad Hoc
Networks
Infrastructure
based network

Characteristics of Infrastructure based network:
•Traditional mobile system.
Characteristics of Wireless LAN
•Radio link or Infra red is used as medium of communication.
•Low bandwidth compared to the infrastructure based network.
•Very flexible.
Characteristics of Ad hoc network:
•Used in military and research purpose
•Useful when there is a lack of communication resource or the resource
available are expensive.

Mobile Ad hoc network:
•Frequent hope movement.
•Frequent change of topology
•Data routed via intermediate nodes.
•Multi hope wireless link
Advantages:
•Supports communication where infrastructure is not available properly.
•Easy to deploy
•Does not need backbone infrastructure support.
Application:
•Military environments such as tanks, war
•Civilian environment such as taxi cab, conference rooms, stadium
•Emergency operation such as search and rescue , fire fighting.

MESH Topology:
•Each node is connected directly with other nodes in the
network.
•There are two types of mesh arrangement- partial mesh and the
full mesh(Reina et al. 2015).
•In full mesh each node present in the topology is connected with
each other.
•In partial mesh, the modes are connected to some other nodes.
This kind of topology is capable of dynamic update of the stated
between the connection.
In mesh network, all the cards are on Ad hoc mode.
‘Mobile Ad Hoc network’ (MANET) is the term used in the mobile
wireless network system.

Types of mesh routing protocol:
•Proactive
•Reactive
•Hybrid
Proactive Routing protocols are:
•‘OLSR (Optimized Link State Protocol)’
•‘B.A.T.M.A.N ( Better Approach to Mobile Ad-Hoc Networking)’
Reactive routing protocols are-
•‘AODV(Ad hoc on Demand Distance Vector)’
•‘SrcRR’
Hybrid routing protocols are-
•‘HSLS (Hazy Sighted Link State Routing)’

Classes of Mobile Ad Hoc networking:
•Table driven
Example- B.A.T.M.A.N,OLSR
•Non-Table Driven
Goals:
•Determination of best paths by the nodes based on the controls of the
packet.
•Every node should have information about the entire network.
Specialty of B.A.T.M.A.N:
•The link quality is determined by the presence or absence of the control
packets.

Protocol Details of B.A.T.M.A.N
•Every node has direct link to its neighbors.
In the figure, A has two neighbors B and C. Through B and C , the
node A can send and receive all the packets.
•Every node in the network sends ‘Originator Message (OGM)’ in a
periodic manner for informing all the other nodes about its presence. The
OGM contains a sequence number.

•If it is seemed that all the links are working perfectly node A will receive
OFM number of node D from both of its neighbors B and C.
In case, node B and C receives the OGM of node D, then for the
communication form A to D , the node B or C can be used as the next
hop for the communication to D (Reina, D.G. et al. 2014).
•In case,the link between A and C cancelled out
Node B will supply node D’s OGM to node A. In this case, node A can
communicate to node D through node B (Chaudhary et al. 2017). Node
C’s OGM will reach to node A through node B. Node B will be considered
next best hop for destination for node C.

In case some of the OGM arrive through a link –
•Sliding window can be a solution in this case.
•The sliding window indicates the last window size number or
sequence number.
•The sequence number is received through OGM

B.A.T.M.A.N Algorithm:
Step 1 For routing message m from s to d in the network G (s, i) ∀ i
6= K to reduce the graph.
Step 2 Weight W is associated with each of the link, where weight is
the originator of the message and the destination is node i in the
existing window.
Step 3 Finding of link having highest weight w in the sub-graph and
send m along the link (s, i).
Step 4 repeating of Steps 1 to 4 for routing message from i to d for
sub-graph S in case d=6.

Evaluation of ‘B.A.T.M.A.N’:
Advantages:
•In case of routing it is more flexible.
•Supports IPv4 and IPv6
•There is no need for IP subnet coordination
•Mac address configuration is simple.
•Fast roaming