neighborhood
neighboorhood discovery protocol
request broadcast then reply by the one hearing -> discovery each otheres id message carried node identifier
attack: jamm so they dont see each other
create relationship far away ndoes like wormholes
routes shorter usually take shortest path _> eavesdrop or blackholing
detection wormholes
centralized : base staion for example creates the graph and detect anomalys or inconsistencys
decentralized node sneed tob e mroe complex cuz every node needs to detect inconsistencys
wormholes increase numbers of edges in connectivity graph
detecting by statistically hypothesis testing mehtods like x^2 chi quadrat test
mds
multi dimensional scaling
estimate distances
angreiffer muss also distanz manipulieren fällt aber auf weil virtuelles layout verzerrt
packet leashes
ensure pakcets not too far
geo:
each node has gps receiver
gps into header
receiving node can verify if within its range
time:
nodes clock tightly syncronized
timestamp into header
receiver estimate distance based to time it took to reahc receiver
anchor
anchor have gps and know own position
they have more range
rules:
must be in communication field
and see more than T anchors
anchor has gps in header
how mitigate wormholes:
must not be more than 2 anchor that r 2R away eahc other
double msges if they receive msg twice for same anchor = wormhole
anchor used one time password in every msg send
Last changed8 days ago