A trust-based Probing to secure data routing

被引：0

作者：

Bouabana-Tebibel, Thouraya ^{[1
]}

Tebibel, Nidal ^{[2
]}

Zemmouri, Selma ^{[3
]}

机构：

[1] LCSI, Algiers, Algeria

[2] Ecole Natl Super Informat, Algiers, Algeria

[3] Univ Sci & Technol Houari Boumed, Algiers, Algeria

来源：

2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI) | 2014年

关键词：

MANET; Probing; Hash Chain; Trust;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In mobile ad hoc networks packets dropping is a classical weakness that may be caused either by misbehaving nodes or just faulty links. Isolating the nodes behind such effects is an efficient solution for decreasing packet loss. We propose, in this paper, a new secure protocol to monitor, detect, and safely isolate misbehaving nodes. The proposed solution is based on authentication and trust. First, it improves the Probing approach with a new technique allowing detection of nodes responsible for the dropping. Next, it enhances routes security by applying on the faulty nodes mechanisms based on trust. The proposed protocol is analyzed using the NS-2 simulator.

引用

页码：1592 / 1597

页数：6

共 13 条

[1]

[Anonymous], 2007, IETFRFC4728

[2]

Arya KV, 2011, COMM COM INF SC, V166, P675

[3]

Awerbuch B, 2008, ACM T INFORM SYST SE, V10, DOI [10.1145/1284680.1284686, 10.1145/1284680.1341892]

[4] Robust random number generation for peer-to-peer systems [J].

Awerbuch, Baruch ;

Scheideler, Christian .

THEORETICAL COMPUTER SCIENCE, 2009, 410 (6-7) :453-466

[5]

Bhalaji N., 2010, 3 INT C NETW SEC APP

[6]

Buchegger Buchegger S. S., 2002, Proceedings of ACM International Symposium on Mobile Ad Hoc Net-working and Computing (MobiHoc), P226

[7] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654

[8]

Kargl F., 2004, P 1 EUR SEC AD HOC S, P152

[9]

Laidoui F., 2014, INTEGRATION REUSABLE, V263, P325

[10] PASSWORD AUTHENTICATION WITH INSECURE COMMUNICATION [J].

LAMPORT, L .

COMMUNICATIONS OF THE ACM, 1981, 24 (11) :770-772

← 1 2 →