TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs
A delay tolerant network (DTN) presents a new communication model, which uses a store-carry-forward approach to deliver messages due to the nature of the network. With the development of the mobile internet, the research on DTNs becomes a hot topic. One critical issue in the DTNs with social charact...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2015
|
Online Access: | https://hdl.handle.net/10356/81130 http://hdl.handle.net/10220/39074 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-81130 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-811302020-03-07T13:57:22Z TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs Zhang, Zhenjing Ma, Maode Jin, Zhigang School of Electrical and Electronic Engineering A delay tolerant network (DTN) presents a new communication model, which uses a store-carry-forward approach to deliver messages due to the nature of the network. With the development of the mobile internet, the research on DTNs becomes a hot topic. One critical issue in the DTNs with social characteristics is that there could exist selfish and malicious nodes which block important data and as a result intentionally disturb the communication. Although there are many research works which address the issue and adopt various trust models to encourage nodes to forward information, most of them have not considered the social characteristics of the mobile nodes and they have not handled the selfish behaviors and attacks in a systematic way. In view of these defects, we propose a novel solution to address the selfish and security issues in social DTNs. Based on nodes’ social characteristics, a dynamic trust model is proposed to prevent bad-mouthing and ballot stuffing attacks and the Shannon entropy function is introduced to avoid blackhole and greyhole attacks. The simulation results show that our proposed scheme can significantly improve the performance of social DTNs. And the simulation is proved to be consistent with the results from theoretical analysis. Published version 2015-12-14T03:03:10Z 2019-12-06T14:22:05Z 2015-12-14T03:03:10Z 2019-12-06T14:22:05Z 2015 Journal Article Zhang, Z., Ma, M., & Jin, Z. (2015). TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs. International Journal of Distributed Sensor Networks, 2015, 690482-. 1550-1329 https://hdl.handle.net/10356/81130 http://hdl.handle.net/10220/39074 10.1155/2015/690482 en International Journal of Distributed Sensor Networks © 2015 Zhenjing Zhang et al.This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 11 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
description |
A delay tolerant network (DTN) presents a new communication model, which uses a store-carry-forward approach to deliver messages due to the nature of the network. With the development of the mobile internet, the research on DTNs becomes a hot topic. One critical issue in the DTNs with social characteristics is that there could exist selfish and malicious nodes which block important data and as a result intentionally disturb the communication. Although there are many research works which address the issue and adopt various trust models to encourage nodes to forward information, most of them have not considered the social characteristics of the mobile nodes and they have not handled the selfish behaviors and attacks in a systematic way. In view of these defects, we propose a novel solution to address the selfish and security issues in social DTNs. Based on nodes’ social characteristics, a dynamic trust model is proposed to prevent bad-mouthing and ballot stuffing attacks and the Shannon entropy function is introduced to avoid blackhole and greyhole attacks. The simulation results show that our proposed scheme can significantly improve the performance of social DTNs. And the simulation is proved to be consistent with the results from theoretical analysis. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Zhang, Zhenjing Ma, Maode Jin, Zhigang |
format |
Article |
author |
Zhang, Zhenjing Ma, Maode Jin, Zhigang |
spellingShingle |
Zhang, Zhenjing Ma, Maode Jin, Zhigang TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
author_sort |
Zhang, Zhenjing |
title |
TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
title_short |
TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
title_full |
TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
title_fullStr |
TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
title_full_unstemmed |
TR-SDTN: Trust Based Efficient and Scalable Routing in Hostile Social DTNs |
title_sort |
tr-sdtn: trust based efficient and scalable routing in hostile social dtns |
publishDate |
2015 |
url |
https://hdl.handle.net/10356/81130 http://hdl.handle.net/10220/39074 |
_version_ |
1681033914914701312 |