33 research outputs found

    MPR selection to the OLSR quality of service in MANET using minmax algorithm

    Get PDF
    Optimized link state routing (OLSR) is a routing protocol that has a small delay, low traffic control, support the application of denser networks, and adopts the concept of multipoint relays (MPR). The problem of OLSR is routing table updating which continually causes excessive packet delivery, and energy consumption becomes increased. This article proposes the improvement of OLSR performance using the min-max algorithm based on the quality of service (QoS) with considering the density of the node. The Min-max algorithm works in selecting MPR nodes based on the largest signal range. The QoS parameters analyzed with a different number of nodes are packet delivery ratio (PDR), throughput, delay, energy consumption, and topology control (TC). Simulation result of network simulator version 2 (NS-2) shows that OLSR performance using the min-max algorithm can increase PDR of 91.17%, packet loss of 60.77% and reduce topology control packet of 8.07%, energy consumption of 16.82% compared with standard OLSR

    MANET Network Management and Performance Monitoring for NHDP and OLSRv2

    Get PDF
    Mobile Ad Hoc NETworks (MANETs) are generally thought of as infrastructureless and largely ``un-managed'' network deployments, capable of accommodating highly dynamic network topologies. Yet, while the network infrastructure may be ``un-managed'', monitoring the network performance and setting configuration parameters once deployed, remains important in order to ensure proper ``tuning'' and maintenance of a MANET. This memorandum describes a management framework for the MANET routing protocol OLSRv2, and its constituent protocol NHDP. It does so by presenting considerations for ``what to monitor and manage'' in an OLSRv2 network, and how. The approach developed is based on the Simple Network Management Protocol (SNMP), and thus this paper details the various Management Information Bases (MIBs) for router status monitoring and control -- as well as a novel approach to history-based performance monitoring. While SNMP may not be optimally designed for MANETs, it is chosen due to it being the predominant protocol for IP network management -- and thus, efforts are made in this paper to ``adapt'' the management tools within the SNMP framework for reasonable behavior also in a MANET environment

    Design and Performance Analysis of a Geographic Routing Protocol for Highly Dynamic MANETs

    Get PDF
    Efficient multi-hop routing has become important for airborne telemetry networks. The highly dynamic nature in these scenarios results in short-lived links. Geographic-based routing has an advantage over topology-based routing to make rapid forwarding decisions based on neighbor and destination position. The AeroRP geographic routing protocol is detailed, which uses a heuristic metric for forwarding decisions that takes transmission range and a neighbor's location and velocity into consideration. The main contributions of this work include detailing and finalizing the routing decision metrics, design, and simulation implementation of AeroRP. The analysis of the simulations shows AeroRP has several advantages over other MANET routing protocols and offers tradeoffs for different performance metrics in the form of different AeroRP modes. Specifically, AeroRP yields higher accuracy than all compared routing protocols and various AeroRP modes can be chosen depending on how packet delivery and delay are prioritized

    Routing in multi-hop Ad Hoc networks: an Experimental Approach

    Get PDF
    In this thesis we investigate the efficiency of routing protocols for Mobile Ad Hoc networks (MANETs) by adopting an experimental approach. MANET routing protocols have been mainly evaluated through simulations which often introduce simplifying assumptions (e.g., radio propagation model) and mask important real characteristics. To avoid these modeling approximations, it is necessary to complement simulation with experiments on real MANETs. This work provides a contribution in this direction reporting our experiences learned by these real measurements. By setting up MANET prototypes, firstly we investigate IEEE 802.11 behavior in single­hop MANETs, secondly we focus on an innovative analysis of routing protocols in multi­hop MANETs by varying scenarios. To the best of our knowledge, our medium­scale scenario composed of 23 nodes represents one of the largest MANET testbed. Our experimental results highlight that, in contrast with MANET community, by using proactive routing protocols the overall system gains in scalability, performance and efficiency. These results encourage us identifying in this last class Hazy Sighted Link State (HSLS) as a more suitable protocol. A further contribution of this thesis is hence to design, develop and test an enhanced version of HSLS, strengthened with a mechanism to guarantee the reliability of LSU packets without additional control overhead, and a module to support middleware-network interactions as proposed by the MobileMAN project (EUIST-FP5-FET-Open-IST-2001-38113)

    BATSEN: Modifying the BATMAN Routing Protocol for Wireless Sensor Networks

    Get PDF
    The proliferation of autonomous Wireless Sensor Networks (WSN) has spawned research seeking power efficient communications to improve the lifetime of sensor motes. WSNs are characterized by their power limitations, wireless transceivers, and the converge-cast communications techniques. WSN motes use low-power, lossy radio systems deployed in dense, random topologies, working sympathetically to sense and notify a sink node of the detectable information. In an effort to extend the life of battery powered motes, and hence the life of the network, various routing protocols have been suggested in an effort to optimize converge-cast delivery of sensor data. It is well known that reducing the overhead required to perform converge-cast routing and communications reduces the effects of the primary power drain in the mote, the transceiver. Furthermore, WSNs are not well protected; network security costs energy both in computation and in RF transmission. This paper investigates the use of a Mobile Ad-hoc Networking (MANET) routing protocol known as B.A.T.M.A.N. in WSN. This thesis proposes that the features of B.A.T.M.A.N. in the MANET realm may prove beneficial to the WSN routing domain; and that slight modifications to the routing technique may prove beneficial beyond current protocol technologies. The B.A.T.M.A.N. variant will be compared against the contemporary LEACH WSN routing protocol to discern any potential energy savings

    Efficient Broadcasting in Self-Organizing Multi-Hop Wireless Networks.

    Get PDF
    International audienceMulti-hop wireless networks (such as ad-hoc or sensor networks) consist of sets of mobile nodes without the support of a pre-existing fixed infrastructure. For the purpose of scalability, ad-hoc and sensor networks may both need to be organized into clusters and require some protocols to perform common global communication patterns and particularly for broadcasting. In a broadcasting task, a source node needs to send the same message to all the nodes in the network. Some desirable properties of a scalable broadcasting are energy and bandwidth efficiency, \emph{i.e.}, message retransmissions should be minimized. In this paper, we propose to take advantage of the characteristics of a previous clustered structure to extend it to an efficient and scalable broadcasting structure. In this way, we build only one structure for both operations (organizing and broadcasting) by applying a distributed clustering algorithm. Our broadcasting improve the number of retransmissions as compared to existing solutions

    CROSS-LAYER SCHEDULING PROTOCOLS FOR MOBILE AD HOC NETWORKS USING ADAPTIVE DIRECT-SEQUENCE SPREAD-SPECTRUM MODULATION

    Get PDF
    We investigate strategies to improve the performance of transmission schedules for mobile ad hoc networks (MANETs) employing adaptive direct-sequence spread-spectrum (DSSS) modulation. Previously, scheduling protocols for MANETs have been designed under the assumption of an idealized, narrowband wireless channel. These protocols perform poorly when the channel model incorporates distance-based path loss and co-channel interference. Wideband communication systems, such as DSSS systems, are more robust in the presence of co-channel interference; however, DSSS also provides multiple-access capability that cannot be properly leveraged with a protocol designed for narrowband systems. We present a new transmission scheduling protocol that incorporates link characteristics, spreading factor adaptation, and packet capture capability into scheduling and routing decisions. This provides greater spatial reuse of the channel and better adaptability in mobile environments. Simulation results demonstrate the merits of this approach in terms of end-to-end packet throughput, delay, and completion rate for unicast traffic. We also discuss two variations of the protocol: one provides a method for enhancing the network topology through exchange of local information, and the other leverages multi-packet reception (MPR) capability to enhance the network topology. We show that each approach is useful in networks with sparse connectivity. We conclude by studying the capacity of the networks used in previous sections, providing insight on methods for realizing further performance gains

    Efficient Broadcasting in Self-Organizing Sensor Networks

    Get PDF
    International audienceMulti-hop wireless networks (such as ad-hoc or sensor networks) consist in sets of mobile nodes without the support of a pre-existing fixed infrastructure. For scalability purpose, ad-hoc and sensor networks may both need to be organized into clusters and require efficient protocols to perform common global communication patterns like the broadcasting operation. During a broadcasting task, a source node needs to send a same message to all other nodes in the network. Some desired properties of a scalable broadcasting are energy and bandwidth efficiency, i.e., message retransmissions should be minimized. In this article, we present a scalable broadcasting schemes that takes advantages of the clustering structure. In this way, we only build one structure to perform both self-organization and broadcasting in clusters and in the whole network. It appears that our broadcasting scheme presents the best trade-off between the number of retransmissions and transmitters (for energy saving) and reliability, when compared to existing solutions
    corecore