Multicast Routing with Minimum Energy Cost and Minimum Delay in Wireless Sensor Networks

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.

[1]  Francesco Maffioli,et al.  A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[2]  Roberto Di Pietro,et al.  LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks , 2003, 2003 International Conference on Parallel Processing Workshops, 2003. Proceedings..

[3]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[4]  Di Yuan,et al.  Resource optimization of spatial TDMA in ad hoc radio networks: a column generation approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[6]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[7]  J. Gronkvist.  Traffic controlled spatial reuse TDMA in multi-hop radio networks , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[8]  Xiaoxing Guo,et al.  Broadcasting for network lifetime maximization in wireless sensor networks , 2004, SECON.

[9]  David E. Culler,et al.  Mica: A Wireless Platform for Deeply Embedded Networks , 2002, IEEE Micro.

[10]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[11]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[12]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[13]  Deying Li,et al.  Multicast routing with minimum energy cost in ad hoc wireless networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[14]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[15]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[16]  Peng-Jun Wan,et al.  Minimum-power multicast routing in static ad hoc wireless networks , 2004, IEEE/ACM Transactions on Networking.

[17]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .