Minimum multicast time problem in wireless sensor networks

Authors:
Jianming Zhu;Xujin Chen;Xiaodong Hu
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
Venue:
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Year:
2006

Citing 12
Cited 0

Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Message Multicasting in Heterogeneous Networks

SIAM Journal on Computing
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Impact of Network Density on Data Aggregation in Wireless Sensor Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Wireless sensor networks

Wireless sensor networks
Rapid rumor ramification: approximating the minimum broadcast time

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Approximation algorithm for directed telephone multicast problem

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Minimum data aggregation time problem in wireless sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
On the problem of channel assignment for Multi-NIC multihop wireless networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.