10,250 research outputs found

    Advancing the Potential of Routing Protocol in Mobile Ad Hoc Network

    Get PDF
    An ad hoc network consists of nodes with a radio without wire which has multi hop network surroundings [3]. Their messages can be sent anywhere with the help of intermediate nodes only in limits. Broadcasting is mobile ad hoc networks (MANET) is process to send message one to other nodes of the network [1]. It has far-reaching application in mobile ad hoc networks (MANET). It provides significant control and route administration for all types protocols let it be unicast or multicast protocols. It has become an important and all above to find a strong routing protocol in networking research. MANET has important part like as D.S.R., A.O.D.V. for routing information and location routing are used to established routes [5]. There are many problems in broadcasting of MANETS due to reasons like; Variable and unpredictable characteristics, Fluctuation of Strength, Channel Contention problem and Packet Collision problem [4]. The study had been done to cop up these problems on neighbor coverage based protocol to reduce routing overhead in MANETS. The connectivity factor was also discussed to arrange neighbor coverage system to provide to density adaptation [7]. AODV protocol can be played an important role in optimizing mechanism. This paper presented and completed on new type of rebroadcasting with many performance metrics it is done while using NS-2 Simulator [9]

    A review and comparison of efficient flooding schemes for on-demand routing protocols on mobile ad hoc networks (MANETs)

    Get PDF
    Since the basic components of ad hoc wireless networks are mostly battery-operated portable devices, power conservation is one of the central issues of such networks. Power-conservative designs for ad hoc networks pose many challenges due to the lack of central coordination facilities. Existing on-demand routing protocols perform route discovery by flooding the network with a query message requesting a route to the destination. Flooding is used because of its simplicity and greater success in finding the best route between the source and destination available at that time of route discovery. However, as flooding involves querying all reachable network nodes, frequent flooding can rapidly deplete the energy reserved at each node. In addition to consuming significant portions of the available network bandwidth. Further, as the number of communicating nodes increases, more congestion, contention, and collisions can be expected. This paper reviews and compares approaches for optimizing bandwidth efficiency of route discovery, where several efficient flooding schemes have been presented based on different techniques to solve the problems related with the traditional blind flooding

    Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols

    Full text link
    In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varying rates of mobility and density of nodes in the underlying wireless network
    corecore