ACM Home Page
Please provide us with feedback. Feedback
Analysis and implications of student contact patterns derived from campus schedules
Full text PdfPdf (242 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 12th annual international conference on Mobile computing and networking table of contents
Los Angeles, CA, USA
SESSION: Measurements table of contents
Pages: 86 - 97  
Year of Publication: 2006
ISBN:1-59593-286-0
Authors
Vikram Srinivasan  National University of Singapore
Mehul Motani  National University of Singapore
Wei Tsang Ooi  National University of Singapore
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 121,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1161089.1161100
What is a DOI?

ABSTRACT

Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic approaches - model based and measurement based. The model based approach involves constructing a mathematical model to generate movement patterns while the measurement based approach measures locations and proximity of wireless devices to infer mobility patterns. In this paper, we take a completely different approach. First we obtain the class schedules and class rosters from a university-wide Intranet learning portal, and use this information to infer contacts made between students. The value of our approach is in the population size involved in the study, where contact patterns among 22341 students are analyzed. This paper presents the characteristics of these contact patterns, and explores how these patterns affect three scenarios. We first look at the characteristics from the DTN perspective, where we study inter-contact time and time distance between pairs of students. Next, we present how these characteristics impact the spread of mobile computer viruses, and show that viruses can spread to virtually the entire student population within a day. Finally, we consider aggregation of information from a large number of mobile, distributed sources, and demonstrate that the contact patterns can be exploited to design efficient aggregation algorithms, in which only a small number of nodes (less than 0.5%) is needed to aggregate a large fraction (over 90%) of the data.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
N. Bailey. The Mathematical Model of Infectious Diseases and its Applications. Hafner Press, February 1975.
 
2
B. Bollobas. Random Graphs. Number 73 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, UK, 2nd edition, January 2001.
 
3
T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5):483--502, March 2002.
 
4
A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Pocket switched networks: Real world mobility and its consequences for opportunistic forwarding. In Technical Report Number 617, February 2005.
 
5
A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proceedings of IEEE INFOCOM 2006, Barcelona, Spain, April 2006.
 
6
 
7
 
8
J. Ghosh, S. J. Phillip, and C. Qiao. Sociological orbit aware location approximation and routing in MANETs. In Proceedings of Broadnets 2005, Boston, U.S.A, October 2005.
9
10
11
12
13
14
 
15
G. Sharma and R. Mazumdar. Scaling laws for capacity and delay in wireless ad hoc networks with random mobility. In Proceedings of IEEE ICC 2004, volume 7, pages 3869--3873, Paris, France, June 2004.
 
16


Collaborative Colleagues:
Vikram Srinivasan: colleagues
Mehul Motani: colleagues
Wei Tsang Ooi: colleagues