47 research outputs found

    Improving Energy Efficiency in MANETs by Multi-Path Routing

    Full text link
    Some multi-path routing algorithm in MANET, simultaneously send information to the destination through several directions to reduce end-to-end delay. In all these algorithms, the sent traffic through a path affects the adjacent path and unintentionally increases the delay due to the use of adjacent paths. Because, there are repetitive competitions among neighboring nodes, in order to obtain the joint channel in adjacent paths. The represented algorithm in this study tries to discover the distinct paths between source and destination nodes with using Omni directional antennas, to send information through these simultaneously. For this purpose, the number of active neighbors is counted in each direction with using a strategy. These criterions are effectively used to select routes. Proposed algorithm is based on AODV routing algorithm, and in the end it is compared with AOMDV, AODVM, and IZM-DSR algorithms which are multi-path routing algorithms based on AODV and DSR. Simulation results show that using the proposed algorithm creates a significant improvement in energy efficiency and reducing end-to-end delay

    AOMDV with Load Balanced as an Improvement to AOMDV Protocol

    Get PDF
    MANETs are one of the most challenging and growing research field because of their demand and challenges in providing services because of its dynamic nature. Load balancing is one of the key problems in MANETs as load balancing in network is essential for better lifetime of network, Qos, congestion control. The proposed approach in the research emphasises on the stability of the paths and distributing the traffic in the network based on the energy of the nodes. The simulations were performed in NS2. The results shows that the proposed algorithm was able to achieve batter packet delivery ratio and throughput without increasing the overhead in the network, The proposed algorithm also managed to consume a balanced energy from all the nodes in the network

    MINIMIZATION OF DATA REPLICA IN MOBILE ADHOC NETWORK ROUTING

    Get PDF
    Adhoc networks have characteristics such as flexibility ,easy deployment,robustness which makes them an intersresting technology for various applications.Adhocnetworks are considered as the most promising terminal networks in future mobile communications.A novel Position based Opportunistic Routing protocol, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. In this way, all candidates receives the packet, the data transmission will not be interrupted. Potential multi-paths are exploited on the-fly on a per-packet basis. We propose minimization of data replica at forwarding candidates in Mobile Adhoc network routing.The forwarding candidates will be ranking ,based on the location variance of candidate within the time factor has given to it

    Implementation of Congestion Awareness and Adaptivity in Mobile Ad Hoc Networks

    Get PDF
    Congestion in mobile ad hoc networks leads to transmission delays and packet losses and causes wastage of time and energy on recovery. In the current designs, routing is not congestion adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. Routing should not only be aware of, but also be adaptive to, network congestion. Routing protocols which are adaptive to the congestion status of a mobile ad hoc network can greatly improve the network performance. Many protocols which are congestion aware and congestion adaptive have been proposed. In this paper, we present a survey of congestion adaptive routing protocols for mobile ad hoc networks. Ad hoc networks consist of independent self-structured nodes. Nodes utilize a wireless medium for exchange their message or data, as a result two nodes can converse in a straight one to one connection if and only if they are within every other?s transmit range

    Reducing Buffer Space in Multipath Schemes

    Get PDF
    One major drawback of multipath transferring schemes, which is inspired by the usage of different paths with diverse delays, is the emergence of reordering among packets of a flow. This reordering brings some substantial problems (like larger delay and buffer space) to the transport applications. In this paper, we present a novel UDP-based multipath scheme for in-order delivery to the receiver by scheduling of packets among multiple paths. This method imposes the minimum possible delay and a small buffer space on the receiver’s application. We theoretically prove the optimality of the proposed method. Finally, through simulation experiments, we show that the performance of our multipath method is comparable with the best-case one-path transmission with aggregated bandwidth

    JADE: Jamming-Averse Routing on Cognitive Radio Mesh Networks

    Get PDF
    Abstract-The spectrum sensing capability of cognitive radio (CR) enables a lot of opportunities to wireless networks, but also enables intelligent attacks by malicious players. One attack in this category is reactive jamming, in which the attacker senses the wireless spectrum, decodes parts of packets, and selectively interferes with with packets. In so doing, an attacker can reduce energy expenditure and increase stealth while maintaining a high impact. Of the approaches to mitigate jamming, in this work, we focus on the jamming resilient routing in CR mesh networks. To do this we use signal-to-noise-interference ratio (SINR) which reflects the jamming impact. This metric is difficult to measure with commodity radio chipsets that cannot differentiate jamming interference from the received signal. Detecting SINR becomes even harder if reactive jamming is used by an attacker. In this study, we develop a mechanism to estimate SINR under reactive jamming. The estimated SINR information of each wireless link is then used to determine the jamming-averse directivity (JAD) of packets, which improves the routing performance of the victim network. We validate the proposed mechanism with a simulation study, showing that the proposed JAD escorted (JADE) routing dramatically improves routing path discovery performance including path discovery probability, path length, elapsed time for path discovery, retransmission attempts, and path quality under reactive jamming. Among the 200 route requests at 10 different configurations in our simulation, the reactive jammer disrupts the 77.5% of total requests. However, our JADE routing decreases the route discovery failure rate to 7.5% by saving the 96.7% of failed requests

    Fault-Tolerant Routing in Mobile Ad Hoc Networks

    Get PDF

    IMPROVING ENERGY EFFICIENCY IN MANETS BY MULTI-PATH ROUTING

    Get PDF
    Some multi-path routing algorithm in MANET, simultaneously send information to the destination through several directions to reduce end-to-end delay. In all these algorithms, the sent traffic through a path affects the adjacent path and unintentionally increases the delay due to the use of adjacent paths. Because, there are repetitive competitions among neighboring nodes, in order to obtain the joint channel in adjacent paths. The represented algorithm in this study tries to discover the distinct paths between source and destination nodes with using Omni directional antennas, to send information through these simultaneously. For this purpose, the number of active neighbors is counted in each direction with using a strategy. These criterions are effectively used to select routes. Proposed algorithm is based on AODV routing algorithm, and in the end it is compared with AOMDV, AODVM, and IZM-DSR algorithms which are multi-path routing algorithms based on AODV and DSR. Simulation results show that using the proposed algorithm creates a significant improvement in energy efficiency and reducing end-to-end delay
    corecore