Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Broadcasting - applications
Alarm signal
Route discovery in non-GPS routing
Paging
Destination search in GPS routing:
- Source S broadcasts short message that will search for
destination D
- Destination D will route back to S with a short message
location report
- S will route full message to D
Tx with probability p
Area-based Methods
Observation
If a receiving node is very close to the sender
The additional area covered by the receiver is very small.
2D ABBA protocol
After receiving the first copy of message, node decides
about waiting period and evaluates coming transmissions
At end of timeout, if its circle is not fully covered, it
retransmits. Otherwise it remains silent.
Timeout can de decided in different ways: at random, or
based on portion of covered perimeter etc.
Distance-based Scheme
Protocol (when a new packet is received)
Initiate a RAD.
Decisions based on RAD
RAD has not expired: Cache all redundant packets.
RAD expires: examine the locations of all senders
of the redundant packets:
If the distance between this node and any node (from
above) is less than a threshold, drop the packet.
Else, retransmit the packet.
SBA (contd.)
Dynamic adjustment of RAD
RAD is proportional to (dNmax/dme) , where
dNmax is the max neighbor degree among all neighbors.
dme is the nodes neighbor degree.
Dominant Pruning
Assumption: Nodes know their 2-hop neighbors.
(Unlike SBA) Rebroadcasting nodes proactively choose
some/all of their 1-hop neighbors as rebroadcasting nodes.
Packet received
Chosen by
to retransmit
Multipoint Relaying
Similar to Dominant Pruning
Forwarding nodes are chosen by upstream senders.
Forwarding nodes are called multipoint relays (MRPs).
Computation of MRPs
1. Initialize: MRP = {one 1-hop neighbor}.
2. Determine the 2-hop neighbors that are reachable via the MRP set.
3. Identify a new 1-hop neighbor that will cover most of the uncovered
2-hop neighbor, and add it to MRP.
4. Repeat steps 2-3 until all 2-hop neighbors are covered.
Lowest ID clustering
11
10
Clusterheads: 1,6,7,11
Borders: 2,5,8,9,10
Maintenance overhead
Broadcasting:
Clusterheads and borders retransmit:
9 out of 11 nodes (one-to-all)
Lowest ID clustering
first cluster
(Lin, Gerla 1997)
11
10
next?
Lowest ID clustering
3
11
10
next ?
Lowest ID clustering
3
fourth cluster
11
10
G
B
Neighbor Elimination
G
1/1
11
7
1/2 2
6
1/3
3
10
12
1
1/3
4
14
13
NE Example (contd.)
1 is not aware that 9 was covered already and vice versa
1/1-1/3
10
11
7
1/1-1/3
6
12
1
1/1
4
1/3
14
13
NE Example (contd.)
Node 7 is not aware that 10 received the message
1/1-1/3
10
11
1/3
1/1-1/3
6
12
5
1
1/1
1/2
4
1/1
14
13
NE Example (contd.)
10
11
7
1/1-1/3-1/3
2
12
1
1/1-1/3
1/2-1/3
1/1-1/3
14
13
NE Example (contd.)
10
11
7
1/1-1/3-1/3-1/6
2
12
5
1
3
1/1-1/3-1/6
4
13
NE Example (contd.)
10
11
7
12
1
4
13
Broadcasting by covering DS
(Stojmenovic, Seddigh, Zunic 2002)
1/3
Source = C
H
F
1/2
K
L
A
Source = C
H
F
M
1/3
G
1/1-1/3
E
Second retransmission =A, timeouts at H and G
K
L
A
Source = C
H
F
M
Final retransmission at H
G does not transmit
K
E
A
S
S: source or
relay of
retransmitting node
Forwarding neighbors
U
C
A
P
D
B
E
I
H
Pij
i
Pik
g
f
1.2
3
0.3
1.1
h
0.5
1.3
j
1.7
1.3
1.5
0.9
c
0.7
0.8
i
a
a
0
0
0.3
0.5
b
c
Pa
0.3
1.1
1
0.3
1.3
j
0.9
c
0.7
Pb
Pbd b
0.8
i
Pb b
0
1
Pb= 1 0 = 1
Pa a
1.7
b
d
1.3
1.5
1.2
0.5
Pac a
Pa
g
f
Pa a
0.3
1.1
1.3
j
Pcj c
h
0.5
0.9
c
0.7
0.5
Pc
0.7
0.8
i
Pbd b
Pb
1
Pb = 1 0 = 1
0
1
Pc c
Pb b
0
1.7
b
d
1.3
1.5
1.2
1.3
Paj a
g
f
And so forth
0.3
1.1
1
ch
h
0.5
1.3
j
ci
1.7
b
d
1.3
1.5
1.2
bd
0.9
be
0.7
0.8
bf
bg
0
0
RBOP (contd.)
The node C also receives the message from S.
C resends the message with range d(C,D).
It is received by nodes D, E but also F even if it is not a RNGneighbor.
F applies neighbor elimination for transmissions coming from
non-RNG edges to make neighborhood smaller.
F eliminates E for this broadcast message.
The set of remaining neighbors for F contains only A.
At the same time E decides not to send the message since all its
RNG-neighbors are eliminated with message from C.
RBOP (contd.)
When A forwards the message, F
and G eliminate A from their
respective neighborhood list and
terminate the protocol for this
broadcast since their lists are
empty.
The broadcast is accomplished by 3
transmissions:
- from S with radius d(S;A),
- from C with radius d(C;D) and
- from A with radius d(A;G)