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: | En WANG, Yong-jian YANG, Wei-dan ZHAO, Lin-lu LIU |
|---|---|
| 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!
|
Similar Items
-
A Social DTN Network Routing Algorithm Based on Data Link
by: WANG Zhihai, et al.
Published: (2020-02-01) -
Enhanced binary Spray and Wait scheme based on reputation for DTN
by: Xi ZHANG, et al.
Published: (2012-12-01) -
Minimum delay algorithm based on time aggregated graph in DTN network
by: Peng WANG, et al.
Published: (2017-10-01) -
From Customer Intimacy to Digital Customer Intimacy
by: Qianhua Liu, et al.
Published: (2024-12-01) -
Social-based routing in pocket switched networks
by: AOJiu-xin C, et al.
Published: (2015-05-01)