An Efficient Trusted Computing Base for MANET Security


Devices participating in mobile ad hoc networks (MANET) are expected to strictly adhere to a uniform routing protocol to route data packets among themselves. Unfortunately, MANET devices, composed of untrustworthy software and hardware components, expose a large attack surface. This can be exploited by attackers to gain control over one or more devices, and wreak havoc on the MANET subnet. The approach presented in this paper to secure MANETs restricts the attack surface to a single module in MANET devices a trusted MANET module (TMM). TMMs are deliberately constrained to demand only modest memory and computational resources in the interest of further reducing the attack surface. The specific contribution of this paper is a precise characterization of simple TMM functionality suitable for any distance vector based routing protocol, to realize the broad assurance that “any node that fails to abide by the routing protocol will not be able to participate in the MANET”.

Share and Cite:

Mohanty, S. , Thotakura, V. and Ramkumar, M. (2014) An Efficient Trusted Computing Base for MANET Security. Journal of Information Security, 5, 192-206. doi: 10.4236/jis.2014.54018.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] Royer, E.M. and Toh, C.K. (1999) A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. IEEE Personal Communications, 6, 46-55.
[2] Lampson, B., Abadi, M., Burrows, M. and Wobber, E. (1992) Authentication in Distributed Systems: Theory and Practice. ACM Transactions on Computer Systems, 10, 265-310.
[3] Perkins, C.E. and Bhagwat, P. (1994) Highly Dynamic Destination-Sequenced Distance-Vector Routing (dsdv) for Mobile Computers. Proceedings of the Conference on Communications Architectures, Protocols and Applications, SIGCOMM ‘94, New York, 234-244.
[4] Perkins, C. and Royer, E. (1999) Ad-Hoc on-Demand Distance Vector Routing. Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, WMCSA ’99, 90-100.
[5] Merkle, R.C. (1980) Protocols for Public Key Cryptosystems. IEEE Symposium on Security and Privacy, 122.
[6] Ramkumar, M. (2008) On the Scalability of a “Non-Scalable” Key Distribution Scheme. IEEE SPAWN, Newport Beach.
[7] Song, J.-H., Wong, V., Leung, V. and Kawamoto, Y. (2003) Secure Routing with Tamper Resistant Module for Mobile Ad Hoc Networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7, 48-49.
[8] Jarrett, M. and Ward, P. (2006) Trusted Computing for Protecting Ad-Hoc Routing. Proceedings of the 4th Annual Communication Networks and Services Research Conference, CNSR ‘06, Washington DC, 61-68.
[9] Hubaux, J.-P., Buttyán, L. and Capkun, S. (2001) The Quest for Security in Mobile Ad Hoc Networks. Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc ‘01, New York, 146-155.
[10] Bloom, B.H. (1970) Space/Time Trade-Offs in Hash Coding with Allowable Errors. Communications of the ACM, 13, 422-426.
[11] Gaines, B. and Ramkumar, M. (2008) A Framework for Dual-Agent Manet Routing Protocols. IEEE GLOBECOM 2008 Global Telecommunications Conference, 1-6.
[12] Thotakura, V. and Ramkumar, M. (2010) Minimal Trusted Computing Base for Manet Nodes. 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 91-99.

Copyright © 2022 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.