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.
KeywordsSensor Node Wireless Sensor Network Approximation Algorithm Source Node Transmission Range
Unable to display preview. Download preview PDF.
- 1.Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: WCNC 2003-IEEE Wireless Communication and Networking Conference, vol. 4(1), pp. 1942–1947 (2003)Google Scholar
- 3.Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low cost outdoor localization for very small devices. Technical Report 00-729, Computer Science Department, University of Sourthern California (April 2000)Google Scholar
- 5.Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proceedings of 34th ACM Annual Symposium on Theory of Computing, pp. 438–447 (2002)Google Scholar
- 6.Elkin, M., Kortsarz, G.: Sublogarithmic approximation algorithm for the undirected telephone broadcast problem: a path out of a jungle. In: Proceedings of 14th Annual ACM-SCIM Symposium on Discrete Algorithms, pp. 76–85 (2003)Google Scholar
- 8.Gandhi, R., Parthasarathy, S., Mishr̀a, A.: Minimizing broadcasting latency and redundancy in ad hoc networks. In: Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 222–231 (2003)Google Scholar
- 10.Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: Impact of network density on data aggregation in wireless sensor networks. In: The 22nd International Conference on Distributed Computing Systems, Austria (July 2002)Google Scholar
- 11.Kyasanur, P., Vaidya, N.: Routing and interface assignment in multi-channel wireless networks. In: Proceedings of IEEE Wireless Communications and Networking Conference, vol. 4, pp. 2051–2056 (2005)Google Scholar
- 13.Pelc, A.: Broadcasting in radio networks. In: Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, Inc., New York (2002)Google Scholar
- 14.Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time. In: Proceedings of the IEEE Symposium on Computer Science, pp. 202–213 (1994)Google Scholar
- 18.Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor networks. In: The 23rd Conference of IEEE Communication Society, Hong Kong, SAR China (March 2004)Google Scholar