A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

[1]  J. Ott,et al.  Simulating Mobility and DTNs with the ONE , 2010 .

[2]  Tang Ming . Wei Lian. Si Tuo Lin Si,et al.  Cryptography and Network Security - Principles and Practice , 2015 .

[3]  Ari Keränen.  Opportunistic Network Environment simulator , 2008 .

[4]  M. J. Mahjoob,et al.  Bee colony algorithm for real-time optimal path planning of mobile robots , 2009, 2009 Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control.

[5]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[6]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[7]  Amarsinh Vidhate,et al.  Routing in Delay Tolerant Network , 2016 .

[8]  Jörg Ott,et al.  Simulating Mobility and DTNs with the ONE (Invited Paper) , 2010, J. Commun..

[9]  H. M. Faheem,et al.  A multi-agent based system for intrusion detection , 2003 .

[10]  Chunming Qiao,et al.  Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN) , 2006, IWCMC '06.

[11]  Hitesh Tewari,et al.  Real-time intrusion detection for ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[12]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[13]  Philippe Leleu,et al.  A Distributed Intrusion Detection System for Ad-Hoc Wireless Sensor Networks: The AWISSENET Distributed Intrusion Detection System , 2009, 2009 16th International Conference on Systems, Signals and Image Processing.

[14]  E. Ahmed,et al.  Efficient Clustering Approach for Intrusion Detection in Ad Hoc Networks , 2005, 2005 Student Conference on Engineering Sciences and Technology.

[15]  J. Ghosh,et al.  Bridging Intermittently Connected Mobile Ad hoc Networks ( ICMAN ) with Sociological Orbits , 2006 .

[16]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, 2008 6th IEEE International Conference on Industrial Informatics.

[17]  Simin Nadjm-Tehrani,et al.  Geographical Routing With Location Service in Intermittently Connected MANETs , 2011, IEEE Transactions on Vehicular Technology.

[18]  D. Cokuslu,et al.  A flooding based routing algorithm for Mobile Ad Hoc Networks , 2008, 2008 IEEE 16th Signal Processing, Communication and Applications Conference.

[19]  F. Freiling,et al.  Towards Intrusion Detection in Wireless Sensor Networks , 2007 .

[20]  V. Kavitha,et al.  Contention Based Routing in Mobile Ad Hoc Networks with Multiple Copies , 2010, ArXiv.

[21]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[22]  Huan Wang,et al.  An Improved Intrusion Detection Method in Mobile AdHoc Network , 2009, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing.

[23]  Torsten Braun,et al.  BLR: beacon-less routing algorithm for mobile ad hoc networks , 2004, Comput. Commun..

[24]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[25]  Romit Roy Choudhury.  Brownian gossip: exploiting node mobility to diffuse information in ad hoc networks , 2005, 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[26]  Haiying Shen,et al.  A Direction Based Geographic Routing Scheme for Intermittently Connected Mobile Networks , 2008, 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[27]  Prabir Bhattacharya,et al.  A Cooperative Approach for Analyzing Intrusions in Mobile Ad hoc Networks , 2007, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07).

[28]  Wei Kuang Lai,et al.  Spray and hop: Efficient utility-mobility routing for intermittently connected mobile networks , 2009, 2009 Fourth International Conference on Communications and Networking in China.

[29]  Li-Pei Wong,et al.  A Bee Colony Optimization Algorithm for Traveling Salesman Problem , 2008, 2008 Second Asia International Conference on Modelling & Simulation (AMS).

[30]  Ke Shi.  Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks , 2007, 2007 Second International Conference on Communications and Networking in China.

[31]  Arputharaj Kannan,et al.  Enhanced intrusion detection techniques for mobile ad hoc networks , 2007 .

[32]  A.F. Farhan,et al.  Mobile agent intrusion detection system for Mobile Ad Hoc Networks: A non-overlapping zone approach , 2008, 2008 4th IEEE/IFIP International Conference on Central Asia on Internet.

[33]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[34]  Li-Pei Wong,et al.  An efficient Bee Colony Optimization algorithm for Traveling Salesman Problem using frequency-based pruning , 2009, 2009 7th IEEE International Conference on Industrial Informatics.

[35]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[36]  A. Kannan,et al.  Multi-Layer Integrated Anomaly Intrusion Detection System for Mobile Adhoc Networks , 2007, 2007 International Conference on Signal Processing, Communications and Networking.