A tradeoff analysis on message complexity and lifetime optimality for a distributed multicast algorithm in WSNs

ABSTRACT

We consider the lifetime maximization for multicast in wireless sensor networks (WSNs) and propose a new distributed algorithm that achieves a good balance on algorithm optimality and message complexity.

REFERENCES

• 1: Kang, I. and Poovendran, R., 2003. Maximizing static network lifetime of wireless broadcast adhoc networks. In Proceedings of the IEEE ICC, Alaska, 2003, 2256 --2261.
• 2: Das, A. K., Marks, R. J., et al, 2003. MDLT: a polynomial time optimal algorithm for maximization of time-to-first-failure in energy-constrained broadcast wireless networks. In Proceedings of the IEEE Globecom, 2003, 362 -- 366.
• 3: Georgiadis, L., 2003. Bottleneck multicast trees in linear time. IEEE Communications Letters, 7(11), 2003, 564 -- 566.
• 4: Guo, S., Leung, V. and Yang, O., 2006. Distributed multicast algorithms for lifetime maximization in wireless ad hoc networks with omnidirectional and directional antennas. In Proceedings of the IEEE Globecom, 2006.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

General Terms:
Algorithms, Design, Performance

Keywords:
approximation algorithm, multicast, wireless sensor networks