A secure DSDV routing protocol for ad hoc mobile networks

ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 > Item 310904400/8831

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8831

Title:	A secure DSDV routing protocol for ad hoc mobile networks
Authors:	Wang, Jyu-Wei;Chen, Hsing-Chung;Lin, Yi-Ping
Contributors:	Department of Computer Science and Information Engineering
Keywords:	Information management;Mobile telecommunication systems;Network security;Routing protocols;Semiconductor storage;Vectors;Wireless telecommunication systems;Ad hoc mobile networks;Ad hoc mobile wireless networks;Destination sequenced distance vectors;Destination-Sequenced Distance-Vector routing protocols;Distance vector;Hash chains;Hash value;Lower bounds;Metric values;One way hash chain;Routing security;Sequence number
Date:	2009
Issue Date:	2010-04-08 12:22:09 (UTC+0)
Publisher:	Asia University
Abstract:	This paper presents a secure destination-sequenced distance-vector routing protocol (SDSDV) for ad hoc mobile wireless networks. The proposed protocol is based on the regular DSDV protocol. Within SDSDV, each node maintains two one-way hash chains about each node in the network. Two additional fields, which we call AL (alteration) field and AC (accumulation) field, are added to each entry of the update packets to carry the hash values. With proper use of the elements of the hash chains, the sequence number and the metric values on a route can be protected from being arbitrarily tampered. In comparison with the secure efficient distance vector (SEAD) protocol previously proposed in the literature provides only lower bound protection on the metrics, SDSDV can provide complete protection. © 2009 IEEE.
Relation:	NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC :2079-2084
Appears in Collections:	[資訊工程學系] 會議論文

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	418	View/Open
62.doc		30Kb	Microsoft Word	308	View/Open

Loading...