5th International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services

Research Article

Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks

Download450 downloads
  • @INPROCEEDINGS{10.4108/ICST.MOBIQUITOUS2008.4193 ,
        author={Long  Vu and Klara  Nahrstedt and Matthias  Hollick},
        title={Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks},
        proceedings={5th International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services},
        publisher={ICST},
        proceedings_a={MOBIQUITOUS},
        year={2010},
        month={5},
        keywords={},
        doi={10.4108/ICST.MOBIQUITOUS2008.4193 }
    }
    
  • Long Vu
    Klara Nahrstedt
    Matthias Hollick
    Year: 2010
    Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks
    MOBIQUITOUS
    ICST
    DOI: 10.4108/ICST.MOBIQUITOUS2008.4193
Long Vu1,*, Klara Nahrstedt1,*, Matthias Hollick2,*
  • 1: University of Illinois at Urbana-Champaign, Illinois, USA.
  • 2: Technische Universität Darmstadt, Darmstadt, Germany.
*Contact email: longvu2@cs.uiuc.edu, klara@cs.uiuc.edu, mhollick@kom.tu-darmstadt.de

Abstract

In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. people with the same race, education, community) group together in American neighborhoods. Interestingly, we observe that the analogies of this model indeed exist in numerous scenarios where co-located people communicate via their personal wireless devices in Peer-to-Peer (P2P) fashion. Schelling's model therefore can potentially serve as a mobility model and offer a unique opportunity to efficiently disseminate messages in mobile P2P networks. In this paper, we exploit the natural grouping and moving behavior of humans presented by Schelling to expedite data dissemination in such networks. Particularly, we design a push model for dense network areas to maximize data dissemination and a pull model for sparse network areas to utilize network bandwidth and node energy efficiently. We ensure that our scheme is lightweight since queries and responses are automatically limited within groups of mobile nodes carried by similar people. Moreover, we avoid broadcast storms by assigning each message a broadcast timer and applying overhearing mechanism to reduce redundant transmissions. Finally, our simulation results show that the proposed data dissemination scheme improves the query hit ratio significantly while utilizing network bandwidth efficiently.