移动社交网络中基于家庭的多副本路由

Tao Jing, Yangyang Liu, Yan Huo, Yingkun Wen
{"title":"移动社交网络中基于家庭的多副本路由","authors":"Tao Jing, Yangyang Liu, Yan Huo, Yingkun Wen","doi":"10.1109/MSN.2016.052","DOIUrl":null,"url":null,"abstract":"A Mobile Social Network (MSN) is a typical Delay Tolerant Network (DTN) composed of mobile nodes with social characteristics. Routing design and optimization are difficult because of the fast topology changes in such network. However, realistic mobility trace shows that mobile nodes in MSNs generally visit a few locations called homes, frequently, while other locations are visited less frequently. In order to evaluate the influence of the home on the routing design and improve the delivery success ratio, we propose two novel home-based multi-copy routing protocols, HBMRZ and HBMR. In HBMRZ, we assume that the message holder has zero-knowledge about the destination when it delivers the message, while in HBMR, the message holder not only knows its own homes but also the destination. Nevertheless, both of the protocols can broadcast message on the basis of the known home information. In addition, extensive simulations are conducted. Numerical simulation demonstrates that it is important to exploit home factor in routing protocols for delivering the message accurately. By using home characteristic, HBMRZ and HBMR achieve a better performance on the delivery success ratio than existing MSN routing algorithms, including Epidemic and Spray&Wait.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Home-Based Multi-Copy Routing in Mobile Social Networks\",\"authors\":\"Tao Jing, Yangyang Liu, Yan Huo, Yingkun Wen\",\"doi\":\"10.1109/MSN.2016.052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Mobile Social Network (MSN) is a typical Delay Tolerant Network (DTN) composed of mobile nodes with social characteristics. Routing design and optimization are difficult because of the fast topology changes in such network. However, realistic mobility trace shows that mobile nodes in MSNs generally visit a few locations called homes, frequently, while other locations are visited less frequently. In order to evaluate the influence of the home on the routing design and improve the delivery success ratio, we propose two novel home-based multi-copy routing protocols, HBMRZ and HBMR. In HBMRZ, we assume that the message holder has zero-knowledge about the destination when it delivers the message, while in HBMR, the message holder not only knows its own homes but also the destination. Nevertheless, both of the protocols can broadcast message on the basis of the known home information. In addition, extensive simulations are conducted. Numerical simulation demonstrates that it is important to exploit home factor in routing protocols for delivering the message accurately. By using home characteristic, HBMRZ and HBMR achieve a better performance on the delivery success ratio than existing MSN routing algorithms, including Epidemic and Spray&Wait.\",\"PeriodicalId\":135328,\"journal\":{\"name\":\"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSN.2016.052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN.2016.052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

移动社交网络(MSN)是一种典型的由具有社交特性的移动节点组成的时延容忍网络(DTN)。在这种网络中,由于拓扑变化快,路由设计和优化困难。然而,实际的移动跟踪表明,msn中的移动节点通常会频繁访问几个称为home的位置,而访问其他位置的频率较低。为了评估家庭对路由设计的影响,提高传输成功率,我们提出了两种新的基于家庭的多副本路由协议HBMRZ和HBMR。在HBMRZ中,我们假设消息持有者在传递消息时对目的地一无所知,而在HBMR中,消息持有者不仅知道自己的家园,还知道目的地。然而,这两种协议都可以在已知家庭信息的基础上广播消息。此外,还进行了大量的仿真。数值仿真结果表明,在路由协议中充分利用本节点因素对报文的准确传递具有重要意义。HBMRZ和HBMR利用自身的特性,比现有的MSN路由算法(Epidemic和Spray&Wait)在投递成功率上有了更好的表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Home-Based Multi-Copy Routing in Mobile Social Networks
A Mobile Social Network (MSN) is a typical Delay Tolerant Network (DTN) composed of mobile nodes with social characteristics. Routing design and optimization are difficult because of the fast topology changes in such network. However, realistic mobility trace shows that mobile nodes in MSNs generally visit a few locations called homes, frequently, while other locations are visited less frequently. In order to evaluate the influence of the home on the routing design and improve the delivery success ratio, we propose two novel home-based multi-copy routing protocols, HBMRZ and HBMR. In HBMRZ, we assume that the message holder has zero-knowledge about the destination when it delivers the message, while in HBMR, the message holder not only knows its own homes but also the destination. Nevertheless, both of the protocols can broadcast message on the basis of the known home information. In addition, extensive simulations are conducted. Numerical simulation demonstrates that it is important to exploit home factor in routing protocols for delivering the message accurately. By using home characteristic, HBMRZ and HBMR achieve a better performance on the delivery success ratio than existing MSN routing algorithms, including Epidemic and Spray&Wait.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信