broadcasting in udg radio networks with unknown topology
DESCRIPTION
Broadcasting in UDG Radio Networks with Unknown Topology. Weizmann Liverpool Weizmann Québec Weizmann Liverpool. Yuval Emek, Leszek Gąsieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su,. stations = points in. UDG radio networks. transmitting range = 1. unit disk graph – UDG - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/1.jpg)
Broadcasting in UDG Radio Networks with Unknown Topology
Yuval Emek, Leszek Gąsieniec,
Erez Kantor, Andrzej Pelc,David Peleg, Chang Su,
WeizmannLiverpoolWeizmannQuébecWeizmannLiverpool
![Page 2: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/2.jpg)
UDG radio networks
1stations = points in 2
in every round: transmit or receive
transmitting range = 1
unit disk graph – UDG
(nodes, edges, paths, …)
message heard iff exactly one neighbor transmits
else: silence or collision (same effect)
distributed synchronous model
![Page 3: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/3.jpg)
wu
v
(2) single transmission(1) no transmission (silence)
(3) multiple transmission v can receive the message from u
v cannot receive the message
distributed synchronous model
![Page 4: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/4.jpg)
wu
v
(1) no transmission (silence)
(3) multiple transmission
v cannot receive the message
collisions cannot be distinguished from silence
distributed synchronous model
![Page 5: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/5.jpg)
Unknown topology (ad hoc)
each node knows its own coordinates
does not know the:
• the number of nodes
• the diameter
a unique coordinate system
• coordinates of any other node
![Page 6: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/6.jpg)
Unknown topology (ad hoc)
known granularity g =
inverse of minimum Euclidean distance
1
d
dg /1
typically: d is much smaller then 1 and g is much larger than 1
dvu ||,|| , for every pair of nodes
![Page 7: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/7.jpg)
Broadcasting
a distinguished source node
source’s message should be heard by all nodes
remote nodes – use graph’s paths
connected graphs
![Page 8: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/8.jpg)
Broadcasting
conditional wake up: - nodes are initially idle
spontaneous wake up:
– all nodes are awake from the beginning
wakes up upon hearing a message
two models are considered:
execution time =
#rounds until all nodes hear the source’s message
![Page 9: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/9.jpg)
Deterministic model
decisions of a node on round t depends only on:
• own coordinates
• messages heard so far
• t itself
![Page 10: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/10.jpg)
This work
execution time depends on two parameters:
= diameter of the UDG network (in hops)D
not Euclidean diameter
dg /1= granularity: inverse of min Euclidean distance
s v
![Page 11: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/11.jpg)
This work
DgO gD
2),log(min gDgD
conditionalwake up
lower boundupper bound
spontaneouswake up
![Page 12: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/12.jpg)
Previous results
roughly divided into 2 subareas:
centralized: complete knowledge, designing fast schedulers
distributed: local knowledge, designing fast protocols (this work)
![Page 13: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/13.jpg)
Centralized model
Chlamtac, Kutten ’85: formulating the model of radio networks
Chlamtac, Weinstein ‘91
Gaber, Mansour ‘95
Elkin, Kortsarz ‘05
Gasieniec, Peleg, Xin ‘05
Kowalski, Pelc (to appear)
from nDO 2log
to nOD 2log
Alon, Bar-Noy, Linial, Peleg ’91: constant D n2log
![Page 14: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/14.jpg)
Distributed model
Bar-Yehuda, Goldreich, Itai ’92: nnDO 2loglog
Kushilevitz, Mansour ’98: DnD /log
unknown topology, no labels, randomized:
first to study distributed broadcasting (also deterministic)
Czumaj, Rytter ’03: nDnDO 2log/log (tight!)
![Page 15: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/15.jpg)
Distributed model
Kowalski, Pelc ’05: unknown topology, knowing own labels, conditional wake up, deterministic
Dn
nn
/log
log
Chlebus, Gasieniec, Gibbons, Pelc, Rytter ’02: nO
unknown topology, knowing own labels, spontaneous wake up, deterministic:
Kowalski, Pelc ’05: n
![Page 16: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/16.jpg)
Spontaneous wake up – lower bound
Theorem. deterministic broadcasting algorithm A, and choice of parameters D,g, UDG network N of diameter D and granularity g s.t. A requires
2),log(min gDgD
rounds to broadcast in N under the spontaneous wake up model.
![Page 17: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/17.jpg)
Chain networks
clusters D ,,1
k consists of 2g cells
g
g
1 2 3 D
each cell may be occupied with a node or empty
source cell (always occupied) in source cluster 0
0
each cluster contain at least one occupied cell
![Page 18: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/18.jpg)
Chain networks
there is no edge between any and any for |k-i|>1
1 2 3 D
1
10
clusters 1 ii form a clique
iu kv
![Page 19: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/19.jpg)
1 2 3 D
0
the message go from directly to 0 1
2D 1D
Chain networks
from to when only one node from transmit the messagei 1i i
![Page 20: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/20.jpg)
1 2 3 D
0
the message go from directly to 0 1
2D 1D
Chain networks
from to when only one node from transmit the messagei 1i i
![Page 21: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/21.jpg)
1 2 3 D
02D 1D
Chain networks
if there exists a node in that heard the message i
then all the nodes of must being heard the source message
i ...21
![Page 22: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/22.jpg)
The broadcasting algorithm A
does not know which cells are occupied and which are empty (except the source)
knows that there is at least one occupied cell in every cluster
knows the coordinates of the cells
St = cells scheduled to transmit on round t by A
a typical instruction: “transmit if occupied”
ktt
k SS
![Page 23: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/23.jpg)
The adversary
decides for every cell whether occupied or empty
goal: slow down the broadcasting algorithm
decisions are made separately for every k and online based on t
kS
![Page 24: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/24.jpg)
Game between the algorithm and the adversary
1k k 1k
(2) silence / collision
(1) single transmission
tkS
tkS 1
tkS 1
algorithm can learn? what u can learn?
u
St schedule to transmit
adversary decide:
1)(# tks
tkSO# = number of occupied cells in tS
![Page 25: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/25.jpg)
u
Game between the algorithm and the adversary
1k k 1k
(1) reveal these cells (occupied/empty)
(2) report silence / collision
must be consists with previous reports
1)(# tks
tkS
tkS 1
tkS 1
adversary:
![Page 26: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/26.jpg)
u
Game between the algorithm and the adversary
1k k 1k
• algorithm knows v
(u hear v)
(2)
(1)
v
algorithm can learn whether:
tkS
tkS 1
}{1 vS tk
0)(# tkS
1)(# tkS (u did not hear v)
St schedule to transmit by the algorithm
![Page 27: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/27.jpg)
u
Game between the algorithm and the adversary
1k k 1k
(1) reveal these cells (2) report silence / collision
must be consists with previous reports
1)(# tks(2) report that collision occur
tkS
tkS 1
}{1 vS tk adversary:
![Page 28: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/28.jpg)
1i i 1i
ti = first round on which the nodes of i receive the message
, number of round for delivering the message from i to i+1
iii tt 1
Lower bound
![Page 29: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/29.jpg)
Lower bound1i i 1i
)log(giti
for ti<cg2
, for i<cg2/log (g)
)log(1 gtt iiiadversary guarantees :
execution time: 2),log(min gDgD
![Page 30: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/30.jpg)
Conditional wake up – lower bound
![Page 31: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/31.jpg)
Conditional wake up – lower bound
chain network
diameter 2
N1 N2 N3 ND/2
g rounds g rounds
g rounds
g rounds
execution time: gD
![Page 32: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/32.jpg)
Conditional wake up – lower bound
Theorem. deterministic broadcasting algorithm A, and g, UDG network N of diameter 2 and granularity g s.t. A requires
g
rounds to broadcast in N under the conditional wake up model.
![Page 33: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/33.jpg)
The network N
1
11
g
blocksg
in each block:g auxiliary cells
opposite each block:
a target cell
g auxiliary cells target
exactly 1 target cell is occupied
1>
1>
![Page 34: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/34.jpg)
The network N
1
1
auxiliary target
there is at least one occupied cell in the block that opposite to the occupied target cell
the network is connected
1
1
target cell is outside of thetransmitting range of any other blocks
1
![Page 35: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/35.jpg)
Adversary
can no longer guarantee that no messages are being heard
distinguish silence from collision (stronger model)
![Page 36: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/36.jpg)
Game between the algorithm and the adversary
Adversary:(1) reveal some cells
(3) report: silence / collision
2)(# ts(2) report: collision occur
st
![Page 37: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/37.jpg)
Adversarial policy
on every round we “kill” at most 1 block and reveal at most 1 cell in each “live” block
execution continues for g rounds
dead blocks – all cells are revealed, target cell is empty
![Page 38: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/38.jpg)
The concatenate network
1
1
the target cell of Ni is inside of the transmitting range of the next source node si+1
the auxiliary cells of Ni is outside the transmitting range of the next source node si+1
![Page 39: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/39.jpg)
The concatenate network
1
1
the message must be delivered via target nodes and auxiliary nodes
![Page 40: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/40.jpg)
The concatenate network
1
1
g g g
execution time: gD
![Page 41: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/41.jpg)
DgO gD
2),log(min gDgD
conditionalwake up
lower boundupper bound
spontaneouswake up
Summary
![Page 42: Broadcasting in UDG Radio Networks with Unknown Topology](https://reader035.vdocuments.us/reader035/viewer/2022070410/568146b7550346895db3de17/html5/thumbnails/42.jpg)
END
Thank You!!!