Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast...
-
Upload
ernest-dawson -
Category
Documents
-
view
213 -
download
0
Transcript of Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast...
![Page 1: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/1.jpg)
Ming-Yu Jiang and Wanjiun Liao ,IEEE ICC 2002
Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks.
Speaker : Wilson LaiDate : 91.11.26
![Page 2: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/2.jpg)
Outline• Introduction• FAT Protocol• Performance Evaluation• Concluding Remarks• Question & Discussion• My research
![Page 3: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/3.jpg)
Introduction
• Family ACK Tree (FAT) support reliable multicast service in ad hoc networks.
• It employs a tree-based recovery mechanism that localizes ACKs and retransmissions to avoid feedback implosion.
• FAT constructs an ACK tree to maintain the family relation.
![Page 4: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/4.jpg)
What is Reliable Multicast?S
B
J N
A
G
E
K
D
L
O
I
F
ACK
ACK implosion
S
B
J N
A
G
E
K
D
O
I
F
NACK
NACK implosion
![Page 5: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/5.jpg)
Definition of a Family ACK Tree
D
A
CB
E
F G
GID
Grandparent’s family
PID
Parent’s family
CID
Node’s family
![Page 6: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/6.jpg)
Control message types
• Ad : sub-group ID advertisement– It is used to configure the ACK table of each
node in a family ACK Tree.– Each mobile node periodically broadcasts
beacons to its neighbors.
• RTQ : retransmission request– It is used to report s loss gap to its reliability
agent and to request for a retransmission.
![Page 7: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/7.jpg)
The construction of FATS
All nodes on the multicast tree are involved in the sub-group IDAdvertisement process. Through this process, all nodes are able to acquire their GIDs/PIDs/CIDs to configure their ACK tables.
(CID)
(PID,CID)
(GID,PID,CID)
![Page 8: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/8.jpg)
The maintenance of FAT (1/4)
• Upon receipt a reliable multicast packet, a node caches it with a predefined timer Tc; otherwise, the node negatively acknowledges the packet for a retransmission upstream to its parent on the ACK tree and start a predefined timer Tr.– If no any retransmission request on expiry of Tc, the no
de removes the packet from the buffer; otherwise, retransmits the packet to the sender of NAK.
– If no retransmission from its parent on expiry of Tr, an RTQ is resent.
![Page 9: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/9.jpg)
• When a node departs, the one hop neighbors will be informed.
• The nodes notified may include the parent node, the children nodes, and sibling nodes.
• The departing node forwards the packets in its cache upstream to its parent. This rollbacks the parent’s buffer and allows the grandparent to serve as the foster parent for its grandchildren.
The maintenance of FAT (2/4)
![Page 10: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/10.jpg)
The maintenance of FAT (3/4)S
Sub-tree
Request message
Glue back
Once an orphan node has reconnected to the tree, it reconfigures its ACK table and identifies the missing packets in which the new parent node is unable to repair. The node then negatively acknowledges the loss gaps to its previous GID and requests for retransmissions.
![Page 11: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/11.jpg)
The maintenance of FAT (4/4)
normal state(current ACK table)
repairing state(previous and current
ACK table)
Detecting a departure of the parent
Repair the missing packets
A node receives an RTQ whose GID
match its PIDDiscard
the request
Encapsulates the RTQ andforwards to itsprevious GID
When a node,say F, receives an RTQ whose GID matches its CID, node F must be the grandparent of the requesting node. If the received request is encapsulated, node F decapsulates the request to identify the original requesting node, say node O; otherwise, the request sender must be the original requesting node. Node F then retransmits the requested packets directly to node O.
![Page 12: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/12.jpg)
Simulation setup
• The packet transmission was error-free and all the loses were caused by node movements.
• A 100-by-100 mesh in which nodes were roaming across the mesh .
• The distance between two adjacent intersection points on the mesh is 20 meters.
• Randomly selected N nodes in the mesh, only one sender and the rest are group members.
![Page 13: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/13.jpg)
Simulation setup…
• Each node stayed in a location with an exponentially distributed sojourn time with a mean of M.
• Each node had a transmission range is 20 meters.
• The sender generated data packets at a constant rate of one packet per second.
![Page 14: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/14.jpg)
Simulation results(1/4)
The inverse of the mean time that anode stays at alocation.
The ratio of the number of the granted requests to the total number of the received requests.
![Page 15: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/15.jpg)
Simulation results(2/4)
![Page 16: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/16.jpg)
Simulation results(3/4)
The total number of retransmissionRequests multiplied by the averagePath length traversed by eachRetransmitted packet.
![Page 17: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/17.jpg)
Simulation results(4/4)
![Page 18: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/18.jpg)
Conclusion
• FAT employs a tree-based recovery mechanism that localizes ACKs and retransmissions.
• The results show that FAT achieves the best performance in providing reliable service in ad hoc networks, in terms of reliability, scalability, and delivery efficiency.
![Page 19: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/19.jpg)
Question & Discussion
• Cost +
• Control overhead ?
![Page 20: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/20.jpg)
My Research
• All-to-all communication
• Load balance
![Page 21: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/21.jpg)
Communication category
A B•Unicast : one-to-one
•Anycast : one-to-anyone AB
C
D
•Broadcast : one-to-allA
B C D•Multicast :
One-to-some S1
R1
R2
R3
many-to-many S2
S1 R2
R3
R1
all-to-all
ae
f
b g
![Page 22: Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.](https://reader035.fdocuments.in/reader035/viewer/2022070407/56649e2a5503460f94b17d3a/html5/thumbnails/22.jpg)
Protocol Introduction
headergateway
ordinary
•One-hop neighbor form a cluster and use adaptive TDMA in dense location.•Per-source tree be created between cluster and cluster