An Improved Spray and Wait Routing Algorithm Based on Stable Transmission Capacity Evaluation of Nodes in Opportunistic Network
In opportunistic network, the regular connectivity of nodes and their individual conditions significantly influence message transmission. To address this, we propose an improved spray and wait routing algorithm based on stable transmission capacity evaluation of nodes (referred to as STCESW), which...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | http://dx.doi.org/10.1155/2024/7471329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In opportunistic network, the regular connectivity of nodes and their individual conditions significantly influence message transmission. To address this, we propose an improved spray and wait routing algorithm based on stable transmission capacity evaluation of nodes (referred to as STCESW), which is derived from traditional Prophet and spray and wait algorithms but surpasses them. STCESW incorporates network models that consider node connection stability and transmission capacity, aiming to enhance the update and punishment formulas for node delivery probability. Furthermore, it combines the residual message buffer size of nodes with the angle between motion directions of nodes to determine more efficient and extensive message spraying in the network. The simulation results clearly indicate that STCESW significantly outperforms the other three enhanced algorithms in both SPMBM and RWP. It demonstrates its robust performance in terms of delivery probability, showing an increase ranging from 2% to 87% across diverse node buffer sizes or simulation time intervals. Additionally, it compromises slightly on delivery latency while maintaining relatively stable message latency and buffer time. |
|---|---|
| ISSN: | 1550-1477 |