Packet-based routing algorithm in DTN based on the intimacy between nodes
Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2014-12-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.009/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539756950814720 |
---|---|
author | En WANG Yong-jian YANG Wei-dan ZHAO Lin-lu LIU |
author_facet | En WANG Yong-jian YANG Wei-dan ZHAO Lin-lu LIU |
author_sort | En WANG |
collection | DOAJ |
description | Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher inti-macy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay. |
format | Article |
id | doaj-art-a9123c7050d74f14932d32f4d71dcf64 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2014-12-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-a9123c7050d74f14932d32f4d71dcf642025-01-14T06:44:34ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-12-0135707759687386Packet-based routing algorithm in DTN based on the intimacy between nodesEn WANGYong-jian YANGWei-dan ZHAOLin-lu LIUThrough analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher inti-macy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.009/DTNsocial networkintimacypacket-based |
spellingShingle | En WANG Yong-jian YANG Wei-dan ZHAO Lin-lu LIU Packet-based routing algorithm in DTN based on the intimacy between nodes Tongxin xuebao DTN social network intimacy packet-based |
title | Packet-based routing algorithm in DTN based on the intimacy between nodes |
title_full | Packet-based routing algorithm in DTN based on the intimacy between nodes |
title_fullStr | Packet-based routing algorithm in DTN based on the intimacy between nodes |
title_full_unstemmed | Packet-based routing algorithm in DTN based on the intimacy between nodes |
title_short | Packet-based routing algorithm in DTN based on the intimacy between nodes |
title_sort | packet based routing algorithm in dtn based on the intimacy between nodes |
topic | DTN social network intimacy packet-based |
url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.009/ |
work_keys_str_mv | AT enwang packetbasedroutingalgorithmindtnbasedontheintimacybetweennodes AT yongjianyang packetbasedroutingalgorithmindtnbasedontheintimacybetweennodes AT weidanzhao packetbasedroutingalgorithmindtnbasedontheintimacybetweennodes AT linluliu packetbasedroutingalgorithmindtnbasedontheintimacybetweennodes |