A New Method to Recover the Link Failure and Reliable Data Delivery in MANET

Download Full-Text PDF Cite this Publication

Text Only Version

A New Method to Recover the Link Failure and Reliable Data Delivery in MANET

M. Selvi Department of Computer Science Research Scholar, VTU, RRCE

Bangalore, India


-The wireless mobile networks and devices are becoming increasingly popular as they provide users access to information and communication anytime and anywhere . MANETs differs it from wired networks in the way that they have fast and unpredictable topology that changes due to nodes mobility and in this no dedicated routers is required to do routing every node works as a router and a host, it also have the capacity of changing channel capacity due to environmental effects and use multi hop approach to deliver data. In this paper we proposed a new method to recover the link failure and reliable data delivery in MANET is ENAMP(Enhanced Neighbor Awareness of Multicast Routing Protocol).This method will be very beneficial for reliable data delivery for high dynamic MANET. The aim of this protocol is to avoid the link failure and to deliver the data very securely. ENAMP is a combined feature of NAMP ad SPREAD. NAMP means Neighbor Awareness of Multicasting Routing Protocol and SPREAD means Secured Protocol for Reliable Data Delivery.

Keywords:- MANET,ENAMP, NAMP, SPREAD, Link Failure and Reliable Data Delivery.


    A mobile ad hoc network is a collection of digital data terminals equipped with wireless transceivers that can communicate with one another without using any xed networking infrastructure .Efficient, dynamic routing is one of the key challenges in mobile ad hoc networks

    .Applications of mobile ad hoc networking technology include industrial, commercial, and military communication networks involving cooperative mobile data exchange where wireless mobile nodes comprise the communications infrastructure.

    The Ad hoc Networks Characteristics are (i)The mobility model can have major impact on the selection of a routing scheme and can thus influence performance.(ii)Multihopping: a multihop network is a network where the path from source to destination traverses several other nodes(iii)Self-organization: the ad hoc network must autonomously determine its own configuration parameters including: addressing, routing, clustering, position identification, power control, etc. In some cases, special nodes (e.g., mobile backbone nodes) can coordinate their motion and dynamically distribute in the geographic area to provide coverage of disconnected is lands(iv)Energy conservation: most ad hoc nodes (e.g., laptops, PDAs, sensors, etc.) have limited power supply and no capability to generate their own power (e.g., solar panels)(v).Scalability: in some applications (e.g., large environmental sensor fabrics, battlefield deployments, urban vehicle grids, etc) the ad hoc network can grow to

    Dr. R. Balakrishna Department of Information Science Raja Rajeswari Engineering College

    Bangalore, India

    several thousand nodes (vi)Security: the challenges of wireless security are well known – ability of the intruders to eavesdrop and jam/spoof the channel. A lot of the work done in general wireless infrastructure networks extends to the ad hoc domain.

    NAMP is a tree based hybrid routing Protocol. It utilizes neighborhood information. The routes in the network maintained by request and reply messages The main features of NAMP is if the receiver is not within the range it searches the receiver using dominant pruning flooding method.

    SPREAD is a hybrid routing protocol. It provides data confidentiality security service in routing protocol ad also it use s secret sharing scheme between neighboring nodes to strengthen data confidentiality


Several issues need to be addressed for NAMP and SPREAD scheme in order to recover the link failure and maximize the security To overcome the issues we designed a ENAMP .first the block diagram explains combined working methodology of ENAMP and SPREAD, secondly the pictorial representation of algorithm ,Thirdly step by step procedure of ENAMP

  1. Block diagram

    The diagram shows in fig 1 sensor node means source ad destination node it helps to transmit and receive the information. mobility represents the node movement random mobility is used for the node wherever to move Authorization is nothing but SPREAD features implementation multicasting is the place using the NAMP features To overcome the SPREAD issues here we implemented like failure detection and recovery portion. For NAMP we designed a algorithm Trusted dominant pruning flooding method ad also I the overall architecture of ENAMP we newly added onetime password (OTP) feature for the security purpose.

    Fig .1. Block diagram


    MANET – Topology

    MANET – Topology

    Assign the Sender _ ID

    Assign the Sender _ ID

    Link _ Establishment


    RSSI >


    Link _Failure

    Link _Failure






    Multi _ Cast Route

    Multi _ Cast Route


    Limit hop_t==2







    Fig 2 Flow chart

  2. Flowchart

