{"title":"基于努力的移动相遇网络社会扩散方法","authors":"Bernhard Klein, H. Hlavacs","doi":"10.1109/CASON.2011.6085935","DOIUrl":null,"url":null,"abstract":"Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An effort based social diffusion approach for mobile encounter networks\",\"authors\":\"Bernhard Klein, H. Hlavacs\",\"doi\":\"10.1109/CASON.2011.6085935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.\",\"PeriodicalId\":342597,\"journal\":{\"name\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASON.2011.6085935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An effort based social diffusion approach for mobile encounter networks
Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.