Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV) Export

@incollection{sdsdv, abstract = {A mobile ad hoc network (MANET) is formed by a group of mobile wireless nodes, each of which functions as a router and agrees to forward packets for others. Many routing protocols (e.g., AODV, DSDV, etc) have been proposed for MANETs. However, most assume that nodes are trustworthy and cooperative. Thus, they are vulnerable to a variety of attacks. We propose a secure routing protocol based on DSDV, namely S-DSDV, in which a well-behaved node can successfully detect a malicious routing update with any sequence number fraud (larger or smaller) and any distance fraud (shorter, same, or longer) provided no two nodes are in collusion. We compare security properties and efficiency of S-DSDV with superSEAD. Our analysis shows that S-DSDV-R, a variation of S-DSDV with a risk window similar to that of superSEAD, offers better security than superSEAD with less network overhead. Keywords: DSDV, Routing Security, Wireless Security, Security Analysis}, author = {Wan, Tao and Kranakis, Evangelos and van Oorschot, Paul C.}, citeulike-article-id = {3378886}, citeulike-linkout-0 = {http://www.springerlink.com/content/trdj7qmr411wquq8}, journal = {Information and Communications Security}, keywords = {dsdv}, pages = {358--374}, posted-at = {2008-10-06 10:27:27}, priority = {0}, title = {Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)}, url = {http://www.springerlink.com/content/trdj7qmr411wquq8}, year = {2004} }

TY - CHAP ID - sdsdv L3 - citeulike-article-id:3378886 N2 - A mobile ad hoc network (MANET) is formed by a group of mobile wireless nodes, each of which functions as a router and agrees to forward packets for others. Many routing protocols (e.g., AODV, DSDV, etc) have been proposed for MANETs. However, most assume that nodes are trustworthy and cooperative. Thus, they are vulnerable to a variety of attacks. We propose a secure routing protocol based on DSDV, namely S-DSDV, in which a well-behaved node can successfully detect a malicious routing update with any sequence number fraud (larger or smaller) and any distance fraud (shorter, same, or longer) provided no two nodes are in collusion. We compare security properties and efficiency of S-DSDV with superSEAD. Our analysis shows that S-DSDV-R, a variation of S-DSDV with a risk window similar to that of superSEAD, offers better security than superSEAD with less network overhead. Keywords: DSDV, Routing Security, Wireless Security, Security Analysis JF - Information and Communications Security EP - 374 TI - Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV) SP - 358 KW - dsdv AU - Wan, Tao AU - Kranakis, Evangelos AU - van Oorschot, Paul PY - 2004/// UR - http://www.springerlink.com/content/trdj7qmr411wquq8 ER -