Kazem Jahanbakhsh

Learn More
Experimentally measured contact traces, such as those obtained in a conference setting by using short range wireless sensors, are usually limited with respect to the practical number of sensors that can be deployed as well as available human volunteers. Moreover, most previous experiments in this field are partial since not everyone participating in the(More)
Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming(More)
Predicting human mobility is considered as a challenging problem. In this paper, we formulate the problem of human contact prediction as a graph inference problem. We show the importance of using offline social information for predicting people's contacts motivated by homophily theory. We also prove that by using the small-world network properties of the(More)
The main goal of routing protocol is to efficiency delivers data from source to destination. All routing protocols are the same in this goal, but the way they adopt to achieve it is different, so routing strategy has an egregious role on the performance of an ad hoc network. Most of routing protocols proposed for ad hoc networks have a flat structure. These(More)
Having access to human contact traces has allowed researchers to study and understand how people contact each other in different social settings. However, most of the existing human contact traces are limited in the number of deployed Bluetooth sensors. In most experiments, there are two types of participants, the ordinary ones who carry cellphones and a(More)
—Twitter as a new form of social media potentially contains useful information that opens new opportunities for content analysis on tweets. This paper examines the predictive power of Twitter regarding the US presidential election of 2012. For this study, we analyzed 32 million tweets regarding the US presidential election by employing a combination of(More)
Several information spreading algorithms for social networks have been proposed by researchers during the past few years. However, the main challenge is to find out the best algorithm with the lowest running time for a given communication graph. In this paper, we address the problem of information spreading in the context of social networks. We compare the(More)
Theoretical frameworks and simulation environments are proven to be very useful in evaluating conventional wired settings. However, due to the inclusion of various deficiency parameters which naturally exist in wireless channels modelling the communication behaviour in MANETs become much more complex. To overcome these major problems and create a realistic(More)
  • 1