RARAN: Authenticated Routing for Ad Hoc Networks Protocol with Reputation
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)
The field of MANETs is rapidly growing and changing. While there are still many challenges that need to be met, it is likely that such networks will see widespread use within the next few years. One of these challenges is security. Security of mobile ad hoc networks has recently gained momentum in the research community. Due to the open nature of ad hoc networks and their inherent lack of infrastructure, security exposures can be an impediment to basic network operation and countermeasures should be included in network functions from the early stages of their design. In this paper, we analyze one of the secure mobile ad hoc networks protocols, which is Authenticated routing for ad hoc networks (ARAN). Such protocol is classified as a secure reactive routing protocol, which is based on some type of query-reply dialog. That means ARAN does not attempt to continuously maintain the up-to-date topology of the network, but rather when there is a need, it invokes a function to find a route to the destination. Here, we detail the security attacks that the ARAN protocol defends against, criticize how an authenticated selfish node can disturb the network by dropping packets or by not cooperating in the routing functionality and propose a reputation-based scheme called Reputed-ARAN to detect and defend against selfish nodes. The solution presented in this thesis only covers a subset of all threats and is far from providing a comprehensive answer to the many security problems in the MANETs field.
Copyright © 2017 Praise Worthy Prize - All rights reserved.
Kimaya Sanzgiri, Daniel Laflamme, Bridget Dahill, Brian Neil Levine, Clay Shields, Elizabeth M. Belding-Royer. Authenticated Routing for Ad Hoc Networks. MobiCom 2005.
P. Michiardi and R. Molva. Simulation-based Analysis of Security Exposures in Mobile Ad Hoc Networks. Proceedings of European Wireless Conference, February 2002.
P. Dewan and P. Dasgupta. Trusting Routers and Relays in Ad hoc Networks. First International Workshop on Wireless Security and Privacy in conjunction with IEEE International Conference on Parallel Processing Workshops (ICPP), October2003.
Bruce Schneier. Modeling security threats. Dr Dobb’s Journal, December 1999.
Sonja Buchegger and Jean-Yves Le Boudec. Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes, Fairness In Dynamic Ad-hoc NeTworks. Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing, MobiHOC, Lausanne, CH, June 2002.
Pietro Michiardi, Refik Molva. Core: A COllaborative REputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks, IFIP-Communication and Multimedia Security Conference 2002.
Prashant Dewan, Partha Dasgupta and Amiya Bhattacharya, On using reputation in ad hoc networks to counter malicious nodes, 10th Int'l Conference on Parallel and Distributed Systems (ICPADS2004), Newport Beach, CA, pp. 665-672, July 2004.
S. Bansal and M. Baker. Observation-based Cooperation Enforcement in Ad Hoc Networks. http://arxiv.org/pdf/cs.NI/0307012, July 2003.
P. Yau and C. Mitchell. Reputation methods for routing security for mobile ad hoc networks. Proceedings of SympoTIC, Joint IST Workshop on Mobile Future and Symposium on Trends in Communications, October 2003, pages 130-137.
About GloMoSim. GloMoSim:
Y. Lee and G. Riley. DNVR (Dynamic NIx-Vector Routing) for Mobile Ad Hoc Networks. Proceedings of the IEEE Wireless Communications and Networking Conference, March 2005.
J. Crowcroft, R. Gibbens, F. Kelly and S. Östring. Modeling Incentives for Collaboration in Mobile Ad Hoc Networks. WiOpt, March 2003.
A. Urpi, M. Bonuccelli and S. Giordano. Modeling Cooperation in Mobile Ad Hoc Networks: a Formal Description of Selfishness. WiOpt, March 2003.
Y. Hu, A. Perrig and D. Johnson. Rushing attacks and defense in wireless ad hoc network routing protocols. Proceedings of second ACM Wireless Security, September 2003, pages 30-40.
J. Hubaux, L. Buttyan and S. Capkun. The Quest for Security in Mobile Ad Hoc Networks. Proceedings of the second ACM Symposium on Mobile Ad Hoc Networking and Computing, October 2001, pages 146-155.
J. Broch, D. Maltz, D. Johnson, Y. Hu and J. Jetcheva. Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, October 1998, pages 85-97.
C. Perkins and E. Royer. Ad-Hoc On-Demand Distance Vector Routing. Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, February 1999, pages 90-100.
Y. Hu, D. Johnson, and A. Perrig. SEAD: Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In Fourth IEEE Workshop on Mobile Computing Systems and Applications, June 2002, pages 3-13.
P. Papadimitratos, Z. Haas and P. Samar. The Secure Routing Protocol (SRP) for Ad Hoc Networks. Internet-Draft, draft-papadimitratos-secure-routing-protocol-00.txt, December 2002.
P. Papadimitratos and Z. Haas. Secure data transmission in mobile ad hoc networks. Proceedings of WiSe, September 2003, pages 41-50.
M. Zapata and N. Asokan. Securing Ad Hoc Routing Protocols. In Proceedings of the ACM Workshop on Wireless Security, September 2002, pages 1-10.
M. Ilyas and R. Dorf. The handbook of ad hoc wireless networks. The Electrical Engineering Handbook Series archive. Publisher CRC Press, 2003.
P. Dewan, P. Dasgupta and A. Bhattacharya. On using reputation in ad hoc networks to counter malicious nodes. 10th International Conference on Parallel and Distributed Systems, July 2004.
J. Cano and D. Kim. Investigating Performance of Power-aware Routing Protocols for Mobile Ad Hoc Networks. IEEE MobiWac, October 2002.
S. Chakrabarti and A. Mishra. QoS Issues in Ad Hoc Wireless Networks. IEEE Communication Magazine, February 2001, pages 142-148.
- There are currently no refbacks.
Please send any question about this web site to email@example.com
Copyright © 2005-2022 Praise Worthy Prize