An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

📝 Abstract

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm.

💡 Analysis

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm.

📄 Content

          
      !

10.5121/ijcnc.2010.2303 28

          
    N. Ch. Sriman Narayana Iyengar School of Computing Science and Engineering, VIT University, Vellore, India nchsniyengar48@gmail.com

 Syed Mohammad Ansar Sachin kumar, Piyush Nagar, Siddharth Sharma , Akshay Atrey
School of Information Technology and Engineering, VIT University, Vellore, India

ABSTRACT

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyond a certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion in network increases due to control packets generated by the routing protocols in the process of route discovery and route maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDV for the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. This paper introduces the concept of random routing algorithm that neither maintains a routing table nor floods the entire network as done by various known protocols thereby reducing the load on network in terms of number of control packets in a highly dynamic scenario. This paper calculates the expected run time of the designed random algorithm. KEY WORDS

Random Algorithms, MANETS 1.INTRODUCTION

MANETS [1, 2] are self organizing groups of mobile nodes which also act as router, connected by wireless links. MANETS do not have a centralized infrastructure (i.e.) there is no fixed central node to coordinate the task of routing. Due to fixed wireless range the source node will use multiple hops to communicate to destination node.
With the recent technological advances in wireless communication and the increasing popularity of portable computing devices, wireless and mobile ad hoc networks are expected to play increasingly important role in future civilian and military settings where wireless access to wired backbone is either
          
      !

29 ineffective or impossible. Mobile ad hoc networks (MANETs) are composed of a set of stations (nodes) communicating through wireless channels, without any fixed backbone support. Applications of MANETs include, but are not limited to, military operations, security, emergency, and rescue operations, among other applications where intense utilization of a communication networks is available for a very limited time. However, frequent topology changes caused by node mobility make routing in wireless ad hoc networks a challenging problem. In addition, limited capabilities of mobile stations require a control on node congestion due to message forwarding and limited battery consumption. Mobility of mobile hosts introduces also new challenging problems that were not encountered in the design and implementation of conventional wireless and wired networks. A critical and challenging problem of mobile ad hoc networking and computing is how to fully cope with the special characteristics of the wireless and mobile ad hoc environment, make balanced use of computation and communication resources, and support user mobility. Most of the available literature in this emerging technology concentrates on physical and networking aspects of the subject. However, in most of the these studies, they have neglected the description of the fundamental design of distributed algorithms and have not discussed how to apply them to wireless and mobile ad hoc network environments. An important requirement for successful deployment of wireless and mobile ad hoc network-based applications is the careful evaluation of performance and investigation of alternative algorithms, prior to their implementation.

2.MAJOR ISSUES WITH EXISTING ROUTING PROTOCOLS FOR MANET’S There are two types of routing protocols, proactive protocols and Reactive protocols. Proactive protocols periodically send control packets in the network to update routing tables. But as the network becomes more and more dynamic these control packets increase network congestion. Reactive protocols send control packets for route discovery upon demand from the sender. The performance of both
proactive protocols as well as reactive protocols degrade when network becomes highly dynamic due to movement of nodes. This results in increment of

This content is AI-processed based on ArXiv data.