A Framework for Dual-Agent MANET Routing Protocols

Nodes forming mobile ad hoc networks (MANET) can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) and 2) a selfless network agent serving the broad interests of the network. The routing tasks performed by any mobile node can then be shared between physically distinct user and network agents. The user agent could be a laptop, PDA or any such mobile network device. The network agent can be a secure co-processor in the form of a SIM card. In the interests of protecting the integrity of the network agent and keeping its cost low, it is desirable to reduce its complexity. We identify four broad classes of attacks that can be perpetrated by the user agents on resource constrained network agents, and propose low complexity strategies within the scope of network agents, to overcome such attacks and ensure the integrity of the routing protocol.

[1]  Victor C. M. Leung,et al.  Secure routing with tamper resistant module for mobile Ad hoc networks , 2003, MOCO.

[2]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[3]  Mahalingam Ramkumar.  Trustworthy Computing under Resource Constraints with the DOWN Policy , 2008, IEEE Transactions on Dependable and Secure Computing.

[4]  A. Yasinsac,et al.  Identifying flaws in the secure routing protocol , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[5]  Jean-Pierre Hubaux,et al.  The quest for security in mobile ad hoc networks , 2001, MobiHoc '01.

[6]  Scott Rose,et al.  DNS Security Introduction and Requirements , 2005, RFC.

[7]  Scott Rose,et al.  DNS Security Introduction and Requirements , 2005, RFC.

[8]  Victor C. M. Leung,et al.  Secure Routing for Mobile Ad Hoc Networks , 2006 .

[9]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[10]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[11]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[12]  N. Asokan,et al.  Securing ad hoc routing protocols , 2002, WiSE '02.

[13]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[14]  Paul Ward,et al.  Trusted computing for protecting ad-hoc routing , 2006, 4th Annual Communication Networks and Services Research Conference (CNSR'06).

[15]  Sean W. Smith.  Trusted Computing Platforms: Design and Applica-tions , 2004 .

[16]  Chris McDonald,et al.  Trusted route discovery with TORA protocol , 2004, Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004..