Best Case Energy Analysis of Localized Euclidean Minimum Spanning Tree Based Multicasting in Ad Hoc and Sensor Networks

摘要

I consider the known localized multicast protocol MSTEAM and derive the energy consumed by the multicast tree constructed by this protocol in the best case. Moreover, I show that the length of multicast links connecting into a multicast branch can not be bounded from above. For typical wireless networks where links have a limited communication range, however, I can show that asymptotically the relation between the derived best case energy consumption of MSTEAM and a known lower bound on multicast energy consumption is limited by a factor of 2.