Ad Hoc and Wireless

Sensor Networks
 Introduction

What is data?

What is Data Communication?

 How it Happens?

 What are the 5 components of data communication?

 What is a Network?

 Possibility of connecting computers or devices together.

 Wireless Network

What is a wireless Network?

 A wireless network provides a network without the use of wires and using using radio
waves.
A wireless network is a computer network that uses wireless data connections
between network nodes.
 Examples : Cell phone networks, wireless local area networks (WLANs), etc.,

What is a Node?
A physical network node is an electronic device that is attached to a network,
and is capable of creating, receiving, or transmitting information over a
communications channel.
 The main purpose of using wireless network is its flexibility, roaming, low
cost, and high standard.
 Types of Wireless Networks

WLAN (Wireless Local Area Network)

WWAN (Wireless Wide Area Network)

WMAN (Wireless Metropolitan Area Network)

WPAN (Wireless Personal Area Network)

Ad-hoc Network.

Hybrid Network.
 Advantages of Wireless networks

Powerful tool for increasing productivity.

 Without connecting wires

 Wireless networks are cost effective

Mobility

The security of wireless is very good

 Provides greater speed for small to medium-sized business

General Classification of Wireless Network
Wireless Receiver
Hop
Networks 7
5
4
6
1
Sender
Infrastructure less 3
Infrastructure 2
Network Network
Receiver
7
Single Hop Wifi Router Single Hop Blue Tooth
5
4
6
1
Sender
Multi Hop GSM Multi Hop Ad Hoc 3
2
 What is Ad Hoc Network
It is infrastructure less network by multi hop

 Nodes in the network or mobile in general

 Host communicate with each other without the existing fixed infrastructure and a
central control

Can be connected to other fixed networks or to the internet

 Uses the allocated frequency for the industrial scientific ranges.

 What is Ad Hoc Network – Conti…,

More Flexible, better mobility and economical.

 So, sharing of data between devices is possible without having an access point.

 When all the systems are ad Hoc configured, they are ready to take the data to the

destination.

Much used in Military application in war zones.

 Challenges with Ad Hoc Network

Limited Wireless Range

 Hidden Terminals

 Packet losses

 Routes Changes

 It is Heterogeneous

 Power Consumption
How they look?

• Infrastructure • No Infrastructure • Self Organization

• Base station • No Base station • Self Configuration
• Online Server • No Server
• Network operator for operation and maintenance • No Network operator
• Self Healing
• Single Hop Wireless Communication • Multi Hop Wireless Communication
Network Comparison

Basic Service Set (BSS) with Basic Service Set (BSS) without
Access Point (AP) Access Point (AP)

INFRASTRUCTURE Model Ad Hoc Network

 An Ad Hoc Network Is…
 Collection of two or more devices equipped with wireless communications and networking capability.

Such devices can communicate with another node that is immediately within their radio range or one
that is outside their radio range. …

 Temporary network composed of mobile nodes without preexisting communication infrastructure, such
as Access Point (AP) and Base Station (BS).

 Each node plays the role of router for multi-hop routing.

 Self-organizing network without infrastructure networks. …

 Each node decode-and-forward packets for other nodes.

 Advantages and Applications
Ad-hoc networks can have more flexibility.

 It is better in mobility.

 It can be turn up and turn down in a very short time.

 It can be more economical.

 It considered a robust network because of its non-hierarchical distributed control and management

mechanisms.

Group of people with laptops and they want to exchange files and data without having an access point.

Incase if we need to exchange information and the network’s infrastructure has been destroyed.

It is suitable for military communications at battlefield where there is no network infrastructure.
 Why Ad Hoc?
Ease of deployment

 Speed of deployment

 Decreased dependence on infrastructure

Topologies Followed in an Ad Hoc Network
Homogeneous or fully symmetric

• All nodes have identical capabilities and responsibilities

Heterogeneous
• Differences in capabilities
 Wireless Ad Hoc Networks

A wireless ad-hoc network is a decentralized type of wireless network.

The network is ad hoc because it does not rely on a preexisting infrastructure, such as routers in

wired networks or access points in managed (infrastructure) wireless networks.

 Each node participates in routing by forwarding data for other nodes, and so the determination of which

nodes forward data is made dynamically based on the network connectivity.

 In addition to the classic routing, ad hoc networks can use flooding for forwarding the data.
Wireless Ad Hoc Networks
 MANET (MOBILE Ad Hoc NETWORK)
 A Mobile Ad hoc Network (MANET) is an autonomous system of nodes (also serving as routers)
