Adaptive multicast trees on static ad hoc networks: tradeoffs between delay and energy consumption

• Authors: Sangman Moh
• Venue: UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
• Year: 2007

This paper proposes adaptive multicast trees (AMTs) on static ad hoc networks. The proposed function f: (α, β) → AMT(α, β) provides a wide range of tradeoffs between the most energy efficient AMT and the fastest AMT by adjusting two parameters α and β, where nonnegative integers α and β are correlated with each other such that if α 0 and β 0, αβ is α or β; otherwise, α + β = 1. AMT(α, β) is a breadth-first spanning tree (BT) with mini∈[1,k] EiαTiβ among k BTs for a multicast group with k members, where Ei and Ti are the normalized energy consumption and delay for a multicast in BTi, respectively. The simulation study shows that AMT(0, 1) reveals about 60 percent shorter delay than AMT(1, 0) while AMT(1, 0) consumes up to 45 percent less energy than AMT(0, 1). Therefore, if delay is the most important factor, AMT(0, 1) should be the choice while AMT(1, 0) is most efficient when energy consumption is the primary concern. One of various AMTs can be appropriately chosen in accordance with the operation requiremen