1st International Conference on Collaborative Computing: Networking, Applications and Worksharing

Research Article

Distributed core assisted scalable data dissemination in mobile ad hoc networks

  • @INPROCEEDINGS{10.1109/COLCOM.2005.1651228,
        author={Gautam Das and M. Fazio and M. Villari and A. Puliafito},
        title={Distributed core assisted scalable data dissemination in mobile ad hoc networks},
        proceedings={1st International Conference on Collaborative Computing: Networking, Applications and Worksharing},
        publisher={IEEE},
        proceedings_a={COLLABORATECOM},
        year={2006},
        month={7},
        keywords={Broadcasting  Computer science  Data engineering  IEEE news  Intelligent networks  Mobile ad hoc networks  Network servers  Peer to peer computing  Proposals  Protocols},
        doi={10.1109/COLCOM.2005.1651228}
    }
    
  • Gautam Das
    M. Fazio
    M. Villari
    A. Puliafito
    Year: 2006
    Distributed core assisted scalable data dissemination in mobile ad hoc networks
    COLLABORATECOM
    IEEE
    DOI: 10.1109/COLCOM.2005.1651228
Gautam Das1,*, M. Fazio2,*, M. Villari2,*, A. Puliafito2,*
  • 1: Computer Science and Engineering Indian Institute of Technology, Guwahati, Guwahati, India 781039
  • 2: Università di Messina,Dipartimento di Matematica, Contrada di Dio, S. Agata, 98166 Messina, Italy.
*Contact email: gautam@iitg.ernet.in, mfazio@ingegneria.unime.it, mvillari@ingegneria.unime.it, apulia@ingegneria.unime.it

Abstract

Data dissemination is used in mobile ad hoc networks (MANETs) for activities like issuing commands, propagating alarms, and configuring nodes. Existing forms of data dissemination are based upon push or pull approaches. We present a novel data dissemination approach that supports push and pull approaches as well as direct node-to-node dissemination method. Our proposal is to develop a highly connected core based on two-hop neighbor information to assist in dissemination. We propose some algorithms for selecting a subset of network's nodes to perform data dissemination on behalf of the complete network. The core structure is characterized by its ability to work with limited neighbor information, connectivity maintenance, high connectivity with other features related to node degree. This property helps to lessen the control overhead as piggybacking can be used to gain partial neighbor information. We provide simulation results showing the performances of the proposed scheme.