![Page 1: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/1.jpg)
Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication
Suman Banerjee, Archan Misra, Jihwang Yeo and Ashok Agrawala
IEEE Wireless Communications and Networking Conference
(WCNC) 2003
Speaker: Ju-Mei Li
![Page 2: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/2.jpg)
Outline
Introduction Calculating Energy Costs Retransmission-Aware Minimum
Energy Trees Performance Comparisons Conclusions
![Page 3: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/3.jpg)
Introduction
In wireless environments Individual links often have high error
rates Currently minimum-energy tree
formation algorithms Assign costs to links based on the
energy spent in a signal transmission Do not consider the link error rates
![Page 4: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/4.jpg)
Introduction
Wieseltheir et al [10] Have constant approximation ratios to th
e optimal solution for error-free wireless links
Three broadcast tree formation algorithms
Broadcast Incremental Power (BIP) Broadcast Least-Unicast-cost (BLU) Broadcast Link-based MST (BLiMST)
![Page 5: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/5.jpg)
Introduction: BIP
1
4
3
9
7
6
10
2
8
5
![Page 6: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/6.jpg)
Introduction: BLU and BLiMST
1
4
3
9
7
6
10
2
8
5
1
4
3
9
7
6
10
2
8
5
BLU BLiMST
![Page 7: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/7.jpg)
Assumption
Error rate pi,j for any link (i, j): 30~40% No mobility Packet will be retransmission until all children rec
eive it ACK
Chooses minimum power to reach each child which does not receive broadcast packet
NAK: just one NAK will be received by sender Use a transmission power to reach all children on the tree
![Page 8: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/8.jpg)
Calculating Energy Costs
Packet error rate, S[i].error = p = 1 – (1 - pb)s
S[i].not_rcv_prob = S[i].not_rcv_prob * (S[i].error)tx
pb is the bit error rate and
s is the packet size
Nerfcpb
rconstant.P
![Page 9: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/9.jpg)
Calculating Energy Costs: ComputeTxCost(x, S)
x
i1
i2
i3
i1
The set within the transmission power and is sorted by decreasing order of distance
from x
For i1
Px,i1: transmission a packet from x to i1
Ex,i1: single transmission power
Use Px,i1 i1.error, i2.error and i3.error
Use i1.error tx (number of reliable transmissions of i1)
Use tx, Ex,i1 and i1.not_rcv_prob cost of i1
Update i2.not_rcv_prob and i3.not_rcv_prob
For i2
Px,i2: transmission a packet from x to i1
Ex,i2: single transmission power
Use Px,i2 i1.error, i2.error and i3.error
Use i2.error tx (number of reliable transmissions of i2)
Use tx, Ex,i2 and i2.not_rcv_prob cost of i2
Update i3.not_rcv_prob
i2
i3
For i3
Px,i3: transmission a packet from x to i1
Ex,i3: single transmission power
Use Px,i3 i1.error, i2.error and i3.error
Use i3.error tx (number of reliable transmissions of i3)
Use tx, Ex,i3 and i3.not_rcv_prob cost of i3
![Page 10: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/10.jpg)
Retransmission-Aware Minimum Energy Trees
RBIP RBLU RBLiMST Sweep algorithm Multicast trees
![Page 11: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/11.jpg)
Retransmission-Aware Minimum Energy Trees: RBIP
61
4
3
2
5
7
6
4
3
2
5
7
Update cost and parent of node 5 and
node 6
Update Cost and parent of node 3 and
node 4
![Page 12: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/12.jpg)
Retransmission-Aware Minimum Energy Trees: RBIP
61
4
3
2
5
7
Like the BLU, but the cost of link (i, j) Ei,j (reliable) = Ei,j * (1/1 – pi, j)
![Page 13: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/13.jpg)
Retransmission-Aware Minimum Energy Trees: RBLiMST
Like extension of BLiMST algorithm
61
4
3
2
5
7
![Page 14: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/14.jpg)
Retransmission-Aware Minimum Energy Trees
Sweep algorithm in a post order traversal of the tree Δy = ComputeTxCost(y, Cy – {x}) – ComputeTx
Cost(y, Cy)
Δz = ComputeTxCost(z, Cz {x}) – ComputeTxCost(z, Cz)
x
y
z
Cy
Cy
Cz
Cz
Cz
![Page 15: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/15.jpg)
Retransmission-Aware Minimum Energy Trees
Multicast trees Compute the broadcast tree without
using sweep algorithm Delete nodes which do not lead to
any multicast group numbers (in a single post-order traversal)
Sweep algorithm are performed on the remaining tree (in post-order)
![Page 16: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/16.jpg)
Performance Comparisons
100 nodes Network environment
Random Grid: 100*100 square gird
100 runs for each result
![Page 17: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/17.jpg)
Performance Comparisons: ACK
![Page 18: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/18.jpg)
Performance Comparisons: ACK
![Page 19: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/19.jpg)
Performance Comparisons: ACK
![Page 20: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/20.jpg)
Performance Comparisons: NAK
![Page 21: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/21.jpg)
Performance Comparisons: NAK
![Page 22: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/22.jpg)
Performance Comparisons: NAK
![Page 23: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/23.jpg)
Conclusions
for multi-hop wireless environments Present energy-efficient reliable
broadcast and multicast schemes ACK NAK
![Page 24: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/24.jpg)
End
![Page 25: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/25.jpg)
![Page 26: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/26.jpg)
![Page 27: Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication](https://reader035.vdocument.in/reader035/viewer/2022081516/56813494550346895d9b7f94/html5/thumbnails/27.jpg)