connected by wireless links.

 No infrastructure exists in a MANET.

 There is no Centralized Node.

 The network’s wireless topology may change dynamically in an unpredictable manner since nodes are

free to move and each node has limited transmitting power

 Information is transmitted in a store-and forward manner (peer-to-peer) using multi-hop routing

 MANET (MOBILE Ad Hoc NETWORK)
• Each node is equipped with a wireless transmitter and a receiver with an appropriate antenna

• We assume that it is not possible to have all nodes within each other’s radio range.

• When the nodes are close-by i.e., within radio range, there are no routing issues to be addressed.

• At a given point in time, wireless connectivity in the form of a random multi-hop graph exists

between the nodes

Simple MANET
 Characteristics of MANET
Dynamic topologies:
Network topology may change dynamically as the nodes are free to move

Bandwidth-constrained, variable capacity links:

Realized throughput of wireless communication is less than the radio’s maximum transmission
rate Collision occurs frequently

Energy-constrained operation:
Some nodes in the ad hoc network may rely on batteries or other exhaustible means for their
energy

Limited physical security:

More prone to physical security threats than fixed cable networks.
 Applications
Defense applications: On-the-fly communication set up for soldiers on the ground, fighter planes in the
air, etc.
Crisis-management : Natural disasters, where the entire communication infrastructure is in
disarray.
Tele-medicine : Paramedic assisting a victim at a remote location can access medical records, can
get video conference assistance from a surgeon for an emergency intervention
Tele-Geoprocessing : Combines geographical information system, GPS and high capacity MS, Queries
dependent of location information of the users, and environmental monitoring using
sensors.
Vehicular Area Network: providing emergency services and other information in both urban and rural setup
Virtual navigation : A remote database contains geographical representation of streets, buildings, and
characteristics of large metropolis and blocks of this data is transmitted in rapid sequence to a
vehicle to visualize needed environment ahead of time.
Education via the internet: Educational opportunities on Internet to K-12 students and other interested individuals. Possible
Cellular Network Vs Ad Hoc Network
Cellular Ad Hoc
Fixed Infrastructure Infrastructure less

Single-Hop Wireless links Multi-Hop Wireless Links

Centralized Routing Distributed Routing

Base Station: Single Point of failure Resilient

Seamless Connectivity Mobility – Frequent link breaks

High Cost and Long Deployment time Quick and cost effective setup

Commercial sector Defense, Emergency and Disaster

Simple Mobile, Complex Base All Complexity in mobile

Cellular Network Vs Ad Hoc Network
Cellular Ad Hoc
Time Sync = TDMA Time Sync is difficult = CSMA

Static Frequency reuse Dynamic frequency reuse

Shared radio channel – suitable for data
Guaranteed Bandwidth for voice traffic traffic

Circuit switched Pocket switched

Time Sync is easy to achieve Time sync is difficult

Network maintenance is high Depends on self organization

Main Goal: Main Goal:
Routing Routing with minimum overheads
Call admission Control to increase call And
acceptance and decrese the call drop Quick configuration of broken paths
 MAC Protocol
• The Ad Hoc Wireless Topology is highly dynamic .

• Frequent changes in the topology are hard to predict.

• MAC is responsible for resolving the conflicts among different nodes for channel access.

• Media Access Control Protocol

• It is a sub layer of Data Link Layer – in the OSI model.

• MAC is responsible of transmission of data packets to and from NIC and to and from another

remotely shared channel.

• MAC provides fair access to shared broadcast radio channel.

 Issues in designing a MAC Protocol for Ad Hoc Network
• Bandwidth Efficiency - Must be maximized

• Real time traffic support - Should be provided

• Synchronization - Sometime needed TDMA

• Shared Broadcast Medium - Collision must be avoided or minimized

• Lack of central coordination - Fully distributed model

• Mobility of nodes

• Hidden terminal problem - Collision and hence inefficient bandwidth

 Introduction to Routing Protocols
• What is a Routing Protocol (RP)?
• This specifies how routers communicate with each others.
• uses metrics to decide which path will be the best for a packet to move.
• Different metrics are
• Path bandwidth
• Reliability
• Delay
• Current load on the path
• RP used in Wired networks cannot be directly apply to Ad Hoc Wireless networks
• Ad Hoc Networks are highly dynamic
• No infrastructure for centralized administration
• Bandwidth
• Energy Constraints
• Because of these reasons, a new RP is needed for Ad Hoc Wireless network
 Issues in Designing a Routing Protocol
