An Efficient Community-based Routing Algorithm in Opportunistic Social Networks
To solve the problems of high transmission delay and low forwarding efficiency in the Routing Algorithm based on Daily Routines（RADR）in opportunistic social networks,an Efficient Community-based Routing Algorithm is proposed（ECRA）.The algorithm only selects the neighbor nodes which are in the same c...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
《光通信研究》编辑部
2016-01-01
|
| Series: | Guangtongxin yanjiu |
| Subjects: | |
| Online Access: | http://www.gtxyj.com.cn/thesisDetails#10.13756/j.gtxyj.2016.02.020 |
| _version_ | 1827258886314262528 |
|---|---|
| author | REN Zhi HUANG Xi-kai TAN Yong-yin |
| author_facet | REN Zhi HUANG Xi-kai TAN Yong-yin |
| author_sort | REN Zhi |
| collection | DOAJ |
| description | To solve the problems of high transmission delay and low forwarding efficiency in the Routing Algorithm based on Daily Routines（RADR）in opportunistic social networks,an Efficient Community-based Routing Algorithm is proposed（ECRA）.The algorithm only selects the neighbor nodes which are in the same community with message destination node to calculate the node’s important degree.The algorithm uses topological connections to intercept the encounter node.If there exists node which has higher node’s importance than the encounter nodes neighbor,the message is transmitted to the encounter node neighbor nodes by the encounter node.Theoretical analysis and simulation results show that ECRA outperforms existing RADR and the correlation algorithms in terms of delivery ratio,average end-end delivery delay,relay ratio and average storage time. |
| first_indexed | 2024-04-10T19:13:23Z |
| format | Article |
| id | doaj.art-6634d9cad88045039f0a9870f1b313f1 |
| institution | Directory Open Access Journal |
| issn | 1005-8788 |
| language | zho |
| last_indexed | 2025-03-22T02:17:49Z |
| publishDate | 2016-01-01 |
| publisher | 《光通信研究》编辑部 |
| record_format | Article |
| series | Guangtongxin yanjiu |
| spelling | doaj.art-6634d9cad88045039f0a9870f1b313f12024-05-06T09:50:50Zzho《光通信研究》编辑部Guangtongxin yanjiu1005-87882016-01-01636627987210An Efficient Community-based Routing Algorithm in Opportunistic Social NetworksREN ZhiHUANG Xi-kaiTAN Yong-yinTo solve the problems of high transmission delay and low forwarding efficiency in the Routing Algorithm based on Daily Routines（RADR）in opportunistic social networks,an Efficient Community-based Routing Algorithm is proposed（ECRA）.The algorithm only selects the neighbor nodes which are in the same community with message destination node to calculate the node’s important degree.The algorithm uses topological connections to intercept the encounter node.If there exists node which has higher node’s importance than the encounter nodes neighbor,the message is transmitted to the encounter node neighbor nodes by the encounter node.Theoretical analysis and simulation results show that ECRA outperforms existing RADR and the correlation algorithms in terms of delivery ratio,average end-end delivery delay,relay ratio and average storage time.http://www.gtxyj.com.cn/thesisDetails#10.13756/j.gtxyj.2016.02.020opportunistic social networks;routing algorithms;communities;important degree;interceptionmechanism |
| spellingShingle | REN Zhi HUANG Xi-kai TAN Yong-yin An Efficient Community-based Routing Algorithm in Opportunistic Social Networks Guangtongxin yanjiu opportunistic social networks;routing algorithms;communities;important degree;interceptionmechanism |
| title | An Efficient Community-based Routing Algorithm in Opportunistic Social Networks |
| title_full | An Efficient Community-based Routing Algorithm in Opportunistic Social Networks |
| title_fullStr | An Efficient Community-based Routing Algorithm in Opportunistic Social Networks |
| title_full_unstemmed | An Efficient Community-based Routing Algorithm in Opportunistic Social Networks |
| title_short | An Efficient Community-based Routing Algorithm in Opportunistic Social Networks |
| title_sort | efficient community based routing algorithm in opportunistic social networks |
| topic | opportunistic social networks;routing algorithms;communities;important degree;interceptionmechanism |
| url | http://www.gtxyj.com.cn/thesisDetails#10.13756/j.gtxyj.2016.02.020 |
| work_keys_str_mv | AT renzhi anefficientcommunitybasedroutingalgorithminopportunisticsocialnetworks AT huangxikai anefficientcommunitybasedroutingalgorithminopportunisticsocialnetworks AT tanyongyin anefficientcommunitybasedroutingalgorithminopportunisticsocialnetworks AT renzhi efficientcommunitybasedroutingalgorithminopportunisticsocialnetworks AT huangxikai efficientcommunitybasedroutingalgorithminopportunisticsocialnetworks AT tanyongyin efficientcommunitybasedroutingalgorithminopportunisticsocialnetworks |