• Title of article

    Family ACK tree (FAT): supporting reliable multicast in mobile ad hoc networks

  • Author/Authors

    Liao، Wanjiun نويسنده , , Jiang، Ming-Yu نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2003
  • Pages
    -1674
  • From page
    1675
  • To page
    0
  • Abstract
    A new protocol, called family ACK tree (FAT), is proposed to support a reliable multicast service for mobile ad hoc networks. For each reliable multicast protocol, a recovery scheme is used to ensure end-to-end delivery of unreliable multicast packets for all group members. FAT employs a tree-based recovery mechanism that localizes ACKs and retransmissions to avoid feedback implosion. To cope with node movements, FAT constructs an ACK tree on which each node maintains reachability information to three generations of nodes on the ACK tree. When a tree is fragmented due to a departed node, the fragments are glued back to the tree using the underlying multicast routing protocol. FAT then adopts an adaptive scheme to recover missed packets that have been multicast to the group during fragmentation and are not repaired by the new reliability agent. We have conducted simulations to compare the performance of FAT with existing solutions. The results show that FAT achieves better performance for the provision of reliable service in ad hoc networks, in terms of reliability, scalability, and delivery efficiency.
  • Keywords
    Function algebra , C^*-algebra , Toeplitz representation
  • Journal title
    IEEE Transactions on Vehicular Technology
  • Serial Year
    2003
  • Journal title
    IEEE Transactions on Vehicular Technology
  • Record number

    80264