• Mobility
• Ad Hoc is highly dynamic due to movement of nodes Wireless ad hoc networks can operate over different
• Node movement cause path breaks types of radios.
• Path repair in a wired network has a slow convergence. All radios use modulation to move information over
a certain bandwidth of radio frequencies.
Radios can be UHF (300 – 3000 MHz), SHF (3 – 30
• Bandwidth Constraint
GHz), and EHF (30 – 300 GHz)
• Wireless has less BW due to limited Radio band
• Less data rate and difficult to maintain the topology information
• Frequent change of topology causes more over head of topology maintenance.
• Target: Bandwidth optimization and design topology update mechanism with less overheads.

• Error -Prone shared broadcast Radio Channel

• Wireless systems has time varying characteristics in terms of link capacity and link error probability
• Target: Interact with MAC layer to find a better quality link.

• Resource Constraints
• Limited battery life and limited processing power.
 Classification of Routing Protocols

RP is classified in to 4 categories
Routing information update mechanism

Use of temporal information for routing

Routing topology

Utilization of specific resources

 Routing Information Update Mechanism
• Otherwise known as Proactive or Table Driven Routing Protocol
• Divided into 3 types:
• Proactive, Reactive and Hybrid

• Proactive Model:
• Maintains the routing information in the routing table.
• This is flooded in the whole network
• Runs path finding algorithm with routing table.

• Reactive or On Demand RP:

• Obtain the necessary path when required.

• Hybrid Routing Protocol:

• With in the zone of the given node – Table driven
• Out of the zone of the given node – On Demand
 Temporal Information for Routing

Routing Protocols using Past Temporal information

• Past status of the links or the status of the links at the time of routing

• Routing Protocols Using Future Temporal information

• Expected future status of the links to make decision – trail and error method for path
selection.

• Node Life time

• Remaining battery life, prediction of the location and link availability
MANET Protocol Zoo
 Topology based routing
 Proactive approach, e.g., DSDV.
 Reactive approach, e.g., DSR, AODV, TORA.
 Hybrid approach, e.g., Cluster, ZRP.
 Position based routing
 Location Services:
 DREAM, Quorum-based, GLS, Home zone etc.
 Forwarding Strategy:
 Greedy, GPSR, RDF, Hierarchical, etc.
MANET Protocol Zoo
 Topology based routing
 Proactive approach, e.g., DSDV.
 Reactive approach, e.g., DSR, AODV, TORA.
 Hybrid approach, e.g., Cluster, ZRP.
 Position based routing
 Location Services:
 DREAM, Quorum-based, GLS, Home zone etc.
 Forwarding Strategy:
 Greedy, GPSR, RDF, Hierarchical, etc.
Routing Protocols
 Reactive (On-demand) protocols
Discover routes when needed
Source-initiated route discovery
 Proactive protocols
Traditional distributed shortest-path protocols
Based on periodic updates. High routing overhead
 Tradeoff
State maintenance traffic vs. route discovery traffic
Route via maintained route vs. delay for route discovery
 ROUTING TOPOLOGY
Internet uses hierarchical routing topology in order to reduce the state information
maintained at the core routes. – conventional method.

• Two type of Routing Topology

• Flat Topology Routing
• Hierarchical Routing

• Flat Topology Routing Protocol

• Uses flat address schemes like IEEE 802.3 LANs.
• Globally unique addressing mechanism for nodes.

• Hierarchical topology Routing Protocol

• Make use of the logical hierarchy in the n/w with an associated addressing scheme.
• Could be based on the geographical information on it.
• Could be based on the HOP distance.
 Utilization of Specific Resources

• Mainly focuses on
• Power Aware Routing
• Geographical information assisted Routing

• Power Aware Routing

• Aims at minimizing the battery power.
• Routing decisions are made either globally or locally.

• Geographical information assisted Routing

• Reduce the control overhead by effectively utilizing the geographical information available.
Classification of Routing Protocols
Routing Protocols for Ad Hoc
Networks

Routing Based on Utilization

Based on use temporal Based on Topology
information update of Specific
information for routing Information's
mechanism Resources

Table Driven Power Aware

(Proactive) Path Selection Routing
using the Past Flat Routing
History
On Demand Routing using
(Reactive) Geographical inf
Path Selection Hierarchical
using Prediction Routing

Hybrid
 Routing Information Update Mechanism
