An efficient routing and cache management algorithm based on interest-community for opportunity networks
Aiming at the problem of control message redundancy existing in BEEINFO algorithm,unconsidered node multi-neighbor message forwarding problem and unreasonable management of message in cache,an efficient routing and cache management algorithm named ERCMAON which based on community of interest was pro...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2018-06-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018160/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Aiming at the problem of control message redundancy existing in BEEINFO algorithm,unconsidered node multi-neighbor message forwarding problem and unreasonable management of message in cache,an efficient routing and cache management algorithm named ERCMAON which based on community of interest was proposed.The message forwarding delay was reduced by streamlining control messages,increasing the route design for multiple-neighbor nodes.At the same time,by optimizing the node cache management mechanism,the probability of deleting useful information was reduced,which could improve the success rate of message delivery.Simulation results show thatcompared with the BEEINFO algorithm,the delivery success rate of ERCMAON algorithm increases by at least 2.0%,the data delivery overhead and the normalized control overhead reduces by at least 9.7% and 1.7% respectively.At the same time,the message transmission delay reduces at least 2.4%. |
|---|---|
| ISSN: | 1000-0801 |