Contact prediction, routing and fast information spreading in social networks

Simple item page
dc.contributor.authorJahanbakhsh, Kazem
dc.contributor.supervisorKing, Valerie D.
dc.contributor.supervisorShoja, Gholamali C.
dc.date.accessioned2012-08-20T20:41:25Z
dc.date.available2012-08-20T20:41:25Z
dc.date.copyright2012en_US
dc.date.issued2012-08-20
dc.degree.departmentDept. of Computer Scienceen_US
dc.degree.levelDoctor of Philosophy Ph.D.en_US
dc.description.abstractThe astronomical increase in the number of wireless devices such as smart phones in 21th century has revolutionized the way people communicate with one another and share information. The new wireless technologies have also enabled researchers to collect real data about how people move and meet one another in different social settings. Understanding human mobility has many applications in different areas such as traffic planning in cities and public health studies of epidemic diseases. In this thesis, we study the fundamental properties of human contact graphs in order to characterize how people meet one another in different social environments. Understanding human contact patterns in return allows us to propose a cost-effective routing algorithm for spreading information in Delay Tolerant Networks. Furthermore, we propose several contact predictors to predict the unobserved parts of contact graphs when only partial observations are available. Our results show that we are able to infer hidden contacts of real contact traces by exploiting the underlying properties of contact graphs. In the last few years, we have also witnessed an explosion in the number of people who use social media to share information with their friends. In the last part of this thesis, we study the running times of several information spreading algorithms in social networks in order to find the fastest strategy. Fast information spreading has an obvious application in advertising a product to a large number of people in a short amount of time. We prove that a fast information spreading algorithm should efficiently identify communication bottlenecks in order to speed up the running time. Finally, we show that sparsifying large social graphs by exploiting the edge-betweenness centrality measure can also speed up the information spreading rate.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.bibliographicCitationJahanbakhsh, Kazem and Shoja, Gholamali C. and King, Valerie. Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks. MobiOpp '10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, 2010, pages = 159--162. Pisa, Italy, ACM {New York, NY, USA}.en_US
dc.identifier.bibliographicCitationJahanbakhsh, Kazem and Shoja, Gholamali C. and King, Valerie. International Symposium on Social Computing and Networking. Hangzhou, China. December, IEEE, Human Contact Prediction Using Contact Graph Inference, 2010, pages 813-818.en_US
dc.identifier.bibliographicCitationJahanbakhsh, Kazem and Shoja, Gholamali C. and King, Valerie. World of Wireless Mobile and Multimedia Networks. Lucca, Italy. June. IEEE. Predicting Missing Contacts in Mobile Social Networks, 2011.en_US
dc.identifier.bibliographicCitationJahanbakhsh, Kazem and King, Valerie and Shoja, Gholamali C. Predicting human contacts in mobile social networks using supervised learning. Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks for Practitioners. SIMPLEX '12, 2012. Lyon, France, pages 37--42. ACM, New York, NY, USA.en_US
dc.identifier.bibliographicCitationKazem Jahanbakhsh and Valerie King and Gholamali C. Shoja. Empirical Comparison of Information Spreading Algorithms in the Presence of 1-Whiskers. SocialCom/PASSAT, 2011, pages 489-492.en_US
dc.identifier.bibliographicCitationPredicting missing contacts in mobile social networks. "Pervasive and Mobile Computing", 2012, url http://www.sciencedirect.com/science/article/pii/S1574119212000910, Kazem Jahanbakhsh and Valerie King and Gholamali C. Shoja.en_US
dc.identifier.urihttp://hdl.handle.net/1828/4139
dc.languageEnglisheng
dc.language.isoenen_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectmobile social networksen_US
dc.subjectwireless ad-hoc networksen_US
dc.subjectdelay tolerant networksen_US
dc.subjecthuman mobilityen_US
dc.subjectsocial profileen_US
dc.subjectsocial similarityen_US
dc.subjectcontacten_US
dc.subjectpredictionen_US
dc.subjectNeighborhood Similarityen_US
dc.subjectbinary classifiersen_US
dc.subjecttime-spatial localityen_US
dc.subjectunsuperviseden_US
dc.subjectsuperviseden_US
dc.subjectlogistic regressionen_US
dc.subjectmachine learningen_US
dc.subjectlogistic regressionen_US
dc.subjectcellphonesen_US
dc.subjectwireless sensorsen_US
dc.subjectgraphen_US
dc.subjectsocial-sim packageen_US
dc.subjectcontactsen_US
dc.titleContact prediction, routing and fast information spreading in social networksen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Jahanbakhsh_Kazem_PhD_2012.pdf
Size:
899.92 KB
Format:
Adobe Portable Document Format
Description:
Ph.D. Thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Computer Science)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.