• Table Driven (Proactive) Routing Protocol
Continuously evaluates the routes.
Attempt to maintain consistent, up to date routing information.

• When a network topology changes..

The protocol responds by propagating updates throughout the network to maintain the
consistent view.

• Examples are
Destination Sequenced Distance Vector Routing Protocols (DSDV)
 Wireless Routing Protocol (WRP)
 Cluster Head Gateway Routing Protocol (CGSR) – Chk rt
 Source Tree Adaptive Routing Protocol (STAR)
Destination Sequenced Distance Vector Routing Protocols (DSDV)
• DSDV implies
• Destination Sequenced Distance Vector (DSDV) is a hop-by-hop vector
routing protocol requiring each node to periodically broadcast routing
updates.
• This is a table driven algorithm based on modifications made to the Bellman-
Ford routing mechanism.
• Here each node maintains the shortest path to the destination.
• The table consists of Destination, Next node, Distance and sequence
number.
Destination Sequenced Distance Vector Routing Protocols (DSDV)
•

• Incorporates table updates with increasing sequence number tags.

• Prevents loops
• Counter to count the infinity problem
• faster convergence
• Exchange table between neighbors at regular intervals.
• Two types of table updates
• Incremental updates
• Takes a single n\w data packet units (NDPU)
• i.e when there is no significant change in the local topology
• Full Dump update
• Takes multiple NDPU
• When the local topology changes significantly
Example of DSDV
Source Destination
3
1 6 Routing Table For Node 1

Destination Next Node Distance

2 5 6 35 23
4
5 3 2

4 2 2

3 3 1

2 2 1
Example of DSDV

A C

B D
Example of DSDV

A C

B D
Example of DSDV

1
A 2 C
2 E 6

4 5
B D
Example of DSDV

A 0
1
B 2 A 2 C
E 1

2 E 6

4 5
B D
Example of DSDV

A 0
1
B 2 A 2 C
E 1

2 E 6

4 5
B
A
0
2
B D
E 4
Example of DSDV

C 0
A 0
1 D 6
B 2 A 2 C E 2
E 1

2 E 6

4 5
B
A
0
2
B D
E 4
Example of DSDV

C 0
A 0
1 D 6
B 2 A 2 C E 2
E 1

2 E 6

4 5
B
A
0
2
B D D 0
C 6
E 4
E 5
Example of DSDV

C 0
A 0
1 D 6
B 2 A 2 C E 2
E 1

2 E 6

4 5
B
A
0
2
B E 0 D D 0
A 1 C 6
E 4
B 4 E 5
C 2
D 5
Example of DSDV
When A shares its table with E

A 0
1
B 2 A 2 C
E 1

2 E 6

4 5
B E 0 D
A 1
B 4
C 2
D 5
Example of DSDV
When A shares its table with E

1
A 2 C
2 E 6

4 5
B E 0 D
A 1
B 4 A 0
B 2
C 2
E 1
D 5
Example of DSDV
When A shares its table with E

1
A 2 C
2 E 6

4 5
B E 0 D
A 1
To go to B from E, B 4 A 0
Its cost function is 4. B 2
But, through A, its cost function is C 2
only 3 E 1
D 5
Example of DSDV
When A shares its table with E, updated table will have

1
A 2 C
2 E 6

4 5
B E 0 D
A 1
B A 0
3
B 2
C 2
E 1
D 5
Example of DSDV
Adding the sequence number

Desti Next Distance Seq number

C E 3 A-100
B-100
Advantages of DSDV
 It is quite suitable for creating Ad Hoc Networks with small number
of nodes.
 Solve the routing loop problem
 DSDV maintains only the best path instead of maintain multiple
paths to every destinations.
Disadvantages of DSDV
 Requires a regular updates of its routing tables, which uses the
battery power and bandwidth even when the network is idle.
 whenever the topology of the network changes, a new sequence
number is needed.
 DSDV is not suitable for highly dynamic netowrks.
Wireless Routing Protocol

• Each Node maintains 4 tables

• Distance Table
 Containing the network view of the neighbors of the node.
 Distance and Predecessor node for all destinations as seen by each neighbor.
• Routing Table
 Containing view of the network for all known destinations
 The shortest distance to the destinations
 The predecessor node
 The successor node
 Flag indicating the status of the path
• Link Costing table
 Contains cost related information
 Number of hops to reach the destinations (considering the cost of the broken link)
 Number of update periods
