loading...
Trusted Route Discovery with TORA Protocol
Fredericton, N.B., Canada May 19-May 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DNSR.2004.1344720Second Annual Conference on Communica ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Asad Amir Pirzada, University of Western Australia
Chris McDonald, University of Western Australia
An ad-hoc network is formed when a group of wireless nodes pledge to help each other in passing packets based upon a pre-agreed protocol. Temporally Ordered Routing Algorithm (TORA) is one of the commonly used protocols for ad-hoc wireless networks. Route discovery in TORA is done in a cooperative manner with intermediate nodes contributing to the route generation. Precision in route build-up demands that all network nodes portray persistent benevolent behavior. This is however, not always possible to achieve and so a number of malicious nodes participate in the TORA route discovery process only to sabotage the network by violating the protocol. In this paper we present a novel mechanism for establishing trust in ad-hoc networks that execute the Temporally Ordered Routing Algorithm (TORA) Protocol. The routes discovered using our model are not cryptographically secure but each one of them carries a confidence measure regarding its suitability in the current scenario.
Citation:
Asad Amir Pirzada, Chris McDonald, "Trusted Route Discovery with TORA Protocol," cnsr, pp.121-130, Second Annual Conference on Communication Networks and Services Research (CNSR'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.