Analisis Kinerja Protokol Routing AODV, DSR, dan OLSR pada Mobile Ad hoc Network Berdasarkan Parameter Quality of Service

MANET is autonomous, self-configured, and applicable to emergency locations such as forest fires, earthquakes, floods, and health monitoring. However, challenges and difficulties faced by the mobile ad-hoc network (MANET) is a dynamically built network system, without the support of infrastructure in communicating between one node and other nodes, and limited energy sources. To overcome MANET problems and to obtain optimal network quality, the selections of routing protocols and quality of service (QoS) are significant in MANET design. This study aims to analyze the performance of routing protocols: dynamic source routing (DSR), ad-hoc on demand distance vector (AODV) and optimized link state routing (OLSR) based on QoS. The analyzed QoS parameters include packet delivery ratio (PDR), packet loss, throughput, and delay. Simulation results using network simulator version based on the number of node densities indicate that OLSR has better performance compared to AODV and DSR regarding PDR, packet loss, throughput, and delay

Multipath optimized link state routing for mobile ad hoc networks

International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MP-OLSR (MultiPath OLSR), is a multipath routing protocol based on OLSR. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints

TDMAとDCFの組み合わせによるアドホックネットワーク上でのQoS通信の実現方式

　An ad hoc network does not rely on the fixed network infrastructure; it uses a distributed network management method. With the popularity of the smart devices, ad hoc network has received more and more attention, supporting QoS in ad hoc network has become inevitable. Many researches have been done for provision of QoS in ad hoc networks. These researches can be divided into three types.　The first type is contention-based approach which is the most widely used. IEEE 802.11e MAC (media access control) protocol belongs to this type which is an extension of IEEE 802.11 DCF(Distributed Coordination Function). It specifies a procedure to guarantee QoS by providing more transmission opportunities for high priority data. However, since IEEE 802.11eis designed based on the premise that access points are used, when the number of QoS flows increases, packet collisions could occur in multi-hop ad hoc network.　The second type is using TDMA-based approach. The TDMA approach can provide contention-free access for QoS traffics through the appropriate time slot reservation. The current TDMA approaches reserve time slots for both QoS traffics and best-effort traffics. However, it is difficult for TDMA as the only approach to allocating channel access time for best-effort traffics sincet he required bandwidth of the best-effort traffics changes frequently.　We propose a QoS scheme, which takes advantage of both contention-based approach and TDMA-based approach. In the proposed scheme, contention-based approach DCF provides easy and fair channel time for best-effort traffics, and TDMA approach serves the QoS traffics. A time frame structure is designed to manage the bandwidth allocation. A time frame is divided into two periods, specifically the TDMA periods and the DCF periods. The proportion of two periods is decided by QoS traffics. Therefore the QoS traffics are given absolutely higher priority than best-effort traffics. In order to guarantee the transmission of each QoS packet in TDMA period, a time slot assignment algorithm based on QoS data rate has been proposed. The proposed scheme also employs an admission control scheme, which rejects the new QoS user when the channel capacity is reached. In addition, we provide the configuration of the proposed scheme in the mobile environment. The procedures are designed for route changes and new-adding users. 　The proposed scheme is simulated in the QualNet simulator. In the static environment, the performance of the proposed scheme is evaluated in the case of a gradual increase in the number TCP flows and in the case of gradual increase in QoS data rate. Simulation results show that in the static environment the proposed scheme can not only provide effective QoS performance, but also can provide good support for best-effort flows. In the mobile environment, we simulated the performance of the proposed scheme at different moving speed (maximum is 5 Km/h) when the ARF (Auto Rate Fallback) is available. From the simulation results, in a specific mobile environment, the proposed scheme can support the QoS transmission well.電気通信大学201

Predicting topology propagation messages in mobile ad hoc networks: The value of history

This research was funded by the Spanish Government under contracts TIN2016-77836-C2-1-R,TIN2016-77836-C2-2-R, and DPI2016-77415-R, and by the Generalitat de Catalunya as Consolidated ResearchGroups 2017-SGR-688 and 2017-SGR-990.The mobile ad hoc communication in highly dynamic scenarios, like urban evacuations or search-and-rescue processes, plays a key role in coordinating the activities performed by the participants. Particularly, counting on message routing enhances the communication capability among these actors. Given the high dynamism of these networks and their low bandwidth, having mechanisms to predict the network topology offers several potential advantages; e.g., to reduce the number of topology propagation messages delivered through the network, the consumption of resources in the nodes and the amount of redundant retransmissions. Most strategies reported in the literature to perform these predictions are limited to support high mobility, consume a large amount of resources or require training. In order to contribute towards addressing that challenge, this paper presents a history-based predictor (HBP), which is a prediction strategy based on the assumption that some topological changes in these networks have happened before in the past, therefore, the predictor can take advantage of these patterns following a simple and low-cost approach. The article extends a previous proposal of the authors and evaluates its impact in highly mobile scenarios through the implementation of a real predictor for the optimized link state routing (OLSR) protocol. The use of this predictor, named OLSR-HBP, shows a reduction of 40–55% of topology propagation messages compared to the regular OLSR protocol. Moreover, the use of this predictor has a low cost in terms of CPU and memory consumption, and it can also be used with other routing protocols.Peer ReviewedPostprint (published version