Wireless Networks

, Volume 16, Issue 7, pp 2031–2048 | Cite as

An energy-efficient, distributed wireless multicast protocol based on concurrent CTS and N 2 connectivity

  • Ju WangEmail author
  • Xiaorui Wang


Media acquisition process in wireless multicast requires that the sender obtains confirmation replies from a set of receivers. If replies are uncoordinated, the process can be much more time consuming than that of wireless unicast due to packet collisions. We propose a wireless multicast scheme that utilizes a novel concurrent Clear-To-Send (CTS) transmission method and a distributed multicast tree construction method. The concurrent CTS based MAC (Media Access Control) layer design can significantly reduce packet collisions and signaling overhead at the local cell level. Built on top of this new MAC layer protocol, we further propose a distributed multicast tree construction algorithm which grows the tree by maximizing the local multicast gain. The uniqueness of our algorithm is that the tree is constructed implicitly during the media access stage and the algorithm requires little additional message overhead. Extensive simulations are conducted to evaluate the performance of the proposed scheme. Our results indicate that the proposed scheme offers considerable improvement in multicast turnaround time and efficiency. The proposed scheme is also robust against network topology changes caused by node movements.


Distributed multicast algorithm CTS Collision Spectrum spreading MAC protocols Robustness 


  1. 1.
    Rayward-Smith, V. (1983). The computation of nearly minimal Steiner trees in graphs. International Journal of Mathematics, 14(1), 15–23.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Doar, M. & Leslie, I. (1993). How bad is naive multicast routing? In iProceedings of IEEE INFOCOM (pp. 82–89).Google Scholar
  3. 3.
    Chen, K., Huang, N., Li, B., (2001). CTMS: A novel constrained tree migration scheme for multicast services in generic wireless systems. IEEE Journal on Selected Areas in Communications, 19(10), 1998–2005.CrossRefGoogle Scholar
  4. 4.
    Wang, B., & Gupta, S. K. S. (2003). S-REMiT: A distributed algorithm for source-based energy efficient multicasting in wireless Ad Hoc networks. In IEEE GLOBECOM’03 (pp. 3519–3524).Google Scholar
  5. 5.
    Bharghavan, V., Demers, A., Shenker S., & Zhang, L. (1994). MACAW: A media access protocol for wireless LANs. In Proceedings of ACM SIGCOMM (August 1994).Google Scholar
  6. 6.
    Chhaya, H., & Gupta, S. (1997). Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol. Wireless Networks 3(3), Aug 1997.Google Scholar
  7. 7.
    ANSI/IEEE Standard 802.11, 1999 Edition.Google Scholar
  8. 8.
    Wu, J. (2002). Extended dominating-set-based routing in Ad Hoc wireless networks with unidirectional links. IEEE Transactions on Parallel and Distributed Systems, 13(9), 866–881.CrossRefGoogle Scholar
  9. 9.
    Marathe, M. V., Breu, H., Hunt H. B. III, Ravi, S. S., & Rosenkrantz, D. J. (1995). Simple heuristics for unit disk graphs. Networks, 25(2), 59–68.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Qayyum, A., Viennot, L., & Laouiti, A. (2002). Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proceedings of the Hawaii international conference on system sciences (HICSS’02), Jan, 2002.Google Scholar
  11. 11.
    Alzoubi, K. M., Wan, P.-J., & Frieder, O. (2002). Distributed heuristics for connected dominating set in wireless Ad Hoc networks. IEEE ComSoc/KICS Journal on Communication Networks, 4(1), 22–29.Google Scholar
  12. 12.
    Stojmenovic, I., Seddigh, M., & Zunic, J. (2001) Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In Proceedings of IEEE Hawaii international conference on system sciences, Jan 2001.Google Scholar
  13. 13.
    Das, B. & Bharghavan, V. (1997). Routing in ad-hoc networks using minimum connected dominating sets. In Proceedings of IEEE international conference on communications, ICC’97, Jun, 1997.Google Scholar
  14. 14.
    Kuri, J. & Kasera, S. K. (1999). Reliable multicast in multi access, wireless LANs. In Proceedings of IEEE INFOCOM ’99.Google Scholar
  15. 15.
    Sakamoto, T., Umehara, D., Morihiro, Y., Kawai, M. (2004). A synchronization method for synchronous CDMA broadband communication systems with GEO satellites. IEICE Transactions on Communications, E87-B(8), 2111–2118.Google Scholar
  16. 16.
    Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Algorithms for energy-efficient multicasting in static Ad Hoc wireless networks. Mobile Networks and Applications (MONET), 6(3), 251–263.zbMATHCrossRefGoogle Scholar
  17. 17.
    Dai, F. & Wu, J. (2004). An extended localized algorithm for connected dominating set formation in Ad Hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15(10), 908–920.CrossRefGoogle Scholar
  18. 18.
    Viswanath, K., Obraczka, K., & Tsudik, G. (2006). Exploring mesh and tree-based multicast routing protocols for MANETs. IEEE Transactions on Mobile Computing, 5(1), 28–42.CrossRefGoogle Scholar
  19. 19.
    Hu, C. C., Wu, E. H., & Chen, G. H. (2008). Bandwidth-satisfied multicast trees in MANETs. IEEE Transactions on Mobile Computing, 7(6), 712–723.CrossRefGoogle Scholar
  20. 20.
    Song, Guo, Yang, O. (2008). Maximizing multicast communication lifetime in wireless mobile Ad Hoc networks. IEEE Transactions on Vehicular Technology, 57(4), 2414–2425.CrossRefGoogle Scholar
  21. 21.
    Kunz, T. & Cheng, E. (2001) Multicasting in Ad Hoc networks: Comparing MAODV and ODMRP. In Proceedings of workshop on Ad Hoc communication, Sept, 2001.Google Scholar
  22. 22.
    Guha, S. & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374–387.zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Wan, Peng-Jun, Alzoubi, Khaled M. & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. In Proceedings of IEEE INFOCOM 2002.Google Scholar
  24. 24.
    Das, B., Sivakumar, R., & Bhargavan, V. (1997) Routing in Ad Hoc Networks using a spine. In Proceedings of sixth IEEE Int’l conference on computers, communication and Networks (IC3N ’97) (pp. 1–20), Sept. 1997.Google Scholar
  25. 25.
    Adjih, C., Jacquet, P., & Viennot, L. (2005) Computing connected dominated sets with multipoint relays. Ad Hoc and Sensor Wireless Networks, 1(1–2), Jan 2005.Google Scholar
  26. 26.
    Esteves, E. (2002). On the reverse link capacity of CDMA2000 high rate packet data systems. In Proceedings of IEEE international conference on communications, ICC’02, May 2002.Google Scholar
  27. 27.
    Saito, M., & Yamamoto, H. (2002) Sequence assignment of Walsh-Hadamard sequences for quasi-synchronous multi-code CDMA systems. In Proceedings of the 5th international symposium on wireless personal multimedia communications (pp. 673–677).Google Scholar
  28. 28.
    Fan, P. Z. & Hao, L. (2000). Generalized orthogonal sequences and their applications in synchronous CDMA systems. IEICE Transactions on Fundamentals, E83-A(11), 1–16.Google Scholar
  29. 29.
    Park Jae Joon, Yeh, Choong Il, Chung, & Hyun Kyu (2006). Uplink packet synchronization of OFDMA systems. In Proceedings of IEEE vehicular technology conference (pp. 1–50).Google Scholar
  30. 30.
    Viterbi, A. M., & Viterbi, A. J. (1993). Erlang capacity of a power controlled CDMA system. IEEE Journal on Selected Areas in Communications, 11(6), 892–900.CrossRefGoogle Scholar
  31. 31.
    Szapnkowski, W. (1983). Analysis and stability consideration in a reservation multiaccess system. IEEE Transactions on Communication 31(5).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Virginia State UniversityPetersburgUSA
  2. 2.University of TennesseeKnoxvilleUSA

Personalised recommendations