In this paper, we consider the multicast routing with minimum energy cost and minimum delay (MEMD) in wireless sensor networks under the access control scheme of Spatial Time Division Multiple Access (STDMA). We formulate and explore both MEMD multicast and ME multicast, and show that the latter is just the Maximum Leaf Spanning Tree (MLST) problem, which is NP-complete. A 2-approximation algorithm is proposed for the MLST problem through improving a known one. Based on this algorithm, an approximation algorithm is obtained for the MEMD multicast problem. To further improve the delay result, we provide another approximation algorithm for our main problem using a different approach. These algorithms are all near linear in the size of the network graph, and also are shown to have good performance by simulation results. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Li, Z., Zhang, W., Liu, H., Zhao, B., & Qu, Y. (2005). Multicast routing with minimum energy cost and minimum delay in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 1157–1168). Springer Verlag. https://doi.org/10.1007/11596042_118
Mendeley helps you to discover research relevant for your work.