Analysis of a metropolitan-area wireless network
Wireless Networks - Selected Papers from Mobicom'99
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Mobile Phones as Computing Devices: The Viruses are Coming!
IEEE Pervasive Computing
Social Serendipity: Mobilizing Social Software
IEEE Pervasive Computing
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Modeling epidemic spreading in mobile environments
Proceedings of the 4th ACM workshop on Wireless security
Model T: an empirical model for user registration patterns in a campus wireless LAN
Proceedings of the 11th annual international conference on Mobile computing and networking
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Evaluating contacts for routing in highly partitioned mobile networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
pFusion: A P2P Architecture for Internet-Scale Content-Based Search and Retrieval
IEEE Transactions on Parallel and Distributed Systems
Adaptive contact probing mechanisms for delay tolerant applications
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On clustering phenomenon in mobile partitioned networks
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
An analytical study of fundamental mobility properties for encounter-based protocols
International Journal of Autonomous and Adaptive Communications Systems
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
On the strength of weak ties in mobile social networks
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Social network aided multicast delivery scheme for human contact-based networks
Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
Towards new methods for mobility data gathering: content, sources, incentives
Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements
SniffMob: inferring human contact patterns using wireless devices
Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements
Opportunistic energy-efficient contact probing in delay-tolerant applications
IEEE/ACM Transactions on Networking (TON)
Leapfrog: optimal opportunistic routing in probabilistically contacted delay tolerant networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Understanding urban interactions from bluetooth phone contact traces
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Radio characterization of 802.15.4 and its impact on the design of mobile sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Planet-scale human mobility measurement
Proceedings of the 2nd ACM International Workshop on Hot Topics in Planet-scale Measurement
An accurate and analytically tractable model for human inter-contact times
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
cTrust: trust aggregation in cyclic mobile ad hoc networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Near-zero triangular location through time-slotted mobility prediction
Wireless Networks
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
On the levy-walk nature of human mobility
IEEE/ACM Transactions on Networking (TON)
Privacy-enhanced social-network routing
Computer Communications
Proceedings of the 10th international conference on Mobile systems, applications, and services
Social-aware multicast in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
MINT: maximizing information propagation in predictable delay-tolerant network
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Routing with multi-level cross-community social groups in mobile opportunistic networks
Personal and Ubiquitous Computing
Hi-index | 0.00 |
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.