Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....across mobile ad hoc domains. Our goal is to provide correct (i.e. factual) up to date, and authentic link state information, robust against Byzantine behavior and failures of individual nodes. The choice of a link state protocol provides such robustness, unlike distance vector protocols [5], which can be significantly more affected by a single misbehaving node. Furthermore, the availability of explicit connectivity information, present in link state protocols, has additional benefits: examples include the ability of the source to determine and route simultaneously across multiple ....

Y-C. Hu, D.B. Johnson, and A. Perrig. "Secure efficient distance vector routing in mobile wireless ad hoc networks." Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), Jun. 2002.

....flexibility. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks, Yih Chun Hu (Rice University) David B. Johnson (Rice University) Adrian Perrig (UC Berkeley) We describe our protocol, which we call the Secure Efficient Ad hoc Distance vector routing protocol (SEAD) [13]. SEAD is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of active attackers or compromised nodes in the network. We base the design of SEAD in part on the Destination Sequenced Distance Vector ad hoc network routing protocol ....

Y.-C. Hu, D. B. Johnson, and A. Perrig. Secure efficient distance vector routing in mobile wireless ad hoc networks. In Proceedings of the 4 IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), June 2002.

....communication, which is vulnerable to a single point of compromise. The authors argued to use hardware based tamper resistance mechanisms to limit the damage. Papadimitratos and Haas [70] devise a scheme that secures on demand routing protocol against non collaborative adversaries. Hu et al. [40, 41] use one way key chains to authenticate routing messages for proactive and on demand protocols. 2.4 Trust and authentication Some popular network security services are provided by Kerberos and X.509 Directory Authentication Service. In these proposals, services are typically achieved via a ....

....transmissions. Related future work includes mobile network tracing [69, 68] and node classification based on data mining technologies [21] 6.4 More work on securing MANET multicast protocols Perrig et al. 76, 77] have devised data integrity support for Internet multicast applications. In [40, 41], similar integrity support has been integrated into unicast ad hoc routing schemes to foil routing misbehavior. However, so far little efforts have been exerted on securing multicast protocols in ad hoc networks. We will analyse the security demands of wireless multicast protocols in ad hoc ....

Y.-C. Hu, D. B. Johnson, and A. Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3--13, June 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002.

....by a compromised node. Papadimitratos and Haas [40] present work that secures against non colluding adversaries, and they do not authenticate intermediate nodes that forward ROUTE REQUESTs, and thus do not handle authorization. Yi et al. [55] discuss authorization issues. Our previous work, SEAD [20], uses hash chains to authenticate routing updates sent by a distance vector protocol; however, that approach builds on a periodic protocol, and such protocols tend to have higher overhead than on demand protocols and may not be suitable in highly mobile networks. Routing protocol intrusion ....

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3-- 13, June 2002.

....by a compromised node. Papadimitratos and Haas [39] present work that secures against non colluding adversaries, and they do not authenticate intermediate nodes that forward ROUTE REQUESTs, and thus do not handle authorization. Yi et al. [54] discuss authorization issues. Our previous work, SEAD [19], uses hash chains to authenticate routing updates sent by a distance vector protocol; however, that approach builds on a periodic protocol, and such protocols tend to have higher overhead than on demand protocols and may not be suitable in highly mobile networks. Routing protocol intrusion ....

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3-- 13, June 2002.

....by a compromised node. Papadimitratos and Haas [40] present work that secures against non colluding adversades, and they do not authenticate intermediate nodes that forward ROUTE REQUESTs, and thus do not handle authorization. Yi et al. [55] discuss authorization issues. Our previous work, SEAD [20], uses hash chains to authenticate routing updates sent by a distance vector protocol; however, that approach builds on a periodic protocol, and such protocols tend to have higher overhead than on demand protocols and may not be suitable in highly mobile networks. Routing protocol intrusion ....

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth 1EEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), pages 3 13, June 2002.

....they 16 specify the use of secure hardware to limit the damage that can be done by a compromised node. Papadimitratos and Haas [61] present work that secures against non colluding adversaries, and do not authenticate intermediate nodes which forward ROUTE REQUESTS. Hu, Johnson, and Perrig [33] use hash chains to authenticate routing updates sent by a periodic protocol; however, their approach builds on a periodic protocol, and such approaches tend to have higher overhead than on demand protocols. Yi, Naldurg, and Kravets [89] present the notion of security requirements for paths ....

Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Secure efficient distance vector routing in mobile wireless ad hoc networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002. To appear.

No context found.

Y.-C. Hu, D. B. Johnson, and A. Perrig, "Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks," in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

No context found.

Y.-C. Hu, D. B. Johnson, and A. Perrig, "Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks," in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

No context found.

Y.-C. Hu, D. B. Johnson, and A. Perrig. Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

No context found.

Yih-Chun Hu, David B. Johnson, and Adrian Perrig, "Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks," in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

No context found.

Y.-C. Hu, D. B. Johnson, and A. Perrig, "Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks," in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'02), 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC