Mobile Wireless Middleware, Operating Systems, and Applications. 4th International ICST Conference, Mobilware 2011, London, UK, June 22-24, 2011, Revised Selected Papers

Research Article

Mobility-Tolerant, Efficient Multicast in Mobile Cloud Applications

Download46 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-30607-5_16,
        author={Ju Wang and Hui Chen and Kostadin Damevski and Jonathan Liu},
        title={Mobility-Tolerant, Efficient Multicast in Mobile Cloud Applications},
        proceedings={Mobile Wireless Middleware, Operating Systems, and Applications. 4th International ICST Conference, Mobilware 2011, London, UK, June 22-24, 2011, Revised Selected Papers},
        proceedings_a={MOBILWARE},
        year={2012},
        month={5},
        keywords={multicast mobile cloud reliability mobility fail-recovery MAC protocol wireless network},
        doi={10.1007/978-3-642-30607-5_16}
    }
    
  • Ju Wang
    Hui Chen
    Kostadin Damevski
    Jonathan Liu
    Year: 2012
    Mobility-Tolerant, Efficient Multicast in Mobile Cloud Applications
    MOBILWARE
    Springer
    DOI: 10.1007/978-3-642-30607-5_16
Ju Wang1,*, Hui Chen1, Kostadin Damevski1, Jonathan Liu2
  • 1: Virginia State University
  • 2: University of Florida
*Contact email: jwang@vsu.edu

Abstract

Interactive mobile applications require a highly available multicast service for information dissemination and collaboration, while being able to withstand mobility-induced network connectivity problems. However, efficient and reliable wireless multicast has remained a difficult challenge. We propose a novel wireless multicast scheme that allows more efficient and mobility-proof multicast in mobile cloud environments. Our scheme uses a distributed caching and deferred acknowledgement (ACK) technique to reduce delivery ACK traffic during a multicast session. Packets with pending ACK are cached in selected network nodes to provide fast re-delivery. A distributed multicast tree construction algorithm is also utilized to provide fast topology repair under dynamic network conditions. The tree maintenance requires each node to keep track of its 2-hop neighborhood connectivity. Our scheme’s ability to overcome frequent network topology changes leads to a low message exchange overhead to correct local topology errors.