Minimum Multicast Time Problem in Wireless Sensor Networks

Given an undirected graph representing a network of processors, and a source node needs to broadcast a message to all other nodes in the graph, the minimum broadcast time problem is to find a scheme that accomplishes the broadcast in a minimum number of time steps under the constraint that at each time round, any node can send the message to at most one of its neighbors in the network. This NP-complete problem has been extensively studied in literature. In this paper, we consider a generation of the minimum broadcast problem, the minimum multicast time problem, in unit disk graphs which model wireless sensor networks. The goal is to multicast a message from the source node to a set of specified sensor nodes of the network in a minimum number of time rounds. We prove that this problem is NP-complete, and give an O(1)–approximation algorithm for it. Our simulation results show that the practical performance of the proposed algorithm is much better than the theoretically proved approximation ratio.

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

[2]  Ramesh Govindan,et al.  Wireless sensor networks , 2003, Comput. Networks.

[3]  E. J. COCKAYNE,et al.  Information Dissemination in Trees , 1981, SIAM J. Comput..

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

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

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

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

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

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

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

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

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

[13]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

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

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

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

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

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

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