Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks
Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient wa...
Main Authors: | Ruiyun Yu, Pengfei Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2014/569129 |
Similar Items
-
A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy
by: Gang Xu, et al.
Published: (2021-01-01) -
Hybrid Algorithm for Efficient node and Path in Opportunistic IoT Network
by: N. N. Srinidhi, et al.
Published: (2021-05-01) -
An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes
by: Yucheng Lin, et al.
Published: (2018-08-01) -
Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks
by: Aizimaiti Xiaokaiti, et al.
Published: (2021-01-01) -
MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks
by: Mei Guo, et al.
Published: (2019-09-01)