Scalable Opportunistic Forwarding Algorithms in Delay Tolerant Networks using Similarity Hashing
文献类型：会议论文
| 作者 | Liu, Cong; Pan, Yan; Chen, Ai; Bian, Kaigui; Wu, Jie |
| 出版日期 | 2014 |
| 会议名称 | 2014 11th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2014 |
| 会议地点 | Singapore |
| 英文摘要 | Due to intermittent connectivity and uncertain node mobility, opportunistic message forwarding algorithms have been widely adopted in delay tolerant networks (DTNs). While existing work proposes practical forwarding algorithms in terms of increasing the delivery rate and decreasing data overhead, little attention has been drawn to the control overhead induced by the algorithms. The control overhead could, however, make the forwarding algorithms infeasible when the network size scales. In this paper, we are interested in increasing scalability by reducing control overhead, while retaining the state-of-the-art forwarding performances. The basic idea is to use locality-sensitive hashing to map each node as a hash-code, and use these hash-codes to compute the pair-wise similarity that guides the forwarding decisions. The proposed SOFA algorithms have reduced control overhead and competitive forwarding performance, which are verified by extensive real trace-driven simulations. © 2014 IEEE.(23 refs) |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/6050]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2014 |
| 推荐引用方式 GB/T 7714 | Liu, Cong,Pan, Yan,Chen, Ai,et al. Scalable Opportunistic Forwarding Algorithms in Delay Tolerant Networks using Similarity Hashing[C]. 见:2014 11th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2014. Singapore. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。