• Message Retransmission list (MRL)
 Counter counts for each entry
 Counter is decremented after every retransmission of the updated message
 2 4
Routing Entries at Each Node for Destination 7
3 6
Desti Suce Pred Cost
1 3 1
7 7 7 0
7
4 2 2 6 3 5 8
2 4 5 5 7 5 3
4 7 4 2
2
3 3 3 5 5 4
2 7 2 3
7 1 3 5 6
 2 4
Routing Entries at Each Node for Destination 7
3 6
Desti Suce Pred Cost
1 3 1
7 7 7 0
7
4 2 2 6 3 4 9
2 4 5 5 7 5 3
4 7 4 2
2
3 3 5 5 4
2 7 2 3
7 1 3 5 6
 Reactive - On Demand Routing Protocols
• These protocols finds path to the destinations only when needed to transmit a
packet.
• i.e the protocol reacts when required.
• Various Example Protocols are
Dynamic Source Routing Protocols (DSR)
Ad Hoc On Demand Distance Vector Routing Protocol (AODV)
Location Aided Routing (LAR)
 Associativity Based Routing (ABR)
Signal Stability based Adaptive Routing Protocol (SSA)
• How it Works?
 This protocol periodically exchanges the “Hello” packets.
 This is done to inform the neighbor for the existence of node.
 Dynamic Source Routing Protocols (DSR)
• This is a source based routing protocol
• Everything is sourced from the source and reach the destination.

• The process of route discovery occurs by flooding the Route Request Packets (RREQ)
throughout the mobile network.

• It consists of two phases:

• Route Discovery:
This phase determines the most optimal path for the transmission of data packets between
the source and the destination mobile nodes.
• Route Maintenance:
This phase performs the maintenance work of the route as the topology in the mobile ad-
hoc network is dynamic in nature
• Hence, there are many cases of link breakage resulting in the network failure between the
mobile nodes.
 DSR Protocol Flow
 DSR floods a route request packet in the Network.
 Intermediate nodes forward the route request (if it is not redundant)
 Destination node replies with route reply.
 The Route reply packet contains the path traversed by route request packet.
 The receiver responds only if this is a first Route Request and not a duplicate.

DSR Protocol uses sequence number

RRE packets carries the path traversed and sequence number.
Sequence number is used to prevent loop information and nodes check it.
DSR also uses node cache in each node.
 ID A E B

B
ID A E B-D
Source

A D
ID A E
ID A E C-E
C E
Destin ID A E B-D-C-E
ID A E C

ID A E B-D-C
 Ad Hoc On Demand Distance Vector Routing Protocol (AODV)

• This Protocol is an example for Reactive Routing Protocol.

 i.e Routes are created when there is a demand.
• Its having Route Discovery and Route Maintenance.
• Route Discovery

• Has Route Request (for finding the best direction) and Route Reply (best shortest path)
• Route request is done by broadcast.
• Route reply is a unicast (now the destination node selects the shortest path)

• Route Maintanance – maintains when any error in the route reply request occur.

• Any node wishes to send a data, first checks the routing table.
• If the route exists, it forward to the next node.
• If the route does not exists, it initiates a route discovery.
 Conti …
• Route Request (RREQ) on AODV carries
Source Id

Destination id,

Source Sequence number

Destination Sequence number

Broadcast ID

TTL – time to live

 Working Procedure
Nodes first raises RREQ and forwarded to all the neighboring nodes.

Two possibilities are there in neighboring.

 If it does not have a valid route to destination, it just forward the RREQ .
 If it has a valid route, the node prepares a Route Reply msg.

 If the route request is received multiple times, the duplicate copies are discarded.
 Done using the broadcast id and source id pairs.

 When RREQ is forwarded, the address of the previous node and its broadcast id is stored which is need to forward the
packet to the source.

 If route reply is not received before a specific time, the entry is deleted.

Either the destination or the intermediate node response with a valid route.

 When a RREQ is forwarded back, the address of the previous node and broadcast ID is stored – needed to forwardd the
pack to destination.
 Protocol Flow

RREQ
6 Route Reply Message

1 4
Node 6 Knows the path to reach the
5 destination.

3 7 Node 6 gives a Route Reply Message.

2
Node 1 Sends a data packet to Node 7
Node 1 Sends a RREQ Packets to its Neighbors.

Source Address : 1
Destination Address : 7
Broadcast ID : Broadcast ID + 1
Source Sequence No : Source Sequence No + 1
Destination Sequence No – Last Destination sequence number for node 7