Multicast routing with minimum energy cost and minimum delay in wireless sensor networks

Authors:
Zhao Li;Wei Zhang;Hengchang Liu;Baohua Zhao;Yugui Qu
Affiliations:
Department of Computer Science, Laboratory of Computer Science Institute of Software Chinese Academy of Sciences, University of Science and Technology of China, Hefei, Anhui, China;Department of Computer Science, Laboratory of Computer Science Institute of Software Chinese Academy of Sciences, University of Science and Technology of China, Hefei, Anhui, China;Department of Computer Science, Laboratory of Computer Science Institute of Software Chinese Academy of Sciences, University of Science and Technology of China, Hefei, Anhui, China;Department of Computer Science, Laboratory of Computer Science Institute of Software Chinese Academy of Sciences, University of Science and Technology of China, Hefei, Anhui, China;Department of Computer Science, Laboratory of Computer Science Institute of Software Chinese Academy of Sciences, University of Science and Technology of China, Hefei, Anhui, China
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 11
Cited 0

A short note on the approximability of the maximum leaves spanning tree problem

Information Processing Letters
Approximating maximum leaf spanning trees in almost linear time

Journal of Algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Mica: A Wireless Platform for Deeply Embedded Networks

IEEE Micro
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Minimum-power multicast routing in static ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.