Social‐based reputation‐aware data forwarding for improved multicast delivery in the presence of selfish nodes in DTNs

Summary Delay/disruption tolerant networks (DTNs) are potentially applicable in the challenged scenarios like post‐disaster environments. In such networks, data forwarding generally relies on the mutual cooperation of the nodes. However, in reality, despite the availability of necessary resources fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of communication systems 2020-03, Vol.33 (4), p.n/a
Hauptverfasser: Roy, Animesh, Acharya, Tamaghna, Das Bit, Sipra
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary Delay/disruption tolerant networks (DTNs) are potentially applicable in the challenged scenarios like post‐disaster environments. In such networks, data forwarding generally relies on the mutual cooperation of the nodes. However, in reality, despite the availability of necessary resources for data forwarding, a node could misbehave by dropping messages received from other nodes with whom it has no strong social ties. Such a node is called a socially selfish node, which would cause a poor delivery ratio in the network. In this paper, we aim to address the problem of multicast data forwarding in the presence of such selfish nodes, by means of efficient relay selection in DTNs. First, we define a realistic reputation model, in contrast to existing models, to define the socially selfish/misbehaving nodes in the network. Further, a game‐theoretic analysis is carried out that implies data forwarding cost is also an influential parameter in handling selfishness/misbehavior. Subsequently, the problem is formulated as a constrained optimization problem, which is NP hard. Therefore, a heuristic is proposed by combining the reputation of a node and the cost of message forwarding to appropriately identify relay nodes, thus improve the performance of the multicast message delivery in the network. We utilize a social metric, centrality to minimize the message forwarding cost in terms of the number of relay nodes. Finally, the comparative performance evaluation in ONE simulator with practical scenarios shows the superiority of the proposed scheme over the other prominent schemes. In this paper, a Misbehavior Handling Scheme (MHS) is proposed for multicast delivery considering the reputation of the nodes. Based on a game‐theoretic analysis, the cost in terms of the number of relay nodes is also considered. To minimize such cost, the centrality of the nodes is utilized in the proposed scheme. The comparative performance shows that MHS achieves a fair delivery ratio with lower cost, overhead, and energy than the other prominent schemes.
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.4235