New Algorithm for Minimum Multicast Time Problem in Wireless Sensor Networks

Given a wired network of processors, and a source node that needs to broadcast a message to all other processors in the network, the minimum broadcast time problem is to find a scheme that accomplishes the broadcast in a minimum number of time rounds under the constraint that at each time round, no processor can forward the received message to more than one of its neighbors in the network. This NP-hard problem has been extensively studied in literatures. In this paper we focus on a variant of the minimum broadcast time problem: the minimum multicast time problem in wireless sensor networks under collision-free data transmission model. The goal of the problem is to multicast a message from the source node to a set of destination nodes in a minimum number of time rounds. This problem remains NP-hard even in the Euclidean plane and the current best approximation algorithm has performance ratio of 41. In this paper we propose a new algorithm that has performance ratio of 15.

[1]  Andrzej Pelc,et al.  Broadcasting in radio networks , 2002 .

[2]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[3]  Krishna M. Sivalingam,et al.  Wireless sensor networks - [Book Review] , 2005 .

[4]  Nitin H. Vaidya,et al.  Routing and interface assignment in multi-channel multi-interface wireless networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[5]  R. Ravi,et al.  Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Deborah Estrin,et al.  Impact of network density on data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[7]  Guy Kortsarz,et al.  Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract) , 2003, SODA '03.

[8]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[9]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[10]  Yong Xiang,et al.  On the Problem of Channel Assignment for Multi-NIC Multihop Wireless Networks , 2005, MSN.

[11]  Xiao-Dong Hu,et al.  Minimum Multicast Time Problem in Wireless Sensor Networks , 2006, WASA.

[12]  Guy Kortsarz,et al.  Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem , 2002, STOC '02.

[13]  Guy Kortsarz,et al.  A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem , 2005, SIAM J. Comput..

[14]  Sudipto Guha,et al.  Message Multicasting in Heterogeneous Networks , 2000, SIAM J. Comput..

[15]  Rajiv Gandhi,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2003, MobiHoc '03.

[16]  Xiao-Dong Hu,et al.  Minimum Data Aggregation Time Problem in Wireless Sensor Networks , 2005, MSN.

[17]  Guy Kortsarz,et al.  Approximation Algorithm for Directed Telephone Multicast Problem , 2003, ICALP.

[18]  Sandeep K. S. Gupta,et al.  On tree-based convergecasting in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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