Figure 2 presents an extension of block diagram. It should be explains how the algorithm works .MAET starts with topology work and its assign the sender_ID .If RSSI(Received Signal Strength Indicator) value is greater than threshold value the link establishment occurs otherwise its repeated the process. Then if its identifies any link failure it recovers ad establish the multicasting route with that identify the shortest path. Finally transmitting the packet.

    1. lgorithm

      For selection of intermediate nodes based upon the combination of SPREAD and NAMP algorithm

      Step1: Initialization of nodes.

      Set two route functions f1 f2

      Step2: Fixing the threshold trust value Ei from 0.5 to 0.7. Step3: Analyze the signal strength.

      Based on weight calculation and Efficiency in collection of data.

      Simulationn Results

      Fig 4 Nodes creation

      Step4: Comparing of signal strength RSSI and quality of nodes.

      If (Ei < RSSI) {

      Return higher attribute


      Else {

      Return lower attribute


      Step 5: Compute the multi cast routing between sender and receiver value (src,dst)

      If (Dist <(src,dst)) { Return next hop.


      Else { Return src.


      Step4: Selection of neighbours.

      All processes in parallel do for timesteps do if route_pkt > threshold then

      hop_count++ end


      //select n pairs of objects S in datasets D DST = Destination

      Fig 3 Enhanced ENAMP Algorithm

      Figure 3 represents the step by step procedure of Enhanced ENAMP .In this for selection of intermediate nodes based upon the combination of SPREAD and NAMP algorithm

      .The algorithm starts with initialization of nodes ad set two route functions named as f1ad f2.the fixing the threshold trust value and analyze then compare and compute the multicast routing finally identify the shortest path and send the packets.

      Fig 5 Establish the routes

      Fig 6 Identify the shortest path

      Fig 7 Establishment of Enhanced ENAMP


      In this paper we proposed efficient multicast routing protocol for mobile adhoc networks named ENAMP(Enhanced Neighbor Awareness of Multicast Routing Protocol) we expect that ENAMP improves the performance of the network by taking less time to transfer the packes from source to destination(s) .The tree based hybrid routing protocol ensures the high robustness and performance for end to end delivery of data packets.We believe that these works will surely improve its performance and reliability.


      1. Aleksi Penttinen, Research Ad hoc network: current activity and future direction,Networking Laboratory,Helinski University of Technology,FIN-02015 Hut,Finland 2002.

      2. Imrich Chlamtac a,Marco Contib,Jennifer J-N.Liuc, Mobile Ad hoc network imperatives and challenges,www.elsevier.com/locate/adhoc networks.2003 13- 64.

      3. Umang Singh Secure routing protocol in mobile Ad hoc network

        – a survey and taxanomy.International Journal of reviews in Computing Sep 2011 Vol:7 IJRIC and LLS E-ISSN 2076-3336.

      4. C.Sreedhar,Dr.S.Madhusudhana Verma,Prof.N.Kasiriswanath A survey an security issues in wireless Ad hoc network routing protocolin IJCSE International Journal on Computer Science and Engineering vol 2,No.02,2010,224-232.

      5. Tanu Preet Singh,Shirani Dua,Vikrant DasEnergy Efficient Routing Protocols in Mobile Ad hoc Networks,in IJAR CSSE International journal of Advanced research in Computer science and Software Engineering vol 2,Issue 1,January 2012 ISSN:2277 128X

      6. G.VijayaKumar,Y.Vasudeva Reddy,Dr.M.Nagendra Current research work on routing protocol for MANET: a Literature surveyIJCSE IJCSE International Journal on Computer Science and Engineering vol 2,No.03,2010,706-713.

      7. Sunil Taneja and Ashwani KushA Survey of Routing Protocols in Mobile Adhoc Networks.International Journal Of Innovation

        ,Management and Technology,vol 1,No.3,August 2010,ISSn 2010-0248.

      8. Arun Kumar Bayga,Siddhartha Gupte,Yogesh Kumar Shukla,Anil Gaikapati Security in Ad hoc networksCS685 Computer Science Department University of Kentucky.

      9. FranckLegendra,Theus Hossmann,Felix Suttan,Bernhard Plattner 30 Years of wireless Ad hoc network research: what about humanties and disaster relief solution what are we still missing? ACWR11 Dec 2011.

      10. Hamza Aldabbag,Tariq Alwadan Helge Janicke,Ali Al.BayattiData Confidentiality in Mobile Adhoc NetworksInternational Journal of Wireless and Mobile Networks(IJWMN) vol 4,No.1 February 2012.

      11. Wenjing louSPREAD:Secure Protocol for Reliable Data DeliveryThesis of Doctors of Philosophy,University of Florida,2003.

      12. Al-Sakib pathan,Muhammad Monowar,Md.Rabbi ,Muhammad Alam and Choong Hong.NAMP Neighbor Aware Multicast Routing Protocol for Mobile Ad hoc Networks.The International Arab journal of Information Technology Vol 5,No.1,January 2008.

      13. Kayi Lee, Hyang-won Lee and Eytan Modiano Reliability in layered networks with random link failures Massachusetts Institute of Technology Cambridge, this work was supported by NSF grants CNS-0626781 and CNS-0830961 and by DTRA grants HDTRA1-07-0004 and HDTRA-09-1-005

      14. Ashikur Rahman,Rawel Gburzynski,Bozena Kaminska Enhanced dominant pruning based broadcasting in untrusted Ad hoc network,at the direction of IEEE Communication Society Subject Matter Expersts for Publication in the ICC 2007 Proceedings.

      15. Gang Xu,eristian Brucea,Liviu IftodeA policy Mechanism for Trusted Adhoc Networksat IEEE Transactions on Dependable and Secure Computing VOl.8,No.3 May June 2011.

      16. pathan A-sk,Alam MM,Monowar MM,Rabbi MF(2004)An Efficient Routing Protocol for Mobile Ad hoc Network with neighbor Awareness and Mulitcasting Proceedings of IEEE E- Tech,july 2004 97-100.

      17. Lim H,Kim C (2000) Multicast tree Construction and Flooding in Wireless Ad hoc Networks,Proceedings of the 3rd ACm International Workshop on Modeling,Analysis and Simulation Of Wireless and mobile Systems 61-68.

Leave a Reply

Your email address will not be published. Required fields are marked *