Mobile ad hoc networks (MANET)
Mobile ad hoc networks (MANET)
Mobile ad hoc networks (MANET)
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The PACMAN concept<br />
Robustness by a hybrid approach as well as coupling with routing<br />
Distributed allocation table and Duplicate Address Detection (DAD)<br />
Implicit support for network merging<br />
Efficiency by cross-layer/passive mechanisms<br />
Passive DAD by anomaly detection in routing protocol traffic<br />
Passive synchronization of the allocation table<br />
Reduction of dependencies by modular architecture<br />
Routing protocol<br />
instance<br />
Application<br />
comm.<br />
Transport.<br />
<strong>Mobile</strong> <strong>ad</strong> <strong>hoc</strong> <strong>networks</strong> 47<br />
Routing protocol<br />
packets<br />
PACMAN<br />
Network<br />
Data Link<br />
Physical<br />
PACMAN:<br />
Passive Autoconfiguration<br />
for <strong>Mobile</strong> Ad <strong>hoc</strong> Networks<br />
www.tm.uka.de<br />
Example: Neighborhood History (NH) Module<br />
Model of a proactive link-state routing protocol<br />
Nodes periodically send routing protocol messages<br />
Source <strong>ad</strong>dress (SA)<br />
Sequence number (SN)<br />
Set of bidirectional link states (LS)<br />
Each node forwards them<br />
Principle of the NH module<br />
Utilization of bidirectional<br />
neighborhood relationships<br />
Maintenance of an NH table<br />
with <strong>ad</strong>dresses which were<br />
neighbors in the past time span t d<br />
3<br />
A<br />
B<br />
SA: 4<br />
SN: 5<br />
LS: 1,2,3<br />
4 1<br />
D E<br />
2<br />
NH table(C)<br />
2,3<br />
C<br />
1<br />
NH: Neighborhood History<br />
<strong>Mobile</strong> <strong>ad</strong> <strong>hoc</strong> <strong>networks</strong> 48<br />
www.tm.uka.de
Change language