anthocnet routing algorithm
TRANSCRIPT
![Page 1: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/1.jpg)
ANTHOCNETHYBRID ROUTING ALGORITHM
FOR MANET
Guided ByShalini LAsst. Prof. CSE Dept.
Presented ByDhanith Krishna BS7 CSE
![Page 2: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/2.jpg)
1
Presentation Structure
INTRODUCTION
MANETS
CHALLENGES IN MANETS
ROUTING ALGORITHMS
ANTHOCNET
REACTIVE ROUTE SETUP
PROACTIVE ROUTE MAINTENANCE
STOCHASTIC DATA FORWARDING
LINK FAILURES
ADVANTAGES
![Page 3: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/3.jpg)
2
History
First network – ARPANET
![Page 4: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/4.jpg)
3
History
First Wireless network – ALOHANET
![Page 5: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/5.jpg)
4
Traditional Networks
Fixed infrastructure
Dedicated Communication Devices
AP
BA
![Page 6: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/6.jpg)
5
MANET
MOBILE AD HOC NETWORK
Continuously self-configuring
Infrastructure-less network
Connected without wires.
A B C D
![Page 7: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/7.jpg)
6
MANET
Each device is router.
![Page 8: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/8.jpg)
7
Properties
Host movement frequent
Topology change frequent
Decentralized and scalable
![Page 9: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/9.jpg)
8
Examples
VANET
![Page 10: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/10.jpg)
9
Examples
TACTICAL NETWORKS
![Page 11: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/11.jpg)
10
Routing ???
selecting best paths in a network.
![Page 12: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/12.jpg)
11
Challenges
Dynamic topology
Unidirectional Links
Power Constraints
![Page 13: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/13.jpg)
12
Where to find
an answer ?
![Page 14: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/14.jpg)
13
Ants Ants Everywhere
![Page 15: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/15.jpg)
14
Ants
Can explore vast areas without global view of the ground.
Can find the food and bring it back to the nest.
Will converge to the shortest path.
![Page 16: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/16.jpg)
15
Ants
Communication using pheromones.
Explored area is marked with pheromone
Other ants find explored path by sensing pheromones
![Page 17: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/17.jpg)
16
Double Bridge Experiment
![Page 18: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/18.jpg)
17
Back to
Reality
![Page 19: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/19.jpg)
18
Routing Protocols
Proactive Routing ProtocolsTable DrivenEach Node Knows Network Topology
Reactive Routing ProtocolsOn Demand Routing
![Page 20: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/20.jpg)
19
AntHocNet
Hybrid Routing Protocol
Has both Reactive and Proactive components
Developed by Di Caro et al
![Page 21: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/21.jpg)
20
Overview
Reactive path setup
Stochastic data routing
Proactive path maintenance and exploration
Handling of link failures
![Page 22: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/22.jpg)
21
Data Structures
Pheromone Table
Neighbour Table
Each node has two tables
![Page 23: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/23.jpg)
22
Pheromone Table
Regular Pheromone rijd
Virtual Pheromone wijd
Average Hop Count hijd
Helps in making routing decisions
![Page 24: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/24.jpg)
23
Neighbour Table
Helps in identifying neighbours of a node
![Page 25: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/25.jpg)
24
Reactive path setup
Occurs when path from source to destination is unknown.
S
F
A
H
G
B C
I
J
DSource Destination
![Page 26: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/26.jpg)
25
Reactive path setup
A reactive forward ant is broadcasted from source to destination.
S
F
A
H
G
B C
I
J
DSource Destination
[s]
[s]
![Page 27: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/27.jpg)
26
Reactive path setup
Intermediate node unicasts or broadcasts ant packet to neighbours depending on whether it knows the route to destination or not.
S
F
A
H
G
B C
I
J
DSource Destination
[S,A]
[S,F]
![Page 28: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/28.jpg)
27
Reactive path setup
A node that receives two copies of an ant forwards only one ant.
S
F
A
H
G
B C
I
J
DSource Destination
[S,A,B]
[S,F,H]
[S,F,G]
![Page 29: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/29.jpg)
28
Reactive path setup
This method of working is called flooding.
S
F
A
H
G
B C
I
J
DSource Destination
[S,A,B,C]
[S,F,H,I]
[S,A,B,G]
![Page 30: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/30.jpg)
29
Reactive path setup
S
F
A
H
G
B C
I
J
DSource Destination
[S,A,B,C]
[S,F,H,I]
![Page 31: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/31.jpg)
30
Reactive path setup
First ant reaching destination finds the best path
S
F
A
H
G
B C
I
J
DSource Destination
[S,A,B,C,D]
[S,F,H,I,J]
![Page 32: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/32.jpg)
31
Reactive path setup
Other ants are rejected.
S
F
A
H
G
B C
I
J
DSource Destination
[S,F,H,I,J,D]
![Page 33: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/33.jpg)
32
Reactive Backward Ant
First ant to reach destination is made a backward ant.
It traverses the best path in reverse.
On the way the pheromone table is updated at all visiting nodes.
![Page 34: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/34.jpg)
33
Reactive Backward Ant
Hop count is updated as
Regular pheromone is updated as
![Page 35: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/35.jpg)
34
Data Routing
Once path is setup data is stochastically routed.
![Page 36: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/36.jpg)
35
Data Routing
I
D
A
B
C
Source Destination
![Page 37: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/37.jpg)
36
Proactive Path Maintenance
Pheromone Dissolution
End to End path sampling
![Page 38: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/38.jpg)
37
Pheromone Dissolution
Every node broadcasts a hello message to all neighbours.
The pheromone table is piggybacked to the hello packet.
![Page 39: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/39.jpg)
38
End to End Path Sampling
While the session is active proactive ant agents explore to find additional paths.
Proactive ants like forward ants update pheromone table when it becomes a backward ant.
![Page 40: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/40.jpg)
39
Link Failures
Hello messages help to find link failures.
The link failure is notified to all nodes by flooding.
Repair ants try to find alternate path to destination if failure is in the midst of a transmission.
![Page 41: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/41.jpg)
40
Advantages
Automatic load Balancing.
Higher Delivery ratio.
Robust , Adaptive and scalable.
![Page 42: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/42.jpg)
41
References
[1] The internet engineering task force mobile ad-hoc networkingpage(MANET). Available from: http://www.ietf.org/html.charters/manet-charter.html.
[2] Microsoft Mesh Networks. Available from: http://research.microsoft.com/mesh/.
[3] ANTHOCNET, Available from http://www.idsia.ch/~frederick /anthocnet/anthocnet.html
[4] B. Baran and R. Sosa. A new approach for AntNet routing. InProceedings of the 9th International Conference on ComputerCommunications Networks, Las Vegas, USA, 2000.
![Page 43: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/43.jpg)
Thank You
![Page 44: Anthocnet routing algorithm](https://reader034.vdocument.in/reader034/viewer/2022051400/55a95f9d1a28ab65308b46d0/html5/thumbnails/44.jpg)
Queries